Low-complexity conjugate gradient algorithm for array code acquisition

Hua Lung Yang*, Wen-Rong Wu

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

An adaptive array code acquisition for direct-sequence/ code-division multiple access (DS/CDMA) systems was recently proposed to enhance the performance of the conventional correlator-based method. The scheme consists of an adaptive spatial and an adaptive temporal filter, and can simultaneously perform beamforming and code-delay estimation. Unfortunately, the scheme uses a least-mean-square (LMS) adaptive algorithm, and its convergence is slow. Although the recursive-least-squares (RLS) algorithm can be applied, the computational complexity will greatly increase. In this paper, we solve the dilemma with a low-complexity conjugate gradient (LCG) algorithm, which can be considered as a special case of a modified conjugate gradient (MCG) algorithm. Unlike the original conjugate gradient (CG) algorithm developed for adaptive applications, the proposed method, exploiting the special structure inherent in the input correlation matrix, requires a low computational-complexity. It can be shown that the computational complexity of the proposed method is on the same order of the LMS algorithm. However, the convergence rate is improved significantly. Simulation results show that the performance of adaptive array code acquisition with the proposed CG algorithm is comparable to that with the original CG algorithm.

原文English
頁(從 - 到)1193-1200
頁數8
期刊IEICE Transactions on Communications
E90-B
發行號5
DOIs
出版狀態Published - 1 5月 2007

指紋

深入研究「Low-complexity conjugate gradient algorithm for array code acquisition」主題。共同形成了獨特的指紋。

引用此