[HELP] More/less than etc. checker
-
I am developing my CPU.
Can somebody help me how to make "More/Less than"/"equal to" logic checker?
Also, can somebody explain how a TPT buffer works (so I can made it myself)?
-
Ask iamdumb.. Lol
-
>More/Less than/equal to
you want a digital magnitude comparator.
http://en.wikipedia.org/wiki/Comparator
http://en.wikipedia.org/wiki/Digital_comparator
>how a TPT buffer works
depending on what you want the buffer to do it can operate in a number of different ways.
for example a cache writes data to RAM so it can be accessed more than once
a queue usually uses memory that can only be carried forward.
while a stack is the opposite of that, "last in is the first out" design.
http://en.wikipedia.org/wiki/Queue_%28abstract_data_type%29
http://en.wikipedia.org/wiki/Cache_%28computing%29
http://en.wikipedia.org/wiki/Stack_%28data_structure%29 -
G-LinuxorU:
>More/Less than/equal to
you want a digital magnitude comparator.
http://en.wikipedia.org/wiki/Comparator
http://en.wikipedia.org/wiki/Digital_comparator
>how a TPT buffer works
depending on what you want the buffer to do it can operate in a number of different ways.
for example a cache writes data to RAM so it can be accessed more than once
a queue usually uses memory that can only be carried forward.
while a stack is the opposite of that, "last in is the first out" design.
http://en.wikipedia.org/wiki/Queue_%28abstract_data_type%29
http://en.wikipedia.org/wiki/Cache_%28computing%29
http://en.wikipedia.org/wiki/Stack_%28data_structure%29Thank you.
But I still don't understand how arK's Buffer Works (internally)
-
arK's buffer has two components, one that stores bits, clears them, and shifts them forward. and one that carries the data forward unless there is data already in front of it. part of the carry logic is designed so that memory is only "released" out of the buffer when activated. in terms of design, it's a queue.
Edited once by G-LinuxorU. Last: 31st Jul 2014 -
For data to move 'down' in arK's buffer, both switches on the row in question must be on. Notice in the bottom row, the leftmost switch is off, so bits won't move past this point. When there is data on any row, the second-to-leftmost switch turns on. If the rightmost switch is also on, the row moves down 1. When it reaches the bottom, as the rightmost switch isn't on, it doesn't go any further. When the buffer is read, the rightmost switch on the bottom row is turned on, and the row is shifted down, and that's the output. When a row reaches the bottom, it also turns off the leftmost switch of the row just above that, so that future rows will stop at that one.
Why don't you ask @arK to explain it?
As for a more than, equal to or less than checker, Do follow G-LinuxorU's link, but you might have a little trouble implementing reliable logic gates in tpt.
Edited once by iamdumb. Last: 31st Jul 2014 -
G-LinuxorU, and I have each made very reliable AND gates. doperfectwork created a very reliable flipflop. diodes and OR gates are not a problem. NOT's NOR's and NAND's are problematic still from what I have seen. hmmmm......
-
