Results 251 to 260 of about 4,876,450 (324)

Programmable Speech Recognition Based on Cu/CuBiSe₂/SrNbO₃/W Memristors. [PDF]

ACS Omega
Jin S, Wang M, Wang Z, Guo A, Luo H, Zhu Z, Xu H, Peng H, Su X, Wu J.   +9 more
europepmc   +1 more source

A Semi-Tensor Product based Circuit Simulation for SAT-sweeping [PDF]

2024 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2023
This paper introduces a novel circuit simulator of k-input lookup table (k-LUT) networks, based on semi-tensor product (STP). STP-based simulators use computation of logic matrices, the primitives of logic networks, as opposed to relying on bitwise logic
Hong-Yang Pan, Ruibing Zhang, Yinshui Xia, Lun-Yao Wang, Fan Yang, Xuan Zeng, Zhufei Chu   +6 more
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Image Encryption Algorithm for Synchronously Updating Boolean Networks Based on Matrix Semi-Tensor Product Theory

Information Sciences, 2020
This paper studies chaotic image encryption technology and an application of matrix semi-tensor product theory, and a Boolean network encryption algorithm for a synchronous update process is proposed. A 2D-LASM chaotic system is used to generate a random
Suo Gao, Xingyuan Wang
exaly   +2 more sources

Image Encryption Algorithm Based on the Matrix Semi-Tensor Product With a Compound Secret Key Produced by a Boolean Network

Information Sciences, 2020
In this paper, a chaotic image encryption algorithm based on the matrix semi-tensor product (STP) with a compound secret key is designed. First, a new scrambling method is designed. The pixels of the initial plaintext image are randomly divided into four
Suo Gao, Xingyuan Wang
exaly   +2 more sources

Exact Synthesis Based on Semi-Tensor Product Circuit Solver

2023 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2023
In logic synthesis, Boolean satisfiability (SAT) is widely used as a reasoning engine, especially for exact synthesis. By representing input formulas as logic circuits instead of conjunction normal forms (CNFs) as in off-the-shelf CNF-based SAT solvers ...
Hongyang Pan, Zhufei Chu
semanticscholar   +3 more sources

Semi‐tensor product of quaternion matrices and its application

Mathematical Methods in the Applied Sciences, 2022
Unlike real or complex numbers, quaternion multiplication does not satisfy the commutative law. This makes it impossible to generalize some conclusions on semi‐tensor product to quaternion directly, which is valid on real or complex number fields.
Xue-fang Fan, Ying Li, Wenxv Ding, Jian-Li Zhao   +3 more
semanticscholar   +2 more sources

Semi-Tensor Product-Based Exact Synthesis for Logic Rewriting

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Boolean satisfiability (SAT)-based exact synthesis has made significant progress in recent years, particularly in logic rewriting for the identification of potential subnetwork replacements.
Hong-Yang Pan, Yinshui Xia, Lun-Yao Wang, Zhufei Chu   +3 more
semanticscholar   +3 more sources

On Solutions of the Tensor Equation A⋉X=B Using the Semi-Tensor Product Under the t-Product

Journal of the Franklin Institute
Javad Fathi
exaly   +2 more sources