Normalised constant modulus algorithm with selective partial updates
A reduced complexity realisation for the normalised constant modulus algorithm (NCMA) and its soft criterion satisfaction (SCS) version is proposed based on selective partial updating. The computational complexity of NCMA and SCS is reduced by updating a block of equaliser parameters at every iterat...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2184 vol.4 |
|---|---|
| container_issue | |
| container_start_page | 2181 |
| container_title | |
| container_volume | 4 |
| creator | Dogancay, K. Tanrikulu, O. |
| description | A reduced complexity realisation for the normalised constant modulus algorithm (NCMA) and its soft criterion satisfaction (SCS) version is proposed based on selective partial updating. The computational complexity of NCMA and SCS is reduced by updating a block of equaliser parameters at every iteration rather than the entire equaliser. This results in a smaller number of multiplications for updating the equaliser parameters. A simple block selection criterion is derived from the solution of a constrained minimisation problem that underpins the development of NCMA. In fractionally-spaced equalisation, the proposed selective partial updating is shown to be capable of maintaining comparable convergence speed to its full-update counterpart. This implies a significant reduction in implementation cost without necessarily penalising the convergence speed. |
| doi_str_mv | 10.1109/ICASSP.2001.940427 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_940427</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>940427</ieee_id><sourcerecordid>940427</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-2667ca1c54fd792d61b69734f706540d7282fd094bcdc1988abe5096f09cf2423</originalsourceid><addsrcrecordid>eNotj8lOwzAURS0GibTwA135BxKeHcfDEhUoSFWL1C7YVY4HMHKaKHZA_D2Vyuae3dG5CC0IVISAun9dPux2bxUFIJViwKi4QAWthSqJgvdLNAMhoRbACLtCBWkolJwwdYNmKX0BgBRMFuhx04-djiE5i01_TFkfM-56O8UpYR0_-jHkzw7_nBYnF53J4dvhQY856Iinwers0i269jomd_fPOdo_P-2XL-V6uzplrssgRS4p58JoYhrmrVDUctJyJWrmBfCGgRVUUm9BsdZYQ5SUunUNKO5BGU8ZredocdYG59xhGEOnx9_D-Xv9ByDUTNc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Normalised constant modulus algorithm with selective partial updates</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dogancay, K. ; Tanrikulu, O.</creator><creatorcontrib>Dogancay, K. ; Tanrikulu, O.</creatorcontrib><description>A reduced complexity realisation for the normalised constant modulus algorithm (NCMA) and its soft criterion satisfaction (SCS) version is proposed based on selective partial updating. The computational complexity of NCMA and SCS is reduced by updating a block of equaliser parameters at every iteration rather than the entire equaliser. This results in a smaller number of multiplications for updating the equaliser parameters. A simple block selection criterion is derived from the solution of a constrained minimisation problem that underpins the development of NCMA. In fractionally-spaced equalisation, the proposed selective partial updating is shown to be capable of maintaining comparable convergence speed to its full-update counterpart. This implies a significant reduction in implementation cost without necessarily penalising the convergence speed.</description><identifier>ISSN: 1520-6149</identifier><identifier>ISBN: 0780370414</identifier><identifier>ISBN: 9780780370418</identifier><identifier>EISSN: 2379-190X</identifier><identifier>DOI: 10.1109/ICASSP.2001.940427</identifier><language>eng</language><publisher>IEEE</publisher><subject>Adaptive equalizers ; Australia ; Blind equalizers ; Computational complexity ; Constraint optimization ; Convergence ; Costs ; Intersymbol interference ; Lakes ; USA Councils</subject><ispartof>2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2001, Vol.4, p.2181-2184 vol.4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/940427$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/940427$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dogancay, K.</creatorcontrib><creatorcontrib>Tanrikulu, O.</creatorcontrib><title>Normalised constant modulus algorithm with selective partial updates</title><title>2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)</title><addtitle>ICASSP</addtitle><description>A reduced complexity realisation for the normalised constant modulus algorithm (NCMA) and its soft criterion satisfaction (SCS) version is proposed based on selective partial updating. The computational complexity of NCMA and SCS is reduced by updating a block of equaliser parameters at every iteration rather than the entire equaliser. This results in a smaller number of multiplications for updating the equaliser parameters. A simple block selection criterion is derived from the solution of a constrained minimisation problem that underpins the development of NCMA. In fractionally-spaced equalisation, the proposed selective partial updating is shown to be capable of maintaining comparable convergence speed to its full-update counterpart. This implies a significant reduction in implementation cost without necessarily penalising the convergence speed.</description><subject>Adaptive equalizers</subject><subject>Australia</subject><subject>Blind equalizers</subject><subject>Computational complexity</subject><subject>Constraint optimization</subject><subject>Convergence</subject><subject>Costs</subject><subject>Intersymbol interference</subject><subject>Lakes</subject><subject>USA Councils</subject><issn>1520-6149</issn><issn>2379-190X</issn><isbn>0780370414</isbn><isbn>9780780370418</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8lOwzAURS0GibTwA135BxKeHcfDEhUoSFWL1C7YVY4HMHKaKHZA_D2Vyuae3dG5CC0IVISAun9dPux2bxUFIJViwKi4QAWthSqJgvdLNAMhoRbACLtCBWkolJwwdYNmKX0BgBRMFuhx04-djiE5i01_TFkfM-56O8UpYR0_-jHkzw7_nBYnF53J4dvhQY856Iinwers0i269jomd_fPOdo_P-2XL-V6uzplrssgRS4p58JoYhrmrVDUctJyJWrmBfCGgRVUUm9BsdZYQ5SUunUNKO5BGU8ZredocdYG59xhGEOnx9_D-Xv9ByDUTNc</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Dogancay, K.</creator><creator>Tanrikulu, O.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2001</creationdate><title>Normalised constant modulus algorithm with selective partial updates</title><author>Dogancay, K. ; Tanrikulu, O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-2667ca1c54fd792d61b69734f706540d7282fd094bcdc1988abe5096f09cf2423</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Adaptive equalizers</topic><topic>Australia</topic><topic>Blind equalizers</topic><topic>Computational complexity</topic><topic>Constraint optimization</topic><topic>Convergence</topic><topic>Costs</topic><topic>Intersymbol interference</topic><topic>Lakes</topic><topic>USA Councils</topic><toplevel>online_resources</toplevel><creatorcontrib>Dogancay, K.</creatorcontrib><creatorcontrib>Tanrikulu, O.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dogancay, K.</au><au>Tanrikulu, O.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Normalised constant modulus algorithm with selective partial updates</atitle><btitle>2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)</btitle><stitle>ICASSP</stitle><date>2001</date><risdate>2001</risdate><volume>4</volume><spage>2181</spage><epage>2184 vol.4</epage><pages>2181-2184 vol.4</pages><issn>1520-6149</issn><eissn>2379-190X</eissn><isbn>0780370414</isbn><isbn>9780780370418</isbn><abstract>A reduced complexity realisation for the normalised constant modulus algorithm (NCMA) and its soft criterion satisfaction (SCS) version is proposed based on selective partial updating. The computational complexity of NCMA and SCS is reduced by updating a block of equaliser parameters at every iteration rather than the entire equaliser. This results in a smaller number of multiplications for updating the equaliser parameters. A simple block selection criterion is derived from the solution of a constrained minimisation problem that underpins the development of NCMA. In fractionally-spaced equalisation, the proposed selective partial updating is shown to be capable of maintaining comparable convergence speed to its full-update counterpart. This implies a significant reduction in implementation cost without necessarily penalising the convergence speed.</abstract><pub>IEEE</pub><doi>10.1109/ICASSP.2001.940427</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1520-6149 |
| ispartof | 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2001, Vol.4, p.2181-2184 vol.4 |
| issn | 1520-6149 2379-190X |
| language | eng |
| recordid | cdi_ieee_primary_940427 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Adaptive equalizers Australia Blind equalizers Computational complexity Constraint optimization Convergence Costs Intersymbol interference Lakes USA Councils |
| title | Normalised constant modulus algorithm with selective partial updates |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T15%3A43%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Normalised%20constant%20modulus%20algorithm%20with%20selective%20partial%20updates&rft.btitle=2001%20IEEE%20International%20Conference%20on%20Acoustics,%20Speech,%20and%20Signal%20Processing.%20Proceedings%20(Cat.%20No.01CH37221)&rft.au=Dogancay,%20K.&rft.date=2001&rft.volume=4&rft.spage=2181&rft.epage=2184%20vol.4&rft.pages=2181-2184%20vol.4&rft.issn=1520-6149&rft.eissn=2379-190X&rft.isbn=0780370414&rft.isbn_list=9780780370418&rft_id=info:doi/10.1109/ICASSP.2001.940427&rft_dat=%3Cieee_6IE%3E940427%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=940427&rfr_iscdi=true |