TY - GEN
T1 - Dynamic shift-map coding with side information at the decoder
AU - Yoo, Yongseok
AU - Koyluoglu, O. Ozan
AU - Vishwanath, Sriram
AU - Fiete, Ila
PY - 2012
Y1 - 2012
N2 - Shift-map codes have been studied as joint source-channel codes for continuous sources. These codes are useful in delay-limited scenarios and also provide better tolerance to deviations of the signal-to-noise ratio (SNR) from a target SNR, compared to separate source and channel coding. This paper defines a generalized family of shift-map codes that share a strong connection with redundant residue number systems (RRNS), and are henceforth called RRNS-map codes. In the proposed coding scheme, side information about the source allows the decoder to consider only a fraction of the codebook for decoding, with no change in the encoding process. With an appropriately designed RRNS-map code, in this fraction of the codebook, the codewords are much better separated than the original codebook. As a result, RRNS-map codes achieve the same distortion in the mean square error sense as conventional shift-map codes without side information, but significantly outperform shift-map codes when side information is provided to the decoder. This coding scheme is ideally suited to applications where a simple and fixed encoding scheme is desired at the encoder, while the decoder is given access to side information about the source.
AB - Shift-map codes have been studied as joint source-channel codes for continuous sources. These codes are useful in delay-limited scenarios and also provide better tolerance to deviations of the signal-to-noise ratio (SNR) from a target SNR, compared to separate source and channel coding. This paper defines a generalized family of shift-map codes that share a strong connection with redundant residue number systems (RRNS), and are henceforth called RRNS-map codes. In the proposed coding scheme, side information about the source allows the decoder to consider only a fraction of the codebook for decoding, with no change in the encoding process. With an appropriately designed RRNS-map code, in this fraction of the codebook, the codewords are much better separated than the original codebook. As a result, RRNS-map codes achieve the same distortion in the mean square error sense as conventional shift-map codes without side information, but significantly outperform shift-map codes when side information is provided to the decoder. This coding scheme is ideally suited to applications where a simple and fixed encoding scheme is desired at the encoder, while the decoder is given access to side information about the source.
UR - http://www.scopus.com/inward/record.url?scp=84875746787&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875746787&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2012.6483277
DO - 10.1109/Allerton.2012.6483277
M3 - Conference contribution
AN - SCOPUS:84875746787
SN - 9781467345385
T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
SP - 632
EP - 639
BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
T2 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Y2 - 1 October 2012 through 5 October 2012
ER -