Automatic compilation method and framework for generating a layout of integrated memory-compute circuit
US-2024403527-A1 · Dec 5, 2024 · US
Goal-driven search of a stochastic process using reduced sets of simulation points
US9201993B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9201993-B2 |
| Application number | US-201213402172-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 22, 2012 |
| Priority date | May 11, 2011 |
| Publication date | Dec 1, 2015 |
| Grant date | Dec 1, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Various techniques for improving performance of a goal-seeking search of a computer-simulated stochastic process are disclosed. One such technique may include generating an N-point Monte Carlo simulation of a stochastic model, such as a model representative of a digital electronic circuit, and selecting a subset of M points from the N-point Monte Carlo simulation, where M is less than N. The technique may further include searching the subset of M points to identify a target value, wherein said searching comprises generating one or more M-point Monte Carlo simulations of the stochastic model; and checking the target value, wherein said checking comprises generating an additional N-point Monte Carlo simulation of the stochastic model dependent on results of searching the subset of M points.
First claim
Opening claim text (preview).
What is claimed is: 1. A method, comprising: one or more computers performing: pseudorandomly generating an initial set of N observation points of a stochastic model of a digital electronic circuit dependent upon a probability distribution function, wherein pseudorandomly generating the initial set of N observation points comprises simulating the digital electronic circuit, wherein each of the initial set of N observation points is generated independently of any other point within…
Assignees
Inventors
Classifications
Physics · mapped topic
- G06F30/367Primary
Physics · mapped topic
- G06F17/5036Primary
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9201993B2 cover?
- Various techniques for improving performance of a goal-seeking search of a computer-simulated stochastic process are disclosed. One such technique may include generating an N-point Monte Carlo simulation of a stochastic model, such as a model representative of a digital electronic circuit, and selecting a subset of M points from the N-point Monte Carlo simulation, where M is less than N. The te…
- Who is the assignee on this patent?
- Seningen Michael R, Apple Inc
- What technology area does this patent fall under?
- Primary CPC classification G06F30/367. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Dec 01 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).