Title:
Foundations of communications electronic warfare
Personal Author:
Series:
Artech House electronic warfare library
Publication Information:
London : Artech House, 2008
Physical Description:
xvi, 444 p. : ill. ; 24 cm.
ISBN:
9781596933910
Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010183219 | UG590 P66 2008 | Open Access Book | Book | Searching... |
On Order
Table of Contents
Preface | p. xv |
Chapter 1 Introduction to Jamming | p. 1 |
1.1 Introduction | p. 1 |
1.1.1 Electronic Support | p. 1 |
1.1.2 Electronic Attack | p. 2 |
1.1.3 Electronic Protect | p. 2 |
1.2 Information Warfare | p. 3 |
1.3 Communications and EW | p. 4 |
1.3.1 Channel State Information | p. 5 |
1.4 Information Theory | p. 6 |
1.5 Game Theory | p. 6 |
1.6 EW Measures of Effectiveness | p. 7 |
1.7 Concluding Remarks | p. 7 |
References | p. 8 |
Chapter 2 Mathematical Preliminaries | p. 11 |
2.1 Introduction | p. 11 |
2.2 Mathematical Sets | p. 11 |
2.3 The Algebra of Sets | p. 16 |
2.3.1 Groups | p. 16 |
2.3.2 Rings | p. 17 |
2.3.3 Fields | p. 18 |
2.3.4 Borel Fields | p. 19 |
2.4 Mathematical Theory of Probability | p. 20 |
2.4.1 Probability Space | p. 21 |
2.4.2 Binomial Distribution | p. 28 |
2.4.3 Poisson Distribution | p. 30 |
2.5 Random Variables | p. 30 |
2.5.1 Discrete and Continuous Random Variables | p. 31 |
2.5.2 Expectation | p. 32 |
2.5.3 Mean Squared Value | p. 34 |
2.5.4 Variance | p. 34 |
2.5.5 Law of Large Numbers | p. 35 |
2.5.6 Multivariate Probabilities | p. 37 |
2.5.7 Sums of Random Variables | p. 38 |
2.5.8 Characteristic Function | p. 39 |
2.5.9 Adding Probability Densities | p. 40 |
2.5.10 Adding Gaussian Variables | p. 41 |
2.5.11 Properties of the Sum of a Large Number of Random Variables | p. 41 |
2.6 Concluding Remarks | p. 43 |
References | p. 43 |
Chapter 3 Properties of Signals and Systems | p. 45 |
3.1 Introduction | p. 45 |
3.2 Fourier Series | p. 45 |
3.2.1 Fourier's Theorem | p. 45 |
3.2.2 Power and Parseval's Theorem | p. 47 |
3.2.3 Fourier Transforms | p. 49 |
3.2.4 Finite Power, Infinite Duration Signals | p. 52 |
3.3 Transmission of Signals Through Linear Systems | p. 54 |
3.3.1 Linear Systems | p. 54 |
3.3.2 Impulse Response Function | p. 55 |
3.3.3 Convolution | p. 56 |
3.3.4 The Convolution Theorem | p. 56 |
3.3.5 The Transfer Function | p. 57 |
3.3.6 Nyquist Sampling Theorem | p. 58 |
3.3.7 Signal Reconstruction | p. 62 |
3.3.8 Causality | p. 63 |
3.4 Intersymbol Interference | p. 63 |
3.5 The Autocorrelation Function and Power Spectrum | p. 68 |
3.5.1 Stationary Processes | p. 68 |
3.5.2 Correlation Functions | p. 68 |
3.6 Detection and Estimation Theory | p. 71 |
3.6.1 Bayes' Decision Theory | p. 72 |
3.6.2 Neyman-Pearson Hypothesis Testing | p. 79 |
3.7 Concluding Remarks | p. 83 |
References | p. 83 |
Chapter 4 Digital Communication Systems | p. 85 |
4.1 Introduction | p. 85 |
4.2 Digital Systems | p. 85 |
4.2.1 Performance Parameters | p. 88 |
4.2.2 Source Encoder and Decoder | p. 89 |
4.2.3 Channel Encoder and Decoder | p. 95 |
4.2.4 Modulation and Demodulation | p. 98 |
4.2.5 Symbol Transmission | p. 121 |
4.3 Encryption | p. 130 |
4.3.1 Cryptologic Architectures | p. 131 |
4.3.2 Pretty Good Privacy | p. 132 |
4.3.3 Digital Signatures | p. 133 |
4.4 Concluding Remarks | p. 135 |
References | p. 135 |
Chapter 5 Information Theory and Electronic Warfare | p. 137 |
5.1 Introduction | p. 137 |
5.2 Discrete Spaces | p. 138 |
5.2.1 Data Sources | p. 139 |
5.2.2 Information | p. 139 |
5.2.3 Mutual Information | p. 141 |
5.2.4 Entropy | p. 143 |
5.2.5 Memoryless Versus Markovian Symbols | p. 147 |
5.2.6 Properties of Entropy | p. 148 |
5.2.7 Information Rate | p. 151 |
5.2.8 Communicating Via a Channel: The Channel Matrix | p. 152 |
5.3 Continuous Spaces | p. 152 |
5.3.1 Optimum Jamming Waveform with Fixed Jammer Power | p. 154 |
5.3.2 A Digression | p. 160 |
5.4 Data Processing Theorem | p. 161 |
5.5 EW Channel Models | p. 163 |
5.5.1 Introduction | p. 163 |
5.5.2 Discrete Memoryless Channels | p. 164 |
5.5.3 Channel Capacity | p. 165 |
5.5.4 Binary Channel | p. 169 |
5.5.5 Compound Discrete Memoryless Channels | p. 174 |
5.5.6 Discrete Memoryless Arbitrary Varying Channels | p. 175 |
5.5.7 Hybrid Discrete Memoryless Channels | p. 176 |
5.5.8 Erasure Channels | p. 177 |
5.5.9 Continuous Channels | p. 178 |
5.5.10 Channels with Memory | p. 179 |
5.6 Rate Distortion Theory | p. 184 |
5.7 Concluding Remarks | p. 188 |
References | p. 188 |
Appendix 5A Neyman-Pearson Test for the Binary Channel | p. 190 |
Chapter 6 Source Coding | p. 199 |
6.1 Introduction | p. 199 |
6.2 Principles of Source Coding | p. 199 |
6.2.1 Coding Rate | p. 201 |
6.2.2 Compression Factor | p. 201 |
6.2.3 Source Specific Versus Universal Coding | p. 202 |
6.3 Coding | p. 202 |
6.3.1 Efficiency and Redundancy of a Code | p. 202 |
6.3.2 Gray Coding | p. 203 |
6.3.3 Huffman Coding | p. 204 |
6.3.4 Reducing Redundancy by Combining Symbols | p. 206 |
6.3.5 Shannon-Fano Coding | p. 206 |
6.3.6 Lempel-Ziv Coding | p. 208 |
6.4 Concluding Remarks | p. 209 |
References | p. 210 |
Chapter 7 Channel Coding and Electronic Warfare | p. 211 |
7.1 Introduction | p. 211 |
7.2 The Digital Communication Channel | p. 212 |
7.3 Encoding | p. 214 |
7.3.1 The Sequential Encoder | p. 215 |
7.3.2 Encoder and Decoder Architecture | p. 217 |
7.4 Error Detection and Correction | p. 219 |
7.4.1 Error Control | p. 220 |
7.5 Linear Block Codes | p. 223 |
7.5.1 Linear Codes | p. 224 |
7.6 Convolutional Codes | p. 228 |
7.6.1 Code Rate | p. 229 |
7.6.2 Convolution | p. 229 |
7.6.3 Encoding Process | p. 230 |
7.6.4 The Trellis | p. 233 |
7.6.5 Decoding Process-Viterbi Algorithm | p. 233 |
7.7 Hard Versus Soft Decisions | p. 239 |
7.8 Decision Metrics | p. 241 |
7.8.1 Side Information | p. 243 |
7.8.2 Coded Bit Error Rate Bound | p. 243 |
7.9 Punctured Convolutional Coding | p. 246 |
7.10 Trellis-Coded Modulation | p. 247 |
7.11 Communication Systems in Jamming | p. 248 |
7.12 Concluding Remarks | p. 252 |
References | p. 253 |
Chapter 8 Jammer Performance in Noisy, Fading Channels | p. 255 |
8.1 Introduction | p. 255 |
8.2 Fading Channels | p. 256 |
8.2.1 Factors Affecting Fading | p. 258 |
8.2.2 Types of Fading | p. 262 |
8.3 Jamming Performance for Binary Modulations in Slowly Fading Channels and AWGN | p. 268 |
8.3.1 Slow, Flat Fading | p. 268 |
8.3.2 Binary Phase Shift Keying | p. 270 |
8.3.3 Binary Frequency Shift Keying | p. 276 |
8.4 Jamming Effects on Channel Capacity | p. 285 |
8.5 Higher-Order Phase Modulations | p. 287 |
8.5.1 QPSK | p. 287 |
8.5.2 M-ary PSK | p. 288 |
8.6 Concluding Remarks | p. 290 |
References | p. 290 |
Chapter 9 Jamming Performance Evaluation Using Dynamic, Noncooperative Games | p. 293 |
9.1 Introduction | p. 293 |
9.2 Game Playing | p. 293 |
9.3 Minimax Principle | p. 295 |
9.3.1 Minimax Algorithm | p. 298 |
9.4 Games | p. 298 |
9.4.1 Game Taxonomy | p. 298 |
9.4.2 Nash Equilibrium | p. 299 |
9.4.3 Prisoner's Dilemma | p. 300 |
9.5 Strategies | p. 300 |
9.5.1 Jammer Performance Against On-Off Keyed Communication Systems | p. 305 |
9.5.2 Jamming Performance Against Coherent Binary Shift Key | p. 309 |
9.6 Jammer Performance with Thermal Energy Constraints | p. 311 |
9.6.1 Finite Horizon Game | p. 316 |
9.6.2 Infinite Horizon Game | p. 320 |
9.7 Minimax Detection of Frequency Hopping Targets | p. 327 |
9.8 Concluding Remarks | p. 330 |
References | p. 331 |
Chapter 10 Noise Jamming | p. 333 |
10.1 Introduction | p. 333 |
10.2 Additive White Gaussian Noise Channels | p. 333 |
10.3 Gaussian Arbitrarily Varying Channels | p. 335 |
10.4 Power Constraints | p. 338 |
10.5 Jamming Performance Without Real-Time Electronic Support | p. 349 |
10.5.1 Arbitrary and Binary Channel Inputs | p. 349 |
10.5.2 Other Objective Functions | p. 353 |
10.6 Jammer Performance with Electronic Support Information | p. 355 |
10.7 Convolutional Coding | p. 362 |
10.8 Concluding Remarks | p. 363 |
References | p. 365 |
Chapter 11 Pulsed Noise Jamming | p. 367 |
11.1 Introduction | p. 367 |
11.2 Hard Decision Receivers | p. 368 |
11.2.1 Jamming of CBPSK, DBPSK, CBFSK, and NCBFSK Signals | p. 368 |
11.3 Soft Decision Receiver, CBPSK Signals | p. 380 |
11.3.1 Optimum Soft Decision Receiver, Known JSI | p. 380 |
11.3.2 Jamming Performance against a Soft Decision Receiver and Unknown Jammer State Information and CBPSK Modulation | p. 386 |
11.3.3 Discussion | p. 389 |
11.4 Pulsed Noise Jamming of Coded CBPSK Signals | p. 390 |
11.4.1 Pulsed Noise Jamming of CBPSK | p. 390 |
11.4.2 Pulsed Noise Jamming Performance Against CBPSK with Convolutional Codes-Soft Decision | p. 393 |
11.4.3 Jamming Performance Against R = 1/2, K = 7 Convolutionally Coded CBPSK | p. 395 |
11.5 Mutual Information Objective Function-Hard Decision | p. 396 |
11.6 Concluding Remarks | p. 397 |
References | p. 398 |
Chapter 12 Tone Jamming | p. 401 |
12.1 Introduction | p. 401 |
12.2 Continuous Tone Jamming | p. 401 |
12.2.1 Hard Decision Receivers | p. 403 |
12.2.2 Soft Decision Receivers | p. 410 |
12.3 Pulsed Tone Jamming | p. 413 |
12.3.1 Hard Decision Receiver and Pulsed Tone Jammer | p. 413 |
12.3.2 Hard Decision Receiver, Tone Jamming, Frequency Mismatch | p. 415 |
12.3.3 Soft Decision Receiver with Pulsed Tone Jamming | p. 417 |
12.4 Concluding Remarks | p. 420 |
References | p. 421 |
Appendix A Introduction to the Calculus of Variations | p. 423 |
A.1 The Euler Equation | p. 423 |
A.2 Functions and Extreme Points | p. 424 |
A.3 Applications of the Euler Equation | p. 427 |
A.4 The Fundamental Lemma of the Calculus of Variations | p. 432 |
References | p. 432 |
List of Acronyms | p. 433 |
About the Author | p. 437 |
Index | p. 439 |