A pole-zero adaptive algorithm for speech processing

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

Abstract

A pole-zero adaptive algorithm is presented for selective spectral matching. This algorithm is capable of forming highly selective spectral envelopes for accurate fitting of frequency components. This adaptive technique can be employed to reduce the data rate in transform coding of speech, by efficiently 'packing' magnitude and phase information on a spectral envelope. Pole-zero algorithms have been developed and employed in system identification, as well as in spectral matching. In this work, a frequency-selective adaptive process is proposed for the spectral matching of the harmonic frequency components of speech. This process is based on the equation-error adaptive model.

Original languageEnglish (US)
Title of host publicationConference Proceedings - Annual Phoenix Conference
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages894
Number of pages1
ISBN (Print)0818620307
StatePublished - 1990
EventProceedings - Ninth Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA
Duration: Mar 21 1990Mar 23 1990

Other

OtherProceedings - Ninth Annual International Phoenix Conference on Computers and Communications
CityScottsdale, AZ, USA
Period3/21/903/23/90

Fingerprint

Speech processing
Adaptive algorithms
Poles
Identification (control systems)

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Spanias, A. (1990). A pole-zero adaptive algorithm for speech processing. In Conference Proceedings - Annual Phoenix Conference (pp. 894). Piscataway, NJ, United States: Publ by IEEE.

A pole-zero adaptive algorithm for speech processing. / Spanias, Andreas.

Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States : Publ by IEEE, 1990. p. 894.

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

Spanias, A 1990, A pole-zero adaptive algorithm for speech processing. in Conference Proceedings - Annual Phoenix Conference. Publ by IEEE, Piscataway, NJ, United States, pp. 894, Proceedings - Ninth Annual International Phoenix Conference on Computers and Communications, Scottsdale, AZ, USA, 3/21/90.
Spanias A. A pole-zero adaptive algorithm for speech processing. In Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States: Publ by IEEE. 1990. p. 894
Spanias, Andreas. / A pole-zero adaptive algorithm for speech processing. Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States : Publ by IEEE, 1990. pp. 894
@inproceedings{c49cf45d1ef8464f905f50ac82d5bbe4,
title = "A pole-zero adaptive algorithm for speech processing",
abstract = "A pole-zero adaptive algorithm is presented for selective spectral matching. This algorithm is capable of forming highly selective spectral envelopes for accurate fitting of frequency components. This adaptive technique can be employed to reduce the data rate in transform coding of speech, by efficiently 'packing' magnitude and phase information on a spectral envelope. Pole-zero algorithms have been developed and employed in system identification, as well as in spectral matching. In this work, a frequency-selective adaptive process is proposed for the spectral matching of the harmonic frequency components of speech. This process is based on the equation-error adaptive model.",
author = "Andreas Spanias",
year = "1990",
language = "English (US)",
isbn = "0818620307",
pages = "894",
booktitle = "Conference Proceedings - Annual Phoenix Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - A pole-zero adaptive algorithm for speech processing

AU - Spanias, Andreas

PY - 1990

Y1 - 1990

N2 - A pole-zero adaptive algorithm is presented for selective spectral matching. This algorithm is capable of forming highly selective spectral envelopes for accurate fitting of frequency components. This adaptive technique can be employed to reduce the data rate in transform coding of speech, by efficiently 'packing' magnitude and phase information on a spectral envelope. Pole-zero algorithms have been developed and employed in system identification, as well as in spectral matching. In this work, a frequency-selective adaptive process is proposed for the spectral matching of the harmonic frequency components of speech. This process is based on the equation-error adaptive model.

AB - A pole-zero adaptive algorithm is presented for selective spectral matching. This algorithm is capable of forming highly selective spectral envelopes for accurate fitting of frequency components. This adaptive technique can be employed to reduce the data rate in transform coding of speech, by efficiently 'packing' magnitude and phase information on a spectral envelope. Pole-zero algorithms have been developed and employed in system identification, as well as in spectral matching. In this work, a frequency-selective adaptive process is proposed for the spectral matching of the harmonic frequency components of speech. This process is based on the equation-error adaptive model.

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

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

M3 - Conference contribution

AN - SCOPUS:0025672523

SN - 0818620307

SP - 894

BT - Conference Proceedings - Annual Phoenix Conference

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -