This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting...This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting from a basis of its kernel which forms a Chebyshev asymptotic scale at an endpoint. These algorithms arise quite naturally in our asymptotic context and prove very simple in special cases and/or for scales with a small numbers of terms. All the results in the three Parts of this work are well illustrated by a class of asymptotic scales featuring interesting properties. Examples and counterexamples complete the exposition.展开更多
The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and...The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities. The Fast Tabular Technique (FTT) for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed. The simulative result shows this FTT is faster than others in references because of its inherent parallelism.展开更多
To simplify the process for identifying 12 types of symmetric variables in the canonical OR-coincidence(COC) algebra system, we propose a new symmetry detection algorithm based on OR-NXOR expansion. By analyzing the r...To simplify the process for identifying 12 types of symmetric variables in the canonical OR-coincidence(COC) algebra system, we propose a new symmetry detection algorithm based on OR-NXOR expansion. By analyzing the relationships between the coefficient matrices of sub-functions and the order coefficient subset matrices based on OR-NXOR expansion around two arbitrary logical variables, the constraint conditions of the order coefficient subset matrices are revealed for 12 types of symmetric variables. Based on the proposed constraints, the algorithm is realized by judging the order characteristic square value matrices. The proposed method avoids the transformation process from OR-NXOR expansion to AND-OR-NOT expansion, or to AND-XOR expansion, and solves the problem of completeness in the dj-map method. The application results show that, compared with traditional methods, the new algorithm is an optimal detection method in terms of applicability of the number of logical variables, detection type, and complexity of the identification process. The algorithm has been implemented in C language and tested on MCNC91 benchmarks. Experimental results show that the proposed algorithm is convenient and efficient.展开更多
文摘This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting from a basis of its kernel which forms a Chebyshev asymptotic scale at an endpoint. These algorithms arise quite naturally in our asymptotic context and prove very simple in special cases and/or for scales with a small numbers of terms. All the results in the three Parts of this work are well illustrated by a class of asymptotic scales featuring interesting properties. Examples and counterexamples complete the exposition.
基金Supported by the National Natural Science Foundation of China (No.60273093)the Natural Science Foundation of Zheiinag Province (No.Y104135)
文摘The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities. The Fast Tabular Technique (FTT) for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed. The simulative result shows this FTT is faster than others in references because of its inherent parallelism.
基金Project supported by the National Natural Science Foundation of China(Nos.61471314 and 61271124)the National Social Science Foundation of China(No.12AZD121)+1 种基金the Zhejiang Provincial Natural Science Foundation of China(No.LY13F010001)the National Key Technology Research and Development Program of the Ministry of Science and Technology of China(Nos.2013BAH27F01 and 2013BAH27F02)
文摘To simplify the process for identifying 12 types of symmetric variables in the canonical OR-coincidence(COC) algebra system, we propose a new symmetry detection algorithm based on OR-NXOR expansion. By analyzing the relationships between the coefficient matrices of sub-functions and the order coefficient subset matrices based on OR-NXOR expansion around two arbitrary logical variables, the constraint conditions of the order coefficient subset matrices are revealed for 12 types of symmetric variables. Based on the proposed constraints, the algorithm is realized by judging the order characteristic square value matrices. The proposed method avoids the transformation process from OR-NXOR expansion to AND-OR-NOT expansion, or to AND-XOR expansion, and solves the problem of completeness in the dj-map method. The application results show that, compared with traditional methods, the new algorithm is an optimal detection method in terms of applicability of the number of logical variables, detection type, and complexity of the identification process. The algorithm has been implemented in C language and tested on MCNC91 benchmarks. Experimental results show that the proposed algorithm is convenient and efficient.
