Sparse Signal Approximation Algorithms In A Celp Coder
Przemysław Dymarski , Rafał Romaniuk
AbstractThis work presents a series of sparse signal modeling algorithms implemented in a typical CELP coder in order to compare their performances at a reasonable computational load. New algorithms are proposed, based on cyclic and parallel use of a fast implementation of the optimized orthogonal matching pursuit algorithm, i.e. the recursive modified Gram – Schmidt algorithm. These algorithms yield a statistically significant reduction of signal approximation error at a controllable computational complexity.
|Book||Perez Ana Isabel, Fernández-Prades Carles, Pascual-Iserte Antonio (eds.): EUSIPCO 2011 - The 2011 European Signal Processing Conference, 2011, EURASIP, 2400 p.|
|Publication indicators||= 0; = 2.0|
|Citation count*||2 (2020-02-17)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.