Showing papers in "IEEE Transactions on Communications in 2000"

Ultra-wide bandwidth time-hopping spread-spectrum impulse radio for wireless multiple-access communications

Abstract: Attractive features of time-hopping spread-spectrum multiple-access systems employing impulse signal technology are outlined, and emerging design issues are described. Performance of such communications systems in terms of achievable transmission rate and multiple-access capability are estimated for both analog and digital data modulation formats under ideal multiple-access channel conditions.

Fading correlation and its effect on the capacity of multielement antenna systems

Abstract: We investigate the effects of fading correlations in multielement antenna (MEA) communication systems. Pioneering studies showed that if the fades connecting pairs of transmit and receive antenna elements are independently, identically distributed, MEAs offer a large increase in capacity compared to single-antenna systems. An MEA system can be described in terms of spatial eigenmodes, which are single-input single-output subchannels. The channel capacity of an MEA is the sum of capacities of these subchannels. We show that the fading correlation affects the MEA capacity by modifying the distributions of the gains of these subchannels. The fading correlation depends on the physical parameters of MEA and the scatterer characteristics. In this paper, to characterize the fading correlation, we employ an abstract model, which is appropriate for modeling narrow-band Rayleigh fading in fixed wireless systems.

Hierarchical digital modulation classification using cumulants

Abstract: A simple method, based on elementary fourth-order cumulants, is proposed for the classification of digital modulation schemes. These statistics are natural in this setting as they characterize the shape of the distribution of the noisy baseband I and Q samples. It is shown that cumulant-based classification is particularly effective when used in a hierarchical scheme, enabling separation into subclasses at low signal-to-noise ratio with small sample size. Thus, the method can be used as a preliminary classifier if desired. Computational complexity is order N, where N is the number of complex baseband data samples. This method is robust in the presence of carrier phase and frequency offsets and can be implemented recursively. Theoretical arguments are verified via extensive simulations and comparisons with existing approaches.

Differential unitary space-time modulation

Abstract: We present a framework for differential modulation with multiple antennas across a continuously fading channel, where neither the transmitter nor the receiver knows the fading coefficients. The framework can be seen as a natural extension of standard differential phase-shift keying commonly used in single-antenna unknown-channel systems. We show how our differential framework links the unknown-channel system with a known-channel system, and we develop performance design criteria. As a special ease, we introduce a class of diagonal signals where only one antenna is active at any time, and demonstrate how these signals may be used to achieve full transmitter diversity and low probability of error.

A comparison of SNR estimation techniques for the AWGN channel

Abstract: The performances of several signal-to noise ratio (SNR) estimation techniques reported in the literature are compared to identify the "best" estimator. The SNR estimators are investigated by the computer simulation of baseband binary phase-shift keying (PSK) signals in real additive white Gaussian noise (AWGN) and baseband 8-PSK signals in complex AWGN. The mean square error is used as a measure of performance. In addition to comparing the relative performances, the absolute levels of performance are also established; the simulated performances are compared to a published Cramer-Rao bound (CRB) for real AWGN and a CRB for complex AWGN that is derived here. Some known estimator structures are modified to perform better on the channel of interest. Estimator structures for both real and complex channels are examined.

A theoretical characterization of nonlinear distortion effects in OFDM systems

Abstract: This paper presents a theoretical characterization of nonlinear distortion effects in orthogonal frequency division multiplexing (OFDM) transmission systems. In the theoretical framework developed, it is shown that the effects on the decision variables of the in-band distortion introduced by a bandpass memoryless nonlinearity can be described by means of a complex gain and an additive Gaussian term with zero mean and suitable variance; analytical expressions for gain and variance are given. The conditions which allow this description are emphasized and discussed. As a consequence, a completely analytical procedure to evaluate error probability is also obtained and illustrated using OFDM/discrete multitone modulation (DMT) systems with rectangular pulse shaping; for the soft-envelope limiter nonlinearity, a closed form is derived. A comparison with simulation results is carried out to verify the accuracy of this method.

