Area Optimized Implementation of Galois Field Fourier Transform

Rosary Catherin Steffy A, S. Pushpa, M. K, Senbagakuzhalvaimozhi S, Varalakshmi P
{"title":"Area Optimized Implementation of Galois Field Fourier Transform","authors":"Rosary Catherin Steffy A, S. Pushpa, M. K, Senbagakuzhalvaimozhi S, Varalakshmi P","doi":"10.1109/ICSCDS53736.2022.9761047","DOIUrl":null,"url":null,"abstract":"Fourier transform is the conversion of signal from time domain to frequency domain. FFT is a modified version of DFT, where the computation is fast when compared to DFT. Performing FFT over finite field is the main task. Finite fields are fields which consists of finite elements. Performing FFT over finite field is called Galois field FFT. In this project, a method to implement the Galois field FFT without multipliers is done for three architectures namely the SIPO (Serial In Parallel Out) architecture, PISO (Parallel In Serial Out) architecture and optimized SIPO architecture. It is observed that a reduction in area of 42% in 'SIPO and PISO architectures' and 50% reduction in area in ‘optimized SIPO architecture’ is achieved on implementing multiplier less design by replacing the wrap around carry addition with XOR multiplexer full adder instead of conventional full adder.","PeriodicalId":433549,"journal":{"name":"2022 International Conference on Sustainable Computing and Data Communication Systems (ICSCDS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Sustainable Computing and Data Communication Systems (ICSCDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCDS53736.2022.9761047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Fourier transform is the conversion of signal from time domain to frequency domain. FFT is a modified version of DFT, where the computation is fast when compared to DFT. Performing FFT over finite field is the main task. Finite fields are fields which consists of finite elements. Performing FFT over finite field is called Galois field FFT. In this project, a method to implement the Galois field FFT without multipliers is done for three architectures namely the SIPO (Serial In Parallel Out) architecture, PISO (Parallel In Serial Out) architecture and optimized SIPO architecture. It is observed that a reduction in area of 42% in 'SIPO and PISO architectures' and 50% reduction in area in ‘optimized SIPO architecture’ is achieved on implementing multiplier less design by replacing the wrap around carry addition with XOR multiplexer full adder instead of conventional full adder.
伽罗瓦场傅里叶变换的面积优化实现
傅里叶变换是信号从时域到频域的转换。FFT是DFT的改进版本,与DFT相比,FFT的计算速度更快。在有限域上执行FFT是主要任务。有限场是由有限元素组成的场。在有限域上执行FFT称为伽罗瓦域FFT。在本项目中,针对三种架构,即SIPO(串行输入并行输出)架构,PISO(并行输入串行输出)架构和优化的SIPO架构,实现了无乘法器的伽罗瓦场FFT的方法。可以观察到,通过用XOR多路器全加法器代替传统的全加法器取代环绕进位加法,在“SIPO和PISO架构”中面积减少42%,在“优化SIPO架构”中面积减少50%,实现了无乘法器设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信