High sample rate architectures for block adaptive filters

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

Abstract

In this paper we propose a variety of architectures for implementing block adaptive filters in the time-domain. These filters are based on a block implementation of the least mean squares (BLMS) algorithm. First, we present an architecture which directly maps the BLMS algorithm into an array of processors. Next, we describe an architecture where the weight vector is updated without explicitly computing the filter error. Third, we describe an architecture which exploits the redundant computations of overlapping windows. All the architectures have a significantly smaller sample period compared to frequency domain implementations. Moreover, the sample periods can be reduced even further by applying relaxed look-ahead techniques.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Pages131-134
Number of pages4
Volume4
StatePublished - 1994
EventProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
Duration: May 30 1994Jun 2 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6)
CityLondon, England
Period5/30/946/2/94

Fingerprint

Adaptive filters

ASJC Scopus subject areas

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

Cite this

Karkada, S., Chakrabarti, C., & Spanias, A. (1994). High sample rate architectures for block adaptive filters. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 4, pp. 131-134). IEEE.

High sample rate architectures for block adaptive filters. / Karkada, Srikanth; Chakrabarti, Chaitali; Spanias, Andreas.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4 IEEE, 1994. p. 131-134.

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

Karkada, S, Chakrabarti, C & Spanias, A 1994, High sample rate architectures for block adaptive filters. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 4, IEEE, pp. 131-134, Proceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6), London, England, 5/30/94.
Karkada S, Chakrabarti C, Spanias A. High sample rate architectures for block adaptive filters. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4. IEEE. 1994. p. 131-134
Karkada, Srikanth ; Chakrabarti, Chaitali ; Spanias, Andreas. / High sample rate architectures for block adaptive filters. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4 IEEE, 1994. pp. 131-134
@inproceedings{b3fa938cf40746dab6b2342cb29d12f7,
title = "High sample rate architectures for block adaptive filters",
abstract = "In this paper we propose a variety of architectures for implementing block adaptive filters in the time-domain. These filters are based on a block implementation of the least mean squares (BLMS) algorithm. First, we present an architecture which directly maps the BLMS algorithm into an array of processors. Next, we describe an architecture where the weight vector is updated without explicitly computing the filter error. Third, we describe an architecture which exploits the redundant computations of overlapping windows. All the architectures have a significantly smaller sample period compared to frequency domain implementations. Moreover, the sample periods can be reduced even further by applying relaxed look-ahead techniques.",
author = "Srikanth Karkada and Chaitali Chakrabarti and Andreas Spanias",
year = "1994",
language = "English (US)",
volume = "4",
pages = "131--134",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

T1 - High sample rate architectures for block adaptive filters

AU - Karkada, Srikanth

AU - Chakrabarti, Chaitali

AU - Spanias, Andreas

PY - 1994

Y1 - 1994

N2 - In this paper we propose a variety of architectures for implementing block adaptive filters in the time-domain. These filters are based on a block implementation of the least mean squares (BLMS) algorithm. First, we present an architecture which directly maps the BLMS algorithm into an array of processors. Next, we describe an architecture where the weight vector is updated without explicitly computing the filter error. Third, we describe an architecture which exploits the redundant computations of overlapping windows. All the architectures have a significantly smaller sample period compared to frequency domain implementations. Moreover, the sample periods can be reduced even further by applying relaxed look-ahead techniques.

AB - In this paper we propose a variety of architectures for implementing block adaptive filters in the time-domain. These filters are based on a block implementation of the least mean squares (BLMS) algorithm. First, we present an architecture which directly maps the BLMS algorithm into an array of processors. Next, we describe an architecture where the weight vector is updated without explicitly computing the filter error. Third, we describe an architecture which exploits the redundant computations of overlapping windows. All the architectures have a significantly smaller sample period compared to frequency domain implementations. Moreover, the sample periods can be reduced even further by applying relaxed look-ahead techniques.

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

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

M3 - Conference contribution

VL - 4

SP - 131

EP - 134

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - IEEE

ER -