• Title/Summary/Keyword: RS decoder

Search Result 75, Processing Time 0.057 seconds

The design and performance analysis of RS(255,223) code for X-band downlink of STSAT-3 (과학기술위성3호의 X-대역 하향링크를 위한 RS(255,223) 코드 설계 및 성능 분석)

  • Seo, In-Ho;Kim, Byung-Jun;Lee, Jong-Ju;Kwak, Seong-Woo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.2
    • /
    • pp.195-199
    • /
    • 2010
  • (255,223) RS(Reed-Solomon) code which is the CCSDS(Consultative Committee for Space Data Systems) standard was used in the STSAT-3 to correct errors during the downlink of payload data. The RS encoder developed by VHDL was implemented in MMU(Mass Memory Unit). Moreover, the RS decoder developed by C-language was implemented in the DRS(Data Receiving System) of ground station. In this paper, we reported the design and analysis results of RS(255,223) for STSAT-3. The BER(Bit Error Rate) performance from MMU to DRS was confirmed through the downlink test at 16 Mbps. Also, the error correction performance and capability of RS(255,223) was tested by the manual attenuation of the RF(Radio Frequency) signal in the X-band transmitter resulting in putting some errors in the communication line.

The VLSI implementation of RS Decoder using the Modified Euclidean Algorithm (변형 유클리디안 알고리즘을 이용한 리드 - 솔로몬 디코더의 VLSI 구현)

  • 최광석;김수원
    • 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.

  • PDF

Design of RS Encoder/Decoder using Modified Euclid algorithm (수정된 유클리드 알고리즘을 이용한 RS부호화기/복호화기 설계)

  • Park Jong-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1506-1511
    • /
    • 2004
  • The error control of digital transmission system is a very important subject because of the noise effects, which is very sensitive to transmission performance of the digital communication system It employs a modified Euclid's algorithm to compute the error-location polynomial and error-magnitude polynomial of input data. The circuit size is reduced by selecting the Modified Euclid's Algorithm with one Euclid Cell of mutual operation. And the operation speed of Decoder is improved by using ROM and parallel structure. The proposed Encoder and Decoder are simulated with ModelSim and Active-HDL and synthesized with Synopsys. We can see that this chip is implemented on Xilinx Virtex2 XC2V3000. A share of slice is 28%. nut speed of this paper is 45Mhz.

Design of an Area-Efficient Reed-Solomon Decoder using Pipelined Recursive Technique (파이프라인 재귀적인 기술을 이용한 면적 효율적인 Reed-Solomon 복호기의 설계)

  • Lee, Han-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.7 s.337
    • /
    • pp.27-36
    • /
    • 2005
  • This paper presents an area-efficient architecture to implement the high-speed Reed-Solomon(RS) decoder, which is used in a variety of communication systems such as wireless and very high-speed optical communications. We present the new pipelined-recursive Modified Euclidean(PrME) architecture to achieve high-throughput rate and reducing hardware-complexity using folding technique. The proposed pipelined recursive architecture can reduce the hardware complexity about 80$\%$ compared to the conventional systolic-array and fully-parallel architecture. The proposed RS decoder has been designed and implemented with the 0.13um CMOS technology in a supply voltage of 1.2 V. The result show that total number of gate is 393 K and it has a data processing rate of S Gbits/s at clock frequency of 625 MHz. The proposed area-efficient architecture can be readily applied to the next generation FEC devices for high-speed optical communications as well as wireless communications.

A recursive trellis decoder using feedback data in ATSC DTV receivers (ATSC DTV 수신기에서 피드백을 갖는 트렐리스 복호기)

  • Oh, Young-Ho;Lee, Kyoung-Won;Kim, Dae-Jin
    • Journal of Broadcast Engineering
    • /
    • v.12 no.6
    • /
    • pp.641-648
    • /
    • 2007
  • The decoding structure of up-to-date ATSC DTV receivers is well optimized, and it seems that 14.6 dB is the unbreakable minimum SNR in the AWGN channel. But the SNR satisfying the Shannon capacity of DTV receivers is 11.76 dB, So, the SNR gab between the 14.6 dB and the 11.76 dB is about 2.8 dB. In order to approach the Shannon capacity we propose a recursive trellis decoder which uses reliable feedback data obtained by an RS decoder. The performance enhancement of about 0.8 dB can be achieved in case of the AWGN channel.

