OpenAlex
PricingAboutJobs
Log inGet started
Work

A Fast Algorithm With Less Operations for Length- $N=q\times 2^{m}$ DFTs

HTML

Year: 2014
Type: article
Source: IEEE Transactions on Signal Processing
DOI: 10.1109/tsp.2014.2379678
Authors: Kenli Li, Weihua Zheng, Keqin Li
Institutions: SUNY New Paltz, Hunan University
Language: English

Topic: Digital Filter Design and Implementation
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funders: National Natural Science Foundation of China, Ministry of Education of the People's Republic of China
Awards: 云计算环境下移动Agent系统信任安全关键技术研究, G3029809707, 面向多核异构并行系统的随机调度策略与算法研究, G662528876, 面向异构并行系统的生物序列比对并行策略及算法研究, 异构并行环境下的MapReduce资源调度模型与方法研究
OpenAlex ID: W1979555829
FWCI: 1.917
Cites: 32
Cited by: 23
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms