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: | , |
|---|---|
| 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 |
| _version_ | 1819262460709830656 |
|---|---|
| author | Gajanan R Patil Vishwanath K Kokate |
| author_facet | Gajanan R Patil Vishwanath K Kokate |
| author_sort | Gajanan R Patil |
| collection | DOAJ |
| description | 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 performance near ML. This paper presents two techniques for reducing the computational complexities of the tree search algorithms further. The first technique is based on selecting the initial radius for sphere decoding. The main contribution of this paper is that the greedy best first search is used to compute initial radius, instead of Babai estimate. The second contribution is, QRD-M algorithm is modified to prune the nodes in the current layer based on maximum metric of child nodes of smallest surviving node. The performance of the proposed techniques is tested for different MIMO systems in terms of bit error rates (BER) and average number of nodes visited. The proposed schemes have improved computational complexity with no degradation of performance. |
| first_indexed | 2024-12-23T19:58:03Z |
| format | Article |
| id | doaj.art-3fcbc2ca099a4e38b9a09eba1c47c094 |
| institution | Directory Open Access Journal |
| issn | 1845-6421 1846-6079 |
| language | English |
| last_indexed | 2024-12-23T19:58:03Z |
| publishDate | 2014-12-01 |
| publisher | Croatian Communications and Information Society (CCIS) |
| record_format | Article |
| series | Journal of Communications Software and Systems |
| spelling | doaj.art-3fcbc2ca099a4e38b9a09eba1c47c0942022-12-21T17:33:09ZengCroatian Communications and Information Society (CCIS)Journal of Communications Software and Systems1845-64211846-60792014-12-01104230236Reduced Complexity Tree Search Algorithms for MIMO DecodingGajanan R PatilVishwanath K KokateMaximum 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 performance near ML. This paper presents two techniques for reducing the computational complexities of the tree search algorithms further. The first technique is based on selecting the initial radius for sphere decoding. The main contribution of this paper is that the greedy best first search is used to compute initial radius, instead of Babai estimate. The second contribution is, QRD-M algorithm is modified to prune the nodes in the current layer based on maximum metric of child nodes of smallest surviving node. The performance of the proposed techniques is tested for different MIMO systems in terms of bit error rates (BER) and average number of nodes visited. The proposed schemes have improved computational complexity with no degradation of performance.https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/119Best First SearchMaximum Likelihood DecodingMIMOQRD-MSphere decoding |
| spellingShingle | Gajanan R Patil Vishwanath K Kokate Reduced Complexity Tree Search Algorithms for MIMO Decoding Journal of Communications Software and Systems Best First Search Maximum Likelihood Decoding MIMO QRD-M Sphere decoding |
| title | Reduced Complexity Tree Search Algorithms for MIMO Decoding |
| title_full | Reduced Complexity Tree Search Algorithms for MIMO Decoding |
| title_fullStr | Reduced Complexity Tree Search Algorithms for MIMO Decoding |
| title_full_unstemmed | Reduced Complexity Tree Search Algorithms for MIMO Decoding |
| title_short | Reduced Complexity Tree Search Algorithms for MIMO Decoding |
| title_sort | reduced complexity tree search algorithms for mimo decoding |
| topic | Best First Search Maximum Likelihood Decoding MIMO QRD-M Sphere decoding |
| url | https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/119 |
| work_keys_str_mv | AT gajananrpatil reducedcomplexitytreesearchalgorithmsformimodecoding AT vishwanathkkokate reducedcomplexitytreesearchalgorithmsformimodecoding |