NDLI: A note on polynomial complexity optimal multiuser detection for certain non-orthogonal CDMA signals

Content Provider	IEEE Xplore Digital Library
Author	Tan Bien Aik Motani, M. Lim Teng Joon
Copyright Year	2002
Description	Author affiliation: DSO Nat. Labs., Singapore, Singapore (Tan Bien Aik)
Abstract	It is well known that jointly-optimum multiuser detection (MUD) in code division multiple access (CDMA) systems has a computational complexity that increases exponentially with the number of users. If the signal cross-correlations between different users are non-positive, then optimum MUD can be done with polynomial complexity using graph theory. The MUD problem is transformed into one that solves for the minimum cut (min-cut) or maximum flow (max-flow) in an associated graph or network. An alternative method to transform the MUD problem into a network, that sees a reduction in the number of edges by 50 percent, is proposed. This results in minimizing the already polynomial-complexity of existing multiuser detection techniques based on edge-dependent max-flow algorithms.
Starting Page	889
Ending Page	893
File Size	237470
Page Count	5
File Format	PDF
ISBN	0780375106
DOI	10.1109/ICCS.2002.1183261
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-11-28
Publisher Place	Singapore
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Multiuser detection Multiaccess communication Maximum likelihood detection Maximum likelihood estimation Computational complexity Graph theory Covariance matrix Code division multiplexing Additive white noise
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Polynomial complexity optimal multiuser detection for a wider class of problems

Combined decision-feedback multiuser detection/soft-decision decoding for CDMA channels

Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA

A reactive tabu search heuristic for multiuser detection in CDMA

Simulated performance of local maximum likelihood detection with interferences of unknown signature waveforms

Channel-shortening multiuser detector for DS-CDMA systems

Maximum likelihood blind multiuser detection

Low complexity semi-blind maximum-likelihood multiuser receiver for MC-CDMA systems

Multiuser Detection in Overloaded Synchronous CDMA using Modified Probabilistic Data Association

A note on polynomial complexity optimal multiuser detection for certain non-orthogonal CDMA signals

Similar Documents

Polynomial complexity optimal multiuser detection for a wider class of problems

Combined decision-feedback multiuser detection/soft-decision decoding for CDMA channels

Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA

A reactive tabu search heuristic for multiuser detection in CDMA

Simulated performance of local maximum likelihood detection with interferences of unknown signature waveforms

Channel-shortening multiuser detector for DS-CDMA systems

Maximum likelihood blind multiuser detection

Low complexity semi-blind maximum-likelihood multiuser receiver for MC-CDMA systems

Multiuser Detection in Overloaded Synchronous CDMA using Modified Probabilistic Data Association

A note on polynomial complexity optimal multiuser detection for certain non-orthogonal CDMA signals