On the Full-Rate Linear Complexity 2×2 Space-Time Block Code: Application in Keyhole Channels

Hosseini Bidaki, S.Saleh; Bagheri Ranjbar, Behrouz; Talebi, Siamak

Document Type : Review Article

Authors

¹ Electrical Eng. Department, University of Kerman, Kerman, Iran

² Advanced Communications Research Institute, Sharif University, Tehran, Iran

Abstract

In this paper, a new full rate, full diversity 22 STBC with linear complexity in the receiver is introduced for keyhole channels, where the rank-deficiency of the channel matrix degrades system performance. This code is optimized based on the known criteria for these types of the channels. Simulation results demonstrate that the proposed code outperforms some of the well-recognized STBCs when BPSK and 4-QAM constellation are utilized.

Keywords

References

1-D. Chizhik, G. J. Foschini, M. J. Gans, and R. A. Valenzuela, “Keyholes, correlations, and capacities of multi-element transmit and receive antennas,” IEEE Trans. Wireless Commun., vol. 1, no. 2, pp. 361–368, Apr. 2002.

2-H. Shin and J. H. Lee, “Performance analysis of space–time block codes over keyhole Nakagami-m fading channels,” IEEE Trans. Veh. Technol., vol. 53, no. 2, pp. 351–362, Mar. 2004.

3-Y. Gong and K. B. Letaief, “On the error probability of orthogonal space-time block codes over keyhole MIMO channels,” IEEE Trans. Wireless Commun., vol. 6, no. 9, pp. 3402–3409, Sept. 2007.

4-A. M. Nasri Nasrabadi, H. R. Bahrami, and S. H. Jamali, “Design of space-time trellis codes for keyhole channels: Performance criterion and code design,” IEE Electron. Lett., vol. 40, no. 1, pp. 53–55, Jan. 2004.

5-S. Sanayei, A. Hedayat, and A. Nosratinia, “Space-time codes in keyhole channels: Analysis and design,” IEEE Trans. Wireless Commun., vol. 6, no.6, pp. 2006–2011, Jun. 2007.

6-S. S. Hosseini B., S. Talebi, and M. Shahabinejad, “A full-rate full-diversity 2×2 space-time block code with linear complexity for the maximum likelihood receiver,” IEEE Commun. Lett., vol. 15, no.8, pp. 842-844, Aug. 2011.

7-V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communications: Performance criterion and code construction,” IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 744–765, Mar. 1998.

8-S. Sezginer, H. Sari, and E. Biglieri, “On high-rate full-diversity 2×2 space-time codes with low-complexity optimum detection,” IEEE Trans. Commun., vol. 57, no. 5, pp. 1532-1541, May 2009.

9-S. M. Alamouti, “A simple transmit diversity technique for wireless communications,” IEEE J.Sel. Areas Commun. vol. 16, no. 8, pp. 1451-1458, Oct. 1998.

10-J.-C. Belfiore, G. Rekaya, and E. Viterbo, “The Golden code: a 2×2full- rate space-time code with non-vanishing determinants,” IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1432–1436, Apr. 2005.

11-H. Jafarkhani, “A quasi-orthogonal space–time block code,” IEEE Trans. Commun., vol. 49, no. 1, pp. 1–4, Jan. 2001.

Majlesi Journal of Electrical Engineering

On the Full-Rate Linear Complexity 2×2 Space-Time Block Code: Application in Keyhole Channels

References

References

Volume 7, Issue 1 - Serial Number 1
March 2013

On the Full-Rate Linear Complexity 2×2 Space-Time Block Code: Application in Keyhole Channels

References

References

Volume 7, Issue 1 - Serial Number 1March 2013

Volume 7, Issue 1 - Serial Number 1
March 2013