Turbo Coding with Equalization in WCDMA Downlink
Wireless Personal Communications: An International Journal
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Super-orthogonal space-time turbo transmit diversity for CDMA
EURASIP Journal on Applied Signal Processing
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance evaluation of convolutional turbo codes in AWGN and ITU-R channels
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
| Hi-index | 0.07 |
Turbo codes are parallel concatenated codes whose performance in the additive white Gaussian noise (AWGN) channel has been shown to be near the theoretical limit. In this paper, we describe a low-rate superorthogonal turbo code that combines the principles of low-rate convolutional coding and that of parallel concatenation. Due to the bandwidth expansion, this code outperforms the ordinary turbo code both in AWGN and especially in fading channels. Thus, superorthogonal turbo codes are suited mainly for spread-spectrum applications. For the purposes of iterative decoding, we concisely describe the connection between the optimal maximum a posteriori symbol estimation and suboptimal soft-output decoding based on sequence estimation. The suboptimal decoder produces outputs that can directly be used as additive metrics at successive decoding iterations, without the need for estimating channel noise variance. Simulation results in AWGN and flat Rayleigh fading channels are also presented, along with analytical upper bounds of bit- and frame-error probabilities