Title :
A practical binary “bit stuffing” method for multiplierless arithmetic encoders
Author :
Sada, Gilberto I. ; Usevitch, Bryan
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas Univ., El Paso, TX, USA
Abstract :
Arithmetic encoding exhibits the “carry over” problem due to addition operations in its finite precision registers. An approach to solve the carry over problem is known as “bit stuffing.” A practical bit stuffing detection procedure is presented. The method is simple, fast, and suitable for a hardware implementation
Keywords :
arithmetic codes; data compression; decoding; digital arithmetic; encoding; binary bit stuffing method; bit stuffing detection procedure; finite precision registers; lossless data compression; multiplierless arithmetic encoders; Decoding; Digital arithmetic; Encoding; Hardware; Registers;
Conference_Titel :
Circuits and Systems, 1999. 42nd Midwest Symposium on
Conference_Location :
Las Cruces, NM
Print_ISBN :
0-7803-5491-5
DOI :
10.1109/MWSCAS.1999.867805
