This study investigates the computational properties of ZnO colloids in combination with proteinoid microspheres within an unconventional computing framework. We propose a method for creating flexible and fault-tolera...
详细信息
This study investigates the computational properties of ZnO colloids in combination with proteinoid microspheres within an unconventional computing framework. We propose a method for creating flexible and fault-tolerant logic gates utilising this colloidal system. The colloidal matrix receives binary strings with an electrical impulse representing a logical "True" and its absence representing a "False". Electrical responses are recorded, and boolean functions are extracted. This nano-bio hybrid of ZnO colloids and proteinoids has the potential to power next-generation unconventional computing systems that can adapt to changing environments, paving the way for novel nano-bio hybrid computing architectures.
Golay sequences with the zero correlation zone (ZCZ), known as Golay-ZCZ sequences, play a pivotal role in reducing intersymbol interference (ISI) during the process of channel estimation in one dimension. Two-dimensi...
详细信息
Golay sequences with the zero correlation zone (ZCZ), known as Golay-ZCZ sequences, play a pivotal role in reducing intersymbol interference (ISI) during the process of channel estimation in one dimension. Two-dimensional (2-D) Golay complementary array set (GCAS) within their ZCZ has the potential application in multiple input multiple output (MIMO) omnidirectional transmission. In this letter, 2-D Golay-ZCZ array set is constructed by using generalized boolean function (GBF) without utilizing any kernels. The proposed construction provides 2-D Golay-ZCZ array set with various array sizes and large ZCZ sizes. Also, we get the one dimensional (1-D) Golay- ZCZ sequence set as a special case of the proposed construction.
boolean functions have important applications in cryptography;for example, they have been used as nonlinear components for confusion in block ciphers or stream ciphers. In order to resist known cryptographic attacks, ...
详细信息
This paper introduces a highly scalable in-memory computing architecture for implementing (1) M-operand, N-bit boolean functions, viz., AND/NAND/NOR/OR, (2) any arbitrary boolean function expressed as the sum of produ...
详细信息
Construction and count of 1-resilient Rotation symmetric boolean functions (RSBFs) on $p^{r}$ variables are demonstrated. It is proved that constructions of 1-resilient RSBFs on $p^{r}$ variables are equivalent to sol...
详细信息
Construction and count of 1-resilient Rotation symmetric boolean functions (RSBFs) on $p^{r}$ variables are demonstrated. It is proved that constructions of 1-resilient RSBFs on $p^{r}$ variables are equivalent to solving an equation system. An accurate enumeration formula of all 1-resilient RSBFs on $p^{r}$ variables is also proposed. Some examples are given, and the exact numbers of 1-resilient RSBFs on 8 and 9 variables are obtained respectively.
This paper introduces a highly scalable in-memory computing architecture for implementing (1) $M$ -operand, $N$ -bit boolean functions, viz., AND/NAND/NOR/OR, (2) any arbitrary boolean function expressed as the sum of...
详细信息
ISBN:
(数字)9798331522445
ISBN:
(纸本)9798331522452
This paper introduces a highly scalable in-memory computing architecture for implementing (1) $M$ -operand, $N$ -bit boolean functions, viz., AND/NAND/NOR/OR, (2) any arbitrary boolean function expressed as the sum of products (e.g., F=AB'CD+ABC'D'), (3) $N$ parallel 2-bit XOR operations. Our technique performs operations using a modified 9T SRAM cell-based peripheral circuitry near the SRAM array. Unlike conventional 9T SRAM designs that use the same bitlines for both read and write operations, our design introduces dedicated read lines to separate the read and write paths. This separation improves efficiency and allows in-memory implementation of complex boolean operations. To implement $M$ -operand, $N$ -bit AND/OR operations, the periphery circuit has $N$ compute blocks, each with $M$ columns. The compute block stores the input operands along with configuration bits to choose the correct operation. An equality checker circuit compares the input operands with configuration bits to obtain original or complemented input. The outputs of equality checkers of different columns are connected to a product line, and by DeMorgan's theorem, either AND/NAND or NOR/OR can be realized. Using TSMC 65nm PDK in Cadence Virtuoso, we have demonstrated 64-bit AND/NAND/OR/NOR operations and 64 parallel 2-bit XOR operations. At 0.7V VDD, our design consumes 24.5fJ/bit and operates at 660MHz for XOR operations and 384MHz for other operations.
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced boolean functions. The fundamental characteristic of imbalanced boolean functions is that the proportion of...
详细信息
The strict avalanche criterion (SAC) was introduced by Webster and Tavares [10] in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptogr...
详细信息
The strict avalanche criterion (SAC) was introduced by Webster and Tavares [10] in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptographically strong functions, Zhang and Zheng [ 11] introduced the global avalanche characteristics (GAC). The sum-of-squares indicator related to the GAC is defined as sigma(f) = Sigma(nu)Delta(f)(2)(nu), where Delta(f)(nu) = Sigma(x)(-1)(f(x)+ f(x + nu)). In this paper, we give a few methods to construct boolean functions controlling five good cryptographic properties, namely balancedness, good local and GAC, high nonlinearity and high algebraic degree. We improve upon the results of Stanica [ 8] and Zhang and Zheng [11].
The algebraic immunity of boolean functions is studied in this paper. More precisely, having the prominent Carlet-Feng construction as a starting point, we propose a new method to construct a large number of functions...
详细信息
The algebraic immunity of boolean functions is studied in this paper. More precisely, having the prominent Carlet-Feng construction as a starting point, we propose a new method to construct a large number of functions with maximum algebraic immunity. The new method is based on deriving new properties of minimal codewords of the punctured Reed-Muller code for any n, allowing-if n is odd-for efficiently generating large classes of new functions that cannot be obtained by other known constructions. It is shown that high nonlinearity, as well as good behavior against fast algebraic attacks, is also attainable.
In this paper we study relationships between CNF representations of a given boolean function f and essential sets of implicates off. It is known that every CNF representation and every essential set must intersect. Th...
详细信息
In this paper we study relationships between CNF representations of a given boolean function f and essential sets of implicates off. It is known that every CNF representation and every essential set must intersect. Therefore the maximum number of pairwise disjoint essential sets off provides a lower bound on the size of any CNF representation off. We are interested in functions, for which this lower bound is tight, and call such functions covetable. We prove that for every covetable function there exists a polynomially verifiable certificate (witness) for its minimum CNF size. On the other hand, we show that not all functions are covetable, and construct examples of non-covetable functions. Moreover, we prove that computing the lower bound, i.e. the maximum number of pairwise disjoint essential sets, is NP-hard under various restrictions on the function and on its input representation. (c) 2011 Elsevier B.V. All rights reserved.
暂无评论