Granted Patent B2

US 8,359,199 · App. 13/306,201 · Granted Jan 22, 2013

Abstract

Claims (130)

1. A method of frame erasure concealment, comprising:

detecting a frame erasure;

computing a probability of an observation sequence based on a decoding algorithm in response to detecting the frame erasure; and

deleting an observation vector of the observation sequence, the observation vector associated with the frame erasure, wherein deleting the observation vector of the observation sequence comprises:

measuring a Euclidean distance between line spectrum pairs of contiguous frames, wherein the Euclidian distance is given by

∑

i

=

1

p

⁢

(

ω

n

,

i

-

ω

n

-

1

,

i

)

2

=

(

1

-

c

)

⁢

∑

i

=

1

p

⁢

(

ω

n

-

1

,

i

-

ω

dc

,

i

)

2

,

 wherein ω n,i represents an i-th line spectrum pair of an n-th frame, ω dc,i represents an empirical mean value of the i-th line spectrum pair, and c represents a forgetting factor;

defining a steady-state threshold; and

deleting a frame of the contiguous frames in response to determining that the Euclidean distance is less than the steady-state threshold.

2. The method of claim 1 , further comprising:

decoding the observation sequence based on a hidden Markov model process.

3. The method of claim 1 , wherein computing the probability of an observation sequence based on the decoding algorithm comprises:

determining a missing observation vector; and

computing the probability of the observation sequence using a missing feature theory based on the missing observation vector.

4. The method of claim 1 , wherein detecting the frame erasure comprises:

determining an error in bits most sensitive to error within a frame; and

declaring the frame erasure associated with the frame.

5. The method of claim 4 , wherein the bits most sensitive to error in a frame includes line spectrum pair information bits and gain information bits.

6. A system of frame erasure concealment, comprising:

means for detecting a frame erasure;

means for computing a probability of an observation sequence based on a decoding algorithm in response to detecting a frame erasure; and

means for deleting an observation vector of the observation sequence, the observation vector associated with the frame erasure, wherein the means for deleting the observation vector of the observation sequence comprises:

means for measuring a Euclidean distance between line spectrum pairs of contiguous frames, wherein the Euclidian distance is given by

∑

i

=

1

p

⁢

(

ω

n

,

i

-

ω

n

-

1

,

i

)

2

=

(

1

-

c

)

⁢

∑

i

=

1

p

⁢

(

ω

n

-

1

,

i

-

ω

dc

,

i

)

2

,

 wherein ω n,i represents an i-th line spectrum pair of an n-th frame, ω dc,i represents an empirical mean value of the i-th line spectrum pair, and c represents a forgetting factor;

means for defining a steady-state threshold;

means for deleting a frame of the contiguous frames in response to determining that the Euclidean distance is less than the steady-state threshold.

7. The system of claim 6 , further comprising:

means for decoding the observation sequence based on a Markov model process.

8. The system of claim 6 , wherein the means for computing a probability of an observation sequence comprises:

means for determining a missing observation vector; and

means for computing the probability of the observation sequence using a missing feature theory based on the missing observation vector.

9. The system of claim 6 , wherein the means for detecting the frame erasure comprises:

means for determining an error in bits most sensitive to error within a frame; and

means for declaring the frame erasure associated with the frame.

10. The system of claim 9 , wherein the bits most sensitive to error in a frame includes line spectrum pair information bits and gain information bits.

Assignments (11)