2011 Sixth International Symposium on Parallel Computing in Electrical Engineering (2011)

Luton, United Kingdom

Apr. 3, 2011 to Apr. 7, 2011

ISBN: 978-0-7695-4397-0

pp: 7-12

ABSTRACT

Codes on graphs have become the most important way to reach channel capacity. A new problem for High Performance Computing has been constructed with this work. The graph search problem as posed in this work is the coarsest version of the problem which corresponds to the exhaustive search case. The coarse grain graph search (CGGS) problem chooses an optimal parity-check matrix, based on minimum value of BER objective function. Based upon the specified range of parity-check matrices and range of signal to noise ratio (SNR), the CGGS generates the parity-check matrices using the Modified PEG algorithm, performs LDPC encoding, adds noise to the encoder output, performs LDPC decoding, computes Bi terror rate (BER), and thus the BER objective function. TheCGGS problem in its current implementation runs in an MPIimplementation on the T2K supercomputer at The University Of Tokyo. Two scheduling strategies have been proposed, Generalized Max-Min pairing (GMMP) and random pairing(RP) scheduling algorithms have been proposed, and good parallel performance of CGGS over an MPI implementation onT2K has been achieved.

INDEX TERMS

Graph Search, CGGS Coarse grain graph search, LDPC (Low Density Parity Check) codes, Tanner Graph, Sum product decoding algorithm, Generalized Max-Min pairing (GMMP), Random pairing (RP) scheduling algorithms

CITATION

R. Suda and V. S. Nittoor, "Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer,"

*2011 Sixth International Symposium on Parallel Computing in Electrical Engineering(PARELEC)*, Luton, United Kingdom, 2011, pp. 7-12.

doi:10.1109/PARELEC.2011.13

CITATIONS