A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection Using Gold Sequences
The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is NP-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which make...
Uloženo v:
| Vydáno v: | IEEE transactions on signal processing Ročník 56; číslo 9; s. 4377 - 4385 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.09.2008
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1053-587X, 1941-0476, 1941-0476 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is NP-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which makes it possible to detect some or all users optimally for a low computational cost if signature sequences with low cross correlation, e.g., Gold sequences, are used. The algorithm can be interpreted as, e.g., an adaptive tradeoff between parallel interference cancellation and successive interference cancellation. Simulations show that the preprocessing algorithm is able to optimally compute more than 94,% of the bits in the problem when the users are time-synchronous, even though the system is heavily loaded and affected by noise. Any remaining bits, not computed by the preprocessing algorithm, can either be computed by a suboptimal detector or an optimal detector. Simulations of the time-synchronous case show that if a suboptimal detector is chosen, the bit error rate (BER) rate is significantly reduced compared with using the suboptimal detector alone. |
|---|---|
| AbstractList | The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is {cal NP}-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which makes it possible to detect some or all users optimally for a low computational cost if signature sequences with low cross correlation, e.g., Gold sequences, are used. The algorithm can be interpreted as, e.g., an adaptive tradeoff between parallel interference cancellation and successive interference cancellation. Simulations show that the preprocessing algorithm is able to optimally compute more than 94,% of the bits in the problem when the users are time-synchronous, even though the system is heavily loaded and affected by noise. Any remaining bits, not computed by the preprocessing algorithm, can either be computed by a suboptimal detector or an optimal detector. Simulations of the time-synchronous case show that if a suboptimal detector is chosen, the bit error rate (BER) rate is significantly reduced compared with using the suboptimal detector alone. The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is NP-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which makes it possible to detect some or all users optimally for a low computational cost if signature sequences with low cross correlation, e.g., Gold sequences, are used. The algorithm can be interpreted as, e.g., an adaptive tradeoff between parallel interference cancellation and successive interference cancellation. Simulations show that the preprocessing algorithm is able to optimally compute more than 94,% of the bits in the problem when the users are time-synchronous, even though the system is heavily loaded and affected by noise. Any remaining bits, not computed by the preprocessing algorithm, can either be computed by a suboptimal detector or an optimal detector. Simulations of the time-synchronous case show that if a suboptimal detector is chosen, the bit error rate (BER) rate is significantly reduced compared with using the suboptimal detector alone. The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. |
| Author | Axehill, D. Gunnarsson, F. Hansson, A. |
| Author_xml | – sequence: 1 givenname: D. surname: Axehill fullname: Axehill, D. organization: Div. of Autom. Control, Linkoping Univ., Linkoping – sequence: 2 givenname: F. surname: Gunnarsson fullname: Gunnarsson, F. organization: Div. of Autom. Control, Linkoping Univ., Linkoping – sequence: 3 givenname: A. surname: Hansson fullname: Hansson, A. organization: Div. of Autom. Control, Linkoping Univ., Linkoping |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20584821$$DView record in Pascal Francis https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-12903$$DView record from Swedish Publication Index (Linköpings universitet) |
| BookMark | eNp9kc1v1DAQxSNUJNrCmQOXCAl6Idtx_BH7uNpCi7SIldoibpbXO9m6cuLFTlT639dLSg-V4DIzh997mpl3VBz0oceieEtgRgio06vL1awGkDNVC6LgRXFIFCMVsEYc5Bk4rbhsfr4qjlK6BSCMKXFYtPNyGe6qReh2Hn-74b68cNubaoWxDbEzvcVyFXEXg8WUXL8t534bohtuujID5bfRD25MGMszHNAOLvTl9R_uPPhNeYm_Rswe6XXxsjU-4ZvHflxcf_l8tbiolt_Pvy7my8oyIofK1IorZLARQhqhGBMCNrwxcr1h1NRrueZtmysQJWmLYJuaccyK1tIGDdDj4tPkm-5wN671LrrOxHsdjNNn7sdch7jV3o2a1Apoxk8mPB-YN02D7lyy6L3pMYxJS6moJEBkJj_-l6RMNg1lIoPvn4G3YYx9PlpLQWtOBN27fXiETLLGtzE_2qWnbWvgksmaZI5PnI0hpYittm4w-y8P0TivCeh99jpnr_fZ6yn7rDt9pvtr_W_Fu0nhEPGJZpwSKoA-ANEXu3Q |
| CODEN | ITPRED |
| CitedBy_id | crossref_primary_10_1371_journal_pone_0112215 crossref_primary_10_1016_j_sigpro_2013_02_011 crossref_primary_10_1109_TSP_2009_2032448 crossref_primary_10_1109_ACCESS_2020_2972064 |
| Cites_doi | 10.1007/978-3-642-85823-9 10.1023/A:1017912624016 10.1109/TCOMM.2004.826410 10.1017/CBO9780511804441 10.1109/26.823565 10.1109/MWC.2005.1421925 10.1109/18.868499 10.1109/4234.664214 10.1109/CDC.2004.1428790 10.1016/S0377-2217(00)00242-3 10.1109/VETEC.1998.686590 10.1109/18.705573 10.1109/TCOMM.2004.826349 10.1109/49.737640 10.1049/el:19961585 10.1109/ICASSP.2003.1201783 10.1016/S0377-2217(01)00209-0 10.1109/78.992139 |
| ContentType | Journal Article |
| Copyright | 2008 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| Copyright_xml | – notice: 2008 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 ADTPV AOWAS DG8 |
| DOI | 10.1109/TSP.2008.926190 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database SwePub SwePub Articles SWEPUB Linköpings universitet |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1941-0476 |
| EndPage | 4385 |
| ExternalDocumentID | oai_DiVA_org_liu_12903 2328826441 20584821 10_1109_TSP_2008_926190 4531360 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 ADTPV AOWAS DG8 |
| ID | FETCH-LOGICAL-c418t-a2959e40d668a6944660d57a8bd43a2b8b5ffb8b01983fe0c7245e9e4fc37ea03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258694600024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1053-587X 1941-0476 |
| IngestDate | Tue Nov 04 16:24:52 EST 2025 Sun Sep 28 09:52:48 EDT 2025 Wed Oct 01 13:24:01 EDT 2025 Mon Jun 30 10:17:34 EDT 2025 Mon Jul 21 09:15:12 EDT 2025 Sat Nov 29 04:10:11 EST 2025 Tue Nov 18 22:21:57 EST 2025 Tue Aug 26 16:47:35 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | Multiuser detection Multiple access High performance code division multiaccess Noise reduction Bit error rate optimization methods Optimal detection Quadratic programming Algorithm Computational complexity Optimization Interference suppression Simulation Gold sequences Cross correlation NP hard problem Parallel processing Signal processing multiaccess communication Maximum likelihood Binary quadratic programming Cost lowering Signal detection |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c418t-a2959e40d668a6944660d57a8bd43a2b8b5ffb8b01983fe0c7245e9e4fc37ea03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 863251638 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_4531360 crossref_primary_10_1109_TSP_2008_926190 pascalfrancis_primary_20584821 proquest_journals_863251638 proquest_miscellaneous_889381018 swepub_primary_oai_DiVA_org_liu_12903 proquest_miscellaneous_34877346 crossref_citationtrail_10_1109_TSP_2008_926190 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-09-01 |
| PublicationDateYYYYMMDD | 2008-09-01 |
| PublicationDate_xml | – month: 09 year: 2008 text: 2008-09-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on signal processing |
| PublicationTitleAbbrev | TSP |
| PublicationYear | 2008 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref14 ref10 ref2 ma (ref11) 2002; 50 ref17 li (ref9) 2002; 1 ref24 bemporad (ref25) 2000 ref20 verdu (ref16) 1998 ref21 garey (ref18) 1979 axehill (ref23) 2005 beasley (ref19) 1998 ref8 ref7 ref4 ref3 ref6 ref5 hammer (ref22) 1968 tan (ref1) 2001 |
| References_xml | – year: 1968 ident: ref22 publication-title: Boolean Methods in Operations Research and Related Areas doi: 10.1007/978-3-642-85823-9 – year: 1998 ident: ref19 publication-title: Heuristic algorithms for the unconstrained binary quadratic programming problem – ident: ref20 doi: 10.1023/A:1017912624016 – year: 1998 ident: ref16 publication-title: Multiuser Detection – year: 2000 ident: ref25 publication-title: A Matlab function for solving mixed integer quadratic programs Version 1 02 User Guide – volume: 1 start-page: 493 year: 2002 ident: ref9 article-title: a novel low-complexity near-ml multiuser detector for ds-cdma and mc-cdma systems publication-title: Proc IEEE Global Telecommunications Conf (IEEE GLOBECOM) – ident: ref6 doi: 10.1109/TCOMM.2004.826410 – ident: ref17 doi: 10.1017/CBO9780511804441 – ident: ref13 doi: 10.1109/26.823565 – ident: ref24 doi: 10.1109/MWC.2005.1421925 – ident: ref5 doi: 10.1109/18.868499 – ident: ref3 doi: 10.1109/4234.664214 – ident: ref15 doi: 10.1109/CDC.2004.1428790 – ident: ref2 doi: 10.1016/S0377-2217(00)00242-3 – ident: ref14 doi: 10.1109/VETEC.1998.686590 – ident: ref4 doi: 10.1109/18.705573 – ident: ref8 doi: 10.1109/TCOMM.2004.826349 – ident: ref10 doi: 10.1109/49.737640 – ident: ref7 doi: 10.1049/el:19961585 – ident: ref12 doi: 10.1109/ICASSP.2003.1201783 – year: 2001 ident: ref1 publication-title: Multiuser detection in CDMACombinatorial optimization methods – ident: ref21 doi: 10.1016/S0377-2217(01)00209-0 – year: 2005 ident: ref23 publication-title: Applications of integer quadratic programming in control and communication – volume: 50 start-page: 912 year: 2002 ident: ref11 article-title: quasi-maximum-likelihood multiuser detection using semi-definite relaxation publication-title: IEEE Trans Signal Process doi: 10.1109/78.992139 – year: 1979 ident: ref18 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness |
| SSID | ssj0014496 |
| Score | 1.9403725 |
| Snippet | The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved.... The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. |
| SourceID | swepub proquest pascalfrancis crossref ieee |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 4377 |
| SubjectTerms | Algorithms Applied sciences Automatic control Binary quadratic programming Binary quadratic programming problem Bit error rate Cancellation CDMA channel models code division multiaccess Code division multiple access Computational complexity Computational efficiency Computational modeling Computer simulation Detection, estimation, filtering, equalization, prediction Detectors Error statistics Exact sciences and technology Gold Gold sequences Information technology Information, signal and communications theory Informationsteknik Interference Interference cancellation Interference suppression Low cross correlation Low-complexity high-performance preprocessing algorithm Maximum likelihood detection Maximum likelihood problem Miscellaneous multiaccess communication Multiuser detection Noise cancellation NP-hard problem Optimal detector Optimization optimization methods Optimum multiuser detection problem Parallel interference cancellation Preprocessing Quadratic programming Reglerteknik Sequences Signal and communications theory Signal processing Signal, noise Studies Suboptimal detector Successive interference cancellation TECHNOLOGY TEKNIKVETENSKAP Telecommunications and information theory Time-synchronous users |
| Title | A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection Using Gold Sequences |
| URI | https://ieeexplore.ieee.org/document/4531360 https://www.proquest.com/docview/863251638 https://www.proquest.com/docview/34877346 https://www.proquest.com/docview/889381018 https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-12903 |
| Volume | 56 |
| WOSCitedRecordID | wos000258694600024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0476 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014496 issn: 1053-587X databaseCode: RIE dateStart: 19910101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VigMceBVEKC0-gMQBt07sxM5x1VI4VNVKLWhvkZOMy0pLgnazoP77jp1s6Er0wCWKFDuvGdvfeGa-AXjvy7lIFJrrUpOB4lLFS3SaC6uE0bmtsA48s-f64sLMZvl0Bz6NuTCIGILP8MifBl9-3VZrv1V2rEhhZEYG-gOtdZ-rNXoMlAq1uAguSJ4aPRtofGKRH19dTvugydybC2JrBQolVXxApF3RP3F9MYtttHmXQTSsOmdP_-99n8GTAV2ySa8Oz2EHmxfw-A7n4B64CTtv_3A_D3guzO6G-VAPPv2bQMCmnuky5A9QDzZZXLfLeffjJ6MGLCTs-p0NdopdCONqWAg7YF_aRc0uN5HZL-Hb2eerk698KLbAKxWbjtskT3NUos4yY7Pcu3lFnWprylpJm5SmTJ2jI0FCIx2KSicqRerhKqnRCvkKdpu2wdfAyAYhUCKcU84oVTuLrpSEfNLYEcCKMYKjjQCKamAi9wUxFkWwSERekMT6-pi9xCL4OHb41ZNw3N90z8thbDaIIILDLQmP1xNBCMwkcQT7G5EXwyheFSaTBP9ohorg3XiVhp_3qdgG2_WqkGTwaamyCNg9LQwhQs-iRjf50KvS-HBP7X06_z4pSGuKxdzTeudCvvn3J-zDo02siojfwm63XOMBPKx-d_PV8jAMhlvegwkA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED9NAwl44GtMhMHmB5B4wJsTO7H9WDHGEKWqtIL6FjmJDZVKgtoUxH_P2UnDKrEHXqJIsfN1Z_t3vrvfAbz05Vy4ZZLKQqKB4lJBC-skZUYwJbUpbRV4ZsdyMlHzuZ7uwZshF8ZaG4LP7Kk_Db78qik3fqvsTKDC8AwN9FupEEncZWsNPgMhQjUuBAycpkrOeyKfmOmz2dW0C5vU3mBgO2tQKKriQyLNGv-K68pZ7OLN6xyiYd25ePB_b_wQ7vf4kow6hXgEe7Z-DPeusQ4egBuRcfOL-pnAs2G2v4kP9qDTvykEZOq5LkMGAfYgo-XXZrVov30n2ICElF2_t0HObRsCuWoSAg_I-2ZZkattbPYT-Hzxbvb2kvblFmgpYtVSk-hUW8GqLFMm097Ry6pUGlVUgpukUEXqHB4RFCruLCtlIlKLPVzJpTWMH8J-3dT2KRC0QhCWMOeEU0JUzlhXcMQ-aewQYsU2gtOtAPKy5yL3JTGWebBJmM5RYl2FzE5iEbweOvzoaDhubnrg5TA060UQwfGOhIfrCUMMppI4gqOtyPN-HK9zlXEEgDhHRXAyXMUB6L0qprbNZp1zNPkkF1kE5IYWCjGh51HDm7zqVGl4uCf3Pl98GeWoNfly4Ym9NePP_v0JJ3DncvZpnI8_TD4ewd1t5AqLn8N-u9rYF3C7_Nku1qvjMDD-AL_mDEc |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Low-Complexity+High-Performance+Preprocessing+Algorithm+for+Multiuser+Detection+Using+Gold+Sequences&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=AXEHILL%2C+Daniel&rft.au=GUNNARSSON%2C+Fredrik&rft.au=HANSSON%2C+Anders&rft.date=2008-09-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1053-587X&rft.volume=56&rft.issue=9&rft.spage=4377&rft.epage=4385&rft_id=info:doi/10.1109%2FTSP.2008.926190&rft.externalDBID=n%2Fa&rft.externalDocID=20584821 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |