A pipeline design of a fast prime factor DFT on a finite field

DOI10.1109/12.2163zbMath0649.65069OpenAlexW2124197174MaRDI QIDQ3795179

In-Shek Hsu, Hsuen-Chyun Shyu, Howard M. Shao, Trieu-Kien Truong, Irving S. Reed

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.2163

zbMATH Keywords

Reed-Solomon codesfast discrete Fourier transformcyclic convolutionscyclic shufflingfercile decodingmeasure primepipeline techniqueprime factor DFT

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (1)

Realization of discrete Fourier transforms using a nesting algorithm

This page was built for publication: A pipeline design of a fast prime factor DFT on a finite field