Patent US5852740A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5852740A Expired / Lapsed US ⏱️ 0.0 years remaining

Polymorphic network methods and apparatus

Assignee: Individual
•
Filing: 1997-10-15
•
Granted: 1998-12-22
•
Expires: 2017-10-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A modular, polymorphic network interconnecting a plurality of electronically reconfigurable devices via a modular, polymorphic interconnect, to permit a fixed, physical configuration of operating hardware devices to take on a plurality of logically addressable configurations. The modular, polymorphic interconnect further permits allocation and deallocation of selected electronically reconfigurable devices for a particular logically addressable configuration. The modular, polymorphic interconnect additionally permits the logical topology of selected electronically reconfigurable devices to be configured as at least one mixed-radix, N-dimensional network. The logical topology of mixed-radix, N-dimensional networks can be dynamically changed under control for a new configuration of logical addresses for selected electronically reconfigurable devices. The modular, polymorphic interconnect also permits one or more electronically reconfigurable devices to be selected from at least one logically related set of electronically reconfigurable devices, making the resulting network system particularly well suited for a variety of purposes related to resource management.

Inventors

  • 👤 Mark D. Estes

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 12:30
CPC Classifications
G; G06; G06T; G06T17/00; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/966

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 112 words
A method of controlling a Gray code transition sequence using a plurality of dimensions corresponding to attributes which name a plurality of groups of related object space configurations, and a first dimension corresponding to an attribute of the Gray code transition sequence described by grouping named transitions in which the same bit position of codewords changes, comprising the steps of: allocating a context configuration control network; inputting, using the plurality of dimensions, data representing a particular object space configuration; inputting the first dimension, corresponding to a particular step in the Gray code transition sequence; and determining a bit position which changes to produce a next codeword in the Gray code transition sequence.
Claim 2
Independent Claim 112 words
A method of controlling a Gray code transition sequence using a plurality of dimensions corresponding to attributes which name a plurality of groups of related object space configurations, and a first dimension corresponding to an attribute of the Gray code transition sequence described by grouping named transitions in which the same bit position of codewords changes, comprising the steps of: allocating a context configuration control network; inputting, using the plurality of dimensions, data representing a particular object space configuration; inputting the first dimension, corresponding to a particular step in the Gray code transition sequence; and determining a bit position which changes to produce a next codeword in the Gray code transition sequence.
Claim 3
Independent Claim 110 words
A method of controlling a Gray code transition sequence using a plurality of dimensions corresponding to attributes which name a plurality of groups of related object space configurations, and a first dimension corresponding to an attribute of the Gray code transition sequence described by a particular bit position of codewords, comprising the steps of allocating a context configuration control network; inputting, using the plurality of dimensions, data representing a particular object space configuration; inputting the first dimension, corresponding to a particular bit position of a codeword for the Gray code transition sequence; and determining if the particular bit position is a next logically adjacent for the Gray code transition sequence.
Claim 4
Independent Claim 110 words
A method of controlling a Gray code transition sequence using a plurality of dimensions corresponding to attributes which name a plurality of groups of related object space configurations, and a first dimension corresponding to an attribute of the Gray code transition sequence described by a particular bit position of codewords, comprising the steps of allocating a context configuration control network; inputting, using the plurality of dimensions, data representing a particular object space configuration; inputting the first dimension, corresponding to a particular bit position of a codeword for the Gray code transition sequence; and determining if the particular bit position is a next logically adjacent for the Gray code transition sequence.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-12-21 2002-06-22 2002-12-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-12-21 2006-06-22 2006-12-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-12-21 2010-06-22 2010-12-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag