An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions

Andreas Spanias, Wasfy B. Mikhael

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

Abstract

A least squares (LS) pole-zero algorithm in the transform domain which fits each of the retained subsets of the complex transform components accurately is presented. The pole-zero function, while characterized by real coefficients about twice the number of the retained complex transform components, carries enough location, magnitude, and phase information for accurate signal reconstruction. The algorithm is applied for the coding of the mixed DFT-WHT parameters. Results are given for 8 Kb/s and 6.4 Kb/s.

Original languageEnglish (US)
Title of host publicationMidwest Symposium on Circuits and Systems
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages598-601
Number of pages4
StatePublished - 1990
EventProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA
Duration: Aug 14 1989Aug 16 1989

Other

OtherProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2)
CityChampaign, IL, USA
Period8/14/898/16/89

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions'. Together they form a unique fingerprint.

  • Cite this

    Spanias, A., & Mikhael, W. B. (1990). An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions. In Midwest Symposium on Circuits and Systems (pp. 598-601). Publ by IEEE.