LAUSR

The conventional parity-check matrix transformation algorithm (PTA) requires matrix inversion to transform matrices of maximum distance separable (MDS) codes. However, such matrix transformation is not always guaranteed for the class of non-MDS codes. Hence, the PTA fails for binary cyclic (BC) codes. To overcome this limitation, we developed a generalized parity-check matrix transformation (GPT) algorithm for binary cyclic codes. The GPT avoids the matrix inversion step of the PTA. It permutes the columns of the parity-check matrix based on the reliability information from the channel. Results show a significant bit error rate (BER) performance gain as compared to the existing PTA. It also presents a reasonable BER performance as compared to the other soft-decision (SD) decoding algorithms. In addition, the decoder functions within a practical decoding time complexity, particularly at the message passing stage.