DocumentCode
2881926
Title
PN code sequence estimation using tabu search
Author
Yongqian, Chen ; Xianci, Xiao
Author_Institution
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Volume
2
fYear
2005
fDate
12-14 Oct. 2005
Firstpage
1362
Lastpage
1365
Abstract
A novel and efficient method that can blindly estimate and synchronise to the PN code sequence of direct-sequence spread spectrum (DS-SS) signal is presented in a non-cooperative context. The method is based on maximum likelihood estimation (MLE) . The MLE of PN code sequence is hard to solve due to the multivariate nonlinear maximization problem. To solve the problem efficiently, this paper focuses on tabu search that is very general and conceptually much simpler than either simulated annealing or genetic algorithm. Both theoretical analysis and compute simulations show that this method can get a good estimation, even when the received signal is far below the noise level and the existence of co-channel multiple access interference.
Keywords
cochannel interference; code division multiple access; maximum likelihood estimation; pseudonoise codes; search problems; sequential codes; spread spectrum communication; DS-SS signal; MLE; PN code sequence estimation; cochannel multiple access interference; direct-sequence spread spectrum signal; genetic algorithm; maximum likelihood estimation; multivariate nonlinear maximization problem; noncooperative context; simulated annealing; tabu search; Baseband; Computational complexity; Computational modeling; Covariance matrix; Finite impulse response filter; Maximum likelihood estimation; Neural networks; Noise level; Spread spectrum communication; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technology, 2005. ISCIT 2005. IEEE International Symposium on
Print_ISBN
0-7803-9538-7
Type
conf
DOI
10.1109/ISCIT.2005.1567121
Filename
1567121
Link To Document