The Community for Technology Leaders
Green Image
Issue No. 09 - September (1980 vol. 29)
ISSN: 0018-9340
pp: 841-844
A.P. Reeves , School of Electrical Engineering, Purdue University
Parallel processors with bit-serial processing elements (PE's) usually implement arithmetic functions by a sequence of word-level arithmetic operations; however, basic operations must be specified at the bit level. In this correspondence the possibility of more efficiently implementing a function with a special tailored sequence of bit-serial operations is considered. A general scheme is described for generating efficient programs to implement arbitrary functions on bit-serial-arithmetic processors. This scheme is based on logic design methodology and involves designing a logic network to realize a desired function. The parallel processor is then used to efficiently simulate a set of these networks. Heuristic design algorithms are used to generate the logic networks; several algorithms are described and compared with some benchmark functions. Several efficient PE designs are described and analyzed.
universal logic modules, Binary array processing, bit-serial arithmetic, logic design algorithms, parallel processing, Reed-Muller canonic form, two-input gate networks

J. Bruner and A. Reeves, "Efficient Function Implementation for Bit-Serial Parallel Processors," in IEEE Transactions on Computers, vol. 29, no. , pp. 841-844, 1980.
87 ms
(Ver 3.3 (11022016))