Abstract:
The paper described an optimal search based and a heuristic search based decoding algorithm for arithmetic codes and compared their performance and complexity with the tr...Show MoreMetadata
Abstract:
The paper described an optimal search based and a heuristic search based decoding algorithm for arithmetic codes and compared their performance and complexity with the traditional "hard" bit based AC decoder. To approach a different error resilient AC decoding, a heuristic search algorithms (HSAs) in artificial intelligence for finding the minimal-weight path through directed and nonnegatively-weighted graphs is utilized when the bitstream is transmitted over error prone channels. Simulation results showed that both algorithms easily outperformed traditional "hard" bits based arithmetic decoder, while the heuristic search based algorithm achieved a very good tradeoff between performance and complexity.
Published in: Data Compression Conference, 2004. Proceedings. DCC 2004
Date of Conference: 23-25 March 2004
Date Added to IEEE Xplore: 24 August 2004
Print ISBN:0-7695-2082-0
Print ISSN: 1068-0314