Combined tone and noise jamming against coded FH/MFSK ECCM radios

The authors conjecture that a proper combination of partial-band tone jamming (PBTJ) and full-band noise jamming (FBNJ) under a given total jamming power constraint may be more effective than PBTJ alone, not only for the case with a low (E_s/N_J), but also for the case with high E_s/N_J, since the FBNJ can corrupt the jamming state information (JSI). Assuming this combination of PBTJ and FBNJ jamming, they consider three cases of receiver processing-the hard decision (HD) metric without JSI, the HD metric with perfect JSI, and the maximum-likelihood (ML) metric using Viterbi's ratio threshold (VRT) to generate a 1-b symbol decision quality indicator. System performance is evaluated in terms of the Chernoff bound on the probability of symbol error. From extensive numerical analysis the authors conclude that, for the case of the HD metric without JSI, PBTJ-only jamming is the worst form of jamming, as expected, since the receiver does not use JSI at all; for the other cases, a combination of PBTJ and FBNJ is the worst, with the worst ratio of PBTJ power to FBNJ power a function of the values of M and E_s/N_J     

Diversity and coding for FH/MFSK systems with fading and jamming.II. Selective diversity

For pt.1 see ibid., vol.COM-35, p.1329-41 (1987). A performance evaluation is presented for selective diversity with feedback for frequency-hopping M-ary frequency-shift-keyed systems operating over Rayleigh faded channels in the presence of partial-band noise and partial-band tone jamming. The behavior of uncoded and coded systems is studied. For coded systems, the performance is evaluated for hard-decision receivers without channel state information and soft-decision receivers with perfect jammer state information. The results demonstrate that the performance of uncoded FH/MFSK with selective diversity is unacceptable. However, this diversity technique can offer definite improvements for coded FH/MFSK systems. Specifically, the effectiveness of selective diversity signaling depends on the provision of a feedback channel between the transmitter and receiver to provide the transmitter with the fading gains of the independently faded channels. To obtain an improvement from the selective diversity signaling scheme described here, there must be multiple independently faded channels between the transmitter and receiver. If not, the performance of the selective diversity signaling scheme will be identical to the performance of FH/MFSK without diversity     

Effect of worst case multiple partial-band noise and tone jammerson coded FH/SSMA systems

The author characterizes and evaluates the effect of simultaneous multiple partial-band noise or tone jammers and other user interference on a single communication link employing frequency-hopped spread-spectrum (FH/SS) signaling, M-ary frequency-shift keying (FSK) modulation with noncoherent demodulation, and Reed-Solomon coding. For the symbol error probability of these systems, the author derives exact expressions in the absence of multiple-access interference and tight upper bounds in the presence of other-user interference. Although the analytical methods are valid for any number of multiple jammers, the numerical study is restricted to the cases of two and three-partial-band noise and tone jammers. For fixed values of the spectral densities of noise jammers, or the energies per symbol of tone jammers, the worst-case fraction of the band that each jammer should use in order to maximize the error probability of the FH/SS or FH/SSMA system is evaluated. For the range of the signal-to-jammer power ratios examined, multiple-noise or multiple-tone jammers appear to have no advantage over single-tone jammers of equivalent spectral density or energy per symbol, but achieve approximately the same worst-case performance by jamming smaller fractions of the band     

Error-correcting codes and nonlinear diversity combining againstworst case partial-band noise jamming of frequency-hopping MFSK systems

Error probability analyses are performed for a coded M-ary frequency-shift keying system (MFSK) using L hops per M-ary word frequency-hopping spread-spectrum waveforms transmitted over a partial-band Gaussian noise jamming channel. The bit error probabilities are obtained for a square-law adaptive gain control receiver with forward-error-control coding under conditions of worst-case partial-band noise jamming. Both thermal noise and jamming noise are included in the analyses. Performance curves are obtained for both block codes and convolutional codes with both binary and M-ary channel modulations. The results show that thermal noise cannot be neglected in the analysis if correct determinations of the optimum order of diversity and the worst-case jamming fraction are to be obtained. It is shown that the combination of nonlinear combining, M -ary modulation, and forward-error-control coding is effective against worst-case partial-band noise jamming     

Performance of fast frequency hopped noncoherent MESK witha fixed hop rate under worst case jamming

The performance of fast-frequency-hopped M-ary frequency-shift keying with a fixed hop rate is evaluated, utilizing the Chernoff union bound method. The performance criterion used is a throughput measure i.e., an information rate sustained by a system for a given bit error rate, normalized by the hop rate. Both uncoded and coded systems are considered. It is shown using the cutoff rate argument that coding can provide a few dB gain in throughput. This is confirmed by the performance evaluation of various convolutional and block codes. Both partial-band noise jamming and multitone jamming with one tone per M -ary band are considered. Jamming parameters are assumed to be the worst case against the coding channel. Determination of the optimum M is also addressed     

Convolutionally coded frequency-hopping communications withnonideal interleaving

