The Component-Interleaved Golden Code and Its Low-Complexity Detection
In this paper, component interleaving for the Golden code is investigated. The proposed component-interleaved Golden code (CI-Golden code) not only preserves the full rate and full diversity of the conventional Golden code, but also achieves signal space diversity. The maximum-likelihood detection c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9044868/ |
| _version_ | 1818433410812608512 |
|---|---|
| author | Hongjun Xu Narushan Pillay |
| author_facet | Hongjun Xu Narushan Pillay |
| author_sort | Hongjun Xu |
| collection | DOAJ |
| description | In this paper, component interleaving for the Golden code is investigated. The proposed component-interleaved Golden code (CI-Golden code) not only preserves the full rate and full diversity of the conventional Golden code, but also achieves signal space diversity. The maximum-likelihood detection complexity of the CI-Golden code is proportional to $\mathcal {O}(M^{8})$ for $M$ -ary quadrature amplitude modulation ($M$ QAM) and is extremely high. Hence, two low-complexity detection schemes, a QR decomposition-based detection scheme and sphere decoding with detection subset, are proposed. Furthermore, the bound on average bit error probability (ABEP) for the $M$ QAM CI-Golden code, which is valid for more than 2 receive antennas is formulated. Simulation results show that the two proposed low-complexity detection schemes can converge to the ABEP for more than two receive antennas. Both the ABEP and simulation results show that the proposed CI-Golden code with three and four receive antennas can achieve a signal-to-noise ratio gain of more than 1.6 dB at a bit error rate of $1\times 10^{-5}$ for 16QAM and 64QAM, respectively, compared to the conventional Golden code. The computational complexity for the proposed schemes is further discussed. |
| first_indexed | 2024-12-14T16:20:39Z |
| format | Article |
| id | doaj.art-126203f12f2942219115e820f98c64e4 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T16:20:39Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-126203f12f2942219115e820f98c64e42022-12-21T22:54:48ZengIEEEIEEE Access2169-35362020-01-018595505955810.1109/ACCESS.2020.29826739044868The Component-Interleaved Golden Code and Its Low-Complexity DetectionHongjun Xu0https://orcid.org/0000-0002-5768-1965Narushan Pillay1https://orcid.org/0000-0002-2494-1855School of Engineering, University of KwaZulu-Natal, Durban, South AfricaSchool of Engineering, University of KwaZulu-Natal, Durban, South AfricaIn this paper, component interleaving for the Golden code is investigated. The proposed component-interleaved Golden code (CI-Golden code) not only preserves the full rate and full diversity of the conventional Golden code, but also achieves signal space diversity. The maximum-likelihood detection complexity of the CI-Golden code is proportional to $\mathcal {O}(M^{8})$ for $M$ -ary quadrature amplitude modulation ($M$ QAM) and is extremely high. Hence, two low-complexity detection schemes, a QR decomposition-based detection scheme and sphere decoding with detection subset, are proposed. Furthermore, the bound on average bit error probability (ABEP) for the $M$ QAM CI-Golden code, which is valid for more than 2 receive antennas is formulated. Simulation results show that the two proposed low-complexity detection schemes can converge to the ABEP for more than two receive antennas. Both the ABEP and simulation results show that the proposed CI-Golden code with three and four receive antennas can achieve a signal-to-noise ratio gain of more than 1.6 dB at a bit error rate of $1\times 10^{-5}$ for 16QAM and 64QAM, respectively, compared to the conventional Golden code. The computational complexity for the proposed schemes is further discussed.https://ieeexplore.ieee.org/document/9044868/Component-interleaved Golden codedetection subsetGolden codefast essentially maximum-likelihood detectionQR decomposition-based detectionsignal space diversity |
| spellingShingle | Hongjun Xu Narushan Pillay The Component-Interleaved Golden Code and Its Low-Complexity Detection IEEE Access Component-interleaved Golden code detection subset Golden code fast essentially maximum-likelihood detection QR decomposition-based detection signal space diversity |
| title | The Component-Interleaved Golden Code and Its Low-Complexity Detection |
| title_full | The Component-Interleaved Golden Code and Its Low-Complexity Detection |
| title_fullStr | The Component-Interleaved Golden Code and Its Low-Complexity Detection |
| title_full_unstemmed | The Component-Interleaved Golden Code and Its Low-Complexity Detection |
| title_short | The Component-Interleaved Golden Code and Its Low-Complexity Detection |
| title_sort | component interleaved golden code and its low complexity detection |
| topic | Component-interleaved Golden code detection subset Golden code fast essentially maximum-likelihood detection QR decomposition-based detection signal space diversity |
| url | https://ieeexplore.ieee.org/document/9044868/ |
| work_keys_str_mv | AT hongjunxu thecomponentinterleavedgoldencodeanditslowcomplexitydetection AT narushanpillay thecomponentinterleavedgoldencodeanditslowcomplexitydetection AT hongjunxu componentinterleavedgoldencodeanditslowcomplexitydetection AT narushanpillay componentinterleavedgoldencodeanditslowcomplexitydetection |