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

Fingerprint

Orthogonal functions
Poles
Signal reconstruction
Discrete Fourier transforms

ASJC Scopus subject areas

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

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). Piscataway, NJ, United States: Publ by IEEE.

An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions. / Spanias, Andreas; Mikhael, Wasfy B.

Midwest Symposium on Circuits and Systems. Piscataway, NJ, United States : Publ by IEEE, 1990. p. 598-601.

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

Spanias, A & Mikhael, WB 1990, An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions. in Midwest Symposium on Circuits and Systems. Publ by IEEE, Piscataway, NJ, United States, pp. 598-601, Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, 8/14/89.
Spanias A, Mikhael WB. An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions. In Midwest Symposium on Circuits and Systems. Piscataway, NJ, United States: Publ by IEEE. 1990. p. 598-601
Spanias, Andreas ; Mikhael, Wasfy B. / An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions. Midwest Symposium on Circuits and Systems. Piscataway, NJ, United States : Publ by IEEE, 1990. pp. 598-601
@inproceedings{23f6ee17506c41a3a217d6449dbd274a,
title = "An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions",
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.",
author = "Andreas Spanias and Mikhael, {Wasfy B.}",
year = "1990",
language = "English (US)",
pages = "598--601",
booktitle = "Midwest Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Spanias, Andreas

AU - Mikhael, Wasfy B.

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025646887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025646887&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025646887

SP - 598

EP - 601

BT - Midwest Symposium on Circuits and Systems

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -