Concurrent architectures for two-dimensional recursive digital filtering

Keshab K Parhi, David G. Messerschmitt

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Efficient architectures are presented for high-speed implementation of two-dimensional recursive digital filters of direct form and local state-space form. Unlike one-dimensional recursive systems, two-dimensional recursive digital filter algorithms have a large amount of inherent concurrency. The authors exploit this concurrency to derive fine-grain pipelined and one-dimensional block architectures for implementation of two-dimensional recursive digital filters by appropriate interleaving (or indexing) of the input samples, without requiring any algorithm transformation and without any hardware overhead. They then extend the look-ahead computation and incremental computation techniques to two dimensions and use them to derive two-dimensional incremental block filter architectures. The multiplication complexity of the two-dimensional incremental block filter is determined.

Original languageEnglish (US)
Pages (from-to)813-829
Number of pages17
JournalIEEE transactions on circuits and systems
Volumev
Issue numbern
StatePublished - Jan 1 1992

Fingerprint

Digital filters
Hardware

Cite this

Concurrent architectures for two-dimensional recursive digital filtering. / Parhi, Keshab K; Messerschmitt, David G.

In: IEEE transactions on circuits and systems, Vol. v, No. n, 01.01.1992, p. 813-829.

Research output: Contribution to journalArticle

@article{295b214a65944091901834acfa6e8ecf,
title = "Concurrent architectures for two-dimensional recursive digital filtering",
abstract = "Efficient architectures are presented for high-speed implementation of two-dimensional recursive digital filters of direct form and local state-space form. Unlike one-dimensional recursive systems, two-dimensional recursive digital filter algorithms have a large amount of inherent concurrency. The authors exploit this concurrency to derive fine-grain pipelined and one-dimensional block architectures for implementation of two-dimensional recursive digital filters by appropriate interleaving (or indexing) of the input samples, without requiring any algorithm transformation and without any hardware overhead. They then extend the look-ahead computation and incremental computation techniques to two dimensions and use them to derive two-dimensional incremental block filter architectures. The multiplication complexity of the two-dimensional incremental block filter is determined.",
author = "Parhi, {Keshab K} and Messerschmitt, {David G.}",
year = "1992",
month = "1",
day = "1",
language = "English (US)",
volume = "v",
pages = "813--829",
journal = "IEEE Transactions on Circuits and Systems",
issn = "0098-4094",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "n",

}

TY - JOUR

T1 - Concurrent architectures for two-dimensional recursive digital filtering

AU - Parhi, Keshab K

AU - Messerschmitt, David G.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - Efficient architectures are presented for high-speed implementation of two-dimensional recursive digital filters of direct form and local state-space form. Unlike one-dimensional recursive systems, two-dimensional recursive digital filter algorithms have a large amount of inherent concurrency. The authors exploit this concurrency to derive fine-grain pipelined and one-dimensional block architectures for implementation of two-dimensional recursive digital filters by appropriate interleaving (or indexing) of the input samples, without requiring any algorithm transformation and without any hardware overhead. They then extend the look-ahead computation and incremental computation techniques to two dimensions and use them to derive two-dimensional incremental block filter architectures. The multiplication complexity of the two-dimensional incremental block filter is determined.

AB - Efficient architectures are presented for high-speed implementation of two-dimensional recursive digital filters of direct form and local state-space form. Unlike one-dimensional recursive systems, two-dimensional recursive digital filter algorithms have a large amount of inherent concurrency. The authors exploit this concurrency to derive fine-grain pipelined and one-dimensional block architectures for implementation of two-dimensional recursive digital filters by appropriate interleaving (or indexing) of the input samples, without requiring any algorithm transformation and without any hardware overhead. They then extend the look-ahead computation and incremental computation techniques to two dimensions and use them to derive two-dimensional incremental block filter architectures. The multiplication complexity of the two-dimensional incremental block filter is determined.

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

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

M3 - Article

VL - v

SP - 813

EP - 829

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

SN - 0098-4094

IS - n

ER -