Stack position determination in memory devices configured for stacked arrangements
US-9218854-B2 · Dec 22, 2015 · US
US9032142B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9032142-B2 |
| Application number | US-201213535984-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 28, 2012 |
| Priority date | Jun 28, 2012 |
| Publication date | May 12, 2015 |
| Grant date | May 12, 2015 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods, systems, and computer readable storage medium directed to efficiently storing value ranges in TCAM or other memory are disclosed. Storing a range of integer values in a memory includes determining a subrange within the range, so that, in a first and a second plurality of bit subsequences from binary representations respectively of a start value and an end value of the subrange, all except at most one bit subsequence in the first plurality is either equal in value to a corresponding bit subsequence in the second plurality or has a value of 0 and a corresponding bit subsequence of the second plurality has a maximum value. The storing a range of integer values in a memory further includes forming a first bit string based upon values of the first and second plurality of bit subsequences, and storing the first bit string in the memory.
Opening claim text (preview).
What is claimed is: 1. A method for storing a range of integer values in a memory, comprising: determining a subrange within the range, so that, in a first plurality of bit subsequences and a second plurality of bit subsequences from binary representations respectively of a start value and an end value of the subrange, all except at most one bit subsequence in the first plurality of bit subsequences are either equal in value to a corresponding bit subsequence in the second plurali…
Electricity · mapped topic
Physics · mapped topic
Electricity · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.