The application of semidefinite programming for detection in CDMA
A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These inter...
Gespeichert in:
| Veröffentlicht in: | IEEE journal on selected areas in communications 2001-08, Vol.19 (8), p.1442-1449 |
|---|---|
| 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 | 1449 |
|---|---|
| container_issue | 8 |
| container_start_page | 1442 |
| container_title | IEEE journal on selected areas in communications |
| container_volume | 19 |
| creator | Peng Hui Tan Rasmussen, L.K. |
| description | A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance. |
| doi_str_mv | 10.1109/49.942507 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_884695998</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>942507</ieee_id><sourcerecordid>914662881</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-8d3cf15fb823f1fcaaa791d54906c4f28b29815b8d3b52d248956e616d69f5563</originalsourceid><addsrcrecordid>eNp90T1PwzAQBmALgUQpDKxMEQMIiRTbsR17jFq-pCKWwmo5id26NHGwEyH-PaGpOjAw3XCPTvfqBeAcwQlCUNwRMREEU5gegBGilMcQQn4IRjBNkpiniB2DkxDWECJCOB6BbLHSkWqajS1Ua10dORMFXdlSG1vbVkeNd0uvqsrWy8g4H5W61cVW2jqazl6yU3Bk1Cbos90cg7eH-8X0KZ6_Pj5Ps3lcEMjbmJdJYRA1OceJQaZQSqUClZQIyApiMM-x4IjmvcspLjHhgjLNECuZMJSyZAxuh7vhSzddLhtvK-W_pVNWzux7Jp1fyo92JRlmW3498D7AZ6dDKysbCr3ZqFq7LkiBCGOYc9TLq38l5iwRqRA9vPwD167zdR9ack6YoELwHt0MqPAuBK_N_lEE5W9Fkgg5VNTbi8FarfXe7ZY_EfWJwQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884695998</pqid></control><display><type>article</type><title>The application of semidefinite programming for detection in CDMA</title><source>IEEE Electronic Library (IEL)</source><creator>Peng Hui Tan ; Rasmussen, L.K.</creator><creatorcontrib>Peng Hui Tan ; Rasmussen, L.K.</creatorcontrib><description>A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance.</description><identifier>ISSN: 0733-8716</identifier><identifier>ISSN: 1558-0008</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/49.942507</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Approximation ; AWGN ; Code division multiple access ; Computational complexity ; Computational modeling ; Computer simulation ; Cutting ; Detectors ; Iterative algorithms ; Mathematical analysis ; Maximum likelihood detection ; Modulation coding ; Multiaccess communication ; Multiple access interference ; Planes ; Polynomials ; Programming ; Strategy</subject><ispartof>IEEE journal on selected areas in communications, 2001-08, Vol.19 (8), p.1442-1449</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-8d3cf15fb823f1fcaaa791d54906c4f28b29815b8d3b52d248956e616d69f5563</citedby><cites>FETCH-LOGICAL-c408t-8d3cf15fb823f1fcaaa791d54906c4f28b29815b8d3b52d248956e616d69f5563</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/942507$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,776,780,792,881,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/942507$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-62656$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Peng Hui Tan</creatorcontrib><creatorcontrib>Rasmussen, L.K.</creatorcontrib><title>The application of semidefinite programming for detection in CDMA</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance.</description><subject>Approximation</subject><subject>AWGN</subject><subject>Code division multiple access</subject><subject>Computational complexity</subject><subject>Computational modeling</subject><subject>Computer simulation</subject><subject>Cutting</subject><subject>Detectors</subject><subject>Iterative algorithms</subject><subject>Mathematical analysis</subject><subject>Maximum likelihood detection</subject><subject>Modulation coding</subject><subject>Multiaccess communication</subject><subject>Multiple access interference</subject><subject>Planes</subject><subject>Polynomials</subject><subject>Programming</subject><subject>Strategy</subject><issn>0733-8716</issn><issn>1558-0008</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90T1PwzAQBmALgUQpDKxMEQMIiRTbsR17jFq-pCKWwmo5id26NHGwEyH-PaGpOjAw3XCPTvfqBeAcwQlCUNwRMREEU5gegBGilMcQQn4IRjBNkpiniB2DkxDWECJCOB6BbLHSkWqajS1Ua10dORMFXdlSG1vbVkeNd0uvqsrWy8g4H5W61cVW2jqazl6yU3Bk1Cbos90cg7eH-8X0KZ6_Pj5Ps3lcEMjbmJdJYRA1OceJQaZQSqUClZQIyApiMM-x4IjmvcspLjHhgjLNECuZMJSyZAxuh7vhSzddLhtvK-W_pVNWzux7Jp1fyo92JRlmW3498D7AZ6dDKysbCr3ZqFq7LkiBCGOYc9TLq38l5iwRqRA9vPwD167zdR9ack6YoELwHt0MqPAuBK_N_lEE5W9Fkgg5VNTbi8FarfXe7ZY_EfWJwQ</recordid><startdate>20010801</startdate><enddate>20010801</enddate><creator>Peng Hui Tan</creator><creator>Rasmussen, L.K.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><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><scope>ADTPV</scope><scope>AOWAS</scope><scope>D8V</scope></search><sort><creationdate>20010801</creationdate><title>The application of semidefinite programming for detection in CDMA</title><author>Peng Hui Tan ; Rasmussen, L.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-8d3cf15fb823f1fcaaa791d54906c4f28b29815b8d3b52d248956e616d69f5563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Approximation</topic><topic>AWGN</topic><topic>Code division multiple access</topic><topic>Computational complexity</topic><topic>Computational modeling</topic><topic>Computer simulation</topic><topic>Cutting</topic><topic>Detectors</topic><topic>Iterative algorithms</topic><topic>Mathematical analysis</topic><topic>Maximum likelihood detection</topic><topic>Modulation coding</topic><topic>Multiaccess communication</topic><topic>Multiple access interference</topic><topic>Planes</topic><topic>Polynomials</topic><topic>Programming</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peng Hui Tan</creatorcontrib><creatorcontrib>Rasmussen, L.K.</creatorcontrib><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><collection>SwePub</collection><collection>SwePub Articles</collection><collection>SWEPUB Kungliga Tekniska Högskolan</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Peng Hui Tan</au><au>Rasmussen, L.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The application of semidefinite programming for detection in CDMA</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2001-08-01</date><risdate>2001</risdate><volume>19</volume><issue>8</issue><spage>1442</spage><epage>1449</epage><pages>1442-1449</pages><issn>0733-8716</issn><issn>1558-0008</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/49.942507</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0733-8716 |
| ispartof | IEEE journal on selected areas in communications, 2001-08, Vol.19 (8), p.1442-1449 |
| issn | 0733-8716 1558-0008 1558-0008 |
| language | eng |
| recordid | cdi_proquest_journals_884695998 |
| source | IEEE Electronic Library (IEL) |
| subjects | Approximation AWGN Code division multiple access Computational complexity Computational modeling Computer simulation Cutting Detectors Iterative algorithms Mathematical analysis Maximum likelihood detection Modulation coding Multiaccess communication Multiple access interference Planes Polynomials Programming Strategy |
| title | The application of semidefinite programming for detection in CDMA |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T04%3A00%3A11IST&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=The%20application%20of%20semidefinite%20programming%20for%20detection%20in%20CDMA&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Peng%20Hui%20Tan&rft.date=2001-08-01&rft.volume=19&rft.issue=8&rft.spage=1442&rft.epage=1449&rft.pages=1442-1449&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/49.942507&rft_dat=%3Cproquest_RIE%3E914662881%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=884695998&rft_id=info:pmid/&rft_ieee_id=942507&rfr_iscdi=true |