By Topic

A fast matched filter in time domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Akopian ; Texas Univ., San Antonio, TX, USA ; S. Agaian

This paper presents a fast matched filter algorithm in time domain. Matched filters compute correlation of signals for optimal detection of signals in noise, for extracting ranging measurements, synchronisation, etc. We consider matched filters in the context of Global Positioning System (GPS) receivers, but the algorithms presented here can be used for other applications as no constraining assumptions are made in derivations. Our method outperforms conventional time domain method several times in arithmetic complexity. It is also competitive with transform domain techniques based on Fast Fourier Transform (FFT). Unlike FFT based methods our approach is accurate and is not using rounding and scaling operations.

Published in:

Position Location and Navigation Symposium, 2004. PLANS 2004

Date of Conference:

26-29 April 2004