Adaptive Laguerre-lattice filters
Adaptive Laguerre-based filters provide an attractive alternative to adaptive FIR filters in the sense that they require fewer parameters to model a linear time-invariant system with a long impulse response. We present an adaptive Laguerre-lattice structure that combines the desirable features of th...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on signal processing 1997-12, Vol.45 (12), p.3006-3016 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3016 |
---|---|
container_issue | 12 |
container_start_page | 3006 |
container_title | IEEE transactions on signal processing |
container_volume | 45 |
creator | Fejzo, Z. Lev-Ari, H. |
description | Adaptive Laguerre-based filters provide an attractive alternative to adaptive FIR filters in the sense that they require fewer parameters to model a linear time-invariant system with a long impulse response. We present an adaptive Laguerre-lattice structure that combines the desirable features of the Laguerre structure (i.e., guaranteed stability, unique global minimum, and small number of parameters M for a prescribed level of modeling error) with the numerical robustness and low computational complexity of adaptive FIR lattice structures. The proposed configuration is based on an extension to the IIR case of the FIR lattice filter; it is a cascade of identical sections but with a single-pole all-pass filter replacing the delay element used in the conventional (FIR) lattice filter. We utilize this structure to obtain computationally efficient adaptive algorithms (O(M) computations per time instant). Our adaptive Laguerre-lattice filter is an extension of the gradient adaptive lattice (GAL) technique, and it demonstrates the same desirable properties, namely, (1) excellent steady-state behavior, (2) relatively fast initial convergence (comparable with that of an RLS algorithm for Laguerre structure), and good numerical stability. Simulation results indicate that for systems with poles close to the unit circle, where an (adaptive) FIR model of very high order would be required to meet a prescribed modeling error, an adaptive Laguerre-lattice model of relatively low order achieves the prescribed bound after just a few updates of the recursions in the adaptive algorithm. |
doi_str_mv | 10.1109/78.650260 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_78_650260</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>650260</ieee_id><sourcerecordid>28225875</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-8718d8b2365a3ba01bb5639f0b38130d9d7ab20ed497ff4c1f62f568d793e9053</originalsourceid><addsrcrecordid>eNo9kMtLAzEQh4MoWKsHr54qiOBh6-SxeRxL8QUFLwreQjY7kci2XZOt4H_fLbv0NAPzzcfMj5BrCnNKwTwqPZclMAknZEKNoAUIJU_7HkpelFp9nZOLnH8AqBBGTsjtonZtF_9wtnLfO0wJi8Z1XfQ4C7HpMOVLchZck_FqrFPy-fz0sXwtVu8vb8vFqvAcZFdoRXWtK8Zl6XjlgFZVKbkJUHFNOdSmVq5igLUwKgThaZAslFLXynA0_XVTcj9427T93WHu7Dpmj03jNrjdZcs0Y_0DB_BhAH3a5pww2DbFtUv_loI9hGCVtkMIPXs3Sl32rgnJbXzMxwUGyhgteuxmwCIiHqejYw-aRmGv</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28225875</pqid></control><display><type>article</type><title>Adaptive Laguerre-lattice filters</title><source>IEEE Electronic Library (IEL)</source><creator>Fejzo, Z. ; Lev-Ari, H.</creator><creatorcontrib>Fejzo, Z. ; Lev-Ari, H.</creatorcontrib><description>Adaptive Laguerre-based filters provide an attractive alternative to adaptive FIR filters in the sense that they require fewer parameters to model a linear time-invariant system with a long impulse response. We present an adaptive Laguerre-lattice structure that combines the desirable features of the Laguerre structure (i.e., guaranteed stability, unique global minimum, and small number of parameters M for a prescribed level of modeling error) with the numerical robustness and low computational complexity of adaptive FIR lattice structures. The proposed configuration is based on an extension to the IIR case of the FIR lattice filter; it is a cascade of identical sections but with a single-pole all-pass filter replacing the delay element used in the conventional (FIR) lattice filter. We utilize this structure to obtain computationally efficient adaptive algorithms (O(M) computations per time instant). Our adaptive Laguerre-lattice filter is an extension of the gradient adaptive lattice (GAL) technique, and it demonstrates the same desirable properties, namely, (1) excellent steady-state behavior, (2) relatively fast initial convergence (comparable with that of an RLS algorithm for Laguerre structure), and good numerical stability. Simulation results indicate that for systems with poles close to the unit circle, where an (adaptive) FIR model of very high order would be required to meet a prescribed modeling error, an adaptive Laguerre-lattice model of relatively low order achieves the prescribed bound after just a few updates of the recursions in the adaptive algorithm.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/78.650260</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Adaptive algorithm ; Adaptive filters ; Applied sciences ; Computational complexity ; Delay ; Detection, estimation, filtering, equalization, prediction ; Exact sciences and technology ; Finite impulse response filter ; IIR filters ; Information, signal and communications theory ; Lattices ; Nonlinear filters ; Robust stability ; Signal and communications theory ; Signal, noise ; Steady-state ; Telecommunications and information theory</subject><ispartof>IEEE transactions on signal processing, 1997-12, Vol.45 (12), p.3006-3016</ispartof><rights>1998 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-8718d8b2365a3ba01bb5639f0b38130d9d7ab20ed497ff4c1f62f568d793e9053</citedby><cites>FETCH-LOGICAL-c306t-8718d8b2365a3ba01bb5639f0b38130d9d7ab20ed497ff4c1f62f568d793e9053</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/650260$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/650260$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2079984$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Fejzo, Z.</creatorcontrib><creatorcontrib>Lev-Ari, H.</creatorcontrib><title>Adaptive Laguerre-lattice filters</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>Adaptive Laguerre-based filters provide an attractive alternative to adaptive FIR filters in the sense that they require fewer parameters to model a linear time-invariant system with a long impulse response. We present an adaptive Laguerre-lattice structure that combines the desirable features of the Laguerre structure (i.e., guaranteed stability, unique global minimum, and small number of parameters M for a prescribed level of modeling error) with the numerical robustness and low computational complexity of adaptive FIR lattice structures. The proposed configuration is based on an extension to the IIR case of the FIR lattice filter; it is a cascade of identical sections but with a single-pole all-pass filter replacing the delay element used in the conventional (FIR) lattice filter. We utilize this structure to obtain computationally efficient adaptive algorithms (O(M) computations per time instant). Our adaptive Laguerre-lattice filter is an extension of the gradient adaptive lattice (GAL) technique, and it demonstrates the same desirable properties, namely, (1) excellent steady-state behavior, (2) relatively fast initial convergence (comparable with that of an RLS algorithm for Laguerre structure), and good numerical stability. Simulation results indicate that for systems with poles close to the unit circle, where an (adaptive) FIR model of very high order would be required to meet a prescribed modeling error, an adaptive Laguerre-lattice model of relatively low order achieves the prescribed bound after just a few updates of the recursions in the adaptive algorithm.</description><subject>Adaptive algorithm</subject><subject>Adaptive filters</subject><subject>Applied sciences</subject><subject>Computational complexity</subject><subject>Delay</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Exact sciences and technology</subject><subject>Finite impulse response filter</subject><subject>IIR filters</subject><subject>Information, signal and communications theory</subject><subject>Lattices</subject><subject>Nonlinear filters</subject><subject>Robust stability</subject><subject>Signal and communications theory</subject><subject>Signal, noise</subject><subject>Steady-state</subject><subject>Telecommunications and information theory</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNo9kMtLAzEQh4MoWKsHr54qiOBh6-SxeRxL8QUFLwreQjY7kci2XZOt4H_fLbv0NAPzzcfMj5BrCnNKwTwqPZclMAknZEKNoAUIJU_7HkpelFp9nZOLnH8AqBBGTsjtonZtF_9wtnLfO0wJi8Z1XfQ4C7HpMOVLchZck_FqrFPy-fz0sXwtVu8vb8vFqvAcZFdoRXWtK8Zl6XjlgFZVKbkJUHFNOdSmVq5igLUwKgThaZAslFLXynA0_XVTcj9427T93WHu7Dpmj03jNrjdZcs0Y_0DB_BhAH3a5pww2DbFtUv_loI9hGCVtkMIPXs3Sl32rgnJbXzMxwUGyhgteuxmwCIiHqejYw-aRmGv</recordid><startdate>19971201</startdate><enddate>19971201</enddate><creator>Fejzo, Z.</creator><creator>Lev-Ari, H.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19971201</creationdate><title>Adaptive Laguerre-lattice filters</title><author>Fejzo, Z. ; Lev-Ari, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-8718d8b2365a3ba01bb5639f0b38130d9d7ab20ed497ff4c1f62f568d793e9053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Adaptive algorithm</topic><topic>Adaptive filters</topic><topic>Applied sciences</topic><topic>Computational complexity</topic><topic>Delay</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Exact sciences and technology</topic><topic>Finite impulse response filter</topic><topic>IIR filters</topic><topic>Information, signal and communications theory</topic><topic>Lattices</topic><topic>Nonlinear filters</topic><topic>Robust stability</topic><topic>Signal and communications theory</topic><topic>Signal, noise</topic><topic>Steady-state</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fejzo, Z.</creatorcontrib><creatorcontrib>Lev-Ari, H.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fejzo, Z.</au><au>Lev-Ari, H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Adaptive Laguerre-lattice filters</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>1997-12-01</date><risdate>1997</risdate><volume>45</volume><issue>12</issue><spage>3006</spage><epage>3016</epage><pages>3006-3016</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>Adaptive Laguerre-based filters provide an attractive alternative to adaptive FIR filters in the sense that they require fewer parameters to model a linear time-invariant system with a long impulse response. We present an adaptive Laguerre-lattice structure that combines the desirable features of the Laguerre structure (i.e., guaranteed stability, unique global minimum, and small number of parameters M for a prescribed level of modeling error) with the numerical robustness and low computational complexity of adaptive FIR lattice structures. The proposed configuration is based on an extension to the IIR case of the FIR lattice filter; it is a cascade of identical sections but with a single-pole all-pass filter replacing the delay element used in the conventional (FIR) lattice filter. We utilize this structure to obtain computationally efficient adaptive algorithms (O(M) computations per time instant). Our adaptive Laguerre-lattice filter is an extension of the gradient adaptive lattice (GAL) technique, and it demonstrates the same desirable properties, namely, (1) excellent steady-state behavior, (2) relatively fast initial convergence (comparable with that of an RLS algorithm for Laguerre structure), and good numerical stability. Simulation results indicate that for systems with poles close to the unit circle, where an (adaptive) FIR model of very high order would be required to meet a prescribed modeling error, an adaptive Laguerre-lattice model of relatively low order achieves the prescribed bound after just a few updates of the recursions in the adaptive algorithm.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/78.650260</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1053-587X |
ispartof | IEEE transactions on signal processing, 1997-12, Vol.45 (12), p.3006-3016 |
issn | 1053-587X 1941-0476 |
language | eng |
recordid | cdi_crossref_primary_10_1109_78_650260 |
source | IEEE Electronic Library (IEL) |
subjects | Adaptive algorithm Adaptive filters Applied sciences Computational complexity Delay Detection, estimation, filtering, equalization, prediction Exact sciences and technology Finite impulse response filter IIR filters Information, signal and communications theory Lattices Nonlinear filters Robust stability Signal and communications theory Signal, noise Steady-state Telecommunications and information theory |
title | Adaptive Laguerre-lattice filters |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T16%3A55%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Adaptive%20Laguerre-lattice%20filters&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Fejzo,%20Z.&rft.date=1997-12-01&rft.volume=45&rft.issue=12&rft.spage=3006&rft.epage=3016&rft.pages=3006-3016&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/78.650260&rft_dat=%3Cproquest_RIE%3E28225875%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28225875&rft_id=info:pmid/&rft_ieee_id=650260&rfr_iscdi=true |