Improved union bounds on turbo codes performance

Babich, F.; Montorsi, G.; Vatta, F.

doi:10.1049/ip-com:20000826

Cited by 5 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A generalization of the Viterbi & Viterbi bound for imperfect CSI is considered in [16]. Again, this is problematic as the technique relies on the arguments of [15], when now H is replaced by the one corresponding to imperfect CSI.…”

Section: Introductionmentioning

confidence: 99%

“…Our reservation stems from the fact that the Viterbi & Viterbi bounding technique [14] is invalidated once the parameter H = exp(− Es N 0 ) (in the AWGN case) is replaced by H in [15], Eq. (12), for the fast Rician fading channel.…”

Section: Introductionmentioning

confidence: 99%

“…The generalization of the Viterbi & Viterbi bound [14] for fully interleaved fading channels with perfect channel side information (CSI), as reported in [15], seems to be imprecise. Our reservation stems from the fact that the Viterbi & Viterbi bounding technique [14] is invalidated once the parameter H = exp(− Es N 0 ) (in the AWGN case) is replaced by H in [15], Eq.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Tight exponential upper bounds on the ml decoding error probability of block codes over fully interleaved fading channels

Sason

Shamai

2003

IEEE Trans. Commun.

View full text Add to dashboard Cite

We derive in this paper tight exponential upper bounds on the decoding error probability of block codes which are operating over fully interleaved Rician fading channels, coherently detected and maximum-likelihood decoded. It is assumed that the fading samples are statistically independent and that perfect estimates of these samples are provided to the decoder. These upper bounds on the bit and block error probabilities are based on certain variations of the Gallager bounds. These bounds do not require integration in their final version and they are reasonably tight in a certain portion of the rate region exceeding the cutoff rate of the channel. By inserting inter-connections between these bounds, we show that they are generalized versions of some reported bounds for the binary-input AWGN channel.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tight exponential upper bounds on the ml decoding error probability of block codes over fully interleaved fading channels

Sason

Shamai

2003

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Analysis and simulation of turbo codes performance over Rice fading channels

Vatta¹,

Montorsi²,

Babich³

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)

Self Cite

View full text Add to dashboard Cite

Abstract-In this work, the performance of turbo codes over the Rice multiplicative fading channel is evaluated through analysis and simulation.The analysis is conducted through improved upper bounds on bit error probabilities in conjunction with both the fully interleaved channel and the correlated Rice slow fading channel. The analytical expression of the improved bound is obtained by extending the results presented in [1] to the Rice multiplicative fading channel case. Simulation results are obtained and presented also for intermediate fading rates, ranging between the two extreme multipath fading rates considered in the analysis. Simulations are performed using the improved Jakes' channel simulator presented in [2] to simulate Rayleigh fading channels, and extended to adequately model the multipath Rice fading propagation environment.

show abstract