
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm, can be applied directly on the trellis. The finite state machine interpretation can be easily migrated to Markov source case. We can encode Markov sources without considering the conditional probabilities, while using the list Viterbi decoding algorithm which utilizes the conditional probabilities. We can also use context-based arithmetic coding to exploit the conditional probabilities of the Markov source and apply a finite state machine interpretation to this problem. The finite state machine interpretation also allows us to more systematically understand arithmetic codes with forbidden symbols. It allows us to find the partial distance spectrum of arithmetic codes with forbidden symbols. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes. The low implementation precision results in a state machine with less complexity. The introduced input memories allow us to switch the probability functions used for arithmetic coding. Combining these two methods give us a huge parameter space of the arithmetic codes with forbidden symbols. Hence we can choose codes with better distance properties while maintaining the encoding efficiency and decoding complexity. A construction and search method is proposed and simulation results show that we can a
This monograph proposes a novel interpretation of arithmetic codes with forbidden symbols, modeling them as finite state machines and variable-length trellis codes. The authors, a distinguished group of researchers in communications and signal processing, leverage this interpretation to apply techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm. This approach simplifies the encoding of Markov sources and allows for a more systematic understanding of arithmetic codes, including the determination of their partial distance spectrum. The work also introduces arithmetic codes with memories, which balance high memory utilization with low implementation precision, offering a vast parameter space for selecting codes with superior distance properties while managing encoding efficiency and decoding complexity.
This monograph offers a deep dive into advanced coding theory, specifically focusing on arithmetic codes and their novel interpretations. The authors present a rigorous mathematical framework, suggesting that the proposed finite state machine approach and the application of list Viterbi decoding can lead to more efficient and complex-controllable coding schemes. The work is likely to be of significant interest to researchers and engineers in digital communications and signal processing who are seeking to optimize data transmission and storage.
Page Count:
79
Publication Date:
2006-01-01
Publisher:
Springer International Publishing
ISBN-10:
8303101676
ISBN-13:
9788303101679
No comments yet. Be the first to share your thoughts!