The DOI matches its Crossref record.
Efficient scalar quantization of exponential and Laplacian random variables
Abstract
This paper presents solutions to the entropy-constrained scalar quantizer (ECSQ) design problem for two sources commonly encountered in image and speech compression applications: sources having the exponential and Laplacian probability density functions. We use the memoryless property of the exponential distribution to develop a new noniterative algorithm for obtaining the optimal quantizer design. We show how to obtain the optimal ECSQ either with or without an additional constraint on the number of levels in the quantizer. In contrast to prior methods, which require a multidimensional iterative solution of a large number of nonlinear equations, the new method needs only a single sequence of solutions to one-dimensional nonlinear equations (in some Laplacian cases, one additional two-dimensional solution is needed). As a result, the new method is orders of magnitude faster than prior ones. We show that as the constraint on the number of levels in the quantizer is relaxed, the optimal ECSQ becomes a uniform threshold quantizer (UTQ) for exponential, but not for Laplacian sources. We then further examine the performance of the UTQ and optimal ECSQ, and also investigate some interesting alternatives to the UTQ, including a uniform-reconstruction quantizer (URQ) and a constant dead-zone ratio quantizer (CDZRQ).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Recent advances in convolutional neural networks
Gu, J., Wang, Z., Kuen, J., Ma, L., Shahroudy, A., Shuai, B., Liu, T., Wang, X., Wang, G., Cai, J., et al. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.013 · Cited by 6,576
Rate-distortion optimization for video compression
Sullivan, G. J., & Wiegand, T. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733497 · Cited by 1,727
Self-citationAn overview of the JPEG 2000 still image compression standard
Rabbani, M., & Joshi, R. (2002) · Signal Processing: Image Communication · doi:10.1016/s0923-5965(01)00024-8 · Cited by 730
Analysis of low bit rate image transform coding
Mallat, S., & Falzon, F. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668554 · Cited by 288
Metadata
- Authors
- Sullivan, G. J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1996
- Volume
- 42
- Issue
- 5
- Pages
- 1365-1374
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2151912295
- Cited by
- 183
- References
- 0
- FWCI
- 4.83
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient scalar quantization of exponential and Laplacian random variables. https://app.cochat.ai/papers/10.1109/18.532878
- The paper
- Sullivan, G. J. (1996). Efficient scalar quantization of exponential and Laplacian random variables. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.532878
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.