Design of Array Processors for 2-D Discrete Fourier Transform (Special Issue on Parallel and Distributed Supercomputing)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper the design of systolic array processors for computing 2-dimensional Discrete Fourier Transform (2-D DFT) is considered. We investigated three different computational schemes for designing systolic array processors using systematic approach. The systematic approach guarantees to find optimal systolic array processors from a large solution space in terms of the number of processing elements and I/O channels, the processing time, topology, pipeline period, etc. The optimal systolic array processors are scalable, modular and suitable for VLSI implementation. An application of the designed systolic array processors to the prime-factor DFT is also presented.
- 社団法人電子情報通信学会の論文
- 1997-04-25
著者
-
Peng Shietung
Department Of Computer Software Distributed Parallel Processing Laboratory The University Of Aizu
-
Sedukhin S
Univ. Aizu Aizu‐wakamatsu‐shi Jpn
-
Sedukhin Stanislav
Department Of Information Systems The University Of Aizu
-
SEDUKHIN Igor
R&D Group, Hiwada Electronic Corporation (Pioneer Group)
-
Sedukhin Igor
R&d Group Hiwada Electronic Corporation (pioneer Group)
-
SEDUKHIN Stanislav
Department of Computer Software, Distributed Parallel Processing Laboratory, The University of Aizu
関連論文
- Efficient algorithms for Disjoint Paths in Hypercubes and Star Networks
- Efficient Algorithms for Node Disjoint Path Problems
- Set-To-Set Fault Tolerant Routing in Hypercubes (Special Section on Discrete Mathematics and Its Applications)
- d-Separated Paths in Hypercubes and Star Graphs
- Level-3 BLAS and LU Factorization on a Matrix Processor(Numerical Computation)
- Design of Array Processors for 2-D Discrete Fourier Transform (Special Issue on Parallel and Distributed Supercomputing)
- 広域MPI用の局所性を考慮した接続管理とランク割当て(グリッド)
- Fault Tolerant Routing in Toroidal Networks (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing)
- Set-To-Set Fault Tolerant Routing in Star Graphs
- Efficient Broadcasting Algorithms in Faulty Hypercubes and Star Graphs
- Node-to-Set Disjoint Paths with Optimal Length in Star Graphs (Special Issue on Parallel and Distributed Supercomputing)
- Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs
- Level-3 BLAS and LU Factorization on a Matrix Processor
- Level-3 BLAS and LU Factorization on a Matrix Processor