Abstract

Turbo codes adopt iterative decoding to increase the ability of error correction. However, the iterative method increases the decoding delay and power consumption. An effective approach is to decrease the number of iterations while tolerating slight performance degradation. We apply the clustered set partitioning in hierarchical trees for image coding. Different from other early stop criteria, we use the bit-error sensitivities from the image data. Then, the stop criterion is directly determined by the importance of image data. Simulation results show that our scheme can reduce more number of iterations with less degradation for peak-signal-to-noise ratio or structure similar performance.

Full Text
Paper version not known

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 call

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