The circuit testable realization and its fault detection for logic functions with ESOP （EXOR-Sum-Of-Products） expressions are studied. First of all, for the testable realization by using XOR gate cascade, a test set...The circuit testable realization and its fault detection for logic functions with ESOP （EXOR-Sum-Of-Products） expressions are studied. First of all, for the testable realization by using XOR gate cascade, a test set with 2n ＋ m ＋ 1 vectors for the detections of AND bridging faults and a test set with 2n ＋ m vectors for the detections of OR bridging faults are presented. Secondly, for the testable realization by using ）（OR gate tree, a test set with 2n ＋ m vectors for the detections of AND bridging faults and a test set with 3n ＋ m ＋ 1 vectors for the detections of OR bridging faults are presented. Finally, a single fault test set with n ＋ 5 vectors for the XOR gate tree realization is presented. Where n is the number of input variables and m is the number of product terms in a logic function.展开更多
In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the characte...In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the character spectrum of f(x,y) and the character speetrum of q(x),h(x) and the relationship between the cryptographic properties of f(x,y) and the cryptographic properties of h(x).展开更多
MUKAIDONO proposed and systematically investigated the theory of regular ternary logic functions that meets the need of uncertain inferences. The enumeration of ternary logic functions is very complicated and several ...MUKAIDONO proposed and systematically investigated the theory of regular ternary logic functions that meets the need of uncertain inferences. The enumeration of ternary logic functions is very complicated and several results have been obtained only in the case where the number of variables is less than 7. In this letter we offer a new possible way to solve the prob-展开更多
A dinitrophenyl hydrazone colorimetric anion sensor （receptor 1） was synthesized and its recognition properties towards various anions were investigated by naked eye observation and spectroscopic methods, namely UV-...A dinitrophenyl hydrazone colorimetric anion sensor （receptor 1） was synthesized and its recognition properties towards various anions were investigated by naked eye observation and spectroscopic methods, namely UV-vis and 1H NMR titrations in DMSO. The addition of AcO？, F？ and H2PO4？ to receptor 1 resulted in marked red shift of the charge-transfer absorbance band （Δλ=91 nm, 407 nm to 498 nm） concomitant with a ＇naked-eye＇ detectable colour change from yellow to pink. However, both the colour and spectral changes were reversible by the addition of cations （MII） of 3d5-10 as well as CdII, HgII, MgII and CaII. Subsequently, complementary IMP/INH logic functions based on colour and spectral switching （ON/OFF） were affirmed. The sensor can, thus be utilized as a colorimetric molecular switch modulated by F？/MII.展开更多
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this pape...In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inP k * . Keywords multiple-valued logic - completeness - Sheffer function - precomplete class NoteThis work is supported by the National Natural Science Foundation of China (Grant Nos.60083001 and 60375021).展开更多
In this paper,we study a special class of fractal interpolation functions,and give their Haar-wavelet expansions.On the basis of the expansions,we investigate the H(o|¨)lder smoothness of such functions and their...In this paper,we study a special class of fractal interpolation functions,and give their Haar-wavelet expansions.On the basis of the expansions,we investigate the H(o|¨)lder smoothness of such functions and their logical derivatives of order α.展开更多
This paper discusses the best affine approach （BAA） of multi-output m-valued logical functions. First, it gives the spectra of rate of accordance between multi-output m-valued logical functions and their affine func...This paper discusses the best affine approach （BAA） of multi-output m-valued logical functions. First, it gives the spectra of rate of accordance between multi-output m-valued logical functions and their affine functions, then analyzes the BAA of multi-output m-valued logical functions and finally gives the spectral characteristics of BAA of multi-output m-valued logical functions.展开更多
An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR fun...An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR function with n input variables.展开更多
Correlation-immunity is an important concept in cryptology. In ref. [1] Siegenthaler introduced the mathematical definition of correlation-immunity and used the correlation-immunity order of logic functions as a measu...Correlation-immunity is an important concept in cryptology. In ref. [1] Siegenthaler introduced the mathematical definition of correlation-immunity and used the correlation-immunity order of logic functions as a measure for cipher systems to defend against correlation attacks. In terms of Walsh transform, the correlation immunity of binary-valued logic functions, i.e. Boolean functions, was studied in ref. [2], and a展开更多
There are many kinds of special relationships between multiple-valued logical func-tions and their variables, and they are difficult to be judged from their expressions. In thispaper, some sufficient and necessary con...There are many kinds of special relationships between multiple-valued logical func-tions and their variables, and they are difficult to be judged from their expressions. In thispaper, some sufficient and necessary conditions of the independence and statistical independenceof multiple-valued logical functions on their variables are given. Some conditions of algebraicindependence of multiple-valued logical functions on some of their variables and the way to de-generate a function to the greatest extent are proposed, and some applications of these resultsare indicated. All the results are studied by using Chrestenson spectral techniques.展开更多
This paper discusses the definition and properties of multivalued symmetric functions, points out that a multivalued symmetric function can be decomposed according to the value of the function j. The subfunction Lj co...This paper discusses the definition and properties of multivalued symmetric functions, points out that a multivalued symmetric function can be decomposed according to the value of the function j. The subfunction Lj corresponding to j must be a symmetric function, and it may be expressed as the sum of products form of degenerated multivalued fundamental symmetric functions. Based on this consideration, the circuit realization for the multivalued symmetric functions based on full adders is proposed.展开更多
The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix cal...The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix calculation. It is calculated the implementation costs emphasizing the most economical solutions. One important aspect of serial decomposition is the task of selecting “best candidate” variables for the G function. Decomposition is essentially a process of substituting two or more input variables with a lesser number of new variables. This substitutes results in the reduction of the number of rows in the truth table. Hence, we look for variables which are most likely to reduce the number of rows in the truth table as a result of decomposition. Let us consider an input variable purposely avoiding all inter-relationships among the input variables. The only available parameter to evaluate its activity is the number of “l”s or “O”s that it has in the truth table. If the variable has only “1” s or “0” s, it is the “best candidate” for decomposition, as it is practically redundant.展开更多
The progress of the design, synthesis, fluorescence properties and application of a new family of fluorescent molecular switches towards information processing at the molecular level was reviewed. On the basis of the ...The progress of the design, synthesis, fluorescence properties and application of a new family of fluorescent molecular switches towards information processing at the molecular level was reviewed. On the basis of the high fluorescence quantum yields and surroundings-sensitive fluorescent properties of the 5-methoxy-2-(2-pyridyl)-thiazole (2-MPT, 1) and a series of its derivatives as prepared, multiple binary logic and arithmetic functionalities were realized through encoding the controllable fluorescence switching properties with binary digit. Combined with the microfluidic platform, the fabrication of the molecular logic devices was attempted.展开更多
基金Supported by the National Natural Science Foundation of China (No.60006002)the Education Department of Guangdong Province of China (No.02019).
文摘The circuit testable realization and its fault detection for logic functions with ESOP （EXOR-Sum-Of-Products） expressions are studied. First of all, for the testable realization by using XOR gate cascade, a test set with 2n ＋ m ＋ 1 vectors for the detections of AND bridging faults and a test set with 2n ＋ m vectors for the detections of OR bridging faults are presented. Secondly, for the testable realization by using ）（OR gate tree, a test set with 2n ＋ m vectors for the detections of AND bridging faults and a test set with 3n ＋ m ＋ 1 vectors for the detections of OR bridging faults are presented. Finally, a single fault test set with n ＋ 5 vectors for the XOR gate tree realization is presented. Where n is the number of input variables and m is the number of product terms in a logic function.
文摘In this paper, the author analyzed some cryptographic properties of a class of logical functions, f(x,y)=(q(x),...,q(x))·y+h(x),over Galois rings and residue rings, presented the relationship between the character spectrum of f(x,y) and the character speetrum of q(x),h(x) and the relationship between the cryptographic properties of f(x,y) and the cryptographic properties of h(x).
文摘MUKAIDONO proposed and systematically investigated the theory of regular ternary logic functions that meets the need of uncertain inferences. The enumeration of ternary logic functions is very complicated and several results have been obtained only in the case where the number of variables is less than 7. In this letter we offer a new possible way to solve the prob-
文摘A dinitrophenyl hydrazone colorimetric anion sensor （receptor 1） was synthesized and its recognition properties towards various anions were investigated by naked eye observation and spectroscopic methods, namely UV-vis and 1H NMR titrations in DMSO. The addition of AcO？, F？ and H2PO4？ to receptor 1 resulted in marked red shift of the charge-transfer absorbance band （Δλ=91 nm, 407 nm to 498 nm） concomitant with a ＇naked-eye＇ detectable colour change from yellow to pink. However, both the colour and spectral changes were reversible by the addition of cations （MII） of 3d5-10 as well as CdII, HgII, MgII and CaII. Subsequently, complementary IMP/INH logic functions based on colour and spectral switching （ON/OFF） were affirmed. The sensor can, thus be utilized as a colorimetric molecular switch modulated by F？/MII.
文摘In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inP k * . Keywords multiple-valued logic - completeness - Sheffer function - precomplete class NoteThis work is supported by the National Natural Science Foundation of China (Grant Nos.60083001 and 60375021).
文摘In this paper,we study a special class of fractal interpolation functions,and give their Haar-wavelet expansions.On the basis of the expansions,we investigate the H(o|¨)lder smoothness of such functions and their logical derivatives of order α.
基金Supported by the Opening Research Foundation of the State Key Laboratory of Information Security (2005-01-02)
文摘This paper discusses the best affine approach （BAA） of multi-output m-valued logical functions. First, it gives the spectra of rate of accordance between multi-output m-valued logical functions and their affine functions, then analyzes the BAA of multi-output m-valued logical functions and finally gives the spectral characteristics of BAA of multi-output m-valued logical functions.
文摘An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR function with n input variables.
基金Project supported by the National Natural Science FoundationDoctoral Programme Foundation of Institutions of Higher Education
文摘Correlation-immunity is an important concept in cryptology. In ref. [1] Siegenthaler introduced the mathematical definition of correlation-immunity and used the correlation-immunity order of logic functions as a measure for cipher systems to defend against correlation attacks. In terms of Walsh transform, the correlation immunity of binary-valued logic functions, i.e. Boolean functions, was studied in ref. [2], and a
文摘There are many kinds of special relationships between multiple-valued logical func-tions and their variables, and they are difficult to be judged from their expressions. In thispaper, some sufficient and necessary conditions of the independence and statistical independenceof multiple-valued logical functions on their variables are given. Some conditions of algebraicindependence of multiple-valued logical functions on some of their variables and the way to de-generate a function to the greatest extent are proposed, and some applications of these resultsare indicated. All the results are studied by using Chrestenson spectral techniques.
文摘This paper discusses the definition and properties of multivalued symmetric functions, points out that a multivalued symmetric function can be decomposed according to the value of the function j. The subfunction Lj corresponding to j must be a symmetric function, and it may be expressed as the sum of products form of degenerated multivalued fundamental symmetric functions. Based on this consideration, the circuit realization for the multivalued symmetric functions based on full adders is proposed.
文摘The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix calculation. It is calculated the implementation costs emphasizing the most economical solutions. One important aspect of serial decomposition is the task of selecting “best candidate” variables for the G function. Decomposition is essentially a process of substituting two or more input variables with a lesser number of new variables. This substitutes results in the reduction of the number of rows in the truth table. Hence, we look for variables which are most likely to reduce the number of rows in the truth table as a result of decomposition. Let us consider an input variable purposely avoiding all inter-relationships among the input variables. The only available parameter to evaluate its activity is the number of “l”s or “O”s that it has in the truth table. If the variable has only “1” s or “0” s, it is the “best candidate” for decomposition, as it is practically redundant.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 20821091, 20705003 & 20733001)Peking University Financial Support
文摘The progress of the design, synthesis, fluorescence properties and application of a new family of fluorescent molecular switches towards information processing at the molecular level was reviewed. On the basis of the high fluorescence quantum yields and surroundings-sensitive fluorescent properties of the 5-methoxy-2-(2-pyridyl)-thiazole (2-MPT, 1) and a series of its derivatives as prepared, multiple binary logic and arithmetic functionalities were realized through encoding the controllable fluorescence switching properties with binary digit. Combined with the microfluidic platform, the fabrication of the molecular logic devices was attempted.
