Showing papers in "IEEE Transactions on Communications in 1997"

Robust frequency and timing synchronization for OFDM

Abstract: A rapid synchronization method is presented for an orthogonal frequency-division multiplexing (OFDM) system using either a continuous transmission or a burst operation over a frequency-selective channel. The presence of a signal can be detected upon the receipt of just one training sequence of two symbols. The start of the frame and the beginning of the symbol can be found, and carrier frequency offsets of many subchannels spacings can be corrected. The algorithms operate near the Cramer-Rao lower bound for the variance of the frequency offset estimate, and the inherent averaging over many subcarriers allows acquisition at very low signal-to-noise ratios (SNRs).

Context-based, adaptive, lossless image coding

Abstract: We propose a context-based, adaptive, lossless image codec (CALIC). The codec obtains higher lossless compression of continuous-tone images than other lossless image coding techniques in the literature. This high coding efficiency is accomplished with relatively low time and space complexities. The CALIC puts heavy emphasis on image data modeling. A unique feature of the CALIC is the use of a large number of modeling contexts (states) to condition a nonlinear predictor and adapt the predictor to varying source statistics. The nonlinear predictor can correct itself via an error feedback mechanism by learning from its mistakes under a given context in the past. In this learning process, the CALIC estimates only the expectation of prediction errors conditioned on a large number of different contexts rather than estimating a large number of conditional error probabilities. The former estimation technique can afford a large number of modeling contexts without suffering from the context dilution problem of insufficient counting statistics as in the latter approach, nor from excessive memory use. The low time and space complexities are also attributed to efficient techniques for forming and quantizing modeling contexts.

Modeling of nondirected wireless infrared channels

Abstract: We show that realistic multipath infrared channels can be characterized well by only two parameters: optical path loss and RMS delay spread. Functional models for the impulse response, based on infrared reflection properties, are proposed and analyzed. Using the ceiling-bounce functional model, we develop a computationally efficient method to predict the path loss and multipath power requirement of diffuse links based on the locations of the transmitter and receiver within a room. Use of our model is a simple, yet accurate, alternative to the use of an ensemble of measured channel responses in evaluating the impact of multipath distortion.

Data-aided frequency estimation for burst digital transmission

Abstract: Burst transmission of digital data is employed in several applications such as satellite time-division multiple access (TDMA) systems and terrestrial mobile cellular radio. We propose a new algorithm for carrier frequency estimation in burst-mode phase shift keying (PSK) transmissions. The algorithm is data-aided and clock-aided and has a feedforward structure that is easy to implement in digital form. Its estimation range is large, about /spl plusmn/20% of the symbol rate and its accuracy is close to the Cramer-Rao bound (CRB) for a signal-to-noise ratio (SNR) as low as 0 dB. Comparisons with earlier methods are discussed.

Multitone signals with low crest factor

Abstract: After an introductory discussion of real-valued and complex signals, it is shown that minimizing the crest factor (CF) of multitone signals is closely related to the construction of complex sequences with low sidelobes in their aperiodic autocorrelation function. Inspired by this observation, a lower bound on the achievable CF is derived. Four differing algorithms for the reduction of the CF of complex multitone signals are compared with each other by computer simulation. The preferred algorithm is presented in detail, and its convergence is proven. Examples of multitone signals with up to 15 tones and lower CF than previously reported in the literature are given.

Sequence estimation in the presence of random parameters via the EM algorithm

Abstract: The expectation-maximization (EM) algorithm was first introduced in the statistics literature as an iterative procedure that under some conditions produces maximum-likelihood (hit) parameter estimates. In this paper we investigate the application of the EM algorithm to sequence estimation in the presence of random disturbances and additive white Gaussian noise. As examples of the use of the EM algorithm, we look at the random-phase and fading channels, and show that a formulation of the sequence estimation problem based on the EM algorithm can provide a means of obtaining ML sequence estimates, a task that has been previously too complex to perform.

Code-aided interference suppression for DS/CDMA communications. II. Parallel blind adaptive implementations