The interleaving span of coded frequency-hopped (FH) systems is often constrained to be smaller than the decoder memory length, i.e. nonideal interleaving is performed. An upper bound on the performance of a Viterbi decoder of a convolutional code with nonideal interleaving is presented. A soft decision diversity combining technique is introduced, and the performance of combined convolutional and diversity coding subject to worst-case partial band noise jamming is investigated. Optimization of the FH system performance subject to constraints of allowed delay and synthesizer settling time provides the best combination of interleaving span and hopping rate. The FH system considered employs M-ary frequency-shift key (MFSK) modulation and noncoherent demodulation with 2-b soft decision based on Viterbi's ratio-threshold technique     

Throughput analysis of a slotted frequency-hop multiple-accessnetwork

A link throughput analysis is presented for a slotted frequency-hop multiple-access (FHMA) packet radio network (PRN) operating in the presence of background noise, partial-band noise jamming, and partial-band tone jamming. The PRN consists of an arbitrary number of transceivers arranged in a paired-off topology. Forward error-correction coding is used for packet protection. M-ary FSK modulation is used with hard-decision decoding. Expressions are derived for the link throughput in terms of the channel cutoff rate and capacity. The dependency of the optimal processing gain, code rate, and jamming fraction on the population size, traffic intensity, bit energy to background noise ratio, and bit energy to jammer noise ratio is examined in detail. It is shown that a properly designed (optimized) PRN using random-access FHMA offers a significantly larger heavy-load throughput than a random-access frequency-division multiple-access PRN     

Performance of multitone FFH/MFSK systems in the presence ofjamming

A novel type of diversity signaling for an M-ary frequency-shift keyed modulation format involving the transmission of multiple tones on each diversity branch is considered. The properties of such a system are investigated, and its performance in the presence of tone jamming is analyzed. It is shown that significant gains can be realized with such a technique. The performance in the presence of worst-case partial band noise is briefly considered and shown to be worse than, though comparable to, that of the single-tone case     

Performance of robust metrics with convolutional coding anddiversity in FHSS systems under partial-band noise jamming

The performance of robust metrics (metrics that can be computed from the outputs of the matched filters only) with convolutional coding and diversity under worst-case partial-band noise jamming is analyzed. Both binary and dual-k convolutional codes employing these metrics with diversity are compared via Union-Chernoff bounds. The performances of metrics considered in the literature that assume perfect side-information are given for comparison purposes. It is found that there exist very good robust metrics that provide performance comparable to metrics using perfect side-information. Among the robust metrics considered, the self-normalized metric offers the best performance and achieves performance practically identical to that of the square-law-combining metric with perfect side-information for M=8     

Frequency-hopped spread spectrum in the presence of a followerpartial-band jammer

A countermeasure to a partial-band follower jammer is proposed for frequency-hopped spread-spectrum communications. This technique randomizes the transmission technique used by the transmitter (and receiver). Either the information is carried by M tones which are transmitted in a frequency slot, or by M frequency slots which contain signal energy. As a counter-countermeasures, the jammer randomizes between jamming the same frequency slot being used by the communicator, or jamming a subset of the slots not being used by the communicator. The performance for randomized strategies for the communicator and jammer is investigated. It is shown that the proposed technique enhances the system's performance     

Asymptotic performance of M-ary orthogonal signals inworst case partial-band interference and Rayleigh fading

It is shown that for worst-case partial-band jamming, the error probability performance (for fixed E_b/N_I) becomes worse with increasing M for (M>16). The asymptotic probability-of-error is not zero for any E_b/N _I(>ln 2), but decreases inverse linearly with respect to it. In the fading case, the error-probability performance (for fixed E_b/N₀) improves with M for noncoherent detection, but worsens with M for coherent detection. For large E_b/N₀ the performance of the Rayleigh fading channel asymptotically approaches the same limit as the worst case partial-band jammed channel. However, for values of M at least up to 4096, the partial-band jammed channel does better. While it is unlikely that an M-ary orthogonal signal set with M>1024 will be used in a practical situation, these results suggest an important theoretical problem; namely, what signal set achieves reliable communication     

M×N Booth encoded multiplier generatorusing optimized Wallace trees

The architecture of a design method for an M-bit by N -bit Booth encoded parallel multiplier generator are discussed. An algorithm for reducing the delay inside the branches of the Wallace tree section is explained. The final step of adding two N±M-1-bit numbers is done by an optimal carry select adder stage. The algorithm for optimal partitioning of the N ±M-1-bit adder is also presented     

Asymptotically optimal classification for multiple tests withempirically observed statistics

The decision problem of testing M hypotheses when the source is Kth-order Markov and there are M (or fewer) training sequences of length N and a single test sequence of length n is considered. K, M, n, N are all given. It is shown what the requirements are on M , n, N to achieve vanishing (exponential) error probabilities and how to determine or bound the exponent. A likelihood ratio test that is allowed to produce a no-match decision is shown to provide asymptotically optimal error probabilities and minimum no-match decisions. As an important serial case, the binary hypotheses problem without rejection is discussed. It is shown that, for this configuration, only one training sequence is needed to achieve an asymptotically optimal test     

