Student Work
Solving Binary MQs on FPGA
Public DepositedDownloadable Content
open in viewerThe goal of this project was to design a program that would be able to solve a given set of quadratic equations with binary coefficients that would effectively reduce the complexity required to solve the system normally. To achieve this, the system was converted into a matrix, which was then simplified by using a modified version of Gaussian elimination in order to find partial solutions that were then combined into a full solution once tested across the entire system. To verify the calculated solutions, an exhaustive search was also completed to ensure validity.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- E-project-042623-161706
- 105481
- Advisor
- Year
- 2023
- Date created
- 2023-04-26
- Resource type
- Major
- Source
- E-project-042623-161706
- Rights statement
- Last modified
- 2023-06-21
Relations
- In Collection:
Items
Items
Thumbnail | Title | Visibility | Embargo Release Date | Actions |
---|---|---|---|---|
Solving_Binary_Multivariate_Quadratic_Systems_on_FPGAs.pdf | Public | Download |
Permanent link to this page: https://digital.wpi.edu/show/k643b455z