In fast frequency hopped (FFH) non-coherent MFSK systems, the diversity combining scheme can be used effectively in order to combat the interference, especially jamming noise. In this paper, we simulate and discuss the BER performance of FH/MFSK system for different diversity combining schemes, such as linear combining, clipped-linear combining, normalized envelop detection (NED), order statistics (OS) NED and product combining receiver (PCR), in the presence of both the worst case partial band jamming (PBJ) and the fading channel. The performances of those combining schemes except for linear combining are similar each other in the worst case PBJ without the fading. In the existence of both the worst case PBJ and the fading channel, the clipped-linear combining scheme suffers a larger drop in performance than other combining schemes. It is noteworthy that the performances of OSNED and PCR are the best in Rayleigh fading channel among those combining schemes.

A simple near-orthogonal code is used as frequency-hopping patterns for the frequency-hopped multiple access systems. Extended RS code is used as channel coding to deplete the effects of hits from simultaneous users. Packet error probability and channel throughput for the system utilizing the near-orthogonal code are evaluated and compared to the corresponding values obtained from the system utilizing random patterns. Results show that the former can provide substantial improvement over the latter. In our illustrated examples, we also show that under the constraint of packet error probability PE 10-2, the maximum achievable number of users with most (n,k) RS codes of interest is less than the number of distinct codewords in the near-orthogonal code. Thus, the number of codewords of the near-orthogonal code is large enough to support the practical application.

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.

This paper presents the performance of FH/MFSK systems, which exploit silent gaps in speech to accommodate more users, over Rayleigh fading channels. Two kinds of receivers are considered: one uses a threshold on the received signal strength to declare whether the signals were present or not, and the other is assumed to have perfect transmitter-state information obtained from using additional bandwidth. Results show that, if the codeword dropping and codeword error are assumed to be equally costly, the former can achieve slightly better performance than the latter in the decoding error probability. This finding suggests that, for the system to exploit silent gaps in speech, it is advantageous for the receiver to use a threshold to declare whether signals were present or not instead of relying on the transmitter-state information.