• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.117-125
• /
• 2014

In this paper, a novel hardware architecture of the LT codec is presented where non-BP based decoding algorithm is applied. Novel LT codec architecture is designed with an efficient degree distribution unit using Verilog HDL. To perform permutation operation, different initial valued or time shifted counters have been used to get pretty well permutations and an effect of randomness. The codec will take 128 bits as input and produce 256 encoded output bits. The simulation results show expected performances as the implemented distribution and the original distribution are pretty same. The proposed LT codec takes 257.5 cycle counts and $2.575{\mu}s$ for encoding and decoding instead of 5,204,861 minimum cycle counts and 4.43s of the design mentioned in the previous works where iterative soft BP decoding was used in ASIC and ASIP implementation of the LT codec.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.105-113
• /
• 2013

RAID systems have been widely used by connecting several disks in parallel structure. to resolve the delay and bottleneck of data I/O. Recently, SSD based RAID systems are emerging since SSDs have better I/O performance than HDD. However, endurance and power consumption problems due to frequent write operation in SSD based RAID system should be resolved. In this paper, we propose a de-duplication method of parity disk in SSD based RAID system with expensive update cost. The proposed method segments chunk of parity data into small pieces and removes duplicate data, therefore, it can reduce wear-leveling and power consumption by decreasing write operation for duplicated parity data. Experimental results show that bit update rate of the proposed method is 16% in total disk, 31% in parity disk less than that of existing method in RAID-6 system using EVENODD erasure code, and the power consumption of the proposed method is 30% less than that of existing method. Besides the proposed method is 12% in total disk, 32% in parity disk less than that of existing method in RAID-5 system, and the power consumption of the proposed method is 36% less than that of existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1556-1564
• /
• 2001

Reed-Solomon code, block interleaving and SI (side information) are frequently used in SFH (slow frequency hopping) system. Erasing those symbols in the hit frequency slot greatly increases the error connection capacity. Packet error rate has been the major performance measure for SFH system. The analysis of BER has been limited to the case of perfect Sl, in which neither miss nor false alarm exists. BER with imperfect Sl has been obtained only by Monte Carlo simulation. In this paper, we present a unified solution to estimate BER with imperfect Sl. It is shown that previous formulae for packet error rate or BER with perfect Sl are special cases in the proposed solution. The computed BER with false alarm and miss of frequency hit is verified by comparing with the simulation result.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.3-14
• /
• 2013

We demonstrate a fashion of quantum channel combining and splitting, called polar quantum channel coding, to generate a quantum bit (qubit) sequence that achieves the symmetric capacity for any given binary input discrete quantum channels. The present capacity is achievable subject to input of arbitrary qubits with equal probability. The polarizing quantum channels can be well-conditioned for quantum error-correction coding, which transmits partially quantum data through some channels at rate one with the symmetric capacity near one but at rate zero through others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2027-2035
• /
• 2001

In this paper, we present an audio stream delivery using the AMR (Adaptive Multi-Rate) coder that was adopted by ETSI and 3GPP as a standard vocoder for next generation IMT-2000 service in which includes combined sender (FEC) and receiver reconstruction technique in the Internet. By use of the media-specific FEC scheme, the possibility to recover lost packets can be much increased due to the addition of repair data to a main data stream, by which the contents of lost packets can be recovered. The AMR codec is based on the code-excited linear predictive (CELP) coding model. So we use a frame erasure concealment for CELP-based coders. The proposed scheme is evaluated with ITU-T G.729 (CS-ACELP) coder and AMR - 12.2 kbit/s through the SNR (Signal to Noise Ratio) and the MOS (Mean Opinion Score) test. The proposed scheme provides 1.1 higher in Mean Opinion Score value and 5.61 dB higher than AMR - 12.2 kbit/s in terms of SNR in 10% packet loss, and maintains the communicab1e quality speech at frame erasure rates lop to 20%.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.3
• /
• pp.102-110
• /
• 2024

Blockchain records all transactions issued by users, which are then replicated, stored, and shared by participants of the blockchain network. Therefore, the capacity of the ledger stored by participants continues to increase as the blockchain network operates. In order to address this issue, research is being conducted on methods that enhance storage efficiency while ensuring that valid values are stored in the ledger even in the presence of device failures or malicious participants. One direction of research is applying techniques such as Reed-Solomon encoding to the storage of blockchain ledgers. In this paper, we apply Reed-Solomon encoding to the key-value store used for ledger storage in an open-source blockchain, and measure the storage efficiency and increasing computational overhead. Experimental results confirm that storage efficiency increased by 86% while the increase in CPU operations required for encoding was only about 2.7%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.97-104
• /
• 2016

Because of rapid growth of data size, the number of data storage has been increased. When using multiple data storages, a distribute file system is essential to insure the availability of data files. The power consumption is a major problem when using a distributed file system with many data storages. Previous works have aimed at reducing the energy consumption with efficient file block layout by changing some data servers into stand-by mode. The file block migration has not been seriously considered because migration causes large cost. But when we consider addition of a new data server or file, file block migration is needed. This paper formulates the minimization of data block migration as an ILP optimization problem and solves it using branch-and-bound method. Using this technique, we can maximize the number of stand-by data servers with the minimum number of file block movement. However, computation time of branch-and-bound method of an ILP optimization problem increases exponentially as the problem size grows. Therefore this paper also proposes a data block and data server grouping method to solve many small ILP problems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.5
• /
• pp.16-24
• /
• 2011

The IEEE 802.11 wireless LAN (Local Area Network) is widely used for wireless access due to its easy deployment and low cost. Multicast in wireless LANs is very useful for transmitting data to multiple receivers compared to unicast to each receiver. In the IEEE 802.11 wireless LAN, multicast transmissions are unreliable since multicast data packets are transmitted without any feedback from receivers. Recently, various protocols have been proposed to enhance the reliability of multicast transmissions. They still have serious problems in reliability and efficiency due to the excessive control overhead by the use of a large number of control packets in the error recovery process, and due to a large number of retransmissions to satisfy all receivers. In this paper, we propose an effective scheme called PTRM(Proactive Transmission based Reliable Multicast). The proposed scheme uses a block erasure code to generate parity packets and to reduce the impact of independent packet error among receivers. After generating parity packets, the PTRM transmits data packets as many as receivers need to recover error, and then requests feedback from them. The simulation results show that the proposed scheme provides reliable multicast while minimizing the feedback overhead.