Geometry Based Efficient Decoding Algorithm for Underdetermined MIMO Systems
|Keywords:||欠定系統解碼器;多輸入多輸出系統;球體解碼;無線通訊;underdetermined detector;MIMO;shpere decoding;wireless communication|
The design of high-performance and low-power consumption receiver is one of the key issues of MIMO systems. The sphere decoding algorithm (SDA) is an effective detector for MIMO systems. However, typical SDA fail to work in underdetermined MIMO systems where the number of transmit antennas is larger than the number of receive antennas. The generalized sphere decoder (GSD) had been proposed for underdetermined MIMO systems. However, its decoding complexity is exponentially increasing with the antenna number difference. In this thesis, we propose a decoder for underdetermined MIMO systems with low decoding complexity. The proposed decoder consists of two stages: 1. Obtaining all valid candidate points efficiently by slab decoder. 2. Finding the optimal solution by conducting the intersectional operations with dynamic radius adaptation to the candidate set obtained from Stage 1. We also propose a reordering strategy that can be incorporated into the proposed decoding algorithm to provide a lower computational complexity and near-ML decoding performance for underdetermined MIMO systems. Simulations confirm the effectiveness of the proposed methods.
|Appears in Collections:||Thesis|
Files in This Item: