Chap 2' Predictive Coding - PowerPoint PPT Presentation

1 / 28
About This Presentation
Title:

Chap 2' Predictive Coding

Description:

we can remove the predictable part, thus the dynamic range of redundancy will be ... windowing function : Hamming window. 12. Adaptive one-word memory quantizer (APCM) ... – PowerPoint PPT presentation

Number of Views:41
Avg rating:3.0/5.0
Slides: 29
Provided by: 14064
Category:

less

Transcript and Presenter's Notes

Title: Chap 2' Predictive Coding


1
Chap 2. Predictive Coding
  • Zero memory property ?
  • If the signal is un-correlated ?The spectral is
    flat (while noise)
  • The signal is correlated,
  • ? we can remove the predictable part, thus the
    dynamic range of redundancy will be
    smaller.

2
  • Forward predictive scheme
  • In encoder, using s(n) to find the predictor
  • In decoder, using the predictor find from encoder
    to predict sq(n)

3
  • Backward predictive Scheme
  • The predictor in encoder and decoder were same
    now.

4
  • Linear Prediction (LPC)
  • Analysis and synthesis

5
  • Analysis filter all-zero (MA)
  • Synthesis filter all-pole (AR)
  • Solve the linear prediction coefficients using
    MMSE criterion

6
  • Solution
  • Signal is stationary, or at least short-time
    stationary
  • Covariance method
  • - windowing
  • - solve linear equations set with p equations.

7
  • Autocorrelation method
  • Autocorrelation method (continued)
  • Yule-Walker equation

8
  • Levinson-Durbin Algorithm
  • R matrix is Toeplitz ? using the Levinson-Durbin
    Algorithm to solve it!

Conversion between LPC and
reflection coefficient
  • In the Levinson-Durbin recursive formula, k is
    the reflection coefficients in the Lattice form
    (or Partial correlation coefficientPARCOR)

9
  • Levinson-Durbin recursive formula (continued)

10
  • Tube Model log-area ratio

11
  • Implementation
  • - windowing function Hamming window

12
  • Adaptive one-word memory quantizer (APCM)
  • - adjust quantization step
  • For mid-raise quantizer

Example of R3
13
  • Block diagram

14
  • Performance

The adaptive PCM can have more SNR in signal range
15
  • DPCM

Input
Output
16
  • AR (Autoregressive), MA (Moving Average) predictor

17
  • Using Least Mean Square Error (LMS) method- for
    AR
  • ARMA predictor

18
  • 32Kbps G.721

d(k)
19
  • Because the dynamic range is smaller for DPCM,
    4-bit adaptive non-uniform quantizer was used.
  • log(d(k))-y(k) were sent to Q, output is I()
  • ed(k)/y(k) is quantized

20
  • Adaptive quantizer

21
  • Adaptation speed control

22
  • Adaptive predictor 6 zeros, 2 poles ARMA model
  • Solution using LMS was shown in slide-11, but in
    order to reduce computation power

23
  • Performance Segmental SNR (15-25ms)
  • The performance is depend on the prediction gain
    (prediction error power/signal power)
  • G. 727 Embedded
  • Varieties bit-rate, suitable for packetized voice
    protocol (PVP), bit-rate 16, 24, 32, 40 kbps.
  • Only 2 bits was used to adjust the quantization
    step size core bits, in receiver the bit can be
    masking to archived the lower bit-rate.

24
(No Transcript)
25
  • Adaptive quantizer in G.727(16 kbps, 2 core bits)
  • Performance of G.727 why SSNR?
  • prediction gain will be smaller for silence
    (noise)

  • larger for voiced signal.

26
(m,n) m-bit in AQ, n core bits
27
  • SSNR of G.727 in different bit-rate

28
  • Theorematic upper bound
Write a Comment
User Comments (0)
About PowerShow.com