Abstract
Chase-Pyndiah algorithm is one of the decoding algorithms of Turbo Product Code(TPC).Based on that,an iterative decoding algorithm involved with correlation was introduced.This algorithm avoids the computation of Euclidean distance due to the use of correlation as the metric;and uses a comparative method in the choice of the concurrent codewords,which prevents the search of competition codeword.On the basis of this study,further simplification was presented,which decreased the complexity and the latency of the decoder.Both analysis and simulation result show the advantage of the proposed algorithm over conventional algorithm in speed and performance.
Sign-in/Register to access full text options 
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.
