US5893084A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for creating specific purpose rule-based n-bit virtual machines
Assignee: STARGATE Ltd A TEXAS Corp
•
Filing: 1996-10-04
•
Granted: 1999-04-06
•
Expires: 2016-10-04
Abstract
Abstract A system and method for implementing one or more specific purpose rule-based n-bit virtual processing machines. Specific purposes include, but are not limited to, encryption, compression, and arbitrary precision arithmetic. Each virtual machine consists of a command processor, a rule-base, and an interface between the command processor and the rule-base. Each of the elements of a specific purpose rule-based n-bit virtual machine--the command processor, the rule-base, and the rule-base interface--is preferably implemented as software. In the preferred embodiment, the system uses a stored rule-base as its instruction set and provides for input and output in the form of variable length bit strings of length n where n is any number greater than zero. Each of the rules within the rule-base performs one or more binary string operations against one or more variable length n-bit strings. The function of the rule-base is to provide a set of application specific rules that allows the machine to perform a particular task such as encryption, data compression, or arbitrary precision arithmetic. The system includes a method for providing a software interface to the rule-base. This interface may be a separate program or may be contained within the command processor. The command processor receives input in the form of one or more n-bit data types, performs rule-based operations on the data, and returns output in the form of one or more n-bit data types. Specific system and methods for performing data encryption, data compression, and arbitrary precision arithmetic using the invention are described.
Inventors
- 👤 Joseph M. Morgan
- 👤 Michael D. Harold
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 21:12
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H04; H04L; H04L9/00; H04L9/32; H04L2209/00; H04L2209/30
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
171 words
A method for compressing information data from a data source comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the computer and contains bits representing said information data and including control bits to a virtual command processor; storing a plurality of data compression rules in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific data compression rules stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string according to the identified compression rules in the rule-base to compress the information data bits; and transferring said compressed information data bits to said virtual command processor for output as variable length n-bit data types.
Claim 2
Independent Claim
171 words
A method for compressing information data from a data source comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the computer and contains bits representing said information data and including control bits to a virtual command processor; storing a plurality of data compression rules in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific data compression rules stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string according to the identified compression rules in the rule-base to compress the information data bits; and transferring said compressed information data bits to said virtual command processor for output as variable length n-bit data types.
Claim 3
Dependent Claim
44 words
A method as in claim 1 further comprising the steps of: identifying said data source with said control bits in said n-bit data string; and including bits in said control bits that represent at least one argument to be used when accessing said rule-base.
Claim 4
Dependent Claim
46 words
A method as in claim 2 further comprising the steps of: coupling one or more of said arguments to said identified rule within said rule-base; and applying the identified rule to the n-bit information data to modify said information data and to perform said data compression.
Claim 5
Dependent Claim
43 words
A method as in claim 3 further including the steps of: appending additional arguments, as needed, to said modified information according to said identified rule in said rule-base; and returning the modified information data to said rule-base interface along with said needed arguments.
Claim 6
Dependent Claim
95 words
A method as in claim 4 further including the steps of: iteratively submitting said modified data to at least another one of said rules stored in said rule-base in accordance with said arguments appended by said identified rule for further modification until said data modification satisfies all of said arguments; and returning said satisfied modification data to said virtual command processor as one or more n-bit data strings that are not required to correspond to the n-bit size and number of n-bit input data strings coupled to said virtual command processor from said data source.
Claim 7
Dependent Claim
28 words
A method as in claim 1 further comprising the steps of: storing said rules in a memory in said rule-base; and defining said rules as binary string operations.
Claim 8
Independent Claim
181 words
A method for creating a specific purpose virtual processor comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor and contains bits representing said specific purpose and including control bits to a virtual command processor; storing a plurality of rules for said specific purpose in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific ones of said specific purpose rules stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string according to the identified specific purpose rules in the rule-base to create a specific purpose application; and transferring said modified n-bit data string representing said specific purpose application to said virtual command processor for output as variable length n-bit data types.
Claim 9
Independent Claim
181 words
A method for creating a specific purpose virtual processor comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor and contains bits representing said specific purpose and including control bits to a virtual command processor; storing a plurality of rules for said specific purpose in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific ones of said specific purpose rules stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string according to the identified specific purpose rules in the rule-base to create a specific purpose application; and transferring said modified n-bit data string representing said specific purpose application to said virtual command processor for output as variable length n-bit data types.
Claim 10
Dependent Claim
44 words
A method as in claim 7 further comprising the steps of: identifying said data source with said control bits in said n-bit data string; and including bits in said control bits that represent at least one argument to be used when accessing said rule-base.
Claim 11
Dependent Claim
45 words
A method as in claim 8 further comprising the steps of: coupling one or more of said arguments to said identified rule within said rule-base; and applying the identified rule to the n-bit information data to modify said information data to perform said specific purpose.
Claim 12
Dependent Claim
43 words
A method as in claim 9 further including the steps of: appending additional arguments, as needed, to said modified information according to said identified rule in said rule-base; and returning the modified information data to said rule-base interface along with said needed arguments.
Claim 13
Dependent Claim
94 words
A method as in claim 10 further including the steps of: iteratively submitting said modified data to at least another one of said rules stored in said rule-base in accordance with said arguments appended by said identified rule for further modification until said data modification satisfies all of said arguments; and returning said satisfied modification data to said command processor as one or more n-bit data strings that are not required to correspond to the n-bit size and number of n-bit input data strings coupled to said virtual command processor from said data source.
Claim 14
Dependent Claim
43 words
A method as in claim 10 further including the step of manipulating said information data with rules from said rule-base such that accomplishment of said specific purpose is not dependent upon an explicit key, a specific purpose rule, or a specified data type.
Claim 15
Dependent Claim
27 words
A method as in claim 10 further comprising the step of user-defining the implementation of said specific purpose since no single algorithm or rule must be defined.
Claim 16
Dependent Claim
29 words
A method as in claim 7 further comprising the steps of: storing said rules in a memory in said rule-base; and defining said stored rules as binary string operations.
Claim 17
Dependent Claim
166 words
A virtual software processor for defining an n-bit data type in terms of a desired output where the value of n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor, said machine comprising: an input means for receiving, as input, one or more of said n-bit data types as Y variable length n-bit words where Y>0; a storage means for storing user-defined rules in a rule-base, processing means coupled to said input means and said storage means for performing operations on said input n-bit data types using one or more of the user-defined rules of said rule-base to define said input n-bit data types in terms of said desired output; and output means coupled to said processing means for outputting sad desired output as variable length n-bit words that do not necessarily hag to correspond with the size, in bits, and number, Y, of the variable length n-bit input words.
Claim 18
Dependent Claim
166 words
A virtual software processor for defining an n-bit data type in terms of a desired output where the value of n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor, said machine comprising: an input means for receiving, as input, one or more of said n-bit data types as Y variable length n-bit words where Y>0; a storage means for storing user-defined rules in a rule-base, processing means coupled to said input means and said storage means for performing operations on said input n-bit data types using one or more of the user-defined rules of said rule-base to define said input n-bit data types in terms of said desired output; and output means coupled to said processing means for outputting sad desired output as variable length n-bit words that do not necessarily hag to correspond with the size, in bits, and number, Y, of the variable length n-bit input words.
Claim 19
Independent Claim
181 words
A method of implementing a virtual processor capable of performing rule-based n-bit arbitrary precision arithmetic logic functions comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor and contains bits representing a desired arithmetic logic function and including control bits to a virtual command processor; storing a plurality of arithmetic operations in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific arithmetic logic functions stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string in accordance with the identified arithmetic operations in the rule-base to perform said desired arbitrary precision arithmetic operations; and transferring said performed arithmetic operations to said virtual command processor for output as variable length n-bit data types.
Claim 20
Independent Claim
181 words
A method of implementing a virtual processor capable of performing rule-based n-bit arbitrary precision arithmetic logic functions comprising the steps of: coupling at least one n-bit data string of input data as variable length n-bit data types where n is all integers greater than 0 and includes both odd and even numbers and is limited only by the physical address space of the processor and contains bits representing a desired arithmetic logic function and including control bits to a virtual command processor; storing a plurality of arithmetic operations in a rule-base memory for processing the n-bit data string; coupling a rule-base interface between said virtual command processor and said rule-base memory for identifying specific arithmetic logic functions stored in said rule-base memory according to said control bits in said n-bit input data string received from said virtual command processor; modifying the n-bit data string in accordance with the identified arithmetic operations in the rule-base to perform said desired arbitrary precision arithmetic operations; and transferring said performed arithmetic operations to said virtual command processor for output as variable length n-bit data types.
References Cited (Backward Citations)
US5587725A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-04-05 | 2002-10-05 | 2003-04-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-04-05 | 2006-10-05 | 2007-04-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-04-05 | 2010-10-05 | 2011-04-06 | $7700.00 | Window Closed / Lapsed |