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.