✦ LIBER ✦

Computation algorithm and architecture of a superfast FFT processor

✍ Scribed by V. F. Kravchenko; A. S. Gorshkov

Publisher: Springer US
Year: 1992
Tongue: English
Weight: 410 KB
Volume: 35
Category: Article
ISSN: 0543-1972
DOI: 10.1007/bf00977871

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient FFT Algorithm for Superscal

An Efficient FFT Algorithm for Superscalar and VLIW Processor Architectures

✍ 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

Design and Evaluation of a Photonic FFT

Design and Evaluation of a Photonic FFT Processor

✍ Richard G. Rozier; Fouad E. Kiamilev; Ashok V. Krishnamoorthy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We describe the design of a high-performance chipset for computing 1-D complex fast Fourier transforms (FFT). Our chip technology is based on flip-chip integration of submicrometer CMOS ICs with GaAs chips containing 2-D arrays of multiple-quantum wells (MQW) diode optical receivers and transmitters

A parallel architecture and algorithms f

A parallel architecture and algorithms for optical computing

✍ Ahmed Louri 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Embedding of a real time image stabiliza

Embedding of a real time image stabilization algorithm on a parameterizable SoPC architecture a chip multi-processor approach

✍ Lionel Damez; Loic Sieler; Alexis Landrault; Jean Pierre Dérutin 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 447 KB

A 400 MFLOPS FFT processor VLSI architec

A 400 MFLOPS FFT processor VLSI architecture: Miyanaga, H and Yamauchi, HIEICE Trans. Vol E74 No 11 (November 1991) pp 3845–3851

📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 112 KB

A new FFT-based algorithm to compute Bor

A new FFT-based algorithm to compute Born radii in the generalized Born theory of biomolecule solvation

✍ Wei Cai; Zhenli Xu; Andrij Baumketner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 517 KB

In this paper, a new method for calculating effective atomic radii within the generalized Born (GB) model of implicit solvation is proposed, for use in computer simulations of biomolecules. First, a new formulation for the GB radii is developed, in which smooth kernels are used to eliminate the dive