09-10-2017, 03:47 PM
(This post was last modified: 09-13-2017, 04:57 PM by minestyler007.)
Hey guys,
I just finished a project I was working onfor quite some time now and it may be a possible way to do mass storage (even 16kB if I'm guessing correctly here).
first of all here are some pictures with 64 bytes of storage and decoders already attached.
The stairlike things are the memory cells and everything to the side of it are decoders. It consists of memory cells and cell stacks. Each cell stack is made up of memory cells and can be expanded indefinitely. These cell stacks can be stacked next to each other every 6 blocks. You could also make more than one layer of this.
Now there are a few different ways to set this up but they do change how much storage you can have.
-The easiest setup is just like ram (but really slow ram) where you just enter your data and the place you want to store it. That would half the number of bytes that are bossible to store but you don't have to worry about timing as much and it probably lags less.
-But you can also store 2 hex values in one cell which would allow for the 64 I mentioned. You need to worry more about timing and maybe there will be more lag because the signal is constantly sent in a circle. I tried very long to store 4 hex values in one cell but it didn't work out yet - theoretically you could do it which would make the memory in the pictures be able to store 128 bytes.
-if you take binary as inputs you can even speed up the access time for large numbers but you would further increase the lag because you need many bin2hex decoders.
If we ignore lag we can achieve reasonable access times with very high storage capacity.
Access times and storage of this relation can be achieved: accesstime = sqrt(bytes*2) + constant (max 30 ticks) so for 2^13 bytes we would have an access time of sqrt((2^13)*2)+constant = 128 + constant
one cell is 6*8*1 = 48 blocks per byte or 24 blocks per hex value. Which also makes it one of the smallest memories ever.
I think this might be a possible setup for the MMM
I just finished a project I was working onfor quite some time now and it may be a possible way to do mass storage (even 16kB if I'm guessing correctly here).
first of all here are some pictures with 64 bytes of storage and decoders already attached.
The stairlike things are the memory cells and everything to the side of it are decoders. It consists of memory cells and cell stacks. Each cell stack is made up of memory cells and can be expanded indefinitely. These cell stacks can be stacked next to each other every 6 blocks. You could also make more than one layer of this.
Now there are a few different ways to set this up but they do change how much storage you can have.
-The easiest setup is just like ram (but really slow ram) where you just enter your data and the place you want to store it. That would half the number of bytes that are bossible to store but you don't have to worry about timing as much and it probably lags less.
-But you can also store 2 hex values in one cell which would allow for the 64 I mentioned. You need to worry more about timing and maybe there will be more lag because the signal is constantly sent in a circle. I tried very long to store 4 hex values in one cell but it didn't work out yet - theoretically you could do it which would make the memory in the pictures be able to store 128 bytes.
-if you take binary as inputs you can even speed up the access time for large numbers but you would further increase the lag because you need many bin2hex decoders.
If we ignore lag we can achieve reasonable access times with very high storage capacity.
Access times and storage of this relation can be achieved: accesstime = sqrt(bytes*2) + constant (max 30 ticks) so for 2^13 bytes we would have an access time of sqrt((2^13)*2)+constant = 128 + constant
one cell is 6*8*1 = 48 blocks per byte or 24 blocks per hex value. Which also makes it one of the smallest memories ever.
I think this might be a possible setup for the MMM