A new symbolic substitution based addition algorithm

DOI10.1016/J.CAMWA.2005.06.006MaRDI QIDQ813199zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 31 January 2006

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2005.06.006

zbMATH Keywords

Associative additionCanonical modified signed digitParallel processingSubstitution stepSymbolic substitution

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Symbolic substitution based canonical recoding algorithms
• Carry-free addition of recoded binary signed-digit numbers
• A Nonspeculative Maximally Redundant Signed Digit Adder
• scientific article; zbMATH DE number 2247814
• Parallel addition in non-standard numeration systems

Cites work

• Hybrid signed-digit number systems: a unified framework for redundant number representations with bounded carry propagation chains
• Signed digit addition and related operations with threshold logic

Cited in

(1)

• Symbolic substitution based canonical recoding algorithms

This page was built for publication: A new symbolic substitution based addition algorithm

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