Algorithms of reduced power consumption and reduced complexity for code tracking loops

Abstract

In this paper new algorithms for coherent and noncoherent code tracking loops are presented. The algorithms are relatively simple and hardware reduced. Functional identity to the traditionally optimal earlglate (E-L) code tracking loops is presented. The new structures are computationally eficient by reducing substantially the multiply and accumulate (MA C) operations per time unit. A s a result, reduced power consumption schemes are obtained.