Fast sparse-algebraic-codebook search for efficient speech coding
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Dec 16, 1997
Grant Date -
N/A
app pub date -
May 11, 1995
filing date -
Feb 23, 1990
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A method of encoding a speech signal is provided. This method improves the excitation codebook and search procedure of the conventional Code-Excited Linear Prediction (CELP) speech encoders. This code is based on a sparse algebraic code consisting in particular, but not exclusively, of interleaving N single-pulse permutation codes. The search complexity in finding the best codeword is greatly reduced by bringing the search back to the algebraic code domain thereby allowing the sparsity of the algebraic code to speed up the necessary computations. More precisely, the sparsity of the code enable the use of a very fast procedure based on N-embedded computation loops.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully