Journal of Shanghai University(Natural Science Edition) ›› 2020, Vol. 26 ›› Issue (1): 33-46.doi: 10.12066/j.issn.1007-2861.1996

• Research Articles • Previous Articles     Next Articles

Research on compression and denoising of speech signal based on the Takenaka-Malmquist system

Ya LEI1,2, Yong FANG1,2(), Liming ZHANG3   

  1. 1. Shanghai Institute for Advanced Communication and Data Science, Shanghai 200444, China
    2. Key Laboratory of Specialty Fiber Optics and Optical Access Networks, Shanghai University, Shanghai 200444, China
    3. Faculty of Technology and Science, University of Macau, Macau 999078, China
  • Received:2018-01-11 Online:2020-02-29 Published:2020-03-22
  • Contact: Yong FANG E-mail:yfang@staff.shu.edu.cn

Abstract:

The sparse representation of speech signal is one of the important research directions in speech compression, denoising and other speech processing. On the basis of matching pursuit (MP), orthogonal matching pursuit (OMP) and other greedy algorithms, this paper proposes a greedy weight algorithm based on Takenaka-Malmquist system (TMGW) for the compression of speech signal. This algorithm has the advantage of requiring only fewer decomposition numbers when reconstructing the speech signal, and it does well for achieving the goal of speech compression. Besides, in view of the fact that energy distribution between the signal and noise at time-frequency surface after sparse decomposition is different, this algorithm can realize the purpose of denoising. The experiment results show that the TMGW algorithm is more effective for the sparse representation of speech signal than the matching pursuit algorithm based on the adaptive Gabor sub-dictionary (GMP).

Key words: greedy weight algorithm based on the Takenaka-Malmquist system (TMGW), sparse representation, voice compression, voice denoising

CLC Number: