New fast wavelet packet transform algorithms for frame synchronized speech processing
نویسنده
چکیده
In this paper we present orthogonal overlapped block transforms as a frame synchronized signal analysis tool with the capability of arbitrary multiresolution time-spectral decomposition of speech signals. Our prime interest is in the representation of nonstationary discrete-time signals in terms of wavelet packets, and we concentrate on their fast transform algorithms. Wavelet packet representations provide a local time-spectral description which reveals the nonstationary nature of a signal. They allow the speech signal to be accurately parameterised for such applications as speech and speaker recognition, where a front-end is responsible for the frame synchronized feature extraction. In this case the fast overlapped block transform algorithms represent an elegant and e cient solution to the implementation of wavelet packet transforms, since their FFT-like lattice block structure provides all possible multiresolution timespectral coe cients. The frame synchronization is also preserved in subbands which allows a new subband-based approach for speech recognition.
منابع مشابه
A New Algorithm for Voice Activity Detection Based on Wavelet Packets (RESEARCH NOTE)
Speech constitutes much of the communicated information; most other perceived audio signals do not carry nearly as much information. Indeed, much of the non-speech signals maybe classified as ‘noise’ in human communication. The process of separating conversational speech and noise is termed voice activity detection (VAD). This paper describes a new approach to VAD which is based on the Wavelet ...
متن کاملA New Method for Speech Enhancement Based on Incoherent Model Learning in Wavelet Transform Domain
Quality of speech signal significantly reduces in the presence of environmental noise signals and leads to the imperfect performance of hearing aid devices, automatic speech recognition systems, and mobile phones. In this paper, the single channel speech enhancement of the corrupted signals by the additive noise signals is considered. A dictionary-based algorithm is proposed to train the speech...
متن کاملSatisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
Satisficing search algorithms are proposed for adaptively selecting near-best basis and near-best frame decompositions in redundant tree-structured wavelet transforms. Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. The algorithms are applicable to tree-structured tra...
متن کاملPerceptual speech coding using time and frequency masking constraints
This paper presents a new wide-band speech coding system based on a fast wavelet packet transform algorithm as well as a formulation of temporal and spectral psychoacoustic models of masking. The proposed FFT-like overlapped block orthogonal transform allows us to approximate the auditory critical band decomposition in an e cient manner, which is a major advantage over previous approaches that ...
متن کاملSecond Generation and Perceptual Wavelet Based Noise Estimation
The implementation of three noise estimation algorithms using two different signal decomposition methods: a second-generation wavelet transform and a perceptual wavelet packet transform are described in this paper. The algorithms, which do not require the use of a speech activity detector or signal statistics learning histograms, are: a smoothing-based adaptive technique, a minimum variance tra...
متن کامل