Bug 136 - partitioned multiplier needs to be adapted to Dadda algorithm
Summary: partitioned multiplier needs to be adapted to Dadda algorithm
Status: CONFIRMED
Alias: None
Product: Libre-SOC's first SoC
Classification: Unclassified
Component: ALU (including IEEE754 16/32/64-bit FPU) (show other bugs)
Version: unspecified
Hardware: PC Linux
: --- enhancement
Assignee: Luke Kenneth Casson Leighton
URL:
Depends on:
Blocks: 48
  Show dependency treegraph
 
Reported: 2019-08-31 09:28 BST by Luke Kenneth Casson Leighton
Modified: 2020-09-21 17:21 BST (History)
1 user (show)

See Also:
NLnet milestone: NLnet.2019.02
total budget (EUR) for completion of task and all subtasks: 0
budget (EUR) for this task, excluding subtasks' budget: 0
parent task for budget allocation: 48
child tasks for budget allocation:
The table of payments (in EUR) for this task; TOML format:


Attachments

Note You need to log in before you can comment on or make changes to this bug.
Description Luke Kenneth Casson Leighton 2019-08-31 09:28:50 BST
the wallace multiplier produces a 10-stage-long chain at 64-bit.
dadda tree multipliers use less gates.
https://github.com/jorisvr/gen_hdl_multiplier

existing code that needs converting:
https://git.libre-soc.org/?p=ieee754fpu.git;a=blob;f=src/ieee754/part_mul_add/multiply.py;hb=HEAD