A REVIEW OF CONSTRUCTION METHODS FOR REGULAR LDPC CODES
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 2
Abstract
Low-Density parity-check (LDPC) codes are one of the most powerful error correcting codes available today. Their Shannon capacity approaching performance and lower decoding complexity have made them the best choice for many wired and wireless applications. This paper gives an overview about LDPC codes and compares the Gallager’s method, Reed-Solomon based algebraic method and the Progressive edge growth (PEG) combinatorial method for the construction of regular LDPC codes.
Authors and Affiliations
Rutuja Shedsale , Nisha Sarwade
Keywords
Related Articles
- EP ID EP103380
- DOI -
- Views 161
- Downloads 0
Low Power, Reduced Dynamic Voltage Swing Domino Logic Circuits
Dynamic domino logic circuits are widely used in modern digital VLSI circuits. These dynamic circuits are often favoured in high performance designs because of the speed advantage offered over static CMOS logic circuits....
SENTIMENT CLASSIFICATION OF MOVIE REVIEWS BY SUPERVISED MACHINE LEARNING APPROACHES
Large volumes of data are available in the web. The discussion forum, review sites, blogs and news corpora are some of the opinion rich resources. The opinions obtained from those can be classified and used for gathering...
VIRTUAL COMMUNITY: The New Hope for E-Commerce
A Virtual Community is a network which work within a social network of individual by any specific media and which have no limit about geographical area as well as political restriction. The Vital aim of virtual community...
DEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE
This paper focus on analysis and implementation of a hash table based data mining engine used to discover knowledge from transaction database for electronic commerce industry. Apriori algorithm is analyzed and implemente...