Please use this identifier to cite or link to this item: https://doi.org/10.1109/TSP.2004.840703
Title: ML-based frequency estimation and synchronization of frequency hopping signals
Authors: Ko, C.C. 
Zhi, W. 
Chin, F.
Keywords: Frequency estimation
Frequency hopping communication
Iterative methods
Maximum likelihood estimation
Synchronization
Issue Date: Feb-2005
Source: Ko, C.C., Zhi, W., Chin, F. (2005-02). ML-based frequency estimation and synchronization of frequency hopping signals. IEEE Transactions on Signal Processing 53 (2 I) : 403-410. ScholarBank@NUS Repository. https://doi.org/10.1109/TSP.2004.840703
Abstract: A maximum likelihood (ML)-based algorithm for frequency estimation and synchronization of frequency hopping signals is proposed in this paper. By using a two-hop signal model that incorporates the unknown hop transition time, the likelihood function of the received frequency hopping signal is formulated. A new iterative method is then derived to estimate the hopping frequencies and hop transition time. Without using any pilot signal or sync bit, the new algorithm is able to implement synchronization and frequency estimation at the same time. Unlike the time-frequency distribution (TFD) and the wavelet-based algorithms in papers by Barbarossa and Scaglione and by Khalil and Hippenstiel, the new ML algorithm does not require the selection of a kernel or mother wavelet function. In addition, compared with the TFD-based algorithm, it has a better performance with a lower implementation complexity. © 2005 IEEE.
Source Title: IEEE Transactions on Signal Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/56647
ISSN: 1053587X
DOI: 10.1109/TSP.2004.840703
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

38
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

23
checked on Nov 23, 2017

Page view(s)

50
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.