Efficient communication over memoryless Rayleigh fading channels with turbo coding/decoding

Communication over the discrete time memoryless Rayleigh fading channel is investigated. Codes achieving bit error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub o/) of 1 to 2 dB from the channel capacity limit were found with a coding rate of 0.05 to 0.36 bits per channel use. Similar codes with rates of up to 0.57 also performed reasonably close to the capacity limit. The codes are serial concatenation of turbo code and a modulation code such as pulse position modulation (PPM). The receiver is based on joint iterative decoding of the turbo code and the modulation code. The results are applicable also to fast frequency hopping spread spectrum and to a certain multiuser communication scenario over a rapidly varying fading channel.

[1]  Shlomo Shamai,et al.  The empirical distribution of good codes , 1997, IEEE Trans. Inf. Theory.

[2]  Kamran Kiasaleh,et al.  Turbo-coded optical PPM communication systems , 1998 .

[3]  Dan Raphaeli,et al.  Combined turbo equalization and turbo decoding , 1998, IEEE Communications Letters.

[4]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[5]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[6]  S. Shamai,et al.  The capacity of discrete-time Rayleigh fading channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[7]  Shlomo Shamai,et al.  Efficient Communication Over the Discrete-Time Memoryless Rayleigh Fading Channel with Turbo Coding/Decoding , 2000, Eur. Trans. Telecommun..