Abstract
In this paper, a general matrix structure for shortened turbo product codes (TPC) and an improved decoding algorithm based on Chase decoder are presented. In the proposed algorithm, the decoding complexity is decreased by reducing the number of candidate codewords and, an efficient method to estimate the extrinsic information without competing codeword is designed, too. Compared with the conventional algorithm, simulation results show that considerable coding gains can be obtained by the proposed decoding algorithm with decreasing decoding complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
