Linear predictive coding

  title={Linear predictive coding},
  author={Douglas D. O'Shaughnessy},
  journal={IEEE Potentials},
The basic principles of linear predictive coding (LPC) are presented. Least-squares methods for obtaining the LPC coefficients characterizing the all-pole filter are described. Computational factors, instantaneous updating, and spectral estimation are discussed.<<ETX>> 

Figures from this paper

Narrowband noise estimation in the subspace domain

  • V. BhunjunM. Brookes
  • Engineering, Computer Science
    Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004.
  • 2004
An alternative method is proposed where the subspace complementary to the signal subspace is used to continuously estimate the noise covariance matrix, and for narrowband noise an eigenvector matching algorithm is proposed to exploit interframe information for more reliable estimates.

Modeling of voiced and unvoiced speech signals using fractional calculus

  • A. AbrahamA. Harsha
  • Computer Science, Engineering
    2016 International Conference on Next Generation Intelligent Systems (ICNGIS)
  • 2016
A comparative study between Linear Predictive Coding and Fractional Fourier Transform is done, and it is shown that fractional calculus method requires smaller number of model parameters, and is superior to the LPC approach in capturing the details of the modeled signal.


This paper presents the problem of features extraction from the hydroacoustics signatures of a moving ship, based on Linear Predictive Coding. The use of the proposed method should allow for later

2 Linear Predictive Coding in Digital Signal Processing

Five predictive coding algorithms are covered: linear predictive coding which has a long and influential history in the signal processing literature; the first neuroscience-related application of predictive coding to explaining the function of the retina; and three versions of predictive codes that have been proposed to model cortical function.

Efficient and Scalable Neural Residual Waveform Coding with Collaborative Quantization

This work proposes a collaborative quantization (CQ) scheme to jointly learn the codebook of LPC coefficients and the corresponding residuals and demonstrates that CQ achieves much higher quality than its predecessor at 9 kbps with even lower model complexity.

Super-Wideband Spectral Envelope Modeling for Speech Coding

Objective and subjective evaluations indicate that both methods used in a super-wideband source-filter coding scheme offer the same quality range, making them an attractive alternative to conventional speech coders that require additional bandwidth extension.


Speech coding is the act of converting the speech signal in more compressed form, which can be transmittedthrough less number of bits with highest quality. Speech coding is an algorithm used to

PAPR reduction in OFDM systems using higher order prediction filter

  • Mamta AroraAmit Gupta
  • Business
    2017 11th International Conference on Intelligent Systems and Control (ISCO)
  • 2017
In this paper, a new scheme is proposed in Orthogonal Frequency-Division Multiplexing (OFDM) systems to reduce Peak-to-Average-Ratio (PAPR) without any influence on Bit-Error-Rate (BER). The high

Practical design of delta-sigma multiple description audio coding

Simulations on real audio reveal that, contrary to existing designs, it is straightforward to obtain a large number of trade-off points between side distortion and central distortion, which makes the proposed coder suitable for a wide range of applications.

Scalable and Efficient Neural Speech Coding: A Hybrid Design

The hybrid design integrates LPC and NWC by redefining LPC’s quantization as a differentiable process, making the system training an end-to-end manner, and can scale up to higher bitrates to achieve near transparent performance.



Linear prediction, entropy and signal analysis

The paper introduces the powerful principle of Minimum Cross-Entropy (MCE) spectral analysis, which reduces the average number of predictor coefficients (poles) that have to be specified per time frame for a given spectral resolution by relying on prior spectral information.

Linear prediction: A tutorial review

This paper gives an exposition of linear prediction in the analysis of discrete signals as a linear combination of its past values and present and past values of a hypothetical input to a system whose output is the given signal.

Spectrum analysis&#8212;A modern perspective

A summary of many of the new techniques developed in the last two decades for spectrum analysis of discrete time series is presented, including the classical periodogram, classical Blackman-Tukey, autoregressive, moving average, autotegressive-moving average, maximum likelihood, Prony, and Pisarenko methods.

Stability of Methods for Solving Toeplitz Systems of Equations

The stability properties of the classical and the new fast algorithms for solving Toeplitz systems are investigated.

The split Levinson algorithm

The classical Levinson algorithm for computing the predictor polynomial relative to a real positive definite Toeplitz matrix is shown to be redundant in complexity. It can be broken down into two


The Holophone surround sound microphone system is ideal for recording the most realistic multi-channel audio, for HDTV or standard television broadcasting. It is able to record up to 6.1 discrete

An Algorithm for the Inversion of Finite Toeplitz Matrices

possesses properties (1.1), (1.2), and (1.3). In order to find the joint probability density function of (yo, yi , , yn), or of any n + 1 successive variates, it is necessary to invert the matrix Tn

Information Theory

Information TheoryPapers read at a Symposium on Information Theory held at the Royal Institution, London, August 29th to September 2nd, 1960. Edited by Colin Cherry. Pp. xi + 476. (London: