By Topic

Concurrent error detection in array multipliers by BIDO

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
$31 $31
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

3 Author(s)
Chen, T.-H. ; Dept. of Electron. Eng., Naitai Coll., Tainan, Taiwan ; Lee, Y.-P. ; Chen, L.G.

Array multipliers consist of full adders (FAs). When the sums and carrys are propagated down through the array, each row of FAs is used only once. Most FAs are doing no useful work at any given time. The authors design a concurrent error-detectable array multiplier using bidirectional operation (BIDO). The BIDO implementation employs the inherent idle FAs in an array multiplier to perform the repeated operation. As a result, both normal and repeated operations are performed in one single set of hardware simultaneously. The experimental results show that the BIDO implementation has the following significant benefits: (i) It has a moderate hardware overhead, but little performance degradation and (ii) The time and hardware overheads are constant for detecting both single and multiple faults

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:142 ,  Issue: 6 )