Abstract

Lossless turbo source coding with decremental redundancy is an effective approach for compressing binary sources. A large block length lossless turbo source encoder offers compression rates close to the source entropy but with large latency. In this letter, we propose a lossless compression technique for binary memoryless sources using short block length turbo codes. To achieve compression rates close to the source entropy, we modify different components of the encoder. We focus on the design of the parity interleaver for different compression rates. Also, we replace the square shape puncturing array with a rectangular shape array that allows finer puncturing and hence improved compression rates. Finally, instead of a single code, we employ many codes operating in parallel. Given these modifications, we evaluate the encoding complexity of the proposed code

Full Text
Published version (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