This paper deals with the synchronization properties of a family of spreading codes, called concatenated codes. New synchronization algorithms are introduced, and the performance of these algorithms is discussed both analytically and by simulation. It turns out that with a minimum of extra hardware, the mean phase acquisition time can be considerably reduced, while maintaining the reliability of the synchronization process at low power consumption.
|Other||IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications, 2002, Prague, Hungary|
|Period||1/01/02 → 1/01/02|