Finite Word Effects in Pipelined Recursive Filters

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

High sample rate recursive filtering can be achieved by transforming the original filters to higher order filters using the Scattered look-ahead computation technique (which relies upon pole-zero cancellation). Finite word-length implementation of these filters will lead to inexact pole-zero cancellation. This necessitates a thorough study of finite word effects in these filters. In this correspondence, we present theoretical results on roundoff and coefficient quantization errors in these filters. We show that (to maintain the same error at the filter output) the word length needs to be at most increased by log2 log2 2M b for a scattered look-ahead decomposed filter (where M is the level of loop pipelining). This worst case corresponds to the case when all poles are close to zero. For M between 2 and 8, the word length needs to be increased only by 1 or 2 b. Contrary to common belief, we conclude that pole-zero canceling scattered look-ahead pipelined recursive filters have good finite word error properties.

Original languageEnglish (US)
Pages (from-to)1450-1454
Number of pages5
JournalIEEE Transactions on Signal Processing
Volume39
Issue number6
DOIs
StatePublished - Jan 1 1991

Fingerprint

Poles

Cite this

Finite Word Effects in Pipelined Recursive Filters. / Parhi, Keshab K.

In: IEEE Transactions on Signal Processing, Vol. 39, No. 6, 01.01.1991, p. 1450-1454.

Research output: Contribution to journalArticle

@article{e6a7a1697f384b7db4ebe023b2623953,
title = "Finite Word Effects in Pipelined Recursive Filters",
abstract = "High sample rate recursive filtering can be achieved by transforming the original filters to higher order filters using the Scattered look-ahead computation technique (which relies upon pole-zero cancellation). Finite word-length implementation of these filters will lead to inexact pole-zero cancellation. This necessitates a thorough study of finite word effects in these filters. In this correspondence, we present theoretical results on roundoff and coefficient quantization errors in these filters. We show that (to maintain the same error at the filter output) the word length needs to be at most increased by log2 log2 2M b for a scattered look-ahead decomposed filter (where M is the level of loop pipelining). This worst case corresponds to the case when all poles are close to zero. For M between 2 and 8, the word length needs to be increased only by 1 or 2 b. Contrary to common belief, we conclude that pole-zero canceling scattered look-ahead pipelined recursive filters have good finite word error properties.",
author = "Parhi, {Keshab K}",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/78.136557",
language = "English (US)",
volume = "39",
pages = "1450--1454",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Finite Word Effects in Pipelined Recursive Filters

AU - Parhi, Keshab K

PY - 1991/1/1

Y1 - 1991/1/1

N2 - High sample rate recursive filtering can be achieved by transforming the original filters to higher order filters using the Scattered look-ahead computation technique (which relies upon pole-zero cancellation). Finite word-length implementation of these filters will lead to inexact pole-zero cancellation. This necessitates a thorough study of finite word effects in these filters. In this correspondence, we present theoretical results on roundoff and coefficient quantization errors in these filters. We show that (to maintain the same error at the filter output) the word length needs to be at most increased by log2 log2 2M b for a scattered look-ahead decomposed filter (where M is the level of loop pipelining). This worst case corresponds to the case when all poles are close to zero. For M between 2 and 8, the word length needs to be increased only by 1 or 2 b. Contrary to common belief, we conclude that pole-zero canceling scattered look-ahead pipelined recursive filters have good finite word error properties.

AB - High sample rate recursive filtering can be achieved by transforming the original filters to higher order filters using the Scattered look-ahead computation technique (which relies upon pole-zero cancellation). Finite word-length implementation of these filters will lead to inexact pole-zero cancellation. This necessitates a thorough study of finite word effects in these filters. In this correspondence, we present theoretical results on roundoff and coefficient quantization errors in these filters. We show that (to maintain the same error at the filter output) the word length needs to be at most increased by log2 log2 2M b for a scattered look-ahead decomposed filter (where M is the level of loop pipelining). This worst case corresponds to the case when all poles are close to zero. For M between 2 and 8, the word length needs to be increased only by 1 or 2 b. Contrary to common belief, we conclude that pole-zero canceling scattered look-ahead pipelined recursive filters have good finite word error properties.

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

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

U2 - 10.1109/78.136557

DO - 10.1109/78.136557

M3 - Article

VL - 39

SP - 1450

EP - 1454

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 6

ER -