The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-...The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-time multiuser receiver presented in this paper combines 2D-RAKE with parallel interference cancellation (PIC), and the improved parallel interference cancellation methods are given. A novel space-time multiuser detection scheme, 2DRAKE-GPPIC is proposed. This scheme employs smart antenna to suppress unexpected DOA (Direction Of Arrival) signal, uses RAKE receiver to combine different delays of expected signal, and utilizes grouped partial parallel interference cancellation (GPPIC) algorithm to suppress further the interference signal in the main lobe of array antennas. The simulation results reveal that the scheme of space-time multiuser detection presented in this paper has better performance for WCDMA system.展开更多
Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an ...Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an iterative multiuser receiver based on decorrelating decision-feedback detection is proposed, which is effective to implement multiuser detection, channel decoding and parameter estimation. The data decoding and the parameter estimation are reinforced each other. The bit error rate decreases along with the increase of the iteration, and the parameter estimation approaches the optimum at the same time.展开更多
The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated...The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.展开更多
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the random...Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.展开更多
Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in t...Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.展开更多
Direct-sequence code-division multiple access (CDMA) is considered for multiuser communication network in underwater acoustic channel, where extended multipath and rapid time-variability are encountered. To track and ...Direct-sequence code-division multiple access (CDMA) is considered for multiuser communication network in underwater acoustic channel, where extended multipath and rapid time-variability are encountered. To track and compensate the channel distortion, a decentralized hypothesis-feedback equalization (HFE) algorithm based on chip-rate update has been used[1]. But due to multiple access interference (MAI), its performance suffers degradation. For this reason, successive interference cancellation hypothesis-feedback equalization (SIC-HFE) algorithm is proposed, which combines the capabilities of HFE to track the time-varying channel and SIC implemented by cross-over feedback filters to cancel out the MAI effects between users. Simulation and experiment results show that the proposed algorithm can significantly improve the performance of asynchronous multiuser CDMA underwater communication system.展开更多
A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it w...A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it was based on coordinate descent iterations where coordinates were the unknown symbol phases. The PDS algorithm, together with a descent local search （also implemented as a version of the PDS algorithm）, was used multiple times with different initializations in a proposed multiple phase detector; the solution with the minimum cost was then chosen as the final solution. The simulation results show that for highly loaded multiuser scenarios, the proposed technique has a detection performance that is close to the single-user bound. The results also show that the multiple phase detector allows detection in highly overloaded scenarios and it exhibits near-far resistance. In particular, the detector has a performance that is significantly better, and complexity that is significantly lower, than that of the detector based on semi-definite relaxation.展开更多
文摘The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-time multiuser receiver presented in this paper combines 2D-RAKE with parallel interference cancellation (PIC), and the improved parallel interference cancellation methods are given. A novel space-time multiuser detection scheme, 2DRAKE-GPPIC is proposed. This scheme employs smart antenna to suppress unexpected DOA (Direction Of Arrival) signal, uses RAKE receiver to combine different delays of expected signal, and utilizes grouped partial parallel interference cancellation (GPPIC) algorithm to suppress further the interference signal in the main lobe of array antennas. The simulation results reveal that the scheme of space-time multiuser detection presented in this paper has better performance for WCDMA system.
文摘Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an iterative multiuser receiver based on decorrelating decision-feedback detection is proposed, which is effective to implement multiuser detection, channel decoding and parameter estimation. The data decoding and the parameter estimation are reinforced each other. The bit error rate decreases along with the increase of the iteration, and the parameter estimation approaches the optimum at the same time.
文摘The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.
文摘Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.
基金supported by the National Council for Technological and Scientific Development of Brazil (RN82/2008)
文摘Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.
基金National Natural Science Foundation of China (60572098)
文摘Direct-sequence code-division multiple access (CDMA) is considered for multiuser communication network in underwater acoustic channel, where extended multipath and rapid time-variability are encountered. To track and compensate the channel distortion, a decentralized hypothesis-feedback equalization (HFE) algorithm based on chip-rate update has been used[1]. But due to multiple access interference (MAI), its performance suffers degradation. For this reason, successive interference cancellation hypothesis-feedback equalization (SIC-HFE) algorithm is proposed, which combines the capabilities of HFE to track the time-varying channel and SIC implemented by cross-over feedback filters to cancel out the MAI effects between users. Simulation and experiment results show that the proposed algorithm can significantly improve the performance of asynchronous multiuser CDMA underwater communication system.
文摘A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it was based on coordinate descent iterations where coordinates were the unknown symbol phases. The PDS algorithm, together with a descent local search （also implemented as a version of the PDS algorithm）, was used multiple times with different initializations in a proposed multiple phase detector; the solution with the minimum cost was then chosen as the final solution. The simulation results show that for highly loaded multiuser scenarios, the proposed technique has a detection performance that is close to the single-user bound. The results also show that the multiple phase detector allows detection in highly overloaded scenarios and it exhibits near-far resistance. In particular, the detector has a performance that is significantly better, and complexity that is significantly lower, than that of the detector based on semi-definite relaxation.
