A new extending orthogonal space-time block coding

Author

Tian, Xinji ; Xu, Yanping

Author_Institution

Sch. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China

fYear

2012

fDate

21-23 April 2012

Firstpage

43

Lastpage

46

Abstract

The extending orthogonal space-time block code is constituted by identical orthogonal space-time block code (OSTBC). However, the channel fading coefficient of each branch of each OSTBC is not taken into consideration. For this problem, an improved extending orthogonal space-time block code is proposed. Analysis shows that the system performance is enhanced, and the computational complexity is also greatly reduced with only a few bits increasing of feedback information. Simulation supports the conclusion.

Keywords

computational complexity; fading channels; feedback; orthogonal codes; space-time block codes; channel fading coefficient; computational complexity; extending OSTBC; extending orthogonal space-time block coding; identical OSTBC; identical orthogonal space-time block code; Block codes; Computational complexity; Fading; Quantization; Receiving antennas; Vectors; Wireless communication; OSTBC; channel gain; computational complexity; feedback; performance;

fLanguage

English

Publisher

ieee

Conference_Titel

Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on

Conference_Location

Yichang

Print_ISBN

978-1-4577-1414-6

Type

conf

DOI

10.1109/CECNet.2012.6201465

Filename

6201465