Distributed noise-shaping quantization: I. Beta duals of finite frames and near-optimal quantization of random measurements

Research output: Contribution to journalArticle

Abstract

This paper introduces a new algorithm for the so-called "Analysis Problem" in quantization of finite frame representations which provides a near-optimal solution in the case of random measurements. The main contributions include the development of a general quantization framework called {\em distributed noise-shaping}, and in particular, {\em beta duals} of frames, as well as the performance analysis of beta duals in both deterministic and probabilistic settings. It is shown that for Gaussian random frames, using beta duals result in near-optimally accurate reconstructions with respect to both the frame redundancy and the number of levels that the frame coefficients are quantized at. More specifically, if $L$ quantization levels per measurement are used to encode the unit ball in $\mathbb{R}^k$ via a Gaussian frame of $m$ vectors, then with overwhelming probability the beta-dual reconstruction error is shown to be bounded by $\sqrt{k}L^{-(1-\eta)m/k}$ where $\eta$ is arbitrarily small for sufficiently large problems. Additional features of the proposed algorithm include low computational cost and parallel implementability.
Original languageUndefined
Article number1405.4628
JournalarXiv
StatePublished - May 19 2014

Keywords

  • cs.IT
  • math.IT

Cite this

@article{6ae228cc9b174b3a8804fa70b948cf8b,
title = "Distributed noise-shaping quantization: I. Beta duals of finite frames and near-optimal quantization of random measurements",
abstract = "This paper introduces a new algorithm for the so-called {"}Analysis Problem{"} in quantization of finite frame representations which provides a near-optimal solution in the case of random measurements. The main contributions include the development of a general quantization framework called {\em distributed noise-shaping}, and in particular, {\em beta duals} of frames, as well as the performance analysis of beta duals in both deterministic and probabilistic settings. It is shown that for Gaussian random frames, using beta duals result in near-optimally accurate reconstructions with respect to both the frame redundancy and the number of levels that the frame coefficients are quantized at. More specifically, if $L$ quantization levels per measurement are used to encode the unit ball in $\mathbb{R}^k$ via a Gaussian frame of $m$ vectors, then with overwhelming probability the beta-dual reconstruction error is shown to be bounded by $\sqrt{k}L^{-(1-\eta)m/k}$ where $\eta$ is arbitrarily small for sufficiently large problems. Additional features of the proposed algorithm include low computational cost and parallel implementability.",
keywords = "cs.IT, math.IT",
author = "Evan Chou and Cemalettin Gunturk",
year = "2014",
month = "5",
day = "19",
language = "Undefined",
journal = "arXiv",

}

TY - JOUR

T1 - Distributed noise-shaping quantization

T2 - I. Beta duals of finite frames and near-optimal quantization of random measurements

AU - Chou, Evan

AU - Gunturk, Cemalettin

PY - 2014/5/19

Y1 - 2014/5/19

N2 - This paper introduces a new algorithm for the so-called "Analysis Problem" in quantization of finite frame representations which provides a near-optimal solution in the case of random measurements. The main contributions include the development of a general quantization framework called {\em distributed noise-shaping}, and in particular, {\em beta duals} of frames, as well as the performance analysis of beta duals in both deterministic and probabilistic settings. It is shown that for Gaussian random frames, using beta duals result in near-optimally accurate reconstructions with respect to both the frame redundancy and the number of levels that the frame coefficients are quantized at. More specifically, if $L$ quantization levels per measurement are used to encode the unit ball in $\mathbb{R}^k$ via a Gaussian frame of $m$ vectors, then with overwhelming probability the beta-dual reconstruction error is shown to be bounded by $\sqrt{k}L^{-(1-\eta)m/k}$ where $\eta$ is arbitrarily small for sufficiently large problems. Additional features of the proposed algorithm include low computational cost and parallel implementability.

AB - This paper introduces a new algorithm for the so-called "Analysis Problem" in quantization of finite frame representations which provides a near-optimal solution in the case of random measurements. The main contributions include the development of a general quantization framework called {\em distributed noise-shaping}, and in particular, {\em beta duals} of frames, as well as the performance analysis of beta duals in both deterministic and probabilistic settings. It is shown that for Gaussian random frames, using beta duals result in near-optimally accurate reconstructions with respect to both the frame redundancy and the number of levels that the frame coefficients are quantized at. More specifically, if $L$ quantization levels per measurement are used to encode the unit ball in $\mathbb{R}^k$ via a Gaussian frame of $m$ vectors, then with overwhelming probability the beta-dual reconstruction error is shown to be bounded by $\sqrt{k}L^{-(1-\eta)m/k}$ where $\eta$ is arbitrarily small for sufficiently large problems. Additional features of the proposed algorithm include low computational cost and parallel implementability.

KW - cs.IT

KW - math.IT

M3 - Article

JO - arXiv

JF - arXiv

M1 - 1405.4628

ER -