A measure for the missed error detection probability for optimizing the forbidden symbol configuration in joint source-channel arithmetic codes
Hossein Kourkchi, William E. Lynch, M. Omair Ahmad · 2016
In joint source-channel arithmetic coding, a forbidden symbol (FS) is added to the symbol set to make it more robust against transmission errors. By splitting the interval occupied by the FS into subintervals, various configurations are possible. In this paper, the delay probability function (DPF), the probability of the number of bits required to detect an error, is calculated for various FS configurations. A figure of merit is also proposed for optimizing the FS configuration. It determines the probability of missed error detection (PMD). Simulations are carried out by employing a breadth-first suboptimal sequential MAP. The simulation results show the effectiveness of the proposed figure of merit, and support the FS configuration in which the FS interval lies entirely between the other information carrying symbols to be the best.