The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
On the performance and complexity of channel-optimized vector quantizers
Abstract
The performance and complexity of channel-optimized vector quantizers are studied for the Gauss-Markov source. Observations on the geometric structure of these quantizers are made, which have an important implication on the encoding complexity. For the squared-error distortion measure, it is shown that an operation equivalent to a Euclidean distance measurement with respect to an appropriately defined set of points (used to identify the encoding regions) can be used to perform the encoding. This implies that the encoding complexity is proportional to the number of encoding regions. It is then demonstrated that for very noisy channels and a heavily correlated source, when the codebook size is large, the number of encoding regions is considerably smaller than the codebook size-implying a reduction in encoding complexity.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Vector quantization in speech coding
Makhoul, J., Roucos, S., & Gish, H. (1985) · Proceedings of the IEEE · doi:10.1109/proc.1985.13340 · Cited by 839
A study of vector quantization for noisy channels
Farvardin, N. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.53739 · Cited by 479
Self-citationZeger, K., & Gersho, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.64657 · Cited by 379
Optimal quantizer design for noisy channels: An approach to combined source - channel coding
Farvardin, N., & Vaishampayan, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057373 · Cited by 332
Self-citationThe design of joint source and channel trellis waveform coders
Ayanoglu, E., & Gray, R. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057376 · Cited by 175
A construction of vector quantizers for noisy channels
Kumazawa, H., Kasahara, M., & Namekawa, T. (1984) · Electronics and Communications in Japan (Part I Communications) · doi:10.1002/ecja.4400670406 · Cited by 152
Cited by
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Rose, K. (1998) · Proceedings of the IEEE · doi:10.1109/5.726788 · Cited by 876
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communications
Gunduz, D., Qin, Z., Aguerri, I. E., Dhillon, H. S., Yang, Z., Yener, A., Wong, K. K., & Chae, C.-B. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3223408 · Cited by 776
A study of vector quantization for noisy channels
Farvardin, N. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.53739 · Cited by 479
Self-citation
Metadata
- Authors
- Farvardin, N., & Vaishampayan, V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1991
- Volume
- 37
- Issue
- 1
- Pages
- 155-160
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2161996730
- Cited by
- 276
- References
- 9
- FWCI
- 8.05
- 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
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.