Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data

Martí i Puig, Pere

Inici
→
Recerca
→
Articles, congressos, llibres
→
Documents de Congressos
→
Visualitza el document

dc.contributor	Universitat de Vic. Escola Politècnica Superior
dc.contributor	Universitat de Vic. Grup de Recerca en Tecnologies Digitals
dc.contributor.author	Martí i Puig, Pere
dc.date.accessioned	2014-05-21T10:40:38Z
dc.date.available	2014-05-21T10:40:38Z
dc.date.created	2009
dc.date.issued	2009
dc.identifier.citation	Martí-Puig, P. (2009). Two families of radix-2 FFT algorithms with ordered input and output data. IEEE Signal Processing Letters, 16(1-3), 65-68. doi:10.1109/LSP.2008.2003993	ca_ES
dc.identifier.issn	1070-9908
dc.identifier.uri	http://hdl.handle.net/10854/3063
dc.description.abstract	Two radix-2 families of fast Fourier transform (FFT) algorithms that have the property that both inputs and outputs are addressed in natural order are derived in this letter. The algorithms obtained have the same complexity that Cooley–Tukey radix-2 algorithms but avoid the bit-reversal ordering applied to the input. These algorithms can be thought as a variation of the radix-2 Cooley–Tukey ones.	ca_ES
dc.format	application/pdf
dc.format.extent	4 p.	ca_ES
dc.language.iso	eng	ca_ES
dc.publisher	IEEE	ca_ES
dc.rights	(c) IEEE
dc.rights	Tots els drets reservats	ca_ES
dc.subject.other	Algorismes	ca_ES
dc.subject.other	Fourier, Transformacions de	ca_ES
dc.title	Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data	ca_ES
dc.type	info:eu-repo/semantics/conferenceObject	ca_ES
dc.identifier.doi	https://doi.org/10.1109/LSP.2008.2003993
dc.relation.publisherversion	http://ieeexplore.ieee.org/
dc.rights.accessRights	info:eu-repo/semantics/closedAccess	ca_ES