NASA NTRS · 19930033375
Bit-parallel arithmetic in a massively-parallel associative processor
Abstract
A 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.
Keep this discovery
Explore connections, maps & timelines
Scherson, Isaac D., Kramer, David A., Alleyne, Brian D.. 1992-10-01. Bit-parallel arithmetic in a massively-parallel associative processor. https://engineeringpapers.com/record/nasa%3A19930033375/bit-parallel-arithmetic-in-a-massively-parallel-associative-processor
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.