Skip to main content
SpringerLink
Log in

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

  • Data Transmission in Computer Networks
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. S. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE J. Sel. Areas Commun. 16, 1451 (1998).

    Article  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  4. H. El-Gamal and M.-O. Damen, “Universal Space-Time Coding,” IEEE Trans. Inf. Theory 49, 1097–1119 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Elias, “Error-Free Coding,” IRE Trans. Inf. Theory 4(4), 29–37 (1954).

    Article  MathSciNet  Google Scholar 

  6. G. D. Forney, Jr. “Exponential Error Bounds for Erasure, List, and Decision Feedback Schemes,” IEEE Trans. Inf. Theory 14, 206–220 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  7. H. Jafarkhani, Space-Time Coding: Theory and Practice (Cambridge Univ. Press, Cambridge, 2005).

    Book  Google Scholar 

  8. Paul James Lusina, PhD Thesis, Algebraic Designs of Space Time Codes (University of Ulm, 2003).

  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).

    Article  MathSciNet  Google Scholar 

  10. F. Oggier, G. Rekaya, J. C. Belfiore, and E. Viterbo, “Perfect Space-Time Block Codes,” IEEE Trans. Inf. Theory 52, 3885–3902 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    Article  Google Scholar 

  12. D. Slepian, “Some Further Theory of Group Codes,” Bell Syst. Tech. J. 39, 1219–1252 (1960).

    Article  MathSciNet  Google Scholar 

  13. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-Time Block Codes from Orthogonal Designs,” IEEE Trans. Inf. Theory 45, 1456–1467 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  14. E. L. Blokh and V. V. Zyablov, Linear Concatenated Codes (Nauka, Moscow, 1982).

    Google Scholar 

  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. V. V. Zyablov, “Optimization of Concatenated Decoding Algorithms,” Probl. Peredachi Inf. 9(1), 19–24 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Bol’shoi Karetnyi per., 19 str. 1, Moscow, Russia

    A. A. Kreshchuk & V. V. Zyablov

Authors
  1. A. A. Kreshchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. V. Zyablov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Kreshchuk.

Additional information

Original Russian Text © A.A. Kreshchuk, V.V. Zyablov, 2014, published in Informatsionnye Protsessy, 2014, Vol. 14, No. 2, pp. 160–177.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kreshchuk, A.A., Zyablov, V.V. Generalized concatenated system with embedded space-time codes for MIMO systems. J. Commun. Technol. Electron. 59, 1489–1500 (2014). https://doi.org/10.1134/S1064226914120109

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064226914120109

Keywords

Search

Navigation