Developed an algorithm to Reduce Operational Complexity for Cyclotomic Fourier Transform
Author:
Affiliation:
1. Yeshwantrao Chavan College of Engg,Electronics Engg Department,Nagpur,India
2. Aditya College of Engg,Electronics and Communication,Surempalem,India
3. SAP,Software Engineer,Palo Alto,California
Publisher
IEEE
Link
http://xplorestaging.ieee.org/ielx7/10306338/10306339/10306984.pdf?arnumber=10306984
Reference12 articles.
1. On Computing the Fast Fourier Transform over Finite Fields;fedorenko;Proc 8th Int Workshop on Algebraic and Combinatorial Coding Theory,2002
2. Parallel Computing for the Radix-2 Fast Fourier Transform”,13th International Symposium on Distributed Computing and Applications to Business;xie;Engineering and Science,2014
3. Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm
4. Fourier transform evaluation in fields of characteristic 2;zakharova;Probl Inf Transm,1992
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3