Adaptive detection scheme in accordance with channel condition for MIMO-OFDM system
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Low-complexity adaptive tree search algorithm for MIMO detection
IEEE Transactions on Wireless Communications
A new detection method for MIMO systems with differently modulated layers
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
New approaches for lowering path expansion complexity of K-best MIMO detection algorithms
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A novel MIMO detection method for mobile IPTV
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
IEEE Transactions on Communications
EURASIP Journal on Advances in Signal Processing - Special issue on advances in single carrier block modulation with frequency domain processing
EURASIP Journal on Advances in Signal Processing - Special issue on advances in single carrier block modulation with frequency domain processing
Upper-Lower Bounded-Complexity QRD-M for Spatial Multiplexing MIMO-OFDM Systems
Wireless Personal Communications: An International Journal
A Low-power and Low-complexity Baseband Processor for MIMO-OFDM WLAN Systems
Journal of Signal Processing Systems
Wireless Personal Communications: An International Journal
Adaptive Parallel and Iterative QRDM Detection Algorithms for MIMO Multiplexing Systems
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 0.07 |
This paper proposes adaptive control of the number of surviving symbol replica candidates, Sm (m denotes the stage index), based on the minimum accumulated branch metric of each stage in maximum-likelihood detection employing QR decomposition and the M-algorithm (QRM-MLD) in orthogonal frequency-division multiplexing with multiple-input-multiple-output (MIMO) multiplexing. In the proposed algorithm, Sm at the mth stage (1lesmlesNt, N t is the number of transmission antenna branches) is independently controlled using the threshold value calculated from the minimum accumulated branch metric at that stage and the estimated noise power. We compared the computational complexity of QRM-MLD employing the proposed algorithm with that of conventional methods at the same average packet error rate assuming the information bit rate of 1.048 Gb/s in a 100-MHz channel bandwidth (i.e., frequency efficiency of approximately 10 bit/s/Hz) using 16QAM modulation and turbo coding with the coding rate of 8/9 in 4-by-4 MIMO multiplexing. Computer simulation results show that the average computational complexity of the branch metrics, i.e., squared Euclidian distances, of the proposed adaptive independent Sm control method is decreased to approximately 38% that of the conventional adaptive common Sm control and to approximately 30% that of the fixed Sm method (Sm=M=16), assuming fair conditions such that the maximum number of surviving symbol replicas at each stage is set to Mcirc=16