On Structured-Summary Propagation, LFSR Synchronization, and Low-Complexity Trellis Decoding
Justin Dauwels, Hans‐Andrea Loeliger, Patrick Merkli, Maja Ostojic · 2003
A general idea—message passing with messages that have some nontrivial Markov structure—is outlined. This general idea is worked out for one particular application, viz., the synchronization (state estimation) of “noisy ” linear-feedback shift register sequences. For this application, the flexible tradeoff between performance and complexity is demonstrated by simulation results. Generalizations to lowcomplexity approximations of the BCJR algorithm are outlined. 1