Euclidean Geometry-Based Spatially Coupled LDPC Codes for Storage

In this paper, we construct binary spatially coupled (SC) low-density parity-check (LDPC) codes based on Euclidean geometry (EG) LDPC codes for storage applications, where high error correction capability, extremely low uncorrectable bit error rate (UBER), and low decoding complexity are required. We propose a systematic way to construct the families of SC LDPC codes from (m,2
^s
) EG LDPC codes, which are termed EG-SC LDPC codes. In the construction method, we propose a 2-D edge-spreading process to construct the base matrix of EG-SC LDPC codes, which consists of matrix unwrapping and periodically time-varying of a protograph. A lower bound on the rank of the parity-check matrix of an EG-SC LDPC code is derived. We evaluate the error rate performance of the constructed EG-SC LDPC codes by using a weighted bit-flipping decoding algorithm for its low decoding complexity. Numerical results show that the UBER performance of the constructed EG-SC LDPC codes is superior to that of their EG LDPC code counterparts, and show no error floor compared with the constructed protograph SC LDPC codes and regular LDPC codes.