product iamge

P-Functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed and Microprogrammed Implementations of Discrete Algorithms

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): André Thayse (auth.)
Series: Lecture Notes in Computer Science 175
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1984

Language: English
Pages: 250
Tags: Algorithm Analysis and Problem Complexity; Control Structures and Microprogramming

Introduction....Pages 1-7
Instructions and models of algorithm implementation....Pages 8-19
The synthesis of algorithms....Pages 20-31
The formulation of algorithms synthesis in terms of P-functions....Pages 32-41
The synthesis of (or)-interpreted matrix-instructions with disjoint colums....Pages 42-64
The synthesis of (or)-interpreted matrix-instructions....Pages 65-80
The synthesis of (and)-interpreted matrix-instructions....Pages 81-91
A summary and the conclusion of part I....Pages 92-99
Representation of instructions by means of parallel flowcharts or of Petri nets....Pages 100-115
Synchronous and asynchronous implementation of instructions....Pages 116-128
Programmed implementation of instructions....Pages 129-155
Microprogrammed implementation of instructions....Pages 156-162
A summary and the conclusion of part II....Pages 163-164
Laws acting on P-functions....Pages 165-187
The multivalued extension of P-functions and of their laws....Pages 188-198
The vectorial extension of P-functions and of their laws....Pages 199-216
Finite automata, matrix-instructions and speech recognition....Pages 217-232