A new SISO algorithm with application to turbo equalization
Marcin Sikora, Daniel J. Costello
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.
Create a lesson
Related papers
Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
Xuefei Wu, Qi Liu, Yingchun Chen et al.
Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition
Vladimir Jacimovic
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia et al.
A Mirror Vanishing Band for Weight Distributions of Binary Linear Codes
Xianmang He
Tri-Hybrid Beamforming Design for Large-Scale MIMO ISAC Systems
Tianyu Fang, Mengyuan Ma, Markku Juntti et al.
Equivalence Between Nested Gibbs Measures and Log-Linear Combinations of Gibbs Measures
Yaiza Bermudez, Samir M. Perlaza, Iñaki Esnaola