Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More

By National Aeronautics and Space Administration

Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents two classes of high rate LDPC codes whose constructions are based on finite Euclidean and projective geometries, respectively. These classes of codes a.re cyclic and have good constraint parameters and minimum distances. Cyclic structure adows the use of linear feedback shift registers for encoding. These finite geometry LDPC codes achieve very good error performance with either soft-decision iterative decoding based on belief propagation or Gallager's hard-decision bit flipping algorithm. These codes can be punctured or extended to obtain other good LDPC codes. A generalization of these codes is also presented.Kou, Yu and Lin, Shu and Fossorier, MarcGoddard Space Flight CenterEUCLIDEAN GEOMETRY; ALGORITHMS; DECODING; PARITY; ALGEBRA; INFORMATION THEORY; PROJECTIVE GEOMETRY; TWO DIMENSIONAL MODELS; COMPUTERIZED SIMULATION; ERRORS; BLOCK DIAGRAMS

• Format: Paperback
• Language: English
• ISBN: 1723736244
• ISBN13: 9781723736247
• Release Date: January 1
• Publisher: Independently Published
• Length: 36 Pages
• Weight: 0.24 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"