Abstract
A novel, parallel and compact design for phased binary coding is described. Such an algorithm is widely used in dictionary-based lossless data compression and permits more efficient coding of dictionary references during dictionary growth. Parallelism within the algorithm is exploited to reduce the critical path while still maintaining a low gate count.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: IEE Proceedings - Circuits, Devices and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
