2005/04/06 by Marcin Sikora, Sikora, Marcin, Daniel J. Costello +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Blind Source Separation Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.cs/0504017
5 pages, 7 figures, submitted to 2005 IEEE International Symposium on Information Theory
arxiv created 2005/04/06 · openalex publication_date 2005/04/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.