Skip to Main Content
This paper presents a method to construct LDPC codes by arranging cyclic shift matrices. These codes perform well at various rates for moderate code length. By substituting those cyclic shifts for their Kronecker products with small random permutations, the performance of long codes can be improved, while the structure facilitates hardware implementation.
Date of Conference: 29 June-4 July 2003