CHARACTERIZATION OF 2 x 2 FULL DIVERSITY SPACE-TIME CODES AND INEQUIVALENT FULL RANK SPACES

被引：0

作者：

Ashenab, M. ^{[1
,2
]}

Kermani, H. Momenaee ^{[1
]}

机构：

[1] Shahid Bahonar Univ Kerman, Fac Math & Comp, Dept Pure Math, Kerman, Iran

[2] Shahid Bahonar Univ Kerman, Young Researchers Soc, Kerman, Iran

来源：

BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY | 2017年 / 43卷 / 07期

关键词：

Space-time coding; linear dispersion; full diversity; full rank; WIRELESS COMMUNICATIONS; ORTHOGONAL DESIGNS; BLOCK-CODES; CONSTRUCTION; MATRICES;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In wireless communication systems, space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter. The concept of diversity is very crucial in designing spacetime codes. In this paper, using the equivalent definition of full diversity space-time codes, we first characterize all real and complex 2 x 2 rate one linear dispersion space-time block codes that are full diversity. This characterization is used to construct full diversity codes which are not derived from Alamouti scheme. Then, we apply our results to characterize all real subspaces of M-2(C) and M-2(R ) whose nonzero elements are invertible. Finally, for any natural number n > 1, we construct infinitely many inequivalent subspaces of M-n(C) whose nonzero elements are invertible.

引用

页码：2483 / 2493

页数：11