Perfect Side Information Research Articles

Erasure insertion in frequency-hop communications with fading and partial-band interference

The use of block coding and errors-and-erasures decoding can enhance performance substantially in frequency-hop communication systems, provided that a good scheme is employed to determine which symbols to erase. In this paper, methods for determining erasures derived from Bayesian decision theory are applied to the mitigation of fading and partial-band interference. The performance of receivers using the Bayesian technique is compared with that of receivers that make erasure decisions using Viterbi's (1982) ratio-threshold test. The performance of hard-decision demodulation and the theoretical performance of receivers with access to perfect side information are also compared. It is found that the Bayesian receiver provides the best performance, and that error probabilities for the Bayesian receiver are lower than those for hard-decision demodulation by as much as six orders of magnitude.

Performance of chip coding in FFH SSMA systems

This paper proposes chip coding using convolutional codes for fast frequency-hopping spread-spectrum multiple-access (FFH-SSMA) systems. Its performance is evaluated and compared with that of repetition coding which is most commonly used in FFH systems. In our proposal, an information symbol is encoded by a convolutional code of rate 1/n and n chips are transmitted through a frequency hopper. We consider three models when perfect side information (PSI) is available, no side information (NSI) is available, and the ratio threshold test (RTT) is used. The probability density functions (PDFs) of the received signal are derived for asynchronous hopping systems. The performances of convolutional coding with threshold decoding and Viterbi decoding are presented under the constraint of fixed total bandwidth and information bit rate. In comparison with repetition codes, it is found that convolutional codes drastically enhance the system performance. It is identified that Viterbi decoding with RTT offers the most significant performance improvement.

Performance of robust metrics with convolutional coding and diversity 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 multiple access communications with coding and side information

The authors consider frequency-hopped spread-spectrum multiple-access communications using M-ary modulation and error-correction coding. The major concerns are multiple-access interference and the network capacity in terms of the number of users that can transmit simultaneously for a given level of codeword error probability. Block coding is studied in detail. The authors first consider the use of Q-ary Reed-Solomon (RS) codes in combination with M-ary modulation with mismatched alphabets so that Q>M. It is shown that the network capacity is drastically reduced in comparison with the system with matched alphabets. As a remedy, the use of matched M-ary BCH codes is proposed as an alternative to mismatched RS codes. It is shown that when the number of users in the system is large, a BCH code outperforms an RS code with a comparable code rate and decoding complexity. The authors consider the use of a robust technique for generation of reliable side information based on a radio-threshold test. They analyze its performance in conjunction with MFSK and error-erasure correction decoding. It is shown that this nonideal ratio-threshold method can increase the network capacity in comparison with the system with perfect side information. >

Probability of error in frequency-hop spread-spectrum multiple-access communication systems with noncoherent reception

Expressions are developed for the probability of error for asynchronous frequency-hop spread-spectrum multiple-access networks using Markov hopping patterns and binary frequency shift keying (BFSK) with one symbol transmitted per hop. The expressions are exact when there is one interfering user and orthogonal BFSK is used. They provide excellent approximations when there are more than one interfering user. It is also shown that the error probability when Markov hopping patterns are used is a good approximation to the error probability when memoryless hopping patterns are used. By computing the channel capacity and the associated throughput, a simple hard decision receiver is shown to perform much better than a receiver using perfect side-information to erase the symbols transmitted on hops that were hit when all the users have the same power and one binary symbol is transmitted per hop.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Limiting performance of frequency-hop random access

The multiple-access capability of asynchronous frequency-hop packet-radio networks is analyzed. The only interference considered is multiple-access interference, and perfect side information is assumed. Bounds on the probability of error for unslotted systems are developed based on the distributions of the maximum and minimum interference levels over the duration of a given packet, and these are employed to develop corresponding bounds on the throughput. The idealized model makes possible the derivation of asymptotic results showing the convergence of these bounds for high traffic levels. The asymptotic performance of the system is seen to be the same as that of the corresponding slotted system. Results for the maximum asymptotic throughput are also obtained. These results show that the asymptotic sum capacity of the channel can be attained using Reed-Solomon coding. All these results are valid for either fixed or exponentially distributed packet lengths. The results indicate that the performance of frequency-hop networks is insensitive both to the distribution of packet lengths and to whether or not transmissions are slotted. It also demonstrates the efficacy of Reed-Solomon coding in combating multiple-access interference. >

Clipped diversity combining for channels with partial-band interference. II. Ratio-statistic combining

For pt.I see ibid., vol.COM-3, no.12, p.1320 (1987). Ratio-statistic combining is proposed for mitigating partial-band interference in systems with diversity transmission and frequency-hop signaling. Systems with noncoherent demodulation and binary orthogonal signaling are covered. The partial-band interference is Gaussian, and Gaussian quiescent noise is included in the analysis to account for wideband noise sources. The exact probability of error is found for a receiver using ratio-statistic combining, and this is compared to the exact error probabilities for receivers with optimum combining with perfect side information, clipped-linear combining, the ratio-threshold test with majority-logic decoding, and self-normalization diversity combining. Numerical results are also given for a frequency-hop system which uses ratio-statistic combining for channels with Rayleigh fading and partial-band interference. It is determined that ratio-statistic combining is an excellent diversity combining scheme for systems with partial-band interference and fading. >