MultipleCandidate Successive Interference Cancellation with WidelyLinear Processing for MAI and Jamming Suppression in DSCDMA Systems
Abstract
In this paper, we propose a widelylinear (WL) receiver structure for multiple access interference (MAI) and jamming signal (JS) suppression in directsequence codedivision multipleaccess (DSCDMA) systems. A vector space projection (VSP) scheme is also considered to cancel the JS before detecting the desired signals. We develop a novel multiplecandidate successive interference cancellation (MCSIC) scheme which processes two consecutive user symbols at one time to process the unreliable estimates and a number of selected points serve as the feedback candidates for interference cancellation, which is effective for alleviating the effect of error propagation in the SIC algorithm. Widelylinear signal processing is then used to enhance the performance of the receiver in noncircular modulation scheme. By bringing together the techniques mentioned above, a novel interference suppression scheme is proposed which combines the widelylinear multiplecandidate SIC (WLMCSIC) minimum meansquared error (MMSE) algorithm with the VSP scheme to suppress MAI and JS simultaneously. Simulations for binary phase shift keying (BPSK) modulation scenarios show that the proposed structure achieves a better MAI suppression performance compared with previously reported SIC MMSE receivers at lower complexity and a superior JS suppression performance.
irectsequence codedivision multipleaccess, multiple access interference, jamming signals, minimum meansquared error, successive interference cancellation, vector space projection, multiplecandidate.
1 introduction
Directsequence codedivision multipleaccess (DSCDMA) systems are one of the most successful multiple access technologies for wireless communication systems. Such services include third generation cellular telephone, indoor wireless networks and satellite communication systems. Multiple access interference (MAI), arising from the nonorthogonality between the signature sequences and jamming signals is a significant limiting factor to the performance of DSCDMA systems. To address this problem, the optimum multiuser detector (MUD) and several suboptimum MUDs were introduced [1]. Optimal multiuser detection has an exponential computational complexity and is therefore impractical. Several lowcomplexity multiuser detectors including the linear decorrelator, the linear minimum meansquared error (MMSE), the successive interference cancellation (SIC) [2], and the parallel interference cancellation (PIC) have been proposed [3].
The SIC detector regenerates and cancels the signals of other users before data detection of the desired user. The potential of SIC to alleviate the near–far problem comes from its property of removing stronger users before detecting weaker users. Specific forms of the SIC are closely related to approximations of the optimum maximum likelihood (ML) detector [4, 5], as well as iterative techniques for solving linear equations [6]. There are several variants of the SIC algorithm, which have been investigated in last decade or so [8][14]. The performance of the SIC algorithm relies heavily on the accuracy of the symbol estimate and is subject to error propagation effects when the estimated symbol is not accurate. Methods including soft or linear interference cancellation and partial interference cancellation are proposed to mitigate this error propagation [7]. A multiple feedback SIC (MFSIC) algorithm with shadow area constraints (SAC) strategy for detection of multiple data streams has been introduced in [10]. The MF selection algorithm searches several constellation points rather than one and chooses the most appropriate constellation symbol as the decision. A joint successive interference cancellation technique (JSIC) has been introduced in [12]. The key idea behind JSIC is to exploit the structural properties of the subconstellation formed by the signals of two consecutive users in an ordered set to gain an improvement in the detector performance.
In wireless communication systems, most interference suppression or parameter estimation techniques are based on linear signal processing [15, 16]. However, when a noncircular modulation is applied, e.g. binary phase shift keying (BPSK), linear estimation of an improper realvalued signal from complex data appears complex, which in a statistical signal processing sense, is not optimal. It has been shown in [24] that by exploiting the improper nature of the received signal, the estimation performance can be significantly improved. Therefore, the resulting widely linear (WL) estimate has gained great popularity for systems using noncircular modulation schemes [25, 26, 27].
The jamming signal (JS) is another form of interference which has a huge influence on the performance of DSCDMA systems. The notch filter is used to cancel the JS and an estimate of the interference parameters is required before the interference cancellation [31]. A generalized approach for the JS suppression in PN spreadspectrum communications using openloop adaptive excision filtering is introduced [32]. The algorithm has a tradeoff between interference removal and the amount of selfnoise generated from the induced correlation across the PN chip sequence due to the filtering procedure. A new transversal filter structure is used before correlation to improve the performance of DSCDMA systems [33]. Several subspace techniques have been developed to exploit the lowrank structure of the interference in . The eigenspacebased interference canceller has been proposed in [44] and to cancel the interference through constructing the proposed estimateandsubtract interference cancellation beamformer.
The goal of this work is to develop an interference suppression strategy for DSCDMA systems that operates in the presence of noncircular data, JS and MAI. To this end, we bring together a novel SIC algorithm, WL processing and a JS cancellation scheme. Inspired by the error propagation mitigation in the MFSIC and JSIC algorithms, we propose a novel MultipleCandidate SIC (MCSIC) scheme which processes two consecutive user symbols at one time when the current symbol decision is not reliable and also exploits the constellation knowledge in the generation of candidates for detection. In addition to this, we combine WL processing with the MCSIC scheme and propose a widely linear MCSIC (WLMCSIC) algorithm, which aims to deal with the performance degradation due to error propagation in SIC and linear signal processing on the noncircular signal. We also devise a technique to cancel JS that is incorporated into the proposed WLMCSIC algorithm, which relies on a vector space projection (VSP) method. The interference cancellation operator is constructed to project the desired signal onto the complement of the JS subspace.
The main contributions of this paper are summarized as follows:

