All Publications

Mostrar todo

2015

Stinner, Markus; Olmos, Pablo M

Finite-Length Performance of Multi-Edge Protograph-Based Spatially Coupled LDPC Codes Proceedings Article

En: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 889–893, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.

Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Block codes, Couplings, Decoding, Error analysis, finite length performance, finite-length performance, graph theory, Iterative decoding, low density parity check codes, multiedge protograph, parity check codes, spatially coupled LDPC codes, spatially-coupled LDPC codes, Steady-state

Olmos, Pablo M; Urbanke, Rudiger

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes Artículo de revista

En: IEEE Transactions on Information Theory, vol. 61, no 6, pp. 3164–3184, 2015, ISSN: 0018-9448.

Resumen | Enlaces | BibTeX | Etiquetas: asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes

Olmos, Pablo M; Mitchell, David G M; Costello, Daniel J

Analyzing the Finite-Length Performance of Generalized LDPC Codes Proceedings Article

En: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2683–2687, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.

Resumen | Enlaces | BibTeX | Etiquetas: BEC, binary codes, binary erasure channel, Block codes, Codes on graphs, Decoding, Differential equations, error probability, finite-length generalized LDPC block codes, finite-length performance analysis, generalized LDPC codes, generalized peeling decoder, GLDPC block codes, graph degree distribution, graph theory, Iterative decoding, parity check codes, protographs

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio

Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime Artículo de revista

En: IEEE Communications Letters, vol. 19, no 2, pp. 123–126, 2015, ISSN: 1089-7798.

Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

2014

Cespedes, Javier; Olmos, Pablo M; Sanchez-Fernandez, Matilde; Perez-Cruz, Fernando

Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions Proceedings Article

En: 2014 IEEE International Symposium on Information Theory, pp. 1997–2001, IEEE, Honolulu, 2014, ISBN: 978-1-4799-5186-4.

Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, approximation theory, Channel Coding, channel decoder, communication complexity, complexity, Complexity theory, Detectors, encoding scheme, EP soft bit probability, EP-based soft decision, error statistics, expectation propagation, expectation-maximisation algorithm, expectation-propagation algorithm, Gaussian approximation, Gaussian channels, LDPC, LDPC coded MIMO system, Low Complexity receiver, MIMO, MIMO communication, MIMO communication systems, MIMO receiver, modern communication system, multiple input multiple output, parity check codes, per-antenna soft bit probability, posterior marginalization problem, posterior probability computation, QAM constellation, Quadrature amplitude modulation, radio receivers, signaling, spectral analysis, spectral efficiency maximization, symbol detection, telecommunication signalling, Vectors

Stinner, Markus; Olmos, Pablo M

Analyzing Finite-length Protograph-Based Spatially Coupled LDPC Codes Proceedings Article

En: 2014 IEEE International Symposium on Information Theory, pp. 891–895, IEEE, Honolulu, 2014, ISBN: 978-1-4799-5186-4.

Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, covariance analysis, covariance evolution, Decoding, degree-one check nodes, Error analysis, finite-length protograph, mean evolution, Monte Carlo methods, parity check codes, peeling decoding, protograph-based SC-LDPC codes, spatially coupled low-density parity-check codes, stable decoding phase, Steady-state, Vectors

Olmos, Pablo M; Mitchell, David G M; Truhachev, Dimitri; Costello, Daniel J

Improving the Finite-Length Performance of Long SC-LDPC Code Chains by Connecting Consecutive Chains Proceedings Article

En: 8th IEEE International Symposium on Turbo Codes & Iterative Information Processing, pp. 72–76, IEEE, Bremen, 2014.

Resumen | Enlaces | BibTeX | Etiquetas: Decoding, Error analysis, error probability, Information processing, parity check codes, Turbo codes

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio

Near DT Bound Achieving Linear Codes in the Short Blocklength Regime Artículo de revista

En: IEEE Communications Letters, vol. PP, no 99, pp. 1–1, 2014, ISSN: 1089-7798.

Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

2013

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

Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation Proceedings Article

En: 2013 IEEE International Symposium on Information Theory, pp. 2990–2994, IEEE, Istanbul, 2013, ISSN: 2157-8095.

Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, AWGN channels, BEC, belief propagation decoding, BI-AWGN channel, binary additive white Gaussian noise channel, binary erasure channel, BP estimation, Channel Coding, Complexity theory, error rate reduction, error statistics, Expectation, finite-length codes, Iterative decoding, LDPC codes, LDPC decoding, low-density parity-check decoding, Maximum likelihood decoding, parity check codes, posterior distribution, Propagation, TEP algorithm, tree-structured expectation propagation algorithm, trees (mathematics)

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

Bravo-Santos, Ángel M

Polar Codes for Gaussian Degraded Relay Channels Artículo de revista

En: IEEE Communications Letters, vol. 17, no 2, pp. 365–368, 2013, ISSN: 1089-7798.

Resumen | Enlaces | BibTeX | Etiquetas: channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors

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

Tree Expectation Propagation for ML Decoding of LDPC Codes over the BEC Artículo de revista

En: IEEE Transactions on Communications, vol. 61, no 2, pp. 465–473, 2013, ISSN: 0090-6778.

Resumen | Enlaces | BibTeX | Etiquetas: approximate inference, Approximation algorithms, Approximation methods, BEC, binary codes, binary erasure channel, code graph, Complexity theory, equivalent complexity, Gaussian elimination method, Gaussian processes, generalized tree-structured expectation propagatio, graphical message-passing procedure, graphical models, LDPC codes, Maximum likelihood decoding, maximum likelihood solution, ML decoding, parity check codes, peeling decoder, tree expectation propagation, tree graph, Tree graphs, tree-structured expectation propagation, tree-structured expectation propagation decoder, trees (mathematics)

2012

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

Tree-Structured Expectation Propagation for LDPC Decoding over the AWGN Channel Proceedings Article

En: 2012 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6, IEEE, Santander, 2012, ISSN: 1551-2541.

Resumen | Enlaces | BibTeX | Etiquetas: additive white Gaussian noise channel, Approximation algorithms, Approximation methods, approximation theory, AWGN channel, AWGN channels, belief propagation solution, Bit error rate, Decoding, error floor reduction, finite-length regime, Gain, Joints, LDPC decoding, low-density parity-check decoding, pairwise marginal constraint, parity check codes, TEP decoder, tree-like approximation, tree-structured expectation propagation, trees (mathematics)

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

On the Design of LDPC-Convolutional Ensembles Using the TEP Decoder Artículo de revista

En: IEEE Communications Letters, vol. 16, no 5, pp. 726–729, 2012, ISSN: 1089-7798.

Resumen | Enlaces | BibTeX | Etiquetas: belief propagation decoding, binary erasure channel, channel capacity, Complexity theory, convolutional codes, convolutional LDPC codes, Decoding, design, Error analysis, finite-length analysis, Iterative decoding, LDPC-convolutional ensemble design, LDPCC code decoding, low-density parity-check convolutional code, parity check codes, tree-expectation propagation decoder, tree-structured expectation propagation, window-sliding scheme

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

Bayesian Equalization for LDPC Channel Decoding Artículo de revista

En: IEEE Transactions on Signal Processing, vol. 60, no 5, pp. 2672–2676, 2012, ISSN: 1053-587X.

Resumen | Enlaces | BibTeX | Etiquetas: Approximation methods, Bayes methods, Bayesian equalization, Bayesian estimation problem, Bayesian inference, Bayesian methods, BCJR (Bahl–Cocke–Jelinek–Raviv) algorithm, BCJR algorithm, Channel Coding, channel decoding, channel equalization, channel equalization problem, Channel estimation, channel state information, CSI, Decoding, equalisers, Equalizers, expectation propagation, expectation propagation algorithm, fading channels, graphical model representation, intersymbol interference, Kullback-Leibler divergence, LDPC, LDPC coding, low-density parity-check decoder, Modulation, parity check codes, symbol posterior estimates, Training

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

Finite-Length Analysis of the TEP Decoder for LDPC Ensembles over the BEC Proceedings Article

En: 2012 IEEE International Symposium on Information Theory Proceedings, pp. 2346–2350, IEEE, Cambridge, MA, 2012, ISSN: 2157-8095.

Resumen | Enlaces | BibTeX | Etiquetas: Approximation methods, BEC, binary codes, binary erasure channel, Decoding, Error analysis, error probability, finite-length analysis, LDPC ensembles, low-density parity check ensembles, parity check codes, TEP decoder, Trajectory, tree-expectation propagation algorithm, waterfall region

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

Finite-Length Performance of Spatially-Coupled LDPC Codes under TEP Decoding Proceedings Article

En: 2012 IEEE Information Theory Workshop, pp. 1–6, IEEE, Lausanne, 2012, ISBN: 978-1-4673-0223-4.

Enlaces | BibTeX | Etiquetas: asymptotic limit, belief propagation decoding, Complexity theory, convolutional codes, convolutional LDPC codes, Decoding, decoding latency, decoding threshold, erasure channel, Error analysis, error rates, finite-length analysis, finite-length performance, maximum a posteriori threshold, maximum likelihood estimation, parity check codes, regular sparse codes, spatially-coupled LDPC codes, TEP decoding, tree-structured expectation propagation, underlying regular code, very large code length, window-sliding scheme

