Concurrent Cellular VLSI Adaptive Filter Architectures

Keshab K. Parhi, David G. Messerschmitt

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel (or “block”) realizations. In this paper, we show that adaptive filters can be implemented in an area-efficient manner by first using pipelining to the maximum possible extent, and then using block processing in combination with pipelining if further increase in sampling rate is needed. We show that, with the use of a decomposition technique, high-speed realizations can be achieved using pipelining with a logarithmic increase in hardware (the block realizations require a linear increase in hardware). We derive pipelined word-parallel realizations of high-sampling-rate adaptive lattice filters using the techniques of look-ahead computation, decomposed state update implementation, and incremental output computation. These three techniques combined make it possible to achieve asymptotically optimal complexity realizations (i.e., the same complexity asymptotically as nonrecursive systems) of high-speed adaptive lattice filters (in both bit-serial and bit-parallel methodologies) and provide a “system solution” to high-speed adaptive filtering. The adaptive lattice filter structures are ideal for high-sampling-rate implementations, since the error residuals of a particular stage are adapted order-recursively based on those of the previous stage, and the coefficient update recursion inside each stage is linear in nature. An example of a normalized stochastic gradient adaptive lattice filter is presented, and its complexity, latency, and implementation methodology tradeoffs are studied.

Original languageEnglish (US)
Pages (from-to)1141-1151
Number of pages11
JournalIEEE Transactions on Circuits and Systems
Volume34
Issue number10
DOIs
StatePublished - Jan 1 1987

Fingerprint

Adaptive filters
Sampling
Hardware
Adaptive filtering
Decomposition
Processing

Cite this

Concurrent Cellular VLSI Adaptive Filter Architectures. / Parhi, Keshab K.; Messerschmitt, David G.

In: IEEE Transactions on Circuits and Systems, Vol. 34, No. 10, 01.01.1987, p. 1141-1151.

Research output: Contribution to journalArticle

Parhi, Keshab K. ; Messerschmitt, David G. / Concurrent Cellular VLSI Adaptive Filter Architectures. In: IEEE Transactions on Circuits and Systems. 1987 ; Vol. 34, No. 10. pp. 1141-1151.
@article{5554a508932e410a9045b972b91fe88f,
title = "Concurrent Cellular VLSI Adaptive Filter Architectures",
abstract = "Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel (or “block”) realizations. In this paper, we show that adaptive filters can be implemented in an area-efficient manner by first using pipelining to the maximum possible extent, and then using block processing in combination with pipelining if further increase in sampling rate is needed. We show that, with the use of a decomposition technique, high-speed realizations can be achieved using pipelining with a logarithmic increase in hardware (the block realizations require a linear increase in hardware). We derive pipelined word-parallel realizations of high-sampling-rate adaptive lattice filters using the techniques of look-ahead computation, decomposed state update implementation, and incremental output computation. These three techniques combined make it possible to achieve asymptotically optimal complexity realizations (i.e., the same complexity asymptotically as nonrecursive systems) of high-speed adaptive lattice filters (in both bit-serial and bit-parallel methodologies) and provide a “system solution” to high-speed adaptive filtering. The adaptive lattice filter structures are ideal for high-sampling-rate implementations, since the error residuals of a particular stage are adapted order-recursively based on those of the previous stage, and the coefficient update recursion inside each stage is linear in nature. An example of a normalized stochastic gradient adaptive lattice filter is presented, and its complexity, latency, and implementation methodology tradeoffs are studied.",
author = "Parhi, {Keshab K.} and Messerschmitt, {David G.}",
year = "1987",
month = "1",
day = "1",
doi = "10.1109/TCS.1987.1086048",
language = "English (US)",
volume = "34",
pages = "1141--1151",
journal = "IEEE Transactions on Circuits and Systems",
issn = "0098-4094",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Concurrent Cellular VLSI Adaptive Filter Architectures

AU - Parhi, Keshab K.

AU - Messerschmitt, David G.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel (or “block”) realizations. In this paper, we show that adaptive filters can be implemented in an area-efficient manner by first using pipelining to the maximum possible extent, and then using block processing in combination with pipelining if further increase in sampling rate is needed. We show that, with the use of a decomposition technique, high-speed realizations can be achieved using pipelining with a logarithmic increase in hardware (the block realizations require a linear increase in hardware). We derive pipelined word-parallel realizations of high-sampling-rate adaptive lattice filters using the techniques of look-ahead computation, decomposed state update implementation, and incremental output computation. These three techniques combined make it possible to achieve asymptotically optimal complexity realizations (i.e., the same complexity asymptotically as nonrecursive systems) of high-speed adaptive lattice filters (in both bit-serial and bit-parallel methodologies) and provide a “system solution” to high-speed adaptive filtering. The adaptive lattice filter structures are ideal for high-sampling-rate implementations, since the error residuals of a particular stage are adapted order-recursively based on those of the previous stage, and the coefficient update recursion inside each stage is linear in nature. An example of a normalized stochastic gradient adaptive lattice filter is presented, and its complexity, latency, and implementation methodology tradeoffs are studied.

AB - Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel (or “block”) realizations. In this paper, we show that adaptive filters can be implemented in an area-efficient manner by first using pipelining to the maximum possible extent, and then using block processing in combination with pipelining if further increase in sampling rate is needed. We show that, with the use of a decomposition technique, high-speed realizations can be achieved using pipelining with a logarithmic increase in hardware (the block realizations require a linear increase in hardware). We derive pipelined word-parallel realizations of high-sampling-rate adaptive lattice filters using the techniques of look-ahead computation, decomposed state update implementation, and incremental output computation. These three techniques combined make it possible to achieve asymptotically optimal complexity realizations (i.e., the same complexity asymptotically as nonrecursive systems) of high-speed adaptive lattice filters (in both bit-serial and bit-parallel methodologies) and provide a “system solution” to high-speed adaptive filtering. The adaptive lattice filter structures are ideal for high-sampling-rate implementations, since the error residuals of a particular stage are adapted order-recursively based on those of the previous stage, and the coefficient update recursion inside each stage is linear in nature. An example of a normalized stochastic gradient adaptive lattice filter is presented, and its complexity, latency, and implementation methodology tradeoffs are studied.

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

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

U2 - 10.1109/TCS.1987.1086048

DO - 10.1109/TCS.1987.1086048

M3 - Article

VL - 34

SP - 1141

EP - 1151

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

SN - 0098-4094

IS - 10

ER -