• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.137-145
• /
• 2014

In this paper, we focus on end-to-end transfer delay improvement by using erasure coding when delivering expediting message consisting of M packets in networks with high coefficient of variation of transfer time. In the scheme, M packets are divided into b groups with each having g packets. Each group is erasure coded with additional r packets and transmitted. Since the first arrived g packets among g+r packets completes the delivery of the group, the delivery time of the expediting message is reduced. For the scheme, we investigate the optimum group size and number of redundancy packets considering delivery delay reduction and additional transmission cost caused by using erasure coding. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1684-1691
• /
• 2016

Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.679-682
• /
• 1998

This paper presents the VLSI implementation of RS(reed-solomon) decoder using the Modified Euclidean Algorithm(hereafter MEA) for DVD(Digital Versatile Disc) and CD(Compact Disc). The decoder has a capability of correcting 8-error or 16-erasure for DVD and 2-error or 4-erasure for CD. The technique of polynomial evaluation is introduced to realize syndrome calculation and a polynomial expansion circuit is developed to calculate the Forney syndrome polynomial and the erasure locator polynomial. Due to the property of our system with buffer memory, the MEA architecture can have a recursive structure which the number of basic operating cells can be reduced to one. We also proposed five criteria to determine an uncorrectable codeword in using the MEA. The overall architecture is a simple and regular and has a 4-stage pipelined structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7C
• /
• pp.659-664
• /
• 2006

We propose two error correcting algorithms for high-density optical storage systems. The first algorithm reduces the false-erasure declaration by reducing the sensitivity on random errors and increases the code rate using a simple erasure indication method. The second one exploits just the known indicator flag instead of error correcting code such as Reed-Solomon(RS) code. The proposed algorithms are superior to the error correcting algorithms of conventional systems such as DVD and BD.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.436-453
• /
• 2018

Storage cloud scheme, pushing data to the storage cloud poses much attention regarding data confidentiality. With encryption concept, data accessibility is limited because of encrypted data. To secure storage system with high access power is complicated due to dispersed storage environment. In this paper, we propose a hardware-based security scheme such that a secure dispersed storage system using erasure code is articulated. We designed a hardware-based security scheme with data encoding operations and migration capabilities. Using TPM (Trusted Platform Module), the data integrity and security is evaluated and achieved.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.179-182
• /
• 1988

Since the bits in any encoded PCM word are of different importance to the bit positions, in order to improve the signal to noise ratio the technique that the encoded signal bits are weighted for the QPSK transmission system, is presented. Also the erasure zone is established at the detector, such that if the output falls into the erasure zone, the regenerated sample is replaced by interpolation. Two weighting methods are shown here. One is the method that the same weighting profile is used to Q and I dimension in QPSK signal constellations. The other is diferent weighting to Q and I dimension. The gains of this new technique in overall signal s/n compared to conventional QPSK transmission system were 5 db and 2db, respectively.

• Journal of Information Science Theory and Practice
• /
• v.10 no.spc
• /
• pp.56-65
• /
• 2022

Korea Institute of Science and Technology Information (KISTI) is a Worldwide LHC Computing Grid (WLCG) Tier-1 center mandated to preserve raw data produced from A Large Ion Collider Experiment (ALICE) experiment using the world's largest particle accelerator, the Large Hadron Collider (LHC) at European Organization for Nuclear Research (CERN). Physical medium used widely for long-term data preservation is tape, thanks to its reliability and least price per capacity compared to other media such as optical disk, hard disk, and solid-state disk. However, decreasing numbers of manufacturers for both tape drives and cartridges, and patent disputes among them escalated risk of market. As alternative to tape-based data preservation strategy, we proposed disk-only erasure-coded archival storage system, Custodial Disk Storage (CDS), powered by Exascale Open Storage (EOS), an open-source storage management software developed by CERN. CDS system consists of 18 high density Just-Bunch-Of-Disks (JBOD) enclosures attached to 9 servers through 12 Gbps Serial Attached SCSI (SAS) Host Bus Adapter (HBA) interfaces via multiple paths for redundancy and multiplexing. For data protection, we introduced Reed-Solomon (RS) (16, 4) Erasure Coding (EC) layout, where the number of data and parity blocks are 12 and 4 respectively, which gives the annual data loss probability equivalent to 5×10^-14. In this paper, we discuss CDS system design based on JBOD products, performance limitations, and data protection strategy accommodating EOS EC implementation. We present CDS operations for ALICE experiment and long-term power consumption measurement.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1073-1077
• /
• 2010

This paper proposes a new 4-dimensional(4D) constellation-rotation(CR) method which obtains diversity gain of 4 under Rayleigh fading channels. The proposed scheme uses two consecutive CR operations for the constellation of QAM signals unlike a conventional 2-dimensional(2D) CR method using only one CR operation. The computer simulation results show that the new method outperforms the conventional one even more as both the channel code rate and the erasure ratio increase. In a point of system flexibility, the proposed scheme has a great advantage since the conventional 2D CR scheme can be simply implemented by only changing rotation angle values used in the proposed scheme.

• Journal of Communications and Networks
• /
• v.13 no.2
• /
• pp.160-166
• /
• 2011

In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.