Design Considerations and Performance Analysis of Good ¿-Rotation LDPC Codes
Rich Echard, Shih-Chun Chang · 2006
In this paper we present two theoretical results that lead to the development of good π-rotation LDPC codes. The first theorem derives bounds on the weight of the parity vector when the weight of the information vector is two. The second theorem establishes the expected number of short-loops in the parity check matrix. We then present construction tools that are used to reduce the complexity of searching minimum distance and girth for π-rotation LDPC codes. Several performance examples are given