Abstract: For pt.I see ibid., vol.45, no.9, p.1101-11 (1997). An adaptive code-aided technique for the simultaneous suppression of narrow-band interference (NBI) and multiple-access interference (MAI) in direct-sequence code-division multiple-access (DS/CDMA) networks is proposed. This technique is based on the recursive least-squares (RLS) version of the minimum mean-square error (MMSE) algorithm for multiuser detection. The convergence dynamics of the RLS blind adaptive algorithm for suppressing the combined NBI and MAI are analyzed. The steady-state performance of this algorithm in terms of the signal-to-interference ratio (SIR) is also derived. Systolic array structures for parallel implementations of the RLS adaptive interference suppression algorithms are then proposed. Versions of the rotation-based QR-RLS algorithms for both the blind adaptation mode and the decision-directed adaptation mode are derived. These algorithms exhibit high degrees of parallelism, and can be mapped to VLSI systolic arrays to exploit massively parallel signal processing computation.

On the statistics of block errors in bursty channels

Abstract: In the development of encoding algorithms for image, video, and other mixed media transmissions, it is important to note that the channel "seen" by the applications is the physical channel as modified by the error-correcting mechanisms used at the physical level. Therefore, the statistics of the residual error process is relevant to the design of encoding algorithms. In this paper, we study the second- and third-order statistics of the residual error process when block transmissions are performed over a bursty channel. The effect of interleaving is explicitly studied. The conditions under which a Markovian model for the block errors is adequate are identified. Derivations of the parameters of the block error process are then presented in terms of the parameters of the bit/symbol error process. At higher data speeds an effective interleaving strategy is found to require a very large buffer.

Performance comparison of multiwavelength CDMA and WDMA+CDMA for fiber-optic networks

Abstract: A "multiwavelength" scheme has been proposed to support large numbers of subscribers and simultaneous users in optical code-division multiple-access (CDMA) networks without using very large bandwidth expansion or the need of complicated and not-yet-feasible optical processing. In this paper, multiwavelength optical orthogonal codes (MWOOCs), which consist of two-dimensional codewords (or matrices) with every pulse of a codeword encoded in a distinct wavelength, are constructed for this scheme. MWOOCs have larger cardinality than the one-dimensional codes used in the hybrid wavelength-division multiple-access (WDMA) and CDMA scheme. With the same hardware configuration, our analysis shows that the multiwavelength scheme, in general, performs better than the hybrid scheme, particularly when the traffic load is heavy. However, if a central controller (i.e., under the best scenario) is used to uniformly distribute all available wavelengths to simultaneous users in the hybrid scheme, both schemes have comparable performance for a medium traffic load and the hybrid scheme can theoretically achieve error-free transmission when the load is light. In addition, using multiple wavelengths, the requirements of fiber ribbons and multiple stars in temporal/spatial optical CDMA networks are eliminated.

Infinite series representations of the bivariate Rayleigh and Nakagami-m distributions

Abstract: Despite the usefulness of the bivariate (correlated) Nakagami-m cumulative distribution function (cdf) in communications systems analysis, an infinite series for the computation of this function is not known. In this letter, an infinite series representation of the bivariate cdf is derived. Bounds on the error resulting from truncation of the infinite series are also derived.

Complex spreading sequences with a wide range of correlation properties

Abstract: This paper presents a new family of complex valued pseudo-random sequences for use in coded multiple access communication systems. The family offers a very wide range of values for both auto-correlation (AC) and cross-correlation (CC) functions, allowing great flexibility in the selection of characteristics of sequence sets. Based on the measure described in this paper for the mean-square aperiodic AC and CC values of a set of sequences, the correlation properties of sets of these sequences are compared to well-known sequence sets, and it is shown that sets from the new family of sequences have superior qualities. Tables of parameters for various sequence sets are presented to enable the construction and comparison of sets from this new family.

Code-aided interference suppression for DS/CDMA communications. I. Interference suppression capability

Abstract: A code-aided technique for the simultaneous suppression of narrow-band interference (NBI) and multiple-access interference (MAI) in direct-sequence code-division multiple-access (DS/CDMA) networks is proposed. This technique is based on the linear minimum mean-square error (MMSE) algorithm for multiuser detection. The performance of this technique against MAI has been considered previously. In this paper, its performance against NBI as well as combined NBI and MAI is addressed. Specifically, the performance of this technique against three types of narrow-band interferers, namely, multitone interferers, autoregressive (AR) interferers, and digital interferers, is analyzed. The NBI suppression performance of this method is then compared with performance bounds of the linear and nonlinear estimator-subtracter NBI suppression techniques. It is seen that this method outperforms all of the previous linear or nonlinear methods of NBI suppression, while simultaneously suppressing the MAI.

Fading-resistant modulation using several transmitter antennas

