Coding for Frequency-Hopped Spread-Spectrum Channels With Partial-Band Interference
Stark, Wayne Eric
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69246
Description
Title
Coding for Frequency-Hopped Spread-Spectrum Channels With Partial-Band Interference
Author(s)
Stark, Wayne Eric
Issue Date
1982
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Abstract
The performance of codes on frequency-hopped spread-spectrum channels with partial-band interference is investigated. The asymptotic performance of codes is measured by the channel capacity and the random coding exponent. The performance of specific codes is measured by the bit error probability. The channel models we consider are quite general and include channels with unknown parameters, channels which change with time, and channels with memory. These models are applicable to frequency-hopped spread-spectrum communication systems as well as to several other communication systems.
We formulate the problem of communicating over channels with unknown transition probabilities (i.e. communicating over channels with jamming) as a game theory problem with payoff function being the mutual information between the channel input and the channel output. Under certain restrictions it is shown that memoryless coding and jamming strategies are simultaneously optimal strategies. Next we develop simple, yet accurate, models for many channels with memory that arise in practice. The channel statistics are constant for blocks of symbols of fixed length. The receiver is said to have side information if it can determine the channel statistics for each block of symbols transmitted. We determine the capacity, cutoff rate, and random coding exponent for these channels. The capacity without side information is an increasing function of the memory length while the cutoff rate is a decreasing function of the memory length. We show that, for channels with memory and side information random-error correcting codes with interleaving and burst-error correcting codes have comparable performance, while for channels without side information random-error correcting codes with interleaving are inferior to burst-error correcting codes. As a particular example, we examine the performance of several forms of modulation and demodulation with partial-band jamming. Our conclusion is that partial-band jammers can be neutralized provided we use codes with rate less than a constant that depends on the form of modulation and demodulation.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
