The generalized Goertzel algorithm and its parallel hardware implementation

被引：0

作者：

Chen Hao ^{[1
]}

Chen GongLiang ^{[2
]}

Li JianHua ^{[2
]}

机构：

[1] E China Normal Univ, Inst Software Engn, Shanghai 200062, Peoples R China

[2] Shanghai Jiao Tong Univ, Sch Informat Secur Engn, Dept Elect Engn, Shanghai 200030, Peoples R China

来源：

SCIENCE IN CHINA SERIES A-MATHEMATICS | 2008年 / 51卷 / 01期

基金：

中国国家自然科学基金;

关键词：

number theory of finite field; RS and BCH decoding; normal base; the Goertzel algorithm;

D O I：

10.1007/s11425-007-0183-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem in the implementation of RS and BCH decoding is the fast finding of the error positions (the roots of error locator polynomials). Several fast root-finding algorithms for polynomials over finite fields have been proposed. In this paper we give a generalization of the Goertzel algorithm. Our algorithm is suitable for the parallel hardware implementation and the time of multiplications used is restricted by a constant.

引用

页码：37 / 41

页数：5

共 11 条

[1] ON SOLUTION OF ALGEBRAIC EQUATIONS OVER FINITE FIELDS [J].

BERLEKAM.ER ;

RUMSEY, H ;

SOLOMON, G .

INFORMATION AND CONTROL, 1967, 10 (06) :553-&

[2]

Berlekamp E. R., 2015, Algebraic Coding Theory

[3]

BLAHUT RE, 1984, THEORY PRACTICE ERRO

[4] CYCLIC DECODING PROCEDURES FOR BOSE-CHAUDHURI-HOCQUENGHEM CODES [J].

CHIEN, RT .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (04) :357-&

[5] HYBRID METHODS FOR FINDING ROOTS OF A POLYNOMIAL - WITH APPLICATION TO BCH DECODING [J].

CHIEN, RT ;

CUNNINGHAM, BD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (02) :329-+

[6] Finding roots of polynomials over finite fields [J].

Fedorenko, SV ;

Trifonov, PV .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (11) :1709-1711

[7]

Lidl R., 1984, FINITE FIELDS

[8]

McEliece R. J., 1984, THEORY INFORM CODING

[9]

McEliece Robert J., 1987, Finite Fields for Computer Scientists and Engineers

[10] Fast algorithm for computing the roots of error locator polynomials up to degree II in Reed-Solomon decoders [J].

Truong, TK ;

Jeng, JH ;

Reed, IS .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) :779-783

← 1 2 →