Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes
保存先:
| 出版年: | Entropy vol. 27, no. 4 (2025), p. 424 |
|---|---|
| 第一著者: | |
| その他の著者: | , , |
| 出版事項: |
MDPI AG
|
| 主題: | |
| オンライン･アクセス: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3194593928 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1099-4300 | ||
| 024 | 7 | |a 10.3390/e27040424 |2 doi | |
| 035 | |a 3194593928 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 231460 |2 nlm | ||
| 100 | 1 | |a Tian Kairui |u School of Electronic and Information Engineering, Beihang University, Beijing 100191, China; philtian@buaa.edu.cn (K.T.); sunele@nus.edu.sg (H.S.); ykliu@buaa.edu.cn (Y.L.) | |
| 245 | 1 | |a Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a By exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths. However, the appealing performance of AE-SC decoding arises from the diversity gain that requires a list of SC decoding attempts, which results in a high decoding complexity. To address this issue, this paper proposes a novel quasi-optimal path convergence (QOPC)-aided early termination (ET) technique for AE-SC decoding. This technique detects strong convergence between the partial path metrics (PPMs) of SC constituent decoders to reliably identify the optimal decoding path at runtime. When the QOPC-based ET criterion is satisfied during the AE-SC decoding, only the identified path is allowed to proceed for a complete codeword estimate, while the remaining paths are terminated early. The numerical results demonstrated that for medium-to-high-rate RM codes in the short-length regime, the proposed QOPC-aided ET method incurred negligible performance loss when applied to fully parallel AE-SC decoding. Meanwhile, it achieved a complexity reduction that ranged from 35.9% to 47.4% at a target block error rate (BLER) of <inline-formula>10−3</inline-formula>, where it consistently outperformed a state-of-the-art path metric threshold (PMT)-aided ET method. Additionally, under a partially parallel framework of AE-SC decoding, the proposed QOPC-aided ET method achieved a greater complexity reduction that ranged from 81.3% to 86.7% at a low BLER that approached <inline-formula>10−5</inline-formula> while maintaining a near-ML decoding performance. | |
| 653 | |a Decoders | ||
| 653 | |a Methods | ||
| 653 | |a Codes | ||
| 653 | |a Convergence | ||
| 653 | |a Complexity | ||
| 653 | |a Decoding | ||
| 653 | |a Maximum likelihood decoding | ||
| 653 | |a Automorphisms | ||
| 700 | 1 | |a Sun, He |u School of Electronic and Information Engineering, Beihang University, Beijing 100191, China; philtian@buaa.edu.cn (K.T.); sunele@nus.edu.sg (H.S.); ykliu@buaa.edu.cn (Y.L.) | |
| 700 | 1 | |a Liu Yukai |u School of Electronic and Information Engineering, Beihang University, Beijing 100191, China; philtian@buaa.edu.cn (K.T.); sunele@nus.edu.sg (H.S.); ykliu@buaa.edu.cn (Y.L.) | |
| 700 | 1 | |a Liu Rongke |u School of Electronic and Information Engineering, Beihang University, Beijing 100191, China; philtian@buaa.edu.cn (K.T.); sunele@nus.edu.sg (H.S.); ykliu@buaa.edu.cn (Y.L.) | |
| 773 | 0 | |t Entropy |g vol. 27, no. 4 (2025), p. 424 | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3194593928/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3194593928/fulltextwithgraphics/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3194593928/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |