Semiorthogonal Space-Time Block Codes

被引：3

作者：

Dao, Ngoc-Dung ^{[1
]}

Tellambura, Chintha ^{[1
]}

机构：

[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 56卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Alamouti code; circulant matrix; multiple-input-multiple-output (MIMO) capacity; space-time block codes (STBCs); threaded algebraic space-time (TAST) codes; transmit diversity; SIGNAL CONSTELLATIONS; DIVERSITY;

D O I：

10.1109/TIT.2009.2034880

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a new class of full-diversity, rate-one space-time block codes (STBCs) called semiorthogonal algebraic space-time block codes (SAST codes) is proposed. SAST codes are delay optimal when the number of transmit antennas is even. The SAST codeword matrix has a generalized Alamouti structure where the transmitted symbols are replaced by circulant matrices and the commutativity of circulant matrices simplifies the detection of transmit symbols. SAST codes with maximal coding gain are constructed by using rate-one linear threaded algebraic space-time (LTAST) codes. Compared with LTSAT codes, SAST codes not only reduce the complexity of maximum-likelihood detection, but also provide remarkable performance gain. They also outperform other STBC with rate one or less. SAST codes also perform well with suboptimal detectors such as the vertical-Bell Laboratories layered space-time (V-BLAST) nulling and cancellation receiver. Finally, SAST codes attain nearly 100% of the Shannon capacity of open-loop multiple-input-single-output (MISO) channels.

引用

页码：168 / 180

页数：13

共 28 条

[1] A simple transmit diversity technique for wireless communications [J].

Alamouti, SM .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (08) :1451-1458

[2] On maximum-likelihood detection and the search for the closest lattice point [J].

Damen, MO ;

El Gamal, H ;

Caire, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2389-2402

[3] Diagonal algebraic space-time block codes [J].

Damen, MO ;

Abed-Meraim, K ;

Belfiore, JC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :628-636

[4] Linear threaded algebraic space-time constellations [J].

Damen, MO ;

El Gamal, H ;

Beaulieu, NC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2372-2388

[5]

Davis P. J., 1979, Circulant Matrices

[6] Estimation of VAR Models Computational Aspects [J].

Paolo Foschi ;

Erricos J. Kontoghiorghes .

Computational Economics, 2003, 21 (1-2) :3-22

[7] OPTIMIZATION OF 2-DIMENSIONAL SIGNAL CONSTELLATIONS IN PRESENCE OF GAUSSIAN NOISE [J].

FOSCHINI, GJ ;

GITLIN, RD ;

WEINSTEIN, SB .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1974, CO22 (01) :28-38

[8] Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture [J].

Golden, GD ;

Foschini, CJ ;

Valenzuela, RA ;

Wolniansky, PW .

ELECTRONICS LETTERS, 1999, 35 (01) :14-16

[9] High-rate codes that are linear in space and time [J].

Hassibi, B ;

Hochwald, BM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) :1804-1824

[10]

Horn R.A., 2012, Matrix Analysis

← 1 2 3 →