.png){kind=icon}
.png){kind=icon}
Return
Approximate inference in hidden Markov models using iterative active state selection
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2005.861600.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The inferential task of computing the marginal posterior probability mass functions of state variables and pairs of consecutive state variables of a hidden Markov model is considered. This can be exactly and efficiently performed using a message passing scheme such as the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. We present a novel iterative reduced complexity variation of the BCJR algorithm that uses reduced support approximations for the forward and backward messages, as in the M-BCJR algorithm. Forward[backward message computation is based on the concept of expectation propagation, which results in analgorithm similar to the M-BCJR algorithm with the active state selection criterion being changed from the filtered distribution of state variables to beliefs of state variables. By allowing possibly different supports for the forward and backward messages, we derive identical forward and backward recursions that can be iterated. Simulation results of application for trellis-based equalization of a wireless communication system confirm the improved performance over the M-BCJR algorithm.
Keywords:
deterministic algorithms
equalizers
hidden Markov models (HMMs)
message passing
state space methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available