Method for logical processing of continuous-valued logical signals
OwnerMichael S. Khvilivitzkyinventor
Life of this patent
Estimating the term…
Abstract
The present invention provides computational means for calculating values of continuous-valued logical functions, which are uniquely defined and deterministic, while compatible with their discrete counterparts. The invention supports logical processing of arbitrary logical functions of arbitrary number of input variables. The proposed algorithm utilizes a series of multiplications, number of which is proportional to a number of input variables and a number of maxterms. It allows of minimizing the computation time while excluding a more elaborative disjunction operation. The present invention can be implemented in software of microprocessors, microcontrollers, DSP, or general computers, and it can also be built as a stand-alone or a set of digital, analog, or mixed-signal ICs.
Claims9
A method for logical processing of continuous-valued logical signals, comprising:
- (a) providing means for input plurality of logical signals x.sub.j, index i of a direct logical function A.sub.i to be assessed, and a number n of said logical signals x.sub.j,
- (b) providing means for storing said logical signals x.sub.j, said index i, said number n, a maxterm M.sub.k, a minterm m.sub.k, a negated logical function NOT A.sub.i, and said direct logical function A.sub.i in internal memory,
- (c) providing means for output a value of said direct logical function A.sub.i and said negated logical function NOT A.sub.i,
- (d) providing means for control which orchestrates operation of the system,
- (e) providing a logical processing unit which will:
- (i) fulfill basic logical conjunction operation AND as a product of multiplication of two signals applied to inputs of said operation AND and for fulfilling logical negation operation NOT as a difference between 1 and a value of the signal applied to an input of said operation NOT,
- (ii) initialize said negated logical function NOT A.sub.i to 1, an index k of said minterm m.sub.k to 0, and index k of said maxterm M.sub.k to 0,
- (iii) in an external loop, calculate said negated logical function NOT A.sub.i by representing said index i of said logical function A.sub.i in binary form, obtaining said k-th binary digit of said index i, and consequently applying said AND operation to predetermined said negated logical function NOT A.sub.i and said maxterm M.sub.k only in a case if said k-th binary digit of said index i is equal to 1, in which case to activate an internal loop to assess a new value of said maxterm M.sub.k,
- (iv) after running said external loop 2.sup.n times, calculate said direct logical function A.sub.i associated with said negated logical function NOT A.sub.i by applying said operation NOT to said negated logical function NOT A.sub.i,
- (v) initialize an index j of said input variable x.sub.j to 0 and said minterm m.sub.k to 1,
- (vi) in said internal loop, calculate said minterm m.sub.k by representing said index k of said minterm m.sub.k in binary form, obtaining said j-th binary digit of said index k, consequently executing said AND operation on predetermined value of said minterm m.sub.k and, if said j-th binary digit of said index k eq ual to 1, then on said input variable x.sub.j, else if said j-th binary digit of said index k is equal to 0, then on said input variable x.sub.j after applying to it said logical operation NOT,
- (vii) after running said internal loop said n times, calculate said maxterm M.sub.k by applying said operation NOT to a value of said minterm m.sub.k to determine said maxterm M.sub.k associated with said minterm m.sub.k,
- wherein any arbitrary continuous-valued logical functions of arbitrary number of input variables are calculated in real time, and logical functions are defined deterministically, unique, and are compatible with corresponding discrete logical functions, and
- wherein results of calculations are repeatable and computation time is substantially decreased due to exclusion of disjunction operations.
Dependencies are inferred from the claim text.