A new SISO algorithm with application to turbo equalization
Abstract
In this paper we propose a new soft-input soft-output equalization algorithm, offering very good performance/complexity tradeoffs. It follows the structure of the BCJR algorithm, but dynamically constructs a simplified trellis during the forward recursion. In each trellis section, only the M states with the strongest forward metric are preserved, similar to the M-BCJR algorithm. Unlike the M-BCJR, however, the remaining states are not deleted, but rather merged into the surviving states. The new algorithm compares favorably with the reduced-state BCJR algorithm, offering better performance and more flexibility, particularly for systems with higher order modulations.
Cite
@article{arxiv.cs/0504017,
title = {A new SISO algorithm with application to turbo equalization},
author = {Marcin Sikora and Daniel J. Costello},
journal= {arXiv preprint arXiv:cs/0504017},
year = {2007}
}
Comments
5 pages, 7 figures, submitted to 2005 IEEE International Symposium on Information Theory