Abstract
We propose a scheme for lossy compression of discrete memoryless sources: The compressor is the decoder of a nonlinear channel code, constructed from a sparse graph. We prove asymptotic optimality of the scheme for any separable (letter-by-letter) bounded distortion criterion. We also present a suboptimal compression algorithm, which exhibits near-optimal performance for moderate block lengths.
Original language | English (US) |
---|---|
Pages (from-to) | 1961-1975 |
Number of pages | 15 |
Journal | IEEE Transactions on Information Theory |
Volume | 55 |
Issue number | 5 |
DOIs | |
State | Published - 2009 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Discrete memoryless sources
- Lossy data compression
- Rate-distortion theory
- Source-channel coding duality
- Sparse-graph codes