present a kind of observation matrix which combines the chaotic sequence with the sign function
which has good pseudo randomness.Firstly
the noisy speech signal is sparse in the DCT domain
then the observation matrix is used to preserve most of the speech features
finally based on the original reconstruction algorithm
this paper improves the reconstruction algorithm to speed up the reconstruction.The algorithm proposed in this paper makes the intelligibility and clarity of reconstructed speech signal be greatly improved
and the speech enhancement is realized.
关键词
Keywords
references
Blumensath T, Davies M E. Gradient pursuits[J]. IEEE Transaction on Signal Processing, 2008, 56(6): 2370-2382. DOI: 2370
Donoho D L. Compressed sensing[J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306. DOI: 1289
Needell D, Vershynin R. Greedy signal recovery and un-certainty principles[C]//Proceedings of the Conference on Computational Imaging. San Jose, USA, SPIE, 2008: 1-12.
Tropp J, Gilbert A. Signal recovery from random measurements via orthogonal matching pursuit[J]. IEEE Transactions on Information Theory, 2008, 53(12): 4655-4666. DOI: 4655
Candes E J, Tao T. Near-optimal signal recovery from random projections: universal encoding strategies[J]. IEEE Transactions on Information Theory, 2006, 52(12): 5406-5425. DOI: 5406
Do T T, Lu Gan, Nguyen N, et al. Sparsity adaptive matching pursuit algorithm for practical compressed sensing[C]∥Asilomar Conference on Signals, Systems and Computers. Pacific Grove, California: IEEE Press, 2008: 581-587.