Abstract
AbstractA novel source coding scheme based on turbo codes was recently presented. Lossless data compression is thereby achieved by puncturing data encoded with a turbo code while checking the integrity of the reconstructed information during compression. This paper addresses the generalisation of this compression scheme to iteratively decodable forward error correcting (FEC) codes. Furthermore, an alternative puncturing algorithm is presented which fine‐tunes the compression rate to any desired accuracy. Motivated by an area property which states that the area of the tunnel in the modified extrinsic information transfer (EXIT) chart is proportional to the gap between source coding rate and entropy we apply code optimisation tools to serially concatenated codes in order to minimise the tunnel. Numerical results show that compression rates close to the Shannon limit can be obtained by optimised irregular repeat accumulate codes. Copyright © 2006 AEIT.
Sign-in/Register to access full text options 
Free) 
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
