Abstract | ||
---|---|---|
ABSTRACT We show how,concatenated (convolutional) codes can be used to compress,close to the Wyner-Ziv limit for binary sources. Focusing on the case of lossy compression,of an equiprobable memoryless,binary source with side informa- tion at the decoder, the approach is based on nested bi- nary linear codes, which is the extension of Wyner’s lossless compression scheme to the lossy case proposed by Shamai, Verdu and Zamir. Based on our previous work on loss- less compression with concatenated codes, we are able to combine,the only two previously suggested nested schemes into a novel turbo scheme,with improved performance. Our scheme can come within 0.09 bits from the theoretical limit, which to our knowledge,is the first result ever reported for the binary Wyner-Ziv problem. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1109/ICIP.2003.1247033 | ICIP |
Keywords | Field | DocType |
concatenated codes,convolutional codes,data compression,turbo codes,Wyner's lossless compression scheme,binary Wyner-Ziv problem,concatenated codes,nested convolutional-turbo codes | Concatenated error correction code,Convolutional code,Computer science,Block code,Serial concatenated convolutional codes,Turbo code,Theoretical computer science,Distributed source coding,Linear code,Data compression | Conference |
Volume | ISSN | Citations |
1 | 1522-4880 | 15 |
PageRank | References | Authors |
1.13 | 13 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Angelos D. Liveris | 1 | 552 | 27.92 |
Zixiang Xiong | 2 | 3444 | 275.03 |
Costas N. Georghiades | 3 | 301 | 32.18 |