FPGA Implementation of Area and Speed Efficient CORDIC Algorithm

Harshita Nair, Anu Chalil
{"title":"FPGA Implementation of Area and Speed Efficient CORDIC Algorithm","authors":"Harshita Nair, Anu Chalil","doi":"10.1109/ICCMC53470.2022.9753730","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient serial and parallel Coordinate Rotation Digital Computer (CORDIC) architecture that is both area utilization and delay efficient and compares the two architectures. CORDIC algorithm is an integral part of DSP (digital signal processing) applications since it helps to perform complex operations such as trigonometric, logarithmic, exponential, and many other mathematical functions with a multiplier less architecture and using simple hardware blocks. In this project 32-bit floating-point serial and parallel CORDIC architecture is implemented on Field programmable gate array device (FPGA) with the help of different adders such as Carry Save adder (CSA), Carry Select adder (CSLA), Han Carlson adder, Sklansky and Ladner Fischer adder in place of the conventional ripple carry adder block used in CORDIC architecture to come up with an area and speed efficient CORDIC architecture. The proposed architecture with Ladner Fischer adder gives 4.7 percent area utilization improvement compared to other parallel prefix adders in serial CORDIC architecture and parallel CORDIC architecture. It also gives 43.5 percent lesser delay compared to serial CORDIC architecture implemented with Carry save adder and 43.9 percent lesser delay than parallel CORDIC architecture implemented with carry-save adder.","PeriodicalId":345346,"journal":{"name":"2022 6th International Conference on Computing Methodologies and Communication (ICCMC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th International Conference on Computing Methodologies and Communication (ICCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMC53470.2022.9753730","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes an efficient serial and parallel Coordinate Rotation Digital Computer (CORDIC) architecture that is both area utilization and delay efficient and compares the two architectures. CORDIC algorithm is an integral part of DSP (digital signal processing) applications since it helps to perform complex operations such as trigonometric, logarithmic, exponential, and many other mathematical functions with a multiplier less architecture and using simple hardware blocks. In this project 32-bit floating-point serial and parallel CORDIC architecture is implemented on Field programmable gate array device (FPGA) with the help of different adders such as Carry Save adder (CSA), Carry Select adder (CSLA), Han Carlson adder, Sklansky and Ladner Fischer adder in place of the conventional ripple carry adder block used in CORDIC architecture to come up with an area and speed efficient CORDIC architecture. The proposed architecture with Ladner Fischer adder gives 4.7 percent area utilization improvement compared to other parallel prefix adders in serial CORDIC architecture and parallel CORDIC architecture. It also gives 43.5 percent lesser delay compared to serial CORDIC architecture implemented with Carry save adder and 43.9 percent lesser delay than parallel CORDIC architecture implemented with carry-save adder.
面积和速度高效CORDIC算法的FPGA实现
本文提出了一种高效的串行和并行坐标旋转数字计算机(CORDIC)结构,该结构既具有面积利用率,又具有延迟效率,并对两种结构进行了比较。CORDIC算法是DSP(数字信号处理)应用程序的一个组成部分,因为它有助于执行复杂的运算,如三角函数、对数、指数函数和许多其他数学函数,使用无乘子架构和简单的硬件块。在本项目中,32位浮点串行和并行CORDIC架构在现场可编程门阵列器件(FPGA)上实现,借助不同的加法器,如进位保存加法器(CSA),进位选择加法器(CSLA), Han Carlson加法器,Sklansky和Ladner Fischer加法器,取代了CORDIC架构中使用的传统纹波进位加法器块,从而提出了面积和速度高效的CORDIC架构。与串行CORDIC架构和并行CORDIC架构中的其他并行前缀加法器相比,所提出的Ladner Fischer加法器的面积利用率提高了4.7%。与使用进位保存加法器实现的串行CORDIC架构相比,它的延迟减少了43.5%,比使用进位保存加法器实现的并行CORDIC架构的延迟减少了43.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信