On Structured-Summary Propagation, LFSR Synchronization, and Low-Complexity Trellis Decoding
Year: 2003
Type: conference-paper
Abstract: 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
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Office of Naval Research
Award: G3982489727
OpenAlex ID: W177395129
