NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Bit-parallel arithmetic in a massively-parallel associative processorA simple but powerful new architecture based on a classical associative processor model is presented. Algorithms for performing the four basic arithmetic operations both for integer and floating point operands are described. For m-bit operands, the proposed architecture makes it possible to execute complex operations in O(m) cycles as opposed to O(m exp 2) for bit-serial machines. A word-parallel, bit-parallel, massively-parallel computing system can be constructed using this architecture with VLSI technology. The operation of this system is demonstrated for the fast Fourier transform and matrix multiplication.
Document ID
19930033375
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Scherson, Isaac D.
(California Univ. Irvine, United States)
Kramer, David A.
(NASA Goddard Space Flight Center Greenbelt, MD, United States)
Alleyne, Brian D.
(Princeton Univ. NJ, United States)
Date Acquired
August 15, 2013
Publication Date
October 1, 1992
Publication Information
Publication: IEEE Transactions on Computers
Volume: 41
Issue: 10
ISSN: 0018-9340
Subject Category
Computer Programming And Software
Accession Number
93A17372
Funding Number(s)
CONTRACT_GRANT: NAG5-1334
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available