ame result is also shown for worst case partial- band noise jamming in Part 2, Chapter 2. Assume that m FH/BFSK tones are transmitted for each data bit. In par- ticular assume the simple repeat m code where for each data bit, m identi- cal BFSK tones are sent where each of these tones are hopped separately. Referring to these tones or codeword components as "chips," m chips make up a single data bit. The chip duration is (3.85) Requiring each of the chip tones to be orthogonal results in the total num- ber of orthogonal chip tones to be N = WSST = WssTb/m (3.86) with is m times smaller than the uncoded case. As before, assume the jam- mer sends multiple tones where the number of jammer tones is still given by (3.81). Again, choose S = S SO that t he probability that a particular chip tone position is jammed is given by (3.87) After dehopping, the receiver is assumed to detect the energy in each of the two possible chip tone frequencies for every T second interval. The decoder adds up the chip energies for each of the two possible BFSK fre- quencies and makes a decision based on which of these has more total energy. In this case, an error is made only if a jammer tone occurs in all m of the chip tone frequencies corresponding to the BFSK frequency that was not transmitted. This occurs with probability Pb=8m (3.88) since each chip is independently hopped. Coded Frequency-Hopped Binary Freqency-Shift-Keying This analysis ignored the effects of jamming tones occurring in the same frequencies as the transmitted chips. Also, it could have considered the cases where the jammer tone power SJ is larger than S SO that fewer than m jammed tones could still cause an error. These more general cases are exam- ined in detail in Part 2, Chapter 2. The bit error probability given in (3.88) is plotted in Figure 3.26 for var- ious values of m. The m = 1 case is the uncoded case considered in the pre- vious section. Note that there exists a value of m that achieves a bit error probability close to the baseline case of broadband nois