Architecture driven filter transformations

Manish Sharma, Naresh R. Shanbhag

Research output: Contribution to journalConference article

Abstract

In this paper, we present the Sum of Powers-Of-Two (SPOT) algorithm transformation that results in a high-speed IIR filter architecture by forcing the first few coefficients of the denominator polynomial to powers of two or sums of powers of two. The SPOT transform achieves the same result as achieved by conventional pipelining techniques such as scattered look-ahead and minimum order augmentation but with significantly smaller pipelining overhead and similar sensitivity to coefficient quantization. For typical examples, the SPOT transform roughly saves 30% hardware complexity over existing techniques. Architectures for implementation of the transformed filter transfer functions have also been described.

Original languageEnglish (US)
Pages (from-to)V-601-V-604
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume5
StatePublished - Jan 1 2000
EventProceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems - Geneva, Switz
Duration: May 28 2000May 31 2000

Fingerprint

IIR filters
Transfer functions
Polynomials
Hardware

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Architecture driven filter transformations. / Sharma, Manish; Shanbhag, Naresh R.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 5, 01.01.2000, p. V-601-V-604.

Research output: Contribution to journalConference article

@article{0e661b68a34a41cabe9fd5e9d3601d9f,
title = "Architecture driven filter transformations",
abstract = "In this paper, we present the Sum of Powers-Of-Two (SPOT) algorithm transformation that results in a high-speed IIR filter architecture by forcing the first few coefficients of the denominator polynomial to powers of two or sums of powers of two. The SPOT transform achieves the same result as achieved by conventional pipelining techniques such as scattered look-ahead and minimum order augmentation but with significantly smaller pipelining overhead and similar sensitivity to coefficient quantization. For typical examples, the SPOT transform roughly saves 30{\%} hardware complexity over existing techniques. Architectures for implementation of the transformed filter transfer functions have also been described.",
author = "Manish Sharma and Shanbhag, {Naresh R.}",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
volume = "5",
pages = "V--601--V--604",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Architecture driven filter transformations

AU - Sharma, Manish

AU - Shanbhag, Naresh R.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this paper, we present the Sum of Powers-Of-Two (SPOT) algorithm transformation that results in a high-speed IIR filter architecture by forcing the first few coefficients of the denominator polynomial to powers of two or sums of powers of two. The SPOT transform achieves the same result as achieved by conventional pipelining techniques such as scattered look-ahead and minimum order augmentation but with significantly smaller pipelining overhead and similar sensitivity to coefficient quantization. For typical examples, the SPOT transform roughly saves 30% hardware complexity over existing techniques. Architectures for implementation of the transformed filter transfer functions have also been described.

AB - In this paper, we present the Sum of Powers-Of-Two (SPOT) algorithm transformation that results in a high-speed IIR filter architecture by forcing the first few coefficients of the denominator polynomial to powers of two or sums of powers of two. The SPOT transform achieves the same result as achieved by conventional pipelining techniques such as scattered look-ahead and minimum order augmentation but with significantly smaller pipelining overhead and similar sensitivity to coefficient quantization. For typical examples, the SPOT transform roughly saves 30% hardware complexity over existing techniques. Architectures for implementation of the transformed filter transfer functions have also been described.

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

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

M3 - Conference article

AN - SCOPUS:0033683065

VL - 5

SP - V-601-V-604

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -