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
@inproceedings{Stinner2015,
title = {Finite-Length Performance of Multi-Edge Protograph-Based Spatially Coupled LDPC Codes},
author = {Markus Stinner and Pablo M Olmos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7282583},
doi = {10.1109/ISIT.2015.7282583},
isbn = {978-1-4673-7704-1},
year = {2015},
date = {2015-06-01},
booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
pages = {889--893},
publisher = {IEEE},
address = {Hong Kong},
abstract = {The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes over the binary erasure channel (BEC) is analyzed. Existing scaling laws are extended to arbitrary protograph base matrices that include puncturing patterns and multiple edges between nodes. A regular protograph-based SC-LDPC construction based on the (4; 8)-regular LDPC block code works well in the waterfall region compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-off. Scaling laws are also used for code design and to estimate the block length of a given SC-LDPC code ensemble to match the performance of some other code. Estimates on the performance degradation are developed if the chain length varies.},
keywords = {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},
pubstate = {published},
tppubtype = {inproceedings}
}
2014
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
@inproceedings{Stinner2014,
title = {Analyzing Finite-length Protograph-Based Spatially Coupled LDPC Codes},
author = {Markus Stinner and Pablo M Olmos},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6874961},
isbn = {978-1-4799-5186-4},
year = {2014},
date = {2014-01-01},
booktitle = {2014 IEEE International Symposium on Information Theory},
pages = {891--895},
publisher = {IEEE},
address = {Honolulu},
abstract = {The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is given and an estimate for the covariance evolution of degree-one check nodes is proposed in the stable decoding phase where the decoding wave propagates along the chain of coupled codes. Both results are verified numerically. Protograph-based SC-LDPC codes turn out to have a more robust behavior than unstructured random SC-LDPC codes. Using the analytically calculated parameters, the finite-length scaling laws for these constructions are given and verified by numerical simulations.},
keywords = {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},
pubstate = {published},
tppubtype = {inproceedings}
}
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
@inproceedings{Olmos2014,
title = {Improving the Finite-Length Performance of Long SC-LDPC Code Chains by Connecting Consecutive Chains},
author = {Pablo M Olmos and David G M Mitchell and Dimitri Truhachev and Daniel J Costello},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6955088},
year = {2014},
date = {2014-01-01},
booktitle = {8th IEEE International Symposium on Turbo Codes \& Iterative Information Processing},
pages = {72--76},
publisher = {IEEE},
address = {Bremen},
abstract = {We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using long spatially coupled low-density parity-check (SC-LDPC) code chains. First, we show that the decoding of SC-LDPC code chains is more reliable for shorter chain lengths, i.e., the scaling between block error rate and gap to threshold is more favorable for shorter chains. This motivates the use of CC transmission in which, instead of transmitting a sequence of independent codewords from a long SC-LDPC chain, we connect multiple chains in a layered format, where encoding, transmission, and decoding are now performed in a continuous fashion. Finally, we show that CC transmission can be implemented with only a small increase in decoding complexity or delay with respect to a system employing a single SC-LDPC code chain for transmission},
keywords = {Decoding, Error analysis, error probability, Information processing, parity check codes, Turbo codes},
pubstate = {published},
tppubtype = {inproceedings}
}
2012
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
@inproceedings{Olmos2012,
title = {Finite-Length Performance of Spatially-Coupled LDPC Codes under TEP Decoding},
author = {Pablo M Olmos and Fernando Perez-Cruz and Luis Salamanca and Juan Jose Murillo-Fuentes},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6404722},
isbn = {978-1-4673-0223-4},
year = {2012},
date = {2012-01-01},
booktitle = {2012 IEEE Information Theory Workshop},
pages = {1--6},
publisher = {IEEE},
address = {Lausanne},
keywords = {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},
pubstate = {published},
tppubtype = {inproceedings}
}
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
@inproceedings{Olmos2012a,
title = {Finite-Length Analysis of the TEP Decoder for LDPC Ensembles over the BEC},
author = {Pablo M Olmos and Fernando Perez-Cruz and Luis Salamanca and Juan Jose Murillo-Fuentes},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6283932},
issn = {2157-8095},
year = {2012},
date = {2012-01-01},
booktitle = {2012 IEEE International Symposium on Information Theory Proceedings},
pages = {2346--2350},
publisher = {IEEE},
address = {Cambridge, MA},
abstract = {In this work, we analyze the finite-length performance of low-density parity check (LDPC) ensembles decoded over the binary erasure channel (BEC) using the tree-expectation propagation (TEP) algorithm. In a previous paper, we showed that the TEP improves the BP performance for decoding regular and irregular short LDPC codes, but the perspective was mainly empirical. In this work, given the degree-distribution of an LDPC ensemble, we explain and predict the range of code lengths for which the TEP improves the BP solution. In addition, for LDPC ensembles that present a single critical point, we propose a scaling law to accurately predict the performance in the waterfall region. These results are of critical importance to design practical LDPC codes for the TEP decoder.},
keywords = {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},
pubstate = {published},
tppubtype = {inproceedings}
}