Symbolic substitution based canonical recoding algorithms

DOI10.1016/J.CAMWA.2004.05.008MaRDI QIDQ1779586zbMATH OpenOpenAlexFDO

Authors Niranjan Chakravarthy

Publication date 1 June 2005

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

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

zbMATH Keywords

Parallel processingCanonical modified signed digitSubstitution stepCanonical recoding algorithmSymbolic substitution table

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Optimal left-to-right binary signed-digit recoding
• A new symbolic substitution based addition algorithm
• On recoding in arithmetic algorithms
• Carry-free addition of recoded binary signed-digit numbers
• An improved residue-to-binary converter

Cites work

• Optimal left-to-right binary signed-digit recoding

Cited in

(4)

• Modelling of subtractive-additive methods for the transformation of forms of information
• Hamming weight pyramid -- a new insight into canonical signed digit representation and its applications
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• A new symbolic substitution based addition algorithm

This page was built for publication: Symbolic substitution based canonical recoding algorithms

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