Short Non-Binary IRA Codes on Large-Girth Hamiltonian Graphs
Liva, Gianluigi and Matuz, Balazs and Paolini, Enrico and Chiani, Marco (2011) Short Non-Binary IRA Codes on Large-Girth Hamiltonian Graphs. IEEE International Conference on Communications, 10-15 June 2012, Ottawa, Canada.
Full text not available from this repository.
Short non-binary irregular repeat-accumulate (IRA) codes based on well-known Hamiltonian and Hypohamiltonian graphs with large girth are presented. The mapping of the code coordinates on the graph edges is discussed for Hamiltonian graphs, and two encoding methods on Hypohamiltonian graphs are introduced. The performance of the presented codes on order-256 finite fields (F256) is provided for both the additive white Gaussian (AWGN) channel and the binary erasure channel (BEC) under iterative (IT) decoding. For the latter case, the performance under maximum likelihood (ML) decoding is also presented, to illustrate that the proposed codes not only attain performances close to the random coding bound, but also show limited losses when decoded iteratively.
|Document Type:||Conference or Workshop Item (Paper)|
|Title:||Short Non-Binary IRA Codes on Large-Girth Hamiltonian Graphs|
|Keywords:||Turbo Codes, LDPC Codes, Finite Fields|
|Event Title:||IEEE International Conference on Communications|
|Event Location:||Ottawa, Canada|
|Event Type:||international Conference|
|Event Dates:||10-15 June 2012|
|HGF - Research field:||Aeronautics, Space and Transport|
|HGF - Program:||Space|
|HGF - Program Themes:||W - no assignement|
|DLR - Research area:||Space|
|DLR - Program:||W - no assignement|
|DLR - Research theme (Project):||W -- no assignement (old)|
|Institutes and Institutions:||Institute of Communication and Navigation > Digital Networks|
|Deposited By:||Dr. Gianluigi Liva|
|Deposited On:||19 Jun 2012 11:35|
|Last Modified:||19 Jun 2012 11:35|
Repository Staff Only: item control page