How to request a generation

1. Determine a design specification in terms of (i) target function, (ii) hardware algorithms, (iii) operand lengths, and (iv) number representation system for operands in Request page. The possible input terms given on the generator are as follows:

   • Input word length: 4-64 bits
   • Number representation system for operands:
     • Unsigned binary
     • 2's complement
   • Two-operand adder
     (Final stage adder in multipliers)
     • Ripple carry adder
     • Carry look-ahead adder
     • Ripple-block carry look-ahead adder
     • Block carry look-ahead adder
     • Ladner-Fischer adder
     • Kogge-Stone adder
     • Brent-Kung adder
     • Han-Carlson adder
     • Conditional sum adder
     • Carry select adder
     • Carry-skip adder
   • Multi-operand adder
     (Partial product accumulator in multipliers)
     • Array
     • Wallace tree
     • Balanced delay tree
     • Overturned-stairs tree
     • Dadda tree
     • (4;2) compressor tree
     • (7,3) counter tree
     • Redundant binary addition tree
   • Partial product generator
     • Simple PPG (without Radix-4 modified Booth recoding)
     • With Radix-4 modified Booth recoding

2. Input the following information and click on the "SUBMIT" button.

   • Name
   • Affiliation
   • E-mail address

   If the submission is successful, REQUEST-ID will be sent to the e-mail address in a few minutes.

3. Input your REQUEST-ID in Download page and confirm your order status.

   It is possible to download your multiplier module after the generation process is finished successfully.