Volume 33, Issue 7 e4496
RESEARCH ARTICLE

Dynamic branch pruning aided low switching fixed complexity sphere decoding for small scale and massive MIMO detection

Sourav Chakraborty

Corresponding Author

Sourav Chakraborty

Department of Electronics and Telecommunication Engineering, Indian Institute of Engineering Science and Technology, Shibpur, Howrah, West Bengal, India

Department of Electronics and Communication Engineering, Cooch Behar Government Engineering College, Cooch Behar, West Bengal, India

Correspondence

Sourav Chakraborty, Department of Electronics and Telecommunication Engineering, Indian Institute of Engineering Science and Technology, Shibpur, Howrah, West Bengal, India.

Email: [email protected]

Search for more papers by this author
Nirmalendu Bikas Sinha

Nirmalendu Bikas Sinha

Maharaja Nandakumar Mahavidyalaya, Purba Medinipur, West Bengal, India

Search for more papers by this author
Monojit Mitra

Monojit Mitra

Department of Electronics and Telecommunication Engineering, Indian Institute of Engineering Science and Technology, Shibpur, Howrah, West Bengal, India

Search for more papers by this author
First published: 29 March 2022

Abstract

In this article, we have proposed a dynamic branch pruning aided low switching fixed complexity sphere decoding (LSFSD) algorithm that can reduce the number of node visits in conventional fixed-complexity sphere decoder (FSD) or imbalanced fixed-complexity sphere decoder (IFSD) detector dynamically based on the channel condition. Further, we propose a low complexity QR-based FSD ordering scheme in the real domain that requires half of the number of real arithmetic operations in the conventional case. As a case study, we have simulated the proposed algorithm for urn:x-wiley:ett:media:ett4496:ett4496-math-0001 and urn:x-wiley:ett:media:ett4496:ett4496-math-0002 MIMO system with 64-QAM modulation. The simulation results show that the proposed algorithm can reduce approximately 50% of node visits to achieve a BER of urn:x-wiley:ett:media:ett4496:ett4496-math-0003. Additionally, a low complexity solution of the soft bit information generation method is also proposed. The concept is further extended to massive MIMO applications where the number of receiving antenna to transmit antenna ratio is close to one. A smaller node extension parameter is defined for the proposed detector to reduce the complexity in massive MIMO detection. Simulation results demonstrate that the proposed detection algorithm has significantly lower computational complexity than other recent state-of-the-art detection algorithms for massive MIMO and large MIMO systems.

CONFLICT OF INTEREST

The authors declare no potential conflict of interest.

DATA AVAILABILITY STATEMENT

Data sharing is not applicable to this article as no new data were created or analyzed in this study.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.