A low complexity reduced-rank MMSE receiver for DS/CDMA communications

Zihua Guo, Khaled Letaief

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The minimum mean squared error (MMSE) receiver is a linear filter which can achieve optimal near-far resistance in direct-sequence code-division multiple-access communications. However, one of the main problems of this receiver is the required number of filter taps, which is typically large. This is especially true in systems with a large processing gain in which case the receiver's computation burden becomes very high. As a result, methods for reducing the complexity of the MMSE receiver have been of great interest in recent years. In this paper, we propose an efficient partitioned MMSE receiver based on a classification algorithm. It is shown that the computational complexity (in terms of the filter taps) of the proposed receiver can be reduced significantly while good performance is maintained. Based on the special structure of our proposed receiver, we also propose a release-merge adaptive partition algorithm which can update the partition and the receiver's coefficients simutaneously. In particular, it is demonstrated that the proposed receiver can perform much better than previously proposed reduced-rank MMSE receivers, such as the partial despreading MMSE receiver and the cyclically shifted filter bank receiver, with even a smaller number of taps.

Original languageEnglish
Pages (from-to)59-68
Number of pages10
JournalIEEE Transactions on Wireless Communications
Volume2
Issue number1
DOIs
Publication statusPublished - Jan 2003
Externally publishedYes

Fingerprint

DS-CDMA
Reduced Rank
Mean Squared Error
Code division multiple access
Low Complexity
Receiver
Communication
Filter banks
Computational complexity
Partition
Filter
Linear Filter
Processing
Filter Banks
Code Division multiple Access
Classification Algorithm

Keywords

  • Direct-sequence code-division multiple-access (DS/CDMA)
  • Minimum mean squared error (MMSE) receiver
  • Multiple-access interference (MAI)
  • Multiuser detection (MUD)

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

A low complexity reduced-rank MMSE receiver for DS/CDMA communications. / Guo, Zihua; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 2, No. 1, 01.2003, p. 59-68.

Research output: Contribution to journalArticle

@article{d8cabc8abde947c686980a1275277bc5,
title = "A low complexity reduced-rank MMSE receiver for DS/CDMA communications",
abstract = "The minimum mean squared error (MMSE) receiver is a linear filter which can achieve optimal near-far resistance in direct-sequence code-division multiple-access communications. However, one of the main problems of this receiver is the required number of filter taps, which is typically large. This is especially true in systems with a large processing gain in which case the receiver's computation burden becomes very high. As a result, methods for reducing the complexity of the MMSE receiver have been of great interest in recent years. In this paper, we propose an efficient partitioned MMSE receiver based on a classification algorithm. It is shown that the computational complexity (in terms of the filter taps) of the proposed receiver can be reduced significantly while good performance is maintained. Based on the special structure of our proposed receiver, we also propose a release-merge adaptive partition algorithm which can update the partition and the receiver's coefficients simutaneously. In particular, it is demonstrated that the proposed receiver can perform much better than previously proposed reduced-rank MMSE receivers, such as the partial despreading MMSE receiver and the cyclically shifted filter bank receiver, with even a smaller number of taps.",
keywords = "Direct-sequence code-division multiple-access (DS/CDMA), Minimum mean squared error (MMSE) receiver, Multiple-access interference (MAI), Multiuser detection (MUD)",
author = "Zihua Guo and Khaled Letaief",
year = "2003",
month = "1",
doi = "10.1109/TWC.2002.806364",
language = "English",
volume = "2",
pages = "59--68",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - A low complexity reduced-rank MMSE receiver for DS/CDMA communications

AU - Guo, Zihua

AU - Letaief, Khaled

PY - 2003/1

Y1 - 2003/1

N2 - The minimum mean squared error (MMSE) receiver is a linear filter which can achieve optimal near-far resistance in direct-sequence code-division multiple-access communications. However, one of the main problems of this receiver is the required number of filter taps, which is typically large. This is especially true in systems with a large processing gain in which case the receiver's computation burden becomes very high. As a result, methods for reducing the complexity of the MMSE receiver have been of great interest in recent years. In this paper, we propose an efficient partitioned MMSE receiver based on a classification algorithm. It is shown that the computational complexity (in terms of the filter taps) of the proposed receiver can be reduced significantly while good performance is maintained. Based on the special structure of our proposed receiver, we also propose a release-merge adaptive partition algorithm which can update the partition and the receiver's coefficients simutaneously. In particular, it is demonstrated that the proposed receiver can perform much better than previously proposed reduced-rank MMSE receivers, such as the partial despreading MMSE receiver and the cyclically shifted filter bank receiver, with even a smaller number of taps.

AB - The minimum mean squared error (MMSE) receiver is a linear filter which can achieve optimal near-far resistance in direct-sequence code-division multiple-access communications. However, one of the main problems of this receiver is the required number of filter taps, which is typically large. This is especially true in systems with a large processing gain in which case the receiver's computation burden becomes very high. As a result, methods for reducing the complexity of the MMSE receiver have been of great interest in recent years. In this paper, we propose an efficient partitioned MMSE receiver based on a classification algorithm. It is shown that the computational complexity (in terms of the filter taps) of the proposed receiver can be reduced significantly while good performance is maintained. Based on the special structure of our proposed receiver, we also propose a release-merge adaptive partition algorithm which can update the partition and the receiver's coefficients simutaneously. In particular, it is demonstrated that the proposed receiver can perform much better than previously proposed reduced-rank MMSE receivers, such as the partial despreading MMSE receiver and the cyclically shifted filter bank receiver, with even a smaller number of taps.

KW - Direct-sequence code-division multiple-access (DS/CDMA)

KW - Minimum mean squared error (MMSE) receiver

KW - Multiple-access interference (MAI)

KW - Multiuser detection (MUD)

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

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

U2 - 10.1109/TWC.2002.806364

DO - 10.1109/TWC.2002.806364

M3 - Article

AN - SCOPUS:3042786269

VL - 2

SP - 59

EP - 68

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 1

ER -