ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 A Very Fast Joint Detection for Polar-Coded SCMA
Cited 2 time in scopus Download 124 time Share share facebook twitter linkedin kakaostory
저자
라동준, 서원기, 심홍석, 류관웅, 최권휴
발행일
202204
출처
IEEE Access, v.10, pp.38534-38544
ISSN
2169-3536
출판사
IEEE
DOI
https://dx.doi.org/10.1109/ACCESS.2022.3165582
협약과제
22HH9900, 민·군 공유주파수 환경기반 적응형 간섭 저감기술 개발, 김청섭
초록
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.
KSP 제안 키워드
Channel decoding, Computational complexity, Detection latency, Factor Graph, Faster convergence, Group-wise, Iterative Detection and Decoding(IDD), Joint detection, Multiuser detection, Numerical results, Power control(PC)
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)