A MCSIC scheme based on the MMSE criterion is proposed.

A novel widely linear MCSIC (WLMCSIC) MMSE algorithm is devised, which combines WL processing and a MCSIC MMSE scheme to improve the detector’s performance under noncircular modulation scheme and alleviate the effect of error propagation in the traditional SIC algorithm.

A novel interference mitigation scheme is proposed which combines the VSP algorithm with the WLMCSIC MMSE algorithm to jointly suppress the MAI and JS.

The performance of the proposed algorithm for MAI and JS suppression is compared with other interference suppression schemes.
The organization of the paper is as follows. The system model is given in Section II. Section III introduces the proposed WLMCSIC algorithm and VSP. In Section IV the complexity of the WLMCSIC algorithm is analyzed. Section V presents the simulation results and a comparison between the proposed WLMCSIC algorithm with the VSP method and previously reported algorithms.
Notation: In this paper, scalar quantities are denoted with italic typeface. Lowercase boldface quantities denote vectors and uppercase boldface quantities denote matrices. The operations of transposition, complex conjugation, and conjugate transposition are denoted by , and , respectively. The symbol denotes the expected value of a random quantity, the operator selects the real part of the argument, the operator selects the imaginary part of the argument, denotes a linear subspace spanned by the columns of the matrix A and the operator denotes the absolute value of the argument.
2 system model
Let us consider a synchronous DSCDMA system with K active users signaling through an additive Gaussian noise channel. The received baseband signal during one symbol interval in such channel can be modeled as
(1) 
where and represent the jamming signal and the ambient channel noise respectively; is the symbol interval; is the BPSK symbol for the user with amplitude , and is the spreading sequence waveform of the th user.
After chip matched filtering and time synchronization, sampling with rate , where is equal to the spreading factor and appropriate normalization, the vector containing the samples received in the interval can be expressed as
(2) 
where is the spreading sequence vector of the th user. The quantity is the jamming interference vector, is a zeromean additive white Gaussian noise (AWGN) sample vector with , , where is the singlesided power spectral density, is the identity matrix. We use the definition , and . Eq.(2) can be equivalently expressed as
(3) 
We assume the transmitted symbol sequences of different users are mutually and statistically independent. The spreading sequences are linearly independent and normalized to , .
The jamming signal is modeled as a sinusoidal signal (tone) or an autoregressive (AR) signal. The jamming signal can also be digital with a data rate much lower than the spread spectrum chip rate. The tone interference is commonly used in the JS analysis [28] and we use this type of interference as the JS, which can be expressed as
(4) 
where and are the power and the normalized frequency of the th tone interference and are independent random phases uniformly distributed on . The quantity denotes the number of components of the tone interference.
In this paper, we detect the users according to their received power level arranged in descending order; the strongest user is detected first. We assume that the user is the desired user and estimate the user after removing users from the received signal. For our implementation of the SIC schemes, we assume perfect knowledge of the signal amplitudes and the spreading codes.
3 Proposed Widely Linear MCSIC MMSE Detector Design
In this section, we firstly introduce the scheme of the VSP interference canceller [44] to suppress the JS before estimating the desired users. Secondly, we review the linear MMSE detector based on widely linear signal processing. Then we describe the MCSIC MMSE detector design based on the constellation constrains and multiplecandidate scheme and devise the WLMCSIC MMSE algorithm which combines widely linear signal processing with the MCSIC MMSE scheme. Finally, the proposed interference suppression strategy which employs the WLMCSIC MMSE scheme to suppress the MAI and use the VSP scheme to suppress the JS is proposed.
3.1 VSP Scheme for Jamming Signal Subtraction
Generally, the secondorder statistics of the received signal are represented by the covariance matrix as
(5) 
where is the covariance matrix of the desired signal and denotes the covariance matrix without any contribution from the desired signal. In practical applications, the covariance matrix can be estimated by using the time averaging method shown as follows
(6) 
where is the length of the averaging window.
Performing an eigendecomposition on yields
(7)  
where are the eigenvalues of arranged in decreasing order, is the eigenvector associated with , and contain the dominant eigenvectors and the remaining eigenvectors, respectively. The quantity is the number of users, that is
(8) 
(9) 
and
(10) 
is a diagonal matrix.
We can get the linear subspace where
(11) 
and
(12) 
The desired user signal , lies in the subspace and . Therefore, we have the desired user signal lies within the intersection of [44] where
(13) 
In accordance with the theorem of sequential vector space projection [45], the intersection of the two constraint sets can be found by applying the alternating projection algorithm which is described by
(14) 
where is the estimate of the desired signal. denotes the matrix composed of the eigenvectors of the matrix and those dominant eigenvectors are selected according to the descending order of the eigenvalue of the matrix . and are the projection operators which are defined as [44]
(15) 
(16) 
Equation (14) can be interpreted as selecting the vectors located in the linear subspace spanned by the columns of , which has the smallest angle from the subspace .
Using the estimated desired signal , the desiredsignalabsent covariance matrix can be formed by
(17) 
Performing an eigendecomposition on yields
(18)  
where are the eigenvalues of arranged in decreasing order, is the eigenvector associated with . In addition, and are diagonal matrices and and consist of the dominant eigenvectors and remaining eigenvectors, respectively. An important conclusion through simulations results shown below is drawn that the main power of the jamming interference is centralized in the principal eigenvector of desiredsignalabsent covariance matrix. Before we use the principal eigenvector , should be normalized as follows
(19) 
where denotes the inner product of vector and vector .
Let be the complement projection operator of the interference signal. Then can be estimated by
(20) 
where is the identity matrix. Using the complement projection operator on the received signal vector to suppress the JS before the SIC MMSE detection yields
(21) 
where is the vector which is projected onto the complement of the JS subspace. The VSP algorithm to preprocess the received signal in order to suppress the JS is summarized in Table 1.
1: Initialize the averaging windows =100. 
2: Calculate the covariance matrix 
. 
3: Perform an eigendecomposition on 
. 
4: . 
5: . 
6: Calculate the projection operators 
, 
. 
7: . 
8: Calculate the desiredsignalabsent covariance matrix 
. 
9: Perform an eigendecomposition on 
. 
10: . 
11: . 
12: . 
From the previous discussion we know that one important step for the VSP scheme is detecting the existence of the jamming signal. From (17) we can get the desiredsignalabsent covariance matrix and most of the information about the jamming signal is associated with the principal eigenvector. This conclusion can be drawn from the simulation result shown below. The simulation scenarios are: the length of the spreading sequence is 16 and the spreading sequence is randomly generated. The number of users is 8 and the signal to noise ratio (SNR) for every user is set to 8dB. The power between different tone interferences is equal and the signal to interference ratio (SIR) of the tone interference is 0dB. The normalized frequency of the tone interference is set as: , , , , . In this paper, SIR is calculated after despreading. The eigenvalue of the desiredsignalabsent covariance matrix is shown in Fig.1.
From the simulation result we can see that the interference energy is mainly located at the principal eigenvalue of the desiredsignalabsent covariance matrix. Using this character we can easily know about the existence of the JS. This method is also insensitive to the number of the interferers.
3.2 Widely Linear Signal Processing Scheme
In [24] and [25], it has been shown that for BPSK modulation and other noncircular or improper modulation schemes, the performance of linear receivers can be further improved if both the received signal and also its complex conjugate are processed. This is because, for improper signals, the covariance matrix cannot completely describe the secondorder statistics of the received vector and the complementary covariance matrix needs to be taken into account. The resulting receiver is referred to as a WL receiver.
In order to exploit the secondorder information, we perform WL processing that utilizes the received vector and its complex conjugate to form an augmented vector. For convenience we introduce the bijective transform
(22) 
In what follows, all WL based quantities are denoted by an over tilde. An important property of is that, for a complex vector and , . Now a widely linear MMSE solution can be directly obtained as
(23) 
where
(24) 
(25) 
and the widely linear MMSE estimate of the data symbol is given by
(26) 
3.3 MCSIC MMSE Design
As mentioned above, the SIC scheme is a decisiondriven detection algorithm which suffers from error propagation and performance degradation, the strategy of the MCSIC scheme is to find the optimum feedback decision and mitigate the error propagation. The key idea behind the MCSIC scheme is to exploit the structural properties of the subconstellation formed by the signals of two consecutive users in an ordered set to gain an improvement in detection performance.
In the following, we detail the MCSIC algorithm through the procedure for detecting for user . The detection of the data symbols of the other user can be performed accordingly. The soft estimation of the user ’s symbol is obtained by using the MMSE detector as
(27) 
where the MMSE filter is given by , denotes the matrix obtained by taking the columns of and is the received vector after cancellation of the previously detected symbols.
Based on the estimate of the user ’s symbol , the user ’s symbol can be calculated as
(28) 
where is the signal quantization operator used to detect the signals of each user. The detection parameter is constructed with the estimated symbols and as
(29) 
For each user, the reliability of the soft estimate is determined by the combined constellation constraint structure which is illustrated in Fig.2.
The combined constellation constraint structure shown in Fig.2 is for BPSK modulation mode and the combined constellation set is constructed as . The parameter is the threshold distance to evaluate the reliability of the current estimated symbol , which is a predefined parameter. The reliability of the estimated symbol is determined by the Euclidean distance between the detection parameter and its nearest combined constellation points, which is given by
(30) 
The optimum parameter denotes the constellation point which is the nearest to the detection parameter and can be expressed as
(31) 
There are two possibilities as follows:

If , then the current soft estimate is determined reliable and the estimated symbol of user is obtained by . After we get the estimated symbol , we can regenerate user , cancel it from the received vector and continue the procedure above to estimate user .

If , then the current soft estimate is determined unreliable and the optimum feedback symbol must be found before cancellation. Since the effect of “closest” interferer is significant in terms of performance degradation while estimating the user ’s symbol [12], we estimate two consecutive user signals at one time and the candidates for and are selected from , where , , , . After the optimum candidate is selected from , the effects of user and will be subtracted together before detecting the rest of the users. The selection algorithm is described as follows.
In order to get the optimum candidate for user and user , we construct the estimated symbol vector from three parts: the first part is the previously detected symbols , , , , the second part is the symbol taken from the candidate constellation point set , the last part uses the previous decisions and performs the following users ,,’s detection by the nulling and symbol cancellation which is equivalent to the traditional SIC algorithm. Therefore, we can get the estimated symbol vector
(32) 
where , is the potential decision that corresponds to the selection of in the constellation point set,
(33) 
where indexes a certain user between to . For each user the same MMSE filter is used for all the candidates, which can be calculated in advance and allows the proposed algorithm to have the computational simplicity of the SIC algorithm described by
(34) 
According to the maximum likelihood rule in the selected candidates set, the optimum candidate is given by
(35) 
where the is chosen to replace the unreliable and , which will be the optimal feedback symbols for the next user as well as the more reliable estimate for the current two users.
3.4 Widely Linear MCSIC MMSE Algorithm
In this subsection, we will combine widely linear signal processing with the MCSIC MMSE scheme and obtain the WLMCSIC MMSE algorithm.
From the previous subsection, we can compute the widely linear MMSE filter as
(36) 
The soft estimate of the user ’s symbol is obtained by using the WL MMSE detector as
(37) 
where . The algorithm of the proposed WLMCSIC is summarized in Table 2.
1: 
2: 
3: while 
4: 
5: 
6: 
7: if 
8: if 
9: 
10: 
11: % loopsym=1 denotes program execution in 
this branch,initial value is 0 
12: else if 
13: 
14: 
15: 
16: 
17: 
18: 
19: else 
20: 
21: for to 
22: 
23: 
24: end for 
25: 
26: 
27: 
28: end if 
29: 
30: else 
31: 
32: 
33: 
34: end if 
35: end while 
36: if 
37: 
38: end if 
3.5 VSP Scheme and WLMCSIC MMSE Detector
In this subsection, the procedure for MAI and JS suppression using the proposed WLMCSIC MMSE algorithm along with the VSP scheme is described.
Using the VSP algorithm [44] we can get the desiredsignalabsent covariance matrix and perform an eigendecomposition as in (18). The eigenvalues are obtained and we can set a threshold for checking the existence of the JS, which can be calculated as follows
(38) 
where is a threshold factor and its associated with the power of the JS and the ambient noise. In this paper it is set to . is the number of eigenvalues which are used to estimate the power of the ambient noise and normally it can be set as . By comparing the principal eigenvalue with the threshold , we can get the information about the existence of the jamming signal. The procedure for MAI and JS suppression using the proposed algorithm is summarized in Table 3.
Step1: Calculate the covariance matrix . 
Step2: Calculate the desiredsignalabsent covariance matrix 
using VSP scheme. 
Step3: Perform an eigendecomposition on 
and get the eigenvalues . 
Step4: Calculate the threshold . 
Step5: Compare the principal eigenvalue with the threshold , 
if , execute step 6 otherwise execute step 7. 
Step6: Perform the JS suppression using the VSP algorithm. 
Step7: Perform MAI suppression using the WLMCSIC MMSE 
and get the estimate of the desired signal. 
3.6 Complexity Analysis
In this section, we will discuss the computational complexity of the proposed WLMCSIC MMSE algorithm compared with other existing algorithms mentioned above.
The th user is the desired user in this paper, and we should deduct the effects of 1 users before we estimate the th user. In terms of complex multiplications, the complexity of the proposed algorithm and other existing algorithms as mentioned above is presented in Table 4. We focus only on the complexity of the main successive cancellation procedure since the rest of the operations including the VSP procedure are similar to the algorithms to be compared against.
Algorithm  Required complex multiplications 

