๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Reduction of Additive Complexity of Cyclotomic FFTs

โœ Scribed by Bellini, S.; Ferrari, M.; Tomasoni, A.

Book ID
114613079
Publisher
IEEE
Year
2012
Tongue
English
Weight
132 KB
Volume
60
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Dataflow Time and Space Complexity o
The Dataflow Time and Space Complexity of FFTs
โœ A.P.W. Bohm; R.E. Hiromoto ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 747 KB

In this paper we analyze the performance of a recursive and an iterative fast Fourier transform algorithm, written in Id and run on MINT, a simulator for the Monsoon dataflow machine. Our complexity measures are: the number of instructions executed, the critical path length of the dataflow graph, an

On the linear complexity of generalized
On the linear complexity of generalized cyclotomic sequences with the period
โœ Tongjiang Yan; Shengqiang Li; Guozhen Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period p m , which are contained by the sequences constructed by C. Ding and T. Helleseth in 1998, as a representative special case. The results obtained confirm that all of these seque