Reduced Complexity Iterative Decoding for Hamming-Based Turbo Product Code

This paper introduces a novel reduced complexity decoding algorithm for Hamming-based Turbo Product Codes. The proposed Most Reliable Available Route (MRAR) algorithm aims to minimize reliance on least reliable bits and maximize dependence on most reliable bits without resorting to Hard Decision Dec...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2024 6th International Conference on Computing and Informatics (ICCI) s. 166 - 173
Hlavní autori: Tawfik, Hazem, Mekkawy, Tamer, Mahran, Ashraf
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 06.03.2024
Predmet:
Bit error rate
Block Turbo Codes
Channel Coding
Decoding Complexity
Hard Decision Decoding
Instruments
Mathematical models
Product codes
Reliability
Simulation
Turbo codes
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper introduces a novel reduced complexity decoding algorithm for Hamming-based Turbo Product Codes. The proposed Most Reliable Available Route (MRAR) algorithm aims to minimize reliance on least reliable bits and maximize dependence on most reliable bits without resorting to Hard Decision Decoding (HDD) like most Turbo Product Code (TPC) iterative decoding algorithm. The MRAR algorithm utilizes an index table structure to speed-up reliability calculations. Complexity analysis shows significant computational reduction compared to conventional decoding complexity. Moreover, Bit Error Rate (BER) simulations show the effectiveness of the MRAR algorithm in enhancing TPC performance across various scenarios and code configurations.
DOI:10.1109/ICCI61671.2024.10485172