scispace - formally typeset
Journal ArticleDOI

Linear prediction: A tutorial review

John Makhoul
- Vol. 63, Iss: 4, pp 561-580
Reads0
Chats0
TLDR
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.
Abstract
This paper gives an exposition of linear prediction in the analysis of discrete signals The signal is modeled 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 In the frequency domain, this is equivalent to modeling the signal spectrum by a pole-zero spectrum The major part of the paper is devoted to all-pole models The model parameters are obtained by a least squares analysis in the time domain Two methods result, depending on whether the signal is assumed to be stationary or nonstationary The same results are then derived in the frequency domain The resulting spectral matching formulation allows for the modeling of selected portions of a spectrum, for arbitrary spectral shaping in the frequency domain, and for the modeling of continuous as well as discrete spectra This also leads to a discussion of the advantages and disadvantages of the least squares error criterion A spectral interpretation is given to the normalized minimum prediction error Applications of the normalized error are given, including the determination of an "optimal" number of poles The use of linear prediction in data compression is reviewed For purposes of transmission, particular attention is given to the quantization and encoding of the reflection (or partial correlation) coefficients Finally, a brief introduction to pole-zero modeling is given

read more

Citations
More filters
Journal ArticleDOI

Classification of multichannel EEG patterns using parallel hidden Markov models

TL;DR: The results show that a model architecture which includes a left-to-right scheme with no skips, five states and three Gaussians, outperforms the other tested architectures due to the fact that it allows a better modeling of the temporal sequencing of the EEG components.
Proceedings ArticleDOI

ECG based authentication for e-healthcare systems: Towards a secured ECG features transmission

TL;DR: It is proved, by assessing the algorithm on ECG-Id physionet database, that concealing the features using the LPC technique ensures a similar security level while offering a low computational complexity and communication overhead compared with the fuzzy vault scheme.

Performance Evaluation of Front-end Processing for Speech Recognition Systems

TL;DR: Results from both sets of experiments suggest that GTCC and ZCPA perform better than the conventional methods in noisy conditions, including PLP, which is the best amongst the three conventional algorithms.
Journal ArticleDOI

The Semi-Variogram and Spectral Distortion Measures for Image Texture Retrieval

TL;DR: Experimental results obtained from testing the proposed approach using the complete Brodatz database, and the University of Illinois at Urbana-Champaign texture database, suggests the effectiveness of the proposed Approach as a single-feature-based dissimilarity measure for real-time texture retrieval.
References
More filters
Journal ArticleDOI

A new look at the statistical model identification

TL;DR: In this article, a new estimate minimum information theoretical criterion estimate (MAICE) is introduced for the purpose of statistical identification, which is free from the ambiguities inherent in the application of conventional hypothesis testing procedure.
Proceedings Article

Information Theory and an Extention of the Maximum Likelihood Principle

H. Akaike
TL;DR: The classical maximum likelihood principle can be considered to be a method of asymptotic realization of an optimum estimate with respect to a very general information theoretic criterion to provide answers to many practical problems of statistical model fitting.
Book ChapterDOI

Information Theory and an Extension of the Maximum Likelihood Principle

TL;DR: In this paper, it is shown that the classical maximum likelihood principle can be considered to be a method of asymptotic realization of an optimum estimate with respect to a very general information theoretic criterion.
Journal ArticleDOI

Singular value decomposition and least squares solutions

TL;DR: The decomposition of A is called the singular value decomposition (SVD) and the diagonal elements of ∑ are the non-negative square roots of the eigenvalues of A T A; they are called singular values.