Genetic optimization of a short block length LDPC code accelerated by distributed algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23220%2F16%3A43930202" target="_blank" >RIV/49777513:23220/16:43930202 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7818770/" target="_blank" >http://ieeexplore.ieee.org/document/7818770/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TELFOR.2016.7818770" target="_blank" >10.1109/TELFOR.2016.7818770</a>

Result language
angličtina
Original language name
Genetic optimization of a short block length LDPC code accelerated by distributed algorithms
Original language description
In this paper we propose an application of genetic optimization algorithms to the construction of LDPC codes with interesting correcting capabilities. A short block length (64,56) code is constructed by the accelerated genetic optimization. A highly significant acceleration of the convergence speed is achieved by the coarse grained parallelization algorithm. The best optimized (64,56) LDPC code and its comprehensive evaluation are given in the paper.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2016 24th Telecommunications Forum (TELFOR 2016) : Proceedings of Papers
ISBN
978-1-5090-4086-5
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
250-253
Publisher name
IEEE
Place of publication
Piscataway
Event location
Belgrade, Serbia
Event date
Nov 22, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)