A Finite-Length Construction of Irregular Spatially-Coupled Codes

Homa Esfahanizadeh, Ruiyi Wu, Lara Dolecek

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes offer performance advantage over their regular counterparts. In this paper, we present a novel combinatorial framework for designing finite-length irregular SC LDPC codes. Our irregular SC codes have the desirable properties of regular SC codes thanks to their structure while offering significant performance benefits that come with the node degree irregularity. Coding constructions proposed in this work contribute to the existing portfolio of finite-length graph code designs.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment