Show simple item record

dc.contributor.authorMarti Puig, Pere
dc.contributor.authorReig Bolano, Ramon
dc.contributor.authorParisi Baradad, Vicenç
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Electrònica
dc.date.accessioned2011-07-06T10:24:36Z
dc.date.available2011-07-06T10:24:36Z
dc.date.created2009
dc.date.issued2009
dc.identifier.citationMarti, P.; Reig, R.; Parisi, V. Radix-R FFT and IFFT factorizations for parallel implementation. "Advances in soft computing", 2009, vol. 50, p. 152-160.
dc.identifier.issn1615-3871
dc.identifier.urihttp://hdl.handle.net/2117/12876
dc.description.abstractTwo 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.
dc.format.extent9 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Processament del senyal
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshFourier transformations--Data processing
dc.subject.lcshParallel algorithms
dc.titleRadix-R FFT and IFFT factorizations for parallel implementation
dc.typeArticle
dc.subject.lemacFourier, Transformacions de
dc.subject.lemacAlgorismes paral·lels
dc.subject.lemacTractament del senyal -- Matemàtica
dc.subject.lemacTractament del senyal -- Tècniques digitals
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. AHA - Arquitectures Hardware Avançades
dc.identifier.doi10.1007/978-3-540-85863-8_19
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.springerlink.com/content/88250nln708t1322/
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac5797618
dc.description.versionPostprint (published version)
local.citation.authorMarti, P.; Reig, R.; Parisi, V.
local.citation.publicationNameAdvances in soft computing
local.citation.volume50
local.citation.startingPage152
local.citation.endingPage160


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder