Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

A Low Complexity Interference Cancellation Technique for Multi-User DS-CDMA Communications



Wen-Bin Yang, Kamran Sayrafian


A low complexity Parallel Interference Cancellation (PIC) technique is proposed to suppress Multi-Access Interference (MAI) and minimize near-far effect for multi-user communication using Direct-Sequence Code Division Multiple Access (DS-CDMA). Interference signal is estimated using a relationship between cyclic correlation of the received signal and user s code of the interferer without requiring any knowledge of the channel condition. The user s codes for the multi-user DS-CDMA communication are constructed by using a set of m-sequences. The cyclic correlation is performed using Fast Walsh-Hadamard Transform (FWHT) which exhibits low computational complexity, i.e., it does not require any multiplication/division operations. In addition to low complexity, the proposed technique does not require complicated channel condition estimation and has no convergence issues. The uncoded Bit Error Rate (BER) performance of the proposed interference cancellation is calculated and compared with the conventional one over three different types of channels: AWGN, slow Rayleigh fading, and multipath channels.
Proceedings Title
IEEE International Conference on Communications 2010
Conference Dates
May 23-27, 2010
Conference Location
Cape Town


Interference cancellation, Direct-sequence code division multiple access, Fast Walsh-Hadamard transformation


Yang, W. and Sayrafian, K. (2010), A Low Complexity Interference Cancellation Technique for Multi-User DS-CDMA Communications, IEEE International Conference on Communications 2010, Cape Town, -1, [online], (Accessed April 24, 2024)
Created May 27, 2010, Updated February 19, 2017