Application of quasi-orthogonal space-time block codes in beamforming

被引:46
|
作者
Liu, L [1 ]
Jafarkhani, H [1 ]
机构
[1] Univ Calif Irvine, Dept Elect Engn & Comp Sci, Irvine, CA 92697 USA
关键词
beamforming; fading; quasi-orthogonal designs; space-time block codes;
D O I
10.1109/TSP.2004.838939
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
It is well known that when channel information is available at the transmitter, transmit beamforming scheme can be employed to enhance the performance of a multipleantenna system. Recently, Jongren et al. and Zhou-Giannakis proposed a new performance criterion based on partial channel side information at the transmitter. With this criterion, an optimal beamforming matrix was constructed for the orthogonal space-time block codes. However, the same method has not been applied to the recently proposed quasi-orthogonal space-time block codes (QSTBCs) due to the nonorthogonal nature of the quasi-orthogonal designs. In this paper, the issue of combining beamforming with QSTBCs is addressed. Based on our asymptotic analysis, we extend the beamforming scheme from Jongren et al. and construct the beamforming matrices for the quasi-orthogonal designs. The proposed beamforming scheme accomplishes high transmission rate as well as high-order spatial diversity. The new QSTBC beamformer can be presented as a novel four-directional or eight-directional eigen-beamformer that works for systems with four or more transmit antennas. Simulations for systems with multiple transmit antennas demonstrate significant performance improvement over several other widely used beamforming methods at various SNRs and for channels with different quality of feedback.
引用
收藏
页码:54 / 63
页数:10
相关论文
共 50 条
  • [31] Improved quasi-orthogonal space-time block codes with hexagonal lattice modulation
    Smith, David B.
    2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, 2007, : 260 - 264
  • [32] On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
    Wang, HQ
    Wang, D
    Xia, XG
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1168 - 1172
  • [33] Reduced complexity decoding algorithm for quasi-orthogonal space-time block codes
    Kim, Jeongchang
    Cheun, Kyungwhoon
    2006 ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1 AND 2, 2006, : 408 - +
  • [34] On optimal constellations for quasi-orthogonal space-time codes
    Sezgin, A
    Jorswieck, EA
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL IV, PROCEEDINGS: SIGNAL PROCESSING FOR COMMUNICATIONS SPECIAL SESSIONS, 2003, : 345 - 348
  • [35] On the outage probability of quasi-orthogonal space-time codes
    Sezgin, A
    Oechtering, TJ
    2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2004, : 381 - 386
  • [36] A New Quasi-orthogonal Space-time Block Code
    Xiao Liping
    Xu Chengqian
    Zhang Weifeng
    2006 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, 2006,
  • [37] Efficient Quasi-Orthogonal Space-Time Block Codes for Five and Six Transmit Antennas
    Sindhu, P.
    Hameed, Abdul
    2015 IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTING AND COMMUNICATION TECHNOLOGIES (CONECCT), 2015,
  • [38] Error rate analysis of quasi-orthogonal space-time block codes with power scaling
    Choi, Minhwan
    Lee, Hoojin
    Nam, Haewoon
    ELECTRONICS LETTERS, 2014, 50 (25) : 1940 - 1941
  • [39] A new sub-optimal decoder for quasi-orthogonal space-time block codes
    Leuschner, Jeff
    Yousefi, Shahram
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (08) : 548 - 550
  • [40] Design and performance analysis of quasi-orthogonal space-time block codes for four antennae
    Zhao, Y
    He, C
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (11) : 3244 - 3247