One-Bit Sigma-Delta Quantization with Exponential Accuracy

Research output: Contribution to journalArticle

Abstract

One-bit quantization is a method of representing band-limited signals by ±1 sequences that are computed from regularly spaced samples of these signals; as the sampling density λ → ∞, convolving these one-bit sequences with appropriately chosen filters produces increasingly close approximations of the original signals. This method is widely used for analog-to-digital and digital-to-analog conversion, because it is less expensive and simpler to implement than the more familiar critical sampling followed by fine-resolution quantization. However, unlike fine-resolution quantization, the accuracy of one-bit quantization is not well understood. A natural error lower bound that decreases like 2 can easily be given using information-theoretic arguments. Yet, no one-bit quantization algorithm was known with an error decay estimate even close to exponential decay. In this paper we construct an infinite family of one-bit sigma-delta quantization schemes that achieves this goal. In particular, using this family, we prove that the error signal for π-band-limited signals is at most O (2-.07λ).

Original languageEnglish (US)
Pages (from-to)1608-1630
Number of pages23
JournalCommunications on Pure and Applied Mathematics
Volume56
Issue number11
DOIs
StatePublished - Nov 2003

Fingerprint

Quantization
Sampling
Analogue
Digital to analog conversion
Decay Estimates
Exponential Decay
Error Estimates
Filter
Lower bound
Decrease
Approximation
Family

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

One-Bit Sigma-Delta Quantization with Exponential Accuracy. / Gunturk, C. Sinan.

In: Communications on Pure and Applied Mathematics, Vol. 56, No. 11, 11.2003, p. 1608-1630.

Research output: Contribution to journalArticle

@article{8d861d3bdeb441e9a6e858cc91241aae,
title = "One-Bit Sigma-Delta Quantization with Exponential Accuracy",
abstract = "One-bit quantization is a method of representing band-limited signals by ±1 sequences that are computed from regularly spaced samples of these signals; as the sampling density λ → ∞, convolving these one-bit sequences with appropriately chosen filters produces increasingly close approximations of the original signals. This method is widely used for analog-to-digital and digital-to-analog conversion, because it is less expensive and simpler to implement than the more familiar critical sampling followed by fine-resolution quantization. However, unlike fine-resolution quantization, the accuracy of one-bit quantization is not well understood. A natural error lower bound that decreases like 2-λ can easily be given using information-theoretic arguments. Yet, no one-bit quantization algorithm was known with an error decay estimate even close to exponential decay. In this paper we construct an infinite family of one-bit sigma-delta quantization schemes that achieves this goal. In particular, using this family, we prove that the error signal for π-band-limited signals is at most O (2-.07λ).",
author = "Gunturk, {C. Sinan}",
year = "2003",
month = "11",
doi = "10.1002/cpa.3044",
language = "English (US)",
volume = "56",
pages = "1608--1630",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",
number = "11",

}

TY - JOUR

T1 - One-Bit Sigma-Delta Quantization with Exponential Accuracy

AU - Gunturk, C. Sinan

PY - 2003/11

Y1 - 2003/11

N2 - One-bit quantization is a method of representing band-limited signals by ±1 sequences that are computed from regularly spaced samples of these signals; as the sampling density λ → ∞, convolving these one-bit sequences with appropriately chosen filters produces increasingly close approximations of the original signals. This method is widely used for analog-to-digital and digital-to-analog conversion, because it is less expensive and simpler to implement than the more familiar critical sampling followed by fine-resolution quantization. However, unlike fine-resolution quantization, the accuracy of one-bit quantization is not well understood. A natural error lower bound that decreases like 2-λ can easily be given using information-theoretic arguments. Yet, no one-bit quantization algorithm was known with an error decay estimate even close to exponential decay. In this paper we construct an infinite family of one-bit sigma-delta quantization schemes that achieves this goal. In particular, using this family, we prove that the error signal for π-band-limited signals is at most O (2-.07λ).

AB - One-bit quantization is a method of representing band-limited signals by ±1 sequences that are computed from regularly spaced samples of these signals; as the sampling density λ → ∞, convolving these one-bit sequences with appropriately chosen filters produces increasingly close approximations of the original signals. This method is widely used for analog-to-digital and digital-to-analog conversion, because it is less expensive and simpler to implement than the more familiar critical sampling followed by fine-resolution quantization. However, unlike fine-resolution quantization, the accuracy of one-bit quantization is not well understood. A natural error lower bound that decreases like 2-λ can easily be given using information-theoretic arguments. Yet, no one-bit quantization algorithm was known with an error decay estimate even close to exponential decay. In this paper we construct an infinite family of one-bit sigma-delta quantization schemes that achieves this goal. In particular, using this family, we prove that the error signal for π-band-limited signals is at most O (2-.07λ).

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

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

U2 - 10.1002/cpa.3044

DO - 10.1002/cpa.3044

M3 - Article

VL - 56

SP - 1608

EP - 1630

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

IS - 11

ER -