Babai-guided Interference-aware Adaptive QRD-M Detection in MIMO-OFDM Communication Systems
DOI:
https://doi.org/10.26636/jtit.2025.4.2290Keywords:
LLL lattice reduction, MIMO-OFDM systems, QRD-M detectionAbstract
This paper presents an adaptive QRD-M detection algorithm designed to reduce the computational complexity of MIMO systems while maintaining near-maximum likelihood detection (near-MLD) performance. The proposed method introduces a dynamic threshold mechanism based on a breadth-first tree search, where pruning is guided by both symbol reliability and interlayer interference derived from the upper-triangular structure of the QR-decomposed channel matrix. The threshold is further refined using a Babai estimate obtained from Lenstra-Lenstra-Lovász (LLL) lattice reduction, allowing the algorithm to adaptively adjust the candidate set at each detection stage. The simulation results across 4 × 4 and 8 × 8 MIMO systems using 16-QAM and 64-QAM modulation schemes demonstrate that the proposed Babai-guided interference-aware adaptive QRD-M (BIA-QRD-M) algorithm achieves near-MLD performance. The proposed method achieves a reduction of up to 49% in the average number of branch metric computations at high SNR and an approximately 29% reduction over the entire 0-25 dB SNR range, compared to conventional QRD-M in an 8 × 8 MIMO-OFDM system with 16-QAM modulation.
Downloads
References
[1] K. Miura, "An Introduction to Maximum Likelihood Estimation and Information Geometry", Interdisciplinary Information Sciences, vol. 17, pp. 155-174, 2011. DOI: https://doi.org/10.4036/iis.2011.155
View in Google Scholar
[2] Q. Zhou and X. Ma, "Element-based Lattice Reduction Algorithms for Large MIMO Detection", IEEE Journal on Selected Areas in Communications, vol. 31, pp. 274-286, 2013. DOI: https://doi.org/10.1109/JSAC.2013.130215
View in Google Scholar
[3] M.O. Damen, H. El Gamal, and G. Caire, "On Maximum-likelihood Detection and the Search for the Closest Lattice Point", IEEE Transactions on Information Theory, vol. 49, pp. 2389-2402, 2003. DOI: https://doi.org/10.1109/TIT.2003.817444
View in Google Scholar
[4] W.H. Chin, "QRD Based Tree Search Data Detection for MIMO Communication Systems", 2005 IEEE 61st Vehicular Technology Conference, Stockholm, Sweden, 2005.
View in Google Scholar
[5] M. Mohaisen and K. Chang, "Upper-lower Bounded-complexity QRD-M for Spatial Multiplexing MIMO-OFDM Systems", Wireless Personal Communications, vol. 61, pp. 129-141, 2011. DOI: https://doi.org/10.1007/s11277-010-0014-8
View in Google Scholar
[6] U. Ummatov and K. Lee, "Adaptive Threshold-aided K-best Sphere Decoding for Large MIMO Systems", Applied Sciences, vol. 9, art. no. 4624, 2019. DOI: https://doi.org/10.3390/app9214624
View in Google Scholar
[7] J.-H. Ro, J.-K. Kim, Y.-H. You, and H.-K. Song, "Low-complexity QRD-M with Path Eliminations in MIMO-OFDM Systems", Applied Sciences, vol. 7, art. no. 1206, 2017. DOI: https://doi.org/10.3390/app7121206
View in Google Scholar
[8] S.-J. Choi et al., "Novel MIMO Detection with Improved Complexity for Near-ML Detection in MIMO-OFDM Systems", IEEE Access, vol. 7, pp. 60389-60398, 2019. DOI: https://doi.org/10.1109/ACCESS.2019.2914707
View in Google Scholar
[9] B.S. Kim, S.D. Kim, D. Na, and K. Choi, "A Very Low Complexity QRD-M MIMO Detection Based on Adaptive Search Area", Electronics, vol. 9, art. no. 756, 2020. DOI: https://doi.org/10.3390/electronics9050756
View in Google Scholar
[10] H. Liu et al., "A Novel Iterative Detection Method Based on a Lattice Reduction-aided Algorithm for MIMO OFDM Systems", Scientific Reports, vol. 14, art. no. 2779, 2024. DOI: https://doi.org/10.1038/s41598-024-52602-6
View in Google Scholar
[11] X. Zhou et al., "Model-driven Deep Learning-based MIMO-OFDM Detector: Design, Simulation, and Experimental Results", IEEE Transactions on Communications, vol. 70, pp. 5193-5207, 2022. DOI: https://doi.org/10.1109/TCOMM.2022.3186404
View in Google Scholar
[12] T.-D. Chiueh, P.-Y. Tsai, and I.-W. Lai, Baseband Receiver Design for Wireless MIMO-OFDM Communications, Wiley, 346 p., 2012. DOI: https://doi.org/10.1002/9781118188194
View in Google Scholar
[13] A. Ghasemmehdi and E. Agrell, "Faster Recursions in Sphere Decoding", IEEE Transactions on Information Theory, vol. 57, pp. 3530-3536, 2011. DOI: https://doi.org/10.1109/TIT.2011.2143830
View in Google Scholar
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Mar Mar Lwin, Mohd Fadzli Mohd Salleh

This work is licensed under a Creative Commons Attribution 4.0 International License.