The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1984 vol.33)
pp: 7-20
Henk J. Sips , Department of Applied Physics, Deift University of Technology, Lorentzweg 1 2628CJ Deift, Holland.
ABSTRACT
A bit-sequential processing element with O(n) complexity is described, where n is the wordlength of the operands. The operations performed by the element are A * B + C * D, A/B, and ¿A. The operands are fixed point or floating point numbers with variable precision. The concept of semi-on-line algorithms is introduced. A processing element that uses semi-on-line algorithms produces a result ¿ clock cycles after the absorption of the n-bit operands, where ¿ is small compared to n. In the paper the processing element and the algorithms are described. A performance comparison between the bit-sequential processing element and conventional pipelined arithmetic units is given.
CITATION
Henk J. Sips, "Bit-Sequential Arithmetic for Parallel Processors", IEEE Transactions on Computers, vol.33, no. 1, pp. 7-20, January 1984, doi:10.1109/TC.1984.5009311
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool