Reduced complexity sequence detection

The paper deals with the design of suboptimal receivers for data transmission over frequency selective channels. The complexity of the optimum detector, that is the maximum likelihood sequence detector (MLSD), turns out be exponential in the channel memory. Hence, when dealing with channels with long memory, suboptimal receiver structures must be considered. Among suboptimal methods, a technique that allows reduction of the complexity is the delayed decision feedback sequence detector (DDFSD). This receiver is based on a Viterbi processor where the channel memory is truncated. The memory truncation is compensated by a per-survivor decision feedback equalizer. In order to achieve good performance, it is crucial to operate an appropriate prefiltering of the received sequence before the DDFSD. Our contribution is to extend the principles of MLSD and DDFSD to the case where the prefilter is the feedforward filter of a minimum mean-square error decision feedback equalizer (MMSE-DFE). Moreover performance evaluation of the MMSE prefiltered DDFSD is addressed. The union upper bound is used to evaluate the probability of first-event error. Simulation results show that our proposed design of the MMSE-DDFSD gives substantial benefits when a severe frequency selective channel is considered

Performance of optimum detector structures for noisy intersymbol interference channels

The errors which arise in transmitting digital information by radio or wireline systems because of additive noise from successively transmitted signals interfering with one another are described. The probability of error and the performance of optimum detector structures are examined. A comparative study of the performance of certain detector structures and approximations to them, and the performance of a transversal equalizer are included

Multiple-Symbol Differential Detection for Single-Antenna and Multiple-Antenna Systems over Ricean-fading Channels

This paper considers multiple symbol differential detection (DD) for both single-antenna and multiple-antenna systems over flat Ricean-fading channels. We derive the optimal multiple symbol detection (MSD) decision rules for both Mary differential phase-shift keying (MDPSK) and differential unitary space-time modulation (DUSTM). The sphere decoder (SD) is adopted to solve the MSD for MDPSK. As well, an improved SD is proposed by using the Schnorr-Euchner strategy. A suboptimal MSD based decision feedback DD algorithm is proposed for the MSD of DUSTM. We also develop a sphere decoding bound intersection detector (SD-BID) to optimally solve the MSD problem for DUSTM, which still maintains low complexity. Simulation results show that our proposed MSD algorithms for both single-antenna and multiple-antenna systems reduce the error floor of conventional DD but with reasonably low computational complexity

Design and Implementation of Belief Propagation Symbol Detectors for Wireless Intersymbol Interference Channels

In modern wireless communication systems, intersymbol interference (ISI) introduced by frequency selective fading is one of the major impairments to reliable data communication. In ISI channels, the receiver observes the superposition of multiple delayed reflections of the transmitted signal, which will result errors in the decision device. As the data rate increases, the effect of ISI becomes severe. To combat ISI, equalization is usually required for symbol detectors. The optimal maximum-likelihood sequence estimation (MLSE) based on the Viterbi algorithm (VA) may be used to estimate the transmitted sequence in the presence of the ISI. However, the computational complexity of the MLSE increases exponentially with the length of the channel impulse response (CIR). Even in channels which do not exhibit significant time dispersion, the length of the CIR will effectively increase as the sampling rate goes higher. Thus the optimal MLSE is impractical to implement in the majority of practical wireless applications. This dissertation is devoted to exploring practically implementable symbol detectors with near-optimal performance in wireless ISI channels. Particularly, we focus on the design and implementation of an iterative detector based on the belief propagation (BP) algorithm. The advantage of the BP detector is that its complexity is solely dependent on the number of nonzero coefficients in the CIR, instead of the length of the CIR. We also extend the work of BP detector design for various wireless applications. Firstly, we present a partial response BP (PRBP) symbol detector with near-optimal performance for channels which have long spanning durations but sparse multipath structure. We implement the architecture by cascading an adaptive linear equalizer (LE) with a BP detector. The channel is first partially equalized by the LE to a target impulse response (TIR) with only a few nonzero coefficients remaining. The residual ISI is then canceled by a more sophisticated BP detector. With the cascaded LE-BP structure, the symbol detector is capable to achieve a near-optimal error rate performance with acceptable implementation complexity. Moreover, we present a pipeline high-throughput implementation of the detector for channel length 30 with quadrature phase-shift keying (QPSK) modulation. The detector can achieve a maximum throughput of 206 Mb/s with an estimated core area of 3.162 mm^{2} using 90-nm technology node. At a target frequency of 515 MHz, the dynamic power is about 1.096 W. Secondly, we investigate the performance of aforementioned PRBP detector under a more generic 3G channel rather than the sparse channel. Another suboptimal partial response maximum-likelihood (PRML) detector is considered for comparison. Similar to the PRBP detector, the PRML detector also employs a hybrid two-stage scheme, in order to allow a tradeoff between performance and complexity. In simulations, we consider a slow fading environment and use the ITU-R 3G channel models. From the numerical results, it is shown that in frequency-selective fading wireless channels, the PRBP detector provides superior performance over both the traditional minimum mean squared error linear equalizer (MMSE-LE) and the PRML detector. Due to the effect of colored noise, the PRML detector in fading wireless channels is not as effective as it is in magnetic recording applications. Thirdly, we extend our work to accommodate the application of Advanced Television Systems Committee (ATSC) digital television (DTV) systems. In order to reduce error propagation caused by the traditional decision feedback equalizer (DFE) in DTV receiver, we present an adaptive decision feedback sparsening filter BP (DFSF-BP) detector, which is another form of PRBP detector. Different from the aforementioned LE-BP structure, in the DFSF-BP scheme, the BP detector is followed by a nonlinear filter called DFSF as the partial response equalizer. In the first stage, the DFSF employs a modified feedback filter which leaves the strongest post-cursor ISI taps uncorrected. As a result, a long ISI channel is equalized to a sparse channel having only a small number of nonzero taps. In the second stage, the BP detector is applied to mitigate the residual ISI. Since the channel is typically time-varying and suffers from Doppler fading, the DFSF is adapted using the least mean square (LMS) algorithm, such that the amplitude and the locations of the nonzero taps of the equalized sparse channel appear to be fixed. As such, the channel appears to be static during the second stage of equalization which consists of the BP detector. Simulation results demonstrate that the proposed scheme outperforms the traditional DFE in symbol error rate, under both static channels and dynamic ATSC channels. Finally, we study the symbol detector design for cooperative communications, which have attracted a lot of attention recently for its ability to exploit increased spatial diversity available at distributed antennas on other nodes. A system framework employing non-orthogonal amplify-and-forward half-duplex relays through ISI channels is developed. Based on the system model, we first design and implement an optimal maximum-likelihood detector based on the Viterbi algorithm. As the relay period increases, the effective CIR between the source and the destination becomes long and sparse, which makes the optimal detector impractical to implement. In order to achieve a balance between the computational complexity and performance, several sub-optimal detectors are proposed. We first present a multitrellis Viterbi algorithm (MVA) based detector which decomposes the original trellis into multiple parallel irregular sub-trellises by investigating the dependencies between the received symbols. Although MVA provides near-optimal performance, it is not straightforward to decompose the trellis for arbitrary ISI channels. Next, the decision feedback sequence estimation (DFSE) based detector and BP-based detector are proposed for cooperative ISI channels. Traditionally these two detectors are used with fixed, static channels. In our model, however, the effective channel is periodically time-varying, even when the component channels themselves are static. Consequently, we modify these two detector to account for cooperative ISI channels. Through simulations in frequency selective fading channels, we demonstrate the uncoded performance of the DFSE detector and the BP detector when compared to the optimal MLSE detector. In addition to quantifying the performance of these detectors, we also include an analysis of the implementation complexity as well as a discussion on complexity/performance tradeoffs

