Sequential Decoding Algorithm of Arithmetic Code with Forbidden Symbols

How to detect error efficiently and how to construct decoding tree are two key problems in the study of error correction of arithmetic code. In this paper, multiple forbidden symbols are used in arithmetic code to provide quick and efficient error detection capability. The combination of sequential decoding with reduced branch points of decoding tree is a significant method to improve the error correction performance of arithmetic code while reducing the complexity of sequential decoding. The simulation result shows that, under the same packet error rate, the multiple forbidden symbols outperforms 0.5 dB than single forbidden symbol in error correction. And under the fixed length of data packet, how to select the redundancy of forbidden symbol is highly related to the size of stack of sequential decoding, so the joint optimization is the best way to achieve the best performance.