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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shietung PENG, Igor SEDUKHIN, Stanislav SEDUKHIN, "Design of Array Processors for 2-D Discrete Fourier Transform" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 4, pp. 455-465, April 1997, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_4_455/_p
Copy
@ARTICLE{e80-d_4_455,
author={Shietung PENG, Igor SEDUKHIN, Stanislav SEDUKHIN, },
journal={IEICE TRANSACTIONS on Information},
title={Design of Array Processors for 2-D Discrete Fourier Transform},
year={1997},
volume={E80-D},
number={4},
pages={455-465},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Design of Array Processors for 2-D Discrete Fourier Transform
T2 - IEICE TRANSACTIONS on Information
SP - 455
EP - 465
AU - Shietung PENG
AU - Igor SEDUKHIN
AU - Stanislav SEDUKHIN
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1997
AB - 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.
ER -