G - Physics – 10 – L
Patent
G - Physics
10
L
G10L 19/12 (2006.01) G10L 19/00 (2006.01) G10L 9/14 (1995.01)
Patent
CA 2142391
A speech coding system robust to frame erasure (or packet loss) is described. Illustrative embodiments are directed to a modified version of CCITT standard G.728. In the event of frame erasure, vectors of an excitation signal are synthesized based on previously stored excitation signal vectors generated during non-erased frames. This synthesis differs for voiced and non-voiced speech. During erased frames, linear prediction filter coefficients are synthesized as a weighted extrapolation of a set of linear prediction filter coefficients determined during non-erased frames. The weighting factor is a number less than 1. This weighting accomplishes a bandwidth-expansion of peaks in the frequency response of a linear predictive filter. Computational complexity during erased frames is reduced through the elimination of certain computations needed during non-erased frames only. This reduction in computational complexity offsets additional computation required for excitation signal synthesis and linear prediction filter coefficient generation during erased frames.
At&t Corp.
Kirby Eades Gale Baker
LandOfFree
Computational complexity reduction during frame erasure or... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computational complexity reduction during frame erasure or..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational complexity reduction during frame erasure or... will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1351503