Complexity analysis of reed-solomon decoding over GF(2m) without using syndromes

Eurasip Journal on Wireless Communications and Networking

Volumn 2008, Issue , 2008, Pages

  Yan, Zhiyuan ^a   Chen, Ning ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); FAST FOURIER TRANSFORMS; FOOD ADDITIVES; HEALTH; RAPID SOLIDIFICATION;

BLOCK LENGTHS; COMPLEXITY ANALYSIS; DECODING ALGORITHMS; EXTENDED EUCLIDEAN ALGORITHM; FAST IMPLEMENTATION; FIELD OPERATIONS; HARDWARE COSTS; HIGH RATES; REED-SOLOMON (RS) CODING; REED-SOLOMON (RS) DECODING; RS CODING;

DECODING;

EID: 47649112427     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2008/843634     Document Type: Article

References (27)

1. Wicker S. B., Bhargava V. K., ReedSolomon Codes and Their Applications 1994 New York, NY, USA IEEE Press
2. Berlekamp E. R., Algebraic Coding Theory 1968 New York, NY, USA McGraw-Hill
3. Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T., A method for solving key equation for decoding Goppa codes Information and Control 1975 27 1 87 99
4. Shiozaki A., Decoding of redundant residue polynomial codes using Euclids algorithm IEEE Transactions on Information Theory 1988 34 5, part 1 1351 1354
5. Shiozaki A., Truong T. K., Cheung K. M., Reed I. S., Fast transform decoding of nonsystematic ReedSolomon codes IEE Proceedings: Computers and Digital Techniques 1990 137 2 139 143
6. Gao S., Bhargava V. K., Poor H. V., Tarokh V., Yoon S., A new algorithm for decoding ReedSolomon codes Communications, Information and Network Security 2003 Norwell, Mass, USA Kluwer Academic Publishers 55 68
7. Fedorenko S. V.
8. Fedorenko S. V.
9. Welch L. R., Berlekamp E. R., Error correction for algebraic block codes. US patent 4633470, September 1983
10. Justesen J., On the complexity of decoding ReedSolomon codes IEEE Transactions on Information Theory 1976 22 2 237 238
11. von zur Gathen J., Gerhard J., Arithmetic and factorization of polynomials over 2 1996 tr-rsfb-96-018 Paderborn, Germany University of Paderborn. http://www-math.uni-paderborn.de/aggathen/Publications/gatger96a.ps
12. von zur Gathen J., Gerhard J., Modern Computer Algebra 2003 2nd Cambridge, UK Cambridge University Press
13. Cantor D. G., On arithmetical algorithms over finite fields Journal of Combinatorial Theory, Series A 1989 50 2 285 300
14. Khodadad S., Fast rational function reconstruction, M.S. thesis 2005 Burnaby, BC, Canada Simon Fraser University
15. Wang Y., Zhu X., A fast algorithm for the Fourier transform over finite fields and its VLSI implementation IEEE Journal on Selected Areas in Communications 1988 6 3 572 577
16. Chen N., Yan Z., Reduced-complexity cyclotomic FFT and its application in ReedSolomon decoding Proceedings of the IEEE Workshop on Signal Processing Systems (SIPS 07) October 2007 Shanghai, China 657 662
17. Khodadad S.
18. Moon T. K., Error Correction Coding: Mathematical Methods and Algorithms 2005 Hoboken, NJ, USA John Wiley Sons
19. Komo J. J., Joiner L. L., Adaptive ReedSolomon decoding using Gaos algorithm 2 Proceedings of the IEEE Military Communications Conference (MILCOM 02) October 2002 Anaheim, Calif, USA 1340 1343
20. Berlekamp E., Seroussi G., Tong P., Wicker S. B., Bhargava V. K., A hypersystolic ReedSolomon decoder ReedSolomon Codes and Their Applications 1994 New York, NY, USA IEEE Press 205 241
21. Mandelbaum D., On decoding of ReedSolomon codes IEEE Transactions on Information Theory 1971 17 6 707 712
22. Heydtmann A. E.
23. Yan Z.
24. Park T.
25. Telemetry Channel Coding. CCSDS Std. 101.0-B-6, October 2002
26. Sunar B., Ko.K.
27. Mahboob A.