Area-optimized Syndrome Calculation for ReedSolomon Decoder

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 62
  • Download : 0
In this paper an efficient structure to compute syndromes is proposed for Reed-Solomon decoders. The proposed method formulates all the computations relevant to syndromes as a matrix multiplication so as to enlarge the search area for common sub-expressions. In contrast to the conventional architecture, the proposed method completely removes finite-field adders as they are embedded in the single matrix multiplication. The hardware resources are drastically reduced by sharing common sub-expressions and eliminating finite-field adders. Syndrome calculation blocks for various RS codes are synthesized with a 0.13 mu m CMOS technology, and experimental results show that the proposed method reduces the hardware complexity of parallel syndrome calculation by approximately 50% compared to the conventional structure.
Publisher
IEEK PUBLICATION CENTER
Issue Date
2018-10
Language
English
Article Type
Article
Citation

JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, v.18, no.5, pp.609 - 615

ISSN
1598-1657
DOI
10.5573/JSTS.2018.18.5.609
URI
http://hdl.handle.net/10203/246698
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0