A combined channel-modified adaptive array MMSE canceller and viterbi equalizer

In this thesis, a very simple scheme is proposed which couples a maximum-likelihood sequence estimator (MLSE) with a X-element canceller. The method makes use of the MLSE\u27s channel estimator to modify the locally generated training sequence used to calculate the antenna array weights. This method will increase the array\u27s degree of freedom for interference cancellation by allowing the dispersive, desired signal to pass through the array undisturbed. Temporal equalization of the desired signal is then accomplished using maximum-likelihood sequence estimation. The T-spaced channel estimator coefficients and the array weights are obtained simultaneously using the minimum mean square error criteria. The result is a X-element receiver structure capable of canceling X- 1 in-band interferences without compromising temporal equalization

Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental Limits

Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal to interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows even for statistics obtained by under-sampling the received signal. All performance measures are given as a function of the chip waveform and the delay distribution of the users in the large system limit. It turns out that synchronizing users on a chip level impairs performance for all chip waveforms with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off factors. For example, with the pulse shaping demanded in the UMTS standard, user synchronization reduces spectral efficiency up to 12% at 10 dB normalized signal-to-noise ratio. The benefits of asynchronism stem from the finding that the excess bandwidth of chip waveforms actually spans additional dimensions in signal space, if the users are de-synchronized on the chip-level. The analysis of linear MMSE detectors shows that the limiting interference effects can be decoupled both in the user domain and in the frequency domain such that the concept of the effective interference spectral density arises. This generalizes and refines Tse and Hanly's concept of effective interference. In Part II, the analysis is extended to any linear detector that admits a representation as multistage detector and guidelines for the design of low complexity multistage detectors with universal weights are provided

Adaptive DSP Algorithms for UMTS: Blind Adaptive MMSE and PIC Multiuser Detection

A study of the application of blind adaptive Minimum Mean Square Error (MMSE) and Parallel Interference Cancellation (PIC) multiuser detection techniques to Wideband Code Division Multiple Access (WCDMA), the physical layer of Universal Mobile Telecommunication System (UMTS), has been performed as part of the Freeband Adaptive Wireless Networking project. This study was started with an analysis of Code Division Multiple Access (CDMA) and conventional CDMA detection. After that blind adaptive MMSE and PIC detection have been analyzed for general CDMA systems. Then the differences between WCDMA and general CDMA were analyzed and the results have been used to determine how blind adaptive MMSE and PIC can be implemented in WCDMA systems. Blind adaptive MMSE has been implemented inWCDMASim, aWCDMA simulator and some preliminary simulation results obtained with this simulator are presented. These simulation results do not yet show the performance that was expected of blind adaptive MMSE detection based on simulation results obtained in previous research. The cause for these unexpected results is not yet known and will be the subject of further research.\ud Implementation of PIC detection in WCDMASim was found to require changes to the architecture of the WCDMASim simulator. Implementation of these changes and solving the problems with blind adaptive MMSE detection are considered for future work