Abstract
In this paper, we propose a novel successive cancellation flip (SCF) decoding to reduce the computational complexity compared to the conventional SCF decoding by using distributed CRC bits. The proposed decoding reduces the number of estimations for information bits by early termination of decodings for failed frames of the first SC decoding, while trying to minimize the additional sorting operations. Simulation results show that the proposed SCF decoding reduces the computational complexity of repeated SC decoding at least 27% compared to the conventional SCF decoding.
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.
