New blocked IIR algorithm

Chen Mie Wu; Mohan Vishwanath; Robert M. Owens; Mary Jane Irwin

New blocked IIR algorithm

Chen Mie Wu, Mohan Vishwanath, Robert M. Owens, Mary Jane Irwin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper a new IIR algorithm is presented. It is based on a block implementation method for IIR filters. This new algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output. Because the correction circuit uses part of the previous output to correct the current intermediate result, our approach is an overlap-save based algorithm. The multiplicative complexity of this algorithm is shown to be 2 log kn+2 log n+5 real multiplications per output point, for a block of size kn, where n is the order of the filter and k≥2, is a constant. This is less than the counts for other known algorithms. Another advantage of this algorithm is that it can be easily implemented in an optimal manner in hardware.

Original language	English (US)
Title of host publication	Digital Speech Processing
Publisher	Publ by IEEE
Pages	111.113-116
ISBN (Print)	0780309464
State	Published - Jan 1 1993
Event	1993 IEEE International Conference on Acoustics, Speech and Signal Processing - Minneapolis, MN, USA Duration: Apr 27 1993 → Apr 30 1993

Publication series

Name	Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume	3
ISSN (Print)	0736-7791

Other

Other	1993 IEEE International Conference on Acoustics, Speech and Signal Processing
City	Minneapolis, MN, USA
Period	4/27/93 → 4/30/93

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Electrical and Electronic Engineering

Cite this

@inproceedings{a87b468cbd1242bb946d1e7cbe905bb1,

title = "New blocked IIR algorithm",

abstract = "In this paper a new IIR algorithm is presented. It is based on a block implementation method for IIR filters. This new algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output. Because the correction circuit uses part of the previous output to correct the current intermediate result, our approach is an overlap-save based algorithm. The multiplicative complexity of this algorithm is shown to be 2 log kn+2 log n+5 real multiplications per output point, for a block of size kn, where n is the order of the filter and k≥2, is a constant. This is less than the counts for other known algorithms. Another advantage of this algorithm is that it can be easily implemented in an optimal manner in hardware.",

author = "Wu, {Chen Mie} and Mohan Vishwanath and Owens, {Robert M.} and Irwin, {Mary Jane}",

year = "1993",

month = jan,

day = "1",

language = "English (US)",

isbn = "0780309464",

series = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",

publisher = "Publ by IEEE",

pages = "111.113--116",

booktitle = "Digital Speech Processing",

note = "1993 IEEE International Conference on Acoustics, Speech and Signal Processing ; Conference date: 27-04-1993 Through 30-04-1993",

}

TY - GEN

T1 - New blocked IIR algorithm

AU - Wu, Chen Mie

AU - Vishwanath, Mohan

AU - Owens, Robert M.

AU - Irwin, Mary Jane

PY - 1993/1/1

Y1 - 1993/1/1

N2 - In this paper a new IIR algorithm is presented. It is based on a block implementation method for IIR filters. This new algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output. Because the correction circuit uses part of the previous output to correct the current intermediate result, our approach is an overlap-save based algorithm. The multiplicative complexity of this algorithm is shown to be 2 log kn+2 log n+5 real multiplications per output point, for a block of size kn, where n is the order of the filter and k≥2, is a constant. This is less than the counts for other known algorithms. Another advantage of this algorithm is that it can be easily implemented in an optimal manner in hardware.

AB - In this paper a new IIR algorithm is presented. It is based on a block implementation method for IIR filters. This new algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output. Because the correction circuit uses part of the previous output to correct the current intermediate result, our approach is an overlap-save based algorithm. The multiplicative complexity of this algorithm is shown to be 2 log kn+2 log n+5 real multiplications per output point, for a block of size kn, where n is the order of the filter and k≥2, is a constant. This is less than the counts for other known algorithms. Another advantage of this algorithm is that it can be easily implemented in an optimal manner in hardware.

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

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

M3 - Conference contribution

AN - SCOPUS:0027210172

SN - 0780309464

T3 - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SP - 111.113-116

BT - Digital Speech Processing

PB - Publ by IEEE

T2 - 1993 IEEE International Conference on Acoustics, Speech and Signal Processing

Y2 - 27 April 1993 through 30 April 1993

ER -

New blocked IIR algorithm

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this