Maximum a posteriori state estimation: a neural processing algorithm

2003 ◽  
Author(s):  
S.I. Sudharsanan ◽  
M.K. Sundareshan
Keyword(s):  
State Estimation ◽  
Processing Algorithm ◽  
Maximum A Posteriori ◽  
Neural Processing ◽  
A Posteriori

scholarly journals Threshold Computation for Spatially Coupled Turbo-Like Codes on the AWGN Channel

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 240
Author(s):  
Muhammad Umar Farooq ◽  
Alexandre Graell i Amat ◽  
Michael Lentmaier
Keyword(s):  
Gaussian Noise ◽  
Belief Propagation ◽  
Additive White Gaussian Noise ◽  
Maximum A Posteriori ◽  
Prediction Methods ◽  
Threshold Analysis ◽  
A Posteriori ◽  
Awgn Channel ◽  
Efficient Prediction ◽  
Binary Erasure Channel

In this paper, we perform a belief propagation (BP) decoding threshold analysis of spatially coupled (SC) turbo-like codes (TCs) (SC-TCs) on the additive white Gaussian noise (AWGN) channel. We review Monte-Carlo density evolution (MC-DE) and efficient prediction methods, which determine the BP thresholds of SC-TCs over the AWGN channel. We demonstrate that instead of performing time-consuming MC-DE computations, the BP threshold of SC-TCs over the AWGN channel can be predicted very efficiently from their binary erasure channel (BEC) thresholds. From threshold results, we conjecture that the similarity of MC-DE and predicted thresholds is related to the threshold saturation capability as well as capacity-approaching maximum a posteriori (MAP) performance of an SC-TC ensemble.

scholarly journals Congested Link Inference Algorithms in Dynamic Routing IP Network

2017 ◽  
Vol 2017 ◽  
pp. 1-17
Author(s):  
Yu Chen ◽  
Zhe-min Duan
Keyword(s):  
Markov Property ◽  
Variable Structure ◽  
Dynamic Routing ◽  
Simplified Model ◽  
Maximum A Posteriori ◽  
A Posteriori ◽  
Bayesian Network Model ◽  
Inference Algorithms ◽  
Ip Network ◽  
Link Congestion

The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB) network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP) and Rest Bayesian Network Model (RBNM), we proposed an Improved CLINK (ICLINK) algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient) to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Sign in / Sign up

Export Citation Format

Share Document