Reduced Complexity Algorithm for Spreading Sequence Design
This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergenc...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2008-12, Vol.55 (12), p.1309-1313 |
|---|---|
| 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 | 1313 |
|---|---|
| container_issue | 12 |
| container_start_page | 1309 |
| container_title | IEEE transactions on circuits and systems. II, Express briefs |
| container_volume | 55 |
| creator | Lacatus, C. Akopian, D. Shadaram, M. |
| description | This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergence of the parallel distributed optimization which is confirmed by simulations. Parallel optimization ensures faster convergence and thus reduces computational load. The performance of the parallel algorithm is improved as the number of active users increases. |
| doi_str_mv | 10.1109/TCSII.2008.2008056 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_912306263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4698879</ieee_id><sourcerecordid>2545319561</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-ceee2c5631c316aadbd731123c1866d0ae24f92b5f64a86cc4c7f133ef5fb32a3</originalsourceid><addsrcrecordid>eNp9kElPwzAQhS0EEqXwB-AScYBTipfECzcUtkqVkGg5W64zLqmyFDuR6L8naSsOHLjMzOF7o_ceQpcETwjB6m6RzafTCcVY7gZO-REakTSVMROKHA93omIhEnGKzkJYY0wVZnSE7t8h7yzkUdZUmxK-i3YbPZSrxhftZxW5xkfzjQeTF_UqmsNXB7WF6BFCsarP0YkzZYCLwx6jj-enRfYaz95eptnDLLYsFW1sAYDalDNiGeHG5MtcMEIos0RynmMDNHGKLlPHEyO5tYkVjjAGLnVLRg0bo9v9341vegOh1VURLJSlqaHpgpYS80RSQnry5l-SJVwwKVgPXv8B103n6z6FVr0zzCkfILqHrG9C8OD0xheV8VtNsB5a17vW9VC4PrTei672oqKP_StIuJJSKPYD4m19Pw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>912306263</pqid></control><display><type>article</type><title>Reduced Complexity Algorithm for Spreading Sequence Design</title><source>IEEE Electronic Library (IEL)</source><creator>Lacatus, C. ; Akopian, D. ; Shadaram, M.</creator><creatorcontrib>Lacatus, C. ; Akopian, D. ; Shadaram, M.</creatorcontrib><description>This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergence of the parallel distributed optimization which is confirmed by simulations. Parallel optimization ensures faster convergence and thus reduces computational load. The performance of the parallel algorithm is improved as the number of active users increases.</description><identifier>ISSN: 1549-7747</identifier><identifier>EISSN: 1558-3791</identifier><identifier>DOI: 10.1109/TCSII.2008.2008056</identifier><identifier>CODEN: ICSPE5</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Adaptation ; Additive white noise ; Algorithm design and analysis ; Algorithms ; CDMA ; Circuits ; Computational modeling ; Computer simulation ; constrained optimization ; Constraint optimization ; Convergence ; Cost function ; Covariance matrix ; Design engineering ; distributed algorithm ; Distributed algorithms ; Interference ; Optimization ; Signal processing algorithms ; Spreading ; spreading sequence</subject><ispartof>IEEE transactions on circuits and systems. II, Express briefs, 2008-12, Vol.55 (12), p.1309-1313</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-ceee2c5631c316aadbd731123c1866d0ae24f92b5f64a86cc4c7f133ef5fb32a3</citedby><cites>FETCH-LOGICAL-c357t-ceee2c5631c316aadbd731123c1866d0ae24f92b5f64a86cc4c7f133ef5fb32a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4698879$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4698879$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lacatus, C.</creatorcontrib><creatorcontrib>Akopian, D.</creatorcontrib><creatorcontrib>Shadaram, M.</creatorcontrib><title>Reduced Complexity Algorithm for Spreading Sequence Design</title><title>IEEE transactions on circuits and systems. II, Express briefs</title><addtitle>TCSII</addtitle><description>This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergence of the parallel distributed optimization which is confirmed by simulations. Parallel optimization ensures faster convergence and thus reduces computational load. The performance of the parallel algorithm is improved as the number of active users increases.</description><subject>Adaptation</subject><subject>Additive white noise</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>CDMA</subject><subject>Circuits</subject><subject>Computational modeling</subject><subject>Computer simulation</subject><subject>constrained optimization</subject><subject>Constraint optimization</subject><subject>Convergence</subject><subject>Cost function</subject><subject>Covariance matrix</subject><subject>Design engineering</subject><subject>distributed algorithm</subject><subject>Distributed algorithms</subject><subject>Interference</subject><subject>Optimization</subject><subject>Signal processing algorithms</subject><subject>Spreading</subject><subject>spreading sequence</subject><issn>1549-7747</issn><issn>1558-3791</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kElPwzAQhS0EEqXwB-AScYBTipfECzcUtkqVkGg5W64zLqmyFDuR6L8naSsOHLjMzOF7o_ceQpcETwjB6m6RzafTCcVY7gZO-REakTSVMROKHA93omIhEnGKzkJYY0wVZnSE7t8h7yzkUdZUmxK-i3YbPZSrxhftZxW5xkfzjQeTF_UqmsNXB7WF6BFCsarP0YkzZYCLwx6jj-enRfYaz95eptnDLLYsFW1sAYDalDNiGeHG5MtcMEIos0RynmMDNHGKLlPHEyO5tYkVjjAGLnVLRg0bo9v9341vegOh1VURLJSlqaHpgpYS80RSQnry5l-SJVwwKVgPXv8B103n6z6FVr0zzCkfILqHrG9C8OD0xheV8VtNsB5a17vW9VC4PrTei672oqKP_StIuJJSKPYD4m19Pw</recordid><startdate>20081201</startdate><enddate>20081201</enddate><creator>Lacatus, C.</creator><creator>Akopian, D.</creator><creator>Shadaram, M.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20081201</creationdate><title>Reduced Complexity Algorithm for Spreading Sequence Design</title><author>Lacatus, C. ; Akopian, D. ; Shadaram, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-ceee2c5631c316aadbd731123c1866d0ae24f92b5f64a86cc4c7f133ef5fb32a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Adaptation</topic><topic>Additive white noise</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>CDMA</topic><topic>Circuits</topic><topic>Computational modeling</topic><topic>Computer simulation</topic><topic>constrained optimization</topic><topic>Constraint optimization</topic><topic>Convergence</topic><topic>Cost function</topic><topic>Covariance matrix</topic><topic>Design engineering</topic><topic>distributed algorithm</topic><topic>Distributed algorithms</topic><topic>Interference</topic><topic>Optimization</topic><topic>Signal processing algorithms</topic><topic>Spreading</topic><topic>spreading sequence</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lacatus, C.</creatorcontrib><creatorcontrib>Akopian, D.</creatorcontrib><creatorcontrib>Shadaram, M.</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>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lacatus, C.</au><au>Akopian, D.</au><au>Shadaram, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reduced Complexity Algorithm for Spreading Sequence Design</atitle><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle><stitle>TCSII</stitle><date>2008-12-01</date><risdate>2008</risdate><volume>55</volume><issue>12</issue><spage>1309</spage><epage>1313</epage><pages>1309-1313</pages><issn>1549-7747</issn><eissn>1558-3791</eissn><coden>ICSPE5</coden><abstract>This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergence of the parallel distributed optimization which is confirmed by simulations. Parallel optimization ensures faster convergence and thus reduces computational load. The performance of the parallel algorithm is improved as the number of active users increases.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCSII.2008.2008056</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1549-7747 |
| ispartof | IEEE transactions on circuits and systems. II, Express briefs, 2008-12, Vol.55 (12), p.1309-1313 |
| issn | 1549-7747 1558-3791 |
| language | eng |
| recordid | cdi_proquest_journals_912306263 |
| source | IEEE Electronic Library (IEL) |
| subjects | Adaptation Additive white noise Algorithm design and analysis Algorithms CDMA Circuits Computational modeling Computer simulation constrained optimization Constraint optimization Convergence Cost function Covariance matrix Design engineering distributed algorithm Distributed algorithms Interference Optimization Signal processing algorithms Spreading spreading sequence |
| title | Reduced Complexity Algorithm for Spreading Sequence Design |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T16%3A18%3A01IST&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=Reduced%20Complexity%20Algorithm%20for%20Spreading%20Sequence%20Design&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems.%20II,%20Express%20briefs&rft.au=Lacatus,%20C.&rft.date=2008-12-01&rft.volume=55&rft.issue=12&rft.spage=1309&rft.epage=1313&rft.pages=1309-1313&rft.issn=1549-7747&rft.eissn=1558-3791&rft.coden=ICSPE5&rft_id=info:doi/10.1109/TCSII.2008.2008056&rft_dat=%3Cproquest_RIE%3E2545319561%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=912306263&rft_id=info:pmid/&rft_ieee_id=4698879&rfr_iscdi=true |