The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A study of vector quantization for noisy channels
Abstract
Several issues related to vector quantization for noisy channels are discussed. An algorithm based on simulated annealing is developed for assigning binary codewords to the vector quantizer code-vectors. It is shown that this algorithm could result in dramatic performance improvements as compared to randomly selected codewords. A modification of the simulated annealing algorithm for binary codeword assignment is developed for the case where the bits in the codeword are subjected to unequal error probabilities (resulting from unequal levels of error protection). An algorithm for the design of an optimal vector quantizer for a noisy channel is briefly discussed, and its robustness under channel mismatch conditions is studied. Numerical results for a stationary first-order Gauss-Markov source and a binary symmetric channel are provided. It is concluded that the channel-optimized vector quantizer design algorithm, if used carefully, can result in a fairly robust system with no additional delay. The case in which the communication channel is nonstationary (as in mobile radio channels) is studied, and some preliminary ideas for quantizer design are presented.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
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
Convergence and finite-time behavior of simulated annealing
Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A. (1986) · Advances in Applied Probability · doi:10.2307/1427186 · Cited by 358
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-citation
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
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
DeepJSCC-f: Deep Joint Source-Channel Coding of Images With Feedback
Kurka, D. B., & Gunduz, D. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2987203 · Cited by 470
Mohr, A. E., Riskin, E. A., & Ladner, R. E. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.848236 · Cited by 458
Metadata
- Authors
- Farvardin, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1990-07
- Volume
- 36
- Issue
- 4
- Pages
- 799-809
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2121782860
- Cited by
- 479
- References
- 17
- FWCI
- 14.97
- 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: A study of vector quantization for noisy channels. https://app.cochat.ai/papers/10.1109/18.53739
- The paper
- Farvardin, N. (1990). A study of vector quantization for noisy channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.53739
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.