US4787065A - Data processing apparatus providing cyclic addressing of a data store in selectively opposite directions - Google Patents

Data processing apparatus providing cyclic addressing of a data store in selectively opposite directions Download PDF

Info

Publication number
US4787065A
US4787065A US07153526 US15352688A US4787065A US 4787065 A US4787065 A US 4787065A US 07153526 US07153526 US 07153526 US 15352688 A US15352688 A US 15352688A US 4787065 A US4787065 A US 4787065A
Authority
US
Grant status
Grant
Patent type
Prior art keywords
sub
register
address
value
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
US07153526
Inventor
Bahman Barazesh
Luc Mary
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PHILIPS COMMUNICATION D'ENTREPRISE
Original Assignee
Telecommunications Radioelectriques et Telephoniques SA (TRT)
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/34Addressing or accessing the instruction operand or the result ; Formation of operand address; Addressing modes
    • G06F9/355Indexed addressing, i.e. using more than one address operand
    • G06F9/3552Indexed addressing, i.e. using more than one address operand using wraparound, e.g. modulo or circular addressing
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/544Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C8/00Arrangements for selecting an address in a digital store
    • G11C8/04Arrangements for selecting an address in a digital store using a sequential addressing device, e.g. shift register, counter

Abstract

A data processing apparatus in which a memory (10) is accessed at addresses stored in an address regiser (20). An incrementation circuit (38) successively increments or decrements the address stored in the principal register, under the control of an address cycling circuit (22). A pair of auxiliary registers (30, 35) respectively store the minimum and maximum address values to be reached in the principal register, and a comparison circuit (37) determines when the address therein matches the minimum or maximum value. The address cycling circuit, together with the comparison circuit, loads the principal register with the minimum address value when the address therein reaches the maximum value, the address therein thereafter being decremented, and loads it with the maximum address value when the address therein reaches the minimum value, the address therein thereafter being incremented. Such operation is particularly useful for preforming the functions of a fixed or adaptive transversal filter for data transmission, the data stored in the memory being the filter coefficients.

Description

This is a continuation of application Ser. No. 711,544, filed Mar. 13, 1985, now abandoned.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention relates to a data processing apparatus, comprising an addressing arrangement for supplying a memory with address codes originating from a variable-content principal register to which are connected an incrementation circuit for modifying the content of the principal register and a loading circuit. The addressing arrangement comprises two auxiliary registers, one of which serves to store the minimum value to be reached by the content of the principal register while the other auxiliary register serves to store the maximum value to be reached by the principal register. A comparison circuit determines when the content of the principal register reaches the minimum and maximum values.

2. Description of the Related Art

Such a apparatus is widely used, notably for performing the functions of a fixed or adaptive transversal data transmission filter. At successive addresses the memory contains different samples in digital form of the signal to be filtered. For processing of the signal it is necessary to address the memory locations containing these samples cyclically, so as to simulate a shift register in RAM-type memory.

Apparatus of the kind set forth is described in the article "An LSI Signal Processor" by M. Yano, K. Inoue and T. Senba in volume 2 of IEEE International Conference of Acoustics, Speech and Signal Processing, held in Paris, France on May 3, 4, 5, 1982.

In the known apparatus the comparison circuit compares the content of the principal register with that of the auxiliary register containing the maximum value. Consequently, the content of the principal register must always be modified in the same direction in practice.

SUMMARY OF THE INVENTION

The present invention has for its object to provide a data processing apparatus of the kind set forth which enables modification of the content of the principal register in both direction.

To this end, the data processing apparatus in accordance with the invention is characterised in that the loading circuit which cooperates with the comparison circuit serves to load the principal register with the minimum value when it contains the maximum value and with the maximum value when it contains the minimum value.

An important advantage of the invention consists in that the addressing arrangement is very well suitable for operation with processors operating in the pipeline mode. In this mode of operation the results arrive with a delay because of the pipe-line effect. The use of the pipeline mode in filtering algorithms necessitates the execution of two operations on the same data at two different instants, which implies that the principal register must be incremented and decremented at will; therefore, the present invention can be used even in the vicinity of the maximum and minimum address code values, thereby providing increased flexibility for the choice of a memory section to be used.

