Reduced Complexity Detection Schemes for Golden Code Systems
The Golden code has full-rate and full-diversity. However, its applications are limited because of the very high detection complexity. The complexity of sphere decoding depends on the size of signal set, M<sup>2</sup>, and the depth of search. Meanwhile, the complexity of fast essentiall...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8845568/ |
| _version_ | 1818410959520137216 |
|---|---|
| author | Hongjun Xu Narushan Pillay |
| author_facet | Hongjun Xu Narushan Pillay |
| author_sort | Hongjun Xu |
| collection | DOAJ |
| description | The Golden code has full-rate and full-diversity. However, its applications are limited because of the very high detection complexity. The complexity of sphere decoding depends on the size of signal set, M<sup>2</sup>, and the depth of search. Meanwhile, the complexity of fast essentially maximum likelihood (ML) detection is still O(M<sup>2</sup>) for M-ary quadrature amplitude modulation (MQAM). In this paper, we propose two reduced complexity detection schemes, fast essentially ML with detection subset and sphere decoding with detection subset. Two theoretical bounds on the average bit error probability for the Golden code with MQAM are also formulated in this paper. Simulation results demonstrate that both the fast essentially ML with detection subset and sphere decoding with detection subset agree well with the formulated theoretical bounds and can achieve the error performance of the conventional fast essentially ML detector and sphere decoding. |
| first_indexed | 2024-12-14T10:23:48Z |
| format | Article |
| id | doaj.art-ddba5e4ca0084ba5958d241dd2614293 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T10:23:48Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-ddba5e4ca0084ba5958d241dd26142932022-12-21T23:06:28ZengIEEEIEEE Access2169-35362019-01-01713914013914910.1109/ACCESS.2019.29426448845568Reduced Complexity Detection Schemes for Golden Code SystemsHongjun Xu0Narushan Pillay1https://orcid.org/0000-0002-2494-1855School of Engineering, University of KwaZulu-Natal, Durban, South AfricaSchool of Engineering, University of KwaZulu-Natal, Durban, South AfricaThe Golden code has full-rate and full-diversity. However, its applications are limited because of the very high detection complexity. The complexity of sphere decoding depends on the size of signal set, M<sup>2</sup>, and the depth of search. Meanwhile, the complexity of fast essentially maximum likelihood (ML) detection is still O(M<sup>2</sup>) for M-ary quadrature amplitude modulation (MQAM). In this paper, we propose two reduced complexity detection schemes, fast essentially ML with detection subset and sphere decoding with detection subset. Two theoretical bounds on the average bit error probability for the Golden code with MQAM are also formulated in this paper. Simulation results demonstrate that both the fast essentially ML with detection subset and sphere decoding with detection subset agree well with the formulated theoretical bounds and can achieve the error performance of the conventional fast essentially ML detector and sphere decoding.https://ieeexplore.ieee.org/document/8845568/Fast essentially ML detectiongolden codeQR decomposition based detectionreduced complexity detectionsphere decoding |
| spellingShingle | Hongjun Xu Narushan Pillay Reduced Complexity Detection Schemes for Golden Code Systems IEEE Access Fast essentially ML detection golden code QR decomposition based detection reduced complexity detection sphere decoding |
| title | Reduced Complexity Detection Schemes for Golden Code Systems |
| title_full | Reduced Complexity Detection Schemes for Golden Code Systems |
| title_fullStr | Reduced Complexity Detection Schemes for Golden Code Systems |
| title_full_unstemmed | Reduced Complexity Detection Schemes for Golden Code Systems |
| title_short | Reduced Complexity Detection Schemes for Golden Code Systems |
| title_sort | reduced complexity detection schemes for golden code systems |
| topic | Fast essentially ML detection golden code QR decomposition based detection reduced complexity detection sphere decoding |
| url | https://ieeexplore.ieee.org/document/8845568/ |
| work_keys_str_mv | AT hongjunxu reducedcomplexitydetectionschemesforgoldencodesystems AT narushanpillay reducedcomplexitydetectionschemesforgoldencodesystems |