Improved Perfect Space-Time Block Codes

被引：12

作者：

Srinath, K. Pavan ^{[1
]}

Rajan, B. Sundar ^{[1
]}

机构：

[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2013年 / 59卷 / 12期

关键词：

Cyclic division algebras; Galois group; multiple-input multiple-output systems; nonvanishing determinant; shaping criterion; space-time block codes; DIVERSITY; NUMBER;

D O I：

10.1109/TIT.2013.2280168

中图分类号：

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

学科分类号：

0812 ;

摘要：

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

引用

页码：7927 / 7935

页数：9

共 19 条

[1] Evaluation of the reliable data rates supported by multiple-antenna coded wireless links for QAM transmissions [J].

Baccarelli, E .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (02) :295-304

[2] The Golden code: A 2x2 full-rate space-time code with nonvanishing determinants [J].

Belfiore, JC ;

Rekaya, G ;

Viterbo, E .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1432-1436

[3] A construction of a space-time code based on number theory [J].

Damen, MO ;

Tewfik, A ;

Belfiore, JC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :753-760

[4] Perfect space-time codes for any number of antennas [J].

Elia, Petros ;

Sethuraman, B. A. ;

Kumar, R. Vijay .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (11) :3853-3868

[5] Explicit space-time codes achieving the diversity-multiplexing gain tradeoff [J].

Elia, Petros ;

Kumar, K. Raj ;

Pawar, Sameer A. ;

Kumar, P. Vijay ;

Lu, Hsiao-Feng .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (09) :3869-3884

[6] 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

[7] Achieving near-capacity on a multiple-antenna channel [J].

Hochwald, BM ;

ten Brink, S .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (03) :389-399

[8]

Jacobson N., 1985, BASIC ALGEBRA, V2nd

[9]

Lidl R., 1997, Encyclopedia of Mathematics and its Applications

[10]

McCarthy P. J., 1991, ALGEBRAIC EXTENSIONS

← 1 2 →