On Decoding Random-Access SC-LDPC Codes

Eshed Ram; Yuval Cassuto

doi:10.1109/ISIT.2019.8849558

On Decoding Random-Access SC-LDPC Codes

Eshed Ram, Yuval Cassuto

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study a new decoding strategy of multi-block SC-LDPC codes motivated by data-storage applications. To decode a sub-block out of the full code block, our proposed decoder accesses a small number of sub-blocks around the desired sub-block. We call this decoding strategy "semi-global decoding", and parametrize it by its access cost: the number of accessed sub-blocks. We provide a theoretical characterization of decoding performance, and evaluate this performance for random-access SC-LDPC ensembles.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Pages	2429-2433
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849558
State	Published - Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2019.8849558

Cite this

@inproceedings{9be4f75ccb1b48f58d83ee42125b69a0,

title = "On Decoding Random-Access SC-LDPC Codes",

abstract = "We study a new decoding strategy of multi-block SC-LDPC codes motivated by data-storage applications. To decode a sub-block out of the full code block, our proposed decoder accesses a small number of sub-blocks around the desired sub-block. We call this decoding strategy {"}semi-global decoding{"}, and parametrize it by its access cost: the number of accessed sub-blocks. We provide a theoretical characterization of decoding performance, and evaluate this performance for random-access SC-LDPC ensembles.",

author = "Eshed Ram and Yuval Cassuto",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849558",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2429--2433",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

Ram, E & Cassuto, Y 2019, On Decoding Random-Access SC-LDPC Codes. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849558, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, pp. 2429-2433, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849558

TY - GEN

T1 - On Decoding Random-Access SC-LDPC Codes

AU - Ram, Eshed

AU - Cassuto, Yuval

PY - 2019/7

Y1 - 2019/7

N2 - We study a new decoding strategy of multi-block SC-LDPC codes motivated by data-storage applications. To decode a sub-block out of the full code block, our proposed decoder accesses a small number of sub-blocks around the desired sub-block. We call this decoding strategy "semi-global decoding", and parametrize it by its access cost: the number of accessed sub-blocks. We provide a theoretical characterization of decoding performance, and evaluate this performance for random-access SC-LDPC ensembles.

AB - We study a new decoding strategy of multi-block SC-LDPC codes motivated by data-storage applications. To decode a sub-block out of the full code block, our proposed decoder accesses a small number of sub-blocks around the desired sub-block. We call this decoding strategy "semi-global decoding", and parametrize it by its access cost: the number of accessed sub-blocks. We provide a theoretical characterization of decoding performance, and evaluate this performance for random-access SC-LDPC ensembles.

UR - http://www.scopus.com/inward/record.url?scp=85073169728&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849558

DO - 10.1109/ISIT.2019.8849558

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2429

EP - 2433

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

On Decoding Random-Access SC-LDPC Codes

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this