High-speed arithmetic coder/decoder architectures
Gireesh Shrimali, Keshab K. Parhi · IEEE International Conference on Acoustics Speech and Signal Processing · 1993
The design of fast decoders using a novel interval tree search method is presented. The decoder can be modeled as a FSM (finite state machine), enabling the application of the look-ahead technique to achieve higher speeds. The look-ahead approach leads to slight degradation in performance, in terms of the adder/subtractor delay in the coder/decoder due to increased word lengths. The performance of the decoder is improved by using redundant arithmetic. The tree search method combined with redundant arithmetic and look-ahead leads to desired speedups without any degradation in performance.>