A Programmable Approach to Evaluate Ramanujan Sums

摘要：

　　Ramanujan sums,which have been widely researched in mathematics,recently began to attract more attentions in signal processing and communications.The traditional methods to get the valnes of Ramanujan sums follow the definition and formulas in number theory,both of which need factorization information.As it is complex and the amount of time needed is unpredictable in hardware programming,a programmable approach base on the primitive roots of unity is proposed in this paper.Only simple arithmetic computing and cosine function is involved.Considering that each value of Ramanujan sums is an integer,the number of sample points required is no more than the period of Ramanujan sums,and quantification bits required are no more than 16 bits,as the simulation results demonstrated.

关键词： Ramanujan sum programmable primitive roots of unity

作者: Lina Zhou Zulin Wang Jiadong Shang Lei Zhao Song Pan

作者单位: School of Electronics and Information Engineering,Beihang University,Beijing 100191,China Computer Science and Technology College Wuhan University

会议类型: 国际会议

会议名称: 2013 2nd International Conference on Computer Science and Electronics Engineering(ICCSEE2013)(2013年第二届计算机科学与电子工程国际会议)

会议地点: 杭州

会议语种:英文

页码: 33-37

在线出版日期: 2013-03-22（万方平台首次上网日期，不代表论文的发表时间）