Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure

Hong Yan Li

doi:10.4028/www.scientific.net/AMM.198-199.1428

Paper Titles

The Study of Coded CPM Schemes
p.1408

Research on Dynamic Job Shop Scheduling Problem Base on Hybrid Genetic Algorithm
p.1413

The Time Synchronization Analytical Study of the Dynamical Multi-Agent
p.1417

Research on Vehicle Optimization Scheduling of Highway Transportation in Logistics Industry Based on GA
p.1422

Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure
p.1428

Applications of the Genetic Algorithm with Steepest Descent Algorithm on Analyzing the Gauss-Type Overlapped Peaks
p.1432

The Method of the Global Positioning Based on RSSI
p.1438

A Novel User Selection Algorithm for Multiuser MIMO-OFDMA System with Zero-Forcing Beamforming
p.1442

Study of Airport Ground Services Scheduling Problem in Airline Industry
p.1447

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 198-199Study on Algorithm of Same Judgment on Nonlinear...

Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure

Abstract:

The nonlinear Boolean function (NBF) is an indispensable tool in design and analysis of cryptosystem. Algorithm of the same judgment on two NBF logical expressions has wide needs in Boolean function application. However, the algorithm is more complicated. In this article, an algorithm of the same judgment on two NBF logical expressions based on ROBDD is put forward. Combined with advantages of the array and hash table, ROBDD expression node data structure Unique Table of NBF is designed. Its time complexity of same judgment is O(6(max(id)-2)).

You might also be interested in these eBooks

Applied Mechanics, Mechatronics Automation & System Simulation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 198-199)

Pages:

1428-1431

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.198-199.1428

Citation:

Cite this paper

Online since:

September 2012

Authors:

Hong Yan Li

Keywords:

Algorithm (GA), Boolean Function, Logical Expression, NBF

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Randal E. Bryant Symbolic manipulation of Boolean functions using a graphical representation. Proceedings of the 22nd ACM/IEEE conference on Design Automation. 1985, 6: 688~694.

DOI: 10.1109/dac.1985.1586017

Google Scholar

[2] Randal E. Bryant Graph-based algorithms for Boolean functions manipulation. IEEE Trans. Comput. 35(8): 677~691, 1986. ISSN 0018-9340.

DOI: 10.1109/tc.1986.1676819

Google Scholar

[3] Datoussaid S, Verlinden O, Conti C. Application of evolutionary strategies to optimal design of multibody systems. Mutibody system dynamic, 2002, 8(4): 393-408.

DOI: 10.1023/a:1021101912826

Google Scholar

[4] Drechsler R, Becker B, Gockel N. Genetic algorithm for variable ordering of OBDDs[J]. IEE Proc-Comput. Digit. Tech , 1996, 143(6): 364-368.

DOI: 10.1049/ip-cdt:19960789

Google Scholar

[5] Drechsler R, Sieling D. 2001. Binary decision diagrams in theory and practice[J]. International Journal on Software Tools for Technology Transfer, 3(2): 112~136.

DOI: 10.1007/s100090100056

Google Scholar