Serial Concatenation of Space-Time and Recursive Convolutional Codes

ETRI Journal

关键词: BCJR algorithm;    recursive convolutional codes;    concatenated codes;    space-time code;   

Others  :  1184878
DOI  :  10.4218/etrij.03.0202.0206

【 摘 要 】

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

   

【 参考文献 】

• [1]G.J. Foschini and M.J. Gans, "On Limits of Wireless Communications in a Fading Environment When Using Multiple Antennas," Wireless Personal Communications, vol. 6, Mar. 1998, pp. 311-335.
• [2]V. Tarokh, N. Seshadri, and A.R. Calderbank, "Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria and Code Construction," IEEE Trans. Inform. Theory, Mar. 1998, pp. 744-764.
• [3]C. Heegard and S.B. Wicker, Turbo Coding, Kluwer Academic Publishers, Boston, MA, 1999.
• [4]X. Lin and R.S. Blum, "Improved Space-Time Codes Using Serial Concatenation," IEEE Commun. Lett., vol. 4, no. 7, July 2000, pp. 221-223.
• [5]D. Tujkovic, "Recursive Space-Time Codes for Turbo-Coded Modulation," Proc. IEEE GLOBECOM’00, San Francisco, USA, Nov. 2000, pp. 1010-1015.
• [6]E.J. Yim, D.K. Kim, and H.-Y. Song, "MIMO Iterative Decoding of Serial Concatenation Using Space-Time Trellis Codes,"Electron. Lett., vol. 38, no. 4, Feb. 2002, pp. 190-191.
• [7]L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. Inform. Theory, vol. IT-20, Mar. 1974, pp. 284-287.
• [8]P. Robertson, E. Villebrun, and P. Hoeher, "A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain," Proc. IEEE ICC, Seattle, WA, USA, June 1995, pp. 1009-1013.
• [9]A. Stefanov and T.M. Duman, "Turbo-Coded Modulation for Systems with Transmit and Receive Antenna Diversity over Block Fading Channels: System Model, Decoding Approaches, and Practical Considerations," IEEE J. Selec. Areas Commun., vol. 19, no. 5, May 200
• [10]S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding," TDA progress report 42-126, Jet Propulsion Laboratory, Pasadena, California, Aug. 15, 1996.