Alternative structure for computing APPs of the markov source

DOI10.1109/TIT.2003.809500MaRDI QIDQ4680069zbMATH OpenFDO

Authors Jong Seung Park, Jaekyun Moon

Publication date 1 June 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2003.809500

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A posteriori probability decoding of convolutional codes
• Recursive Kalman-type optimal estimation and detection of hidden Markov chains
• Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels
• Complexity of strings in the class of Markov sources
• Baum's forward-backward algorithm revisited

Cited in

(1)

• On memory redundancy in the BCJR algorithm for nonrecursive shift register processes

This page was built for publication: Alternative structure for computing APPs of the markov source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680069)