Repeated convolutional codes for high-error-rate channels

An error-correction scheme for an M-ary symmetric channel (MSC) characterized by a large error probability p_e is considered. The value of p_e can be near, but smaller than, 1-1/M, for which the channel capacity is zero, such as may occur in a jamming environment. The coding scheme consists of an outer convolutional code and an inner repetition code of length m that is used for each convolutional code symbol. At the receiving end, the m inner code symbols are used to form a soft-decision metric, which is passed to a soft-decision decoder for the convolutional code. The effect of finite quantization and methods to generate binary metrics for M>2 are investigated. Monte Carlo simulation results are presented. For the binary symmetric channel (BSC), it is shown that the overall code rate is larger than 0.6R₀, where R₀ is the cutoff rate of the channel. New union bounds on the bit error probability for systems with a binary convolutional code on 4-ary and 8-ary orthogonal channels are presented. For a BSC and a large m, a method is presented for BER approximation based on the central limit theorem     

Optimisation of parameters in an MFSK transmission system

An optimisation technique for maximising the information throughput of an M-ary frequency-shift keyed (MFSK) transmission system is described. An upper bound for the error-free throughput of the system in the presence of additive white Gaussian noise (AWGN) for different numbers of tones, M, is derived. From this, the optimum range for M can be identified     

Limiter-differential detection of a frequency-hopped CPFSKdiversity system in partial-band jamming

The error probability achieved by a differential detector with a bandpass limiter preceding the receiver is analyzed for a slow-frequency-hopped CPFSK diversity waveform transmitted over a partial-band noise jamming channel, and is compared to the system's performance without the bandpass limiter. The system's thermal noise is not neglected in the analysis. In principle, each bit is repeated on L different hops, and for the FH/CPFSK system analyzed, these repetitions are combined to yield a soft decision. The main result is that a diversity gain for error rate improvement in worst-case partial-band jamming is realized with the detector preceded by a limiter, but not without the limiter. This is shown by considering the error probability for L=2 in comparison with that for L=1     

Packet error probabilities in frequency-hopped spread-spectrumpacket radio networks-memoryless frequency-hopping patterns considered

The packet error probability induced in a frequency-hopped spread-spectrum packet radio network is computed. The frequency spectrum is divided into q frequency bins. Each packet is exactly one codeword from an (M, L) Reed-Solomon code [M=number of codeword symbols (bytes); L=number of information symbols (bytes)]. Every user in the network sends each of the M bytes of his packet at a frequency chosen among the q frequencies with equal probability and independently of the frequencies chosen for other bytes (i.e., memoryless frequency-hopping patterns). Statistically independent frequency-hopping patterns correspond to different users in the network. Provided that K users have simultaneously transmitted their packets on the channel and a receiver has locked on to one of these K packets, the probability that this packet is not decoded correctly is evaluated. It is also shown that although memoryless frequency-hopping patterns are utilized, the byte errors at the receiver are not statistically independent; instead they exhibit a Markovian structure     

Velocity filters for multiple interference attenuation ingeophysical array data

The problem of velocity filtering a record of seismic data with the objective of extracting a desired signal by attenuating the coherent interferences traveling at different velocities is considered. A two-dimensional (N-input (N-M+1)-output) processing scheme is used where the (N-M+1) output traces are generated from the N-input traces by multichannel processing of overlapping subsets of M-input races. Each output is generated by using a vector of multichannel arrays filters designed to attenuate multiple coherent interference and random noise. The two-dimensional frequency-wavenumber expression corresponding to the proposed multiple-input-multiple-output processing scheme is derived so that it can be implemented using the two-dimensional fast Fourier transform. Two illustrative examples are included     

Upper bounds on the probability of error for M-aryorthogonal signaling in white Gaussian noise

The optimum detection of M orthogonal equiprobable equal-energy signals in additive white Gaussian noise is considered, and two upper bounds for the probability of error are derived. The behavior of these bounds is discussed and they are compared with previously known bounds for various values of signal-to-noise ratio and M. Some numerical results are presented     

Theory and operation of a GaAs/AlGaAs/InGaAs superlatticephototransistor with controlled avalanche gain

The principle of operation of a bipolar transistor with controlled multiplication of one type of carrier is outlined. The ideal device, with a few periods of a staircase superlattice in the base-collector depletion region, has high current outputs at extremely low bias voltages and high current gains. The principle is experimentally demonstrated in a GaAs/AlGaAs/InGaAs phototransistor where three periods of a periodic pseudomorphic structure, in which electrons should predominantly multiply, are included in the collector depletion region. Independent measurements of the electron and hole avalanche multiplication rates, M_n and M_p, in these structures confirm that M_n/M_p M_n/M_p and α/β are ~2-4, depending on bias voltage. The observed photocurrent characteristics agree reasonably well with Monte Carlo calculations made to simulate the transport of electrons through the collector region. Measured optical gains are as high as 142 in an n-p-n phototransistor with a 2000-Å p-base region