Abstract: This paper proposes a bandwidth-efficient fading-resistant transmission scheme which implements transmitter diversity using L antennas at the base station. When the antennas are spaced sufficiently far apart, the transmission from each antenna undergoes a different degree of fading. These transmissions are coordinated to mitigate the effects of Rayleigh fading, and the mobile receiver can recover the entire L-dimensional transmitted vector signal as long as the signal energy of at least one coordinate is large enough. L-dimensional fading-resistant signal constellations are generated by maximizing a figure of merit for the Rayleigh fading channel. This scheme offers a significant performance improvement over a conventional single-antenna binary phase-shift keying (BPSK) scheme when coding is ineffective due to slow fading.

Fast full-search block-matching algorithm for motion-compensated video compression

Abstract: This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral projections, having the advantages of being good block features and having simple complexity in measuring matching errors. Most of the candidate blocks can be rejected only by calculating one or more of the three fast matching error measures. The time-consuming computations of MSE or MAE are performed on only a few candidate blocks that first pass all three fast matching criteria. Simulation results show that a reduction of over 86% in computations is achieved after integrating the three fast matching criteria into the full-search algorithm, while ensuring optimal accuracy.

Probability of error for equal-gain combiners over Rayleigh channels: some closed-form solutions

Abstract: The probability of error of a general equal-gain combiner (EG) in closed form is not available in the literature. By formulating the problem in the framework of signal detection and evaluating the probability of error directly from the characteristic function (CF) of the signal at the combiner output, we obtain closed-form solutions for the probability of error of the EG combiner with two or three branches operating over a Rayleigh-fading channel.

Integrating error detection into arithmetic coding

Abstract: Arithmetic coding for data compression has gained widespread acceptance as the right method for optimum compression when used with a suitable source model. A technique to implement error detection as part of the arithmetic coding process is described. Heuristic arguments are given to show that a small amount of extra redundancy can be very effective in detecting errors very quickly, and practical tests confirm this prediction.

Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels

Abstract: Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified. It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the weights of all paths through the trellis which pass through that branch, and that this generic computational problem can be solved efficiently by an approach that uses a forward and backward recursion through the trellis. Simulation results are presented which show both the hard and soft decision performance of the MAP receiver to be robust, even in the presence of fade rates of up to 30% of the symbol rate. The application of the receiver concept to phase-shift keying (PSK) signals is also discussed, and then evaluated via simulation. The concept of joint demodulation and decoding using iterative processing techniques is introduced. It is shown that the MAP receiver is well suited for iterative processing applications due to its use of a priori symbol probabilities and its production of optimal soft decisions. Simulation results for the reception of quaternary PSK (QPSK) show that the bit error rate (BER) performance of the iterative MAP receiver can approach that of a receiver operating with perfect knowledge of the fading process.

On the capture probability for a large number of stations

Abstract: The probability of capture under a model (for a land mobile radio direct sequence spread spectrum system) based on the ratio of the largest received power to the sum of interference powers is examined in the limit of a large number of transmitting stations. It is shown in great generality that the limit depends only on the capture ratio threshold and the roll-off exponent of the distribution of power received from a typical station. This exponent is insensitive to many typical channel effects such as Rician or Rayleigh fading and log-normal shadowing. The model is suitable for large systems with noncoherently combined interference.

Tap-selectable decision-feedback equalization

Abstract: This paper presents an adaptive tap assignment technique for improving the performance of a previously reported reduced-complexity decision-feedback equalizer (DFE) for broadband band wireless systems. The spacings of individual feedforward taps of the DFE are made selectable so that, when the channel consists of a sparsely distributed multipath with a large delay spread (e.g. "hilly terrain" (HT) delay profiles), the equalizer span can be increased without increasing the total number of taps. We propose simple tap selection algorithms and show that they provide: (1) performance gains over a contiguous-tap approach in various outdoor delay profiles and (2) improved robustness against fast fading.

A differentially coherent PN code acquisition receiver for CDMA systems

Abstract: New differentially coherent detectors for acquisition of direct sequence spread-spectrum signals are introduced. These detectors are alternatives to the noncoherent detectors that have been considered almost exclusively in the past. The proposed detectors are suitable for commercial code-division multiple-access (CDMA) systems which operate with a relatively large noise floor and provide a surprisingly large signal-to-noise ratio (SNR) improvement over the noncoherent detectors of approximately 5 dB. Under the random code sequence assumption, an exact analysis of the differentially coherent detection performance for both full period correlation (FPC) and partial period correlation (PPC) is carried out. The detector performance in terms of detection and false alarm probabilities for both partial and full period correlations is investigated, and the results are compared with those of classical noncoherent detection. The mean acquisition time for both single-dwell and multiple-dwell acquisition schemes are compared with their noncoherent counterparts.

On the implementation of minimum redundancy prefix codes

Abstract: Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redundancy coding can be implemented efficiently by divorcing coding from a code tree, with emphasis on the situation when n is large, perhaps on the order of 10/sup 6/. We review techniques for devising minimum redundancy codes, and consider in detail how encoding and decoding should be accomplished. In particular, we describe a modified decoding method that allows improved decoding speed, requiring just a few machine operations per output symbol (rather than for each decoded bit), and uses just a few hundred bytes of memory above and beyond the space required to store an enumeration of the source alphabet.

Nonlinear techniques for the joint estimation of cochannel signals

Abstract: Cochannel interference occurs when two or more signals overlap in frequency and are present concurrently. Unlike in spread-spectrum multiple-access systems where the different users necessarily share the same channel, cochannel interference is a severe hindrance to frequency- and time-division multiple-access communications, and is typically minimized by interference rejection/suppression techniques. Rather than using interference suppression, we are interested in the joint estimation of the information-bearing narrow-band cochannel signals. Novel joint estimators are proposed that employ a single-input demodulator with oversampling to compensate for timing uncertainties. Assuming finite impulse-response channel characteristics, maximum likelihood (ML) and maximum a posteriori (MAP) criteria are used to derive cochannel detectors of varying complexities and degrees of performance. In particular, a (suboptimal) two-stage joint MAP symbol detector (JMAPSD) is introduced that has a lower complexity than the single-stage estimators while accruing only a marginal loss in error-rate performance at high signal-to-interference ratios. Assuming only reliable estimates of the primary and secondary signal powers, a blind adaptive JMAPSD algorithm for a priori unknown channels is also derived. The performance of these nonlinear joint estimation algorithms is studied through example computer simulations for two cochannel sources.

Frequency offset compensation of pilot symbol assisted modulation in frequency flat fading

Abstract: Pilot symbol assisted modulation (PSAM) is a practical technique in mobile digital communications since it can provide high performance in fading with large constellations and it has a simple implementation. Maintaining high performance with PSAM requires an accurate estimate of the transmitted carrier frequency. This paper examines model-based frequency estimation for mobile digital communications with PSAM. Maximum-likelihood estimators (MLE), which include the model for the fading, are derived and compared with those in an additive white Gaussian noise (AWGN) channel, and performance hounds are computed. Reduced complexity frequency estimators based on the MLE are derived and the performance is quantified by Monte-Carlo simulation.

Adaptive Viterbi decoding of convolutional codes over memoryless channels

Abstract: In this paper, an adaptive decoding algorithm for convolutional codes, which is a modification of the Viterbi algorithm (VA) is presented For a given code, the proposed algorithm yields nearly the same error performance as the VA while requiring a substantially smaller average number of computations Unlike most of the other suboptimum algorithms, this algorithm is self-synchronizing If the transmitted path is discarded, the adaptive Viterbi algorithm (AVA) can recover the state corresponding to the transmitted path after a few trellis depths Using computer simulations over hard and soft 3-bit quantized additive white Gaussian noise channels, it is shown that codes with a constraint length K up to 11 can be used to improve the bit-error performance over the VA with K=7 while maintaining a similar average number of computations Although a small variability of the computational effort is present with our algorithm, this variability is exponentially distributed, leading to a modest size of the input buffer and, hence, a small probability of overflow

Impact of diversity reception on fading channels with coded modulation. I. Coherent detection

Abstract: We address the problem of designing and analyzing the performance of a coded modulation scheme for the fading channel when space diversity is used. Under fairly general conditions, a channel affected by fading can be turned into an additive white Gaussian noise (AWGN) channel by increasing the number of diversity branches. Consequently, it can be expected (and is indeed verified by our analyses and simulations) that a coded modulation scheme designed to be optimal for the AWGN channel also will perform asymptotically well on a fading channel with diversity. This paper presents bounds on the bit-error probability of a system with coded modulation and diversity for space- and time-correlated Rician flat fading. Specifically, we derive a new method which allows evaluation of the pairwise error probability extremely easily, as well as accurately and computationally fast. The accuracy achieved improves considerably on the widely used, but rather loose Chernoff bound. Starting from this analysis, we study the asymptotic behavior of the fading channel with diversity as the number of diversity branches increases, and we address the effects of diversity on coded modulation performance and design criteria, including the effect on interleaver depth (which affects the total delay of the system).

