DocumentCode
3146044
Title
Multibit decoding/encoding of binary codes using memory based architectures
Author
Mukherjee, Amar ; Bheda, Hemant ; Bassiouni, M.A. ; Acharya, Tinku
Author_Institution
Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
fYear
1991
fDate
8-11 Apr 1991
Firstpage
352
Lastpage
361
Abstract
The authors present new memory based architectures for the design of special purpose hardware for real-time compression and decompression of data. The decode/encode tree of any binary code is mapped on to a memory device that corresponds to simultaneous decoding/encoding of multiple bits. The hardware is programmable and adaptable and yields a high compression rate. Using 1 μm CMOS process technology, this could lead easily to over 100 Mbit/s compression rate for the JPEG baseline compression scheme. Associated with the memory map, a new binary string alignment problem called the contiguous binary superstring is formulated and a heuristic algorithm is developed to solve it. An efficient algorithm for this problem is posed as an open question
Keywords
CMOS integrated circuits; binary sequences; data compression; decoding; encoding; integrated memory circuits; memory architecture; problem solving; real-time systems; CMOS process technology; binary codes; binary string alignment; compression rate; contiguous binary superstring; decode/encode tree; heuristic algorithm; memory based architectures; real-time compression and decompression of data; simultaneous decoding/encoding of multiple bits; Binary codes; Binary trees; Computer architecture; Data compression; Decoding; Encoding; Hardware; Image coding; Memory architecture; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1991. DCC '91.
Conference_Location
Snowbird, UT
Print_ISBN
0-8186-9202-2
Type
conf
DOI
10.1109/DCC.1991.213345
Filename
213345
Link To Document