Sign In
Create Account
Follow Us on Twitter
Subscribe on Youtube
2
Has anyone ever implemented the Huffman algorithm in x86 assembly? I'm interested in getting the footprint of the object code down to less than several hundred bytes. I'm writing a custom boot loader that fits into the MBR of a drive, and I have several strings I need to compress to save space.
Just curious if this has been done before so I don't have to reinvent the wheel.
2 replies to this topic
#1
Posted 21 March 2011 - 07:28 AM
gregwarner
-
- Members
-
- 848 posts
Programming God
- Location:Arkansas
Back to top|
|
|
#2
Posted 25 March 2011 - 12:02 AM
Alexander
-
- Moderators
-
- 4,118 posts
It's Science!
- Location:Vancouver, Eh! Cleverness: 200
It could be a wild shot, but that was used for very widely used video compression algorithms, have you looked at some open source projects (video capturing, transcoding) that contain a small Huffman library suitable for your project?
Be sure to read the updated FAQ! || Health is achieved through the same 10,000 steps.
If a suggested code/method fails, informing us is less important than telling us why or what errors occurred.
If a suggested code/method fails, informing us is less important than telling us why or what errors occurred.
#3
Posted 25 March 2011 - 06:17 AM
gregwarner
-
- Members
-
- 848 posts
Programming God
- Location:Arkansas
I haven't yet, but I definitely will. Thanks for the tip.
Hofstadter's Law: It always takes longer than you expect, even when you take into account Hofstadter's Law.
– Douglas Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users
