𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Algorithm for Rotating-Frame Zeugmatography

✍ Scribed by C.-N. Chen; D. I. Hoult; V. J. Sank

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
373 KB
Volume
1
Category
Article
ISSN
0740-3194

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

An algorithm, which utilizes a high degree of parallel processing, has been developed for two‐dimensional rotating‐frame zeugmatography so that a picture of 256 X 256 pixels can be generated with a minicomputer system 2 sec after data accumulation. An array processor is employed as a second processor and, the refresh memory of a display unit is used as a fast data storage entity. Approximately half the calculations are carried out in the array processor during the nuclear relaxation period. Data movement to and from the display memory occurs largely during, and in parallel with, the array processing. The sequence can be run at a repetition rate of 35 msec per free induction decay and the algorithm can be implemented in any two‐dimensional experiment of the Fourier transform genre.

πŸ“œ SIMILAR VOLUMES

A Parallel Algorithm for 4Γ—4 DCT
A Parallel Algorithm for 4Γ—4 DCT
✍ J. Jiang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 175 KB

By developing a generalized 1D approach and parallel computing algorithm, this paper presents a parallel algorithm design and hardware implementation for the computation of 4\_4 DCT. This algorithm sorts all the 2D input pixel data into four groups. Each group is then forwarded to a 1D DCT arithmeti

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
✍ Hillel Gazit; John H Reif πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ε½ Ε½ 2 . 1 q β‘€ which can be computed by known algorithms in O log n time with

A Parallel Davidson-Type Algorithm for S
A Parallel Davidson-Type Algorithm for Several Eigenvalues
✍ Leonardo Borges; Suely Oliveira πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 277 KB

In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for

Parallel algorithms for a singularly per
Parallel algorithms for a singularly perturbed parabolic problem
✍ Igor Boglaev πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 372 KB πŸ‘ 2 views

This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms ar