Patent US873420A successfully refreshed from Google Patents.
Patent US5355462A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5355462A Expired / Lapsed US ⏱️ 0.0 years remaining

Processor data memory address generator

Assignee: Alcatel CIT SA
•
Filing: 1991-09-19
•
Granted: 1994-10-11
•
Expires: 2011-09-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A processor data memory address generator is adapted to receive a control word from a program controller receiving instructions from a program memory addressed by an instruction counter and producing a program signal addressed to an arithmetic and logic unit. The instruction counter is incremented by a clock signal and reset by the program controller. The control word comprises location information and selection information and the address generator is adapted to produce a data address having a first part comprising bits of said location information and a second part formed by a selected set of bits of the address of the current instruction identified by said selection information.

Inventors

  • 👤 Emmanuel Rousseau
  • 👤 Alain Chateau

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 08:39
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/34; G06F9/342; G06F9/355; G06F9/3552; G06F9/38; G06F9/3877; G06F9/3879

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 124 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information.
Claim 2
Dependent Claim 124 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information.
Claim 3
Dependent Claim 27 words
A processor data memory address generator according to claim 1 wherein said second part of said data address represents the lower order bits of said data address.
Claim 4
Dependent Claim 27 words
A processor data memory address generator according to claim 1 wherein said second part of said data address is formed by consecutive bits of said instruction address.
Claim 5
Dependent Claim 44 words
A processor data memory address generator according to claim 1 wherein said selection information comprises an extent code specifying the variable number e of bits of said second part wherein e is an integer greater than or equal to zero and less than b.
Claim 6
Dependent Claim 157 words
A processor data memory address generator according to claim 4 further comprising a first group of m multiplexers, where m is equal to the largest possible value of the variable number e, each of said multiplexers receiving on a first input a selected bit of said location information and on a second input a selected bit of said instruction address, and wherein the nth multiplexer, for any value of n between 1 and m, inclusive, provides as an output, the signal applied to a first input if n is greater than e or the signal applied to a second input otherwise, said second part of the data address being established on the basis of the output signals of said multiplexers of order e or lower and said first part of said address being established on the basis of the non-selected bits of said location information and the output signals of said multiplexers of order greater than e.
Claim 7
Dependent Claim 25 words
A processor data memory address generator according to claim 5 further comprising a decoder producing from said extent code selection signals to control said multiplexers.
Claim 8
Dependent Claim 73 words
A processor data memory address generator according to claim 5 wherein an indexing set comprises at least some of the bits of said instruction address each assigned an order number, and wherein said selection information further comprises an operation code specifying an order f greater than zero, indicating that said second part of the data address is made up of e bits of said indexing set of order numbers from f to f+e-1.
Claim 9
Dependent Claim 108 words
A processor data memory address generator according to claim 7 further comprising a second group of m multiplexers of which the nth multiplexer, for any value of n between 1 and m, inclusive, receives on an input of order number k, where k is greater than or equal to 1, the bit of order number (n+k-1) of said indexing set, and has an output connected to the second input of the nth multiplexer of said first group of m multiplexers, wherein all the multiplexers of said second group provide as an output, the signal applied to their input of order number f by means of said operation code.
Claim 10
Dependent Claim 188 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information to increment said data address during the repetition of a loop of 2 p instructions, the second part of the data address being incremented by one unit each time said loop is executed and being made up of e bits of the instruction address form order p to p+e-1, where p is greater than zero, and e is greater than or equal to zero.
Claim 11
Dependent Claim 188 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information to increment said data address during the repetition of a loop of 2 p instructions, the second part of the data address being incremented by one unit each time said loop is executed and being made up of e bits of the instruction address form order p to p+e-1, where p is greater than zero, and e is greater than or equal to zero.
Claim 12
Dependent Claim 195 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information to modularly change said data address during the repetition of a loop of 2 p instructions, the second part of the data address being incremented by 2 q units on each execution of said loop where q is less than p, and comprising e bits of the instruction address from order (p-q) to p-q+e-1, where p is greater than zero, and e and q are greater than or equal to zero.
Claim 13
Dependent Claim 195 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information to modularly change said data address during the repetition of a loop of 2 p instructions, the second part of the data address being incremented by 2 q units on each execution of said loop where q is less than p, and comprising e bits of the instruction address from order (p-q) to p-q+e-1, where p is greater than zero, and e and q are greater than or equal to zero.
Claim 14
Dependent Claim 209 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected sets of bits being identified by said selection information to circularly increment said data address during the repetition of a loop of 2 p instruction r times, the second part of the data address being equal to the number of executions of said loop already done modulo a specific number 2 s , r being the product of an integer u and 2 s , said second part comprising s bits of the instruction address of order p to (p+s-1), where p is greater than zero, and s is greater than or equal to zero.
Claim 15
Dependent Claim 209 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected sets of bits being identified by said selection information to circularly increment said data address during the repetition of a loop of 2 p instruction r times, the second part of the data address being equal to the number of executions of said loop already done modulo a specific number 2 s , r being the product of an integer u and 2 s , said second part comprising s bits of the instruction address of order p to (p+s-1), where p is greater than zero, and s is greater than or equal to zero.
Claim 16
Dependent Claim 225 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information by circulary modularly change said data address during the repetition of a loop of 2 p instruction r times, the second part of the data address being the product of a number 2 q and the number of executions of said loop already done modulo a particular number 2 s , q being less than p, and r being the product of an integer u and 2 s , said second part comprising s bits of the instruction address of order (p-q) to (p-q+e-1), where p is greater than zero, and s and q are greater than or equal to zero.
Claim 17
Dependent Claim 225 words
A processor data memory address generator receiving an instruction address from an instruction counter and a control word from a program controller which receives instructions from a program memory addressed by said instruction counter, said program controller producing a program signal addressed to an arithmetic and logic unit, said instruction counter being incremented by a clock signal and reset by said program controller, wherein said control word comprises location information and selection information and said address generator comprises means for producing a data address b bits in length having a first part comprising bits of said location information and a second part formed by a selected set of bits of the instruction address, said selected set of bits being identified by said selection information by circulary modularly change said data address during the repetition of a loop of 2 p instruction r times, the second part of the data address being the product of a number 2 q and the number of executions of said loop already done modulo a particular number 2 s , q being less than p, and r being the product of an integer u and 2 s , said second part comprising s bits of the instruction address of order (p-q) to (p-q+e-1), where p is greater than zero, and s and q are greater than or equal to zero.

References Cited (Backward Citations)

US4202035A Cited
DE2849382A1 Cited
US4521858A Cited
US4935867A Cited
EP0303009A2 Cited
US4833602A Cited
US4908748A Cited
US5032986A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-10-10 1998-04-11 1998-10-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-10-10 2002-04-11 2002-10-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-10-10 2006-04-11 2006-10-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag