By Topic

Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Irving T. Ho ; IBM Systems Products Division, Hopewell Junction, N.Y. 12533. ; Tien Chi Chen

In multioperand additions p summands can be compressed into q summands by adding along the columns independently. For a given column Z with Boolean elements {zi}, this sum is ¿rk2k, where rk equals a residue threshold function R(2k, 2k+1 |Z), defined by the proposition R(t, m |Z) ¿ t ¿ (¿zi) mod m. The hardware realization is particularly simple using symmetry-adapted READ-ONLY storage (ROS) array logic.

Published in:

IEEE Transactions on Computers  (Volume:C-22 ,  Issue: 8 )