A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
Authors:
- Ali AbediAAAli Abedi
- Amir K. KhandaniAKAmir K. Khandani
- 1 January 2008
- journal article
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 345 (1) , 60-74
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Analytic Expressions for the Bit Error Probabilities of Rate-$1/2$Memory$2$Convolutional EncodersIEEE Transactions on Information Theory, 2004
- Iterative turbo decoder analysis based on density evolutionIEEE Journal on Selected Areas in Communications, 2001
- Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrumIEEE Transactions on Information Theory, 2000
- Estimation based on entropy matching for generalized Gaussian PDF modelingIEEE Signal Processing Letters, 1999
- New performance bounds for turbo codesIEEE Transactions on Communications, 1998
- An investigation of Gaussian tail and Rayleigh tail density functions for importance sampling digital communication system simulationIEEE Transactions on Communications, 1990
- On the Application of Importance Sampling to BER Estimation in the Simulation of Digital Communication SystemsIEEE Transactions on Communications, 1987
- On the Application of Importance Sampling to the Simulation of Digital Satellite and Multihop LinksIEEE Transactions on Communications, 1984
- A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication SystemsIEEE Transactions on Communications, 1980
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974