This paper presents a new approach to computing symbol error probability of fast frequency-hopped M-ary frequency shift keying (FFH/MFSK) systems with majority vote under multitone jamming. For illustrating the applications, we first consider the case in which the source data rate is fixed and the hopping rate is allowed to vary. In this case, the optimum orders of diversity for several values of M are examined. Results show that M = 4 outperforms other values. Then, we treat another case in which the hopping rate is fixed and the data rate is adjusted so as to obtain maximum throughput under a given constraint of error probability. In addition to the case of diversity alone, we also evaluate the performances of the fixed hopping rate case with channel coding using convolutional code and BCH code.
IEICE transactions on communications E81-B(10):1912-1919