Linear parallel interference cancellation in long-code CDMA multiuser detection
Parallel interference cancellation (PIC) is a promising detection technique for code division multiple access (CDMA) systems. It has previously been shown that the weighted multistage PIC can be seen as an implementation of the steepest descent algorithm used to minimize the mean squared error (MSE)...
Saved in:
Published in | IEEE journal on selected areas in communications Vol. 17; no. 12; pp. 2074 - 2081 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.12.1999
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Parallel interference cancellation (PIC) is a promising detection technique for code division multiple access (CDMA) systems. It has previously been shown that the weighted multistage PIC can be seen as an implementation of the steepest descent algorithm used to minimize the mean squared error (MSE). Following this interpretation, a unique set of weights, based on the eigenvalues of the correlation matrix, was found to lead to the minimum achievable MSE for a given number of stages in a short-code system. In this paper, we introduce a method for finding an appropriate set of time-invariant weights for systems using long codes. The weights are dependent on moments of the eigenvalues of the correlation matrix, exact expressions of which can be derived. This set of weights is optimal in the sense that it minimizes the ensemble averaged MSE over all code-sets. The loss incurred by averaging rather than using the optimal, time-varying weights is practically negligible, since the eigenvalues of sample correlation matrices are tightly clustered in most cases of interest. The complexity required for computing the weights increases linearly with the number of users but is independent of the processing gain, hence on-line weight updating is possible in a dynamic system. Simulation results show that a few stages is usually sufficient for near-MMSE performance. |
---|---|
AbstractList | Parallel interference cancellation (PIC) is a promising detection technique for code division multiple access (CDMA) systems. It has previously been shown that the weighted multistage PIC can be seen as an implementation of the steepest descent algorithm used to minimize the mean squared error (MSE). Following this interpretation, a unique set of weights, based on the eigenvalues of the correlation matrix, was found to lead to the minimum achievable MSE for a given number of stages in a short-code system. In this paper, we introduce a method for finding an appropriate set of time-invariant weights for systems using long codes. The weights are dependent on moments of the eigenvalues of the correlation matrix, exact expressions of which can be derived. This set of weights is optimal in the sense that it minimizes the ensemble averaged MSE over all code-sets. The loss incurred by averaging rather than using the optimal, time-varying weights is practically negligible, since the eigenvalues of sample correlation matrices are tightly clustered in most cases of interest. The complexity required for computing the weights increases linearly with the number of users but is independent of the processing gain, hence on-line weight updating is possible in a dynamic system. Simulation results show that a few stages is usually sufficient for near-MMSE performance Parallel interference cancellation (PIC) is a promising detection technique for code division multiple access (CDMA) systems. It has previously been shown that the weighted multistage PIC can be seen as an implementation of the steepest descent algorithm used to minimize the mean squared error (MSE). Following this interpretation, a unique set of weights, based on the eigenvalues of the correlation matrix, was found to lead to the minimum achievable MSE for a given number of stages in a short-code system. In this paper, we introduce a method for finding an appropriate set of time-invariant weights for systems using long codes. The weights are dependent on moments of the eigenvalues of the correlation matrix, exact expressions of which can be derived. This set of weights is optimal in the sense that it minimizes the ensemble averaged MSE over all code-sets. The loss incurred by averaging rather than using the optimal, time-varying weights is practically negligible, since the eigenvalues of sample correlation matrices are tightly clustered in most cases of interest. The complexity required for computing the weights increases linearly with the number of users but is independent of the processing gain, hence on-line weight updating is possible in a dynamic system. Simulation results show that a few stages is usually sufficient for near-MMSE performance. |
Author | Dongning Guo Rasmussen, L.K. Teng Joon Lim |
Author_xml | – sequence: 1 surname: Dongning Guo fullname: Dongning Guo organization: Centre for Wireless Commun., Singapore – sequence: 2 givenname: L.K. surname: Rasmussen fullname: Rasmussen, L.K. – sequence: 3 surname: Teng Joon Lim fullname: Teng Joon Lim |
BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-62663$$DView record from Swedish Publication Index |
BookMark | eNp90TtPwzAQAGALFYm2MLAyZQIhkWLHTmyPVctLKuoCrJaTnIshjYOdCPHvSUnVkeVuuE-ne0zQqHY1IHRO8IwQLG-ZnAnCBE6P0JikqYgxxmKExphTGgtOshM0CeEDY8KYSMZovbI1aB812uuqgiqydQvegIe6gKjQfawq3VpX95WocvUmLlwJ0WL5PI-2XdXaLoCPSmih2KlTdGx0FeBsn6fo9f7uZfEYr9YPT4v5Ki6o4G3McUpzk2c6NYwYJhhIAJ6zNKfCCEJpwo0UedJPjQ2n3CR5VhZCliwXBlNKp-hm6Bu-oely1Xi71f5HOW3V0r7NlfMb9dm-qyzJsh2_Gnjj3VcHoVVbG_5Wq8F1QUkiZX-_JOvl5b8yEZQILHEPrwdYeBeCB3OYgWC1-4ViUg2_6O3FYC0AHNy--At8eYVg |
CODEN | ISACEM |
CitedBy_id | crossref_primary_10_1109_26_898258 crossref_primary_10_1049_iet_com_2013_0560 crossref_primary_10_1109_TSP_2004_828914 crossref_primary_10_1109_TVT_2007_901064 crossref_primary_10_1109_TIT_2019_2937335 crossref_primary_10_1049_ip_com_20045256 crossref_primary_10_1109_49_942506 crossref_primary_10_1109_TCOMM_2002_805280 crossref_primary_10_1109_TWC_2003_809122 crossref_primary_10_1109_TWC_2005_847004 crossref_primary_10_1109_TWC_2003_811191 crossref_primary_10_6109_jkiice_2012_16_8_1686 crossref_primary_10_1109_26_818883 crossref_primary_10_1109_TWC_2020_3034269 crossref_primary_10_1016_j_sigpro_2008_05_001 crossref_primary_10_1109_TIT_2002_805066 crossref_primary_10_1109_JSAC_2004_823442 crossref_primary_10_1007_BF02994613 crossref_primary_10_1109_TIT_2005_850081 crossref_primary_10_1109_TSP_2003_821112 crossref_primary_10_1109_TVT_2007_900387 crossref_primary_10_1002_wcm_671 crossref_primary_10_1109_TIT_2005_853298 crossref_primary_10_1109_TVT_2012_2188919 crossref_primary_10_1109_TSP_2009_2021500 crossref_primary_10_1109_TCOMM_2004_823584 crossref_primary_10_1109_TIT_2003_821985 crossref_primary_10_1109_TWC_2008_070332 crossref_primary_10_1109_TIT_2010_2040898 crossref_primary_10_1109_TCOMM_2007_898860 |
Cites_doi | 10.1109/18.749008 10.1109/18.42183 10.1007/BF02106658 10.1109/35.714616 10.1007/BF01553893 10.1109/ISIT.1998.708617 10.1109/26.52662 10.1109/18.568697 10.1109/26.818883 10.1109/26.664306 10.1109/49.54464 10.1016/0047-259X(82)90080-X 10.1109/TIT.1986.1057121 10.1109/49.737640 10.1109/26.659484 10.1023/A:1019116709390 10.1109/ISSSTA.1998.722512 10.1109/18.737515 10.1017/CBO9780511624100 10.1109/26.339839 10.1002/ett.4460090505 10.1109/26.52661 10.1109/35.714618 |
ContentType | Journal Article |
DBID | RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3 ADTPV AOWAS D8V |
DOI | 10.1109/49.814805 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library Online CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database SwePub SwePub Articles SWEPUB Kungliga Tekniska Högskolan |
DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Technology Research Database Engineering Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library Online url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-0008 |
EndPage | 2081 |
ExternalDocumentID | oai_DiVA_org_kth_62663 10_1109_49_814805 814805 |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 41~ 5GY 5VS 6IK 97E AAJGR AASAJ AAYOK ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RIG RNS TN5 VH1 XFK AAYXX CITATION 7SP 8FD L7M F28 FR3 ADTPV AOWAS D8V |
ID | FETCH-LOGICAL-c387t-7053bfb6a5f41f484e9ee7b45b38f813327f98b27330f737f2b6dc89d4b8f0333 |
IEDL.DBID | RIE |
ISSN | 0733-8716 1558-0008 |
IngestDate | Sat Aug 24 00:37:17 EDT 2024 Sat Aug 17 03:02:49 EDT 2024 Fri Aug 16 21:06:40 EDT 2024 Fri Aug 23 00:51:50 EDT 2024 Wed Jun 26 19:28:33 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 12 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c387t-7053bfb6a5f41f484e9ee7b45b38f813327f98b27330f737f2b6dc89d4b8f0333 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 28318090 |
PQPubID | 23500 |
PageCount | 8 |
ParticipantIDs | swepub_primary_oai_DiVA_org_kth_62663 ieee_primary_814805 proquest_miscellaneous_919911026 crossref_primary_10_1109_49_814805 proquest_miscellaneous_28318090 |
PublicationCentury | 1900 |
PublicationDate | 1999-12-01 |
PublicationDateYYYYMMDD | 1999-12-01 |
PublicationDate_xml | – month: 12 year: 1999 text: 1999-12-01 day: 01 |
PublicationDecade | 1990 |
PublicationTitle | IEEE journal on selected areas in communications |
PublicationTitleAbbrev | J-SAC |
PublicationYear | 1999 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
References | ref13 ref12 ref15 ref11 ref10 ref2 ref1 ref17 ref16 ref18 (ref3) 1995 guo (ref30) 1998 fletcher (ref23) 1987 ref24 ref26 ref25 ref20 ref22 ref21 lim (ref14) 1998; 16 verdu (ref7) 1998 macwilliams (ref29) 1978 ref28 ref27 ref8 ref4 ref6 ref5 lim (ref9) 1998 suzuki (ref19) 1996; sst96 10 |
References_xml | – ident: ref27 doi: 10.1109/18.749008 – ident: ref8 doi: 10.1109/18.42183 – start-page: 401 year: 1998 ident: ref9 article-title: noise enhancement in the family of decorrelating detectors for multiuser cdma publication-title: Proc IEEE Asia-Pacific Conf Comms /Int Conf Comm Systems (APCC/ICCS) contributor: fullname: lim – ident: ref20 doi: 10.1007/BF02106658 – ident: ref2 doi: 10.1109/35.714616 – ident: ref6 doi: 10.1007/BF01553893 – volume: sst96 10 year: 1996 ident: ref19 publication-title: Real-time decorrelation scheme with multi-stage architecture for asynchronous DS/CDMA contributor: fullname: suzuki – ident: ref21 doi: 10.1109/ISIT.1998.708617 – ident: ref17 doi: 10.1109/26.52662 – ident: ref11 doi: 10.1109/18.568697 – year: 1995 ident: ref3 publication-title: Mobile station/base station compatibility standard for dual-mode wideband spread spectrum cellular system – ident: ref26 doi: 10.1109/26.818883 – ident: ref15 doi: 10.1109/26.664306 – ident: ref10 doi: 10.1109/49.54464 – year: 1978 ident: ref29 publication-title: The Theory of Error-Correcting Codes contributor: fullname: macwilliams – ident: ref28 doi: 10.1016/0047-259X(82)90080-X – ident: ref5 doi: 10.1109/TIT.1986.1057121 – year: 1998 ident: ref7 publication-title: Multiuser Detection contributor: fullname: verdu – volume: 16 start-page: 1711 year: 1998 ident: ref14 article-title: an adaptive asynchronous multiuse cdma detector based on the kalman filter publication-title: IEEE J Select Areas in Commun doi: 10.1109/49.737640 contributor: fullname: lim – year: 1998 ident: ref30 publication-title: Linear parallel interference cancellation in CDMA contributor: fullname: guo – ident: ref18 doi: 10.1109/26.659484 – ident: ref13 doi: 10.1023/A:1019116709390 – ident: ref22 doi: 10.1109/ISSSTA.1998.722512 – ident: ref25 doi: 10.1109/18.737515 – ident: ref24 doi: 10.1017/CBO9780511624100 – ident: ref12 doi: 10.1109/26.339839 – ident: ref16 doi: 10.1002/ett.4460090505 – ident: ref4 doi: 10.1109/26.52661 – year: 1987 ident: ref23 publication-title: Practical Methods of Optimization contributor: fullname: fletcher – ident: ref1 doi: 10.1109/35.714618 |
SSID | ssj0014482 |
Score | 1.9249673 |
Snippet | Parallel interference cancellation (PIC) is a promising detection technique for code division multiple access (CDMA) systems. It has previously been shown that... |
SourceID | swepub proquest crossref ieee |
SourceType | Open Access Repository Aggregation Database Publisher |
StartPage | 2074 |
SubjectTerms | Cancellation Code division multiple access Computational modeling Correlation Detectors Dynamical systems Dynamics Eigenvalues Eigenvalues and eigenfunctions Interference Interference cancellation Multiaccess communication Multiple access interference Multiuser detection Optimization Resource management Wideband Wireless communication |
Title | Linear parallel interference cancellation in long-code CDMA multiuser detection |
URI | https://ieeexplore.ieee.org/document/814805 https://search.proquest.com/docview/28318090 https://search.proquest.com/docview/919911026 https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-62663 |
Volume | 17 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ07T8MwEMctYIKBRwFRnhaCMSWpndgeKx6qkAoLRWxW7NiAiFIE6cKn585JK0AgseUtx77E_7PvfibkJLUcugGRI_qyHyHAK8q9tVECP0tjbZIWAnOHRzfZcMyvH9KHlrMdcmGccyH4zPVwM8zlFxM7xaGyMwnaHXmli0KpJlVrPmEAXkaYMBCMRegDtBChJFZnHKwh3Pit6wlrqXyXlV9RoaF7uVpr8rbfA5UQo0peetPa9OzHD2bjP0u-TlZbmUkHjV1skAVXdcjKF_jgJrkFNxTMnCL8uyxdSZEc8dam_1GL1lA2gXJwhpaT6jHC_Hd6fjEa0BCHiAMctHB1iOaqtsj46vLufBi1yytElklRRwK-P-NNlqeeJ55L7pRzwvDUMOkl-K594ZU0oG9Y7AUTvm-ywkpVcCN9zBjbJkvVpHI7hPZ5nqvCOS6N4qkzRiGZDnYtS5iRpkuOZzWvXxuKhg7eR6w0V7qpnS7pYMXNL5gdPZo1kQbLD69eucn0XYMwQvhY3CX0jysUxnWBgsq65LRp3PnDkap98Xw_0NBM-qV-0uDYZWz31yLskeUAawhBLPtkqX6bugOQIrU5DEb4CQ3t3Yg |
link.rule.ids | 230,315,783,787,799,888,27936,27937,55086 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3LT-MwEIctBAfYA89dUZ7WCo4pSe3E9rEqoMJSuMCKmxU7NiCiFNH0wl_PjJNWgHYlbnnLsSfxb-yZz4QcpZZDNyByRF_2IgR4Rbm3NkrgZ2msTdJCYO7w6Dob3vHL-_S-5WyHXBjnXAg-c13cDHP5xdhOcajsRIJ2R17pEshqmTXJWvMpA_AzwpSBYCxCL6DFCCWxOuFgD-HWT51PWE3ls7D8CAsNHcz5WpO5PQlcQowree5Oa9O1b1-ojd8s-zpZbYUm7TeWsUEWXLVJfnzAD26RG3BEwdAp4r_L0pUU2RGvbQIgtWgPZRMqB2doOa4eIsyAp4PTUZ-GSEQc4qCFq0M8V_WT3J2f3Q6GUbvAQmSZFHUk4As03mR56nniueROOScMTw2TXoL32hNeSQMKh8VeMOF7JiusVAU30seMsV9ksRpXbpvQHs9zVTjHpVE8dcYoZNPBrmUJM9J0yO9ZzeuXhqOhg_8RK82VbmqnQzax4uYXzI4ezppIg-2HV6_ceDrRII0QPxZ3CP3PFQoju0BDZR1y3DTu_OHI1T59-tvX0Ez6uX7U4NplbOefRTgky8Pb0ZW-urj-s0tWArohhLTskcX6der2QZjU5iAY5DvFJODT |
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=Linear+parallel+interference+cancellation+in+long-code+CDMA+multiuser+detection&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Guo%2C+Dongning&rft.au=Rasmussen%2C+Lars+Kildeh%C3%B6j&rft.au=Lim%2C+Teng+Joon&rft.date=1999-12-01&rft.issn=1558-0008&rft.volume=17&rft.issue=12&rft.spage=2074&rft_id=info:doi/10.1109%2F49.814805&rft.externalDocID=oai_DiVA_org_kth_62663 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon |