A least-squares pole-zero algorithm in the frequency and Walsh domains with applications to speech representation

Wasfy B. Mikhael, Andreas Spanias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A spectral envelope matching technique is presented to allow coding of the mixed DFT-WHT parameters at lower rates. A least-squares (LS) pole-zero algorithm is derived in the frequency-domain. Pole-zero, as well as all-zero and all-pole, solutions can be obtained using the LS algorithm. The all-pole model is employed in this research to fit finite subsets of DFT components and WHT spectral components. The all-pole function, while characterized by real coefficients, carries location, magnitude, and phase information for accurate signal synthesis. Simulation results, using speech signals, are presented to demonstrate the performance of the algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages1331-1334
Number of pages4
Volume2
StatePublished - 1990
Externally publishedYes
Event1990 IEEE International Symposium on Circuits and Systems Part 3 (of 4) - New Orleans, LA, USA
Duration: May 1 1990May 3 1990

Other

Other1990 IEEE International Symposium on Circuits and Systems Part 3 (of 4)
CityNew Orleans, LA, USA
Period5/1/905/3/90

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'A least-squares pole-zero algorithm in the frequency and Walsh domains with applications to speech representation'. Together they form a unique fingerprint.

  • Cite this

    Mikhael, W. B., & Spanias, A. (1990). A least-squares pole-zero algorithm in the frequency and Walsh domains with applications to speech representation. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2, pp. 1331-1334). Publ by IEEE.