List of Publications (2008-2017)

Show all

2016

Journal Articles

Bocharova, Irina; i Fàbregas, Albert Guillén; Kudryashov, Boris; Martinez, Alfonso; Campo, Adria Tauste; Vazquez-Vilar, Gonzalo

Multi-Class Source-Channel Coding (Journal Article)

IEEE Transactions on Information Theory, 62 (9), pp. 5093 – 5104, 2016.

(Abstract | Links | BibTeX | Tags: Channel Coding, Complexity theory, error probability, Indexes, Journal, Maximum likelihood decoding)

Stinner, Markus; Olmos, Pablo

On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs (Journal Article)

IEEE Journal on Selected Areas in Communications, 34 (2), pp. 345–361, 2016, ISSN: 0733-8716.

(Abstract | Links | BibTeX | Tags: Analytical models, capacity-achieving codes, Complexity theory, Couplings, Decoding, Encoding, finite-length analysis, Iterative decoding, Low-density parity-check (LDPC) codes, spatially coupled LDPC codes constructed from prot)

2015

Journal Articles

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

Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime (Journal Article)

IEEE Communications Letters, 19 (2), pp. 123–126, 2015, ISSN: 1089-7798.

(Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding)

Inproceedings

Santos, Irene; Murillo-Fuentes, Juan Jose; Olmos, Pablo

Block Expectation Propagation Equalization for ISI Channels (Inproceeding)

2015 23rd European Signal Processing Conference (EUSIPCO), pp. 379–383, IEEE, Nice, 2015, ISBN: 978-0-9928-6263-3.

(Abstract | Links | BibTeX | Tags: Approximation algorithms, Approximation methods, BCJR algorithm, channel equalization, Complexity theory, Decoding, Equalizers, expectation propagation, ISI, low complexity, Signal processing algorithms)

2014

Journal Articles

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

Near DT Bound Achieving Linear Codes in the Short Blocklength Regime (Journal Article)

IEEE Communications Letters, PP (99), pp. 1–1, 2014, ISSN: 1089-7798.

(Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding)

Inproceedings

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

Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions (Inproceeding)

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

(Abstract | Links | BibTeX | Tags: 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)

2013

Journal Articles

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

Tree-Structure Expectation Propagation for LDPC Decoding Over the BEC (Journal Article)

IEEE Transactions on Information Theory, 59 (6), pp. 3354–3377, 2013, ISSN: 0018-9448.

(Abstract | Links | BibTeX | Tags: 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; Perez-Cruz, Fernando; Murillo-Fuentes, Juan Jose

Tree-Structured Expectation Propagation for LDPC Decoding over BMS Channels (Journal Article)

IEEE Transactions on Communications, 61 (10), pp. 4086–4095, 2013, ISSN: 0090-6778.

(Abstract | Links | BibTeX | Tags: 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)

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

Tree Expectation Propagation for ML Decoding of LDPC Codes over the BEC (Journal Article)

IEEE Transactions on Communications, 61 (2), pp. 465–473, 2013, ISSN: 0090-6778.

(Abstract | Links | BibTeX | Tags: 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))

Inproceedings

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

Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation (Inproceeding)

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

(Abstract | Links | BibTeX | Tags: 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))

2012

Journal Articles

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

On the Design of LDPC-Convolutional Ensembles Using the TEP Decoder (Journal Article)

IEEE Communications Letters, 16 (5), pp. 726–729, 2012, ISSN: 1089-7798.

(Abstract | Links | BibTeX | Tags: 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)

Inproceedings

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

Finite-Length Performance of Spatially-Coupled LDPC Codes under TEP Decoding (Inproceeding)

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

(Links | BibTeX | Tags: 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

Journal Articles

Vazquez, Manuel; Miguez, Joaquin

A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output (Journal Article)

IEEE Transactions on Vehicular Technology, 60 (9), pp. 4415–4426, 2011, ISSN: 0018-9545.

(Abstract | Links | BibTeX | Tags: Channel estimation, communication channel, Complexity theory, dynamic programming, frequency-selective MIMO channel, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channel impulse response coefficient, MIMO communication, MIMO transmission system, multipath channels, mutiple-input–multiple-output (MIMO), per-survivor processing receiver, Receiving antennas, Signal processing algorithms, time-selective MIMO channel, Transmitting antennas, Viterbi algorithm)

Inproceedings

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

Capacity Achieving LDPC Ensembles for the TEP Decoder in Erasure Channels (Inproceeding)

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

(Abstract | Links | BibTeX | Tags: 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)