DocumentCode
1787315
Title
Fast sub-optimal detection of quasi-orthogonal space-time block code
Author
Ahmadi, Amin ; Talebi, Sahar
Author_Institution
Dept. of Electr. Eng., Shahid Bahonar Univ. of Kerman, Kerman, Iran
fYear
2014
fDate
9-11 Sept. 2014
Firstpage
1228
Lastpage
1232
Abstract
In this paper, a fast sub-optimal decoding method is proposed for quasi-orthogonal space-time block codes (QOSTBCs) with four transmit antennas. The proposed method focuses on the phases of received vector to select an origin and create a limited region among proper candidates. The limited region and proper candidates are selected from some sorted lookup tables by utilizing the phases of received vector. Euclidean distance of the most probable candidate is firstly computed and then the distances of other candidates are successively assessed to attain minimum distance. Simulation results confirm that proposed method has adequate performance, while it significantly requires fewer floating point operations compared to the other methods.
Keywords
decoding; orthogonal codes; space-time block codes; transmitting antennas; Euclidean distance; QOSTBCs; fast sub-optimal decoding method; fast sub-optimal detection; floating point operations; quasiorthogonal space-time block code; received vector phase; sorted lookup tables; transmit antennas; Block codes; Complexity theory; Maximum likelihood decoding; Quality of service; Transmitting antennas; Vectors; fast sub-optimal decoding; low complexity detection; quasi-orthogonal; space-time block code;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications (IST), 2014 7th International Symposium on
Conference_Location
Tehran
Print_ISBN
978-1-4799-5358-5
Type
conf
DOI
10.1109/ISTEL.2014.7000891
Filename
7000891
Link To Document