Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Maria Concetta Palumbo
Pedro Lucas
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Vinicius Dal Bem
Anders X. Lindgren
Home
/
Paper
/
A Fast Algorithm Based on SRFFT for Length N = q × 2m DFTs.
Paper Info
Open Visualization
Title
A Fast Algorithm Based on SRFFT for Length N = q × 2m DFTs.
Year
Venue
DocType
2014
IEEE Trans. on Circuits and Systems
Journal
Volume
Issue
Citations
61-II
2
0
PageRank
References
Authors
0.34
0
3
Authors (3 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Weihua Zheng
1
17
3.39
Kenli Li
2
1389
124.28
Keqin Li
3
28
4.83
1