Smart maximum-likelihood CDMA multiuser detection

Smart maximum-likelihood CDMA multiuser detection

A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fouladi, S., Tellambura, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Multiuser detection
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 525
container_issue
container_start_page 522
container_title
container_volume
creator Fouladi, S.
Tellambura, C.
description A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in low signal-to-noise ratio (SNR) and virtually no performance loss in medium-to-high SNR. The results show that the proposed algorithm is much less complex, and that it executes faster than existing maximum likelihood detectors. In addition, the proposed method is suitable for parallel implementation.
doi_str_mv 10.1109/PACRIM.2005.1517341
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1517341</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1517341</ieee_id><sourcerecordid>1517341</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-28fc09093c695ff31e9d8deb2f68205cf2c2668cbc423cd9fd383ec9de618ae33</originalsourceid><addsrcrecordid>eNotj8lqwzAURUUHqEn9Bdn4B-TqSX6ytDTuFEho6bAOjvRE1dp18QDt38fQXC6c3eVcxtYgcgBhb56r-mWzy6UQmANCqQo4Y4kELDhalOcstaURS5UFi_qCJYCIHEtrrlg6jp9iSYGqBJUweO2aYcq65jd2c8fb-EVt_Oh7n9W3uyrr5naK80hD5mkiN8X--5pdhqYdKT1xxd7v797qR759etjU1ZZHKHHi0gQnrLDKaYshKCDrjaeDDNpIgS5IJ7U27uAKqZy3wSujyFlPGkxDSq3Y-n83EtH-Z4iL6N_-dFgdAUScR64</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Smart maximum-likelihood CDMA multiuser detection</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fouladi, S. ; Tellambura, C.</creator><creatorcontrib>Fouladi, S. ; Tellambura, C.</creatorcontrib><description>A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in low signal-to-noise ratio (SNR) and virtually no performance loss in medium-to-high SNR. The results show that the proposed algorithm is much less complex, and that it executes faster than existing maximum likelihood detectors. In addition, the proposed method is suitable for parallel implementation.</description><identifier>ISSN: 1555-5798</identifier><identifier>ISBN: 9780780391956</identifier><identifier>ISBN: 0780391950</identifier><identifier>EISSN: 2154-5952</identifier><identifier>DOI: 10.1109/PACRIM.2005.1517341</identifier><language>eng</language><publisher>IEEE</publisher><subject>Multiuser detection</subject><ispartof>PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005, 2005, p.522-525</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/1517341$$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/1517341$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fouladi, S.</creatorcontrib><creatorcontrib>Tellambura, C.</creatorcontrib><title>Smart maximum-likelihood CDMA multiuser detection</title><title>PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005</title><addtitle>PACRIM</addtitle><description>A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in low signal-to-noise ratio (SNR) and virtually no performance loss in medium-to-high SNR. The results show that the proposed algorithm is much less complex, and that it executes faster than existing maximum likelihood detectors. In addition, the proposed method is suitable for parallel implementation.</description><subject>Multiuser detection</subject><issn>1555-5798</issn><issn>2154-5952</issn><isbn>9780780391956</isbn><isbn>0780391950</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8lqwzAURUUHqEn9Bdn4B-TqSX6ytDTuFEho6bAOjvRE1dp18QDt38fQXC6c3eVcxtYgcgBhb56r-mWzy6UQmANCqQo4Y4kELDhalOcstaURS5UFi_qCJYCIHEtrrlg6jp9iSYGqBJUweO2aYcq65jd2c8fb-EVt_Oh7n9W3uyrr5naK80hD5mkiN8X--5pdhqYdKT1xxd7v797qR759etjU1ZZHKHHi0gQnrLDKaYshKCDrjaeDDNpIgS5IJ7U27uAKqZy3wSujyFlPGkxDSq3Y-n83EtH-Z4iL6N_-dFgdAUScR64</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Fouladi, S.</creator><creator>Tellambura, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Smart maximum-likelihood CDMA multiuser detection</title><author>Fouladi, S. ; Tellambura, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-28fc09093c695ff31e9d8deb2f68205cf2c2668cbc423cd9fd383ec9de618ae33</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Multiuser detection</topic><toplevel>online_resources</toplevel><creatorcontrib>Fouladi, S.</creatorcontrib><creatorcontrib>Tellambura, C.</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 Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fouladi, S.</au><au>Tellambura, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Smart maximum-likelihood CDMA multiuser detection</atitle><btitle>PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005</btitle><stitle>PACRIM</stitle><date>2005</date><risdate>2005</risdate><spage>522</spage><epage>525</epage><pages>522-525</pages><issn>1555-5798</issn><eissn>2154-5952</eissn><isbn>9780780391956</isbn><isbn>0780391950</isbn><abstract>A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in low signal-to-noise ratio (SNR) and virtually no performance loss in medium-to-high SNR. The results show that the proposed algorithm is much less complex, and that it executes faster than existing maximum likelihood detectors. In addition, the proposed method is suitable for parallel implementation.</abstract><pub>IEEE</pub><doi>10.1109/PACRIM.2005.1517341</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1555-5798
ispartof PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005, 2005, p.522-525
issn 1555-5798
2154-5952
language eng
recordid cdi_ieee_primary_1517341
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Multiuser detection
title Smart maximum-likelihood CDMA multiuser detection
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T06%3A19%3A38IST&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=Smart%20maximum-likelihood%20CDMA%20multiuser%20detection&rft.btitle=PACRIM.%202005%20IEEE%20Pacific%20Rim%20Conference%20on%20Communications,%20Computers%20and%20signal%20Processing,%202005&rft.au=Fouladi,%20S.&rft.date=2005&rft.spage=522&rft.epage=525&rft.pages=522-525&rft.issn=1555-5798&rft.eissn=2154-5952&rft.isbn=9780780391956&rft.isbn_list=0780391950&rft_id=info:doi/10.1109/PACRIM.2005.1517341&rft_dat=%3Cieee_6IE%3E1517341%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=1517341&rfr_iscdi=true