http://iet.metastore.ingenta.com
1887

Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic

Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Circuits, Devices & Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Redundant representations play an important role in high-speed computer arithmetic. One key reason is that such representations support carry-free addition, that is, addition in a small, constant time, independent of operand widths. The implications of stored-transfer representation of digit sets and the associated addition schemes, as an extension of the stored-carry concept to redundant number systems, on the speed and cost of arithmetic algorithms, are explored. Two's-complement digits as the main part and any two-valued digit (twit) in place of a stored carry are allowed, leading to further broadening of the generalised signed-digit representations. The characteristics of the digit sets, possibly not having zero as a member, that allow for most efficient carry-free addition, are investigated. Circuit speed is gained from storing or saving, instead of combining through addition, the interdigit transfers generated during the carry-free addition process. Encoding efficiency is gained from using a twit-transfer set encoded by one logical bit, where more bits would otherwise be needed to represent a transfer value.

References

    1. 1)
      • B. Parhami . (2000) Computer arithmetic: algorithms and hardware designs.
    2. 2)
      • G. Metze , J.E. Robertson . Elimination of carry propagation in digital computers. Proc. Int. Conf. on Information Processing, Paris , 389 - 396
    3. 3)
      • A. Avizienis . Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. , 389 - 400
    4. 4)
      • H. Edamatsu , T. Taniguchi , T. Nishiyama , S. Kuninobu . A 33 MFLOPS floating point processor using redundant binary representation. Digest of IEEE Int. Conf. on Solid-State Circuits
    5. 5)
      • W. Balakrishnan , N. Burgess . Very-high-speed VLSI 2s-complement multiplier using signed binary digits. IEE Proc. E, Comput. Digit. Tech. , 29 - 34
    6. 6)
      • H. Fahmy , M.J. Flynn . The case for a redundant format in floating-point arithmetic. Proc. 16th IEEE Symp. on Computer Arithmetic , 95 - 102
    7. 7)
      • D.E. Atkins . An introduction to the role of redundancy in computer arithmetic. Computer , 6 , 74 - 76
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • N. Takagi , H. Yasuura , S. Yajima . High-speed VLSI multiplication algorithm with a redundant binary addition tree. IEEE Trans. Comput. , 9 , 789 - 796
    12. 12)
    13. 13)
    14. 14)
      • G. Jaberipur , M. Ghodsi . High radix signed digit number systems: representation paradigms. Sci. Iranica , 4 , 383 - 391
    15. 15)
      • G. Jaberipur , B. Parhami , M. Ghodsi . Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems. IEEE Trans. Circuits Syst. I , 7 , 1348 - 1357
    16. 16)
      • G. Jaberipur , B. Parhami , M. Ghodsi . A class of stored-transfer representations for redundant number systems. Proc. 35th Asilomar Conf. on Signals Systems and Computers , 1304 - 1308
    17. 17)
    18. 18)
      • H. Kobayashi . A multioperand two's complement addition algorithm. Proc. 7th IEEE Symp. on Computer Arithmetic , 16 - 19
    19. 19)
    20. 20)
      • M.J. Flynn , S.F. Oberman . (2001) Advanced computer arithmetic design.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds_20050228
Loading

Related content

content/journals/10.1049/iet-cds_20050228
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address