An efficient algorithm for determining the girth and ACE distributions in LDPC code Tanner graphs.
Umar-Faruk Abdu-AguyeMarcel Adrian AmbrozeMartin TomlinsonPublished in: ICSPCS (2016)
Keyphrases
- optimal solution
- dynamic programming
- learning algorithm
- detection algorithm
- objective function
- computational complexity
- k means
- single pass
- computationally efficient
- preprocessing
- spanning tree
- worst case
- matching algorithm
- segmentation algorithm
- subgraph isomorphism
- genetic algorithm
- simulated annealing
- probability distribution
- probabilistic model
- np hard