Maximum-likelihood diversity combining is investigated for an FFH/MFSK spread spectrum system in partial-band noise (PBN). The structure of maximum-likelihood diversity reception in PBN plus white Gaussian noise is derived. It is shown that signal-to-noise ratio and the noise variance at each hop have to be known to implement this optimum diversity combiner. Several suboptimum diversity combining schemes are also considered. The performance of the optimum combining scheme is evaluated. It is shown that adaptive gain control diversity combining actually achieves the optimum performance when interference is not very weak.

We derive a closed-form expression for the power spectral density of amplitude/phase-shift keyed bit sequences randomized through self-synchronizing scrambling when the source sequence is a stationary sequence of statistically independent bits. In addition to the dependence on the symbol pulse shape, duration, and the signal space values with which symbols are represented, we show that the power spectral density is dependent only on the probability of logic ones in the source bit stream, the period of the impulse response of the scrambling shift register, and the number of logic ones in this period. Our results confirm that optimum randomization results with use of primitive scrambling polynomials and poorest randomization occurs with "two-tap" polynomials of the form x/sup D/+1.

We derive several properties of guided scrambling (GS) encoders and the sequences they generate. We first highlight symmetrical aspects of the GS encoding mechanisms proposed to date, and then show that the existence of discrete components in the power spectrum of the pulse-amplitude-modulated encoded sequence can be predicted from the weight of the scrambling polynomial. We also show that with equiprobable source words, the block or continuous nature of the code has no effect on the statistics of the encoded sequence. We conclude by demonstrating how these properties simplify evaluation of the spectral characteristics of GS coded sequences.

In this paper, we investigate the application of the concatenated orthogonal/PN spreading scheme for a cellular direct sequence code-division multiple access (DS-CDMA) system with integrated traffic. The performance of the system is evaluated in terms of user capacity. In order to incorporate traffic with a wide range of source rates, line rates (adjusted data rates before spreading) have to be selected for transmission. For traffic with source rates higher than the line rate of concern, we propose the use of concatenated orthogonal/PN spreading sequences to subdivide a high rate stream into parallel line rate streams. Therefore, in this paper, we first analyze the properties of the concatenated orthogonal/PN spreading sequences. The results are used to evaluate their performance for homogenous voice traffic in various cellular mobile environments with multipath fading, lognormal shadowing, and path loss. Our results show that the proposed spreading scheme offers a significant improvement in the forward link capacity as compared to using the conventional nonconcatenated long PN sequence, especially if the multipath fading is Rician (e.g., microcellular and indoor picocellular systems). Incorporating the notion of line rate, we then evaluate the performance of a system with integrated voice and video traffic. Special emphasis is placed on the effect of line rate selection on the overall capacity which leads to the optimal selection of line rates.

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.

Guided scrambling (GS) is a line coding technique developed specifically for high bit rate fiber optic transmission systems. This paper continues the development of GS coding by introducing more scrambling polynomials that can be used with this technique. First, a method is presented for constructing polynomials which can be used with balanced encoding. Then it is shown that these polynomials can be used as bases for large families of polynomials, an expansion whose usefulness is demonstrated with the presentation of power spectra for several code configurations. These results indicate that polynomials can be selected from these families to exercise control over average as well as worst-case statistics of the encoded bit stream, a property not available with any other single efficient, balanced line coding technique developed to date. Criteria for polynomial selection are given, and polynomials are recommended for several GS code configurations.>

Analyzes the multi-cell multi-user interference through a new approach. The statistical effect of hand-off is considered. Differing from the Gaussian approximation, an efficient method for evaluating the performance of a system with small number of users is developed.

This paper considers the application of rate-adaptive coding (RAC) to a spread spectrum multiple access (SSMA) communication system. Specifically, RAC using a variable rate Reed-Solomon (RS) code with a single decoder is applied to frequency-hopped SSMA. We show that this combination can accommodate a larger number of users compared to that with conventional fixed-rate coding. This increase is a result of a reduction in the channel interference from other users. The penalty for this improvement in most cases is a slight increase in the delay (composed of propagation and decoding delay). The throughput and the undetected error probability for a M-ary symmetric channel are analyzed, and performance results are presented.>

In this letter, we consider the error correlation in differential phase-shift keying (DPSK) demodulation in terms of its effects on the block and decoded error probabilities. The exact block and decoded error probabilities are derived and computed for additive white Gaussian noise (AWGN). Comparisons are made with the approximate block and decoded error probabilities based on a memoryless model which ignores the error correlation. The effectiveness of interleaving in improving the error performance is addressed under various conditions. Both binary and nonbinary DPSK are studied.>

The performance of M-ary differential phase shift keying (MDPSK) in both tone jamming and Gaussian noise is presented. Previous work has been extended by considering larger signal sets and skewed differential phases with unequal decision regions. The error performance when a frequency offset exists between the jamming tone and MDPSK carrier is also considered.>

An error-correction scheme for an M-ary symmetric channel (MSC) characterized by a large error probability p/sub e/ is considered. The value of p/sub 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/sub 0/, where R/sub 0/ 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.>

Bit error probability evaluation of trellis-coded modulation (TCM) over fading channels is rather complicated, and the analytical results are limited to loose upper bounds leaving the system designer with the only option of simulation. Cavers and Ho (see IEEE Trans. Commun., vol.40, no.1, p.74-83, 1992) have derived an exact analytical expression for pairwise error-event probability. In this paper, using a different approach, the authors give an alternative method to compute the exact pairwise error event probability of TCM schemes in Rayleigh or Rician fading channels with perfect side information. For example, for a particular TCM scheme, they find the asymptotic difference between the exact and the upper bound of the pairwise error event probability to be 2.68 dB. As it turns out, for Rayleigh fading, the exact pairwise error probability can be calculated in closed-form. For the case of Rician fading, however, a closed-form expression is apparently impossible to obtain. It is observed that an accurate estimate of the bit error probability can be obtained by evaluating a sufficient number of pairwise error-event probabilities. Hence, this approach is a computationally feasible alternative to the simulation.>

The probability distribution of the received DPSK (differential phase-shift keying) signal under tone jamming is studied. The results should facilitate the analysis of the SFH/DPSK (slow frequency-hopped DPSK) system. The results given are more general than those previously published, in several aspects. First, the differential phase of the transmitted DPSK signal can assume any value. Second, probability distributions are derived instead of a set of probabilities calculated over certain symmetrical regions. This allows analyzing performance for arbitrary selected decision regions as well as determining optimum decision regions for demodulating the DPSK signal. Third, the joint probability distribution of both the magnitude and differential phase of the jammed DPSK signal is given. This can be used in the analysis where both tone jamming and Gaussian noise are considered. These results are used to analyze the error probability performance of a general uncoded SFH/DPSK signal under worst-case tone jamming and Gaussian noise.>

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.>

The complexity of the algorithm is shown to be asymptotically equal to that of the Viterbi algorithm and is very close for practical noisy channels. The latter is shown by means of computer simulation. The algorithm can be applied directly in an environment where soft-decision decoding is required or preferred. However, depending on the environment, some simplifications may be possible and/or necessary, resulting in suboptimal algorithms. Codes suitable for use with the algorithm should have short total memory length.>

Importance sampling (IS) is a useful technique for reducing the number of Monte Carlo trials in BER estimation. Two important aspects of recent research work in this area are to find more applications of IS BER estimation and to seek a good bias scheme in the implementation of the estimator. This correspondence presents a general and rigorous mathematical description of these aspects of this problem which, we hope, will be useful for further research. We also present a general result on how to choose a good bias scheme which may provide some insight into the problem.