On the computation of the Kullback-Leibler measure for spectral distances

Author

Veldhuis, Raymond ; Klabbers, Esther

Author_Institution

Twente Univ., Enschede, Netherlands

Volume

11

Issue

1

fYear

2003

fDate

1/1/2003 12:00:00 AM

Firstpage

100

Lastpage

103

Abstract

Efficient algorithms for the exact and approximate computation of the symmetrical Kullback-Leibler (1998) measure for spectral distances are presented for linear predictive coding (LPC) spectra. A interpretation of this measure is given in terms of the poles of the spectra. The performances of the algorithms in terms of accuracy and computational complexity are assessed for the application of computing concatenation costs in unit-selection-based speech synthesis. With the same complexity and storage requirements, the exact method is superior in terms of accuracy.

Keywords

approximation theory; computational complexity; data compression; integral equations; linear predictive coding; spectral analysis; speech coding; speech synthesis; LPC spectra; algorithm accuracy; approximate computation; computational complexity; concatenation costs; efficient algorithms; exact computation; integral equations; spectra poles; spectral distances; storage requirements; symmetrical Kullback-Leibler measure; unit-selection-based speech synthesis; Bit rate; Computational complexity; Computer applications; Costs; Databases; Linear predictive coding; Measurement units; Speech coding; Speech synthesis; Vector quantization;

fLanguage

English

Journal_Title

Speech and Audio Processing, IEEE Transactions on

Publisher

ieee

ISSN

1063-6676

Type

jour

DOI

10.1109/TSA.2002.805641

Filename

1179384