TY - GEN

T1 - Lossy compression of exponential and laplacian sources using expansion coding

AU - Si, Hongbo

AU - Koyluoglu, O. Ozan

AU - Vishwanath, Sriram

N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

PY - 2014

Y1 - 2014

N2 - A general method of source coding is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued) source to a set of much simpler problems, compressing discrete sources. Specifically, the focus is on lossy compression of exponential and Laplace sources, which are represented as set of discrete variables through a finite alphabet expansion. Due to the decomposability property of such sources, the resulting random variables post expansion are independent and discrete. Thus, these variables can be considered as independent discrete source coding problems, and the original problem is reduced to coding over these sources with a total distortion constraint. Any feasible solution to this resulting optimization problem corresponds to an achievable rate distortion pair of the original continuous-valued source compression problem. Although finding the optimal solution for a given distortion is not a tractable task, we show that, via a heuristic choice, our expansion coding scheme still presents a good performance in the low distortion regime. Further, by adopting low-complexity codes designed for discrete source coding, the total coding complexity can be reduced for practical implementations.

AB - A general method of source coding is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued) source to a set of much simpler problems, compressing discrete sources. Specifically, the focus is on lossy compression of exponential and Laplace sources, which are represented as set of discrete variables through a finite alphabet expansion. Due to the decomposability property of such sources, the resulting random variables post expansion are independent and discrete. Thus, these variables can be considered as independent discrete source coding problems, and the original problem is reduced to coding over these sources with a total distortion constraint. Any feasible solution to this resulting optimization problem corresponds to an achievable rate distortion pair of the original continuous-valued source compression problem. Although finding the optimal solution for a given distortion is not a tractable task, we show that, via a heuristic choice, our expansion coding scheme still presents a good performance in the low distortion regime. Further, by adopting low-complexity codes designed for discrete source coding, the total coding complexity can be reduced for practical implementations.

UR - http://www.scopus.com/inward/record.url?scp=84906545671&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906545671&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2014.6875395

DO - 10.1109/ISIT.2014.6875395

M3 - Conference contribution

AN - SCOPUS:84906545671

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3052

EP - 3056

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014

Y2 - 29 June 2014 through 4 July 2014

ER -