All Publications

Mostrar todo

2013

Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Tree-Structure Expectation Propagation for LDPC Decoding Over the BEC Artículo de revista

En: IEEE Transactions on Information Theory, vol. 59, no. 6, pp. 3354–3377, 2013, ISSN: 0018-9448.

Resumen | Enlaces | BibTeX | Etiquetas: Algorithm design and analysis, Approximation algorithms, Approximation methods, BEC, belief propagation, Belief-propagation (BP), binary erasure channel, Complexity theory, decode low-density parity-check codes, Decoding, discrete memoryless channels, expectation propagation, finite-length analysis, LDPC codes, LDPC decoding, parity check codes, peeling-type algorithm, Probability density function, random graph evolution, Tanner graph, tree-structure expectation propagation

Salamanca, Luis; Olmos, Pablo M; Perez-Cruz, Fernando; Murillo-Fuentes, Juan Jose

Tree-Structured Expectation Propagation for LDPC Decoding over BMS Channels Artículo de revista

En: IEEE Transactions on Communications, vol. 61, no. 10, pp. 4086–4095, 2013, ISSN: 0090-6778.

Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, BEC, belief propagation, binary erasure channel, binary memoryless symmetric channels, BMS channels, Channel Coding, Complexity theory, convolutional codes, convolutional low-density parity-check codes, Decoding, decoding block, expectation propagation, finite-length codes, LDPC decoding, message-passing algorithm, parity check codes, Probability density function, sparse linear codes, TEP algorithm, tree-structured expectation propagation, trees (mathematics), Vegetation

2010

Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Tree-Structure Expectation Propagation for Decoding LDPC Codes over Binary Erasure Channels Artículo en actas

En: 2010 IEEE International Symposium on Information Theory, pp. 799–803, IEEE, Austin, TX, 2010, ISBN: 978-1-4244-7892-7.

Resumen | Enlaces | BibTeX | Etiquetas: belief propagation, binary erasure channels, Bipartite graph, BP decoder, Capacity planning, Channel Coding, codeword, computational complexity, Decoding, Finishing, graph theory, H infinity control, LDPC code decoding, LDPC Tanner graph, Maxwell decoder, parity check codes, Performance analysis, tree structure expectation propagation, trees (mathematics), Upper bound

Fresia, Maria; Perez-Cruz, Fernando; Poor, Vincent H; Verdu, Sergio

Joint Source and Channel Coding Artículo de revista

En: IEEE Signal Processing Magazine, vol. 27, no. 6, pp. 104–113, 2010, ISSN: 1053-5888.

Resumen | Enlaces | BibTeX | Etiquetas: belief propagation, Channel Coding, combined source-channel coding, Decoding, Encoding, graphical model, Hidden Markov models, Iterative decoding, joint source channel coding, JSC coding, LDPC code, low density parity check code, Markov processes, parity check codes, Slepian-Wolf problem, variable length codes