summaryrefslogtreecommitdiffstats
path: root/content/zettel/5b2.md
blob: 71427946d1f2ba279ae3af695564382242be5e96 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
+++
title = "Multipliers"
date = "2022-11-08"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["5b1"]
forwardlinks = ["5b1", "5b3"]
zettelid = "5b2"
+++

Multipliers are implemented in terms of adders. For example, one way of
implementing multiplication would just be to perform multiple additions.
This could be a long-multiplication algorithm, where the digits are
multiplied together, and then shifted and added together. By default, if
one uses a naïve addition algorithm, then this will be a very sequential
algorithm. The first improvement would be to implement a tree of
additions, which reduces the dependencies and delays between the adders.
The second improvement could be to use more parallel adder algorithms,
like described in the adder circuit section ([\#5b1]).

  [\#5b1]: /zettel/5b1