Distributed Source Coding with Optimized Irregular Turbo Codes

We address the problem of distributed source coding of binary sources with side information at the decoder. We propose a compression scheme using irregular turbo codes. We optimize them by maximizing the distance between the two curves of their EXIT charts for given statistics and a compression rate close to the Slepian-Wolf limit in order to increase the robustness of the scheme. This optimized irregular code enables us to achieve compression rates superior to the ones achieved by previously proposed turbo schemes without increasing the decoding complexity.