Analysis of protocol sequences for slow frequency hopping

Abstract

Decoding error probability bounds are derived for slow frequency hopping schemes. For unslotted asynchronous multiple access random of protocol sequences with interleaved codes are considered. Nonrandom constructions of protocol sequences with good cyclic correlation properties are given. For slotted access the maximum and average Hamming correlation properties of these protocol sequences imply error bounds.