Sorry, you need to enable JavaScript to visit this website.

This paper designs a Distributed Arithmetic Coding (DAC) decoder using the depth- first search method. In addition, a method is proposed to control the decoder complexity. Simulation results compare the DFD with the traditional Breadth-First Decoder (BFD)
showing that under the same complexity constraints, the DFD outperforms the BFD when the code length is not too long and the quality of side information is not too poor.

Categories:
29 Views