ACE Spectrum of LDPC Codes and Generalized ACE Design
Vukobratovic, D.
Djurendic, A.
Senk, V.
Univ. of Novi Sad, Novi Sad;
This paper appears in: Communications, 2007. ICC '07. IEEE International Conference on
Publication Date: 24-28 June 2007
On page(s): 665-670
Location: Glasgow,
ISBN: 1-4244-0353-7
INSPEC Accession Number: 9874806
Digital Object Identifier: 10.1109/ICC.2007.114
Current Version Published: 2007-08-13
Abstract
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the binary erasure channel (BEC), this problem translates into the problem of finding elements of selected (irregular) LDPC code ensemble with the size of the minimal stopping set being maximized. Faced with the lack of analytical solution to this problem, simple but powerful heuristic design algorithm, an ACE constrained design algorithm, was recently introduced. Building upon the ACE metric associated with every cycle in the code graph, we introduce the ACE spectrum of LDPC code as a useful measure of success in selection of the LDPC code from selected ensemble. Using ACE spectrum, we farther generalize ACE constrained design, making it more flexible and efficient.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