Maximum-likelihood classification for digital amplitude-phase modulations

Abstract: We apply the maximum-likelihood (ML) method to the classification of digital quadrature modulations. We show that under an ideal situation, the I-Q domain data are sufficient statistics for modulation classification and obtain a generic formula for the error probability of a ML classifier. Our study of asymptotic performance shows that the ML classifier is capable of classifying any finite set of distinctive constellations with zero error rate when the number of available data symbols goes to infinity.

On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes

Abstract: This paper introduces a hybrid forward-error correction/automatic repeat-request (ARQ) system that employs rate compatible punctured turbo (RCPT) codes to achieve enhanced throughput performance over a nonstationary Gaussian channel. The proposed RCPT-ARQ system combines the performance of turbo codes with the frugal use of incremental redundancy inherent in the rate compatible punctured convolutional codes of Hagenauer (1988). Moreover, this paper introduces the notion of puncturing the systematic code symbols of a turbo code to maximize throughput at signal-to-noise ratios (SNRs) of interest. The resulting system provides both an efficient family of achievable code rates at middle to high SNR and powerful low-rate error correction capability at low SNR.

An MGF-based performance analysis of generalized selection combining over Rayleigh fading channels

Abstract: Using the notion of the "spacing" between ordered exponential random variables, a performance analysis of the generalized selection combining (GSC) diversity scheme over Rayleigh fading channels is presented and compared with that of the conventional maximal-ratio combining and selection combining schemes. Starting with the moment generating function (MGF) of the GSC output signal-to-noise ratio (SNR), we derive closed-form expressions for the average combined SNR, outage probability, and average error probability of a wide variety of modulation schemes operating over independently, identically distributed (i.i.d.) diversity paths. Because of their simple form, these expressions readily allow numerical evaluation for cases of practical interest. The results are also extended to the case of non-i.i.d. diversity paths.

Computationally efficient optimal power allocation algorithms for multicarrier communication systems

Abstract: We present an optimal, computationally efficient, integer-bit power allocation algorithm for discrete multitone modulation. Using efficient lookup table searches and a Lagrange-multiplier bisection search, our algorithm converges faster to the optimal solution than existing techniques and can replace the use of suboptimal methods because of its low computational complexity. Fast algorithms are developed for the data rate and performance margin maximization problems.

Carrier-frequency estimation for transmissions over selective channels

Abstract: This paper deals with carrier-frequency estimation for burst transmissions over frequency-selective channels. Three estimation schemes are proposed, all based on the use of known training sequences. The first scheme employs an arbitrary sequence and provides joint maximum-likelihood (ML) estimates of the carrier frequency and the channel response. Its implementation complexity is relatively high but its accuracy achieves the Cramer-Rao bound. The second scheme is still based on the ML criterion, but the training sequence is periodic, which helps to reduce the computational load. The third scheme also employs periodic sequences, but its structure comes from heuristic reasoning. Theoretical analysis and simulations are employed to assess the performance of the three schemes.

OFDM blind carrier offset estimation: ESPRIT

Abstract: In orthogonal frequency-division multiplex (OFDM) communications, the loss of orthogonality due to the carrier-frequency offset must be compensated before discrete Fourier transform-based demodulation can be performed. This paper proposes a new carrier offset estimation technique for OFDM communications over a frequency-selective fading channel. We exploit the intrinsic structure information of OFDM signals to derive a carrier offset estimator that offers the accuracy of a super resolution subspace method, ESPRIT.

On first-order Markov modeling for the Rayleigh fading channel

Abstract: Previous models for the received signal amplitude of the flat-fading channel that use first-order finite-state Markov chains are examined. The stochastic properties of a proposed first-order model based on these models are examined. The limitations of using an information theoretic metric, which is sometimes used to justify a first-order Markov chain as a sufficient model for very slowly fading channels, are discussed. A simple method of qualitatively comparing autocorrelation functions is instead proposed. The usefulness of the first-order Markov chain in representing the flat-fading channel is examined by looking at two specific problems in wireless system applications that represent two disparate cases. The first case involves analysis over a short duration of time, relative to the inverse of the normalized Doppler frequency, while the second involves analysis over a long duration of time. Contrary to previous reports, the results indicate that first-order Markov chains are not generally suitable for very slowly fading channels. Rather, first-order Markov chains can be suitable for very slowly fading applications, which require analysis over only a short duration of time.

Theoretical analysis and performance of OFDM signals in nonlinear AWGN channels

Abstract: Orthogonal frequency-division multiplexing (OFDM) baseband signals may be modeled by complex Gaussian processes with Rayleigh envelope distribution and uniform phase distribution, if the number of carriers is sufficiently large. The output correlation function of instantaneous nonlinear amplifiers and the signal-to-distortion ratio can be derived and expressed in an easy way. As a consequence, the output spectrum and the bit-error rate (BER) performance of OFDM systems in nonlinear additive white Gaussian noise channels are predictable both for uncompensated amplitude modulation/amplitude modulation (AM/AM) and amplitude modulation/pulse modulation (AM/PM) distortions and for ideal predistortion. The aim of this work is to obtain the analytical expressions for the output correlation function of a nonlinear device and for the BER performance. The results in closed-form solutions are derived for AM/AM and AM/PM curves approximated by Bessel series expansion and for the ideal predistortion case.

On the computation and reduction of the peak-to-average power ratio in multicarrier communications

Abstract: For any code C defined over an equal energy constellation, it is first shown that at any time instance, the problem of determining codewords of C with high peak-to-average power ratios (PAPR) in a multicarrier communication system is intimately related to the problem of minimum-distance decoding of C. Subsequently, a method is proposed for computing the PAPR by minimum-distance decoding of C at many points of time. Moreover an upper bound on the error between this computed value and the true one is derived. Analogous results are established for codes defined over arbitrary signal constellations. As an application of this computational method, an approach for reducing the PAPR of C proposed by Jones and Wilkinson (1996) is revisited. This approach is based on introducing a specific phase shift to each coordinate of all the codewords where phase shifts are independent of the codewords and known both to the transmitter and the receiver. We optimize the phase shifts offline by applying our method for computing the PAPR for the coding scenario proposed by the ETSI BRAN Standardization Committee. Reductions of order 4.5 dB can be freely obtained using the computed phase shifts. Examples are provided showing that most of the gain is preserved when the computed optimal phase shifts are rounded to quantenary phase-shift keying (PSK), 8-PSK, and 16-PSK type phase shifts.

The generation of correlated Rayleigh random variates by inverse discrete Fourier transform

Abstract: A number of different algorithms are used for the generation of correlated Rayleigh random variates. This paper presents an analysis of the statistical properties of methods based on the inverse discrete Fourier transform (IDFT). A modification of the algorithm of Smith (1975) is presented, the new method requiring exactly one-half the number of IDPT operations and roughly two-thirds the computer memory of the original method. Evaluations of and comparisons between various variate generation methods using meaningful quantitative measures are believed to be lacking. New quantitative quality measures for random variate generation have been proposed that are, in particular, meaningful and useful for digital communication system simulation. This paper presents the application of these measures to the IDFT method and three other methods of correlated variate generation, comparing the algorithms in terms of the quality of the generated samples and the required computational effort.

Turbo space-time processing to improve wireless channel capacity

