A New Reduced-Complexity Sphere Decoder for MIMO Spatial Multiplexing System
Date Issued
2006
Date
2006
Author(s)
Chen, Cheng-Ming
DOI
en-US
Abstract
In this thesis we propose an algorithm which combines the Sphere Decoding algorithm (SDA) and the Ordered Successive Interference Cancellation algorithm (OSIC) to reduce the computation time of the SDA. We name it SD-OSIC algorithm. This algorithm has the near-ML (Maximum Likelihood) Performance and needs to search fewer lattice points inside the sphere radius, hence the searching problem are reduced to a lower dimension ones.
We also derive the number of multiplication and addition operations of SD-OSIC and conventional SDA. Numerical simulation reveals our proposed algorithm requires less loop iterations than conventional SDA and in some scenario SD-OSIC requires less computation power than the SDA. With the supports of these two comparisons, we conclude our algorithm requires less computation time than the conventional SDA.
Subjects
球狀解調
晶格正交化
排序後的漸序式干擾消除
Sphere Decoding
Lattice Reduction
Ordered Successive Interference Cancellation
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93942042-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):41be3abb64053ef51ec1af6a3ffcca0a