• Title/Summary/Keyword: Erasure Codes

Search Result 30, Processing Time 0.025 seconds

SSD-based RAID-6 System Architecture for Reliability and Performance Enhancement (신뢰성 향상과 성능개선을 위해 다양한 Erasure 코드를 적용한 SSD 기반 RAID-6 시스템 구조)

  • Song, Jae-Seok;Huh, Joon-Moo;Yang, Yu-Seok;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.47-56
    • /
    • 2010
  • HDD-based RAIDs have been used in high-capacity storage systems for traditional data server. However, their data reliability are relatively low and they consume lots of power since hard disk drive is weak on shock and its power consumption is high due to frequent spindle motor operation. Therefore, this paper presents new SSD based RAID system architecture using various erasure codes. The proposed methode applys Reed-Solomon, EVENODD, and Liberation coding schemes onto file system level and device driver level, respectively. Besides, it uses data allocation method to minimize the side effect of reducing the lifespan of SSD. Detail experimental results show that Liberation code increase wear-leveling rates of SSD based RAID-6 more than other codes. The SSD based RAID system applying erasure codes at the device driver level shows better performance than that at the file system level. I/O performance of RAID-6 system using SSD is 4.5%~8.5% higher than that of using HDD and the power consumption of the RAID system using SSD is 18%~40% less than that of using HDD.

New Time-Domain Decoder for Correcting both Errors and Erasures of Reed-Solomon Codes

  • Lu, Erl-Huei;Chen, Tso-Cho;Shih, Chih-Wen
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.612-621
    • /
    • 2016
  • A new time-domain decoder for Reed-Solomon (RS) codes is proposed. Because this decoder can correct both errors and erasures without computing the erasure locator, errata locator, or errata evaluator polynomials, the computational complexity can be substantially reduced. Herein, to demonstrate this benefit, complexity comparisons between the proposed decoder and the Truong-Jeng-Hung and Lin-Costello decoders are presented. These comparisons show that the proposed decoder consistently has lower computational requirements when correcting all combinations of ${\nu}$ errors and ${\mu}$ erasures than both of the related decoders under the condition of $2{\nu}+{\mu}{\leq}d_{\min}-1$, where $d_{min}$ denotes the minimum distance of the RS code. Finally, the (255, 223) and (63, 39) RS codes are used as examples for complexity comparisons under the upper bounded condition of min $2{\nu}+{\mu}=d_{\min}-1$. To decode the two RS codes, the new decoder can save about 40% additions and multiplications when min ${\mu}=d_{min}-1$ as compared with the two related decoders. Furthermore, it can also save 50% of the required inverses for min $0{\leq}{\mu}{\leq}d_{\min}-1$.

A New Iterative LT Decoding Algorithm for Binary and Nonbinary Galois Fields

  • Mao, Yuexin;Huang, Jie;Wang, Bing;Huang, Jianzhong;Zhou, Wei;Zhou, Shengli
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.411-421
    • /
    • 2013
  • Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

Iterative Reliability-based Decoding of LDPC Codes with Low Complexity BEC Decoding (이진 소실 채널 복호를 이용한 신뢰기반 LDPC 반복 복호)

  • Kim, Sang-Hyo
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.14-15
    • /
    • 2008
  • In this paper, a new iterative decoding of LDPC codes is proposed. The decoding is based on the posteriori probability of each belief propagation (BP) decoding and an additional postprocessing, that is, erasure decoding of LDPC codes. It turned out that the new method consistently improves the decoding performance on various classes of LDPC codes. For example it removes the error floor of Margulis codes effectively.

  • PDF

Erasure Insertion and Clipping for LDPC Coded Frequency-Hopping Non-Coherent BFSK System over Partial-Band Jamming Channel (부분 대역 재밍 채널에서 LDPC 부호화된 주파수 도약 BFSK 시스템의 소실 삽입 및 클리핑 기법)

  • Park, Jinsoo;Kim, Inseon;Song, Hong-Yeop;Yang, Pilwoong;No, Jong-Seon;Han, Sung Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.8
    • /
    • pp.1492-1499
    • /
    • 2015
  • In this paper, we propose a clipping method for LDPC coded FH BFSK system over partial-band jamming channel. We apply the erasure insertion technique, which had been studied much earlier, now to LDPC codes and discuss its performance degradation region. By using clipping technique, the performance degradation can be removed. Finally, we discuss the erasure insertion and clipping techniques for various jamming conditions.

A Distributed LT Codes-based Data Transmission Technique for Multicast Services in Vehicular Ad-hoc Networks

  • Zhou, Yuan;Fei, Zesong;Huang, Gaishi;Yang, Ang;Kuang, Jingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.748-766
    • /
    • 2013
  • In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.

HRSF: Single Disk Failure Recovery for Liberation Code Based Storage Systems

  • Li, Jun;Hou, Mengshu
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.55-66
    • /
    • 2019
  • Storage system often applies erasure codes to protect against disk failure and ensure system reliability and availability. Liberation code that is a type of coding scheme has been widely used in many storage systems because its encoding and modifying operations are efficient. However, it cannot effectively achieve fast recovery from single disk failure in storage systems, and has great influence on recovery performance as well as response time of client requests. To solve this problem, in this paper, we present HRSF, a Hybrid Recovery method for solving Single disk Failure. We present the optimal algorithm to accelerate failure recovery process. Theoretical analysis proves that our scheme consumes approximately 25% less amount of data read than the conventional method. In the evaluation, we perform extensive experiments by setting different number of disks and chunk sizes. The results show that HRSF outperforms conventional method in terms of the amount of data read and failure recovery time.

Formulation of Joint Iterative Decoding for Raptor Codes

  • Zhang, Meixiang;Kim, Sooyoung;Kim, Won-Yong;Cho, Yong-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.8
    • /
    • pp.961-967
    • /
    • 2014
  • Raptor codes are a class of rateless codes originally designed for binary erasure channels. This paper presents a compact set of mathematical expressions for iterative soft decoding of raptor codes. In addition, an early termination scheme is employed, and it is embedded in a single algorithm with the formula. In the proposed algorithm, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination scheme. Simulation results show that our proposed method can achieve better performance with reduced decoding complexity compared to the conventional schemes.

Selected Mapping Technique Based on Erasure Decoding for PAPR Reduction of OFDM Signals (OFDM 신호의 PAPR 감소를 위한 소실 복호 기반의 SLM 기법)

  • Kong, Min-Han;Song, Moon-Kyou
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.2
    • /
    • pp.22-28
    • /
    • 2007
  • High PAPR (peak-to-average power ratio) is a major drawback of OFDM (orthogonal frequency division multiplexing) signals. In this paper, a modified SLM (selective mapping) technique that uses erasure decoding of RS (Reed-Solomon) codes is presented. At the transmitter a set of phase sequences are multiplied such that some portions of check symbols in RS-coded OFDM data blocks are phase-rotated. At the receiver, RS decoding is performed with the phase-rotated check symbols being treated as erasures. Hence, there is no need to send side information about the phase sequence selected to transmit for the lowest PAPR. In addition, the estimation process for the selected phase sequence is no longer needed at the receiver, leading to improvement in terms of complexity and performance. To evaluate the performance of this technique, the CCDF (complementary cumulative distribution function) of PAPR, the BER (bit error rate) and the decoding failure probability are compared with those of the previous SLM techniques.

Reducing PAPR of OFDM Signals Using Modified Partial Transmit Sequences Technique Based on Erasure Decoding (소실 복호 기반의 수정된 PTS 기법을 이용한 OFDM 신호의 PAPR 감소)

  • Kong, Min-Han;Song, Moon-Kyou
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.775-781
    • /
    • 2007
  • In this paper, a modified PTS(Partial Transmit Sequences) technique that uses erasure decoding of RS (Reed-Solomon) codes is presented. At the transmitter, some check symbols in a RS codeword partitioned into subblocks are phase-rotated by phase factors. The receiver decodes received codewords by regarding the phase-rotated check symbols as erasures. Hence, this technique does not need to transmit the side information about the phase factors chosen at the transmitter. The complexity of the receiver is also reduced since the estimation process for the phase factors is not required in the receiver. There is no performance degradation due to the transmission error of the side information or the estimation error of the phase factors. To evaluate the performance of the proposed PTS technique, the CCDF(Complementary Cumulative Distribution Function) of PAPR and the BER(Bit Error Rate) are compared with those of the conventional PTS techniques.