Fast and Parallel Matched Filters in Time Domain

David Akopian and Sos Agaian

Abstract:	Matched filters are used to detect and synchronize signals as they implement efficiently correlation procedures. This paper presents fast and parallel matched filter algorithms in time domain, which are obtained by block processing of several correlation operations. Thus arithmetic operations are shared reducing the complexity of implementation. The methods are more flexible and cost effective compared to the fast method recently reported by the authors. They outperform conventional time domain methods in arithmetic complexity and are good alternatives to frequency domain techniques based on the Fast Fourier Transform (FFT). Unlike FFT based methods our approach is accurate, does not require rounding and scaling operations, and no constraints are imposed on sequence lengths. The presented matched filters are attractive for software Global Positioning System (GPS) receivers but can be also used in other type of receiver implementations both for communication and ranging systems.
Published in:	Proceedings of the 17th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2004) September 21 - 24, 2004 Long Beach Convention Center Long Beach, CA
Pages:	491 - 500
Cite this article:	Akopian, David, Agaian, Sos, "Fast and Parallel Matched Filters in Time Domain," Proceedings of the 17th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2004), Long Beach, CA, September 2004, pp. 491-500.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In