Bandwidth efficient coding for fading channels: code construction and performance analysis
Christian B. Schlegel, Daniel J. Costello · IEEE Journal on Selected Areas in Communications · 1989
The authors apply a general method of bounding the event error probability of TCM (trellis-coded modulation) schemes to fading channels and use the effective length and the minimum-squared-product distance to replace the minimum-free-squared-Euclidean distance as code design parameters for Rayleigh and Rician fading channels with a substantial multipath component. They present 8-PSK (phase-shift-keying) trellis codes specifically constructed for fading channels that outperform equivalent codes designed for the AWGN (additive white Gaussian noise) channel when v>or=5. For quasiregular trellis codes there exists an efficient algorithm for evaluating event error probability, and numerical results which demonstrate the importance of the effective length as a code design parameter for fading channels with or without side information have been obtained. This is consistent with the case for binary signaling, where the Hamming distance remains the best code design parameter for fading channels. The authors show that the use of Reed-Solomon block codes with expanded signal sets becomes interesting only for large value of E/sub s//N/sub 0/, where they begin to outperform trellis codes.>
Cited by 237 works. doi:10.1109/49.44581
Authors
References
- Principles of Communication Engineering
- Channel coding with multilevel/phase signals
- Digital Communications
- Trellis-coded modulation with redundant signal sets Part II: State of the art
- The design of trellis coded MPSK for fading channels: performance criteria
- Fading dispersive communication channels
- The design of trellis coded MPSK for fading channels: set partitioning for optimum code design
- Trellis Coded Modulation for 4800-9600 bits/s Transmission Over a Fading Mobile Satellite Channel
- Forward Error Correction Coding for Fading Compensation in Mobile Satellite Channels
- Probability-of-error bounds for binary transmission on the slowly fading Rician channel