Performance analysis of code selection algorithm based on quasi-orthogonal space-time block code

被引:1
|
作者
Ham, J. [1 ]
Kim, K. [2 ]
Shin, M.
Lee, C. [3 ]
机构
[1] Purdue Univ, Sch Elect & Comp Engn, W Lafayette, IN 47907 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[3] Yonsei Univ, Dept Elect & Elect Engn, Seoul 120749, South Korea
关键词
MODULATION SCHEME;
D O I
10.1049/iet-com.2010.0055
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A quasi-orthogonal space-time block code (QO-STBC) has a rate one but a loss of diversity gain, compared with an orthogonal space-time block code such as Alamouti code. In this study, a code selection algorithm between QO-STBCs is proposed for a diversity gain improvement of a system based on a QO-STBC with four transmit antennas. The proposed algorithm improves diversity gain without a rate loss and provides better performance than the conventional closed-loop algorithm based on QO-STBC. Advantageously, the proposed algorithm can be applied to simple linear receivers, such as the zero-forcing receiver and minimum mean square error receiver, instead of the maximum likelihood receiver, which has a high computational complexity problem. The probability density function of two signal-to-interference and noise ratios (SINRs) is derived and by the derived pdf, an approximated bit error rate (BER) performance of the proposed system is also derived. The BER performance of the proposed system outperforms previous algorithms at least by about 0.5 dB SNR gain at BER 10(-4).
引用
收藏
页码:1847 / 1854
页数:8
相关论文
共 50 条
  • [21] Fast Sub-Optimal Detection of Quasi-Orthogonal Space-Time Block Code
    Ahmadi, Adel
    Talebi, Siamak
    2014 7TH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS (IST), 2014, : 1228 - 1232
  • [22] Analysis of Minimum Decoding Complexity Quasi-Orthogonal Space-Time Block Code for 6 Transmit Antennas
    Liao, Mang
    Wang, Mengxing
    Jin, Lingxu
    MANUFACTURING PROCESS AND EQUIPMENT, PTS 1-4, 2013, 694-697 : 2568 - 2571
  • [23] A Space Time Block Code from Quaternion Quasi-Orthogonal Design
    Li Zhengquan
    Wang Zigang
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 1511 - 1513
  • [24] Approximate performance analysis of orthogonal space-time block code
    College of Information Engineering, Dalian Maritime University, Dalian 116026, China
    Beijing Youdian Daxue Xuebao, 2007, 3 (6-10):
  • [25] Quasi-orthogonal space-frequency block code
    Yu, GY
    Kang, JY
    IEEE INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES 2004 (ISCIT 2004), PROCEEDINGS, VOLS 1 AND 2: SMART INFO-MEDIA SYSTEMS, 2004, : 979 - 982
  • [26] Diversity Embedded Space-Time Code from Quasi-Orthogonal Designs
    Gowda, Kiran T.
    Yuen, Chau
    Sun, Sumei
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1463 - 1468
  • [27] 3-Hop Cooperative Diversity Using Quasi-Orthogonal Space-Time Block Code
    Yamaoka, Tomoya
    Hara, Yoshitaka
    Fukui, Noriyuki
    Kubo, Hiroshi
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (06) : 1636 - 1640
  • [28] High rate quasi-orthogonal space-time block code designs for four transmit antennas
    Smith, David B.
    2007 IEEE 18TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-9, 2007, : 517 - 520
  • [29] Space-time trellis, code design based on super quasi-orthogonal block codes with minimum decoding complexity
    Wang, Dong
    Wang, Haiquan
    Xia, Xiang-Gen
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (08) : 1441 - 1447
  • [30] Matrices analysis of quasi-orthogonal space-time block codes
    Hou, J
    Lee, MH
    Park, JY
    IEEE COMMUNICATIONS LETTERS, 2003, 7 (08) : 385 - 387