Finite memory-length linear multiuser detection for asynchronous CDMA communications

Abstract: Decorrelating, linear, minimum mean-squared error (LMMSE), and noise-whitening multiuser detectors for code-division multiple-access systems (CDMA) are ideally infinite memory-length (referred to as IIR) detectors. To obtain practical detectors, which have low implementation complexity and are suitable for CDMA systems with time-variant system parameters (e.g., the number of users, the delays of users, and the signature waveforms), linear finite-memory-length (referred to as FIR) multiuser detectors are studied in this paper. They are obtained by truncating the IIR detectors or by finding optimal FIR detectors. The signature waveforms are not restricted to be time-invariant (periodic over symbol interval). Thus, linear multiuser detection is generalized to systems with spreading sequences longer than the symbol interval. Conditions for the stability of the truncated detectors are discussed. Stable truncated detectors are shown to be near-far resistant if the received powers are upper bounded, and if the memory length is large enough (but finite). Numerical examples demonstrate that moderate memory lengths are sufficient to obtain the performance of the IIR detectors even with a severe near-far problem.

On the analytical computation of the interference statistics with applications to the performance evaluation of mobile radio systems

Abstract: We provide a general analytical framework for the computation of the interference statistics in mobile radio cellular systems. This approach, which takes into account log-normal shadowing, distance path loss, best cell site selection and power control based on signal strength, applies to various cellular environments, including narrowband systems (e.g., IS-54 and Group Special Mobiles GSM) and code-division multiple-access (CDMA) systems. Some examples of application are provided.

Performance of direct-sequence spread-spectrum RAKE receivers with random spreading sequences

Abstract: In this paper, we derive error probability expressions for binary phase-shift keying (BPSK) and quaternary phase-shift keying (QPSK) spread direct-sequence spread-spectrum (DSSS) systems employing random spreading sequences with RAKE receivers. The derived expressions accurately take into account the effect of interpath interference which usually has been neglected in previous analyses. Selection, equal gain, and maximal ratio techniques are considered for diversity combining. Two possible finger assignment strategies, one based on the instantaneous amplitudes and another based on the average powers of the multipath components, are considered for the assignment of multipath components to the available demodulating fingers in the RAKE receiver. Also, various simple, and in many cases, closed-form approximations for the error probabilities are derived and their accuracies are assessed.

Near optimum tree-search detection schemes for bit-synchronous multiuser CDMA systems over Gaussian and two-path Rayleigh-fading channels

Abstract: Simple reduced tree-search detection schemes of the breadth-first type are applied to suboptimal joint multiuser detection in bit-synchronous code-division multiple access (CDMA) systems over both Gaussian and two-path Rayleigh-fading channels. It is pointed out that in contrast to the case of the optimal multiuser detector, the choice of the receiver filter severely influences the performance of suboptimal multiuser detectors. Simulation results supported by analysis show that breadth-first tree-search algorithms using a decorrelating noise whitening receiver filter perform better than similar receivers, which solely use a matched filter (MF) for virtually all nonsingular spreading code sets studied. Most of the code sets are randomly generated. The M- and T-algorithm detectors based on decorrelating noise whitening filter (WF) outputs can achieve near optimum performance at a very low complexity compared to the optimal detector, although the proposed detectors are more complex than some known suboptimum detectors. Furthermore, the use of combining techniques is considered for a two-path Rayleigh-fading channel, and a semi-synchronous CDMA structure is proposed. It is shown that if maximum ratio combining (MRC) is employed, the decorrelating noise WF still exists. The corresponding suboptimal combining detector with a decorrelating noise WF outperforms a similar noncombining detector.

One-coincidence sequences with specified distance between adjacent symbols for frequency-hopping multiple access

Abstract: Frequency hopping spread-spectrum systems have been popular in multiple-access communication systems. In such frequency-hopping multiple-access systems, multilevel sequences are used to specify which frequency will be used for transmission at any given time. One-coincidence sequences with specified distance between adjacent symbols for frequency-hopping multiple access are described. In such sequences, the distances between any adjacent symbols in any sequence are more than some specified amount. A theoretical bound is derived for the sequences, and two theorems on the construction of the sequences are given.