Abstract: By deriving a generalized Shannon capacity formula for multiple-input, multiple-output Rayleigh fading channels, and by suggesting a layered space-time architecture concept that attains a tight lower bound on the capacity achievable. Foschini (see Wireless Pers. Commun., vol.6, no.3, p.311-35, 1998) has shown a potential enormous increase in the information capacity of a wireless system employing multiple-element antenna arrays at both the transmitter and receiver. The layered space-time architecture allows signal processing complexity to grow linearly, rather than exponentially, with the promised capacity increase. This paper includes two important contributions. First, we show that Foschini's lower bound is, in fact, the Shannon bound when the output signal-to-noise ratio (SNR) of the space-time processing in each layer is represented by the corresponding "matched filter" bound. This proves the optimality of the layered space-time concept. Second, we present an embodiment of this concept for a coded system operating at a low average SNR and in the presence of possible intersymbol interference. This embodiment utilizes the already advanced space-time filtering, coding and turbo processing techniques to provide yet a practical solution to the processing needed. Performance results are provided for quasi-static Rayleigh fading channels with no channel estimation errors. We see for the first time that the Shannon capacity for wireless communications can be both increased by N times (where N is the number of the antenna elements at the transmitter and receiver) and achieved within about 3 dB in average SNR about 2 dB of which is a loss due to the practical coding scheme we assume-the layered space-time processing itself is nearly information-lossless.

Angle diversity for nondirected wireless infrared communication

Abstract: We outline the benefits and challenges of using angle diversity in nondirected wireless infrared (IR) communications systems. Multiple transmitter beams and multiple narrow field-of view receivers reduce the path loss, multipath distortion, and background noise of the channel, which leads to improved range. We also discuss practical considerations for multielement angle diversity systems, including channel characterization and suboptimal detection techniques. Maximal-ratio combining provides nearly optimal performance up to 100 Mb/s for the angle diversity systems considered. The design and performance of a prototype angle diversity IR communication system are discussed. The prototype can maintain 70 Mb/s at a P/sub e/ of 10/sup -9/ over a 4-m range.

Analysis of infrared wireless links employing multibeam transmitters and imaging diversity receivers

Abstract: We analyze the improvements obtained in wireless infrared (IR) communication links when one replaces traditional single-element receivers by imaging receivers and diffuse transmitters by multibeam (quasi-diffuse) transmitters. This paper addresses both line-of-sight (LOS) and nonline-of-sight (non-LOS) IR links. We quantify link performance in terms of the transmitter power required to achieve a bit error rate (BER) not exceeding 10/sup -9/ with 95% probability. Our results indicate that in LOS links, imaging receivers can reduce the required transmitter power by up to 13 dB compared to single-element receivers. In non-LOS links, imaging receivers and multibeam transmitters can reduce the required transmitter power by more than 20 dB. Furthermore we discuss the use of multibeam transmitters and imaging receivers to implement space-division multiple access (SDMA). In a representative example with two users transmitting at a power sufficient to achieve a BER not exceeding 10/sup -9/ with 95% probability in the absence of cochannel interference, when SDMA is employed, the system can achieve a BER not exceeding 10/sup -9/ with a probability of about 88%.

Equal-gain diversity receiver performance in wireless channels

Abstract: Performance analysis of equal-gain combining (EGC) diversity systems is notoriously difficult only more so given that the closed-form probability density function (PDF) of the EGC output is only available for dual-diversity combining in Rayleigh fading. A powerful frequency-domain approach is therefore developed in which the average error-rate integral is transformed into the frequency domain, using Parseval's theorem. Such a transformation eliminates the need for computing (or approximating) the EGC output PDF (which is unknown), but instead requires the knowledge of the corresponding characteristic function (which is readily available). The frequency-domain method also circumvents the need to perform multiple-fold convolution integral operations, usually encountered in the calculation of the PDF of the sum of the received signal amplitudes. We then derive integral expressions for the average symbol-error rate of an arbitrary two-dimensional signaling scheme, with EGC reception in Rayleigh, Rician, Nakagami-m (1960), and Nakagami-q fading channels. For practically important cases of second- and third-order diversity systems in Nakagami fading, both coherent and noncoherent detection methods for binary signaling are analyzed using the Appell hypergeometric function. A number of closed-form solutions are derived in which the results put forward by Zhang (see ibid., vol.45, p.270-73, 1997) are shown to be special cases.

Outage probability of diversity systems over generalized fading channels

