Computationally efficient discriminators for code-tracking loops

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 eff...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2003-05, Vol.52 (3), p.727-732
Main Authors: Scheim, J., Bobrovsky, B.Z.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Coherence
Computation
Computational efficiency
Computer programs
Correlators
Degradation
Delay estimation
Detectors
Discriminators
Energy consumption
Exact sciences and technology
Global Positioning System
Hardware
Jacobian matrices
Power consumption
Services and terminals of telecommunications
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Telemetry. Remote supervision. Telewarning. Remote control
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2003.810971