DocumentCode
2947097
Title
LDPC code optimization based on Tanner graph mutations
Author
Broulim, Jan ; Georgiev, Vjaceslav ; Moldaschl, Jan ; Palocko, Lukas
Author_Institution
Fac. of Electr. Eng., Univ. of West Bohemia, Pilsen, Czech Republic
fYear
2013
fDate
26-28 Nov. 2013
Firstpage
389
Lastpage
392
Abstract
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.
Keywords
error correction codes; genetic algorithms; graph theory; parity check codes; statistical analysis; Tanner graph mutations; error correcting code; genetic algorithm; heuristic LDPC code construction; short wordlength LDPC code optimization; statistical experiment; Algorithm design and analysis; Bit error rate; Error correction codes; Genetic algorithms; Next generation networking; Optimization; Parity check codes; FEC; LDPC; genetic optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications Forum (TELFOR), 2013 21st
Conference_Location
Belgrade
Print_ISBN
978-1-4799-1419-7
Type
conf
DOI
10.1109/TELFOR.2013.6716251
Filename
6716251
Link To Document