Design and analysis of turbo codes on Rayleigh fading channels

Hall, E.K.; Wilson, Stephen G.

doi:10.1109/glocom.1996.586742

Cited by 71 publications

(129 citation statements)

References 10 publications

Supporting

Mentioning

120

Contrasting

Unclassified

Order By: Relevance

“…The number of turbo iterations is set to eight. From Figure 2, we see that the analytical performance of the turbo code agrees very well with the simulation results for the SNR values above a threshold value of the AE Ó determined by the computational cutoff rate Ê ¼ [3], [4], [2]. We can also observe that the performance of the turbo code on fading channels with EGC diversity is very close to the MRC diversity, both in analysis as well as in simulation.…”

Section: Resultssupporting

confidence: 73%

“…The upper bound on the average bit error probability for turbo codes on AWGN channels was developed in [3] and [4], and was later extended to Rayleigh fading channels in [2]. Following the same notation in [2], we obtain upper bounds on the average bit error probability for turbo codes on generalized Nakagami fading diversity channels with MRC, EGC, and SC.…”

Section: Union Bound On Bermentioning

confidence: 98%

“…Bit error probability bounds for turbo codes on AWGN channels have been derived in [3] and [4] using transfer function bounding techniques. The same bounding technique is extended to flat Rayleigh fading channels with and without channel correlation, in [2]. It is well known that diversity reception can combat the performance degradation due to channel fading [5].…”

Section: Introductionmentioning

confidence: 99%

“…Turbo codes have been shown to offer near-capacity performance on AWGN channels and significantly enhanced performance on fully-interleaved flat Rayleigh fading channels [1], [2]. Bit error probability bounds for turbo codes on AWGN channels have been derived in [3] and [4] using transfer function bounding techniques.…”

Section: Introductionmentioning

confidence: 99%

“…Let be the transmitted symbol sequence. Then the received symbol sequence on the Ð Ø antenna, Ö´Ð µ , is given by (2) where ´Ñµ is the standard Gamma integral [5]. Here, we normalized the second moment of fade, ´« ¾ µ, to unity.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining

Ramesh¹,

Chockalingam²,

Milstein³

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)

View full text Add to dashboard Cite

Abstract-In this paper, we derive bit error performance bounds for turbo codes on Nakagami fading channels with diversity combining. We first derive the average pairwise error probability expressions for turbo codes with maximal ratio combining (MRC), equal gain combining (EGC), and selection combining (SC) on Nakagami fading channels. Using the pairwise error probability expressions and the union bounding technique, we then obtain bounds on the bit error probability of turbo codes for MRC, EGC, and SC diversity schemes. We present the modified log-MAP turbo decoder for MRC, EGC, and SC, and compare the analytical bounds with simulation results for the special case of 2-antenna diversity with Nakagami parameter Ñ ½ (i.e., Rayleigh fading). Results indicate that the EGC scheme with turbo coding performs close to MRC scheme for i.i.d Rayleigh fading.

show abstract

Section: Resultssupporting

confidence: 73%

Section: Union Bound On Bermentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining

Ramesh¹,

Chockalingam²,

Milstein³

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)

View full text Add to dashboard Cite

show abstract

Bandwidth‐efficient turbo coding over Rayleigh fading channels

Goff¹

2002

Int J Communication

View full text Add to dashboard Cite

SUMMARYIntroduced in 1993, turbo codes can achieve high coding gains close to the Shannon limit. In order to design power and bandwidth-efficient coding schemes, several approaches have been introduced to combine high coding rate turbo codes with multilevel modulations. The coding systems thus obtained have been shown to display near-capacity performance over additive white Gaussian noise (AWGN) channels. For communications over fading channels requiring large coding gain and high bandwidth efficiency, it is also interesting to study bit error rate (BER) performance of turbo codes combined with high order rectangular QAM modulations. To this end, we investigate, in this paper, error performance of several bandwidth-efficient schemes designed using the bit-interleaved coded modulation approach that has proven potentially very attractive when powerful codes, such as turbo codes, are employed. The structure of these coding schemes, termed 'bit-interleaved turbo-coded modulations' (BITCMs), is presented in a detailed manner and their BER performance is investigated for spectral efficiencies ranging from 2 to 7 bit=s=Hz: Computer simulation results indicate that BITCMs can achieve near-capacity performance over Rayleigh fading channels, for all spectral efficiencies considered throughout the paper. It is also shown that the combination of turbo coding and rectangular QAM modulation with Gray mapping constitutes inherently a very powerful association, since coding and modulation functions are both optimized for operation in the same signal-to-noise ratio region. This means that no BER improvement is obtainable by employing any other signal constellation in place of the rectangular ones. Finally, the actual influence of the interleaving and mapping functions on error performance of BITCM schemes is discussed.

show abstract

Time‐frequency MSE analysis of linear channel estimation methods for the LTE downlink

Argenti

Biagini

et al. 2014

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Orthogonal frequency-division multiplexing (OFDM) is widely used in modern communication systems thanks to the ease of its implementation as well as to a simple design of channel estimation methods. Pilot-based schemes are commonly employed to recover channel information and implement efficient channel equalisation. From the symbols transmitted over the pilot carriers, the channel coefficients for a whole OFDM are estimated. In this paper, we propose a method to compute in a closed form the mean square estimation error of different linear approximation and interpolation algorithms in the time-frequency domain. Specifically, by exploiting the linear relationship between the estimated channel coefficients for the whole frame and those relative to the pilots, the proposed approach permits to obtain the mean square error relative to all OFDM symbols in a frame. The method can be used for any linear frequency/time interpolation/approximation method and for any choice of pilot positions and channel statistics. Thanks to our derivations, several pilot-aided channel estimation and interpolation algorithms can be compared without resorting to burdensome computer simulations. In order to demonstrate the effectiveness of the method, the downlink of the long term evolution system is taken as a case study: some popular channel estimators have been selected and the best strategy in a realistic wireless scenario is investigated. The performance of the method is also verified by computing, by means of simulations, bit error rate (BER) curves for the long term evolution (LTE) multiple input multiple output (MIMO) downlink, using 2 2 and 4 4 Alamouti space-frequency coding configurations, in both uncoded and coded communications. Copyright

show abstract

Design and analysis of turbo codes on Rayleigh fading channels

Cited by 71 publications

References 10 publications

Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining

Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining

Bandwidth‐efficient turbo coding over Rayleigh fading channels

Time‐frequency MSE analysis of linear channel estimation methods for the LTE downlink

Contact Info

Product

Resources

About