Přejít k obsahu


LDPC code optimization based on Tanner graph mutations

Citace: BROULÍM, J., GEORGIEV, V., MOLDASCHL, J., PALOČKO, L. LDPC code optimization based on Tanner graph mutations. In 21st Telecommunications Forum (TELFOR) Proceedings of Papers. Bělehrad: IEEE, 2013. s. 389-392. ISBN: 978-1-4799-1419-7
Druh: STAŤ VE SBORNÍKU
Jazyk publikace: eng
Anglický název: LDPC code optimization based on Tanner graph mutations
Rok vydání: 2013
Místo konání: Bělehrad
Název zdroje: IEEE
Autoři: Ing. Jan Broulím , Doc. Dr. Ing. Vjačeslav Georgiev , Ing. Jan Moldaschl , Ing. Lukáš Paločko ,
Abstrakt EN: The paper presents LDPC error correcting code optimization based on Tanner graph mutations. A statistical experiment focused on a heuristic LDPC code construction was performed with the genetic algorithm. The algorithm used is briefly described. Short wordlength LDPC code optimization was simulated. Results of these simulations are summarized in this paper.
Klíčová slova

Zpět

Patička