Tree component #155
Open
Tree component #155
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
mkorbel1
reviewed
Jan 21, 2025
| /// the tree is: depth + flopDepth * depthToflop; | ||
| int get depth => _computed.depth; | ||
|
|
||
| /// The flop depth of the tree from the output to the leaves. |
There was a problem hiding this comment.
Is this equal to the latency in cycles?
| /// needed in the tree, otherwise use zero-extension (default). | ||
| /// | ||
| /// Optional parameters to be used for creating a pipelined computation tree: | ||
| /// - [clk], [reset], [enable] are optionally provided to allow for flopping. |
There was a problem hiding this comment.
is the enable like a stall?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description & Motivation
This adds a ReductionTree component which performs arbitrary radix tree reduction computation, including operand widening,
sign extension as specified, and works on arbitrary length input sequences using computation specified by a List-based functor.
Related Issue(s)
#94 Tree component.
Testing
Tests are provided for unpipelined, pipelined, radix2 and radix4 additions using native and prefix-tree adders with widening.
Backwards-compatibility
No.
Documentation
Yes, a reduction_tree markdown with code example is provided.