Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Jonathan S. Yedidia"'
Publikováno v:
Biologically Inspired Cognitive Architectures. 8:109-119
In this paper we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit task knowledge to improve solution speed and quality. Given this context, we focus o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdfa9116cc1f7a7f52f116a6aeb12139
https://doi.org/10.1016/j.bica.2014.03.007
https://doi.org/10.1016/j.bica.2014.03.007
Publikováno v:
IEEE Transactions on Information Theory. 59:4553-4583
We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of "hierarchical" quasi-cyclic (HQC) LDPC co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a56098acf5e97693c4cd3d0d2b39b1aa
https://doi.org/10.1109/tit.2013.2253512
https://doi.org/10.1109/tit.2013.2253512
Autor:
Jonathan S. Yedidia
Publikováno v:
Journal of Statistical Physics. 145:860-890
Message-passing algorithms can solve a wide variety of optimization, inference, and constraint satisfaction problems. The algorithms operate on factor graphs that visually represent and specify the structure of the problems. After describing some of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f47c54f0b974c42f1123198c28b64060
https://doi.org/10.1007/s10955-011-0384-7
https://doi.org/10.1007/s10955-011-0384-7
Publikováno v:
IEEE Transactions on Information Theory. 57:5151-5162
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information accumulation. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68b63583fbe6005d4d9330f1a86619f1
https://doi.org/10.1109/tit.2011.2158477
https://doi.org/10.1109/tit.2011.2158477
Publikováno v:
IEEE Transactions on Information Theory. 57:786-802
The “Divide and Concur” (DC) algorithm introduced by Gravel and Elser can be considered a competitor to the belief propagation (BP) algorithm, in that both algorithms can be applied to a wide variety of constraint satisfaction, optimization, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f74fe546aba6ab1c66b1b762a6e5902
https://doi.org/10.1109/tit.2010.2094815
https://doi.org/10.1109/tit.2010.2094815
Publikováno v:
Journal of Lightwave Technology. 25:2879-2886
We describe simple iterative decoders for low-density parity-check codes based on Euclidean geometries, suitable for practical very-large-scale-integration implementation in applications requiring very fast decoders. The decoders are based on shuffle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11fbbf751e3ac011c2b57984ca23b037
https://doi.org/10.1109/jlt.2007.903311
https://doi.org/10.1109/jlt.2007.903311
Publikováno v:
IEEE Transactions on Communications. 55:1099-1102
We investigate the performance of iterative decoding algorithms for multistep majority logic decodable (MSMLD) codes of intermediate length. We introduce a new bit-flipping algorithm that is able to decode these codes nearly as well as a maximum-like
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd360bc6928f64519015070c138a3137
https://doi.org/10.1109/tcomm.2007.898699
https://doi.org/10.1109/tcomm.2007.898699
Publikováno v:
IEEE Transactions on Information Theory. 53:1644-1663
Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa5a0edafe1ccb517a4fa6b126f2e1f
https://doi.org/10.1109/tit.2007.894683
https://doi.org/10.1109/tit.2007.894683
Publikováno v:
IEEE Transactions on Information Theory. 51:2282-2312
Important inference problems in statistical physics, computer vision, error-correcting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bf94d201a166618e287aa82d24bb7db
https://doi.org/10.1109/tit.2005.850085
https://doi.org/10.1109/tit.2005.850085
Publikováno v:
Physical Review B. 46:14686-14701
We derive a variational replica-symmetry-breaking theory for the effect of random impurities on equilibrium properties of general ordered (crystalline) structures, in particular two- and three-dimensional vortex lattices and magnetic bubble films. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c79b845b0cf9837b0170c374726e099
https://doi.org/10.1103/physrevb.46.14686
https://doi.org/10.1103/physrevb.46.14686