A FEW PROBABILISTIC PROPERTIES OF MODULAR CIRCUITS

Abstract

Output probabilities of finite-state-machine elements are studied when the input of the machine elements is a random process. Delay element, modulo m adder and modulo m multiplier are considered as the machine elements. A new approach to the problem is made by defining the transformation matrices T and Ua for a modulo m adder and a modulo m multiplier respectively. By using these matrices, the output probabili ties of the machine and the stochastic matrix of the output are given in explicit expressions, assuming that the input process is a finite state, time-invariant Markov process. A few examples of the combinatorial circuit of these elements are also studied.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 30, 1962
Accession Number
AD0403466

Entities

People

  • H. Kaneko

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Circuits
  • Communication Systems
  • Contracts
  • Data Processing
  • Department Of Defense
  • Digital Communications
  • Digital Computers
  • Equations
  • Equations Of State
  • Government Procurement
  • Governments
  • Markov Processes
  • Permutations
  • Probability
  • Stochastic Processes
  • United States

Fields of Study

  • Mathematics

Readers

  • Electrical Engineering
  • Linear Algebra
  • Statistical inference.