英 适使用TURBO码进行SW编码.pdfVIP

Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes Jing Li (Tiffany), Zhenyu Tu and Rick S. Blum Department of Electrical and Computer Engineering Lehigh University, Bethlehem, PA 18105 Abstract The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources are i.i.d but nonuniformly distributed. It is firstly shown that any algebraic binning scheme based on linear codes is optimal for nonuniform sources only asymptotically. Next two modifications are proposed to improve the performance of the turbo-binning scheme for nonuniform sources. The first is to carefully design the constituent encoder structures to maximally match the turbo code to the nonuniform source distribution, and the second is to use variable-length syndrome sequences to index the bins. Simulations show that the combination of both strategies can lead to an improvement of as much as 0.22 bit/symbol in overall compression rate for highly nonuniform sources. I. INTRODUCTION The lossless distributed source coding (DSC) problem, also known as the Slepian-Wolf problem, is an interesting problem that has close connections to a number of (network) information processing problems, like sensor networks, communication on broadcast chan- nels, watermarking and data hiding. To the best of the authors’ knowledge, the DSC research work so far has all assumed uniform sources. This is not always true in real life. For example, many uncompressed binary images (e.g. facsimile images) may have a source distribution as bi