Computationally efficient discriminators for code-tracking loops

Abstract

Listen

Translate article

New and revisited algorithms for coherent and noncoherent code-tracking loops (CTL) are presented in this work. The algorithms are relatively simple in terms of computational effort and hardware reduction. Functional identity to traditionally used algorithms is shown. The increased computational efficiency of the proposed schemes is provided by reducing substantially the multiply and accumulate (MAC) operations per time unit. Reducing the computational effort results in reduced power consumption schemes both for hardware and software implemented loop discriminators.