Fast performance estimation of block codes

R. Srinivasan, N. Wang

    Research output: Contribution to journalArticleAcademicpeer-review

    3 Citations (Scopus)
    61 Downloads (Pure)

    Abstract

    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.
    Original languageUndefined
    Article number10.1109/TCOMM.2008.040674
    Pages (from-to)369-377
    Number of pages9
    JournalIEEE Transactions on Communications
    Volume56
    Issue number4952/3
    DOIs
    Publication statusPublished - 1 Mar 2008

    Keywords

    • IR-64710
    • METIS-250941
    • EWI-12252

    Cite this

    Srinivasan, R., & Wang, N. (2008). Fast performance estimation of block codes. IEEE Transactions on Communications, 56(4952/3), 369-377. [10.1109/TCOMM.2008.040674]. https://doi.org/10.1109/TCOMM.2008.040674