Error recovery properties and soft decoding of quasi-arithmetic codes

Simon Malinowski (1) , Hervé Jégou (1) , Christine Guillemot (1)

1 TEMICS - Digital image processing, modeling and communication

This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA) codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter controls the tradeoff between decoding performance and complexity. It is shown that close-to-optimal decoding performance can be obtained with low values of the aggregation parameter, that is, with a complexity which is significantly reduced with respect to optimal QA bit/symbol models. The choice of the aggregation parameter depends on the synchronization recovery properties of the QA codes. This paper thus describes a method to estimate the probability mass function (PMF) of the gain/loss of symbols following a single bit error (i.e., of the difference between the number of encoded and decoded symbols). The entropy of the gain/loss turns out to be the average amount of information conveyed by a length constraint on both the optimal and aggregated state models. This quantity allows us to choose the value of the aggregation parameter that will lead to close-to-optimal decoding performance. It is shown that the optimum position for the length constraint is not the last time instant of the decoding process. This observation leads to the introduction of a new technique for robust decoding of QA codes with redundancy which turns out to outperform techniques based on the concept of forbidden symbol.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Simon Malinowski, Hervé Jégou, Christine Guillemot. Error recovery properties and soft decoding of quasi-arithmetic codes. EURASIP Journal on Advances in Signal Processing, 2008, 2008, ⟨10.1155/2008/752840⟩. ⟨inria-00318620⟩