Open AccessBlind iterative maximum likelihood‐based frequency and transition time estimation for frequency hopping systems
Author(s) -
Fu KuoChing,
Chen YungFang
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0557
Subject(s) - convergence (economics) , computational complexity theory , iterative method , algorithm , computer science , mathematical optimization , maximum likelihood , frequency hopping spread spectrum , maximum likelihood sequence estimation , scheme (mathematics) , estimation , estimation theory , mathematics , statistics , telecommunications , mathematical analysis , management , economics , economic growth
Timing synchronisation and frequency estimation are two major estimation problems for frequency‐hopping spread spectrum systems. We present a blind scheme for estimating frequency and transition time in an iterative fashion: the iterative disassemble and assemble algorithm. The proposed scheme does not require initial random guesses as with common iterative algorithms. Improper initial guesses may suffer from the problem of convergence to the local maximum. The proposed approach can converge to the global maximum in order to achieve the solution. The proposed scheme offers a much lower computational complexity than that of the maximum‐likelihood greedy search algorithm. Moreover, it also outperforms existing schemes with comparable complexity. The simulation results demonstrate the efficacy of the proposed approach.