Abstract: Outage probability is an important performance measure of communication systems operating over fading channels. Relying on a simple and accurate algorithm for the numerical inversion of the Laplace transforms of cumulative distribution functions, we develop a moment generating function-based numerical technique for the outage probability evaluation of maximal-ratio combining (MRC) and postdetection equal-gain combining (EGC) in generalized fading channels for which the fading in each diversity path need not be independent, identically distributed, nor even distributed according to the same family of distributions. The method is then extended to coherent EGC but only for the case of Nakagami-m fading channels. The mathematical formalism is illustrated by applying the method to some selected numerical examples of interest showing the impact of the power delay profile and the fading correlation on the outage probability of MRC and EGC systems.

Linear interference cancellation in CDMA based on iterative techniques for linear equation systems

Abstract: It has previously been shown that well known iterations for solving a set of linear equations correspond to linear interference cancellation structures. Here, we suggest applying a block-wise iteration that consists of an outer and an inner iteration. The outer iteration used is the Gauss-Seidel (GS) method, while for the inner iteration, we study direct matrix inversion, the Jacobi over-relaxation iteration, and the conjugate gradient iteration. When a true inner iteration is used, this approach allows for a timely derivation of the acceleration parameters required by advanced iterations. The block iteration is based on a symbol-level implementation which leads to the same detection delay profile for both parallel and serial structures at the expense of differences in the amount of serial processing required. This is discussed in some detail and quantified for comparison. The performance of the detectors is studied via computer simulations where it is found that the block approach can provide significantly faster convergence, leading to improved detection delay over the simpler GS iteration. The improvements are obtained at the expense of an increase in the required serial processing speed.

Statistical analysis and characterization of the indoor propagation channel

Abstract: This paper presents statistical analysis of data obtained by measuring narrowband path loss at DECT (digital enhanced cordless telecommunications) frequency (1.89 GHz) in an indoor environment. Specific goodness-of-fit tests are applied to the data. The tests assess whether the data generating source belongs to a known family of random variables. Results obtained support that local path-loss distribution can be represented as Weibull or Nakagami in most environments. The close resemblance between such distributions and Rice distribution (with Rayleigh as a special case) confirms that Rice/Rayleigh description of fading can be applied to indoor environments. That similarity leads to a general, simple, approximate expression for the cumulative distribution function of the signal-to-interference ratio. The expression can be used without limitations to the number and the parameters of the Rice interferers.

Multiuser detection using a genetic algorithm in CDMA communications systems

Abstract: In this study, a hybrid approach that employs a genetic algorithm (GA) and a multistage detector (MSD) for the multiuser detection problem in a code-division multiple-access communications system is proposed. Using this approach: (1) the GA is used as the first stage of the MSD to provide a good initial point for successive stages of the MSD and (2) the MSD is embedded into the GA as a "genetic operator" to improve further the fitness of the population at each generation. Such a hybridization of the GA with the MSD reduces its computational complexity by providing faster convergence. In addition, a better initial data estimate supplied by the GA improves the performance of the MSD, and the embedded MSD improves the performance of the GA. Simulation results for the synchronous and asynchronous cases are provided to show that the approach is promising.

Performance of truncated type-II hybrid ARQ schemes with noisy feedback over block fading channels

Abstract: This paper considers truncated type-II hybrid automatic repeat-request (ARQ) schemes with noisy feedback over block fading channels. With these ARQ techniques, the number of retransmissions is limited, and, similar to forward error correction (FEC), error-free delivery of data packets cannot be guaranteed. Bounds on the average number of transmissions, the average coding rate as well as the reliability of the schemes are derived using random coding techniques, and the performance is compared with FEC. The random coding bounds reveal the achievable performance with block codes and maximum-likelihood soft-decision decoding. Union upper bounds and simulation results show that over block fading channels, these bounds can be closely approached with simple terminated convolutional codes and soft-decision Viterbi decoding. Truncated type-II hybrid ARQ and the corresponding FEC schemes have the same probability of packet erasure; however, the truncated ARQ schemes offer a trade-off between the average coding rate and the probability of undetected error. Truncated ARQ schemes have significantly higher average coding rates than FEC at high and medium signal-to-noise ratio even with noisy feedback. Truncated ARQ can be viewed as adaptive FEC that adapts to the instantaneous channel conditions.