An important feature of the invention is that the addressing arrangement can cooperate with a microprocessor system comprising an instruction bus and a data bus and is provided with connection means between the output of the principal register and the data bus in order to save the content of the principal register in the memory of the microprocessor system, thus enabling the realization of the functions of several independent transversal filters by means of the same system.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail hereinafter with reference to the accompanying drawings.

FIG. 1 shows a data processing apparatus in accordance with the invention,

FIG. 2 shows the format of a number of instructions for the data processing apparatus, and

FIG. 3 shows a time diagram illustrating the operation of the apparatus shown in FIG. 1.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The data processing apparatus shown in FIG. 1 is intended to cooperate with a microprocessor system 2. This system operates on the basis of instructions transported via a bus BUSI and originating from a register RI; data (results of calculations performed by the system 2) appear on a bus BUSD. The apparatus 1 supplies an address code for a memory 10 on its output 5. This code originates from a register 20 which is referred to as the principal register and whose content can be modified under the control of a loading circuit 22. To this end, a loading signal LAD for the register 20 is supplied from the circuit 22.

The apparatus 1 comprises two auxiliary registers, one of which is denoted by the reference numeral 30 and serves to store the mimimum value wherefrom the content of the principal register can be modified, while the auxiliary register (35) serves to store the maximum value to be reached by the principal register. There is also provided a comparison circuit 37 which cooperates with the loading circuit 22. An input of this circuit 37 is connected to the parallel outputs of the register 20. An incrementation circuit which is formed essentially by an adder 38 is used to vary the value stored in the memory 10 by ±Δ. A latch-type register 39 serves as an interface between the outputs of the register 20 and the output 5 which is connected to the address code input of the memory 10. This register 39 is set to the conductive state by the value "0" of a signal φ1.

In accordance with the invention, the loading circuit 22 cooperating with the comparison circuit 37 serves to load the principal register 20 with the minimum value (stored in the auxiliary register 30) when its content has reached the maximum value, and with the maximum value (stored in the auxiliary register 35) when its content has reached the minimum value.

The loading and incrementation operations are performed by means of a first multiplexer 40 which comprises four inputs E1, E2, E3 and E4. The input E1 is connected to the output S of a dual-input multiplexer 44, the input E2 to the instruction bus BUSI, the input E3 to the data bus BUSD, and the input E4 to the output of the adder circuit 38. The connection of one of these inputs E1 to E4 to the output S of the multiplexer 44 is controlled by two commands MUX 41, MUX 42. The inputs E1 and E2 of the multiplexer 44 are combined with the inputs E1 and E2 of a further multiplexer 46. The inputs E1 of the multiplexers 44 and 46 are connected to the parallel outputs of the register 35, and the inputs E2 of the multiplexers 44 and 46 are connected to the outputs of the register 30. The parallel inputs of the registers 20, 30 and 35 are all connected to the output S of the multiplexer 40. The multiplexers 44 and 46 are controlled by a signal C3 for the multiplexer 46 and by the signal C3 obtained via the logic signal inverter 49. Thus, for one value C3 there is connection between the input E1 and the output S of the multiplexer 46, while a connection is established between the input E2 and the output S of the multiplexer 44 for the other value of C3.

The parallel outputs of the register 20 are connected, as has already been stated, to a first input of the comparator 37 whose second input is connected to the output S of the multiplexer 46.

The invention thus provides the means for cyclically addressing the addresses in memory 10, which means that using simple instructions for incrementing the memory counter by Δ, one progresses from the maximum address value ADM to the minimum address value Adm, i.e. sequentially: ADm, ADm+Δ, . . . ADM -Δ, ADM, ADm, ADm+Δ . . . or from the minimum address value ADm to the maximum address value ADM, ADM-Δ, . . . ADm+Δ, ADm, ADM, ADM-Δ. Δ may have the typical values: 0, 1 . . . .

