Show simple item record

dc.contributor.advisorKwon, Hyuck M.
dc.contributor.authorHannon, Matthew
dc.date.accessioned2016-06-15T16:56:25Z
dc.date.available2016-06-15T16:56:25Z
dc.date.issued2015-12
dc.identifier.othert15071
dc.identifier.urihttp://hdl.handle.net/10057/12099
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
dc.description.abstractThis paper studies a channel statistics-dependent, novel, frequency-hopping (FH) pattern generation scheme. Most existing FH patterns are determined by two encryption keys: one for FH in the frequency domain, and the other for time permutation in the time domain. These keys are independent of channel conditions. Hence, an FH signal generated by these two keys occupies the entire spectrum in both the frequency and time domains, and a jammer can have a low probability of detection. However, the probability of a hit (or jamming) on the desired user’s frequency channels by partial band tone jamming (PBTJ) can be high because it is inversely proportional to the total number of available frequency positions. Can an FH system with channel-dependent adaptive FH patterns safeguard the communications systems more effectively? If the answer to that question is yes, then is it possible to find an efficient channel-dependent adaptive FH pattern, and can it be implemented cost effectively for future communication systems against jamming? The aim of this paper is to study answers to the questions posed here.
dc.format.extentxi, 56 p
dc.language.isoen_US
dc.publisherWichita State University
dc.rightsMatthew Hannon
dc.rightsCopyright 2015 Matthew Hannon
dc.subject.lcshElectronic thesis
dc.titleChannel statistics-dependent frequency hopping
dc.typeThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record