Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Naga VishnuKanth Irukulapati
Claudia Calabrese
Maria Concetta Palumbo
Eric Moore
Erik Dahlquist
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Paper
/
A Fast Algorithm With Less Operations for Length-N=q×2m DFTs.
Paper Info
Open Visualization
Title
A Fast Algorithm With Less Operations for Length-N=q×2m DFTs.
Year
Venue
DocType
2015
IEEE Transactions on Signal Processing
Journal
Volume
Issue
Citations
63
3
0
PageRank
References
Authors
0.34
0
3
Authors (3 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Kenli Li
1
1389
124.28
Weihua Zheng
2
17
3.39
Keqin Li
3
28
4.83
1