Abstract
Breadth first tree search algorithms are intended to search its lattice points by using breadth first search method; guarantees optimal BER performance without the need for an estimate of SNR. However, one such breadth first signal decoder (BSIDE) algorithm, usually, searches more nodes in the tree and incurs a higher implementation complexity. A signal processing technique capable of minimizing the number of multipliers needed for realizing the processing unit of the breadth first signal decoder is proposed. The proposed signal passing technique reduces 86% of computational complexity for 2 × 2 and 99% for 4 × 4 multiple input multiple output (MIMO) systems with similar performance as that of BSIDE.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gesbert D, Shafi M, Shiu DS, Smith PJ, Naguib A (2003) From theory to practice: an overview of MIMO space-time coded wireless systems. IEEE J Sel Areas Commun 21(3):281–302
Yang S, Hanzo L (2015) Fifty years of MIMO detection: the road to large-scale MIMO. IEEE Commun Surv Tutorials 17(4):1941–1988
Chang MX, Chang WY (2017) Maximum-likelihood detection for MIMO systems based on differential metrics. IEEE Trans Signal Process 65(14):3718–3732
Hijazi H, Haroun A, Saad M, Al Ghouwayel AC, Dhayni A (2021) Near-optimal performance with low-complexity ML-based detector for MIMO spatial multiplexing. IEEE Commun Lett 25(1):122–126
Chen RH, Chung WH (2012) Reduced complexity MIMO detection scheme using statistical search space reduction. IEEE Commun Lett 3(16):292–295
Mansour M, Alex SP, Jalloul LMA (2014) Reduced complexity soft output MIMO sphere detectors-part I: algorithmic optimizations. IEEE Trans Signal Process 21(62):5505–5520
Shen CA, Eltawil AM, Salama KN, Mondal S (2012) A best-first soft/hard decision tree searching MIMO decoder for a 4 x 4 64-QAM system. IEEE Trans Very Large Scale Integr (VLSI) Syst 8(20):1537–1554
Cher Q, Wu J, Zheng YR, Wang Z (2013) Two stage list sphere decoding for under determined multiple input multiple output systems. IEEE Trans Wirel Commun 12(12):6476–6487
Han S, Cui T, Tellambura C (2012) Improved K-best sphere detection for uncoded and coded MIMO systems. IEEE Wirel Commun Lett 5(1):472–475
Kim TH, Park IC (2010) High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra’s search. IEEE Trans Circ Syst I: Reg Papers 57(7):1756–1766
Roger S, Ramiro C, Gonzalez A, Almenar V, Vidal AM (2011) Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors. Elsevier J Comp Electr Eng 4(37):451–460
Kim TH (2015) Low-complexity constant multiplication for layer processing in MIMO symbol detection. IET Electron Lett 51(13):989–991
Kang HG, Song I, Oh J, Lee J, Yoon S (2008) Breadth-first signal decoder: a novel maximum likelihood scheme for multi input multi output systems. IEEE Trans Veh Technol 3(57):1576–1583
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Jothikumar, R., Rangasamy, N. (2023). Complexity Reduction by Signal Passing Technique in MIMO Decoders. In: Reddy, K.A., Devi, B.R., George, B., Raju, K.S., Sellathurai, M. (eds) Proceedings of Fourth International Conference on Computer and Communication Technologies. Lecture Notes in Networks and Systems, vol 606. Springer, Singapore. https://doi.org/10.1007/978-981-19-8563-8_22
Download citation
DOI: https://doi.org/10.1007/978-981-19-8563-8_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-8562-1
Online ISBN: 978-981-19-8563-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)