[<<][compsci][>>][..]
Fri Sep 23 15:31:29 EDT 2011

Minimal erase binary counter for Flash memory

Problem with Flash memory: 0->1 is costly and needs to happen in bulk,
while 1->0 is free.

How to implement a counter in Flash that has a good tradeoff between
few erase cycles, and little redundancy.

- Full redundancy: one bit per increment, no erase.
- No redundancy: erase on every increment.

Something in the middle could be a XOR mask and a setting one bit per
time, based on something like a gray code.





[Reply][About]
[<<][compsci][>>][..]