The adder circuit 38, whose operands are defined, for example by 7 bits, comprises a carry input "R". A value Δ2 is applied to "R" and to the six most significant inputs for an operand, and the seventh input receives the value Δ1. The seven inputs for the other operand are connected to the parallel outputs of the register 20.

The parallel outputs of the register 20 are also connected to the bus BUSD via a group of tri-state amplifiers 52 which are controlled by a signal SVG. The content of the register 20 can thus be saved in a location of a memory MEM forming part of the microprocessor 2. This enables the execution of several independent treatments. In the intended application, the functions of several transversal filters can be performed.

A clock 70 supplies the signals which control the processing speed of the microprocessor 2. From this clock 70 there are derived two periodic signals: the signal φ1 which determines the rate of appearance of the instructions on the bus BUSI and a signal F0 whose frequency is twice that of the former signal. These signals are used by the loading circuit 22. The loading circuit 22 is formed by a programmed logic array 80 which supplies the signals S1 to S6, C3, SVG, Δ1 and Δ2 on the basis of the data transported by the bus BUSI and the signal FO. Three AND-gates 81, 82 and 83 supply the loading signals LMAX, LMIN, and LAD for the registers 35, 30 and 20. Two of the three inputs of these gates receive the signal φ1 and FO while the third input of these gates 81, 82 and 83 receives the signals S1, S2, and S3, respectively. A fourth AND-gate 84 receives the signal S4 on one of its inputs and its other input receives the signal CMP from the output of the comparator 37. Two OR-gates 85 and 86 supply the codes MUX 41 and MUX 42; one input of these gates is connected to the output of the gate 84, the other input of these gates 85 and 86 receiving the signals S5 and S6, respectively.

The array 80 is programmed so that the following logic equations are realized:

S.sub.1 =I.sub.0.I.sub.1.I.sub.2.I.sub.3.I.sub.4

S.sub.2 =I.sub.0.I.sub.1.I.sub.2.I.sub.3.I.sub.4

S.sub.3 =I.sub.0.I.sub.1.I.sub.2.I.sub.28.I.sub.29.I.sub.31 +I.sub.0.I.sub.1.I.sub.3

S.sub.4 =I.sub.0.I.sub.1.I.sub.3.I.sub.25

S.sub.5 =I.sub.0.I.sub.1.I.sub.2.+I.sub.0.I.sub.1

S.sub.6 =I.sub.0.I.sub.1 +I.sub.0.I.sub.1

C.sub.3 =I.sub.0.I.sub.1.I.sub.24

SVG=(I.sub.0.I.sub.1.I.sub.2.I.sub.3.I.sub.4.I.sub.5.I.sub.6.I.sub.8.I.sub.9).φ

Δ.sub.1 =I.sub.0.I.sub.1.I.sub.25.I.sub.24 +I.sub.0.I.sub.1.I.sub.25.I.sub.24

Δ.sub.2 =I.sub.0.I.sub.1.I.sub.24

The symbol "." indicates a logic AND-operation in these equations, and the symbol "+" indicates a logic OR-operation. The variables Ii represent the values of the bits transported by the bus BUSI.

For a proper understanding of the invention, the following Table I states the connections established by the multiplexers 44 and 46 as a function of signal the value of a signal C3, while Table II states the connections established by the multiplexer 40 as a function of the codes MUX 41 and MUX 42.

              TABLE I______________________________________      Connections ConnectionsC.sub.3    multiplexer 46                  multiplexer 44______________________________________0          E.sub.1 -S  E.sub.2 -S1          E.sub.2 -S  E.sub.1 -S______________________________________

              TABLE II______________________________________MUX 41        MUX 42   Connection______________________________________0             0        E.sub.1 -S0             1        E.sub.2 -S1             0        E.sub.3 -S1             1        E.sub.4 -S______________________________________

For an explanation of the operation of the apparatus in accordance with the invention, use is made of the various instructions J0, J1, J2, J3 and J4 shown in FIG. 2. All instructions in question are formed by thirty-two bits denoted as Io to I31.

In order to initialize the apparatus 1, it is necessary to use the instructions J0 and J1 which are characterised by I0 =I1 =I2 =1, I3 =I4 =0 for J0 and by I0 =I1 =I2 =1, I3 =0, I4 =1 for J1, respectively. The instructions J0 and J1 enable the loading of the registers 30 and 35 with the values "MIN" and "MAX", respectively, determined by means of the bits I13 to I19.

For the loading of the register 20 use is made of the instruction J2 which is characterised by I0 =1, I1 =I2 =0, I28 =1, I29 =0, and I31 =1.

The value loaded into the register 20 arrives via the bus BUSD and may be any value between ADMIN and ADMAX at the start of processing.

When the same system is used for the realization of the functions of several transversal filters in timesharing, the value to be stored in register 20 is fetched for each filter from the memory MEM of the microprocessor and at the end of processing the content of the register 20 is returned to the memory for the next period.

The instruction J3 provides incrementation values Δ which are determined by the bit I25 and whose positive or negative sign is given by the value of the bit I24. The instruction J4 is used to save the content of the register 20 in the memory MEM. The instructions J3 and J4 are characterised by I0 and I1 equal to "0" to J3, and I0 =1, I1 =0, I2 =1, I3 =I4 =0, I5 =1, I6 =0 for J4. The operation of the addressing element will now be described with reference to the time diagram shown in FIG. 3.

The instructions J0, J1, J2 . . . J3 . . . J4 arrive in the register R1 shortly after the negative-going edge of the signal φ1.

At the instant to, the instruction J0 is decoded and the signals MUX 41 and MUX 42 assume a value such that the transmission of E2 to S is established inside the multiplexer 40; at the instant t1 the register 30 is loaded with the output data of the multiplexer 40.

During the next cycle, the instruction J1 is decoded and the position of the multiplexer 40 remains in the position for transmitting E2 to its output S. Subsequently, at the instant t2 the register 35 is loaded with the maximum value which can be reached by the register 20. During the next cycle the transmission of E3 to S is established by the multiplexer 40 under the influence of decoding of the instruction J2. At the instant t3 the register 20 is loaded with the output data of the multiplexer 40.

The addressing element is initialized for the supply of addresses as from the instant t3.

The decoding of the instruction J3 results in a code MUX 41 and MUX 42 such that the transmission of E4 to S is established. In the described example the register 20 is allowed to be incremented by positive values. After a given number of incrementation steps, at the instant t4 the register 20 will contain a maximum value which is equal to the value stored in the register 35 and the signal CMP will assume the value 1. For the next instruction it is assumed that the desired incrementation is always positive. This condition, taking into account the value "1" of the signal CMP, results in the minimum loading of the register 20 with the value, which is stored in the register 30, at the instant t5. To this end, the multiplexer 40 establishes the transmission of E1 to S and the multiplexer 44 establishes the connection E2 -S, while the transmission of E1 to S is established inside the multiplexer 46.

When the functions of another filter are to be realized, it will be necessary, as stated before, to save the content of the register 20 in the memory of the microprocessor 2. To this end use is made of the instruction J4 which, when decoded, makes the signal SVG assume the value 1 at the instant t6 ; the outputs of the register 20 are connected to the bus BUSD via the register 39 and the group 52.

Claims (3)

