On computing the syndrome polynomial in Reed-Solomon decoder

被引：24

作者：

Costa, E

Fedorenko, SV

Trifonov, PV

机构：

[1] St Petersburg State Polytech Univ, Dept Distributes Comp & Networking, St Petersburg 194021, Russia

[2] Siemens AG, D-8000 Munich, Germany

来源：

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS | 2004年 / 15卷 / 04期

关键词：

D O I：

10.1002/ett.982

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Application of the cyclotomic fast Fourier transform (FFT) algorithm to the syndrome evaluation problem in classical Reed-Solomon decoders is described. A number of complexity reduction tricks is suggested. Application of the algorithm leads to significant reductions in the complexity of syndrome evaluation. Moreover, automatic generation of the program code implementing the described algorithm is possible. Copyright (C) 2004 AEI.

引用

页码：337 / 342

页数：6

共 10 条

[1]

Aho A., 1976, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1973, ART COMPUTER PROGRAM

[3]

Berlekamp E. R., 1968, ALGEBRAIC CODING THE

[4]

BLAHUT RE, 1984, THEORY PRACTICE ERRO