### 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 language | English (US) |
---|---|

Pages (from-to) | 1608-1630 |

Number of pages | 23 |

Journal | Communications on Pure and Applied Mathematics |

Volume | 56 |

Issue number | 11 |

DOIs | |

State | Published - Nov 2003 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Applied Mathematics

### Cite this

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

Research output: Contribution to journal › Article

*Communications on Pure and Applied Mathematics*, vol. 56, no. 11, pp. 1608-1630. https://doi.org/10.1002/cpa.3044

}

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

AN - SCOPUS:0346513750

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 -