NDLI: Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer

Content Provider	IEEE Xplore Digital Library
Author	Nittoor, V.S. Suda, R.
Copyright Year	2011
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.
Starting Page	7
Ending Page	12
File Size	412657
Page Count	6
File Format	PDF
ISBN	9781457700781
DOI	10.1109/PARELEC.2011.13
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-04-03
Publisher Place	United Kingdom
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Signal to noise ratio Bit error rate Search problems Decoding Scheduling algorithm Random pairing (RP) scheduling algorithms Graph Search CGGS Coarse grain graph search LDPC (Low Density Parity Check) codes Tanner Graph Sum product decoding algorithm Generalized Max-Min pairing (GMMP)
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC Codes

Comparison of decoding algorithms for LDPC codes of IEEE 802.16e standard

On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes

A decoding algorithm for finite-geometry LDPC codes

Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes

Self-corrected Min-Sum decoding of LDPC codes

Selective max-min algorithm for low-density parity-check decoding

A simplified decoding algorithm for nonbinary LDPC codes

Graphical interface for simulation and analysis of LDPC block codes

Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer

Similar Documents

Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC Codes

Comparison of decoding algorithms for LDPC codes of IEEE 802.16e standard

On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes

A decoding algorithm for finite-geometry LDPC codes

Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes

Self-corrected Min-Sum decoding of LDPC codes

Selective max-min algorithm for low-density parity-check decoding

A simplified decoding algorithm for nonbinary LDPC codes

Graphical interface for simulation and analysis of LDPC block codes

Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer