The multiple-input multiple-output (MIMO) system makes efficient use of spectrum and increases the transmission throughput in wireless communications. The sphere decoding (SD) is an efficient algorithm that enables the maximum-likelihood (ML) detection for the MIMO system. However, the SD algorithm has variable complexity, and its complexity increases rapidly with decreasing signal-To-noise ratio (SNR). In this paper, we propose a novel ML detection algorithm for the MIMO system based on differential metrics.We define the differential metrics and derive the associated recursive calculation. We then give the indicative functions, which can be used to possibly find some ML-detected bits of the initial sequence. The indicative functions are further applied to implement an efficient tree search for ML detection. The proposed algorithm does not need QR decomposition and matrix inversion. The tree search process needs only the additive operation, while the number of multiplications before the tree search is constant. Our algorithm can achieve the exact ML detection as the SD algorithm. Unlike the SD algorithm, the complexity of our algorithm reduces with decreasing SNR, whereas at high SNR, the complexity is nearly constant.We also give the convergence analysis for the SD and proposed algorithms, and the simulation verifies our analysis. For the proposed algorithm, the number of necessary memory is constant during the tree search, and the implementation by parallel processing is possible. The soft output of ML-detected bits can also be generated in our algorithm.
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering