This correspondence presents the remainder-quotient (RQ)-algorithm for the resolution of Boolean equations. If [mi]w = w ( xkl, xj2, ... XkN) = 1[/mi] is the Boolean equation equivalent to the system whose solution is desired, we want to determine the Boolean functions [mi]xk, = Xkp ( xhj+1,... -xkN)[/mi] with p = 1,2,... j, which verify the equivalent equation. We start with the function w given by its minterm numbers and performing usual divisions we determine the solutions in the domain of the numerical transform (NT), introduced in a previous paper. An alternative way is also presented, which is advantageous when the number of minterms in the equivalent equation is large. Examples which show the great systematization of the methods are given.

A new type of analog-to-digital converter is described. This converter presents one analog input and several outputs with two possible states. Each time, only one output is activated. The converter is built up with the following elements: controlled oscillator, saturated tuned amplifiers, detectors, and inverters. The converter principle is: a voltage input E1feeds a controlled oscillator whose output volttages are E1sin wt and -E sin wt, with E constant. These voltages feed the two sides of a voltage divider made up of resistors of convenient values. As the two voltages mentioned above are in phase opposition, one point of the divider, for each E1, presents zero potential. The detection of this zero potential point furnishes an activated output, for each input E1. A practical realization of the converter, all transistorized, is presented by the author.