Distributed Functional Scalar Quantization Simplified

DOI10.1109/TSP.2013.2259483zbMATH Open1393.94761arXiv1206.1299MaRDI QIDQ4578615FDOQ4578615

Authors: John Z. Sun, Vinith Misra, Vivek K. Goyal 

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Distributed functional scalar quantization (DFSQ) theory provides optimality conditions and predicts performance of data acquisition systems in which a computation on acquired data is desired. We address two limitations of previous works: prohibitively expensive decoder design and a restriction to sources with bounded distributions. We rigorously show that a much simpler decoder has equivalent asymptotic performance as the conditional expectation estimator previously explored, thus reducing decoder design complexity. The simpler decoder has the feature of decoupled communication and computation blocks. Moreover, we extend the DFSQ framework with the simpler decoder to acquire sources with infinite-support distributions such as Gaussian or exponential distributions. Finally, through simulation results we demonstrate that performance at moderate coding rates is well predicted by the asymptotic analysis, and we give new insight on the rate of convergence.

Full work available at URL: https://arxiv.org/abs/1206.1299

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: Distributed Functional Scalar Quantization Simplified

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578615)