summaryrefslogtreecommitdiff
path: root/eater_cpu/readme.txt
diff options
context:
space:
mode:
authoruvok2026-01-22 20:46:11 +0100
committeruvok2026-01-22 20:46:11 +0100
commite99939491820df300a6179719d807f810e7f1680 (patch)
tree1712d3bd2e92de92a76e7575417aeb600b1871d7 /eater_cpu/readme.txt
parent53a87c78df525068ea0d850676bea2a41fcd7bc5 (diff)
eater: PC inc included, decode on negedgemain
Some cycles can be saved. As previously (wrongly) committed, the PC can be incremented early, but the decoder needs to do this "early", so as now implemented, on the falling clock adge already.
Diffstat (limited to 'eater_cpu/readme.txt')
-rw-r--r--eater_cpu/readme.txt3
1 files changed, 3 insertions, 0 deletions
diff --git a/eater_cpu/readme.txt b/eater_cpu/readme.txt
index e4b28cd..44ae2d2 100644
--- a/eater_cpu/readme.txt
+++ b/eater_cpu/readme.txt
@@ -54,6 +54,9 @@ operation
Yes, I know Ben Eaters computer combines b and c.
See eater_types for details.
+ Actually, it occurred to me you can combine b and c,
+ if you like BE PC, run the decoder on the falling clock edge.
+
2. Decode and execute instruction.
2.I LDA: Load memory into A