Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/8489
Title: Hilbert transform of FFT pruned cross correlation function for optimization in time delay estimation
Authors: Noor Shafiza, Mohd Tamim
Farid, Ghani
Keywords: Analytic signal
Cross correlation
FFT pruning
Hilbert transform
Quadrature demodulation
MICC 2009
Malaysia International Conference on Communications 2009
Issue Date: 15-Dec-2009
Publisher: Institute of Electrical and Electronics Engineering (IEEE)
Citation: p.809-814
Series/Report no.: Proceedings of the 9th Malaysia International Conference on Communications with a Special Workshop on Digital TV Contents (MICC) 2009
Abstract: Measuring delay using cross correlation technique with signals that are corrupted by noise and are received at two spatially separated sensors often result incorrect measurement. This paper presents a new technique that is Hilbert transform of FFT pruned cross correlation function to improve the accuracy of time delay estimates. To investigate the performance of this technique, frequency algorithms are provided to generate synthetic complex base band signals. For each iteration, it generates two sets of signal. We have to specify input parameters to the simulation model any time delay of signal 2 from signal 1, length and number of complex base band signals to be generated. Such model imitate real-life system, and by varying the uncorrelated complex base band signals to various SNR conditions, further analysis can be performed to compare the performance of this new technique with other existing techniques such as parabolic interpolation, zero crossing of Hilbert transform and FFT pruning.
Description: Link to publisher's homepage at http://ieeexplore.ieee.org/
URI: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5431382
http://dspace.unimap.edu.my/123456789/8489
ISBN: 978-1-4244-5532-4
Appears in Collections:Conference Papers
Farid Ghani, Prof. Dr.



Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.