2011

Olmos, Pablo M; Urbanke, Rudiger

Scaling Behavior of Convolutional LDPC Ensembles over the BEC Proceedings Article

En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 1816–1820, IEEE, Saint Petersburg, 2011, ISSN: 2157-8095.

Resumen | Enlaces | BibTeX | Etiquetas: BEC, binary codes, binary erasure channel, Bit error rate, convolutional codes, convolutional LDPC ensembles, coupled sparse graph codes, Couplings, Decoding, error probability, Iterative decoding, parity check codes, scaling behavior

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

Capacity Achieving LDPC Ensembles for the TEP Decoder in Erasure Channels Proceedings Article

En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2398–2402, IEEE, St. Petersburg, 2011, ISSN: 2157-8095.

Resumen | Enlaces | BibTeX | Etiquetas: BP threshold, Complexity theory, Decoding, Differential equations, erasure channels, fixed-rate code, Iterative decoding, LDPC, low-density parity-check codes, MAP capacity, MAP threshold, optimisation, Optimization, optimization problem, parity check codes, TEP decoder, tree-expectation propagation decoder

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

MAP Decoding for LDPC Codes over the Binary Erasure Channel Proceedings Article

En: 2011 IEEE Information Theory Workshop, pp. 145–149, IEEE, Paraty, 2011, ISBN: 978-1-4577-0437-6.

Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Channel Coding, computational complexity, Decoding, generalized peeling decoder, generalized tree-structured expectation propagatio, graphical models, Iterative decoding, LDPC codes, MAP decoding, MAP decoding algorithm, Maximum likelihood decoding, parity check codes, TEP decoder, tree graph theory, Tree graphs, tree-structured expectation propagation, trees (mathematics)

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

Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes Artículo de revista

En: IEEE Communications Letters, vol. 15, no 2, pp. 235–237, 2011, ISSN: 1089-7798.

Resumen | Enlaces | BibTeX | Etiquetas: belief propagation decoder, BP algorithm, BP decoder, code graph, communication complexity, computational complexity, Decoding, finite-length analysis, finite-length low-density parity-check code, LDPC code, LDPC decoding, parity check codes, radiowave propagation, stopping set, TEP algorithm, TEP decoder, tree-structured expectation propagation

2010

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

Tree-Structure Expectation Propagation for Decoding LDPC Codes over Binary Erasure Channels Proceedings Article

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

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

Channel Decoding with a Bayesian Equalizer Proceedings Article

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

Resumen | Enlaces | BibTeX | Etiquetas: a posteriori probability, Bayesian equalizer, Bayesian methods, BER, Bit error rate, Channel Coding, channel decoding, channel estate information, Communication channels, Decoding, equalisers, Equalizers, error statistics, low-density parity-check decoders, LPDC decoders, Maximum likelihood decoding, maximum likelihood detection, maximum likelihood estimation, Noise reduction, parity check codes, Probability, Uncertainty

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

Joint Nonlinear Channel Equalization and Soft LDPC Decoding with Gaussian Processes Artículo de revista

En: IEEE Transactions on Signal Processing, vol. 58, no 3, pp. 1183–1192, 2010, ISSN: 1053-587X.

Resumen | Enlaces | BibTeX | Etiquetas: Bayesian nonlinear classification tool, Bit error rate, Channel Coding, channel equalizers, Channel estimation, Coding, equalisers, equalization, error statistics, Gaussian processes, GPC, joint nonlinear channel equalization, low-density parity-check (LDPC), low-density parity-check channel decoder, Machine learning, nonlinear channel, nonlinear codes, parity check codes, posterior probability estimates, soft LDPC decoding, soft-decoding, support vector machine (SVM)

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

2009

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

Optimized Concatenated LDPC Codes for Joint Source-Channel Coding Proceedings Article

En: 2009 IEEE International Symposium on Information Theory, pp. 2131–2135, IEEE, Seoul, 2009, ISBN: 978-1-4244-4312-3.

Resumen | Enlaces | BibTeX | Etiquetas: approximation theory, asymptotic behavior analysis, Channel Coding, combined source-channel coding, Concatenated codes, Decoding, Entropy, EXIT chart, extrinsic information transfer, H infinity control, Information analysis, joint belief propagation decoder, joint source-channel coding, low-density-parity-check code, optimized concatenated independent LDPC codes, parity check codes, Redundancy, source coding, transmitter, Transmitters