What is claimed is:
1. A data processing apparatus comprising:
a random access memory for storing data in a plurality of addresses therein;
an address register for storing and accessing any address in said memory;
an incrementation circuit connected to said address register for selectively incrementing or decrementing the address stored therein;
a first auxiliary register for storing a minimum address value;
a second auxiliary register for storing a maximum address value;
address comparison means having a first input connected to said address register, a second input selectively connectable to either of said first and second auxiliary registers, and an output at which an equality signal is produced when an address signal at the first input matches an address signal at the second input; and
address cycling means for controlling the cyclic accessing of successive addresses in said memory in opposite directions between said minimum and maximum address values, such address cycling means having first and second operating states such that:
(i) in said first operating state said address cycling means actuates said incrementation circuit to increment the address in said address register; connects the second auxiliary register to said second input of said address comparison means; and, in response to an equality signal produced at the output of said address comparison means, connects the first auxiliary register to said address register to load said minimum address value therein; and
(ii) in said second operating state said address cycling means actuates said incrementation circuit to decrement the address in said address register; connects the first auxiliary register to said second input of said address comparison means; and, in response to an equality signal produced at the output of said address comparison means, connects the second auxiliary register to said address register to load said maximum address value therein;
whereby the data in said random access memory at addresses therein between said minimum and maximum address values may be cyclically accessed in selectively opposite directions.
2. A data processing apparatus as claimed in claim 1, in combination with a microprocessor system comprising an instruction bus, a data bus and a memory; such apparatus further comprising a circuit for loading said auxiliary registers in response to instruction received from the instruction bus and for loading said principal register with data received from the data bus.
3. A data processing apparatus as claimed in claim 2, further comprising connection means between an input of the principal register and the data bus in order to store the content of the principal register in the memory of the microprocessor system.
US07153526 1984-03-13 1988-02-03 Data processing apparatus providing cyclic addressing of a data store in selectively opposite directions Expired - Fee Related US4787065A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
FR8403813A FR2561429B1 (en) 1984-03-13 1984-03-13 Addressing arrangement to provide a memory of address codes
FR8403813 1984-03-13

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US71154485 Continuation 1985-03-13

Publications (1)

Publication Number Publication Date
US4787065A true US4787065A (en) 1988-11-22

Family

ID=9301963

Family Applications (1)

Application Number Title Priority Date Filing Date
US07153526 Expired - Fee Related US4787065A (en) 1984-03-13 1988-02-03 Data processing apparatus providing cyclic addressing of a data store in selectively opposite directions

Country Status (5)

