Advanced search
Start date
Betweenand


Optimizing a Fast Fourier Transform Algorithm Implemented with Integer Arithmetic

Full text
Author(s):
Rodrigues, Matheus Martins ; Bordonalli, Aldario Chrestani
Total Authors: 2
Document type: Journal article
Source: 2023 SBMO/IEEE MTT-S INTERNATIONAL MICROWAVE AND OPTOELECTRONICS CONFERENCE, IMOC; v. N/A, p. 3-pg., 2023-01-01.
Abstract

Digital signal processing fixed-point arithmetic is widely adopted because of its lower execution cost than that of floating-point arithmetic. Since defining the number of bits (NBW) of fixed-points variables and its integer part (NBI) representation can be time consuming, a simulation-based tool for optimizing NBW and NBI is proposed. Its performance is evaluated for the 256-point Radix-2 Fast Fourier Transform algorithm. The results suggest that the evolutionary optimization step for NBW can be skipped when dealing with linear transformation algorithms, reducing the number of simulations required and, therefore, speeding up the tool. (AU)

FAPESP's process: 16/11163-6 - Ultrahigh capacity coherent optical sistems
Grantee:Aldário Chrestani Bordonalli
Support Opportunities: Regular Research Grants
FAPESP's process: 15/24517-8 - Photonics for next generation internet
Grantee:Hugo Enrique Hernández Figueroa
Support Opportunities: Research Projects - Thematic Grants