Please use this identifier to cite or link to this item:
Title: Least squares symbol detection for multi antenna fh/mfsk systems in the presence of follower jamming
Keywords: Frequency Hopping,Partial Band Jamming,Quasi static flat fading channels, M-ary FSK system,Least Squares,Symbol Detection
Issue Date: 29-Mar-2011
Citation: ALAGUNARAYANAN NARAYANAN (2011-03-29). Least squares symbol detection for multi antenna fh/mfsk systems in the presence of follower jamming. ScholarBank@NUS Repository.
Abstract: The focus of this thesis is the performance of frequency hopped M-ary frequency shift keying (MFSK) systems in the presence of follower partial band jamming (PBJN) over flat fading channels. Thermal and other wideband Gaussian noises have been modeled as additive white Gaussian noise (AWGN) at the receiver. Follower partial band jamming is a strong threat to the symbol error rate (SER) performance of FHSS systems. In order to overcome the effects of follower PBJN and carry out symbol detection in slow FHSS/MFSK systems over quasi-static flat fading channels, a least squares (LS) based method is proposed in this thesis. Specifically, using the principle of Least squares, the complex gain factor between the two jamming components is estimated. This estimate is then used to remove the jamming signal during the symbol detection process. The effect of AWGN on the channel estimation and symbol detection are theoretically analyzed. The symbol error rate performances of the proposed algorithm are compared with that of traditional maximum likelihood (ML) algorithm and the scheme proposed in [13]. The proposed algorithm is found to outperform the other algorithms, when signal to noise ratio (SNR) is greater than about 20dB.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Narayanan Alagunarayanan.pdf630.83 kBAdobe PDF



Page view(s)

checked on Apr 18, 2019


checked on Apr 18, 2019

Google ScholarTM


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