Iterative decoding of one-step majority logic deductible codes based on belief propagation

Abstract: Previously, the belief propagation (BP) algorithm has received a lot of attention in the coding community, mostly due to its near-optimum decoding for low-density parity check (LDPC) codes and its connection to turbo decoding. In this paper, we investigate the performance achieved by the BP algorithm for decoding one-step majority logic decodable (OSMLD) codes. The BP algorithm is expressed in terms of likelihood ratios rather than probabilities, as conventionally presented. The proposed algorithm fits better the decoding of OSMLD codes with respect to its numerical stability due to the fact that the weights of their check sums are often much higher than that of the corresponding LDPC codes. Although it has been believed that OSMLD codes are far inferior to LDPC codes, we show that for medium code lengths (say between 200-1000 bits), the BP decoding of OSMLD codes can significantly outperform BP decoding of their equivalent LDPC codes. The reasons for this behavior are elaborated.

Information capacity of a random signature multiple-input multiple-output channel

Abstract: A closed-form expression for information capacity of the random signature multiple input multiple-output channel is given. A direct calculation of the capacity is provided additional to the proof involving the capacity of minimum mean-square-error systems provided by Verdu and Shamai (see IEEE Trans. Inform. Theory, vol.45, p.622-40, 1999).

Adaptive minimum bit-error rate equalization for binary signaling

Abstract: We consider the design and adaptation of a linear equalizer with a finite number of coefficients in the context of a classical linear intersymbol-interference channel with Gaussian noise and a memoryless decision device. If the number of equalizer coefficients is sufficient, the popular minimum mean-squared-error (MMSE) linear equalizer closely approximates the optimal linear equalizer that directly minimizes bit-error rate (BER). However, when the number of equalizer coefficients is insufficient to approximate the channel inverse, the minimum-BER equalizer can outperform the MMSE equalizer by as much as 16 dB in certain cases. We propose a simple stochastic adaptive algorithm for realizing the minimum-BER equalizer. Compared to the least-mean-square algorithm, the proposed algorithm can provide a substantial reduction in BER with no increase in complexity.

A matrix-algebraic approach to linear parallel interference cancellation in CDMA

Abstract: Linear parallel interference cancellation (PIC) schemes are described and analyzed using matrix algebra. It is shown that the linear PIC, whether conventional or weighted, can be seen as a linear matrix filter applied directly to the chip-matched filtered received signal vector. An expression for the exact bit-error rate (BER) is obtained, and conditions on the eigenvalues of the code correlation matrix and the weighting factors to ensure convergence are derived. The close relationship between the linear multistage PIC and the steepest descent method (SDM) for minimizing the mean squared error (MSE) is demonstrated. A modified weighted PIC structure that resembles the SDM is suggested which approaches the minimum MSE (MMSE) detector rather than the decorrelator. It is shown that for a K-user system, only K PIC stages are required for the equivalent matrix filter to be identical to the the MMSE filter. For fewer stages, techniques are devised for optimizing the choice of weights with respect to the MSE. One unique optimal choice of weights is found, which will lead to the minimum achievable MSE at the final stage. Simulation results show that a few stages are sufficient for near-MMSE performance.

A matrix-algebraic approach to successive interference cancellation in CDMA

Abstract: In this paper, we describe linear successive interference cancellation (SIC) based on matrix-algebra. We show that linear SIC schemes (single stage and multistage) correspond to linear matrix filtering that can be performed directly on the received chip-matched filtered signal vector without explicitly performing the interference cancellation. This leads to an analytical expression for calculating the resulting bit-error rate which is of particular use for short code systems. Convergence issues are discussed, and the concept of /spl epsiv/-convergence is introduced to determine the number of stages required for practical convergence for both short and long codes.