Abstract
In the above-naed article [ibid., vol. 7, no. 4, pp. 450¿462, Dec. 1999], the author has presented a multiplexer-based carry-select modified tree (CSMT) adder design. It was correctly pointed out in Section VI that these multiplexer-based adders are not just limited to redundant-to-binary-conversion- based adders, but can also be used in the context of carry-save binary adders. However, the carry-update recursion, based on p and g signals, given by [1, eq. (9)] cannot be used to exploit the CSMT adder principles in the above-named article. Here p and g, respectively, represent carry-propagate and carry-generate signals. This letter presents the correct carry-update recursion.
| Original language | English (US) |
|---|---|
| Article number | 6175991 |
| Pages (from-to) | 791 |
| Number of pages | 1 |
| Journal | IEEE Transactions on Very Large Scale Integration (VLSI) Systems |
| Volume | 21 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2013 |
Fingerprint
Dive into the research topics of 'Comments on Low-energy CSMT carry generators and binary adders'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS