Reduced Complexity Tree Search Algorithms for MIMO Decoding
Maximum Likelihood Decoding (MLD) is computationally complex technique for decoding received information in multiple input multiple output (MIMO) systems. Tree search algorithms such as sphere decoding (SD) and QR decomposition with M survivals (QRD-M) are used to reduce the complexity keeping the p...
Main Authors: | Gajanan R Patil, Vishwanath K Kokate |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Communications and Information Society (CCIS)
2014-12-01
|
Series: | Journal of Communications Software and Systems |
Subjects: | |
Online Access: | https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/119 |
Similar Items
-
Adaptive Threshold-Aided K-Best Sphere Decoding for Large MIMO Systems
by: Uzokboy Ummatov, et al.
Published: (2019-10-01) -
Learning-Aided Deep Path Prediction for Sphere Decoding in Large MIMO Systems
by: Doyeon Weon, et al.
Published: (2020-01-01) -
Hardware Implementation and Performance Analysis of Improved Sphere Decoder in Spatially Correlated Massive MIMO Channels
by: Dimitris Vordonis, et al.
Published: (2021-01-01) -
Optimal Precoder Selection for Spatially Multiplexed Multiple-Input Multiple-Output Systems With Maximum Likelihood Detection: Exploiting the Concept of Sphere Decoding
by: Woosung Hwang, et al.
Published: (2020-01-01) -
Deep Learning Detection in MIMO Decode-Forward Relay Channels
by: Xianglan Jin, et al.
Published: (2019-01-01)