A VLSI implementation of parallel fast Fourier transform - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

A VLSI implementation of parallel fast Fourier transform

Résumé

This paper presents the design of a VLSI circuit to perform the Fourier transform using on-line most-significant-digit-first arithmetic. First, the principles of the pipelined fast Fourier transform are recalled, and a folded pipeline is introduced. Then on-line operators and operator merging rules are used to design a cost effective butterfly operator. Finally a circuit with 8 butterflies is described and compared to other realizations.
Fichier non déposé

Dates et versions

hal-00014947 , version 1 (30-11-2005)

Identifiants

Citer

A. Vacher, M. Benkhebbab, A. Guyot, T. Rousseau, A. Skaf. A VLSI implementation of parallel fast Fourier transform. Proceedings.-The-European-Design-and-Test-Conference.-EDAC,-The-European-Conference-on-Design-Automation.-ETC-European-Test-Conference.-EUROASIC,-The-European-Event-in-ASIC-Design-Cat.-No.94TH0634-6., 1994, Paris, France. pp.250-5, ⟨10.1109/EDTC.1994.326869⟩. ⟨hal-00014947⟩

Collections

UGA CNRS TIMA
48 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More