 Binary Phase-Shift-Keying 3.4.1 Constant Power Broadband Noise Jammer 3.4.2 Pulse Jammer Coded Direct-Sequence Spread Binary Phase-Shift-Keying 3.5.1 Interleaver and Deinterleaver 3.5.2 Unknown Channel State 3.5.2.1 Soft Decision Decoder 3.5.2.2 Hard Decision Decoder 3.5.3 Known Channel State 3.5.3.1 Soft Decision Decoder 3.5.3.2 Hard Decision Decoder Uncoded Frequency-Hopped Binary Frequency-Shift-Keying Contents 3.6.1 Constant Power Broadband Noise Jammer 3.6.2 Partial-Band Noise Jammer 3.6.3 Multitone Jammer Coded Frequency-Hopped Binary Frequency-Shift-Keying Interleaver/Hop Rate Tradeoff Receiver Noise Floor 3.10 Discussion 3.11 References Appendix 3A: Interleaving and Deinterleaving Chapter 4 General Analysis of Anti-Jam Communication Systems System Model Coded Bit Error Rate Bound Cutoff Rates Conventional Coherent BPSK DS/BPSK and Pulse Jamming Translation of Coded Error Bounds Conventional Non-Coherent MFSK 4.7.1 Uncoded 4.7.2 Coded 4.8 FH/MFSK and Partial-Band Jamming Diversity for FH/MFSK 4.10 Concatenation of Codes 4.10.1 Binary Super Channel 4.10.2 M-ary Super Channel 4.10.3 Reed-Solomon Outer Codes 4.11 Summary of Bit Error Bounds 4.11.1 DS/BPSK with Pulse Jamming 4.11.2 FH/MFSK with Partial-Band Noise Jamming 4.11.3 Coding Functions 4.12 References Appendix 4A: Chernoff Bound Appendix 4B: Factor of One-Half in Error Bounds Appendix 4C: Reed-Solomon Code Performance Chapter 5 Pseudonoise Generators The Storage/Generation Problem Linear Recursions 5.2.1 Fibonacci Generators 5.2.2 Formal Power Series and Characteristic Polynomials 5.2.3 Galois Generators 5.2.4 State Space Viewpoint 5.2.5 Determination of Linear Recursions from Sequence Segments Contents Memory-Efficient Linear Generators 5.3.1 Partial Fraction Decompositions 5.3.2 Maximization of Period for a Fixed Memory Size 5.3.3 Repeated Factors in the Characteristic Polynomial 5.3.4 M-Sequences Statistical Properties of M-Sequences 5.4.1 Event Counts 5.4.2 The Shift-and-Add Property 5.4.3 Hamming Distance Properties of Derived Real-Integer Seque