Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2505.09978 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918021401935872 |
|---|---|
| author | Lin, Mao-Chao Lee, Shih-Kai Lin, Pin Lin, Ching-Chang Chen, Chia-Chun Syu, Teng-Yuan Lee, Huang-Chang |
| author_facet | Lin, Mao-Chao Lee, Shih-Kai Lin, Pin Lin, Ching-Chang Chen, Chia-Chun Syu, Teng-Yuan Lee, Huang-Chang |
| contents | To decode a short linear block code, ordered statics decoding (OSD) and/or the $A^*$ decoding are usually considered. Either OSD or the $A^*$ decoding utilizes the magnitudes of the received symbols to establish the most reliable and independent positions (MRIP) frame. A restricted searched space can be employed to achieve near-optimum decoding with reduced decoding complexity. For a low-rate code with large minimum distance, the restricted search space is still very huge.
We propose to use concatenated coding to further restrict the search space by proposing an improved MRIP frame. The improved MRIP frame is founded according to magnitudes of log likelihood ratios (LLRs) obtained by the soft-in soft-out (SISO) decoder for the inner code.
We focus on the construction and decoding of several $(n,k)$ = (128,36) binary linear block codes based on concatenated coding. We use the (128,36) extended BCH (eBCH) code as a benchmark for comparison. Simulation shows that there exist constructed concatenated codes which are much more efficient than the (128,36) eBCH code. Some other codes of length 128 or close to 128 are also constructed to demonstrate the efficiency of the proposed scheme. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_09978 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure Lin, Mao-Chao Lee, Shih-Kai Lin, Pin Lin, Ching-Chang Chen, Chia-Chun Syu, Teng-Yuan Lee, Huang-Chang Information Theory Signal Processing To decode a short linear block code, ordered statics decoding (OSD) and/or the $A^*$ decoding are usually considered. Either OSD or the $A^*$ decoding utilizes the magnitudes of the received symbols to establish the most reliable and independent positions (MRIP) frame. A restricted searched space can be employed to achieve near-optimum decoding with reduced decoding complexity. For a low-rate code with large minimum distance, the restricted search space is still very huge. We propose to use concatenated coding to further restrict the search space by proposing an improved MRIP frame. The improved MRIP frame is founded according to magnitudes of log likelihood ratios (LLRs) obtained by the soft-in soft-out (SISO) decoder for the inner code. We focus on the construction and decoding of several $(n,k)$ = (128,36) binary linear block codes based on concatenated coding. We use the (128,36) extended BCH (eBCH) code as a benchmark for comparison. Simulation shows that there exist constructed concatenated codes which are much more efficient than the (128,36) eBCH code. Some other codes of length 128 or close to 128 are also constructed to demonstrate the efficiency of the proposed scheme. |
| title | Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2505.09978 |