Fast performance estimation of block codes

Share/Save/Bookmark

Srinivasan, Rajan and Wang, Nuo (2008) Fast performance estimation of block codes. IEEE Transactions on Communications, 56 (3). pp. 369-377. ISSN 0090-6778

[img]
Preview
PDF
506Kb
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.
Item Type:Article
Copyright:© 2008 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64710
Official URL:http://dx.doi.org/10.1109/TCOMM.2008.040674
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 250941