| commit | 7262f3b845414270030a92284572949a477e61f0 | [log] [tgz] |
|---|---|---|
| author | Jeff DiCorpo <jeffdi@efabless.com> | Wed Dec 29 02:59:05 2021 -0800 |
| committer | Jeff DiCorpo <jeffdi@efabless.com> | Wed Dec 29 02:59:05 2021 -0800 |
| tree | 2148fc23c602887d1f2e6a6116e1369b39c251e7 | |
| parent | 62d53ed6fd136156c72ba8ec09a36d7fbdfdcefd [diff] |
final gds oasis
This project contains a two sudoku accelerator modules on a wishbone bus.
Each solver module is capable of performing both a simple ‘only candidate’ method, as well as finding row-only ‘naked singles’.
A single ‘only candidate’ pass on the whole puzzle completes in 23 cycles, and a ‘naked singles’ pass completes in 108 cycles.
The solver will exit early during a run if the puzzle becomes solved, or if a single cell ends up with no remaining valid values (do note that this doesn't mean the solver can detect all illegal puzzles).
This design also contains a modified FIFO-enabled version of simpleuart (from caravel) to make external communication easier.
