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 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.