Fast performance estimation of block codes

Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discreteand continuous-mixture probability densities are motivated and used for this application. These mixtures are employed in concert with the so-called g-method, which is a conditional importance sampling technique that more effectively exploits knowledge of underlying input distributions. For performance estimation, the emphasis is on bit by bit maximum a-posteriori probability decoding, but message passing algorithms for certain codes have also been investigated. Considered here are single parity check codes, multidimensional product codes, and briefly, low-density parity-check codes. Several error rate results are presented for these various codes, together with performances of the simulation techniques.

• Type: Journal
• Year: 2008
• Where: TCOM
• Authors: Rajan Srinivasan, Nuo Wang
• Keywords: Continuous-mixture Probability Densities, Low-density Parity-check Codes, Performance Estimation, TCOM 2008