Frequency-Hop Antijam Communications with Nonbinary Error-Control Coding
Authors:
- 1 October 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Abstract
Reed-Solomon codes are nonbinary error-control codes that have been employed in military frequency-hop spread-spectrum systems to mitigate the effects of partial-band jamming and other frequency-selective disturbances. Hermitian codes, which are also nonbinary codes, have been suggested as alternatives because they have longer block lengths for the same alphabet size. More recently, construction methods and efficient iterative decoding techniques have been developed for nonbinary quasi-cyclic low-density parity-check (LDPC) codes. For channels in which the only disturbance is thermal noise, nonbinary quasi-cyclic LDPC codes with iterative decoding have been shown to be superior to Reed-Solomon codes of the same block length. We compare the performance of LDPC, Hermitian, and Reed-Solomon codes for frequency-hop transmission over channels with partial-band jamming. Performance results are also included for interleaved binary product codes with iterative decoding. Comparisons are made for nonbinary orthogonal modulation with coherent and noncoherent demodulation.Keywords
This publication has 15 references indexed in Scilit:
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and MaskingIEEE Transactions on Information Theory, 2006
- Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channelsIEEE Transactions on Communications, 2006
- Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes2005
- Hermitian codes for frequency-hop spread-spectrum packet radio networksIEEE Transactions on Wireless Communications, 2003
- Turbo-codes and high spectral efficiency modulation2002
- Performance comparison of Hermitian and Reed-Solomon codes2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- A note on Hermitian codes over GF(q/sup 2/)IEEE Transactions on Information Theory, 1988