US5825644A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for encoding a state machine
Assignee: Edge Specialties Inc
•
Filing: 1996-03-04
•
Granted: 1998-10-20
•
Expires: 2016-03-04
Abstract
Abstract A method for encoding a state machine includes performing a state transition probability analysis (11) to identify hot states (12) and cold states. Then hot (13) and cold (14) states are encoded. The encoding minimizes the expected bit flip (EBF). In addition, a local encoding exploration may be performed to further optimize the encoding of the state machine for area and power consumption. The local encoding exploration preserves the EBF.
Inventors
- 👤 Gary K. Yeap
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 09:48
CPC Classifications
G; G06; G06F; G06F7/00; G06F30/00; G06F30/30
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
50 words
A method for encoding a state machine, comprising the steps of: performing a transition probability analysis on the state machine; identifying at least one hot state using the transition probability analysis; and providing an initial encoding by performing at least the step of encoding the at least one hot state.
Claim 2
Independent Claim
50 words
A method for encoding a state machine, comprising the steps of: performing a transition probability analysis on the state machine; identifying at least one hot state using the transition probability analysis; and providing an initial encoding by performing at least the step of encoding the at least one hot state.
Claim 3
Dependent Claim
37 words
The method of claim 1, wherein the step of providing an initial encoding further includes the steps of: identifying at least one cold state using the transition probability analysis; and encoding the at least one cold state.
Claim 4
Dependent Claim
19 words
The method of claim 2, further comprising the step of performing a local encoding exploration on the initial encoding.
Claim 5
Dependent Claim
26 words
The method of claim 1, wherein the step of performing a transition probability analysis on the state machine includes providing an encoding for the state machine.
Claim 6
Dependent Claim
26 words
The method of claim 1, further comprising the step of performing a local encoding exploration on the initial encoding of the at least one hot state.
Claim 7
Dependent Claim
27 words
The method of claim 5, wherein the step of performing a local encoding exploration includes performing a complementation operation and a permutation operation on the initial encoding.
Claim 8
Independent Claim
108 words
A method for encoding a state machine, comprising the steps of: performing a transition probability analysis on the state machine; identifying a first hot state and a second hot state from the transition probability analysis; generating an initial encoding by performing at least the steps of encoding the first hot state and encoding the second hot state to minimize a Hamming distance for a transition between the first hot state and the second hot state; performing a local encoding exploration on the initial encoding of the first hot state and the second hot state to generate a first encoding; and generating a circuit implementation from the first encoding.
Claim 9
Independent Claim
108 words
A method for encoding a state machine, comprising the steps of: performing a transition probability analysis on the state machine; identifying a first hot state and a second hot state from the transition probability analysis; generating an initial encoding by performing at least the steps of encoding the first hot state and encoding the second hot state to minimize a Hamming distance for a transition between the first hot state and the second hot state; performing a local encoding exploration on the initial encoding of the first hot state and the second hot state to generate a first encoding; and generating a circuit implementation from the first encoding.
Claim 10
Dependent Claim
23 words
The method of claim 7, wherein the step of performing a local encoding exploration includes performing a complementation operation on the initial encoding.
Claim 11
Dependent Claim
23 words
The method of claim 7, wherein the step of performing a local encoding exploration includes performing a permutation operation on the initial encoding.
Claim 12
Dependent Claim
24 words
The method of claim 9, wherein the step of performing a local encoding exploration further includes performing a complementation operation on the initial encoding.
Claim 13
Dependent Claim
32 words
The method of claim 7, wherein the step of generating an initial encoding further includes the steps of: identifying a cold state from the transition probability analysis; and encoding the cold state.
Claim 14
Dependent Claim
39 words
The method of claim 7, wherein the step of performing a local encoding exploration further includes the steps of: iteratively performing the local encoding exploration to generate a second encoding; and generating another circuit implementation from the second encoding.
Claim 15
Independent Claim
65 words
A method for generating a circuit, comprising the steps of: performing a transition probability analysis on state transitions; using the transition probability analysis to identify a plurality of hot states; encoding the plurality of hot states to minimize a Hamming distance for a transition between the plurality of hot states; and generating the circuit in accordance with encoding information of the plurality of hot states.
Claim 16
Independent Claim
65 words
A method for generating a circuit, comprising the steps of: performing a transition probability analysis on state transitions; using the transition probability analysis to identify a plurality of hot states; encoding the plurality of hot states to minimize a Hamming distance for a transition between the plurality of hot states; and generating the circuit in accordance with encoding information of the plurality of hot states.
Claim 17
Dependent Claim
12 words
The method of claim 13, wherein the circuit is a logic circuit.
Claim 18
Dependent Claim
22 words
The method of claim 13, wherein the step of performing a transition probability analysis includes assigning an encoding to a state machine.
Claim 19
Dependent Claim
29 words
The method of claim 13, wherein the step of using the transition probability analysis to identify a plurality of hot states further includes identifying at least one cold state.
Claim 20
Dependent Claim
54 words
The method of claim 16, wherein: the step of encoding the plurality of hot states further includes encoding the at least one cold state; and the step of generating the circuit further includes generating the circuit in accordance with encoding information from the plurality of hot states and the at least one cold state.
References Cited (Backward Citations)
US4556976A
Cited
US4718087A
Cited
US4663545A
Cited
US4749929A
Cited
US5452231A
Cited
US5465062A
Cited
US5389838A
Cited
US5515292A
Cited
US5469367A
Cited
US5542034A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-19 | 2002-04-20 | 2002-10-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-19 | 2006-04-20 | 2006-10-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-19 | 2010-04-20 | 2010-10-20 | $7700.00 | Window Closed / Lapsed |