Generalized concatenated system with embedded space-time codes for MIMO systems

  • A. A. KreshchukEmail author
  • V. V. Zyablov
Data Transmission in Computer Networks


Multiple-input multiple-output systems are communication systems employing multiple transmitting and receiving antennas. In the present study, a new generalized concatenated signal-code construction is proposed. Its inner codes are embedded Golden codes, and its outer codes are products of Reed-Solomon codes. New algorithms for decoding inner codes, outer codes, and the generalized signal-code construction itself are proposed. The decoder for space-time Golden codes makes it possible to obtain a measure of reliability for certain symbols without an increase in the number of arithmetic operations. The decoder for outer product codes removes the “floor” on the error-probability curve. In addition, the lower bounds of decoding-error probability for the product-code iterative decoders have been obtained. The error-correcting capacity of the new decoder for the generalized concatenated construction is higher than that of the currently known decoders. A computer simulation has shown the efficiency of the proposed construction and decoding algorithms.


Code Word Quadrature Amplitude Modulation Time Code Iterative Decoder Outer Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. S. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE J. Sel. Areas Commun. 16, 1451 (1998).CrossRefGoogle Scholar
  2. 2.
    J.-C. Belfiore, G. Rekaya, and E. Viterbo, “The Golden Code: A 2 × 2 Full Space-Time Code with Nonvanishing Determinants,” IEEE Trans. Inf. Theory 51, 1432–1436 (2005).CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    M.-O. Damen, H. El-Gamal, and G. Caire, “On Maximum-Likelihood Detection and the Search for the Closest Lattice Point,” IEEE Trans. Inf. Theory 49, 2389–2402 (2003).CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    H. El-Gamal and M.-O. Damen, “Universal Space-Time Coding,” IEEE Trans. Inf. Theory 49, 1097–1119 (2003).CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    P. Elias, “Error-Free Coding,” IRE Trans. Inf. Theory 4(4), 29–37 (1954).CrossRefMathSciNetGoogle Scholar
  6. 6.
    G. D. Forney, Jr. “Exponential Error Bounds for Erasure, List, and Decision Feedback Schemes,” IEEE Trans. Inf. Theory 14, 206–220 (1968).CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    H. Jafarkhani, Space-Time Coding: Theory and Practice (Cambridge Univ. Press, Cambridge, 2005).CrossRefGoogle Scholar
  8. 8.
    Paul James Lusina, PhD Thesis, Algebraic Designs of Space Time Codes (University of Ulm, 2003).Google Scholar
  9. 9.
    L. Luzzi, G. R.-B. Othman, J. C. Belfiore, and E. Viterbo, “Golden Space-Time Block-Coded Modulation,” IEEE Trans. Inf. Theory 55, 584–597 (2009).CrossRefMathSciNetGoogle Scholar
  10. 10.
    F. Oggier, G. Rekaya, J. C. Belfiore, and E. Viterbo, “Perfect Space-Time Block Codes,” IEEE Trans. Inf. Theory 52, 3885–3902 (2006).CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    F. Oggier and E. Viterbo, “Algebraic Number Theory and Code Design for Rayleigh Fading Channels,” Found. Trends Commun. and Inf. Theory 1, 333–415 (2004).CrossRefGoogle Scholar
  12. 12.
    D. Slepian, “Some Further Theory of Group Codes,” Bell Syst. Tech. J. 39, 1219–1252 (1960).CrossRefMathSciNetGoogle Scholar
  13. 13.
    V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-Time Block Codes from Orthogonal Designs,” IEEE Trans. Inf. Theory 45, 1456–1467 (1999).CrossRefMathSciNetzbMATHGoogle Scholar
  14. 14.
    E. L. Blokh and V. V. Zyablov, Linear Concatenated Codes (Nauka, Moscow, 1982).Google Scholar
  15. 15.
    V. V. Zyablov, “Algorithms for Step-by-Step Decoding of Iterated and Concatenated Codes,” in Transmission of Digital Information over Channels with Memory, Ed. by E. L. Blokh (Nauka, Moscow, 1970) [in Russian].Google Scholar
  16. 16.
    V. V. Zyablov, “Optimization of Concatenated Decoding Algorithms,” Probl. Peredachi Inf. 9(1), 19–24 (1973).Google Scholar

Copyright information

© Pleiades Publishing, Inc. 2014

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations