In the context of spectrum surveillance, a new method to recover the code of spread spectrum signal is presented, while the receiver has no knowledge of the transmitter-s spreading sequence. In our previous paper, we used Genetic algorithm (GA), to recover spreading code. Although genetic algorithms (GAs) are well known for their robustness in solving complex optimization problems, but nonetheless, by increasing the length of the code, we will often lead to an unacceptable slow convergence speed. To solve this problem we introduce Particle Swarm Optimization (PSO) into code estimation in spread spectrum communication system. In searching process for code estimation, the PSO algorithm has the merits of rapid convergence to the global optimum, without being trapped in local suboptimum, and good robustness to noise. In this paper we describe how to implement PSO as a component of a searching algorithm in code estimation. Swarm intelligence boasts a number of advantages due to the use of mobile agents. Some of them are: Scalability, Fault tolerance, Adaptation, Speed, Modularity, Autonomy, and Parallelism. These properties make swarm intelligence very attractive for spread spectrum code estimation. They also make swarm intelligence suitable for a variety of other kinds of channels. Our results compare between swarm-based algorithms and Genetic algorithms, and also show PSO algorithm performance in code estimation process.
Spread Spectrum Code Estimationby Particle Swarm Algorithm
2007-07-22
oai:zenodo.org:1079008
Article (Journal)
Electronic Resource
English
DDC: | 629 |
Acquisition Of Spread-Spectrum Code
NTRS | 1990
|Particle Swarm Optimization Algorithm
British Library Online Contents | 2005
|Fast PN code acquisition for satellite spread spectrum transponder
British Library Online Contents | 2010
|Compact Particle Swarm Optimization Algorithm
British Library Online Contents | 2006
|Efficient Direct-Sequence Code Acquisition in Spread-Spectrum Communication Systems
British Library Conference Proceedings | 2000
|