Engineering Papers⌕ Search
Home/Archive/NASA NTRS

NASA NTRS · 20210004654

Massively Parallel Neurocomputing for Aerospace Applications

Toomarian, N.·Barhen, J.·Fijany, A.
View original source ↗Export metadata ↓

Abstract

An innovative hybrid, analog-digital charge-domain technology, for the massively parallel VLSI implementation of certain large scale matrix-vector operations, has recently been introduced. It employs arrays of Charge Coupled/Charge Injection Device cells holding an analog matrix of charge, which process digital vectors in parallel by means of binary, non-destructive charge transfer operations. The impact of this technology on massively parallel processing is discussed.

Explore related subjects

massivelyparallelneurocomputingprocessingmatrix-vectoroperations

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Toomarian, N., Barhen, J., Fijany, A.. 1993-10-19. Massively Parallel Neurocomputing for Aerospace Applications. https://ntrs.nasa.gov/citations/20210004654

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

NASA NTRS1994

Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.

massively↗