A Fast Method for Decoding Reed-Solomon Codes on Processors

被引：0

作者：

Chen, Yan-Haw ^{[1
]}

Huang, Ching-Fu ^{[1
]}

Chu, Shao-I ^{[2
]}

Lien, Chih-Yuan ^{[2
]}

Kao, Chien-En ^{[2
]}

机构：

[1] I Shou Univ, Dept Informat Engn, Kaohsiung 84008, Taiwan

[2] Natl Kaohsiung Univ Appl Sci, Dept Elect Engn, Kaohsiung 807, Taiwan

来源：

2014 TENTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING (IIH-MSP 2014) | 2014年

关键词：

Finte Field; Horner rule; Reed-Solomon rode; Lookup Table; Syndrome; FINITE; POLYNOMIALS; MULTIPLIERS; ROOTS;

D O I：

10.1109/IIH-MSP.2014.79

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents an efficient table lookup algorithm for high-throughput decoding of the Reed-Solomon code. The main idea behind this decoding technique is based on the two-term polynomial evaluation. The number of multiplications for the values of the received polynomial is reduced by a factor of two. Moreover, the syndrome evaluation time for the (255, 223, t=16) Reed-Solomon code by using the proposed algorithm is improved by 81.62% as compared to the traditional Homer's rule. Because of the high throughput characteristics, the presented method for computing syndrome in Reed-Solomon codes is readily adaptable for use in many applications such as CDs, VCDs, DVDs, HDTV, and RAID 6.

引用

页码：293 / 296

页数：4

共 50 条

[41] Subspace polynomials and list decoding of Reed-Solomon codes
Ben-Sasson, Eli
Kopparty, Swastik
Radhakrishnan, Jaikumar
[J]. 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 207 - +
[42] Decoding of Reed-Solomon codes for additive cost functions
Koetter, R
Vardy, A
[J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 313 - 313
[43] Simple algorithms for decoding systematic Reed-Solomon codes
Mateer, Todd D.
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2013, 69 (01) : 107 - 121
[44] Decoding Reed-Solomon Skew-Differential Codes
Gomez-Torrecillas, Jose
Navarro, Gabriel
Patricio Sanchez-Hernandez, Jose
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 7891 - 7903
[45] Modified Euclidean Algorithms for Decoding Reed-Solomon Codes
Sarwate, Dilip V.
Yan, Zhiyuan
[J]. 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1398 - +
[46] On Cauchy Matrices for Remainder Decoding of Reed-Solomon Codes
Ma, Chingwo
[J]. IEEE COMMUNICATIONS LETTERS, 2009, 13 (09) : 688 - 690
[47] Iterative list decoding approach for reed-solomon codes
Zhijun, Zhang
Kai, Niu
Chao, Dong
[J]. Journal of China Universities of Posts and Telecommunications, 2019, 26 (03): : 8 - 14
[48] Time domain decoding of extended Reed-Solomon codes
Joiner, LL
Komo, JJ
[J]. PROCEEDINGS OF THE IEEE SOUTHEASTCON '96: BRINGING TOGETHER EDUCATION, SCIENCE AND TECHNOLOGY, 1996, : 238 - 241
[49] Cryptographic hardness based on the decoding of Reed-Solomon codes
Kiayias, Aggelos
Yung, Moti
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2752 - 2769
[50] 2 NEW DECODING ALGORITHMS FOR REED-SOLOMON CODES
YAGHOOBIAN, T
BLAKE, IF
[J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1994, 5 (01) : 23 - 43

← 1 2 3 4 5 →