Multi-stage vector quantization with efficient codebook search

Data processing: speech signal processing – linguistics – language – Speech signal processing – For storage or transmission

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

704230, G10L 900

Patent

active

059743786

ABSTRACT:
A method of using a computer (11) to perform a multi-stage vector quantization process (13a). At each stage of the process (13a) subsequent to the first stage, input vectors from the previous stage are used to search a codebook (13b) for code-vectors that minimize distortion. (FIG. 2) The search is structured so that each stage is performed with an outer loop that calculates components of distortion that do not depend on the input vector value. An inner loop, which does depend on input vector values, is used to calculate distortion values and to maintain a list of the current best output code-vectors. (FIG. 3). The first stage is a special case, having only one input vector, but is otherwise performed like the subsequent stages.

REFERENCES:
patent: 5398069 (1995-03-01), Huang et al.
patent: 5774839 (1998-06-01), Shlomot
W.P. LeBlanc, B. Bhattacharya, S.A. Mahmoud and V. Cuperman, "Efficient Search and Design Procedures for Robust Multi-Stage VQ of LPC Parameters for 4 kb/s Speech Coding", IEEE (Oct. 1993).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multi-stage vector quantization with efficient codebook search does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-stage vector quantization with efficient codebook search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-stage vector quantization with efficient codebook search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-775125

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.