Fast prefix adders for non-uniform input arrival times (Q513308): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Faster optimal parallel prefix sums and list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The delay of circuits whose inputs have specified arrival times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Delay optimization of linear depth Boolean circuits with prescribed input arrival times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the cost of optimal alphabetic code trees with unequal letter costs / rank | |||
Normal rank | |||
Revision as of 12:07, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast prefix adders for non-uniform input arrival times |
scientific article |
Statements
Fast prefix adders for non-uniform input arrival times (English)
0 references
6 March 2017
0 references
circuit
0 references
delay
0 references
parallel prefix problem
0 references
addition
0 references
prefix adder
0 references
non-uniform input arrival times
0 references
0 references
0 references
