Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Concurrent-error detection in high-speed carry-free dividers

Concurrent-error detection in high-speed carry-free dividers

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Rapid advancements in technology demand innovative computation algorithms and hardware structures to achieve high performance. High-speed dividers are commonly designed using SRT division methods. Recently, a high-speed carry-free divider design using redundant binary representation has been presented. Based on the carry-free division algorithm and a more general cell-fault model instead of stuck-at fault model, the paper presents a concurrent error detection scheme using alternating input data. The key to the detection of faults is determining that at least one input combination exists for which the error does not result in alternating outputs. Results show that, with a low hardware overhead, the divider circuit is capable of detecting single/multiple transient faults in one cell during the real-time operation and enhancing its reliability significantly.

http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19941377
Loading

Related content

content/journals/10.1049/ip-cdt_19941377
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address