Performance analysis of coded modulation with generalized selection combining in rayleigh fading

Chindapol, A.; Ritcey, J.A.

doi:10.1109/tcomm.2003.815064

Cited by 7 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Term-by-term Correctionsmentioning

confidence: 99%

“…The transfer-function bounds in (14) and (17) are looser than the union bound (13), but the former are amenable to exact evaluation whereas the latter is not. A closedform expression with accuracy closer to that of the union bound can be obtained by replacing the summands in (14) or (17) for a finite subset of the error events with the exact closed-form pairwise error-event probability expressions for those error events. This "term-by-term correction" [22] of the transfer-function bound has been applied previously to transfer-function bounds using standard Chernoff bounds on the pairwise error-event probability for exponentially correlated Rician fading and non-coherent communications [23].…”

Section: Term-by-term Correctionsmentioning

confidence: 99%

“…where ( / 0 , ) is determined by the particular geometricform bound used for the pairwise error-event probability. The use of (8) and the result of Theorem 2 result in the transferfunction bound (17) with…”

Section: B Integral Boundsmentioning

confidence: 99%

“…This computational burden can be largely eliminated for exponentially correlated Rayleigh fading by using a somewhat weaker correction to the transfer-function bound. By Theorem 7, a looser term-by-term correction is obtained by replacing each summand in (14) or (17) for a finite subset of the error events with the pairwise error-event probability for the minimum-spacing error event of the same Hamming weight. Applying this approach to (14) for term-by-term correction for the error events of weights through results in ≤ 1 2…”

Section: Term-by-term Correctionsmentioning

confidence: 99%

See 3 more Smart Citations

New closed-form bounds on the performance of coding in correlated Rayleigh fading

Hutchenson

Noneaker

2009

IEEE Trans. Commun.

View full text Add to dashboard Cite

New, simple bounds are presented for the probability of error in a binary hypothesis test for communications using diversity signaling in correlated Rayleigh fading. The bounds are developed in the context of pairwise error-event probabilities in decoding an error-correction code. A long-standing conjecture regarding the form of worst-case error events in exponentially correlated Rayleigh fading is also proven. The utility of the results is illustrated by their application to transfer-function bounds on the probability of bit error for a system using a convolutional code. The closed-form transfer-function bounds are shown to be tighter than previously developed transfer-function bounds for communications in exponentially correlated Rayleigh fading.

show abstract

Section: Term-by-term Correctionsmentioning

confidence: 99%

Section: Term-by-term Correctionsmentioning

confidence: 99%

Section: B Integral Boundsmentioning

confidence: 99%

Section: Term-by-term Correctionsmentioning

confidence: 99%

See 2 more Smart Citations

New closed-form bounds on the performance of coding in correlated Rayleigh fading

Hutchenson

Noneaker

2009

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…In addition, by assuming a random labeling map for the bits, a symmetric bit channel model is obtained to simplify the analysis. Numerical results based on this approach can be found in [6] for convolutional codes. Though this model is adequate to obtain capacity related measures for asymptotically large block lengths, it is desirable to compute the performance measures for finite block lengths.…”

Section: Introductionmentioning

confidence: 99%

On performance evaluation of BICM with non-ideal bit interleaving

Sayana

Gelfand

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

This paper outlines an efficient approach to evaluate the performance of bit interleaved coded modulation (BICM) systems. Most of the approaches suggested so far evaluate the probability of individual pairwise error events and obtain an union bound to the bit error probability. This gives very tight bounds on performance for SNR's above cutoff rate for BPSK modulation. However, for higher order modulation systems, the number of bit errors in a symbol slot depend on the exact two modulated symbols involved in an error event and the linearity of the code cannot be extended to include the modulator. The performance is usually approximated by a few dominant error events which is applicable to AWGN channels. Some approaches consider infinite depth interleaving to obtain a simplified linear model. In this paper, we study the evaluation and convergence of union bounds for fading channels with finite code block sizes. We develop a general approach which assumes an ideal model for the modulator and enables us to extend the linearity of the considered codes to simplify the computation. This enables us to analyze the performance of concatenated codes with an interleaver of finite length. The approach also gives greater insight into the influence of modulator parameters and block length of the code on the diversity achieved in bit interleaved coded modulation systems. The application of our analytical model is demonstrated with examples and simulations.

show abstract

Transmission design in soft-decoded-and-forward (SDF) TCM-based cooperative communication systems

Chang

Lee

Chou

et al. 2010

2010 International Computer Symposium (ICS2010)

View full text Add to dashboard Cite

Performance analysis of coded modulation with generalized selection combining in rayleigh fading

Cited by 7 publications

References 22 publications

New closed-form bounds on the performance of coding in correlated Rayleigh fading

New closed-form bounds on the performance of coding in correlated Rayleigh fading

On performance evaluation of BICM with non-ideal bit interleaving

Transmission design in soft-decoded-and-forward (SDF) TCM-based cooperative communication systems

Contact Info

Product

Resources

About