DSpace Repository

Radix-R FFT and IFFT factorizations for parallel implementation

Show simple item record

dc.contributor Universitat de Vic. Grup de Recerca en Tecnologies Digitals
dc.contributor Universitat de Vic. Escola Politècnica Superior
dc.contributor.author Martí i Puig, Pere
dc.contributor.author Reig Bolaño, Ramon
dc.contributor.author Parisi Baradad, Vicenç
dc.date.accessioned 2012-12-03T13:11:48Z
dc.date.available 2012-12-03T13:11:48Z
dc.date.created 2009
dc.date.issued 2009
dc.identifier.citation Martí, P. ; Reig, R. ; Parisi, V. "Radix R- FFT and IFFT factorizations for parallel implementation". Advances in soft computing, 2009, vol. 50, p. 152-160 ca_ES
dc.identifier.issn 1615-3871
dc.identifier.uri http://hdl.handle.net/10854/1940
dc.description.abstract Two radix-R regular interconnection pattern families of factorizations for both the FFT and the IFFT -also known as parallel or Pease factorizations- are reformulated and presented. Number R is any power of 2 and N, the size of the transform, any power of R. The first radix-2 parallel FFT algorithm -one of the two known radix-2 topologies- was proposed by Pease. Other authors extended the Pease parallel algorithm to different radix and other particular solutions were also reported. The presented families of factorizations for both the FFT and the IFFT are derived from the well-known Cooley-Tukey factorizations, first, for the radix-2 case, and then, for the general radix-R case. Here we present the complete set of parallel algorithms, that is, algorithms with equal interconnection pattern stage-to-stage topology. In this paper the parallel factorizations are derived by using a unified notation based on the use of the Kronecker product and the even-odd permutation matrix to form the rest of permutation matrices. The radix-R generalization is done in a very simple way. It is shown that, both FFT and IFFT share interconnection pattern solutions. This view tries to contribute to the knowledge of fast parallel algorithms for the case of FFT and IFFT but it can be easily applied to other discrete transforms. ca_ES
dc.format application/pdf
dc.format.extent 5 p. ca_ES
dc.language.iso eng ca_ES
dc.publisher Springer ca_ES
dc.rights Tots els drets reservats ca_ES
dc.rights (c) Springer (The original publication is available at www.springerlink.com)
dc.subject.other Algorismes ca_ES
dc.subject.other Fourier, Transformacions de ca_ES
dc.title Radix-R FFT and IFFT factorizations for parallel implementation ca_ES
dc.type info:eu-repo/semantics/article ca_ES
dc.identifier.doi https://doi.org/10.1007/978-3-540-85863-8_19
dc.relation.publisherversion http://link.springer.com/chapter/10.1007%2F978-3-540-85863-8_19
dc.rights.accesRights info:eu-repo/semantics/closedAccess ca_ES
dc.type.version info:eu-repo/publishedVersion ca_ES

Files in this item

Show simple item record

Search RIUVic


Browse

Statistics