TY - GEN
T1 - Low-complexity adaptive array for DS/CDMA code acquisition
AU - Yang, Hua Lung
AU - Wu, Wen-Rong
PY - 2006
Y1 - 2006
N2 - Conventional array code acquisition uses a correlator bank and an adaptive beamformer. However, its performance degrades significantly while multiple access interference (MAI) presents. In this paper, we propose a low-complexity adaptive filtering scheme to solve the problem. The proposed scheme comprises two adaptive filters, an adaptive spatial and an adaptive temporal filter. With a special structure, the spatial filter can act as a beamformer suppressing interference, while the temporal filter can act as a code-delay estimator. A criterion is proposed for minimization such that these filters can simultaneously adjusted by a constrained least-mean-square (LMS) algorithm. The proposed system is simple and it can acquire both the code-delay and direction-of-arrival (DoA) of the desired user. The performance as well as the convergence behavior of the proposed algorithm are analyzed analytically. Closed-form expressions for optimum filters and steady-state mean-squared errors (MSE) are derived. Computer simulations show that the mean acquisition time of the proposed system is much shorter than that of the conventional system.
AB - Conventional array code acquisition uses a correlator bank and an adaptive beamformer. However, its performance degrades significantly while multiple access interference (MAI) presents. In this paper, we propose a low-complexity adaptive filtering scheme to solve the problem. The proposed scheme comprises two adaptive filters, an adaptive spatial and an adaptive temporal filter. With a special structure, the spatial filter can act as a beamformer suppressing interference, while the temporal filter can act as a code-delay estimator. A criterion is proposed for minimization such that these filters can simultaneously adjusted by a constrained least-mean-square (LMS) algorithm. The proposed system is simple and it can acquire both the code-delay and direction-of-arrival (DoA) of the desired user. The performance as well as the convergence behavior of the proposed algorithm are analyzed analytically. Closed-form expressions for optimum filters and steady-state mean-squared errors (MSE) are derived. Computer simulations show that the mean acquisition time of the proposed system is much shorter than that of the conventional system.
UR - http://www.scopus.com/inward/record.url?scp=34547244864&partnerID=8YFLogxK
U2 - 10.1109/ISCAS.2006.1692555
DO - 10.1109/ISCAS.2006.1692555
M3 - Conference contribution
AN - SCOPUS:34547244864
SN - 0780393902
SN - 9780780393905
T3 - Proceedings - IEEE International Symposium on Circuits and Systems
SP - 193
EP - 196
BT - ISCAS 2006
T2 - ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
Y2 - 21 May 2006 through 24 May 2006
ER -