A combined matrix ensemble of low-density parity-check codes for correcting a solid burst erasure

Gou Hosoya; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1093/ietfec/e91-a.10.2765

A combined matrix ensemble of low-density parity-check codes for correcting a solid burst erasure

Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.

Original language	English
Pages (from-to)	2765-2778
Number of pages	14
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E91-A
Issue number	10
DOIs	https://doi.org/10.1093/ietfec/e91-a.10.2765
Publication status	Published - 2008 Oct

Keywords

Belief-propagation decoding
Low-density parity-check code
Minimum span
Solid burst erasure
Stopping set

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1093/ietfec/e91-a.10.2765

Fingerprint Dive into the research topics of 'A combined matrix ensemble of low-density parity-check codes for correcting a solid burst erasure'. Together they form a unique fingerprint.

Cite this

@article{cd99b3847b8c4bedb893e51cfb949a87,

title = "A combined matrix ensemble of low-density parity-check codes for correcting a solid burst erasure",

abstract = "A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.",

keywords = "Belief-propagation decoding, Low-density parity-check code, Minimum span, Solid burst erasure, Stopping set",

author = "Gou Hosoya and Toshiyasu Matsushima and Shigeichi Hirasawa",

year = "2008",

month = oct,

doi = "10.1093/ietfec/e91-a.10.2765",

language = "English",

volume = "E91-A",

pages = "2765--2778",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "10",

}

TY - JOUR

T1 - A combined matrix ensemble of low-density parity-check codes for correcting a solid burst erasure

AU - Hosoya, Gou

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2008/10

Y1 - 2008/10

N2 - A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.

AB - A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.

KW - Belief-propagation decoding

KW - Low-density parity-check code

KW - Minimum span

KW - Solid burst erasure

KW - Stopping set

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

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

U2 - 10.1093/ietfec/e91-a.10.2765

DO - 10.1093/ietfec/e91-a.10.2765

M3 - Article

AN - SCOPUS:77953385551

VL - E91-A

SP - 2765

EP - 2778

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 10

ER -