## Abstract

This paper presents an algorithm-level interpretation of fast adder structures in binary/multiple-valued logic. The key idea is to employ a unified representation of addition algorithms called Counter Tree Diagrams (CTDs). The use of CTDs makes it possible to describe and analyze addition algorithms at various levels of abstraction. A high-level CTD represents a network of coarse-grained components associated with multiple-valued logic devices, while a low-level CTD represents a network of primitive components directly mapped onto binary logic devices. The level of abstraction in circuit representation can be changed by decomposition of CTDs. We can derive possible variations of adder structures by decomposing a high-level CTD into low-level CTDs. This paper demonstrates the interpretation of redundant arithmetic adders based on CTDs. We first introduce an extension of CTDs to represent possible redundant arithmetic adders with limited carry propagation. Using the extended version of CTDs, we can classify the conventional adder structures including those using emerging devices into three types in a systematic way.

Original language | English |
---|---|

Pages (from-to) | 1645-1654 |

Number of pages | 10 |

Journal | IEICE Transactions on Electronics |

Volume | E89-C |

Issue number | 11 |

DOIs | |

Publication status | Published - 2006 Nov |

## Keywords

- Addition algorithms
- Arithmetic circuits
- Datapaths
- Multiple-valued logic
- Number systems