A counter is provided which can be implemented in flash memory allowing longer life through fewer erasures. The counter is incremented using a method that minimizes bit transitions from 1 to 0. In one embodiment, the counter is implemented in m+n bits. The bits of the counter are grouped into a bina
A counter is provided which can be implemented in flash memory allowing longer life through fewer erasures. The counter is incremented using a method that minimizes bit transitions from 1 to 0. In one embodiment, the counter is implemented in m+n bits. The bits of the counter are grouped into a binary portion of the counter of m bits and a unary portion of the counter of n bits. In order to increment the counter, the unary portion of the counter is incremented first. When the unary portion of the counter reaches a specific value, the binary portion of the counter is incremented. This limits 1 to 0 bit transitions and allows a large range of unique values to be read from the counter. In another embodiment, two unary counters are formed, which dynamically change in size as the counter is incremented.
대표청구항▼
What is claimed is: 1. A method of implementing a counter, where the bits of said counter are dynamically divided into subsets, comprising a first subset of bits storing a first value and a second subset of bits storing a second value, and where an increment method minimizes bit transitions from on
What is claimed is: 1. A method of implementing a counter, where the bits of said counter are dynamically divided into subsets, comprising a first subset of bits storing a first value and a second subset of bits storing a second value, and where an increment method minimizes bit transitions from one to zero, said method comprising: receiving a request to increment said counter; incrementing said first value according to said increment method in response to said receipt of said increment request; adding a bit to said second subset of bits, reducing the size of said first subset of bits by at least one bit, and incrementing said second value according to said increment method when said first value is equal to a specified value. 2. The method of claim 1, where said increment method is unary increment. 3. The method of claim 1, where said counter is implemented in flash memory. 4. The method of claim 1, where said specified value is equal to zero. 5. A computer device for implementing a counter, where an increment method minimizes bit transitions from one to zero, said device comprising: a counter comprising bits dynamically divided into subsets, comprising a first subset of bits storing a first value and a second subset of bits storing a second value; a first counter incrementer that increments said first value according to said increment method in response to said receipt of an increment request; a second counter incrementer that adds a bit to said second subset of bits, reduces the size of said first subset of bits by at least one bit, and increments said second value according to said increment method when said first value is equal to a specified value. 6. The method of claim 5, where said increment method is unary increment. 7. The method of claim 5, where said counter is implemented in flash memory. 8. The method of claim 5, where said specified value is equal to zero. 9. A computer-readable medium comprising computer-executable modules having computer-executable instructions for implementing a counter, where said counter comprises bits dynamically divided into subsets, comprising a first subset of bits storing a first value and a second subset of bits storing a second value, and where an increment method minimizes bit transitions from one to zero, said modules comprising: a module for receiving a request to increment said counter; a module for incrementing said first value according to said increment method in response to said receipt of an increment request; a module for adding a bit to said second subset of bits, reducing the size of said first subset of bits by at least one bit, and incrementing said second value according to said increment method when said first value is equal to a specified value. 10. The computer-readable medium of claim 9, where said increment method is unary increment. 11. The computer-readable medium of claim 9, where said counter is implemented in flash memory. 12. The computer-readable medium of claim 9, where said specified value is equal to zero.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (6)
Mather Robert P., Binary counter and method for counting to extend lifetime of storage cells.
Lippmann Raymond (Ann Arbor MI) Schnars Michael J. (Clarkston MI) DuBois Paul L. (Flint MI), Method and apparatus for counting with a nonvolatile memory.
Ginter Karl L. ; Shear Victor H. ; Sibert W. Olin ; Spahn Francis J. ; Van Wie David M., Systems and methods for secure transaction management and electronic rights protection.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.