scholarly journals Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix

VLSI Design ◽  
2002 ◽  
Vol 14 (3) ◽  
pp. 259-271 ◽  
Author(s):  
Chip-Hong Chang ◽  
Bogdan J. Falkowski
Keyword(s):  
Boolean Functions ◽  
Coefficient Matrix ◽  
Computation Method ◽  
Boolean Matching ◽  
Low Probability ◽  
Ternary Decision Diagram ◽  
Equivalent Class

In this article, we have shown, by means of the EXOR Ternary Decision Diagram that the number of literals and product terms of the Fixed Polarity Reed–Muller (FPRM) expansions can be used to fully classify all Boolean functions in NP equivalent class and NPN equivalent class, respectively. Efficient graph based algorithms to compute the complete weight vectors have been presented. The proof and computation method has led to the derivation of a set of characteristic signatures that has low probability of aliasing when used as the Boolean matching filters in library mapping.

Genetic Network Programming for Automatic Program Generation

2005 ◽  
Vol 9 (4) ◽  
pp. 430-436 ◽  
Author(s):  
Shingo Mabu ◽  
◽  
Kotaro Hirasawa ◽  
Yuko Matsuya ◽  
Jinglu Hu ◽  
...  
Keyword(s):  
Directed Graph ◽  
Boolean Functions ◽  
Mirror Symmetry ◽  
Genetic Network ◽  
Computation Method ◽  
Network Programming ◽  
Program Generation ◽  
Parity Problem ◽  
Symmetry Problem ◽  
Genetic Network Programming

In this paper, a recently proposed Evolutionary Computation method called Genetic Network Programming (GNP) is applied to generate programs such as Boolean functions. GNP is an extension of Genetic Algorithm (GA) and Genetic Programming (GP). It has a directed graph structure as gene and can search for solutions effectively. GNP has been mainly applied to dynamic problems and has shown better performances compared to GP. However, its application to static problems has not yet been studied well. Thus in this paper, GNP is applied to generate programs as its extension to solving static problems. In order to apply GNP to generating static problems, we introduced a new element, memory. In the proposed method, a GNP individual consists of a directed graph and a memory, while one in conventional GNP consists only of a directed graph. In the simulations, GNP succeeded in solving Even-n-Parity problem and Mirror Symmetry problem.

A linear perturbation computation method applied to hydrodynamic instability growth predictions in ICF targets

2006 ◽  
Vol 133 ◽  
pp. 201-204
Author(s):  
J.-M. Clarisse ◽  
C. Boudesocque-Dubois ◽  
J.-P. Leidinger ◽  
J.-L. Willien
Keyword(s):  
Hydrodynamic Instability ◽  
Linear Perturbation ◽  
Computation Method ◽  
Instability Growth

Reconstruction of complex shaped crack from ECT signals based on a fast forward solver using an advanced multi-media element

2020 ◽  
Vol 64 (1-4) ◽  
pp. 621-629
Author(s):  
Yingsong Zhao ◽  
Cherdpong Jomdecha ◽  
Shejuan Xie ◽  
Zhenmao Chen ◽  
Pan Qi ◽  
...  
Keyword(s):  
Coefficient Matrix ◽  
Crack Edge ◽  
Numerical Accuracy ◽  
Gauss Point ◽  
Current Testing ◽  
Efficient Simulation ◽  
Shaped Crack ◽  
Multi Media ◽  
Profile Reconstruction ◽  
Crack Profile

In this paper, the conventional database type fast forward solver for efficient simulation of eddy current testing (ECT) signals is upgraded by using an advanced multi-media finite element (MME) at the crack edge for treating inversion of complex shaped crack. Because the analysis domain is limited at the crack region, the fast forward solver can significantly improve the numerical accuracy and efficiency once the coefficient matrices of the MME can be properly calculated. Instead of the Gauss point classification, a new scheme to calculate the coefficient matrix of the MME is proposed and implemented to upgrade the ECT fast forward solver. To verify its efficiency and the feasibility for reconstruction of complex shaped crack, several cracks were reconstructed through inverse analysis using the new MME scheme. The numerical results proved that the upgraded fast forward solver can give better accuracy for simulating ECT signals, and consequently gives better crack profile reconstruction.

Analysis of magnetic force and dynamic characteristic for non-contact permanent magnet linear drive device

2020 ◽  
Vol 64 (1-4) ◽  
pp. 1337-1345
Author(s):  
Chuan Zhao ◽  
Feng Sun ◽  
Junjie Jin ◽  
Mingwei Bo ◽  
Fangchao Xu ◽  
...  
Keyword(s):  
Finite Element ◽  
Permanent Magnet ◽  
Dynamic Characteristic ◽  
Driving Force ◽  
Magnetic Circuit ◽  
Response Speed ◽  
Computation Method ◽  
Element Analysis ◽  
Element Simulation ◽  
The Relationship

This paper proposes a computation method using the equivalent magnetic circuit to analyze the driving force for the non-contact permanent magnet linear drive system. In this device, the magnetic driving force is related to the rotation angle of driving wheels. The relationship is verified by finite element analysis and measuring experiments. The result of finite element simulation is in good agreement with the model established by the equivalent magnetic circuit. Then experiments of displacement control are carried out to test the dynamic characteristic of this system. The controller of the system adopts the combination control of displacement and angle. The results indicate that the system has good performance in steady-state error and response speed, while the maximum overshoot needs to be reduced.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

Study of Precise Computation Method of Magnetic Loss Considering Blanking Press Strain

2017 ◽  
Vol 137 (3) ◽  
pp. 254-260 ◽  
Author(s):  
Satoshi Doi ◽  
Tetsuya Aoki ◽  
Keiichi Okazaki ◽  
Yasuhito Takahashi ◽  
Koji Fujiwara
Keyword(s):  
Magnetic Loss ◽  
Computation Method
Sign in / Sign up

Export Citation Format

Share Document