Regular lattice LDPC codes in perpendicular magnetic recording

Summary form only given. It has been well recognized that random low-density parity check (LDPC) codes perform close to the theoretical limit. However, iterative decoders employed for their decoding have very high complexity and are incapable of operating in the >1 Gbps regime, the expected data rates of the next generation of magnetic recording channels. Efficient regular LDPC codes were proposed by B. Vasic (Proc. Globecom 2001). These codes are based on balanced incomplete block designs (BIBD), known as Steiner systems, and have reduced complexity of the LDPC encoders. In this paper, using integer lattices, we introduce a new class of well structured LDPC codes that have high rates and low hardware complexity, and investigate their performance in perpendicular magnetic recording channels.