Abstract: A feature extraction process for use in a wireless communication system provides automatic speech recognition based on both spectral envelope and voicing information. The shape of the spectral envelope is used to determine the LSPs of the incoming bitstream and the adaptive gain coefficients and fixed gain coefficients are used to generate the “voiced” and “unvoiced” feature parameter information.

Abstract: Methods and systems for filtering synthesized or reconstructed speech are implemented. A filter based on a set of linear predictive coding (LPC) coefficients is constructed by transforming the LPC coefficients to the pseudo-cepstrum, a domain existing between LPC domain and the line spectral frequency (LSF) domain. The resulting filter can emphasize spectral frequencies associated with various formants, or spectral peaks, of an inverse transfer function relating to the LPC coefficients, and can de-emphasize spectral frequencies associated with various spectral minima, or spectral valleys, of the inverse transfer function relating to the LPC coefficients.

Abstract: Methods and systems for filtering synthesized or reconstructed speech are implemented. A filter based on a set of linear predictive coding (LPC) coefficients is constructed by transforming the LPC coefficients to the pseudo-cepstrum, a domain existing between LPC domain and the line spectral frequency (LSF) domain. The resulting filter can emphasize spectral frequencies associated with various formants, or spectral peaks, of an inverse transfer function relating to the LPC coefficients, and can de-emphasize spectral frequencies associated with various spectral minima, or spectral valleys, of the inverse transfer function relating to the LPC coefficients.

Abstract: The invention provides devices and methods to decompose the noise-corrupted speech into an estimate for the clean speech component and an estimate for a noise component in a domain wherein the two components additively interact. In one implementation, the noise-corrupted speech signal is transformed into the cepstrum domain and combined with a cepstrum of a nonlinear gain function representing noise to obtain an estimate of the clean speech component in the cepstrum domain. In another implementation, the clean speech component is decomposed from the background noise component and channel distortion in the noisy speech cepstrum domain.

Abstract: The present invention provides a frame erasure concealment device and method that is based on reestimating gain parameters for a code excited linear prediction (CELP) coder. During operation, when a frame in a stream of received data is detected as being erased, the coding parameters, especially an adaptive codebook gain gp and a fixed codebook gain gc, of the erased and subsequent frames can be reestimated by a gain matching procedure. By using this technique with the IS-641 speech coder, it has been found that the present invention improves the speech quality under various channel conditions, compared with a conventional extrapolation-based concealment algorithm.

Abstract: A frame erasure concealment technique for a bitstream-based feature extractor in a speech recognition system particularly suited for use in a wireless communication system operates to “delete” each frame in which an erasure is declared. The deletions thus reduce the length of the observation sequence, but have been found to provide for sufficient speech recognition based on both single word and “string” tests of the deletion technique.

Abstract: A feature extraction process for use in a wireless communication system provides automatic speech recognition based on both spectral envelope and voicing information. The shape of the spectral envelope is used to determine the LSPs of the incoming bitstream and the adaptive gain coefficients and fixed gain coefficients are used to generate the “voiced” and “unvoiced” feature parameter information.

Abstract: An apparatus for quantizing a spectral envelope with noise robustness showing high performance even under a background noise environment and a channel noise environment, and a method therefor, are provided. The spectral envelope quantizing apparatus includes a spectral envelope quantizing apparatus with noise robustness for representing a spectral envelope of speech by a minimum number of bits for the optimal coding of a speech signal. The apparatus includes a line spectrum frequencies (LSFs) input portion for converting linear predictive coding coefficients extracted from the speech into Nth order line spectrum frequencies coefficients and inputting the coefficients as the LSFs of a current frame.

Abstract: In a voice coding and decoding method and apparatus using an RCELP technique, a CELP-series decoder can be obtained at a low transmission rate. A voice spectrum is extracted by performing a short-term linear prediction on voice signal. An error range in a formant region is widened during adaptive and renewal codebook search by passing said preprocessed voice through a formant weighting filter and widening an error range in a pitch on-set region by passing the same through a voice synthesis filter and a harmonic noise shaping filter. An adaptive codebook is searched using an open-loop pitch extracted on the basis of the residual minus of a speech. A renewal excited codebook produced from an adaptive codebook excited signal is searched. Finally, a predetermined bit is allocated to various parameters to form a bit stream.

Abstract: A method for generating a random code book having a characteristic similar to a periodic component of voice in code-excited linear predictive (CELP) coding. The method includes generating an adaptive code book that removes the periodic component of a current subframe of a speech signal. An adaptive code book array is generated with respect to the current subframe on the basis of an optimal delay and gain obtained in generating the adaptive code book. A number of code word arrays are generated from the adaptive code book array and the excited signal of the immediately previous subframe. A code word that has the maximum value is selected from each code word array generated in the code word array generating step. Each code word array is normalized using the selected code word. The normalized maximum value in each code word array is selected and scaled by the power of the most previous frame. A random code book including a set of the scaled selected maximum values is generated.