scispace - formally typeset
Search or ask a question

Showing papers on "Flip-flop published in 1970"


Patent
James W Foltz1
14 Sep 1970
TL;DR: In this article, a toggle flip-flop suitable for cascaded operation is shown with performs a sequential logic function, where the future state of the flipflop depends on its past occurrences and therefore performs a memory function.
Abstract: A toggle flip-flop suitable for cascaded operation is shown with performs a sequential logic function. More specifically, the future state of the flip-flop depends on its past occurrences and therefore the disclosed flip-flop performs a memory function. This invention realizes the toggle function through an interconnection of two basic functional blocks. One block comprises a memory means and the other an output transfer means. The invention herein described is a circuit utilizing complementary insulated gate field effect transistors which perform the toggle flip-flop function. The circuit requires an input excitation (a voltage) and its inverse, and its operation is independent of the input width and rise time.

14 citations


Patent
18 Mar 1970
TL;DR: In this paper, the authors present an approach to represent input information by the probability that a level in a clocked sequence of logic levels will be ON, and apply the so represented information to the computing element(s) performing digital computation, and convert the stochastically represented outputs of the computation into analogue or digital information valves.
Abstract: 1,184,652. Stochastic computation. STANDARD TELEPHONES & CABLES Ltd. 3 March, 1967 [7 March, 1966], No. 9871/66. Headings G4A, G4D and G4G. [Also in Divisions G1 and G3] General.-A computer assembly comprises one or more digital computing elements, means for representing input information stochastically by the probability that a level in a clocked sequence of logic levels will be ON, means for applying the so represented information to the computing element(s) performing digital computation, and means for converting the stochastically represented outputs of the computation into analogue or digital information valves. Theory.-Analogue variables are presented as probabilities that a specific binary or multilevel event will occur (or generally the probability that a specific configuration representing one of several possible events will occur), and a quantity or event may be scaled as a probability 1 > P > 0, and represented by a sequence of logic levels or states of the inputs and outputs of the computer elements; which representation, e.g. by the adaptive device of Specification 1,099,574, is stochastic since the event or quantity is defined by the statistical properties of a sequence as to the probability that it represents a given event or quantity. In affine symmetric binary representation, analogue quantity -E 0, the states being permanently on or off for maximum or minimum values of V and randomly fluctuating therebetween (or OPEN) for zero. Thus V = [p (ON) - p (OFF)] E 9/ for a sequence in a ternary device wherein p (on) and p (off) are the relative frequencies of on and off conditions and for 0 0 is a scaling factor; Zero being represented by "OFF" and infinity by "ON" and extensible to negative quantities by multiplication by (- 1). In symmetric projective ternary representation, when V#0 and when V 1 = E - V for affine asymmetric binary representation, V 1 = - V for affine symmetric binary and ternary, projective symmetric ternary, hyperbolic ternary, and trigonometric 1 binary V 1 = - for projective binary represen- V tation. Fig. 6 shows a multiplication circuit for afline symmetric binary representation. If + denotes OR switching and juxtaposition indicates AND switching, while a superposed bar indicates a Boolean inverse so that a = 0 if and only if a = 1 a = 1 if and only if a = 0, the levels a, b as shown are applied through inverters to AND gate 1 as #a #b and directly to AND gate 2 as a, b, so that output of OR gate 3 is #a #b + ab which represents the scaled products of the variables represented by the sequences of a and b; the multiplier being an equality gate giving ON output if and only if its inputs are identical. For multiplication of further quantities, such multipliers are cascaded. An affine ternary representation multiplier is identical logically with that of Fig. 6 and (Fig. 1, o, p, not shown). For a multiplier in projective binary representation, a cross coupled flip flop FF (Fig. 3) receiving inputs X, Y is clocked to change over to a value dependent on its prior state and preceding inputs X, Y; the output Z from an OR gate energized from two AND gates receiving X, Y and the flip flop outputs being equal to a new input X if the flip flop output Q is ON, and equal to the complemented new input #Y if the Q input is ON. The device realizes the transformation For multiplication in projective binary representation (Fig. 4) a clocked cross coupled flip flop CCFF receives inputs AB, #AB from AND gates respectively energized from inputs A, B; directly and through inverters in synchronous logic, while in asynchronous logic the clock pulses may be obtained from a local oscillator, or triggered from a change of output if the inputs are mutually exclusive. A further delay flip flop in one input acts as correlation isolator (Fig. 7, not shown). For evaluation of squares and higher powers utilizing plural multipliers, input isolators utilizing clock pulse delay flip flops (Figs. 7, 8, not shown) are inserted to avoid autocorrelation of the inputs, whenever identical signals are applied to multiple paths, in stochastic computation. Autocorrelated sequences may be de-correlated (Fig. 21) by introducing random delays whose maximum delay # autocorrelated depth from noise sources changing over triggers at random intervals to randomize the clock pulses of flip flops FF1, FF2 when the noise exceeds a predetermined level. The random states are transferred to flip flops FF3, FF4. Flip flops FF5, FF6, FF7 connected as a shift register to the direct inverted input hold previous input states at unit, two, and three delay intervals respectively, and flip flops FF3, FF4 gate one of these delayed inputs through three input AND gates and a common OR gate to the output line, so that at each clock pulse a random delayed replication of the input appears on the output. In an adder for symmetric and asymmetric binary affine representation (Fig. 9), a first flip flop FF is triggered from a noise source with grounded inputs, and its output is applied to a second flip flop FF emitting an ON level to AND gate 4 and an OFF level to AND gate 5, or vice versa with equal probability, so that the probability p (Z) of output from OR gate 6 is ¢ (PA + PB) from gates 4, 5. It is shown that the output is 1/k the sum of the inputs for a k input adder, and for 2 inputs a trigger pulse is applied to clock input of a first flip flop when signal from random noise source exceeds a preset threshold, to change its state, since its inputs are in a random condition at the instant of a clock pulse. Random sequences carrying information are generated in a comparator with binary output having a random first input and a fixed or variable second input responsive to input voltage or digital code; the random input containing all levels with equal probability. Fig. 10 shows analogue/stochastic converter generating random sequences comprising a comparator receiving an analogue input and an input from a digital to analogue converter triggered at T by a series of flip flops FF, each in turn triggered on its clock line from a random noise source exceeding a predetermined threshold. The flip flops are in random state so that the D/A converter feeds a random level to the comparator. If at a clock pulse applied to an output flip flop fed from the converter, the analogue input exceeds the random input, the output flip flop is ON and otherwise it is off, so that the output sequence is an affine binary stochastic representation of the analogue input if the D/A conversion is linear. Alternatively (Fig. 11, not shown) for digital input the latter is applied directly to a digital comparator also receiving the random digital output of a series of flip flops

6 citations


Patent
Brink Robert E1
18 May 1970
TL;DR: In this article, a ratioless J-K mode IGFET flip-flop circuit is produced by providing a pair of NOR gates each having one input connected to a source of flipping signals and the other input cross-coupled through a clocked gate to the output of the other NOR gate.
Abstract: A ratioless J-K mode IGFET flip-flop circuit is produced by providing a pair of NOR gates each having one input connected to a source of flipping signals and the other input cross-coupled through a clocked gate to the output of the other NOR gate. In each NOR gate, the flipping signal input may be gated from the output of the same NOR gate to permit operation of the flip-flop circuit in either the J-K mode or the common-input mode.

4 citations


Patent
24 Mar 1970
TL;DR: In this paper, a clockless, ratioless IGFET toggle flip-flop is composed of a FARMOST inverter whose input and output are bridged by the series-connected source-drain circuits of a pair of switching transistors.
Abstract: A clockless, ratioless IGFET toggle flip-flop is composed of a FARMOST inverter whose input and output are bridged by the series-connected source-drain circuits of a pair of switching transistors. The gates of the switching transistors are connected, respectively, to the true rail and the complement rail of a double-rail trigger signal source. The true rail is also connected to the clock input of the FARMOST inverter, and the flip-flop output is taken between the two switching transistors. The operation of the circuit involves the transfer of incremental charges between the inverter output capacitance, the flip-flop circuit output capacitance, and the gate capacitance of the inverter input transistor.

1 citations