A Very Fast Joint Detection for Polar-Coded SCMA
We propose a very fast-convergence joint iterative detection and decoding (JIDD) scheme for channel-coded sparse code multiple access (SCMA). In the conventional JIDD, all users’ channel decoding iterations are performed in parallel after all users’ variable nodes in the SCMA f...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9751596/ |
| _version_ | 1818022318642823168 |
|---|---|
| author | Dongjun Na Won-Gi Seo Hongsuk Shim Kwanwoong Ryu Kwonhue Choi |
| author_facet | Dongjun Na Won-Gi Seo Hongsuk Shim Kwanwoong Ryu Kwonhue Choi |
| author_sort | Dongjun Na |
| collection | DOAJ |
| description | We propose a very fast-convergence joint iterative detection and decoding (JIDD) scheme for channel-coded sparse code multiple access (SCMA). In the conventional JIDD, all users’ channel decoding iterations are performed in parallel after all users’ variable nodes in the SCMA factor graph are updated. The proposed JIDD scheme, however, slices all channel decoding iterations into per-user channel decoding, and inserts them deeply into the factor graph. By doing this, message enhancement by channel decoding immediately propagates to the connected users’ messages in the factor graph, even within one message passing algorithm iteration, while maintaining the same total computational complexity per JIDD iteration. Numerical results confirm that in various link scenarios, the proposed scheme requires only two or three iterations for BER convergence, while the conventional JIDD scheme requires more than six iterations. In downlink scenarios, the proposed scheme achieves an even faster convergence rate. Moreover, in a uplink scenario with perfect power control, the converged BER of the proposed scheme is quite a bit lower than the conventional scheme, and the proposed scheme requires only two iterations to get the same BER level as the conventional scheme. Consequently, thanks to fast convergence, the proposed scheme dramatically reduces the overall computational complexity for achieving BER convergence. In addition, the fast convergence rate compensates for the multi-user detection latency issue, which is inherent in sequential algorithms, and the issue is further overcome by employing the group-wise sequential version of the proposed scheme. |
| first_indexed | 2024-04-14T08:30:50Z |
| format | Article |
| id | doaj.art-37919270369f4874891c280cbaf7a09b |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-14T08:30:50Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-37919270369f4874891c280cbaf7a09b2022-12-22T02:03:56ZengIEEEIEEE Access2169-35362022-01-0110385343854410.1109/ACCESS.2022.31655829751596A Very Fast Joint Detection for Polar-Coded SCMADongjun Na0https://orcid.org/0000-0002-1656-4113Won-Gi Seo1Hongsuk Shim2Kwanwoong Ryu3https://orcid.org/0000-0001-6730-7099Kwonhue Choi4https://orcid.org/0000-0002-1755-0186Department of Information and Communication Engineering, Yeungnam University, Gyeongsan-si, South KoreaNextwill, Daejeon, South KoreaHanwha Systems, Seongnam-si, South KoreaElectronics and Telecommunication Research Institute (ETRI), Daejeon, South KoreaDepartment of Information and Communication Engineering, Yeungnam University, Gyeongsan-si, South KoreaWe propose a very fast-convergence joint iterative detection and decoding (JIDD) scheme for channel-coded sparse code multiple access (SCMA). In the conventional JIDD, all users’ channel decoding iterations are performed in parallel after all users’ variable nodes in the SCMA factor graph are updated. The proposed JIDD scheme, however, slices all channel decoding iterations into per-user channel decoding, and inserts them deeply into the factor graph. By doing this, message enhancement by channel decoding immediately propagates to the connected users’ messages in the factor graph, even within one message passing algorithm iteration, while maintaining the same total computational complexity per JIDD iteration. Numerical results confirm that in various link scenarios, the proposed scheme requires only two or three iterations for BER convergence, while the conventional JIDD scheme requires more than six iterations. In downlink scenarios, the proposed scheme achieves an even faster convergence rate. Moreover, in a uplink scenario with perfect power control, the converged BER of the proposed scheme is quite a bit lower than the conventional scheme, and the proposed scheme requires only two iterations to get the same BER level as the conventional scheme. Consequently, thanks to fast convergence, the proposed scheme dramatically reduces the overall computational complexity for achieving BER convergence. In addition, the fast convergence rate compensates for the multi-user detection latency issue, which is inherent in sequential algorithms, and the issue is further overcome by employing the group-wise sequential version of the proposed scheme.https://ieeexplore.ieee.org/document/9751596/Decodingiterative detectionjoint detectionpolar codeSCMA |
| spellingShingle | Dongjun Na Won-Gi Seo Hongsuk Shim Kwanwoong Ryu Kwonhue Choi A Very Fast Joint Detection for Polar-Coded SCMA IEEE Access Decoding iterative detection joint detection polar code SCMA |
| title | A Very Fast Joint Detection for Polar-Coded SCMA |
| title_full | A Very Fast Joint Detection for Polar-Coded SCMA |
| title_fullStr | A Very Fast Joint Detection for Polar-Coded SCMA |
| title_full_unstemmed | A Very Fast Joint Detection for Polar-Coded SCMA |
| title_short | A Very Fast Joint Detection for Polar-Coded SCMA |
| title_sort | very fast joint detection for polar coded scma |
| topic | Decoding iterative detection joint detection polar code SCMA |
| url | https://ieeexplore.ieee.org/document/9751596/ |
| work_keys_str_mv | AT dongjunna averyfastjointdetectionforpolarcodedscma AT wongiseo averyfastjointdetectionforpolarcodedscma AT hongsukshim averyfastjointdetectionforpolarcodedscma AT kwanwoongryu averyfastjointdetectionforpolarcodedscma AT kwonhuechoi averyfastjointdetectionforpolarcodedscma AT dongjunna veryfastjointdetectionforpolarcodedscma AT wongiseo veryfastjointdetectionforpolarcodedscma AT hongsukshim veryfastjointdetectionforpolarcodedscma AT kwanwoongryu veryfastjointdetectionforpolarcodedscma AT kwonhuechoi veryfastjointdetectionforpolarcodedscma |