Adaptive interpolation of discrete-time signals that can be modeled as autoregressive processes

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 34, Issue 2, 1986, Pages 317-330

  Janseen, A J E M ^a   Veldhuis, Raymond ^a   Vries, Lodewijik ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL FILTERING AND PREDICTION - MATHEMATICAL MODELS;

ADAPTIVE INTERPOLATION; AUTOREGRESSIVE PROCESS MODEL; DISCRETE-TIME SIGNALS;

SIGNAL PROCESSING;

EID: 0022705710     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1986.1164824     Document Type: Article

References (19)

1. R. Steele and F. Benjamin, “Sample reduction and subsequent adaptive interpolation of speech signals,” Bell. Syst. Tech. J., vol. 62, no. 6, pp. 1365–1398, 1983.
2. S. M. Kay, “Some results in linear interpolation theory,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 746–749, June 1983.
3. A. J. E. M Janssen and L. B. Vries, “Interpolation of band-limited discrete-time signals by minimizing out-of-band energy,” in Proc. ICASSP’84, San Diego, CA, 1984.
4. H. Akaike, “A new look at the statistical model identification,” IEEE Trans. Automat. Contr., vol. AC-19, pp. 716–728, June 1974.
5. S. M. Kay and S. L. Marple, Jr., “Spectrum analysis—A modern perspective,” Proc. IEEE, vol. 69, no. 11, pp. 1380–1419, 1981.
6. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Stat. Soc., Series B, vol. 39, pp. 1–38, 1977.
7. C. F. J. Wu, “On the convergence properties of the EM algorithm,” Ann. Stat., vol. 11, no. 1, pp. 95–103, 1983.
8. R. A. Bayles, “On the convergence of the EM algorithm,” J. Roy. Stat. Soc., Series B, vol. 45, no. 1, pp. 47–50, 1983.
9. F. Itakura and S. Saito, “A statistical method for estimation of speech spectral density and formant frequencies,” Electron. Commun. Japan, vol. 53-A, pp. 36–43, 1970.
10. I. I. Hirschmann, Jr., “Recent developments in the theory of finite Toeplitz operators,” in Advances in Probability and Related Topics, vol. 1. New York: Marcel Dekker, 1971.
11. M. Marcus and H. Mine, Introduction to Linear Algebra. New York: MacMillan, 1965.
12. J. Durbin, “The fitting of time-series models,” Rev. Inst. Int. Stat., vol. 28, pp. 233–243, 1960.
13. G. Cybenko, “The numerical stability of the Levinson-Durbin algorithm for Toeplitz systems of equations,” SIAM J. Sci. Stat. Cornput., vol. 1, pp. 303–320, 1980.
14. J. H. Wilkinson, The Algebraic Eigenvalue Problem. Oxford, England: Clarendon 1965.
15. N. Levinson, “The Wiener rms (root mean square) error criterion in filter design and prediction,” J. Math Phys., vol. 25, pp. 261–278, 1947.
16. P. Delsarte, Y. Genin, and Y. Kamp, “A polynomial approach to the generalized Levinson algorithm, based on the Toeplitz distance,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 268–278, 1983.
17. J. H. Wilkinson, “Error analysis of direct methods of matrix inversion,” J. Assoc. Comput. Mach., vol. 8, pp. 281–330, 1961.
18. L. R. Rabiner and R. W. Schafer, Digital Processing of Speech Signals. Englewood Cliffs, NJ: Prentice-Hall, 1978.
19. S. M. Kay, “Recursive maximum likelihood estimation of autoregressive processes,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 56–65, Feb. 1983.