By Topic

A reduced-complexity algorithm for combined equalization and decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Raphaeli, Dan ; Dept. of Electr. Eng. Syst., Tel Aviv Univ., Israel ; Kaitz, T.

This paper presents a new application of a suboptimal trellis decoding algorithm for combined equalization and decoding. The proposed algorithm can outperform the reduced-state sequence estimator (RSSE) of the same order of complexity. The algorithm, termed estimated future decision-feedback algorithm (EFDFA), was originally proposed for the problem of noncoherent decoding with multiple-symbol overlapped observations and is now reformulated for the problem of intersymbol interference inflicted channels. The EFDFA uses the RSSE as a building block. The performance improvement is achieved by using estimated future symbols in the decision process. The estimated future symbols are obtained by RSSE decoding time-reversed blocks of the input. The same technique can be used to greatly enhance the performance of the conventional decision-feedback equalizer. An analysis of the performance of the EFDFA based on the performance of the RSSE is described. The EFDFA can be configured as an adaptive equalizer capable of operating in a time-varying environment, and is shown to perform well in fading conditions. With only minor additional complexity, the EFDFA is also capable of producing soft outputs.

Published in:

Communications, IEEE Transactions on  (Volume:48 ,  Issue: 11 )