By Topic

Performance of Reed-Solomon Coded Frequency-Hop Spread-Spectrum Communications in Partial-Band Interference

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pursley, M.B. ; Univ. of Illinois, IL ; Stark, W.E.

This paper is concerned with the performance of a Communications system which utilizes frequency-hop spread spectrum, diversity transmission, Reed-Solomon coding, and parallel error-correction and erasure-correction decoding. Both binary signaling and M -ary orthogonal signaling are considered. The goals are twofold. First, it is desirable to provide good performance in partial-band Gaussian noise interference by use of coding and diversity with an efficient error-correction algorithm. Second, it is necessary to totally neutralize narrow-band interference (regardless of the power level or statistical distribution of the interference) in order to have an effective spread-spectrum system. Through an analysis of the effects of partial-band interference on a frequency-hop spread-spectrum system with diversity, it is shown that the use of ReedSolomon coding with a parallel errors and erasures decoding algorithm accomplishes these goals. The paper also investigates the accuracy of the Chernoff bound as an approximation to the true performance of a frequency-hop spreadspectrum communication system with diversity; side information, M -ary orthogonal signaling, and Reed-Solomon coding. The performance results presented in the paper are based on analysis and computer evaluation. Approximate results based on the Chernoff bound are also given. It is shown that the Chernoff bound for M -ary orthogonal signaling gives a very poor approximation for many cases of interest. This is largely due to the looseness of the union bound.

Published in:

Communications, IEEE Transactions on  (Volume:33 ,  Issue: 8 )