New Self-Checking Booth Multipliers

DOI10.2478/V10006-008-0029-4MaRDI QIDQ5324516zbMATH OpenOpenAlexFDO

Authors Marc Hunger, Daniel Marienfeld

Publication date 3 August 2009

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/207888

zbMATH Keywords

1-out-of-5 codeBooth multipliercarry-dependent adderself-checking, parity-prediction

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• A Self-Checking Generalized Prediction Checker and Its Use for Built-In Testing
• A Self-Testing Group-Parity Prediction Checker and Its Use for Built-In Testing
• A new algorithm for design of the Booth-based multiplier unit
• Study of combinational self-checking devices with independent and monotonic independent outputs
• Design of maximum-speed self-checking m-out-of-n checkers

Cites work

• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• The Carry-Dependent Sum Adder

Cited in

(3)

• Fine-tuning accuracy using conditional probability of the bottom sign-bit in fixed-width modified booth multiplier
• A general proof for overlapped multiple-bit scanning multiplications
• To Booth or not to Booth

This page was built for publication: New Self-Checking Booth Multipliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5324516)