Method for decoding sequential algebraic cascade convolutional codes for mobile communication systems
DOI:
https://doi.org/10.30837/rt.2025.1.220.16Keywords:
algebraic, cascade, convolutional, code, decoding, mobile, communicationAbstract
The development of radio communication technologies allows the introduction of the latest electronic communication services that impose strict requirements on the quality of data transmission. To increase the efficiency and reliability of data transmission in these electronic communications systems, it is advisable to use parallel and sequential cascade code structures. It is shown that the construction of sequential cascade code structures for mobile communication systems can be carried out on the basis of various component codes and corresponding decoders. This makes it possible to adjust the characteristics of these codes depending on the existing requirements and parameters of the communication channel.
A sequential algebraic cascade coding scheme is proposed, where the outer stage is implemented based on a non-binary Reed-Solomon block code, and the inner stage is implemented using a non-recursive algebraic convolutional code. A block interleaver is used between these stages. A distinctive feature of this scheme is the use of an algebraic convolutional code with the maximum achievable correction capability. This is achieved by constructing this code based on the generator polynomial of the Reed-Solomon code.
A method for decoding sequential algebraic cascade convolutional codes based on a combination of two decoders has been developed. At the first stage, the internal code is decoded using ordered statistics. Within this stage, the most reliable basis is initially found based on the reliability of the symbols of the received sequence. Test error vectors of a given Hamming weight are added to the found basis, resulting in a set of test code blocks. The search for the estimate of the transmitted code block is carried out on the basis of minimizing the weighted Hamming weight between the formed code blocks and the accepted estimate of the code block. At the next stage, the accepted vector for the outer code is formed by inversely permuting the found estimate of the code block in the block interleaver. At the final stage, algebraic decoding of the Reed-Solomon code occurs based on the Berlekamp-Massey algorithm.
References
G. Pocovi, T. Kolding and K. I. Pedersen. On the Cost of Achieving Downlink Ultra-Reliable Low-Latency Communications in 5G Networks // IEEE Access. 2022. Vol. 10. P. 29506–29513. doi: 10.1109/ACCESS.2022.3158361.
A. M. Aslam, R. Chaudhary, A. Bhardwaj, I. Budhiraja, N. Kumar and S. Zeadally. Metaverse for 6G and Be-yond: The Next Revolution and Deployment Challenges // IEEE Internet of Things Magazine. March 2023. Vol. 6, no. 1. P. 32–39. doi: 10.1109/IOTM.001.2200248.
H. Zhang and W. Tong. Channel Coding for 6G Extreme Connectivity–Requirements, Capabilities, and Fun-damental Tradeoffs // IEEE BITS the Information Theory Magazine. March 2023. Vol. 3, no. 1. P. 54–66. doi: 10.1109/MBITS.2023.3322978.
M. Geiselhart, F. Krieg, J. Clausius, D. Tandler and S. ten Brink. 6G: A Welcome Chance to Unify Channel Coding? // IEEE BITS the Information Theory Magazine. March 2023. Vol 3, no. 1. P. 67–80. doi: 10.1109/MBITS.2023.3322974.
M. Rowshan, M. Qiu, Y. Xie, X. Gu and J. Yuan. Channel Coding Toward 6G: Technical Overview and Out-look // IEEE Open Journal of the Communications Society. 2024. Vol. 5. P. 2585–2685. doi: 10.1109/OJCOMS.2024.3390000.
M. M. Azeem, R. Abozariba and A. T. Asyhari. Exploiting Short Block and Concatenated Codes for Reliable Communications Within the Coexistence of 5G-NR-U and WiFi // IEEE Transactions on Vehicular Technology. Feb. 2023. Vol. 72, no. 2. P. 1893–1908. doi: 10.1109/TVT.2022.3208933.
J. Wang and Z. Wang. Research on Parallel Turbo Encoding and Decoding Technology // 2024 IEEE 6th Ad-vanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), Chongqing, China, 2024. P. 1378–1381. doi: 10.1109/IMCEC59810.2024.10575400.
F. Namadchi, M. Shirvanimoghaddam and H. El Gamal. A Parallel Concatenated Coding Scheme and List-Based Decoding Algorithm for URLLC // 2024 IEEE Wireless Communications and Networking Conference (WCNC), Dubai, United Arab Emirates, 2024. P. 1–6. doi: 10.1109/WCNC57260.2024.10570864.
K. Ackah Bohulu and C. Han. Interleaver Design for Turbo Codes Based on Complete Knowledge of Low-Weight Codewords of RSC Codes // 2023 IEEE Wireless Communications and Networking Conference (WCNC), Glasgow, United Kingdom, 2023. P. 1–6. doi: 10.1109/WCNC55385.2023.10118656.
A. Y. Sukmadji and F. R. Kschischang. Performance-Complexity-Latency Trade-Offs of Concatenated RS-BCH Codes // IEEE Transactions on Communications. July 2024. Vol. 72, no. 7. P. 3829–3841. doi: 10.1109/TCOMM.2024.3369731.
X. Guo, W. Zhang, H. Wang, J. Zhao and Y. Liu. High-Performance Soft Decision Decoding for Compound Channel Using RS-SPC Concatenated Codes // IEEE Communications Letters. June 2023. Vol. 27, no. 6. P. 1481–1485. doi: 10.1109/LCOMM.2023.3266896.
X. Liu, W. Zhang, Y. Chang and Y. Liu. A Novel Concatenation Decoding of Reed-Solomon Codes With SPC Product Codes // IEEE Signal Processing Letters. 2023. Vol. 30. P. 808–812. doi: 10.1109/LSP.2023.3291653.
S. Panchenko et al. Analysis of Efficiency of the Bioinspired Method for Decoding Algebraic Convolutional Codes // Eastern-European Journal of Enterprise Technologies. Mar. 2019. Vol. 2, no. 4 (98). P. 22–30, https://doi.org/10.15587/1729-4061.2019.160753.
M. Shirvanimoghaddam et al. Short Block-Length Codes for Ultra-Reliable Low Latency Communications // IEEE Communications Magazine. February 2019. Vol. 57, no. 2. P. 130–137. doi: 10.1109/MCOM.2018.1800181.
C. Yue, M. Shirvanimoghaddam, B. Vucetic and Y. Li. A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules // IEEE Transactions on Information Theory. July 2021. Vol. 67, no. 7. P. 4288–4337. doi: 10.1109/TIT.2021.3078575.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
