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

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-selectionbased speech synthesis. With the same complexity and storage requirements, the exact method is superior in terms of accuracy.