Complete classes of generalized space-time block codes for multiantenna communications systems

Michael I. Mazurkov

doi:10.3103/S0735272709120036

Authors

Michael I. Mazurkov Odessa National Polytechnic University, Ukraine

DOI:

https://doi.org/10.3103/S0735272709120036

Abstract

A recurrent algorithm has been developed for building complete classes of the generalized space-time block codes of arbitrary size G(2^k×2^k), k = 2, 3, …, ∞ over the complex and real alphabets. The orthogonal space-time codes offered are referred to the high-speed class, because they possess a fixed transmission rate R = 3/4 > 1/2; in this case, the number of transmitting antennas can be easily controlled on the basis of condition N_T ≤ 2^k.

References

A. M. Shloma, M. G. Bakulin, V. B. Kreindelin, and A. P. Shumov, New Algorithms for Signal Generation and Processing in Mobile Communications Systems (Goryachaya Liniya–Telekom, Moscow, 2008) [in Russian, ed. by A. M. Shloma].

A. P. Shumov, M. G. Bakulin, and V. B. Kreindelin, “Methods of space-time block coding,” Tsifrovaya Obrabotka Signalov, No. 2, 2 (2005).

V. P. Ipatov, Broadband Systems and Signal Code Division. Principles and Applications (Tekhnosfera, Moscow, 2007) [in Russian].

S. M. Alamouti, “A simple transmit diversity technique for wireless communications,” IEEE J. Sel. Areas Commun. 16, No. 10, 1451 (1998).

V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction, IEEE Trans. Inf. Theory 44, No. 3, 744 (1998).

V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space-Time Block Codes from Orthogonal Designs, IEEE Trans. Inf. Theory 45, No. 7, 1456 (1999).

V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space-Time Block Coding for Wireless Communication: Performance Results, IEEE J. Sel. Areas Commun. 17, No. 3, 451 (1999).

V. P. Dyakonov, Mathematica 5.1/5.2/6. Programming and Mathematical Computations (DMK Press, Moscow, 2008) [in Russian].