๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Two-Dimensional FFT Algorithm

โœ Scribed by Johnson, Lawrence R.; Jain, Anil K.


Book ID
117930600
Publisher
IEEE
Year
1981
Tongue
English
Weight
837 KB
Volume
PAMI-3
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Efficient Processor Allocation Algori
โœ Injae Hwang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 122 KB

Mesh is one of the most widely used interconnection networks for multiprocessor systems. In this paper, we propose an approach to partition a given mesh into m submeshes which can be allocated to m tasks with grid structures. We adapt twodimensional packing to solve the submesh allocation problem. D

An Efficient FFT Algorithm for Superscal
โœ Chris Basoglu; Woobin Lee; Yongmin Kim ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

Real-Time Imaging 3, 441-453 (1997) applications, including digital video, images, graphics and audio. These new processors employ instruction-level parallelism, which includes the superscalar and very long instruction word (VLIW) computer architectures. Intel Pentium Pro, Hewlett-Packard PA-RISC 80