SIC MMSE  
MFSIC MMSE  
MCSIC MMSE  
WLSIC MMSE  
WLMFSIC MMSE  
WLMCSIC MMSE 
The main difference between the SIC MMSE algorithm and the MCSIC MMSE detector is how to choose the optimum candidates from the constellation points to replace the unreliable estimate. The threshold is an important factor on the effect of the algorithm complexity. In Table 4 the parameter denotes the number of times that the optimum candidate will be calculated when the threshold is set. The parameter denotes the length of the MMSE filter. The parameter denotes the number of candidates in . The parameter denotes the unreliable estimate times. The parameters and denote the number of times we need to calculate the third part of the estimated symbol vector in the MFSIC and MCSIC algorithms respectively and usually is bigger than .
The parameter has an important influence on the performance and the complexity of algorithms. we should find a trade off between them. In the next section we will simulate the effects of the different on the algorithm.
4 Simulation Results
In this section, we assess the bit error rate (BER) performance of the proposed WLMCSIC MMSE algorithm compared with the existing MAI cancellation algorithms mentioned above. Firstly, the simulations for the selection of parameter threshold are made. Secondly, the performance comparisons between the proposed WLMCSIC MMSE algorithm and the existing MAI cancellation algorithms are made. Finally, the performance of the MAI and JS suppression of the proposed VSP and WLMCSIC MMSE is shown.
In the following simulations, we consider that all the algorithms are used in synchronous DSCDMA systems employing BPSK modulation and we transmit 10000 information symbols per user in one packet and the results are averaged over independent Monte Carlo runs. The spreading signature used for every user is randomly generated and the sequence length is 16. We assume that all the users have the same power unless otherwise stated.
4.1 Parameter Threshold Setting
As we have discussed above, the threshold is crucial to the performance of the proposed algorithm. The threshold can be either a constant or a function of the signal power and the noise power, which can also be obtained through simulation in practical applications. In the paper we assess the BER performance of the algorithm under different thresholds to get the optimum threshold. We assume that the number of users is 8 and the SNR varies from 2dB to 12dB. The threshold is set to = 0.1, 0.3, 0.5, 0.7, 0.9 and 1.1. The evaluation of the BER performance against the SNR with different values of is shown in Fig.3.
In order to detail the performance difference between the different values of the threshold , we assess the BER performance of the algorithm at SNR=8dB. The simulation result is shown in Fig.4.
From the simulation results shown in Fig.3 and Fig.4 we can get the optimum threshold . It should be pointed out that the optimum value of is relative and it also varies with the different scenarios. The optimum value should be selected under the different scenarios. Unless stated otherwise, in the following scenarios in this paper the threshold of the proposed WLMCSIC MMSE algorithm is set to .
4.2 Performance Comparison
In this subsection, we will compare the BER performance of the proposed WLMCSIC MMSE algorithm with the existing MAI cancellation algorithms mentioned above. We use SNR, the capacity in terms of the number of users and algorithm complexity to compare the performance of those algorithms.
Firstly, we evaluate the BER performance against the SNR of the received signal, for the MFSIC algorithm we choose the optimum threshold which is also obtained through simulation in the same simulation scenario. In the following simulations, we choose this value for the MFSIC algorithm and the WLMFSIC algorithm. The number of users in this scenario is set to 8.
The simulation result in Fig.5 shows that the BER performance of the WLMCSIC MMSE algorithm outperforms other algorithms.
Secondly, we evaluate the BER performance against the number of users. The SNR of this scenario is set to 8dB. The simulation result is illustrated in Fig.6. From the simulation result shown in Fig.6 we can see that with the increase in the number of users, the proposed algorithm has a better performance than the other considered algorithms.
Finally, we will evaluate the algorithm complexity of those algorithms. We have analyzed the algorithm complexity theoretically in Section IV. Here two simulation scenarios will be considered: the first scenario is the algorithm complexity against the length of spreading sequence. The number of users is set to 8 and SNR is set to 8dB. The length of spreading sequence varies from 16 to 128. As mentioned above, we use the number of complex multiplications as the tool to evaluate the complexity of those algorithms. Fig.7(a) shows the simulation result of the first scenario. the second scenario is the algorithm complexity against the number of users and the simulation is shown in Fig.7(b). In the simulation SNR is set to 8dB and the number of users varies from 4 to 12.
From the simulation results shown in Fig.7, we find the WLMCSIC MMSE algorithm has much less complexity than the WLMFSIC MMSE algorithm and the MFSIC MMSE algorithm. Since the proposed algorithm uses the candidate scheme to alleviate the effect of error propagation in the conventional SIC algorithm, the complexity of the proposed algorithm is inevitably higher than the conventional SIC algorithm.
4.3 Performance of Jamming Suppression
The linear MMSE detection algorithm has a good performance for suppressing the MAI and the JS [28]. In order to get the MMSE detector, we should have the knowledge of the jamming signal, usually which can be obtained through an adaptive strategy [29]. In this subsection we evaluate the performance of the WLMCSIC algorithm on joint MAI and JS suppression.
We take the tone interference as the jamming signal and its form is shown in formula (4). From the conclusion we have drawn above we know that the VSP algorithm is insensitive to the number of tone interferers. In the simulation below, we consider a scenario that uses only one tone signal as the JS and the parameter . As the VSP algorithm is used to suppress the JS before suppressing the MAI, to be simplicity we only assess the effect of JS suppression of the proposed algorithm, which combines the VSP algorithm with the WLMC MMSE algorithm together. The other simulation conditions are the same with the simulations above.
From the simulation results shown in Fig.8 we can see that using the VSP algorithm to suppress the JS before detecting the desired signals will improve the performance of the SIC detector greatly. The proposed algorithm which combines the VSP method and WLMCSIC MMSE algorithm together has a much better performance for MAI and JS suppression than the existing schemes mentioned above.
5 Conclusion
A WLMCSIC MMSE algorithm for DSCDMA systems for joint MAI and JS suppression is proposed in this paper. The contributions of our research work are composed of three parts: Firstly, in order to cancel the jamming signal, we present a VSP algorithm which is effective in the JS suppression. This method is able to identify the existence of the jamming signal and is insensitive to the number of the tones. Secondly, we propose the multiple candidates constellation constraints scheme to alleviate the effect of error propagation in the SIC algorithm. In order to deal with the improper characteristic of received signal, widelylinear signal processing is used to make full use of the secondorder information of received vector which outperforms linear signal processing. Finally, we propose a WLMCSIC MMSE scheme which combines the VSP algorithm with the WLMCSIC MMSE algorithm together for joint suppressing MAI and JS. The simulation results show that the proposed algorithm outperforms the existing SIC MMSE algorithms mentioned above and have a good performance for JS suppression.
References
 S. Verdu, “Multiuser Detection’ (Cambridge, Cambridge University Press, 1998, 4th edition)
 P. Patel, J. Holtzman.: ‘Analysis of a simple successive interference cancellation scheme in DS/CDMA system’, IEEE Journal. Select. Areas Commun., 1994, 12, (5), pp.124134
 D. Divsalar, M. K. Simon, D. Raphaeli.: ‘Improved parallel interference cancellation for CDMA’, IEEE Trans. Commun., 1998, 46, (12), pp.258268
 P. H. Tan, L. K. Rasmussen.: ‘Constrained maximumlikelihood detection in CDMA’, IEEE Trans. Commun., 2001, 49, (1), pp.142–153
 L. B. Nelson, H. V. Poor.: ‘Iterative multiuser receivers for CDMA channels: An EM approach’, IEEE Trans. Commun., 1996, 44, (12), pp.1700–1710
 H. EldersBoll, H. D. Schotten, A. Busboom.: ‘Efficient implementation of linear multiuser detectors for asynchronous CDMA systems by linear interference cancellation’, European Trans. Telecommun, 1998, 9, (5), pp.427–437
 W. Zha and S. D. Blostein, “SoftDecision Multistage Multiuser Interference Cancellation”, IEEE Trans. Vehicular Technology, 2003, 52, (2), pp.380–388.
 K.C. Lai and J. J. Shynk, “Performance evaluation of a generalized linear SIC for DS/CDMA signals”, IEEE Trans. Signal Processing, 2003, 51, (6), pp.1604–1614.
 R. C. de Lamare, R. SampaioNeto, “Adaptive MBER decision feedback multiuser receivers in frequency selective fading channels”, IEEE Communications Letters, vol. 7, no. 2, Feb. 2003, pp. 73  75.
 P. Li, R. C. de Lamare, R. Fa., “Multiple Feedback Successive Interference Cancellation Detection for Multiuser MIMO Systems”, IEEE Trans. Wireless Communications, 2011, 10, (8), pp.2434–2439.
 R.C. de Lamare, R. SampaioNeto, A. Hjorungnes, “Joint iterative interference cancellation and parameter estimation for cdma systems”, IEEE Communications Letters, 11, (12), December 2007, pp. 916  918.
 A. Sen Gupta and A. Singer, “Successive Interference Cancellation Using Constellation Structure”, IEEE Trans. Signal Processing, 2007, 55, (12), pp.5716–5730.
 R.C. de Lamare, R. SampaioNeto, “Minimum meansquared error iterative successive parallel arbitrated decision feedback detectors for DSCDMA systems”, IEEE Transactions on Communications, 56, (5), May 2008, pp. 778789.
 R. Fa, R. C. de Lamare, “MultiBranch Successive Interference Cancellation for MIMO Spatial Multiplexing Systems”, IET Communications, 5, (4), pp. 484  494, March 2011.
 S. Li, R. C. de Lamare, “Adaptive linear interference suppression based on block conjugate gradient method in frequency domain for DSUWB systems”, Proc. The Sixth International Symposium on Wireless Communication Systems Conf.,Siena, Italy, September 2009, pp.343347.
 S. Li and R. C. de Lamare, “Frequency Domain Adaptive Detectors for SCFDE in Multiuser DSUWB Systems Based on Structured Channel Estimation and Direct Adaptation”, IET Communications, 4, (13), 2010, pp. 16361650.
 R. C. de Lamare and R. SampaioNeto, “Blind adaptive codeconstrained constant modulus algorithms for CDMA interference suppression in multipath channels”, IEEE Communications Letters, vol. 9, no. 4, pp. 334336, April 2005.
 R. C. de Lamare and R. SampaioNeto, “Blind adaptive MIMO receivers for spacetime blockcoded DSCDMA systems in multipath channels using the constant modulus criterion,” IEEE Transactions on Communications, vol. 58, no. 1, January 2010, pp. 2127.
 L. Wang and R. C. de Lamare, “Constrained adaptive filtering algorithms based on conjugate gradient techniques for beamforming”, IET Signal Processing, vol. 4, no. 6, pp. 686697, December 2010.
 P. Clarke and R. C. de Lamare, “Lowcomplexity reducedrank linear interference suppression based on setmembership joint iterative optimization for DSCDMA systems”, IEEE Transactions on Vehicular Technology, vol. 60, no. 9, pp. 43244337, November 2011.
 S. Li, R. C. de Lamare and R. Fa, “Reducedrank linear interference suppression for DSUWB systems based on switched approximations of adaptive basis functions”, IEEE Transactions on Vehicular Technology, vol. 60, no. 2, pp. 485497, February 2011.
 R. C. de Lamare, R. SampaioNeto and M. Haardt, “Blind adaptive constrained constantmodulus reducedrank interference suppression algorithms based on interpolation and switched decimation”, IEEE Transactions on Signal Processing, vol. 59, no. 2, pp. 681695, February 2011.
 S. Li and R. C. de Lamare, “Blind reducedrank adaptive receivers for DSUWB systems based on joint iterative optimization and the constrained constant modulus criterion”, IEEE Transactions on Vehicular Technology, vol. 60, no. 6, pp. 25052518, July 2011.
 B. Picinbono and P. Chevalier, “Widely linear estimation with complex data”, IEEE Trans. Signal Processing, 1995, 43, (8), pp.20302033
 P. J. Schreier, L. L. Scharf, “Secondorder analysis of improper complex random vectors and processes’, IEEE Trans. Signal Processing, 2003, 51, (3), pp.714725
 S. Buzzi, M. Lops, A. M. Tulino, “A new family of MMSE multiuser receivers for interference suppression in DS/CDMA systems employing BPSK modulation”, IEEE Trans. Communications, 2001, 49, (1), pp.154167.
 N. Song, R. C. de Lamare, M. Haardt, and M. Wolf, “Adaptive Widely Linear ReducedRank Interference Suppression based on the MultiStage Wiener Filter”, IEEE Transactions on Signal Processing, 60, (8), 2012.
 H. V. Poor and X. Wang, ‘CodeAided Interference Suppression for DS/CDMA CommunicationsPart I:Interference Suppression Capability’, IEEE Trans. Communications, 1997, 45, (9), pp.11011111
 H. V. Poor and X. Wang, “CodeAided Interference Suppression for DS/CDMA CommunicationsPart II: Parallel Blind Adaptive Implementations”, IEEE Trans. Communications, 1997, 45, (9), pp.11121122
 P. Li and R. C. de Lamare, “Apaptive Decision Feedback Detection with Constellation Constraints for MIMO Systems”, IEEE Trans. Vehicular Technology, 2012, 61, (2), pp.853859
 L. Milstein, “Interference rejection techniques in spread spectrum communications’, Proc. IEEE Conf., June 1988, pp.657671
 M. G. Amin, C. Wang, A. R. Lindsey, “Optimum Interference Excision in Spread Spectrum Communications Using OpenLoop Adaptive Filters”, IEEE Trans. Signal Processing, 1999, 61, (7), pp.19661096
 E. Panay and Y. BarNess, “Rejection of Multiple Tone Interference in DS SpreadSpectrum Systems Employing Minimum Redundant Transversal Filters”, IEEE Communications Letters, 1997, 1, (5), pp.140143.
 M. L. Honig and J. S. Goldstein, “Adaptive reducedrank interference suppression based on the multistage Wiener filter,” IEEE Trans. on Communications, 50, (6), June 2002.
 R. C. de Lamare and R. SampaioNeto, “Adaptive reducedrank MMSE filtering with interpolated FIR filters and adaptive interpolators”, IEEE Signal Processing Letters, vol. 12, no. 3, March, 2005.
 R. C. de Lamare and Raimundo SampaioNeto, “Reducedrank Interference Suppression for DSCDMA based on Interpolated FIR Filters”, IEEE Communications Letters, vol. 9, no. 3, March 2005.
 R. C. de Lamare and R. SampaioNeto, “Adaptive Interference Suppression for DSCDMA Systems based on Interpolated FIR Filters with Adaptive Interpolators in Multipath Channels”, IEEE Trans. Vehicular Technology, Vol. 56, no. 6, September 2007.
 R. C. de Lamare and R. SampaioNeto, “Adaptive ReducedRank MMSE Parameter Estimation based on an Adaptive Diversity Combined Decimation and Interpolation Scheme,” Proc. IEEE International Conference on Acoustics, Speech and Signal Processing, April 1520, 2007, vol. 3, pp. III1317III1320.
 R. C. de Lamare and R. SampaioNeto, “ReducedRank Adaptive Filtering Based on Joint Iterative Optimization of Adaptive Filters”, IEEE Signal Processing Letters, 14, (12), December 2007.
 R. C. de Lamare, M. Haardt and R. SampaioNeto, “Blind Adaptive Constrained ReducedRank Parameter Estimation based on Constant Modulus Design for CDMA Interference Suppression,” IEEE Transactions on Signal Processing, 56, (6), June 2008.
 R. C. de Lamare and R. SampaioNeto, “Adaptive reducedrank processing based on joint and iterative interpolation, decimation, and filtering,” IEEE Trans. Signal Processing, 57, (7), July 2009, pp. 25032514.
 R. C. de Lamare and R. SampaioNeto, “ReducedRank SpaceTime Adaptive Interference Suppression With Joint Iterative Least Squares Algorithms for SpreadSpectrum Systems,” IEEE Transactions on Vehicular Technology, 59, (3), March 2010, pp.12171228.
 R.C. de Lamare and R. SampaioNeto, “Adaptive reducedrank equalization algorithms based on alternating optimization design techniques for MIMO systems,” IEEE Trans. Veh. Technol., vol. 60, no. 6, pp. 24822494, July 2011.
 J. Zhuang and A. Manikas, “Interference cancellation beamforming robust to pointing errors”, IET Trans. Signal Processing, 2013, 7, (2), pp.120–127
 H. Stark and Y. Yang, “Vector space projections: a numerical approach to signal and image processing, neural nets, and optics”, ( John Wiley & Sons, New York, NY, USA, 1998)