A new SISO algorithm with application to turbo equalization

Simple item page
dc.creatorSikora, Marcin
dc.creatorCostello Jr, Daniel J.
dc.date2005-04-06
dc.date.accessioned2026-07-07T08:15:24Z
dc.date.available2026-07-07T08:15:24Z
dc.descriptionIn 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.
dc.description5 pages, 7 figures, submitted to 2005 IEEE International Symposium on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0504017
dc.identifierhttp://arxiv.org/abs/cs/0504017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133438
dc.subjectInformation Theory
dc.titleA new SISO algorithm with application to turbo equalization
dc.typetext

Files

Collections

arXiv