The generalized Goertzel algorithm and its parallel hardware implementation
From MaRDI portal
Recommendations
- Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
- Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected processor array
- Simple algorithms for BCH decoding
- scientific article; zbMATH DE number 57521
- High-speed decoder of Reed-Solomon codes
Cites work
- Algebraic coding theory
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
- On the solution of algebraic equations over finite fields
Cited in
(1)
This page was built for publication: The generalized Goertzel algorithm and its parallel hardware implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481284)