Performance Analysis of Anti-multi-jamming of BPSK/FFHSS with Clipper receiver over Nakagami-m fading channel

碩士 === 中華技術學院 === 電子工程研究所碩士班 === 96 === This thesis pertains to the numerical evaluation of bit error probability of the system which is an binary phase-shift keying (BPSK)/ fast frequency hopping spread spectrum communications. The system is assumed to be worked over frequency nonselective Nakagami...

Full description

Bibliographic Details
Main Authors: Muhan Liao, 廖睦涵
Other Authors: Yawpo Yang
Format: Others
Language:zh-TW
Published: 2008
Online Access:http://ndltd.ncl.edu.tw/handle/61014203140457017089
Description
Summary:碩士 === 中華技術學院 === 電子工程研究所碩士班 === 96 === This thesis pertains to the numerical evaluation of bit error probability of the system which is an binary phase-shift keying (BPSK)/ fast frequency hopping spread spectrum communications. The system is assumed to be worked over frequency nonselective Nakagami-m fading channel. The transmitted signal is also assumed to be attacked by a one-band worst multi-tone jamming, which is assumed to experience frequency nonselective Nakagami-m fading. The Jamming channel is assumed to be statistically independent of that of the signal channel. At the receiver end, the noncoherent square-law demodulation is employed, which is then fed to a linear clipper. Finally, the decision maker will output an estimated data. The signal energy-to-noise power spectrum density ( ) is fixed, and the clipping level C, the fading figure m, and the hopping number in one bit L are used as parameters. The numerical approach is adopted to evaluate bit error probability of such a system in a variety of signal-to-jamming ratio (SJR). Bit error probability is significantly affected by the value of clipping level. For example, By fixing and fading figure , the bit error probability with is better than that with when , where and is the signal power, the bit error probability with is better than that with when , the bit error probability with is better than that with and the bit error probability with is better than that with when .