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

    Research output: Contribution to journalArticleAcademicpeer-review

    23 Citations (Scopus)
    150 Downloads (Pure)


    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. An 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.
    Original languageUndefined
    Pages (from-to)100-103
    Number of pages4
    JournalIEEE transactions on speech and audio processing
    Issue number1
    Publication statusPublished - Jan 2003


    • EWI-807
    • IR-45311
    • METIS-211893

    Cite this