21 citations · 58 across the 7 of their papers we have counts for
7 papers
Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over Finite Fields
Xuebin Wu, Zhiyuan Yan, Ning Chen +1
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in error correction coding. Hence, reducing the computational complexities of DFTs is of great si…
Composite Cyclotomic Fourier Transforms with Reduced Complexities
Xuebin Wu, Meghanad Wagh, Ning Chen +2
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of D…
Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control
Ning Chen, Zhiyuan Yan, Maximilien Gadouleau +2
While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to…
Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic Convolution
Meghanad D. Wagh, Ning Chen, Zhiyuan Yan
In this manuscript, we propose a novel 11-point cyclic convolution algorithm based on alternate Fourier transform. With the proposed bilinear form, we construct a length-2047 cyclo…
Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs
Ning Chen, Zhiyuan Yan
In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal compo…
Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes
Ning Chen, Zhiyuan Yan
For the majority of the applications of Reed-Solomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes withou…