Adaptive noise cancellation using fast optimum block algorithms

Michael E. Deisher, Andreas Spanias

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

3 Citations (Scopus)

Abstract

The application of block frequency domain (FFT-based) adaptive algorithms to noise cancellation is considered. Two classes of FFT-based algorithms are examined, namely, those associated with periodic convolution and those associated with linear convolution. In both cases normalized optimum convergence factors are considered. Experimental noise cancellation results are given using speech corrupted by white, colored, and harmonically structured noise (simulated engine noise). Quantitative and subjective evaluations are given for all the results, and trade-offs of performance versus computational complexity are established.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages698-701
Number of pages4
Volume1
StatePublished - 1991
Event1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5) - Singapore, Singapore
Duration: Jun 11 1991Jun 14 1991

Other

Other1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5)
CitySingapore, Singapore
Period6/11/916/14/91

Fingerprint

Convolution
Fast Fourier transforms
Adaptive algorithms
Computational complexity
Engines

ASJC Scopus subject areas

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

Cite this

Deisher, M. E., & Spanias, A. (1991). Adaptive noise cancellation using fast optimum block algorithms. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 1, pp. 698-701). Publ by IEEE.

Adaptive noise cancellation using fast optimum block algorithms. / Deisher, Michael E.; Spanias, Andreas.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Publ by IEEE, 1991. p. 698-701.

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

Deisher, ME & Spanias, A 1991, Adaptive noise cancellation using fast optimum block algorithms. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 1, Publ by IEEE, pp. 698-701, 1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5), Singapore, Singapore, 6/11/91.
Deisher ME, Spanias A. Adaptive noise cancellation using fast optimum block algorithms. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1. Publ by IEEE. 1991. p. 698-701
Deisher, Michael E. ; Spanias, Andreas. / Adaptive noise cancellation using fast optimum block algorithms. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Publ by IEEE, 1991. pp. 698-701
@inproceedings{5f07ace992694c7cb68106bc4655fe0c,
title = "Adaptive noise cancellation using fast optimum block algorithms",
abstract = "The application of block frequency domain (FFT-based) adaptive algorithms to noise cancellation is considered. Two classes of FFT-based algorithms are examined, namely, those associated with periodic convolution and those associated with linear convolution. In both cases normalized optimum convergence factors are considered. Experimental noise cancellation results are given using speech corrupted by white, colored, and harmonically structured noise (simulated engine noise). Quantitative and subjective evaluations are given for all the results, and trade-offs of performance versus computational complexity are established.",
author = "Deisher, {Michael E.} and Andreas Spanias",
year = "1991",
language = "English (US)",
volume = "1",
pages = "698--701",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Adaptive noise cancellation using fast optimum block algorithms

AU - Deisher, Michael E.

AU - Spanias, Andreas

PY - 1991

Y1 - 1991

N2 - The application of block frequency domain (FFT-based) adaptive algorithms to noise cancellation is considered. Two classes of FFT-based algorithms are examined, namely, those associated with periodic convolution and those associated with linear convolution. In both cases normalized optimum convergence factors are considered. Experimental noise cancellation results are given using speech corrupted by white, colored, and harmonically structured noise (simulated engine noise). Quantitative and subjective evaluations are given for all the results, and trade-offs of performance versus computational complexity are established.

AB - The application of block frequency domain (FFT-based) adaptive algorithms to noise cancellation is considered. Two classes of FFT-based algorithms are examined, namely, those associated with periodic convolution and those associated with linear convolution. In both cases normalized optimum convergence factors are considered. Experimental noise cancellation results are given using speech corrupted by white, colored, and harmonically structured noise (simulated engine noise). Quantitative and subjective evaluations are given for all the results, and trade-offs of performance versus computational complexity are established.

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

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

M3 - Conference contribution

AN - SCOPUS:0026400865

VL - 1

SP - 698

EP - 701

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

ER -