Skip to main navigation Skip to search Skip to main content

Efficient encoding and decoding algorithm used in Reed-Solomon codes for multiple fault-tolerance memories

  • Liyi Xiao*
  • , Zheng Sun
  • , Ming Zhu
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With the increasing density of transistor and the probability of MBUs (Multiple Bits Upsets), Hamming code is not enough to provide required reliability in memories. Therefore multiple error correction codes are necessity. In this paper, Reed-Solomon (RS) codes are proposed to protect memories against MBUs which can achieve higher error correction capability (e.g. 8 bits). Besides a novel and low overhead multiplication algorithm is proposed and used in RS codes encoding and decoding process. At last, the encoder and decoder are implemented using Verilog HDL and validated through a number of simulations. The experiment results show that compared with other ECCs, RS code has higher error correction capability and lower area overhead.

Original languageEnglish
Title of host publicationProceedings of 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, CSQRWC 2011
Pages1569-1572
Number of pages4
DOIs
StatePublished - 2011
Event2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, CSQRWC 2011 - Harbin, China
Duration: 27 Jul 201130 Jul 2011

Publication series

NameProceedings of 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, CSQRWC 2011
Volume2

Conference

Conference2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, CSQRWC 2011
Country/TerritoryChina
CityHarbin
Period27/07/1130/07/11

Keywords

  • Reed-Solomon codes
  • memories
  • multiple bits upsets
  • multiplication

Fingerprint

Dive into the research topics of 'Efficient encoding and decoding algorithm used in Reed-Solomon codes for multiple fault-tolerance memories'. Together they form a unique fingerprint.

Cite this