The Powder Toy

TPT's first 32-bit processor by china-richway2

china-richway2
china-richway2
71 / 12
30th Aug 2013
2nd Sep 2013
It's perfect up to now! Default program calculates 32 fibonacci sequence and stores in RAM. Just spark Start button, and wait until program terminates to see the value
crayram yeahbutwifi processor 32bit adder memory savesunited interpreter electronics complex

Comments

  • china-richway2
    china-richway2     3rd Sep 2013
    oldmud0: 1.No, I'm making a screen that shows something depending on the program, not only for letters. 2.I'm already using CRAM for registers and memory (NOT display) 3.Yes ALU is slow, but I can't get it any faster. AT LEAST 8 frames for one bitwise operation, or the adder will sometimes faill adding. Also 8 additional frames for check, if not then it will be 'done' and run next command before the adder actually done.
  • jake2468
    jake2468     3rd Sep 2013
    me too!
  • kenzierocks
    kenzierocks     3rd Sep 2013
    Yea...the output I get is 1,1,3,7,15,31,etc...
  • kenzierocks
    kenzierocks     2nd Sep 2013
    Now I got a triangle in the output.... just adding a dot each line.
  • kenzierocks
    kenzierocks     2nd Sep 2013
    I know, but there is only ever a 1 there, nothing more.
  • china-richway2
    china-richway2     2nd Sep 2013
    xetalim: I was busy fixing the bug so did not give credit, thanks
  • xetalim
    xetalim     2nd Sep 2013
    @goopymess:Put the program in the program area, remove the existing program first. @kenzierocks:The output is in the large box next to the program area.
  • Goopymess
    Goopymess     2nd Sep 2013
    where do you put the program?
  • kenzierocks
    kenzierocks     1st Sep 2013
    Am I missing something? It just flashes lights everywhere and nothing happens. Then it stops, and there is no sign of any output any where.
  • oldmud0
    oldmud0     1st Sep 2013
    On the other hand, you could use CRAM for both registers and display. Right now, the slowest part of the processor seems to be the ALU, where (bitwise?) operations can take up to 2 seconds to do.