Journal article
Fast Fourier transforms over finite groups by multiprocessor systems
IEEE transactions on acoustics, speech, and signal processing, v 38(2), pp 226-240
Feb 1990
Abstract
The authors present a method for an optimal implementation of general discrete Fourier transform (GDFT) algorithms over finite groups (Abelian and non-Abelian) in a multiprocessor environment. Tradeoffs between hardware complexity/speed and computation time are investigated for different multiprocessor implementations with local nonshared memories (unibus, complete communication network). Formulas are presented for the number of arithmetic operations, for the number of interprocessor data transfers, and for the number of communication links among the processors.< >
Metrics
Details
- Title
- Fast Fourier transforms over finite groups by multiprocessor systems
- Creators
- T.D Roziner - Boston UniversityM.G Karpovsky - Boston UniversityL.A Trachtenberg
- Publication Details
- IEEE transactions on acoustics, speech, and signal processing, v 38(2), pp 226-240
- Publisher
- IEEE
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- [Retired Faculty]
- Web of Science ID
- WOS:A1990CQ18400003
- Scopus ID
- 2-s2.0-0025385766
- Other Identifier
- 991019174204004721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Acoustics
- Engineering, Electrical & Electronic