A new SISO algorithm with application to turbo equalization
Marcin Sikora, Daniel J. Costello · 2005
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
Cited by 32 works. doi:10.1109/isit.2005.1523702 Open-access PDF
Authors
References
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
- Sequential Coding Algorithms: A Survey and Cost Analysis
- Minimum mean squared error equalization using a priori information
- Turbo equalization
- Concatenated decoding with a reduced-search BCJR algorithm
- High-performance low-memory interleaver banks for turbo-codes
- Reduced-state BCJR-type algorithms