Conference Paper

Reduced-State BCJR-Type Algorithms.

Dipt. di Ingegneria dell'Inf., Parma Univ.
DOI: 10.1109/ICC.2000.853361 Conference: Communications, 2000. ICC 2000. 2000 IEEE International Conference on, Volume: 1
Source: DBLP
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The bit-error rate (BER) performance of new iterative decoding algorithms (e,g,, turbodecoding) is achieved at the expense of a computationally burdensome decoding procedure. We present a method called early detection that can be used to reduce the computational complexity of a variety of iterative decoders. Using a confidence criterion, some information symbols, state variables, and codeword symbols are detected early on during decoding. In this way, the computational complexity of further processing is reduced with a controllable increase in the BER. We present an easily implemented instance of this algorithm, called trellis splicing, that can be used with turbodecoding. For a simulated system of this type, we obtain a reduction in the computational complexity of up to a factor of four, relative to a turbodecoder that obtains the same increase in the BER by performing fewer iterations
    IEEE Journal on Selected Areas in Communications 03/1998; DOI:10.1109/49.661104 · 4.14 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Several structures for fixed-lag (FL) soft-in/soft-out (SISO) algorithms in the case of a perfectly known channel are well-known. These forward-only and bi-directional fixed-lag SISOs have been described with the bi-directional version shown to be preferred. Adaptive iterative detection using adaptive SISOs (A-SISOs) have also been demonstrated to provide significant performance gains for time-varying channels. However, these impressive results have been obtained with fixed-interval, bi-directional A-SISOs and training signals at both ends of the data packet. We combine these results to develop and compare various adaptive, fixed-lag SISOs. Among several reasonable options considered, the preferred A-SISO algorithm is found to be bi-directional with forward-only channel estimation
    Communications, 2000. ICC 2000. 2000 IEEE International Conference on; 02/2000
  • [Show abstract] [Hide abstract]
    ABSTRACT: There has been great interest in reduced complexity suboptimal MAP symbol-by-symbol estimation for digital communications. We propose a new suboptimal estimator suitable for both known and unknown channels. In the known channel case, the MAP estimator is simplified using a form of conditional decision feedback, resulting in a family of Bayesian conditional decision feedback estimators (BCDFEs); in the unknown channel case, recursive channel estimation is combined with the BCDFE. The BCDFEs are indexed by two parameters: a “chip” length and an estimation lag. These algorithms can be used with estimation lags greater than the equivalent channel length and have a complexity exponential in the chip length but only linear in the estimation lags. The BCDFEs are derived from simple assumptions in a model-based setting that takes into account discrete signalling and channel noise. Extensive simulations characterize the performance of the BCDFE and BCDPE for uncoded linear modulations over both known and unknown (nonminimum phase) channels with severe ISI. The results clearly demonstrate the significant advantages of the proposed BCDFE over the BCDFE in achieving a desirable performance/complexity tradeoff. Also, a simple adaptive complexity reduction scheme can be combined with the BCDFE resulting in further substantial reductions in complexity, especially for large constellations. Using this scheme, we demonstrate the feasibility of blind 16QAM demodulation with 10-4 bit error probability at E b/N0≈ 18.5 dB on a channel with a deep spectral null
    IEEE Journal on Selected Areas in Communications 01/1995; 13:155-166. DOI:10.1109/49.363136 · 4.14 Impact Factor

Full-text (2 Sources)

Available from
May 29, 2014