Efficient LLR Calculation for Non-Binary Modulations over Fading Channels

@article{Yazdani2010EfficientLC,
  title={Efficient LLR Calculation for Non-Binary Modulations over Fading Channels},
  author={Raman Yazdani and Masoud Ardakani},
  journal={IEEE Transactions on Communications},
  year={2010},
  volume={59},
  pages={1236-1241}
}
Log-likelihood ratio (LLR) computation for non-binary modulations over fading channels is complicated. A measure of LLR accuracy on asymmetric binary channels is introduced to facilitate good LLR approximations for non-binary modulations. Considering piecewise linear LLR approximations, we prove convexity of optimizing the coefficients according to this measure. For the optimized approximate LLRs, we report negligible performance loss compared to true LLRs. 

Figures and Tables from this paper

Piecewise linear LLR approximation for non-binary modulations over Gaussian channels with unknown noise variance

This paper considers the problem of finding good approximate LLRs for the additive white Gaussian noise channel under non-binary modulations when the noise variance is unknown at the receiver and proposes piecewise linear LLR approximating functions that perform extremely close to exact LLRs.

Low-Complexity Channel-Likelihood Estimation for Non-Binary Codes and QAM

It is shown that the proposed approximation greatly simplifies the calculation of channel-likelihoods and yet provides results close to those based on exact calculations for non-binary low-density parity-check codes over the additive white Gaussian noise channel.

LLR Approximation for Wireless Channels Based on Taylor Series and its Application to BICM With LDPC Codes

It is shown that the proposed approximation greatly simplifies the calculation of channel LLRs, and yet provides results almost identical to those based on the exact calculation of channels LLRs.

LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes

It is shown that the proposed approximation greatly simplifies the calculation of channel LLRs, and yet provides results almost identical to those based on the exact calculation ofChannel log-likelihood ratio (LLR).

Low complexity piecewise linear LLR calculation for MIMO-BICM systems

An LLR approximation method for MIMO-BICM systems is proposed and piecewise linear approximation functions are introduced and an accuracy measure is provided to optimize the parameters.

LLR Approximation for Fading Channels Using a Bayesian Approach

A Bayesian approach based on conjugate prior analysis is proposed to derive LLR values that only uses moments of order one and two associated with the random fading coefficients, showing to be a more robust method compared to the best existing approximations.

LLR calculation for iterative decoding on fading channels using Padé approximation

A new LLR approximation using Padé approximation, which expresses the original function by rational form of two polynomials with the same total number of coefficients of the Taylor series, accelerates the Taylor approximation, is devised and is shown to be effective.

Log-Likelihood Ratio Calculation for Iterative Decoding on Rayleigh Fading Channels Using Padé Approximation

A new LLR approximation using Pade approximation, which expresses the original function by a rational form of two polynomials with the same total number of coefficients of the Taylor series and can accelerate the Taylor approximation, is devised.

Low Complexity Max-log LLR Computation for Nonuniform PAM Constellations

This letter derives a low-complexity method for demodulating nonuniform PAM signals and devise a demodulation algorithm that has complexity O (log2 M) as opposed to O (M) for the exhaustive search.

On the LLR Metrics for DPSK Modulations Over Two-Symbol Observation Intervals for the Flat Rician Fading Channel

  • H. YuanP. Kam
  • Computer Science
    IEEE Transactions on Communications
  • 2015
The fundamental principles of LLR computation are presented, emphasizing the importance of selecting the appropriate metric for iterative decoding over fading channels, and a simple approximate LLR metric based on the generalized likelihood ratio test (GLRT), which requires only the information of the noise spectral density.

References

SHOWING 1-10 OF 28 REFERENCES

Log-likelihood ratio (LLR) conversion schemes in orthogonal code hopping multiplexing

Log-likelihood ratio (LLR) conversion schemes are proposed to reduce the effect of perforations that occur in orthogonal code hopping multiplexing (OCHM), which was previously proposed to accommodate

Linear LLR approximation for iterative decoding on wireless channels

A measure of accuracy for the approximate LLRs based on their probability density function is introduced and it is shown that this measure provides a very convenient tool for finding good approximateLLRs.

Bit-interleaved coded modulation

The goal of this paper is to present in a comprehensive fashion the theory underlying bit-interleaved coded modulation, to provide tools for evaluating its performance, and to give guidelines for its design.

Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input

It is proved that under a set of mild conditions, the pdf of the bit LLR of a specific bit position is independent of the transmitted codeword.

Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels

Simulated performance of the optimized irregular LDPC codes and turbo codes on a land mobile channel and the results indicate that at a block size of 3072, irregularLDPC codes can outperform turbo codes over a wide range of mobile speeds.

Bit-interleaved coded modulation

A unified theory of bit-interleaved coded modulation is presented, tools for performance analysis and guidelines for its design are given.

Log-likelihood values and Monte Carlo simulation - some fundamental results

It is proved that the pdf of LLR values is exponential symmetric and it is demonstrated that soft-decision simulation outperforms conventional bit error rate simulations with respect to accuracy and/or simulation time.

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit

Improved algorithms are developed to construct good low-density parity-check codes that approach the Shannon limit very closely, especially for rate 1/2.

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

By using the Gaussian approximation for message densities under density evolution, the sum-product decoding algorithm can be visualize and the optimization of degree distributions can be understood and done graphically using the visualization.

LDPC code design considerations for non-uniform channels

It is shown that under non-optimal decoding or when the maximum degree allowed in the code is small, allotted codes significantly outperform conventional ones.