Blind spreading sequence estimation based on hill-climbing algorithm
Authors:
- 1 October 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (21645221) , 1299-1302
Abstract
In this paper an efficient method is proposed for blind estimation of short-code direct sequence spread spectrum (DS-SS) signal in synchronous system. This method is based on hill-climbing algorithm (HC), which is developed to estimate the spreading sequence for the capability of efficiency and speediness local optimization search. Firstly, The fitness function is constructed to value the quality of candidate sequence. Secondly, the feasibility that HC algorithm is used to estimate the spreading sequence is analysed according to the fitness function. Lastly, simulation results show that the novel method is capable of retrieving the spreading sequences with approximate performance to previous methods, whereas the computational complexity is much lower than previous methods.Keywords
This publication has 8 references indexed in Scilit:
- Improved blind-spreading sequence estimation algorithm for direct sequence spread spectrum signalsIET Signal Processing, 2008
- Performance analysis of a spreading sequence estimator for spread spectrum transmissionsJournal of the Franklin Institute, 2004
- Statistical techniques for blind detection & discrimination of m-sequence codes in DS/SS systems2002
- Blind estimation of the pseudo-random sequence of a direct sequence spread spectrum signal2002
- Blind estimation of direct-sequence spread spectrum m-sequence chip codes2002
- A robust synchronization procedure for blind estimation of the symbol period and the timing offset in spread spectrum transmissions2002
- A convergence analysis of generalized hill climbing algorithmsIEEE Transactions on Automatic Control, 2001
- Theory of Spread-Spectrum Communications - A TutorialIEEE Transactions on Communications, 1982