Far path for fpu adder/subtractor #768
Open
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
Durchbruchswagen
force-pushed
the
long_path
branch
from
a1784e5 to
2266234
Compare
tilk
approved these changes
Jan 29, 2025
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.
Implementation of far path for fpu adder/subtractor based on:
http://i.stanford.edu/pub/cstr/reports/csl/tr/90/442/CSL-TR-90-442.pdf.
Aditional explanations to some of the parts of the other paper. Some of the parts of were either murky or unclear and I had to make slight adjustments to the formulas from the original. The final formulas are in here. The important parts of this paper are 'Round to nearest ties to even' and 'Problem with addition'
https://drive.google.com/drive/folders/1cAIiRlE2wTmj55T8TiOPaKO80eLnMEfq?usp=sharing