Dariush Divsalar

Improved parallel interference cancellation for CDMA

This paper introduces an improved nonlinear parallel interference cancellation scheme for code-division multiple access (CDMA) that significantly reduces the degrading effect on the desired user of interference from the other users that share the channel. The implementation complexity of the scheme is linear in the number of users and operates on the fact that parallel processing simultaneously removes from each user a part of the interference produced by the remaining users accessing the channel the amount being proportional to their reliability. The parallel processing can be done in multiple stages. The proposed scheme uses tentative decision devices at the multiple stages to produce the most reliably estimated received data for generation and cancellation of user interference. Simulation results are given for a multitude of different situations, in particular, those cases for which the analysis is too complex.

Multiple-symbol differential detection of MPSK

A differential detection technique for MPSK (multiple-phase shift keying), which uses a multiple-symbol observation interval, is presented, and its performance is analyzed and simulated. The technique makes use of maximum-likelihood sequence estimation of the transmitted phases rather than symbol-by-symbol detection as in the conventional differential detection. Thus, the performance of this multiple-symbol detection scheme fills the gap between conventional (two-symbol observation) differentially coherent detection of MPSK and ideal coherent of MPSK with differential encoding. The amount of improvement gained over conventional differential detection depends on the number of phases M and the number of additional symbol intervals added to the observation. What is particularly interesting is that substantial performance improvement can be obtained for only one or two additional symbol intervals of observation. The analysis and simulation results presented are for uncoded MPSK. >

The design of trellis coded MPSK for fading channels: performance criteria

It has been well established that the appropriate criterion for optimum trellis-coded modulation design on the additive white Gaussian noise channel is maximization of the free Euclidean distance. It is shown that when the trellis-coded modulation is used on a Rician fading channel with interleaving/deinterleaving, the design of the code of optimum performance is guided by other factors, in particular, the length of the shortest error-event path, and the product of branch distances (possibly normalized by the Euclidean distance of the path) along the path. Although maximum free distance (d/sub free/) is still an important consideration, it plays a less significant role the more severe the fading is on the channel. These considerations lead to the definition of a new distance measure of optimization of trellis codes transmitted over Rician fading channels. If no interleaving/deinterleaving is used, then once again the design of the trellis code is guided by maximizing d/sub free/. >

Turbo codes for PCS applications

Turbo codes are the most exciting and potentially important development in coding theory in many years. They were introduced in 1993 by Berrou, Glavieux and Thitimajshima, and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required E/sub b//N/sub o/ of 0.7 dB was reported for BER of 10/sup -5/ and code rate of 1/2. However, some important details that are necessary to reproduce these results were omitted. This paper confirms the accuracy of these claims, and presents a complete description of an encoder/decoder pair that could be suitable for PCS applications. We describe a new simple method for trellis termination, we analyze the effect of interleaver choice on the weight distribution of the code, and we introduce the use of unequal rate component codes which yields better performance. Turbo codes are extended to encoders with multiple codes and a suitable decoder structure is developed, which is substantially different from the decoder for two-code based encoders.

Some new twists to problems involving the Gaussian probability integral

Using an alternate form of the Gaussian probability integral discovered a number of years ago, it is shown that the solution to a number of previously considered communication problems can be simplified and, in some cases, made more accurate (i.e. exact rather than bounded). These problems include the evaluation of: (1) the bit-error probability of uncoded phase shift keying (PSK) with Costas loop tracking; (2) word-error probability of antipodal modulation in the presence of fading; (3) bit-error probability of coded M-ary PSK (MPSK) over the memoryless fading channel with given channel-state information; (4) conditional symbol-error probability of MPSK in the presence of carrier synchronization error; and (5) the average error probability for the binary additive white Gaussian noise (AWGN) intersymbol interference channel. Also obtained is a generalization of this new alternate form to the case of a two-dimensional Gaussian probability integral with arbitrary correlation which can be used to evaluate the symbol-error probability of MPSK with I-Q unbalance.

Maximum-likelihood differential detection of uncoded and trellis coded amplitude phase modulation over AWGN and fading channels/spl minus/metrics and performance

This paper derives metrics for maximum-likelihood differential detection of uncoded and trellis coded MPSK and QAM transmitted over Rayleigh and Rician fading channels. Receiver structures based on these metrics are proposed and their error probability performance analyzed and/or simulated. The results represent a generalization of the notion of multiple symbol differential detection, previously introduced by the authors for MPSK over an AWGN, to the fading channel and other modulations. For the coded cases, ideal interleaving/deinterleaving is assumed and furthermore the presence or absence of channel state information. An interesting side result is that for a constant envelope modulation transmitted over a fading channel with unknown but rapidly-varying phase error (the other extreme to the slowly-varying phase error case normally assumed for differential detection), under certain practical assumptions, it is shown that the optimum receiver is of the limiter-discriminator type. >

The design of trellis coded MPSK for fading channels: set partitioning for optimum code design

A previous work on criteria for designing trellis-coded MPSK modulation to achieve minimum error probability performance on the Rician fading channel (see ibid., vol.36, no.9, p.1004-1012, Sep. 1988) is extended. It is demonstrated that allowing for multiple symbols per trellis branch, i.e., multiple trellis-coded modulation (MTCM), provides an additional degree of freedom for designing a code to meet the optimization on the fading channel. Diversities larger than those achievable with conventional trellis codes having the same number of trellis states are now attainable, it is under these conditions that MTCM achieves its full potential. >

Multiple trellis coded modulation (MTCM)

The authors demonstrate a trellis coded modulation technique referred to as multiple trellis coded modulation (MTCM) wherein more than one channel symbol per trellis branch is transmitted. They have found simple two-state trellis codes for symmetric MPSK multiple phase-shift keying and AM modulations that can achieve 3-dB gain over uncoded modulation at very high signal-to-noise ratios without bandwidth expansion or reduction in information bit rate. The gain of these codes with respect to previously reported two-state trellis codes is between 1 and 2 dB at very high signal-to-noise ratios, depending on the number of bits per Hertz transmitted. These gains are achieved for those of the equivalent conventional trellis codes with the same number of states in the trellis diagram. The authors note that additional computations per branch are needed for the multiple trellis coding scheme. The concept can be extended to a higher number of states and other types of modulations. >

Capacity-approaching protograph codes

This paper discusses construction of protograph-based low-density parity-check (LDPC) codes. Emphasis is placed on protograph ensembles whose typical minimum distance grows linearly with block size. Asymptotic performance analysis for both weight enumeration and iterative decoding threshold determination is provided and applied to a series of code constructions. Construction techniques that yield both low thresholds and linear minimum distance growth are introduced by way of example throughout. The paper also examines implementation strategies for high throughput decoding derived from first principles of belief propagation on bipartite graphs.

Multiple turbo codes

We introduce multiple turbo codes and a suitable decoder structure derived from an approximation to the maximum a posteriori probability (MAP) decision rule, which is substantially different from the decoder for two-code-based encoders. We developed new rate 1/3 and 2/3 constituent codes to be used in the turbo encoder structure. These codes, for 2 to 32 states, are designed by using primitive polynomials. The resulting turbo codes have rates b/n, b=1, 2 and n=3, 4, and include random interleavers for better asymptotic performance. A rate 2/4 code with 16QAM modulation was used to realize a turbo trellis coded modulation (TTCM) scheme at 2 bit/sec/Hz throughput, whose performance is within 1 dB from the Shannon limit at a BER=10/sup -5/.