Novel construction of quasi-cyclic low-density parity-check codes with variable code rates for cloud data storage systems

被引:0
作者
Bhuvaneshwari, Vairaperumal [1 ]
Tharini, Chandrapragasam [1 ]
机构
[1] Ringgold Stand Inst, BS Abdur Rahman Crescent Inst Sci & Technol, Dept Elect & Commun Engn, Chennai, Tamil Nadu, India
关键词
bit error rate; cloud data storage; erasure correction capability; low-density parity-check codes; parity-check matrix; quasi-cyclic low-density parity-check codes;
D O I
10.4218/etrij.2021-0449
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of medium to high code rates that can be applied in cloud data storage systems, requiring better error correction capabilities. The novelty of this method lies in the construction of sparse base matrices, using a girth greater than 4 that can then be expanded with a lift factor to produce high code rate QC-LDPC codes. Investigations revealed that the proposed large-sized QC-LDPC codes with high code rates displayed low encoding complexities and provided a low bit error rate (BER) of 10(-10) at 3.5 dB E-b/N-0 than conventional LDPC codes, which showed a BER of 10(-7) at 3 dB E-b/N-0. Subsequently, implementation of the proposed QC-LDPC code in a software-defined radio, using the NI USRP 2920 hardware platform, was conducted. As a result, a BER of 10(-6) at 4.2 dB E-b/N-0 was achieved. Then, the performance of the proposed codes based on their encoding-decoding speeds and storage overhead was investigated when applied to a cloud data storage (GCP). Our results revealed that the proposed codes required much less time for encoding and decoding (of data files having a 10 MB size) and produced less storage overhead than the conventional LDPC and Reed-Solomon codes.
引用
收藏
页码:404 / 417
页数:14
相关论文
共 25 条
[1]  
Borthakur D., 2009, HADOOP DISTRIBUTED F
[2]   Investigation of Optimal Data Encoding Parameters Based on User Preference for Cloud Storage [J].
Chouhan, Vikas ;
Peddoju, Sateesh K. .
IEEE ACCESS, 2020, 8 :75105-75118
[3]  
DeCandia Giuseppe, 2007, Operating Systems Review, V41, P205, DOI 10.1145/1323293.1294281
[4]  
Fikes F., 2010, P 2010 GOOGLE FACULT
[5]   Exploring high performance distributed file storage using LDPC codes [J].
Gaidioz, Benjamin ;
Koblitz, Birger ;
Santos, Nuno .
PARALLEL COMPUTING, 2007, 33 (4-5) :264-274
[6]  
Ghemawat S., 2003, Operating Systems Review, V37, P29, DOI 10.1145/1165389.945450
[7]   SpreadStore: A LDPC Erasure Code scheme for Distributed Storage System [J].
Harihara, S. G. ;
Janakiram, Balaji ;
Chandra, M. Girish ;
Aravind, K. G. ;
Kadhe, Swanand ;
Balamuralidhar, P. ;
Adiga, B. S. .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DATA STORAGE AND DATA ENGINEERING (DSDE 2010), 2010, :154-158
[8]   Rapid Recovery for Systems with Scarce Faults [J].
Huang, Chung-Hao ;
Peled, Doron ;
Schewe, Sven ;
Wang, Farn .
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (96) :15-28
[9]  
Lin Y., 2006, P 33 ANN INT S COMPU, DOI [10.1109/ISCA.2006.37, DOI 10.1109/ISCA.2006.37]
[10]  
Luby M., 1997, P 29 ANN ACM S THEOR, P150, DOI DOI 10.1145/258533.258573