Carry-free addition of recoded binary signed-digit numbers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2247814
- A Nonspeculative Maximally Redundant Signed Digit Adder
- An improved maximally redundant signed digit adder
- scientific article; zbMATH DE number 3861074
- Hybrid signed-digit number systems: a unified framework for redundant number representations with bounded carry propagation chains
Cited in
(17)- Carryless addition
- Carry propagation in signed digit representations
- Further reducing the redundancy of a notation over a minimally redundant digit set
- Symbolic substitution based canonical recoding algorithms
- A signed binary addition circuit based on an alternative class of addition tables
- On binary signed digit representations of integers
- An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding
- Decimal adjustment of long numbers in constant time
- On recoding in arithmetic algorithms
- scientific article; zbMATH DE number 3861074 (Why is no real title available?)
- A Nonspeculative Maximally Redundant Signed Digit Adder
- Hybrid signed-digit number systems: a unified framework for redundant number representations with bounded carry propagation chains
- Analysis of carries in signed digit expansions
- Design and Implementation of Modified Signed-Digit Adder
- scientific article; zbMATH DE number 2247814 (Why is no real title available?)
- A new symbolic substitution based addition algorithm
- An improved maximally redundant signed digit adder
This page was built for publication: Carry-free addition of recoded binary signed-digit numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809259)
