A low-complexity optimum multiuser receiver for DS-CDMA wireless systems

Syed S. Rizvi, Khaled M. Elleithy, Aasia Riasat, Min Song

Research output: Contribution to journalArticle

Abstract

Multiuser detection is an important technology in wireless CDMA systems for improving both data rate as well as user capacity. However, the computational complexity of multiuser detection prevents the widespread use of this technique. Most of the CDMA systems today and in the near future will continue to use the conventional matched filter with its comparatively low user capacity and a slow data rate. However, if we could lower the computational complexity of multiuser detectors, CDMA systems would offer an increased system capacity with a better data rate. In this paper, a new scheme for reducing the computational complexity of multiuser receivers is proposed. It utilizes the transformation matrix algorithm to improve the performance of multiuser receivers by effectively reducing the bit error rate (BER). In addition to the transformation matrix algorithm, a quantitative analysis of the processing gain for a multiuser DS-CDMA system is presented. The quantitative analysis of the processing gain demonstrates that how the reduced BER could be used to achieve reasonable values of processing gain by which unwanted signals or interference can be suppressed relative to the desired signal at the receiving end. We present that the proposed scheme can reduce the asymptotic computational complexity of multiuser receivers while at the same time effectively eliminates the unwanted signals. The proposed algorithms not only are shown to substantially improve the performance of the multiuser detectors by means of reduced BER but also have a much lower multi-access interference. The performance measure adopted in this paper is the achievable bit rate for a fixed probability of error (10-7) and consistent values of SNR.

Original languageEnglish (US)
Pages (from-to)455-466
Number of pages12
JournalJournal of Communications
Volume5
Issue number6
DOIs
StatePublished - Jan 1 2010

Fingerprint

Code division multiple access
Computational complexity
Bit error rate
Multiuser detection
Processing
Detectors
Matched filters
Chemical analysis

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Rizvi, Syed S. ; Elleithy, Khaled M. ; Riasat, Aasia ; Song, Min. / A low-complexity optimum multiuser receiver for DS-CDMA wireless systems. In: Journal of Communications. 2010 ; Vol. 5, No. 6. pp. 455-466.
@article{0106956a63074881baa07fdbaf59a8f8,
title = "A low-complexity optimum multiuser receiver for DS-CDMA wireless systems",
abstract = "Multiuser detection is an important technology in wireless CDMA systems for improving both data rate as well as user capacity. However, the computational complexity of multiuser detection prevents the widespread use of this technique. Most of the CDMA systems today and in the near future will continue to use the conventional matched filter with its comparatively low user capacity and a slow data rate. However, if we could lower the computational complexity of multiuser detectors, CDMA systems would offer an increased system capacity with a better data rate. In this paper, a new scheme for reducing the computational complexity of multiuser receivers is proposed. It utilizes the transformation matrix algorithm to improve the performance of multiuser receivers by effectively reducing the bit error rate (BER). In addition to the transformation matrix algorithm, a quantitative analysis of the processing gain for a multiuser DS-CDMA system is presented. The quantitative analysis of the processing gain demonstrates that how the reduced BER could be used to achieve reasonable values of processing gain by which unwanted signals or interference can be suppressed relative to the desired signal at the receiving end. We present that the proposed scheme can reduce the asymptotic computational complexity of multiuser receivers while at the same time effectively eliminates the unwanted signals. The proposed algorithms not only are shown to substantially improve the performance of the multiuser detectors by means of reduced BER but also have a much lower multi-access interference. The performance measure adopted in this paper is the achievable bit rate for a fixed probability of error (10-7) and consistent values of SNR.",
author = "Rizvi, {Syed S.} and Elleithy, {Khaled M.} and Aasia Riasat and Min Song",
year = "2010",
month = "1",
day = "1",
doi = "10.4304/jcm.5.6.455-466",
language = "English (US)",
volume = "5",
pages = "455--466",
journal = "Journal of Communication",
issn = "0021-9916",
publisher = "Wiley-Blackwell",
number = "6",

}

A low-complexity optimum multiuser receiver for DS-CDMA wireless systems. / Rizvi, Syed S.; Elleithy, Khaled M.; Riasat, Aasia; Song, Min.

In: Journal of Communications, Vol. 5, No. 6, 01.01.2010, p. 455-466.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A low-complexity optimum multiuser receiver for DS-CDMA wireless systems

AU - Rizvi, Syed S.

AU - Elleithy, Khaled M.

AU - Riasat, Aasia

AU - Song, Min

PY - 2010/1/1

Y1 - 2010/1/1

N2 - Multiuser detection is an important technology in wireless CDMA systems for improving both data rate as well as user capacity. However, the computational complexity of multiuser detection prevents the widespread use of this technique. Most of the CDMA systems today and in the near future will continue to use the conventional matched filter with its comparatively low user capacity and a slow data rate. However, if we could lower the computational complexity of multiuser detectors, CDMA systems would offer an increased system capacity with a better data rate. In this paper, a new scheme for reducing the computational complexity of multiuser receivers is proposed. It utilizes the transformation matrix algorithm to improve the performance of multiuser receivers by effectively reducing the bit error rate (BER). In addition to the transformation matrix algorithm, a quantitative analysis of the processing gain for a multiuser DS-CDMA system is presented. The quantitative analysis of the processing gain demonstrates that how the reduced BER could be used to achieve reasonable values of processing gain by which unwanted signals or interference can be suppressed relative to the desired signal at the receiving end. We present that the proposed scheme can reduce the asymptotic computational complexity of multiuser receivers while at the same time effectively eliminates the unwanted signals. The proposed algorithms not only are shown to substantially improve the performance of the multiuser detectors by means of reduced BER but also have a much lower multi-access interference. The performance measure adopted in this paper is the achievable bit rate for a fixed probability of error (10-7) and consistent values of SNR.

AB - Multiuser detection is an important technology in wireless CDMA systems for improving both data rate as well as user capacity. However, the computational complexity of multiuser detection prevents the widespread use of this technique. Most of the CDMA systems today and in the near future will continue to use the conventional matched filter with its comparatively low user capacity and a slow data rate. However, if we could lower the computational complexity of multiuser detectors, CDMA systems would offer an increased system capacity with a better data rate. In this paper, a new scheme for reducing the computational complexity of multiuser receivers is proposed. It utilizes the transformation matrix algorithm to improve the performance of multiuser receivers by effectively reducing the bit error rate (BER). In addition to the transformation matrix algorithm, a quantitative analysis of the processing gain for a multiuser DS-CDMA system is presented. The quantitative analysis of the processing gain demonstrates that how the reduced BER could be used to achieve reasonable values of processing gain by which unwanted signals or interference can be suppressed relative to the desired signal at the receiving end. We present that the proposed scheme can reduce the asymptotic computational complexity of multiuser receivers while at the same time effectively eliminates the unwanted signals. The proposed algorithms not only are shown to substantially improve the performance of the multiuser detectors by means of reduced BER but also have a much lower multi-access interference. The performance measure adopted in this paper is the achievable bit rate for a fixed probability of error (10-7) and consistent values of SNR.

UR - http://www.scopus.com/inward/record.url?scp=78651576921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651576921&partnerID=8YFLogxK

U2 - 10.4304/jcm.5.6.455-466

DO - 10.4304/jcm.5.6.455-466

M3 - Article

AN - SCOPUS:78651576921

VL - 5

SP - 455

EP - 466

JO - Journal of Communication

JF - Journal of Communication

SN - 0021-9916

IS - 6

ER -