Scalable Globally-Coupled Low-Density Parity Check Codes

Yen Chin Liao, Hsie-Chia Chang, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

This paper presents a technique to scale up an LDPC code to any desired block length. Under certain constraints, the scaled LDPC code results in a special case of globally-coupled-LDPC code. The proposed scheme can construct globally-coupled-LDPC codes from any short LDPC codes. A design example targeting for NAND flash memory applications is addressed and simulated. The results show the feasibility of constructing a structural long LDPC code by scaling from a short code.

Original languageEnglish
Title of host publication2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
PublisherIEEE Computer Society
ISBN (Electronic)9781538670484
DOIs
StatePublished - 23 Jan 2019
Event10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China
Duration: 3 Dec 20187 Dec 2018

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Volume2018-December
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Country/TerritoryChina
CityHong Kong
Period3/12/187/12/18

Keywords

  • length-scalable LDPC code
  • low-density parity check code

Fingerprint

Dive into the research topics of 'Scalable Globally-Coupled Low-Density Parity Check Codes'. Together they form a unique fingerprint.

Cite this