BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

Similar documents
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

BOOLEAN MATHEMATICS: GENERAL THEORY

Python Programming: An Introduction to Computer Science

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Appendix A. Use of Operators in ARPS

Chapter 3 Classification of FFT Processor Algorithms

Data Structures and Algorithms. Analysis of Algorithms

Cubic Polynomial Curves with a Shape Parameter

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Elementary Educational Computer

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Neural Networks A Model of Boolean Functions

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Analysis of Algorithms

Ones Assignment Method for Solving Traveling Salesman Problem

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Force Network Analysis using Complementary Energy

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

An Efficient Algorithm for Graph Bisection of Triangularizations

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Matrix representation of a solution of a combinatorial problem of the group theory

Fast Fourier Transform (FFT) Algorithms

An Efficient Algorithm for Graph Bisection of Triangularizations

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

How do we evaluate algorithms?

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

arxiv: v2 [cs.ds] 24 Mar 2018

CAEN Tools for Discovery

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Algorithms for Disk Covering Problems with the Most Points

COMP Parallel Computing. PRAM (1): The PRAM model and complexity measures

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

The identification of key quality characteristics based on FAHP

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Efficient Hardware Design for Implementation of Matrix Multiplication by using PPI-SO

COP4020 Programming Languages. Functional Programming Prof. Robert van Engelen

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

ABSTRACT OF PHD THESIS

3D Model Retrieval Method Based on Sample Prediction

Generation of Distributed Arithmetic Designs for Reconfigurable Applications

Computer Systems - HS

Package popkorn. R topics documented: February 20, Type Package

An Estimation of Distribution Algorithm for solving the Knapsack problem

Lecture 1: Introduction

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

The Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Stereo matching approach based on wavelet analysis for 3D reconstruction in neurovision system 1

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Heaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

Higher-order iterative methods free from second derivative for solving nonlinear equations

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

ALU Augmentation for MPEG-4 Repetitive Padding

1 Enterprise Modeler

Goals of the Lecture UML Implementation Diagrams

EE123 Digital Signal Processing

Chapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

Mathematical simulation of control system in Modal Vision Studium

Primitive polynomials selection method for pseudo-random number generator

High-Speed Computation of the Kleene Star in Max-Plus Algebra Using a Cell Broadband Engine

Lecture 1: Introduction and Strassen s Algorithm

CNN-based architecture for real-time object-oriented video coding applications

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Comparative Study on Modeling Methods for Switched Reluctance Machines

why study sorting? Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms.

Data diverse software fault tolerance techniques

LU Decomposition Method

A PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT

Counting the Number of Minimum Roman Dominating Functions of a Graph

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

State-space feedback 6 challenges of pole placement

Pattern Recognition Systems Lab 1 Least Mean Squares

Assignment Problems with fuzzy costs using Ones Assignment Method

1. SWITCHING FUNDAMENTALS

A Boolean Query Processing with a Result Cache in Mediator Systems

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

T Shaped Fractal Geomerty Based Micro Strip Patch Antenna

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

Transcription:

MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research Tomsk State Uiversity, 634050, Tomsk, Russia Natioal Research Tomsk Polytechic Uiversity, 634050, Tomsk, Russia Abstract. High performace computig eviromet sythesis with parallel architecture recostructig throughout the process itself is described. Sythesized computatioal medium ivolvig Boolea differetial equatio calculatios so as to fuctio i real-time image processig. Automato imagig was illustrated ivolvig the rearragemet of every processig medium elemet to calculate the partial differetials of -th order i respect to Boolea fuctio variables. The method of obtaiig settig codes for each elemet was also described. A example i calculatig d -order Boolea derivative to two differetials i respect to Boolea fuctios, depedig o three argumets withi the recostructible computatioal medium of 8x8 processig elemets was give. 1 Itroductio Architectig updated robotic systems fuctioig autoomously i a-priori ukow medium ivolves directly positioed i- robot computer systems i order to process a cosiderable body of sematic iformatio. Real-time processig of this iformatio attributable to classical computig architecture results i icreasig robot weight ad structure desig. Oe possible solutio of above-metioed problem could be applyig the recofigurable computig medium (RCM) [1 6]. Hardware-i-the-loop RCM desig ad its fuctioig is based o grouped evaluator model: S =< C, G, A( P( D)) >, where, С = {c i } set of processig elemets c i, i = 0, 1,, N 1; G itercomputig likage matrix structure (grid); A processig elemet algorithm set C iterrelated with G, i hardware parallel support program P of data processig D. Grouped evaluator costruct H =< C, G > reflects the followig architectural cocept: 1) parallelism i processig (parallel processig elemet algorithm set C itercomputig with G); ) programmability structure; 3) homogeeity of structure H (homogeeity of processig elemets c i C ad macrostructure G). The Authors, published by EDP Scieces. This is a ope access article distributed uder the terms of the Creative Commos Attributio Licese 4.0 (http://creativecommos.org/liceses/by/4.0/).

MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 Let's cosider the case whe fuctioig processig elemet algorithm c i is the basis {AND, OR, NOT}, thus acquirig the hardware ivariace property. Algorithm desig i terms of solvig oe specific problem-orieted task via RCM, bearig o this limitatio is associated with sigificat peformace. This paper describes the sythesis of such RCM for Boolea differetiatio implemetatio ad itegratio. Problem statemet Usually, biary data is represeted as {0, 1} ad would look like arbitrary fiite dimesio matrix. By zero extesio it will be represetable as matrix R, where positive iteger umber. This matrix R could be iterpreted as microsequecig or code of Boolea fuctio system, biary image (aimated obect frame), dyamic biary system state at the preset samplig time, operatig techical system compoet iteractio graph. Further, this matrix will be cosidered as a system of Boolea fuctios (BF) f ( X ), = 0, 1, variables x 1, x,, x, Each BF has its ow vector value Τ (0) (1) ( 1) x x x X = K, where Τ traspositio symbol; elemet () t x (0,1) -value t1 t of BF for set of variables x, x,, ; t 1, t,, t biary represetatio parameter 1 t x 0 1 t = 0, 1; x = x, x = x. The system of BF f (Х), havig its ow vector value X, ca be writte i the form of the matrix R = X X 1 1 X0. I [7] the algorithm of Boolea derivative calculatios by private variable is: ( k ) X ( k ) () (1) = D D D X (mod ), (1) x1 x x k () i D = I i 1 i I. () where I idetity matrix. The aalysis of the algorithm shows that RCM processig elemet should implemet oe of the followig automato-based display image (Figure 1). Figure 1. Automato-based display images.

MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 Applyig automato-structured method [5] RCM fuctioig processig elemet algorithm could be sythesized: f1 = ( xyz ) + ( xyz 1 ) + ( xz 1 3) + ( xyz z3) + ( xyz 1 z3), f = x, f = xzzz + xzzz + xzzz + yzzz + yzz + yzz + yzzz f = xzzz + xzz + yzz + yzz + yzz. ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 3 1 3 1 3 1 3 3 3 1 3 4 1 3 1 3 1 1 3 1 3 where, x 1, x, y 1, y data iputs; f 1,, f 4 outputs; z 1,, z 3 setup iputs of RCM processig elemet [3, 5]. Realizatio of algorithm (1) ito RCM via evaluators, implemetig automato images (fig.1) are plotted as the matrix structure of computig-based system. Determiig the matrix Z cofiguratio is based o the settig up each processig elemet withi oe possible automato image: Z= M i (3) i = ( Ao I ) k, M 1 1 = ( ) k T 3 = ( ( ) ) k3 M AoI o H, M Ao I o H, M = A k, A = D... D D (mod ) (4) 4 4 ( k ) () (1) where, o Hadamard product; I x idetity matrix; H x upper triagle matrix of oe; vertical overlie ( ) meas x-elemet iversio i biary matrix; Т traspositio matrix symbol; k i automato image code. 3 Example It is required to calculate Boolea secod-order derivative with respect to the BF variables x 1 ad x, as i the followig expressio fi ( X ) = x 1 x x 3. (5) To implemet Boolea derivative calculatio by private variable four basic evaluator elemets are ecessary (fig. 1). Each elemet is deoted by k i (i = 1,,, 4). Value k i correspods to each automato code of its cofiguratio, itroduced as decimal umeratio (as follows k 1 = ; k = 3, k 3 = 4, k 4 = 5). We apply i (5) all possible argumet values: X 0 1 0 1 0 1. = [ ] T Accordig to (3) ad (4) the followig ca be obtaied: A = =., 3

MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 5 3 5 3 5 3 5 5 5 3 5 3 5 3 4 5 5 3 5 3 5 5 4 5 5 3 5 3 Z =. 4 5 4 5 5 3 5 5 4 5 4 5 5 3 4 5 4 5 4 5 5 5 4 5 4 5 4 5 Obtaied matrix of Z cofiguratio correspods to RCM, depicted i Figure. Figure. RCM cofiguratio. Havig geerated the sigals correspodig to (6) the result providig the BF calculatio by private variables (5) x 1 ad x is recorded o data iputs of obtaied RCM ad o medium retur: X T = [ 1 0 1 0 1 0 1 0]. x x 1 4 Coclusio RCM algorithms were sythesized to provide the calculatio of BF private variables. These algorithms meet the specified requiremets applicable for VLSI process. I this case, such algorithms ivolve regular ad localized computatio commuicatio, orieted o pipelie computatios. Proposed algorithm cofiguratio (3), ivolvig specific settig code iputs for each RCM processig elemet, is resposible of calculatig Boolea derivatives to differet argumats withi oe ad the same RCM. Accordig to the referece descriptio, the sythesis method of specific Boolea fuctio evaluators is based o the operatig diagram of the previously selected Boolea 4

MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 base (AND, OR, NOT) ad is housed i sythesized-based medium. It should be oted that the prescribed fuctioal diagram or logical etwork withi selected medium is 'fitted'. Obtaied algorithms of operatig RCM (recostructible computatioal medium) could be the basis of developig special-purpose evaluators producig basic operatios of morphologically processig digital images. Ackowledgmet The followig research has bee fiacially supported by Russia Foudatio for Basic Research (RFBR) 16-07-01138 А Itelliget Recofigurable Cotrol Systems, Navigatio ad Image Processig for Autoomous Mobile Robots. Refereces [1] I. Kulagi, A. Pazikov, M. Kurosov, Lecture Notes i Computer Sciece 951, 405 (015) doi: 10.1007/978-3-319-1909-7_39 [] N. Maa, Sh. Wag, Ali S. Mohsi, X. Cui, Yu. Peg, MATEC Web of Cofereces 45, 05001 (016) doi: 10.1051/mateccof/0164505001 [3] S.V. Shidlovskii, J. Comp. Sys. Sci. Iter. 45, 8 (006) doi: 10.1134/S106430706001. [4] A.I. Kalyaev, I.A. Kalyaev, J. Comp. Sys. Sci. Iter. 55, 11 (016) doi: 10.1134/S106430716010081 [5] I.A. Kalyaev, I.I. Levi, A.I. Dordopulo, L.M. Slaste, IFAC Proceedigs Volumes 46, 10 (013) doi: 10.318/013095-3-CZ-303.00009 [6] D.V. Shashev, S.V. Shidlovskiy, Optoelectroics, Istrumetatio ad Data Processig 51, 7 (015) doi: 10.3103/S8756699015030036 [7] S. Jaushkevich, D. Bokhma, R. Stakovich, G. Tosic, V. Shmerko, Avtomatika I Telemekaika (Joural of Automatio & Remote Cotrol) 6, 155 (004). 5