Country Link
US (1) US4787065A (en)
EP (1) EP0155731B1 (en)
JP (1) JPH0812657B2 (en)
DE (1) DE3568098D1 (en)
FR (1) FR2561429B1 (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5257358A (en) * 1989-04-18 1993-10-26 Nec Electronics, Inc. Method for counting the number of program instruction completed by a microprocessor
US5270981A (en) * 1985-07-30 1993-12-14 Kabushiki Kaisha Toshiba Field memory device functioning as a variable stage shift register with gated feedback from its output to its input
US5303389A (en) * 1985-09-11 1994-04-12 Fujitsu Limited Data processing system for processing units having different throughputs
US5319791A (en) * 1988-07-25 1994-06-07 Digital Equipment Corporation System for predicting memory fault in vector processor by sensing indication signal to scalar processor to continue a next vector instruction issuance
US5465305A (en) * 1991-11-08 1995-11-07 Canon Kabushiki Kaisha Character recognition method and apparatus for preparing a plurality of character recognition processes in parallel
US5500930A (en) * 1988-11-04 1996-03-19 Fujitsu Limited System to decode instructions indicating the addresses of control codes and providing patterns to direct an electron beam exposure apparatus
US5511207A (en) * 1986-02-03 1996-04-23 Nec Corporation Program control circuit determining the designated number of times a sequence of instructions is repetitively executed to prevent further execution of a jump instruction
US6351833B1 (en) * 1998-02-18 2002-02-26 Rohm Co., Ltd. Address generator
US20090113159A1 (en) * 2007-10-29 2009-04-30 Mekhiel Nagi N Data processing with time-based memory access

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6228993A (en) * 1985-07-30 1987-02-06 Toshiba Corp Memory device
DE3535215C2 (en) * 1985-10-02 1989-10-26 Nixdorf Computer Ag, 4790 Paderborn, De
US4935867A (en) * 1986-03-04 1990-06-19 Advanced Micro Devices, Inc. Signal processor memory management unit with indirect addressing using selectable offsets and modulo values for indexed address calculations
US4912636A (en) * 1987-03-13 1990-03-27 Magar Surendar S Data processing device with multiple on chip memory buses
NL9401301A (en) * 1994-08-11 1996-03-01 Nederland Ptt Video memory arrangement.
US5825692A (en) * 1994-09-23 1998-10-20 Siemens Nixdorf Informationssysteme Aktiengesellschaft Memory system and method for simultaneously reading and writing data

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3141151A (en) * 1959-03-23 1964-07-14 Burroughs Corp Magnetic tape storage system for digital computers wherein an indication of the number of bits in a message is stored with the message
US4016543A (en) * 1975-02-10 1977-04-05 Formation, Inc. Processor address recall system
US4241416A (en) * 1977-07-01 1980-12-23 Systron-Donner Corporation Monitoring apparatus for processor controlled equipment
US4280199A (en) * 1979-08-03 1981-07-21 Sony Corporation Apparatus for scanning an addressable memory
JPS57114950A (en) * 1981-01-08 1982-07-17 Nippon Telegr & Teleph Corp <Ntt> Loop processing system for program controller
JPS5733688B2 (en) * 1978-04-12 1982-07-19
US4422175A (en) * 1981-06-11 1983-12-20 Racal-Vadic, Inc. Constrained adaptive equalizer
US4462074A (en) * 1981-11-19 1984-07-24 Codex Corporation Do loop circuit
US4628532A (en) * 1983-07-14 1986-12-09 Scan Optics, Inc. Alphanumeric handprint recognition
US4638457A (en) * 1981-06-12 1987-01-20 Siemens Aktiengesellschaft Method and apparatus for the non-volatile storage of the count of an electronic counting circuit

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3602901A (en) * 1969-10-31 1971-08-31 Bunko Ramo Corp The Circuit for controlling the loading and editing of information in a recirculating memory
JPS5247635A (en) * 1975-10-15 1977-04-15 Toshiba Corp Control method for transmitting informat ion
FR2420168B1 (en) * 1978-03-16 1986-09-26 Ibm A pre-processing of instructions in a data processing system
JPS58224497A (en) * 1982-06-22 1983-12-26 Nec Corp Storage device
JPH0442758B2 (en) * 1982-09-24 1992-07-14 Hitachi Ltd

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3141151A (en) * 1959-03-23 1964-07-14 Burroughs Corp Magnetic tape storage system for digital computers wherein an indication of the number of bits in a message is stored with the message
US4016543A (en) * 1975-02-10 1977-04-05 Formation, Inc. Processor address recall system
US4241416A (en) * 1977-07-01 1980-12-23 Systron-Donner Corporation Monitoring apparatus for processor controlled equipment
JPS5733688B2 (en) * 1978-04-12 1982-07-19
US4280199A (en) * 1979-08-03 1981-07-21 Sony Corporation Apparatus for scanning an addressable memory
JPS57114950A (en) * 1981-01-08 1982-07-17 Nippon Telegr & Teleph Corp <Ntt> Loop processing system for program controller
US4422175A (en) * 1981-06-11 1983-12-20 Racal-Vadic, Inc. Constrained adaptive equalizer
US4638457A (en) * 1981-06-12 1987-01-20 Siemens Aktiengesellschaft Method and apparatus for the non-volatile storage of the count of an electronic counting circuit
US4462074A (en) * 1981-11-19 1984-07-24 Codex Corporation Do loop circuit
US4628532A (en) * 1983-07-14 1986-12-09 Scan Optics, Inc. Alphanumeric handprint recognition

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5270981A (en) * 1985-07-30 1993-12-14 Kabushiki Kaisha Toshiba Field memory device functioning as a variable stage shift register with gated feedback from its output to its input
US5303389A (en) * 1985-09-11 1994-04-12 Fujitsu Limited Data processing system for processing units having different throughputs
US5511207A (en) * 1986-02-03 1996-04-23 Nec Corporation Program control circuit determining the designated number of times a sequence of instructions is repetitively executed to prevent further execution of a jump instruction
US5319791A (en) * 1988-07-25 1994-06-07 Digital Equipment Corporation System for predicting memory fault in vector processor by sensing indication signal to scalar processor to continue a next vector instruction issuance
US5500930A (en) * 1988-11-04 1996-03-19 Fujitsu Limited System to decode instructions indicating the addresses of control codes and providing patterns to direct an electron beam exposure apparatus
US5257358A (en) * 1989-04-18 1993-10-26 Nec Electronics, Inc. Method for counting the number of program instruction completed by a microprocessor
US5465305A (en) * 1991-11-08 1995-11-07 Canon Kabushiki Kaisha Character recognition method and apparatus for preparing a plurality of character recognition processes in parallel
US6351833B1 (en) * 1998-02-18 2002-02-26 Rohm Co., Ltd. Address generator
US20090113159A1 (en) * 2007-10-29 2009-04-30 Mekhiel Nagi N Data processing with time-based memory access
US8914612B2 (en) * 2007-10-29 2014-12-16 Conversant Intellectual Property Management Inc. Data processing with time-based memory access

Also Published As

Publication number Publication date Type
FR2561429A1 (en) 1985-09-20 application
JPH0812657B2 (en) 1996-02-07 grant
JP2118382C (en) grant
EP0155731B1 (en) 1989-02-01 grant
FR2561429B1 (en) 1986-09-19 grant
EP0155731A1 (en) 1985-09-25 application
DE3568098D1 (en) 1989-03-09 grant
JPS60206317A (en) 1985-10-17 application

Similar Documents

Publication Publication Date Title
US3537074A (en) Parallel operating array computer
US4713749A (en) Microprocessor with repeat instruction
US4079455A (en) Microprocessor architecture
US5511173A (en) Programmable logic array and data processing unit using the same
US5933855A (en) Shared, reconfigurable memory architectures for digital signal processing
US5987620A (en) Method and apparatus for a self-timed and self-enabled distributed clock
US4901268A (en) Multiple function data processor
US5457805A (en) Microcomputer enabling high speed execution of product-sum operation
US4594661A (en) Microword control system utilizing multiplexed programmable logic arrays
US5426600A (en) Double precision division circuit and method for digital signal processor
US5809552A (en) Data processing system, memory access device and method including selecting the number of pipeline stages based on pipeline conditions
US4627018A (en) Priority requestor accelerator
US5261064A (en) Burst access memory
US4825355A (en) Instruction format for program control type data processing systems
US4456955A (en) Alignment of one operand of a two operand arithmetic unit
US4149242A (en) Data interface apparatus for multiple sequential processors
US5301295A (en) Data processor apparatus and method with selective caching of instructions
US4831573A (en) Programmable integrated circuit micro-sequencer device
US4172288A (en) Binary or BCD adder with precorrected result
US4507748A (en) Associative processor with variable length fast multiply capability
US5721809A (en) Maximum value selector
US3949370A (en) Programmable logic array control section for data processing system
US6145027A (en) DMA controller with split channel transfer capability and FIFO buffering allowing transmit channel to get ahead of corresponding receive channel by preselected number of elements
US4037213A (en) Data processor using a four section instruction format for control of multi-operation functions by a single instruction
US5381360A (en) Modulo arithmetic addressing circuit

Legal Events

Date Code Title Description
FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: TRT TELECOMMUNICATIONS RADIOELECTRIQUES ET TELEPHO

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TELECOMMUNICATIONS RADIOELECTRIQUES ET TELEPHONIQUES T.R.T.;REEL/FRAME:006942/0935

Effective date: 19900120

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: PHILIPS COMMUNICATION D ENTREPRISE, FRANCE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TELECOMMUNICATIONS RADIOELECTRIQUES ET TELEPHONIQUES;REEL/FRAME:007945/0805

Effective date: 19951231

REMI Maintenance fee reminder mailed
LAPS Lapse for failure to pay maintenance fees
FP Expired due to failure to pay maintenance fee

Effective date: 20001122