A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
From MaRDI portal
Publication:2271490
DOI10.1016/j.jfranklin.2007.06.002zbMath1176.94077OpenAlexW1989110396MaRDI QIDQ2271490
Publication date: 7 August 2009
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2007.06.002
Related Items (5)
Parametric inverse of severely ill-conditioned Hermitian matrices in signal processing ⋮ Linear-constant log-map, a fast accurate algorithm for map decoding ⋮ Improved equalization and joint iterative detection ⋮ On the linear combination, product and ratio of normal and Laplace random variables ⋮ A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for finding the distribution of maximal entropy
- Maximum entropy: Clearing up mysteries
- A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
- New performance bounds for turbo codes
- Analytic Expressions for the Bit Error Probabilities of Rate-<tex>$1/2$</tex>Memory<tex>$2$</tex>Convolutional Encoders
- Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
- Design of capacity-approaching irregular low-density parity-check codes
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- Analyzing the turbo decoder using the Gaussian approximation
This page was built for publication: A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
