| Summary: | 碩士 === 國立中正大學 === 通訊工程研究所 === 96 === Multi-Input Multi-Output (MIMO) has been proposed to achieve higher data rates and improve spectral efficiency. But detection in MIMO systems is not an easy job. The maximum likelihood (ML) algorithm is optimal and has the lowest error rate. However, the complexity of ML algorithm grows exponentially with the number of transmit antennas. The sphere decoder, on the other hand, can achieve the same performance as that of ML algorithm, but with much lower complexity. In this thesis, a sphere decoder for high dimensional lattices is investigated. Furthermore, by reformulating the cyclic-division-algebra (CDA) based space-time codes as a high-dimension lattice, a low complexity sphere decoder is proposed and is used to simulate the ML performance of the CDA Based codes.
|
|---|
