Non-volatile in-memory computing device
US-10832746-B2 · Nov 10, 2020 · US
US12159123B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12159123-B2 |
| Application number | US-202318542688-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 17, 2023 |
| Priority date | Feb 26, 2020 |
| Publication date | Dec 3, 2024 |
| Grant date | Dec 3, 2024 |
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.
A method to compare between a first number and a second number includes the steps of storing the first number in a first row of an associative memory array, storing a two's complement representation of the second number in a second row of the associative memory array wherein bit i of the second number is stored in a same column of the associative memory array as bit i of the first number, concurrently performing a carry save operation on a plurality of columns of the associative memory array to create a sum and a carry, predicting a value of a carry out bit without adding the sum and the carry, and indicating that the first number is smaller than the second number if the value of the carry out bit is 1.
Opening claim text (preview).
What is claimed is: 1. A method to compare between a first number and a second number, the method comprising: storing said first number in a first row of an associative memory array; storing a two's complement representation of said second number in a second row of said associative memory array wherein bit i of said second number is stored in a same column of said associative memory array as bit i of said first number; concurrently performing a carry save operation on a plurality of columns of said associative memory array to create a sum and a carry; predicting a value of a carry out bit without adding said sum and said carry; and indicating that said first number is smaller than said second number if said value of said carry out bit is 1.
Dividing only · CPC title
using signed-digit representation · CPC title
in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination · CPC title
Multiplying; Dividing · CPC title
Magnitude comparison, i.e. determining the relative order of operands based on their numerical value, e.g. window comparator · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.