1,186 research outputs found

    Parallel Interference Cancellation Based Turbo Space-Time Equalization in the SDMA Uplink

    No full text
    A novel Parallel Interference Cancellation (PIC) based turbo Space Time Equalizer (STE) structure designed for multiple antenna assisted uplink receivers is introduced. The proposed receiver structure allows the employment of non-linear type of detectors such as the Bayesian Decision Feedback (DF) assisted turbo STE or the Maximum Aposteriori (MAP) STE, while operating at a moderate computational cost. Receivers based on the proposed structure outperform the linear turbo detector benchmarker based on the Minimum Mean-Squared Error (MMSE) criterion, even if the latter aims for jointly detecting all transmitters’ signals. Additionally the PIC based receiver is capable of equalizing non-linear binary pre-coded channels. The performance difference between the presented algorithms is discussed using Extrinsic Information Transferfunction (EXIT) charts. Index Terms—PIC, EXIT chart, precoding, Bayesian, STE

    Coded Modulation Assisted Radial Basis Function Aided Turbo Equalisation for Dispersive Rayleigh Fading Channels

    No full text
    In this contribution a range of Coded Modulation (CM) assisted Radial Basis Function (RBF) based Turbo Equalisation (TEQ) schemes are investigated when communicating over dispersive Rayleigh fading channels. Specifically, 16QAM based Trellis Coded Modulation (TCM), Turbo TCM (TTCM), Bit-Interleaved Coded Modulation (BICM) and iteratively decoded BICM (BICM-ID) are evaluated in the context of an RBF based TEQ scheme and a reduced-complexity RBF based In-phase/Quadrature-phase (I/Q) TEQ scheme. The Least Mean Square (LMS) algorithm was employed for channel estimation, where the initial estimation step-size used was 0.05, which was reduced to 0.01 for the second and the subsequent TEQ iterations. The achievable coding gain of the various CM schemes was significantly increased, when employing the proposed RBF-TEQ or RBF-I/Q-TEQ rather than the conventional non-iterative Decision Feedback Equaliser - (DFE). Explicitly, the reduced-complexity RBF-I/Q-TEQ-CM achieved a similar performance to the full-complexity RBF-TEQ-CM, while attaining a significant complexity reduction. The best overall performer was the RBF-I/Q-TEQ-TTCM scheme, requiring only 1.88~dB higher SNR at BER=10-5, than the identical throughput 3~BPS uncoded 8PSK scheme communicating over an AWGN channel. The coding gain of the scheme was 16.78-dB

    Decision Feedback Aided Bayesian Turbo Space-Time Equalizer for Parallel Interference Cancellation in SDMA Systems

    No full text
    A novel Bayesian Decision-Feedback aided turbo Space-Time Equalizer (DF-STE) combined with a Parallel Interference Cancellation (PIC) scheme and designed for multiple antenna assisted receivers is introduced. The proposed receiver structure allows the employment of a non-linear Bayesian turbo DF-STE operating at a moderate computational cost, which outperforms the linear turbo detector benchmarker based on the Minimum Mean-Squared Error (MMSE) criterion, even if the latter aims for jointly detecting all transmitters’ signals

    Iterative joint channel and data estimation for rank-deficient MIMO-OFDM

    No full text
    In this paper we propose a turbo-detected multi-antenna-multi-carrier receiver scheme. Following the philosophy of the turbo processing, our turbo MIMO-OFDM receiver comprises a succession of detection modules, namely the channel estimator, the space-time detector and the decoder, which iteratively exchange soft bit-related information and thus facilitate a substantial improvement of the overall system performance. In this paper we analyze the achievable performance of the iterative system proposed with the aim of documenting the various design trade-offs, such as the achievable error-rate performance, the attainable data-rate as well as the associated computational complexity. Specifically, we report a virtually error-free performance for a rate-1/2 turbo-coded 8x8-QPSK-OFDM system, exhibiting an effective throughput of 8*2/2=8 bits/sec/Hz and having a pilot overhead of only 10%, at SNR of 7.5dB and normalized Doppler frequency of 0.003, which corresponds to a mobile terminal speed of about 65 km/h

    Turbo Decoding and Detection for Wireless Applications

    Get PDF
    A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted

    Soft-Decision-Driven Channel Estimation for Pipelined Turbo Receivers

    Full text link
    We consider channel estimation specific to turbo equalization for multiple-input multiple-output (MIMO) wireless communication. We develop a soft-decision-driven sequential algorithm geared to the pipelined turbo equalizer architecture operating on orthogonal frequency division multiplexing (OFDM) symbols. One interesting feature of the pipelined turbo equalizer is that multiple soft-decisions become available at various processing stages. A tricky issue is that these multiple decisions from different pipeline stages have varying levels of reliability. This paper establishes an effective strategy for the channel estimator to track the target channel, while dealing with observation sets with different qualities. The resulting algorithm is basically a linear sequential estimation algorithm and, as such, is Kalman-based in nature. The main difference here, however, is that the proposed algorithm employs puncturing on observation samples to effectively deal with the inherent correlation among the multiple demapper/decoder module outputs that cannot easily be removed by the traditional innovations approach. The proposed algorithm continuously monitors the quality of the feedback decisions and incorporates it in the channel estimation process. The proposed channel estimation scheme shows clear performance advantages relative to existing channel estimation techniques.Comment: 11 pages; IEEE Transactions on Communications 201

    Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems with Co-Channel Interference

    Full text link
    In this paper, efficient turbo packet combining for single carrier (SC) broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat request (ARQ) transmission with unknown co-channel interference (CCI) is studied. We propose a new frequency domain soft minimum mean square error (MMSE)-based signal level combining technique where received signals and channel frequency responses (CFR)s corresponding to all retransmissions are used to decode the data packet. We provide a recursive implementation algorithm for the introduced scheme, and show that both its computational complexity and memory requirements are quite insensitive to the ARQ delay, i.e., maximum number of ARQ rounds. Furthermore, we analyze the asymptotic performance, and show that under a sum-rank condition on the CCI MIMO ARQ channel, the proposed packet combining scheme is not interference-limited. Simulation results are provided to demonstrate the gains offered by the proposed technique.Comment: 12 pages, 7 figures, and 2 table

    Frequency-Domain Turbo Equalisation in Coded SC-FDMA Systems: EXIT Chart Analysis and Performance

    No full text
    In this paper, we investigate the achievable performance of channel coded single-carrier frequency division multiple-access (SC-FDMA) systems employing various detection schemes, when communicating over frequency-selective fading channels. Specifically, three types of minimum mean-square error (MMSE) based frequency-domain (FD) turbo equalisers are considered. The first one is the turbo FD linear equaliser (LE). The second one is a parallel interference cancellation (PIC)-assisted turbo FD decision-feedback equaliser (DFE). The final one is the proposed hybrid interference cancellation (HIC)-aided turboFD-DFE, which combines successive interference cancellation (SIC) with iterative PIC and decoding. The benefit of interference cancellation (IC) is analysed with the EXtrinsic Information Transfer (EXIT) charts. The performance of the coded SC-FDMA systems employing the above-mentioned detection schemes is investigated with the aid of simulations. Our studies show that the IC techniques achieve an attractive performance at a moderate complexity

    Linear MMSE-Optimal Turbo Equalization Using Context Trees

    Get PDF
    Formulations of the turbo equalization approach to iterative equalization and decoding vary greatly when channel knowledge is either partially or completely unknown. Maximum aposteriori probability (MAP) and minimum mean square error (MMSE) approaches leverage channel knowledge to make explicit use of soft information (priors over the transmitted data bits) in a manner that is distinctly nonlinear, appearing either in a trellis formulation (MAP) or inside an inverted matrix (MMSE). To date, nearly all adaptive turbo equalization methods either estimate the channel or use a direct adaptation equalizer in which estimates of the transmitted data are formed from an expressly linear function of the received data and soft information, with this latter formulation being most common. We study a class of direct adaptation turbo equalizers that are both adaptive and nonlinear functions of the soft information from the decoder. We introduce piecewise linear models based on context trees that can adaptively approximate the nonlinear dependence of the equalizer on the soft information such that it can choose both the partition regions as well as the locally linear equalizer coefficients in each region independently, with computational complexity that remains of the order of a traditional direct adaptive linear equalizer. This approach is guaranteed to asymptotically achieve the performance of the best piecewise linear equalizer and we quantify the MSE performance of the resulting algorithm and the convergence of its MSE to that of the linear minimum MSE estimator as the depth of the context tree and the data length increase.Comment: Submitted to the IEEE Transactions on Signal Processin
    corecore