Sparse Signal Approximation Algorithms In A Celp Coder

Przemysław Dymarski , Rafał Romaniuk

Abstract

This 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.
Author Przemysław Dymarski (FEIT / IT)
Przemysław Dymarski,,
- The Institute of Telecommunications
, Rafał Romaniuk (FEIT / IT)
Rafał Romaniuk,,
- The Institute of Telecommunications
Pages201-205
Book Perez Ana Isabel, Fernández-Prades Carles, Pascual-Iserte Antonio (eds.): EUSIPCO 2011 - The 2011 European Signal Processing Conference, 2011, EURASIP, 2400 p.
URL http://www.eurasip.org/Proceedings/Eusipco/Eusipco2011/papers/1569426873.pdf
Languageen angielski
File
Sparse Signal Approximation.pdf 1.09 MB
Score (nominal)10
Publication indicators WoS Citations = 0; GS Citations = 2.0
Citation count*2 (2020-02-17)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?