Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms
In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. Th...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing 2012-08, Vol.60 (8), p.3988-4002 |
|---|---|
| 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 | 4002 |
|---|---|
| container_issue | 8 |
| container_start_page | 3988 |
| container_title | IEEE transactions on signal processing |
| container_volume | 60 |
| creator | Yunlong Cai de Lamare, Rodrigo C. Minjian Zhao Jie Zhong |
| description | In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. The proposed variable forgetting factor mechanism employs an updated component related to the time average of the constant modulus (CM) cost function to automatically adjust the forgetting factor in order to ensure good tracking of the interference and the channel. Convergence and tracking analyses are carried out. Analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results are presented for nonstationary environments and show that the proposed variable forgetting factor mechanism achieves superior performance to previously reported methods at a reduced complexity. |
| doi_str_mv | 10.1109/TSP.2012.2199317 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TSP_2012_2199317</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6200354</ieee_id><sourcerecordid>2714511041</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-7202842214542bc4af7f71ede6317057b02de9181d88a0d4ab7e7dc99b206a583</originalsourceid><addsrcrecordid>eNpdkd9rFDEQxxdRsFbfBV8CIviy1ySbn4_n4alwpQWr-LZkN7PXlGxyJtlq_3tT7uiDT_Md5jPDzHyb5i3BK0Kwvrj5fr2imNAVJVp3RD5rzohmpMVMiudVY961XMlfL5tXOd9hTBjT4qwJu_in3cT54OGvKw_op0nODB7QNqY9lOLCHm3NWGJClzDemuDyjKaaffIuWLS25lDcPaBNDLkk4wLYozahoMtoF79ktPb7mFy5nfPr5sVkfIY3p3je_Nh-vtl8bXdXX75t1rt27DgrraSYKkYpYZzRYWRmkpMkYEHUyzCXA6YWNFHEKmWwZWaQIO2o9UCxMFx1583H49xDir8XyKWfXR7BexMgLrknHeFCaCV4Rd__h97FJYW6XU8wFYoTSnWl8JEaU8w5wdQfkptNeqhQ_2hAXw3oHw3oTwbUlg-nwSaPxk_JhNHlpz4qiOKSi8q9O3IOAJ7KgmJcf9H9A2edjn4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1026851229</pqid></control><display><type>article</type><title>Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms</title><source>IEEE Electronic Library (IEL)</source><creator>Yunlong Cai ; de Lamare, Rodrigo C. ; Minjian Zhao ; Jie Zhong</creator><creatorcontrib>Yunlong Cai ; de Lamare, Rodrigo C. ; Minjian Zhao ; Jie Zhong</creatorcontrib><description>In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. The proposed variable forgetting factor mechanism employs an updated component related to the time average of the constant modulus (CM) cost function to automatically adjust the forgetting factor in order to ensure good tracking of the interference and the channel. Convergence and tracking analyses are carried out. Analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results are presented for nonstationary environments and show that the proposed variable forgetting factor mechanism achieves superior performance to previously reported methods at a reduced complexity.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2012.2199317</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Adaptive algorithms ; Adaptive filtering ; Adaptive systems ; Algorithm design and analysis ; Algorithms ; Applied sciences ; blind multiuser detection ; Blinds ; Channels ; Constraints ; Convergence ; Cost function ; Detection, estimation, filtering, equalization, prediction ; Exact sciences and technology ; Information, signal and communications theory ; Interference ; Multiaccess communication ; Optimization ; Receivers ; Signal and communications theory ; Signal, noise ; Telecommunications and information theory ; Tracking ; variable forgetting factor mechanisms ; Vectors</subject><ispartof>IEEE transactions on signal processing, 2012-08, Vol.60 (8), p.3988-4002</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c354t-7202842214542bc4af7f71ede6317057b02de9181d88a0d4ab7e7dc99b206a583</citedby><cites>FETCH-LOGICAL-c354t-7202842214542bc4af7f71ede6317057b02de9181d88a0d4ab7e7dc99b206a583</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6200354$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6200354$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=26185756$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yunlong Cai</creatorcontrib><creatorcontrib>de Lamare, Rodrigo C.</creatorcontrib><creatorcontrib>Minjian Zhao</creatorcontrib><creatorcontrib>Jie Zhong</creatorcontrib><title>Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. The proposed variable forgetting factor mechanism employs an updated component related to the time average of the constant modulus (CM) cost function to automatically adjust the forgetting factor in order to ensure good tracking of the interference and the channel. Convergence and tracking analyses are carried out. Analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results are presented for nonstationary environments and show that the proposed variable forgetting factor mechanism achieves superior performance to previously reported methods at a reduced complexity.</description><subject>Adaptive algorithms</subject><subject>Adaptive filtering</subject><subject>Adaptive systems</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>blind multiuser detection</subject><subject>Blinds</subject><subject>Channels</subject><subject>Constraints</subject><subject>Convergence</subject><subject>Cost function</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Interference</subject><subject>Multiaccess communication</subject><subject>Optimization</subject><subject>Receivers</subject><subject>Signal and communications theory</subject><subject>Signal, noise</subject><subject>Telecommunications and information theory</subject><subject>Tracking</subject><subject>variable forgetting factor mechanisms</subject><subject>Vectors</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkd9rFDEQxxdRsFbfBV8CIviy1ySbn4_n4alwpQWr-LZkN7PXlGxyJtlq_3tT7uiDT_Md5jPDzHyb5i3BK0Kwvrj5fr2imNAVJVp3RD5rzohmpMVMiudVY961XMlfL5tXOd9hTBjT4qwJu_in3cT54OGvKw_op0nODB7QNqY9lOLCHm3NWGJClzDemuDyjKaaffIuWLS25lDcPaBNDLkk4wLYozahoMtoF79ktPb7mFy5nfPr5sVkfIY3p3je_Nh-vtl8bXdXX75t1rt27DgrraSYKkYpYZzRYWRmkpMkYEHUyzCXA6YWNFHEKmWwZWaQIO2o9UCxMFx1583H49xDir8XyKWfXR7BexMgLrknHeFCaCV4Rd__h97FJYW6XU8wFYoTSnWl8JEaU8w5wdQfkptNeqhQ_2hAXw3oHw3oTwbUlg-nwSaPxk_JhNHlpz4qiOKSi8q9O3IOAJ7KgmJcf9H9A2edjn4</recordid><startdate>20120801</startdate><enddate>20120801</enddate><creator>Yunlong Cai</creator><creator>de Lamare, Rodrigo C.</creator><creator>Minjian Zhao</creator><creator>Jie Zhong</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20120801</creationdate><title>Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms</title><author>Yunlong Cai ; de Lamare, Rodrigo C. ; Minjian Zhao ; Jie Zhong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-7202842214542bc4af7f71ede6317057b02de9181d88a0d4ab7e7dc99b206a583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Adaptive algorithms</topic><topic>Adaptive filtering</topic><topic>Adaptive systems</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>blind multiuser detection</topic><topic>Blinds</topic><topic>Channels</topic><topic>Constraints</topic><topic>Convergence</topic><topic>Cost function</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Interference</topic><topic>Multiaccess communication</topic><topic>Optimization</topic><topic>Receivers</topic><topic>Signal and communications theory</topic><topic>Signal, noise</topic><topic>Telecommunications and information theory</topic><topic>Tracking</topic><topic>variable forgetting factor mechanisms</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yunlong Cai</creatorcontrib><creatorcontrib>de Lamare, Rodrigo C.</creatorcontrib><creatorcontrib>Minjian Zhao</creatorcontrib><creatorcontrib>Jie Zhong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yunlong Cai</au><au>de Lamare, Rodrigo C.</au><au>Minjian Zhao</au><au>Jie Zhong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2012-08-01</date><risdate>2012</risdate><volume>60</volume><issue>8</issue><spage>3988</spage><epage>4002</epage><pages>3988-4002</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. The proposed variable forgetting factor mechanism employs an updated component related to the time average of the constant modulus (CM) cost function to automatically adjust the forgetting factor in order to ensure good tracking of the interference and the channel. Convergence and tracking analyses are carried out. Analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results are presented for nonstationary environments and show that the proposed variable forgetting factor mechanism achieves superior performance to previously reported methods at a reduced complexity.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSP.2012.2199317</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1053-587X |
| ispartof | IEEE transactions on signal processing, 2012-08, Vol.60 (8), p.3988-4002 |
| issn | 1053-587X 1941-0476 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TSP_2012_2199317 |
| source | IEEE Electronic Library (IEL) |
| subjects | Adaptive algorithms Adaptive filtering Adaptive systems Algorithm design and analysis Algorithms Applied sciences blind multiuser detection Blinds Channels Constraints Convergence Cost function Detection, estimation, filtering, equalization, prediction Exact sciences and technology Information, signal and communications theory Interference Multiaccess communication Optimization Receivers Signal and communications theory Signal, noise Telecommunications and information theory Tracking variable forgetting factor mechanisms Vectors |
| title | Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T17%3A21%3A46IST&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=Low-Complexity%20Variable%20Forgetting%20Factor%20Mechanism%20for%20Blind%20Adaptive%20Constrained%20Constant%20Modulus%20Algorithms&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Yunlong%20Cai&rft.date=2012-08-01&rft.volume=60&rft.issue=8&rft.spage=3988&rft.epage=4002&rft.pages=3988-4002&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2012.2199317&rft_dat=%3Cproquest_RIE%3E2714511041%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=1026851229&rft_id=info:pmid/&rft_ieee_id=6200354&rfr_iscdi=true |