A Distributed Computationally Aware Quantizer Design via Hyper Binning
- 26 January 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 76-91
Abstract
We design a distributed function-aware quantization scheme for distributed functional compression. We consider 2 correlated sources X 1 and X 2 and a destination that seeks an estimate $\hat{f}$ for the outcome of a continuous function f ( X 1 , X 2 ). We develop a compression scheme called hyper binning in order to quantize f via minimizing the entropy of joint source partitioning. Hyper binning is a natural generalization of Cover's random code construction for the asymptotically optimal Slepian-Wolf encoding scheme that makes use of orthogonal binning. The key idea behind this approach is to use linear discriminant analysis in order to characterize different source feature combinations. This scheme captures the correlation between the sources and the function's structure as a means of dimensionality reduction. We investigate the performance of hyper binning for different source distributions and identify which classes of sources entail more partitioning to achieve better function approximation. Our approach brings an information theory perspective to the traditional vector quantization technique from signal processing.Keywords
All Related Versions
Funding Information
- National Science Foundation (CNS 2008639)
- Huawei France-funded Chair towards Future Wireless Networks
- NSF CNS (2008624)
This publication has 51 references indexed in Scilit:
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Coding for computingIEEE Transactions on Information Theory, 2001
- Partitioning the feature space of a classifier with linear hyperplanesIEEE Transactions on Speech and Audio Processing, 1999
- Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysisIEEE Transactions on Information Theory, 1996
- Multidimensional digitization of data followed by a mapping (Corresp.)IEEE Transactions on Information Theory, 1984
- Wyner - Ziv theory for a general function of the correlated sources (Corresp.)IEEE Transactions on Information Theory, 1982
- An upper bound on the rate distortion function for source coding with partial side information at the decoderIEEE Transactions on Information Theory, 1979
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Quantizing for minimum distortionIEEE Transactions on Information Theory, 1960