DocumentCode
2294594
Title
Golden Code with Low Complexity Sphere Decoder
Author
Zhang, Lei ; Li, Baojin ; Yuan, Tingting ; Zhang, Xin ; Yang, Dacheng
Author_Institution
Beijing Univ. of Posts & Telecommun., Beijing
fYear
2007
fDate
3-7 Sept. 2007
Firstpage
1
Lastpage
5
Abstract
Golden code is one of the algebraic space-time codes, which has the full rate, full diversity with the better performance than other codes. Sphere decoding (SD) algorithm can achieve near ML performance with moderate complexity. We proposed the modified complex sphere decoding algorithm based on Schnorr-Euchner strategy (SE-CSD) including sorting the order of the system that can reduce the computational effort than general sphere decoding algorithm over the range of SNRs. Combining Golden code with low complexity SE-CSD can obtain perfect performance than other solutions.
Keywords
algebraic codes; computational complexity; decoding; space-time codes; Schnorr-Euchner strategy; algebraic space-time codes; golden code; low complexity sphere decoder; moderate complexity; Algebra; Diversity reception; Fading; Land mobile radio; MIMO; Maximum likelihood decoding; Mobile communication; Sorting; Space technology; Space time codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Personal, Indoor and Mobile Radio Communications, 2007. PIMRC 2007. IEEE 18th International Symposium on
Conference_Location
Athens
Print_ISBN
978-1-4244-1144-3
Electronic_ISBN
978-1-4244-1144-3
Type
conf
DOI
10.1109/PIMRC.2007.4394327
Filename
4394327
Link To Document