Representation of cascade codes in the frequency domain

A Kuznetsov, A Pushkar'ov, R Serhiienko… - Data-Centric Business …, 2020 - Springer
The mathematical apparatus of the multidimensional discrete Fourier transform over finite
fields is considered. Methods for the description of linear block codes in the frequency …

The discrete Fourier transform over the binary finite field

SV Fedorenko - IEEE Access, 2023 - ieeexplore.ieee.org
The novel methods for binary discrete Fourier transform (DFT) computation over the finite
field have been proposed. The methods are based on a binary trace calculation over the …

Efficient syndrome calculation via the inverse cyclotomic discrete Fourier transform

SV Fedorenko - IEEE Signal Processing Letters, 2019 - ieeexplore.ieee.org
An effective calculation of the Reed-Solomon code syndrome is proposed. The method is
based on the use of the partial normalized cyclic convolutions in the partial inverse …

Duhamel/Hollmann-like discrete Fourier transform algorithm with the smallest multiplicative complexity over a finite field

SV Fedorenko - IEEE Transactions on Signal Processing, 2020 - ieeexplore.ieee.org
The new method for the discrete Fourier transform computation over a finite field is
introduced. This method is a nontrivial generalization of the Duhamel-Hollmann algorithm …

Efficient algorithm for finding roots of error-locator polynomials

SV Fedorenko - IEEE Access, 2021 - ieeexplore.ieee.org
A novel method for finding roots of polynomials over finite fields has been proposed. This
method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is …

Improving the Goertzel–Blahut algorithm

SV Fedorenko - IEEE Signal Processing Letters, 2016 - ieeexplore.ieee.org
A novel method for computing the discrete Fourier transform (DFT) over a finite field based
on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for …

Normalized cyclic convolution: The case of even length

SV Fedorenko - IEEE Transactions on Signal Processing, 2015 - ieeexplore.ieee.org
A normalized cyclic convolution is a cyclic convolution when one of its factors is a fixed
polynomial. Herein, a novel method for constructing a normalized cyclic convolution over a …

Design of cyclotomic Fast Fourier Transform architecture over Galois field for 15 point DFT

TP Deshmukh, PR Deshmukh… - … Conference on Industrial …, 2015 - ieeexplore.ieee.org
The Fast Fourier Transform can be determined in Complex field and Galois field. The paper
suggests the architecture for finding Fast Fourier Transform over a Galois field. This method …

Design of common sub expression elimination algorithm in fast Fourier transform

MA Hatwar, TG Panse, S Pothuri - … International Conference on …, 2015 - ieeexplore.ieee.org
Common sub expression elimination (CSE) is a critical procedure in many multiplierless
implementations of DSP algorithms. The aim of CSE is dual-pronged to reduce the number …

[引用][C] A spectral algorithm for decoding systematic BCH codes

SV Fedorenko - IEEE Access, 2022 - ieeexplore.ieee.org
A Spectral Algorithm for Decoding Systematic BCH Codes Page 1 Date of publication xxxx
00, 0000, date of current version xxxx 00, 0000. Digital Object Identifier 10.1109/ACCESS.2017.DOI …