Busca avançada
Ano de início
Entree


Optimizing a Fast Fourier Transform Algorithm Implemented with Integer Arithmetic

Texto completo
Autor(es):
Rodrigues, Matheus Martins ; Bordonalli, Aldario Chrestani
Número total de Autores: 2
Tipo de documento: Artigo Científico
Fonte: 2023 SBMO/IEEE MTT-S INTERNATIONAL MICROWAVE AND OPTOELECTRONICS CONFERENCE, IMOC; v. N/A, p. 3-pg., 2023-01-01.
Resumo

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)

Processo FAPESP: 16/11163-6 - Sistemas ópticos coerentes de altíssima capacidade
Beneficiário:Aldário Chrestani Bordonalli
Modalidade de apoio: Auxílio à Pesquisa - Regular
Processo FAPESP: 15/24517-8 - Fotônica para internet de nova geração
Beneficiário:Hugo Enrique Hernández Figueroa
Modalidade de apoio: Auxílio à Pesquisa - Temático