• Title/Summary/Keyword: Reed Solomon

Search Result 222, Processing Time 0.024 seconds

A Hybrid Decoding Algorithm for MPE-FEC based on DVB-SSP (DVB-SSP 기반 혼합형 MPE-FEC 복호 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Kim, Nam-Soo;Kim, Chul-Sung;Jung, Ji-Won;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9C
    • /
    • pp.848-854
    • /
    • 2009
  • DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handhold systems and fixed terrestrial systems. An upper layer, including erasure Reed-Solomon error correction combined with cyclic redundancy check. However, a critical factor must be considered in upper layer decoding. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. If, for example, there is one real byte error, in an If packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed upper layer decoding methods; hybrid decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one in AWGN channel and TI channel.

Propose and Performance Analysis of Turbo Coded New T-DMB System (터보부호화된 새로운 T-DMB 시스템 제안 및 성능 분석)

  • Kim, Hanjong
    • Journal of Digital Convergence
    • /
    • v.12 no.3
    • /
    • pp.269-275
    • /
    • 2014
  • The DAB system was designed to provide CD quality audio and data services for fixed, portable and mobile applications with the required BER below $10^{-4}$. However for the T-DMB system with the video service of MPEG-4 stream, BER should go down $10^{-8}$ by adding FEC blocks which consist of the Reed-Solomon (RS) encoder/decoder and convolutional interleaver/deinterleaver. In this paper we propose two types of turbo coded T-DMB system without altering the puncturing procedure and puncturing vectors defined in the standard T-DMB system for compatibility. One(Type 1) can replace the existing RS code, convolutional interleaver and RCPC code by a turbo code and the other one (Type 2) can substitute the existing RCPC code by a turbo code. Simulation results show that two new turbo coded systems are able to yield considerable performance gain after just 2 iterations. Type 2 system is better than type 1 but the amount of performance improvement is small.

On The Size of The Subgroup Generated by Linear Factors (선형 요소에 의해 생성된 부분그룹의 크기에 관한 연구)

  • Cheng, Qi;Hwang, Sun-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.6
    • /
    • pp.27-33
    • /
    • 2008
  • Given a polynomial ${\hbar}(x){\in}F_q[x]$ of degree h, it is an important problem to determine the size of multiplicative subgroup of $\(F_q[x]/({\hbar(x))\)*$ generated by $x-s_1,\;x-s_2,\;{\cdots},\;x-s_n$, where $\{s_1,\;s_2,\;{\cdots},\;s_n\}{\sebseteq}F_q$, and for all ${\hbar}(x){\neq}0$. So far the best known asymptotic lower bound is $(rh)^{O(1)}\(2er+O(\frac{1}{r})\)^h$, where $r=\frac{n}{h}$ and e(=2.718...) is the base of natural logarithm. In this paper, we exploit the coding theory connection of this problem and prove a better lower bound $(rh)^{O(1)}\(2er+{\frac{e}{2}}{\log}r-{\frac{e}{2}}{\log}{\frac{e}{2}}+O{(\frac{{\log}^2r}{r})}\)^h$, where log stands for natural logarithm We also discuss about the limitation of this approach.

Efficient Cooperative Transmission Scheme for High Speed WPAN System in 60GHz (60GHz WPAN 시스템의 전송 효율 향상을 위한 협력 통신 기법)

  • Lee, Won-Jin;Lee, Jae-Young;Suh, Young-Kil;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3C
    • /
    • pp.255-263
    • /
    • 2010
  • In this paper, we present an efficient cooperative transmission scheme for high speed 60GHz WPAN system. In 60GHz, the cooperative transmission with relay is effective scheme because signals are exceedingly attenuated according to the distance and the transmission is impossible when there is no LOS between transmitter and receiver. Moreover, the reliability of signal in destination can be improved by receiving data from a relay as well as a transmitter. However, the overall data rate is reduced because transmission time is more required for relay. To solve this problem, we propose a cooperative transmission scheme with RS-CC serial concatenated codes. In the proposed cooperative transmission scheme, the relay can reduce the transmission data size because the only parity bits of systematic RS code are transmitted after encoding by CC. But the computational complexity is increased at the relay and the destination.

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

  • Vairaperumal Bhuvaneshwari;Chandrapragasam Tharini
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.404-417
    • /
    • 2023
  • 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 Eb/N0 than conventional LDPC codes, which showed a BER of 10-7 at 3 dB Eb/N0. Subsequently, implementation of the proposed QC-LDPC code in a softwaredefined radio, using the NI USRP 2920 hardware platform, was conducted. As a result, a BER of 10-6 at 4.2 dB Eb/N0 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.

A Disk-based Archival Storage System Using the EOS Erasure Coding Implementation for the ALICE Experiment at the CERN LHC

  • Ahn, Sang Un;Betev, Latchezar;Bonfillou, Eric;Han, Heejune;Kim, Jeongheon;Lee, Seung Hee;Panzer-Steindel, Bernd;Peters, Andreas-Joachim;Yoon, Heejun
    • 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.

Design of High-Speed Parallel Multiplier over Finite Field $GF(2^m)$ (유한체 $GF(2^m)$상의 고속 병렬 승산기의 설계)

  • Seong Hyeon-Kyeong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.5 s.311
    • /
    • pp.36-43
    • /
    • 2006
  • In this paper we present a new high-speed parallel multiplier for Performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the MOD operation part to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of MOD operation part have two AND gates and two XOR gates. Using these MOD operation parts, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the MOD operation parts with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI. Also, since this circuit has a low propagation delay time generated by the gates during operating process because of not use the memory elements in the inside of multiplier circuit, this multiplier circuit realizes a high-speed operation.

Matchmaker: Fuzzy Vault Scheme for Weighted Preference (매치메이커: 선호도를 고려한 퍼지 볼트 기법)

  • Purevsuren, Tuvshinkhuu;Kang, Jeonil;Nyang, DaeHun;Lee, KyungHee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.2
    • /
    • pp.301-314
    • /
    • 2016
  • Juels and Sudan's fuzzy vault scheme has been applied to various researches due to its error-tolerance property. However, the fuzzy vault scheme does not consider the difference between people's preferences, even though the authors instantiated movie lover' case in their paper. On the other hand, to make secure and high performance face authentication system, Nyang and Lee introduced a face authentication system, so-called fuzzy face vault, that has a specially designed association structure between face features and ordinary fuzzy vault in order to let each face feature have different weight. However, because of optimizing intra/inter class difference of underlying feature extraction methods, we can easily expect that the face authentication system does not successfully decrease the face authentication failure. In this paper, for ensuring the flexible use of the fuzzy vault scheme, we introduce the bucket structure, which differently implements the weighting idea of Nyang and Lee's face authentication system, and three distribution functions, which formalize the relation between user's weight of preferences and system implementation. In addition, we suggest a matchmaker scheme based on them and confirm its computational performance through the movie database.

Characteristics of Underwater Acoustic Channel and Performance of Multi-Carrier System in Littoral Ocean near Busan City (부산인근 해역의 수중음향통신 채널특성과 다중반송파 시스템의 성능)

  • Kim, Jongjoo;Park, Jihyun;Bae, Minja;Yoon, Jong Rak
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.12
    • /
    • pp.2394-2402
    • /
    • 2017
  • The frequency selective fading by multipaths determines a performance of underwater acoustic communication system in shallow littoral ocean. In this study, a characteristics of underwater acoustic channel and performance of multi-carrier system is evaluated in littoral ocean with a 50m deep water, an effective wave height of 0.5m and sandy mud bottom near Busan city. A multipath delay spread and time and frequency domain are presented as a function of a transmitter-to-receiver range. A bit-error-rate of a 5 channel 4FSK(Frequency Shift Keying) with a transmission rate of 1kbps, is examined and RS(Reed-Solomon) code is also adopted to remove a burst error due to time domain fading. A number of multipath are less than four and a bit-error-rate is decreased as an increase of a transmitter-to-receiver range which gives a congestion of multi-paths resulting in a decrease of time and frequency domain fading. The measured bit-error-rate is about 10-4 at greater than 600m of transmitter-to-receiver range.

VLSI Design of Interface between MAC and PHY Layers for Adaptive Burst Profiling in BWA System (BWA 시스템에서 적응형 버스트 프로파일링을 위한 MAC과 PHY 계층 간 인터페이스의 VLSI 설계)

  • Song Moon Kyou;Kong Min Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.1
    • /
    • pp.39-47
    • /
    • 2005
  • The range of hardware implementation increases in communication systems as high-speed processing is required for high data rate. In the broadband wireless access (BWA) system based on IEEE standard 802.16 the functions of higher part in the MAC layer to Provide data needed for generating MAC PDU are implemented in software, and the tasks from formatting MAC PDUs by using those data to transmitting the messages in a modem are implemented in hardware. In this paper, the interface hardware for efficient message exchange between MAC and PHY layers in the BWA system is designed. The hardware performs the following functions including those of the transmission convergence(TC) sublayer; (1) formatting TC PDU(Protocol data unit) from/to MAC PDU, (2) Reed-solomon(RS) encoding/decoding, and (3) resolving DL MAP and UL MAP, so that it controls transmission slot and uplink and downlink traffic according to the modulation scheme of burst profile. Also, it provides various control signal for PHY modem. In addition, the truncated binary exponential backoff (TBEB) algorithm is implemented in a subscriber station to avoid collision on contention-based transmission of messages. The VLSI architecture performing all these functions is implemented and verified in VHDL.