Near Shannon limit performance of low density parity check codes

Mackay, David; Neal, Radford M.

doi:10.1049/el:19961141

Cited by 1,912 publications

(1,353 citation statements)

References 5 publications

Supporting

Mentioning

1,286

Contrasting

Unclassified

Order By: Relevance

“…In general, FEC in application layer is called Application Layer FEC (AL-FEC) and a variety of FEC algorisms are used for AL-FEC such as Reed-Solomon [28], LDPC [29], LDGM [2], and Raptor Code [30]. ReedSolomon is used for many distributed storage systems such as RAID [4], Ocean Store [26], and RobuSTore [24].…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…The size of a FEC block and the amount of redundancy data can be decided by users who store the file. DRIP utilizes LDGM (Low Density Generator Matrix) coding [2] as the FEC coding because LDGM has an advantage in terms of lost bit recovering time in large block size compared to Reed-Solomon coding [3]. The sequence number assigned to each chunk describes the position of the chunk in the file.…”

Section: Overview Of Dripmentioning

confidence: 99%

See 1 more Smart Citation

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Ando

Teraoka

Kaneko

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Daisuke ANDO †a) , Fumio TERAOKA † †b) , and Kunitake KANEKO † †c) , Members SUMMARYWith rapid growth of producing high-resolution digital contents such as Full HD, 4K, and 8K movies, the demand for low cost and high throughput sharing of content files is increasing at digital content productions. In order to meet this demand, we have proposed DRIP (Distributed chunks Retrieval and Integration Procedure), a storage and retrieval mechanism for large file sharing using forward error correction (FEC) and global dispersed storage. DRIP was confirmed that it contributes to low cost and high throughput sharing. This paper describes the design and implementation of Content Espresso, a distributed large file sharing system for digital content productions using DRIP, and presents performance evaluations. We set up experimental environment using 79 physical machines including 72 inexpensive storage servers, and evaluate file metadata access performance, file storage/retrieval performance, FEC block size, and system availability by emulating global environments. The results confirm that Content Espresso has capability to deal with 15,000 requests per second, achieves 1 Gbps for file storage, and achieves more than 3 Gbps for file retrieval. File storage and retrieval performance are not significantly affected by the network conditions. Thus, we conclude that Content Espresso is capable of a global scale file sharing system for digital content productions. key words: distributed storage system, UDP data transmission, FEC, file sharing

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Section: Overview Of Dripmentioning

confidence: 99%

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Ando

Teraoka

Kaneko

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…They were originally proposed in 1962 by Robert Gallager [6]. In the late 90"s LDPC codes were rediscovered by Mackay and Neal [1] and also by Wiberg [5]. Current hardware speeds make them a very attractive option for wired and wireless systems.…”

Section: Ldpc Codesmentioning

confidence: 99%

Decoding Techniques of LDPC Codes

Marotkar¹,

Hudson²,

Bramhe³

2015

International Journal of Innovative Research in Electrical, Ele

View full text Add to dashboard Cite

show abstract

“…For , replacing each component of by its location vector , we obtain a -tuple over GF (2) with weight , which is called the symbol location vector of . For , form a matrix over GF(2) whose rows are the symbol location vectors in .…”

Section: Rs-based Gallager-ldpc Codesmentioning

confidence: 99%

“…After being overlooked for almost 35 years, this class of codes has been recently rediscovered and shown to form a class of Shannon limit approaching codes [2]- [8]. This class of codes decoded with iterative decoding, such as the sum-product algorithm (SPA) [1], [4]- [6], performs amazingly well.…”

Section: Introductionmentioning

confidence: 99%

A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols

Djurdjevic

Abdel-Ghaffar

et al. 2003

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

119

View full text Add to dashboard Cite

Abstract-This letter presents an algebraic method for constructing regular low-density parity-check (LDPC) codes based on Reed-Solomon codes with two information symbols. The construction method results in a class of LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graphs and have good minimum distances. They perform well with iterative decoding.

show abstract

Near Shannon limit performance of low density parity check codes

Cited by 1,912 publications

References 5 publications

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Decoding Techniques of LDPC Codes

A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols

Contact Info

Product

Resources

About