US4975839A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Instruction decode method and arrangement suitable for a decoder of microprocessors
Assignee: Hitachi Ltd
•
Filing: 1988-06-09
•
Granted: 1990-12-04
•
Expires: 2008-06-09
Abstract
Abstract An instruction decode method and arrangement suitable for a high-speed microprocessor are disclosed. The instruction decode arrangement comprises a high-speed PLA decoder of small capacity for decoding an instruction word having a small execution cycle, a low-speed PLA decoder of large capacity for decoding an instruction word having a large execution cycle, and a circuit for activating the low-speed PLA decoder to cause it to execute instruction decoding when the high-speed PLA decoder is not permitted for the execution of instruction decoding. Instantaneous current noises generated in the PLA decoders can be mitigated to avoid erroneous operations without degrading averaged decoding performance, thereby permitting the microprocessor to operate at high speeds.
Inventors
- 👤 Yasuhiro Nakatsuka
- 👤 Takashi Hotta
- 👤 Tadaaki Bandoh
- 👤 Yoshiki Fujioka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 20:01
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/22; G06F9/223; G06F9/30; G06F9/30145
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
202 words
A method of decoding instructions in a processor having means for storing an instruction word and decode means, including a first decoder capable of decoding an instruction word in n cycles and a second decoder capable of decoding an instruction word in m cycles, where m and n are integers and m>n, for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word, of a microprogram, said method comprising the steps of: supplying an instruction word in parallel to said first decoder and to said second decoder; decoding in said first decoder an instruction word supplied thereto when said first decoder is capable of decoding said instruction word; generating, by said first decoder, either first information indicative of a capability of said first decoder to decode an instruction word supplied thereto or second information indicative of an incapability of said first decoder to decode said instruction word supplied thereto; starting said second decoder in response to said second information to decode said instruction word in said second decoder; and selecting one of the outputs of said first and second decoders in accordance with said first information and second information, respectively, to deliver out a decoder result.
Claim 2
Independent Claim
202 words
A method of decoding instructions in a processor having means for storing an instruction word and decode means, including a first decoder capable of decoding an instruction word in n cycles and a second decoder capable of decoding an instruction word in m cycles, where m and n are integers and m>n, for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word, of a microprogram, said method comprising the steps of: supplying an instruction word in parallel to said first decoder and to said second decoder; decoding in said first decoder an instruction word supplied thereto when said first decoder is capable of decoding said instruction word; generating, by said first decoder, either first information indicative of a capability of said first decoder to decode an instruction word supplied thereto or second information indicative of an incapability of said first decoder to decode said instruction word supplied thereto; starting said second decoder in response to said second information to decode said instruction word in said second decoder; and selecting one of the outputs of said first and second decoders in accordance with said first information and second information, respectively, to deliver out a decoder result.
Claim 3
Dependent Claim
62 words
An instruction decode method according to claim 1 wherein said first decoder operates to decode only an instruction having an execution cycle which is n or less cycles and said second decoder is permitted to decodes an instruction having an execution cycle which is m or more cycles, so that the decoded result can be obtained at n cycles or m cycles.
Claim 4
Dependent Claim
20 words
An instruction decode method according to claim 1 wherein the m cycles are set to be equal to 3n cycles.
Claim 5
Dependent Claim
41 words
An instruction decode method according to claim 2 wherein said instruction word comprises, at a relatively high frequency, instructions executable at a smaller number of cycles and contains, at a relatively low frequency, instructions executable at a larger number of cycles.
Claim 6
Dependent Claim
39 words
An instruction decode method according to claim 1 wherein address data to be executed over m cycles or more in an address computation processing carried out in parallel with instruction decoding is executed by means of said second decoder.
Claim 7
Dependent Claim
201 words
A processor having means for storing an instruction word and a decode arrangement for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word of a microprogram, said decode arrangement comprising: a first decoder operable to decode an instruction word in n cycles and a second decoder operable to decode an instruction word in m cycles, where n and m are integers and m>n; means coupled to said storing means for supplying an instruction word in common to said first and second decoders; decode status indicating means, responsive to said instruction word, for generating either first information indicative of ability of said first decoder to decode a received instruction word within n cycles or second information indicative of inability of said first decoder to decode said received instruction word within n cycles; start means, responsive to said second information generated from said decode status indicating means, for starting said second decoder to decode said received instruction word; and selection means for selecting a decode output of said first decoder when said first information is generated from said decode status indicating means and a decode output of said second decoder when said second information is generated.
Claim 8
Dependent Claim
201 words
A processor having means for storing an instruction word and a decode arrangement for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word of a microprogram, said decode arrangement comprising: a first decoder operable to decode an instruction word in n cycles and a second decoder operable to decode an instruction word in m cycles, where n and m are integers and m>n; means coupled to said storing means for supplying an instruction word in common to said first and second decoders; decode status indicating means, responsive to said instruction word, for generating either first information indicative of ability of said first decoder to decode a received instruction word within n cycles or second information indicative of inability of said first decoder to decode said received instruction word within n cycles; start means, responsive to said second information generated from said decode status indicating means, for starting said second decoder to decode said received instruction word; and selection means for selecting a decode output of said first decoder when said first information is generated from said decode status indicating means and a decode output of said second decoder when said second information is generated.
Claim 9
Dependent Claim
80 words
A processor according to claim 6 wherein said first decoder comprises a first programmable logic array of high speed and small capacity and said second decoder comprises a second programmable logic array of low speed and large capacity, and further comprising a third programmable logic array for controlling the operation timing of said first and second programmable logic arrays, said first, second and third programmable logic arrays being connected to receive said instruction word from said storing means in parallel.
Claim 10
Dependent Claim
28 words
A processor according to claim 7 wherein said instruction word from said storing means is applied to said second decoder through a shift register operable at n cycles.
Claim 11
Dependent Claim
35 words
A processor according to claim 6 wherein said first decoder comprises a read only memory (ROM) of high speed and small capacity and said second decoder comprises a ROM of low speed and large capacity.
Claim 12
Independent Claim
191 words
A method of decoding instructions in a processor having a buffer for storing an instruction word and a decode unit for fetching and decoding the stored instruction word, said decode unit including a first decoder capable of decoding an instruction word in n cycles and a second decoder capable of decoding an instruction word in m cycles, where m and n are integers and m>n, said method comprising the steps of: supplying an instruction word from said buffer in parallel to said first decoder and to said second decoder; generating an instruction decode start signal; decoding in said first decoder an instruction word supplied thereto from said buffer in response to said instruction decode start signal if said first decoder is capable of decoding the instruction word; generating as a result of decoding of said instruction word by said first decoder either a first signal indicative of a capability of said first decoder to decode said instruction word or a second signal indicative of an incapability of said first decoder to decode said instruction word; and enabling said second decoder to decode said instruction word in response to said second signal.
Claim 13
Independent Claim
191 words
A method of decoding instructions in a processor having a buffer for storing an instruction word and a decode unit for fetching and decoding the stored instruction word, said decode unit including a first decoder capable of decoding an instruction word in n cycles and a second decoder capable of decoding an instruction word in m cycles, where m and n are integers and m>n, said method comprising the steps of: supplying an instruction word from said buffer in parallel to said first decoder and to said second decoder; generating an instruction decode start signal; decoding in said first decoder an instruction word supplied thereto from said buffer in response to said instruction decode start signal if said first decoder is capable of decoding the instruction word; generating as a result of decoding of said instruction word by said first decoder either a first signal indicative of a capability of said first decoder to decode said instruction word or a second signal indicative of an incapability of said first decoder to decode said instruction word; and enabling said second decoder to decode said instruction word in response to said second signal.
Claim 14
Dependent Claim
163 words
A processor having means for storing an instruction word and a decode arrangement for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word, of a microprogram, said decode arrangement comprising: a first decoder operable to decode an instruction word in n cycles and a second decoder operable to decode an instruction word in m cycles, where n and m are integers m>n; means coupled to said storing means for supplying an instruction word in common to said first and second decoders; decode status indicating means, responsive to said instruction word, for generating either first information indicative of ability of said first decoder to decode a received instruction word within n cycles or second information indicative of inability of said first decoder to decode said received instruction word within n cycles; and start means, responsive to said second information generated from said decode status indicating means, for starting said second decoder to decode said received instruction word.
Claim 15
Dependent Claim
163 words
A processor having means for storing an instruction word and a decode arrangement for fetching the stored instruction word to generate a head address, corresponding to the fetched instruction word, of a microprogram, said decode arrangement comprising: a first decoder operable to decode an instruction word in n cycles and a second decoder operable to decode an instruction word in m cycles, where n and m are integers m>n; means coupled to said storing means for supplying an instruction word in common to said first and second decoders; decode status indicating means, responsive to said instruction word, for generating either first information indicative of ability of said first decoder to decode a received instruction word within n cycles or second information indicative of inability of said first decoder to decode said received instruction word within n cycles; and start means, responsive to said second information generated from said decode status indicating means, for starting said second decoder to decode said received instruction word.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-12-03 | 1994-06-04 | 1994-12-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-12-03 | 1998-06-04 | 1998-12-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-12-03 | 2002-06-04 | 2002-12-04 | $7700.00 | Window Closed / Lapsed |