Compressive sensing for sparsely excited speech signals
2009 (English)In: 2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2009, 4125-4128 p.Conference paper (Refereed)
Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse response matrix operating on a sparse excitation, as in the linear model of speech production, for recovering compressive sensed speech. Since the linear transform is signal dependent and unknown, unlike the standard CS formulation, a codebook of transfer functions is proposed in a matching pursuit (MP) framework for CS recovery. It is found that MP is efficient and effective to recover CS encoded speech as well as jointly estimate the linear model. Moderate number of CS measurements and low order sparsity estimate will result in MP converge to the same linear transform as direct VQ of the LP vector derived from the original signal. There is also high positive correlation between signal domain approximation and CS measurement domain approximation for a large variety of speech spectra.
Place, publisher, year, edition, pages
2009. 4125-4128 p.
, International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
sampling, compressed sensing, matching pursuit, sparse signal reconstruction
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-36106DOI: 10.1109/ICASSP.2009.4960536ISI: 000268919202106ScopusID: 2-s2.0-70349205576OAI: oai:DiVA.org:kth-36106DiVA: diva2:430389
IEEE International Conference on Acoustics, Speech and Signal Processing Taipei, TAIWAN, APR 19-24, 2009
QC 201107082011-07-082011-07-082011-07-08Bibliographically approved