40Gb/s Foward Error Correction Architecture for Optical Communication System (광통신 시스템을 위한 40Gb/s Forward Error Correction 구조 설계)

  • Lee, Seung-Beom;Lee, Han-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.2
    • /
    • pp.101-111
    • /
    • 2008
  • This paper introduces a high-speed Reed-Solomon(RS) decoder, which reduces the hardware complexity, and presents an RS decoder based FEC architecture which is used for 40Gb/s optical communication systems. We introduce new pipelined degree computationless modified Euclidean(pDCME) algorithm architecture, which has high throughput and low hardware complexity. The proposed 16 channel RS FEC architecture has two 8 channel RS FEC architectures, which has 8 syndrome computation block and shared single KES block. It can reduce the hardware complexity about 30% compared to the conventional 16 channel 3-parallel FEC architecture, which is 4 syndrome computation block and shared single KES block. The proposed RS FEC architecture has been designed and implemented with the $0.18-{\mu}m$ CMOS technology in a supply voltage of 1.8 V. The result show that total number of gate is 250K and it has a data processing rate of 5.1Gb/s at a clock frequency of 400MHz. The proposed area-efficient architecture can be readily applied to the next generation FEC devices for high-speed optical communications as well as wireless communications.

Error Performance Analysis of a FEC for the Cable Modem (유선 케이블 모뎀의 FEC 성능평가)

  • 이창재;김경덕;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11A
    • /
    • pp.1803-1811
    • /
    • 2001
  • In this paper, Forward Error Correction(FEC) that is satisfied with ITU-T Recommendation J.83, Annex B(North American Data Over Cable Service Interface Specifications(DOCSIS) for Multimedia Cable Network System(MCNS)) is analyzed. The FEC consist of Reed-Solomon(RS) layer, interleaving layer, randomization layer, and trellis coded modulation(TCM) layer. The effects of quantization of input symbol and of trace-back depth in the Viterbi decoder are simulated over AWGN channels.

  • PDF

Erasure decoding strategies for RS product code reducing undetected error rate (검출 불능 오류율을 향상기키는 Reed-Solomon 적부호의 이레이져 복호방법)

  • 김정헌;염창열;송홍엽;강구호;김순태;백세현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.4B
    • /
    • pp.427-436
    • /
    • 2001
  • RS product codes are widely used in digital storage systems. There are lots of decoding strategies for product code for short-length RS codes. Unfortunately many of them cannot be applied to long-length RS product codes because of the complexity of decoder. This paper proposes new decoding strategies which can be used in long length RS product codes.

  • PDF

Design of a High Speed and Parallel Reed-Solomon Decoder Using a Systolic Array (시스톨릭 어레이를 이용한 고속 병렬처리 Reed-Solomon 복호기 설계)

  • 강진용;선우명훈
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.245-248
    • /
    • 2001
  • 본 논문에서는 연집 오류(burst error)에 우수한 정정 능력을 보이는 고속 RS(Reed-Solomon) 복호기를 제안한다. 제안된 RS 복호기는 RS(n, k, t); (37 < n ≤ 255, 21 < k ≤ 239, t = 8)의 사양을 지원하며 수정 유클리드 알고리즘(modified Euclid´s algorithm)을 이용한 시스톨릭 어레이(systolic array) 방식의 병렬처리 구조로 설계되었다. 고속 RS 복호기의 효율적인 VSLI 설계를 위하여 새로운 방식의 수정 유클리드 알고리즘 연간 회로를 제안한다. 제안된 수정 유클리드 알고리즘 회로는 2t + 1의 연산 지연 시간을 갖으며 기존 구조의 연산 지연 시간인 3t + 37에 비하여 t = 8 인 경우 약 72%의 연산 지연이 감소하였다. 제안된 구조를 VHDL을 이용하여 설계하였으며 SAMSUNG 0.5㎛(KG80) 라이브러리를 이용하여 논리 합성과 타이밍 검증을 수행하였다. 합성된 RS 복호기의 총 게이트 수는 약 77,000 개이며 최대 80MHz의 동작 속도를 나타내었다.

  • PDF

Design Optimization of the Arithmatic Logic Unit Circuit for the Processor to Determine the Number of Errors in the Reed Solomon Decoder (리드솔로몬 복호기에서 오류갯수를 계산하는 처리기의 산술논리연산장치 회로 최적화설계)

  • An, Hyeong-Keon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11C
    • /
    • pp.649-654
    • /
    • 2011
  • In this paper, we show new method to find number of errors in the Reed-Solomon decoder. New design is much faster and has much simpler logic circuit than the former design method. This optimization was possible by very simplified square calculating circuit and parallel processing. The microcontroller of this Reed Solomon decoder can be used for data protection of almost all digital communication and consumer electronic devices.