1985
DOI: 10.1109/proc.1985.13340
|View full text |Cite
|
Sign up to set email alerts
|

Vector quantization in speech coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
211
0
14

Year Published

1999
1999
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 731 publications
(226 citation statements)
references
References 107 publications
1
211
0
14
Order By: Relevance
“…The TRN algorithm Martinetz and Schulten, 1994) offers a flexible way to develop a discrete representation of biological data including neighborhood relationships . It can be shown that the algorithm minimizes the so-called distortion error (Makhoul et al, 1985;Martinetz and Schulten, 1994) of the discrete representation. From a signal processing point of view this error measures the fidelity of the data encoding, i.e., the meansquares deviation of the discrete set of vectors from the corresponding data (Makhoul et al, 1985).…”
Section: Design Of the Situs Packagementioning
confidence: 99%
See 2 more Smart Citations
“…The TRN algorithm Martinetz and Schulten, 1994) offers a flexible way to develop a discrete representation of biological data including neighborhood relationships . It can be shown that the algorithm minimizes the so-called distortion error (Makhoul et al, 1985;Martinetz and Schulten, 1994) of the discrete representation. From a signal processing point of view this error measures the fidelity of the data encoding, i.e., the meansquares deviation of the discrete set of vectors from the corresponding data (Makhoul et al, 1985).…”
Section: Design Of the Situs Packagementioning
confidence: 99%
“…It can be shown that the algorithm minimizes the so-called distortion error (Makhoul et al, 1985;Martinetz and Schulten, 1994) of the discrete representation. From a signal processing point of view this error measures the fidelity of the data encoding, i.e., the meansquares deviation of the discrete set of vectors from the corresponding data (Makhoul et al, 1985). If the global minimum of the error is found, the vector distribution is fully determined by the input density distribution.…”
Section: Design Of the Situs Packagementioning
confidence: 99%
See 1 more Smart Citation
“…An efficient fast algorithm to generate codebook for vector quantization. First International Conference on Emerging Trends in Engineering and Technology, ICETET-2008, Nagpur, India, (59). Su principal limitación se encuentra en la gran complejidad computacional en tiempos de búsqueda (60,61).…”
Section: Cuantificaciónunclassified
“…Constrained search procedures include treestructured (TSVQ) (Buw, Gray, Gray, & Markel, 1980;Makhoul, Roucos, & Gish, 1985) and lattice (Gersho, 1979;Conway & Sloane, 1985) methods. In the unconstrained (full search) case, all weight vectors arc codewords, and the system searches through all the entries in a code book to find which one best represents the data.…”
Section: Vector Quantizationmentioning
confidence: 99%