• Title/Summary/Keyword: Reed-solomon Code

Search Result 120, Processing Time 0.486 seconds

Performance Analysis of Reed Solomon/Convolutional Concatenated Codes and Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 RS/길쌈 연쇄부호와 세미 랜덤 인터리버를 이용한 터보코드의 성능 분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.861-868
    • /
    • 2001
  • In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

  • PDF

Error Control Coding and Space-Time MMSE Multiuser Detection in DS-CDMA Systems

  • Hamouda, Walaa;McLane, Peter J.
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.187-196
    • /
    • 2003
  • We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

High-Speed Reed-Solomon Decoder Using New Degree Computationless Modified Euclid´s Algorithm (새로운 DCME 알고리즘을 사용한 고속 Reed-Solomon 복호기)

  • 백재현;선우명훈
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.6
    • /
    • pp.459-468
    • /
    • 2003
  • This paper proposes a novel low-cost and high-speed Reed-Solomon (RS) decoder based on a new degree computationless modified Euclid´s (DCME) algorithm. This architecture has quite low hardware complexity compared with conventional modified Euclid´s (ME) architectures, since it can remove completely the degree computation and comparison circuits. The architecture employing a systolic away requires only the latency of 2t clock cycles to solve the key equation without initial latency. In addition, the DCME architecture using 3t+2 basic cells has regularity and scalability since it uses only one processing element. The RS decoder has been synthesized using the 0.25${\mu}{\textrm}{m}$. Faraday CMOS standard cell library and operates at 200MHz and its data rate suppots up to 1.6Gbps. For tile (255, 239, 8) RS code, the gate counts of the DCME architecture and the whole RS decoder excluding FIFO memory are only 21,760 and 42,213, respectively. The proposed RS decoder can reduce the total fate count at least 23% and the total latency at least 10% compared with conventional ME architectures.

Reed-Solomon Encoded Block Storage in Key-value Store-based Blockchain Systems (키값 저장소 기반 블록체인 시스템에서 리드 솔로몬 부호화된 블록 저장)

  • Seong-Hyeon Lee;Jinchun Choi;Myungcheol Lee
    • 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%.

SEU Mitigation Strategy and Analysis on the Mass Memory of the STSAT-3 (과학기술위성 3호 대용량 메모리에서의 SEU 극복 및 확률 해석)

  • Kwak, Seong-Woo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.4
    • /
    • pp.35-41
    • /
    • 2008
  • When memory devices are exposed to a space environment. they suffer various effects such as SEU(Single Event Upset). For these reasons, memory systems for space applications are generally equipped with error detection and correction(EDAC) logics against SEUs. In this paper, the error detection and correction strategy in the Mass Memory Unit(MMU) of the STSAT-3 is discussed. The probability equation of un-recoverable SEUs in the mass memory system is derived when the whole memory is encoded and decoded by the RS(10,8) Reed-Solomon code. Also the probability value is analyzed for various occurrence rates of SEUs which the STSAT-3 possibly suffers. The analyzed results can be used to determine the period of scrubbing the whole memory, which is one of the important parameters in the design of the MMU.

A Continuous Versatile Reed-Solomon Decoder with Variable Code Rate and Block Length (가변 부호율과 블록 길이를 갖는 연속 가변형 리드솔로몬 복호기)

  • 공민한;송문규
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.549-552
    • /
    • 2003
  • In this paper, an efficient architecture of a versatile Reed-Solomon (RS) decoder is designed, where the message length k as well as the block length n can be variable. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm(MEA). A new architecture for the MEA is designed for variable values of error correcting capability t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive and the overclocking technique. The decoder can decode a codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications due to its versatility. A versatile RS decoder over GF(2$^{8}$ ) having the error-correcting capability of up to 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

  • PDF

An Analysis of Bit Error Probability of Reed-Solomon/Trellis concatenated Coded-Modulation System (Reed-Solomon/Trellis 연접 부호변조 시스템의 비트오율 해석)

  • 김형락;이상곤;문상재
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.9
    • /
    • pp.34-43
    • /
    • 1994
  • The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

  • PDF

A Study on the Efficient Data Transmission in Noisy Channels (잡음이 심한 채널에서 효율적인 데이터전송에 관한 연구)

  • 민준기;김재열;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.3
    • /
    • pp.276-284
    • /
    • 1987
  • In this paper, the Hybrid ARQ system using Reed-Solomon code is designed and performance is analyzed. The Hybrid ARQ system performs much better that FEC or ARQ system concerning throughput and reliability especially when the channel error rate is high, approximately $10^{-1}$~$10^{-2}$. Computer Simulation shows that one error is corrected, four errors are detected and codewords which are out of order by retransmission are delivered to the user in order and that performance is excellent.

  • PDF

Shared-type Encoder/Decoder Based on 2-D Optical Codes for Large Capacity Optical CDMA Network (대용량 광 부호 분할 다중접속(Optical CDMA) 네트워크를 위한 2차원 코드의 공유형 부호기/복호기)

  • Ko Wonseok;Shin Seoyong;Hwang Humor;Chang Chulho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.359-369
    • /
    • 2005
  • For large capacity optical CDMA networks, we propose a shared-type encoder/decoders based on an tunable wavelength converter(TWC) and an arrayed waveguide grating (AWG) router. The proposed encoder/decoder treats codewords of wavelength/time 2-D code simultaneously using the dynamic code allocation property of the TWC and the cyclic property of the AWG router, and multiple subscribers can share the encoder/decoder in networks. Feasibility of the structure of the proposed encoder/decoder for dynamic code allocation is tested through simulations using two wavelength/time 2-D codes, which are the generalized multi-wavelength prime code(GMWPC) and the generalized multi-wavelength Reed-Solomon code(GMWRSC). Test results show that the proposed encoder/decoder can increase the channel efficiency not only by increasing the number of simultaneous users without any multiple-access interference but by using a relatively short length CDMA codes.

Performance Analysis of Telemetering Method using Delayed Frame Time Diversity (DFTD) and Reed-Solomon Code (지연프레임 시간다이버시티와 RS 코드를 사용한 원격측정방식의 성능분석)

  • Koh, Kwang-Ryul;Kim, Whan-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.503-511
    • /
    • 2012
  • In this paper, the performance analysis of telemetering method using delayed frame time diversity (DFTD) as the outer code and Reed-Solomon (RS) code as the inner code is described. DFTD is used to transmit a real-time frame together with a time-delayed frame which was saved in the memory during a defined period. The RS code as a kind of FEC (forward error correction) is serially concatenated with DFTD. This method was applied to the design of telemetry units that have been used for flight tests in a communication environment with deep fading. The data of the flight test for four cases with no applied code, with DFTD only, with the RS code only, and with both DFTD and the RS code are used to analyze the performance. The simulation for time-delay suggests the possibility that all frame errors can be removed. And the results of 12 flight tests show the performance superiority of this new method to compare with the RS code only.