DE1774606C - Memory arrangement for performing basic logical and arithmetic operations - Google Patents

Description

are, however, required for carry-over processing. 3 a special version of the execution

memory required. In addition, stod between the example.

Registers blocking and release members in the form of Fig. 1 shows a data memory with several logical AND and OR circuits arranged, the word storage locations, each of which from the bit the technical complexity of these addition 5 positions A ₀ to A _n , B ₀ to B _n etc. exists. Each device can be increased and increased significantly. Another word position occupies a row of a matrix, and each, through its operations, will increase the operation time of the data bits in one word in an entire memory adder. element, e.g. B. A _n , stored. The storage elements

US Pat. No. 3,287,703 also provides a row with the common word line 1 a memory array has become known whose io are connected and the elements of the same column Memory cells via interconnected enable lines with the common output line or bit line 2 and blocking elements information is disconnected from one another. By exciting the appropriate can swap. However, to z. B. a simple word and bit line can transfer data to the selected To be able to carry out an and or or function, verbatim or series of the matrix are written this memory array a whole series of 15 den. A chosen passage in a word can be stimulated by excitement Assigned selection circuits, which are queried according to the word line of this position, and the desired operation is controlled one after the other, the word guidance then carries out signals that are the in the become and the rows and columns, respectively, of this memory represent selected word of stored data. Data select one after the other, which allows to carry out by simultaneous excitation of two the simple, logical basic operations several ao matrix rows with the corresponding signals over memory cycles required are. Also suitable to be worn.

This memory organization does not allow a data movement with regard to the columns

Management of both logical and arithmetic or bit positions in a word was previously required

Basic operations. one storage cycle for each shifted bit position

The invention is therefore based on the object as tion. In order to increase the speed of the transmission of such an organization for a memory circuit, several majority arrangements are made to provide logical and arithmetic basic circuits M ₀ to M _n . Perform between each operations and also two output lines at the same time, one can be read and written to these lines and that the circuit is laid. The mode of operation of the majo, the carry processing in arithmetic operational circuits, is carried out via a control line 3 without a time delay. controls. An output signal is generated by a majority

The inventive solution to the problem consists of a power circuit generated when the amplitude of the indentation, that between the bit lines or output signal a predetermined threshold value transitions, which a common shift register steps. The amplitude of the input signal depends and a detection circuit for sensing the 35 from the number of signals obtained by polling Sum are connected downstream, one threshold value or one of the storage elements and through the output signal Majority circuit is arranged which is generated by one of the preceding majority circuit common control line and the output signals.

each of a bit or output line controlled. In the memory shown in FIG

and which, according to the adjacent inputs 40, perform an addition with the majority circuits.

output signals provide an output signal that is applied to the lead and the carry during a storage

update the cycle connected to the output of the threshold value circuit. It will be an addition of the

dene line and on receipt of another word A and B accepted. The carry C on

Threshold value circuit arrives. the bit position χ is given by the Boolean

The advantage of the memory arrangement according to the invention 45 equation: tion consists in having two word lines in parallel

can be queried, whereby in a C _x = A _x - B _x + B _x -C _x _ _x + A _x -C _x ^ ₁ , memory cycle an arithmetic addition of two
multi-digit operands in a memory matrix with

full carry processing is performed 50 in the A _x and B _x bits in words A and B, respectively

be able. on bit position χ and C _x ., the carry

Another advantage is that it is from the next lower bit position. Matrix itself no locking or unlocking means C _x is the function of the majority circuit that must be provided in order to use these arithmetic three expressions A _x , B _x and C _x .,. To generate or execute logical functions. Rather, the word A and the word H are carried out , this very fast execution of an arithmetic is queried or addressed at the same time, and the signals resulting from this add up to the output that only technically very little expense is achieved by linear Overlay. The output threshold switches between the individual bit signals of all majority circuits are also added or output lines of the memory matrix are added. The initial characteristics of the majority are ordered. circuits is shown in FIG. 2 shown. An exit

Embodiments of the invention are generated in the signal when two or three input following explained in more detail with reference to the drawings. signals are present. The control line 3 switches the It shows majority switching on and off. About the line

F i g. 1 a data memory as execution 65 a transfer of the overflow to the lower

Example, place of a word. The delay in

FIG. 2 shows the output characteristics of the forwarding of the carry forward in FIG. 1 only through the

majority switching used and delay in the majority switching.

which can be much lower than the implementation time required for a storage cycle.

After the carry has been updated, a logical sum can be generated with the signals on the output lines 2. The signal levels can have one of the values 0, 1, 2 or 3, which depends on which of the combinations of bits A _x , B _x and C _x ., According to the following table is present:

Signal status

Logical function

A ₁ -B ₁ -C ₁₁ A ₁ B ₁ Z _x . ,
Zi _x F _x C _x .,
Z _x F _x -C _x .,

H AyB ₁ C _x .,

_x - B ₁ V ₁ ,

The logical sum S _x is obtained by sensing the signals 1 and 3 in the detection circuit 4, since S _{x is} given by the expression:

S _x = / I _x P _x C _x , + Z _x B _x -C _x ^ Z _x B _x -C _x .,

+ Ay B ₁ - C _x .,.

One form of memory element is shown in FIG. 3 shown. The element 6 consists of two coupled transistors, the emitters of which are connected to two separate output lines or bit lines 2a and 2b . Each lead connects the corresponding emitters of the elements to the same matrix coil. Each transistor has two emitters. One emitter of each transistor is connected to the bit line 2 a or 2 b and the other to a control line 1 b. The control line 1 α serves to erase the connected series of elements in the memory by lowering the voltage applied to the collectors of the transistors of each cell to zero. The Stcucrleätung Ii? selects a specific row by applying a positive pulse to the connected emitters. Usually the emitters are negatively biased and thus cannot be selected.

Each majority circuit consists of two transistors 7. The base electrodes of the transistors 7 are connected to two different output lines in each column. The collector electrodes are connected to different output lines of the next higher matrix column. Be in operation The final currents of the two transistors 7 are switched on via a connection 3. The two transistors 7 are designed so that a differential voltage corresponding to one one bit is sufficient to to switch on the final current. The final current is equal to the tlcni output current from a polled storage element. The signal in Fig. 3 is given to the lowest value position and provides a DiffefvnUalslfom, which corresponds to a zero bit signal, except when a carry over of the overflow in the lower digit occurs when a two's complement subtraction is performed.

The carry progress can be ended in a time equal to (N-1) ■ d, where d is the switching delay of a pair of transistors and N is the number of bit positions in a memory word.

The switching delay d can be in the order of magnitude of one nanosecond.

The sum S _x can also be used without the in FIG. 1

ίο shown signal discriminator are generated after the carry has been updated. If the storage elements 6 are used, the differential signal on the output lines 2 a and 2 b represents the complement of the carry C _x for each bit position. This complement can be _{stored in a word position, for example C x} (not shown). The sum S _x is represented by the expression:

S _x = C ₁ (A _x + B _x + C _x ., ) + Ay By C _x .,.

C _x . is obtained by querying the WortstelleC _x and transmitting the signal to a shift register, for example Register8 in Fig. 1, as well as displacement of the signals by one bit position to the left and storing the complement of the signal on a word location C _x.

The following majority operations then take place in memory (assuming that words A and B are stored in locations A and B).

Interrogate words A, B and C _x at the same time to perform the majority operation.
Delete word position D and set result of 1 in D by lowering the collector voltage via line la and then increasing the voltage after a reasonable delay. The place D then stores the complement of the majority function of A, B and C _x , namely

A-B + BV ₁ + A ¹ C _x .

3. Interrogate words A, C _x , and D at the same time to perform majority operation.

4. Delete position E and move the result of operation 3 to £.

5. Simultaneously interrogate words B, C _x j and D to perform majority operation.

6. Delete position F and set result of operation 5 to F.

7. Query value D.

8. Delete word position 75 and insert complement from D to 25.

9. Inquire words E, F and 25 at the same time to perform majority operations.

As a result of operation 9, the differential signal on the two bit lines 2 a and 25 represents the sum S _x .

The above algorithm can be accelerated by simultaneously deleting the word positions D, E, F and T> before operation 1.

1 sheet of drawings

Claims (5)

1 2 or majority circuits (Ai) a shifting patent claims: circuit (8) is arranged, which a left or right shift of the stored in the matrix 1. Memory arrangement for the implementation of logical words via the majority circuit (M) shear and arithmetic basic operations with 5 controls. a variety of in the form of a matrix in rows
and columns arranged and row by row in several parallel registers combined Storage cells that contain their information
can exchange with each other, which also io can be read out via a word line, The invention relates to a memory arrangement for while at the same time other memory cells in the implementation of logical and arithmetic basic memory arrangement via another word line operations are read with a large number of in the form of a, characterized thereby, matrix arranged in rows and columns and that between the bit lines or from 15 rows together vias in a plurality of parallel registers (2) to which a common volume bordered memory cells, the contents of their information shift register (8) and a detection circuit can exchange with each other, the downstream to AbfUhlung the sum of the könsind be read out via a word line outside (4), one threshold value or majority switch each, while at the same time other memory cells are arranged in device (M) , which are read by a control line (3) common to the memory arrangement via another word line and the output signals. len in each case a bit or output line (2) In addition to the known memory arrangements that are controlled and the corresponding to the other no exchange of the stored data within lying input signals can carry out an output signal of the memory, are also such deliver, which has become known to the output of the threshold 35, which contains the memory content of the stored value circuit (M) connected line (2) and cher cells of a word line in memory cells that are assigned to the input of a further threshold value of another word line, within circuit (M) arrives. a storage level or a storage arrangement 2. Memory arrangement according to claim 1, can be transmitted there. characterized in that for arithmetic 30 Such a memory arrangement is z. B. by adding two multi-digit operands, two word lines (A and B), which have become known in German patent specification 1 228 309, are addressed at the same time. The memory matrix described therein is admittedly, its associated memory cells equipped with superconducting switching elements, can contain adding operands, so that the output signals 35 supplied by the memory cells also equipped with transistor memory cells become. This memory matrix of several parallel superimposed on the bit lines (2) and on len registers is characterized in that each column of the matrix reaches at least one input for the inputs of the threshold value circuits (M), where it possibly has a carry line and at least one extraction line , form a signal that the threshold value circuits (M) that at least one of the extraction lines runs through a higher-digit direction, and that 40 additional lines are connected in parallel, which have a line that can be reversed for a transfer in the last of its conductivity state to the point of the matrix (5) is present, has resetting, and that the two parallel lines connected to the output of the highest-digit threshold value circuit connected to a current source (My) with the input of the lowest-connected, so that the two parallel-connected digit threshold value circuit (M ₀ ) of the Storage 45 lines add ammen connects a buffer for the matrix. taken from one of the storage elements of the column 3. Memory arrangement according to claims 1 form information. and 2, characterized in that a threshold value circuit (M) consists of two emitter-coupled voltage. However, a matrix of this circuit has the considerable disadvantage that a common control line (3) is fed that the equivalent transistor circuits technically that the collector of one transistor are very expensive and that no exact operation of a bit L- (2a) and the collector of the other is possible with this circuit arrangement if transistors with a bit-O line (2b) are used with 55 transistor storage elements,
while the base of the respective also, the carry through of a transistor (7) with the corresponding bit-O-addition of two words that are stored in adjacent or bit-L-line of adjacent memory cell registers is very tedious and connected . thereby reduces the operating speed of the 4. Memory arrangement according to claim 3, there being 60 total memory. characterized in that a storage cell is also provided by the USA. patent cross-coupled double emitter cell in the 3 111 580 an adder to the immediate Matrix is arranged. Addition of an addend to the content of one of 5. Memory arrangement according to claims 1 several freely selectable within a matrix to 4, characterized in that the bit registers or 65 registers have become known for which output lines are not required (2) is borrowed with a recognition, for the purpose of adding the addend circuit are completed and that between read out. Although this adder the detection circuit and the swell does not require any intermediate storage for the addend,