Paper Info
Title
Practical codes for lossy compression when side information may be absent.
Abstract
Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for both decoders and an individual description for the decoder with side information. Then, the common description is losslessly compressed while the individual description is compressed using a LDPC code which exploits the side information in a belief propagation decoder. Simulation results show that the practical codes require no more than 0.46 extra bits at moderate rates and no more than 0.7 extra bits at low rates from the theoretical bounds.
Year
DOI
Venue
2011
10.1109/ICASSP.2011.5946301
ICASSP
Keywords
Field
DocType
decoding,parity check codes,trellis codes,2-refinement level SR-TCQ,LDPC codes,belief propagation decoder,low-density parity-check codes,practical codes,quadratic Gaussian lossy compression,side information,successively refinable trellis coded quantization,LDPC codes,SR-TCQ,Successive refinement
Source code,Low-density parity-check code,Computer science,Theoretical computer science,Artificial intelligence,Belief propagation,Pattern recognition,Lossy compression,Quadratic equation,Algorithm,Gaussian,Decoding methods,Quantization (signal processing)
Conference
ISSN
Citations 
PageRank 
1520-6149
0
0.34
References 
Authors
12
2
Name
Order
Citations
PageRank
Sivagnanasundaram Ramanan141.06
John MacLaren Walsh210717.90