Optimizing FIR Approximation for Discrete-Time IIR Filters

Simple item page
dc.contributor.authorYamamoto, Yutaka
dc.contributor.authorAnderson, Brian
dc.contributor.authorNagahara, Masaaki
dc.contributor.authorKoyanagi, Yoko
dc.date.accessioned2015-12-13T23:06:04Z
dc.date.issued2003
dc.date.updated2015-12-12T08:03:31Z
dc.description.abstractFinite-impulse response (FIR) filters are often preferred to infinite-impulse response (IIR) filters because of their various advantages in respect of stability, phase characteristic, implementation, etc. This letter proposes a new method to approximate an IIR filter by an FIR filter, which directly yields an optimal approximation with respect to the H∞ error norm. We show that this design problem can be reduced to a linear matrix inequality. We will also make a comparison via a numerical example with an existing method, known as the Nehari shuffle.
dc.identifier.issn1070-9908
dc.identifier.urihttp://hdl.handle.net/1885/85848
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.sourceIEEE Signal Processing Letters
dc.subjectKeywords: Electric network synthesis; IIR filters; Linear control systems; Markov processes; Matrix algebra; Optimization; Poles and zeros; Discrete-time infinite impulse response filters; Finite-impulse response filter approximation; Linear matrix inequality; FIR Finite-impulse response (FIR) filter approximation; H8 optimization; Linear matrix inequality
dc.titleOptimizing FIR Approximation for Discrete-Time IIR Filters
dc.typeJournal article
local.bibliographicCitation.issue9
local.bibliographicCitation.lastpage276
local.bibliographicCitation.startpage273
local.contributor.affiliationYamamoto, Yutaka, College of Engineering and Computer Science, ANU
local.contributor.affiliationAnderson, Brian, College of Engineering and Computer Science, ANU
local.contributor.affiliationNagahara, Masaaki, Kyoto University
local.contributor.affiliationKoyanagi, Yoko, Kyoto University
local.contributor.authoremailu8104642@anu.edu.au
local.contributor.authoruidYamamoto, Yutaka, t231
local.contributor.authoruidAnderson, Brian, u8104642
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor010203 - Calculus of Variations, Systems Theory and Control Theory
local.identifier.absfor090609 - Signal Processing
local.identifier.ariespublicationMigratedxPub14515
local.identifier.citationvolume10
local.identifier.doi10.1109/LSP.2003.815615
local.identifier.scopusID2-s2.0-0041878609
local.identifier.uidSubmittedByMigrated
local.type.statusPublished Version

Downloads

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
01_Yamamoto_Optimizing_FIR_Approximation_2003.pdf
Size:
211.63 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2024 LYRASIS