JPH03207082A - Memory access system - Google Patents

Memory access system

Info

Publication number
JPH03207082A
JPH03207082A JP2001811A JP181190A JPH03207082A JP H03207082 A JPH03207082 A JP H03207082A JP 2001811 A JP2001811 A JP 2001811A JP 181190 A JP181190 A JP 181190A JP H03207082 A JPH03207082 A JP H03207082A
Authority
JP
Japan
Prior art keywords
address
time
cpu
delay
access
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.)
Pending
Application number
JP2001811A
Other languages
Japanese (ja)
Inventor
Shu Yoshida
周 吉田
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.)
NEC Corp
Original Assignee
NEC Corp
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
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP2001811A priority Critical patent/JPH03207082A/en
Publication of JPH03207082A publication Critical patent/JPH03207082A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To secure the decode time of access, to prevent erroneous access from being generated and to perform access at the highest speed by providing a delay circuit to delay an address determine signal to be outputted from a CPU. CONSTITUTION:A delay circuit 4 is provided to delay an address determine signal AS6 to be outputted from the CPU. When the delay time of the circuit 4 is defined as D1, the delay time of a decoder 5 is defined as D2 and time from the determination of an address 7 to the assertion by the AS6 is defined as T, under the condition of T<D2, the D1 becomes the optimum value in the case of D1=D2-T. For this value, under the condition of D1=Da, there is the danger of erroneous access generation in the case of D1<Da and under the condition of D1>Da, the time of D1-Da is made useless. Thus, since the delay time D1 is set at the optimum value, the decode time of the address is secured and the access is performed to the memory at the highest speed.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明はマイクロプロセッサのダイナミックRAMに対
するメモリアクセス方式に関するものである。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a memory access method for dynamic RAM of a microprocessor.

〔従来の技術〕[Conventional technology]

,マイクロプロセッサ(CPtJ)の外部記憶素子とし
てダイナミックRAM (DRAM)を使用する場合、
DRAMはリフレッシュを必要とするので、第2図に示
す様に、リフレッシュアービタを用いてCPUのアクセ
ス要求とリフレッシュ要求とを調停し、タイミングジェ
ネレー夕によってロウアドレスストローブ信号(RAS
)を作戒するメモリアクセス方式が一般に用いられる。
, When using dynamic RAM (DRAM) as an external storage element of a microprocessor (CPtJ),
Since DRAM requires refreshing, a refresh arbiter is used to arbitrate between the CPU's access request and a refresh request, and a timing generator is used to output the row address strobe signal (RAS), as shown in Figure 2.
) is generally used.

第2図において、CPLlREQ14はCPUからのD
RAMに対するアクセス要求、REFREQ8はリフレ
ッシュ回路からのアクセス要求で、リフレッシュアービ
タ1により調停される。タイミングジェネレータ2はC
PUからのアクセスによりDRAMに与えるRAS9及
びコラムアドレスストローブ信号(CAS)を作成する
。タイミング3 ジェネレータlはリフレッシュ時のRASIOを作戒す
る,RAS9及び10はOR回路11を介して出力され
る。DRAMのリフレッシュは、RASオンリリフレッ
シュを使用している.第2図に概念を示したメモリアク
セス方式の従来例のブロック図を第3図に示す. 〔発明が解決しようとする課題〕 上述した従来のメモリアクセス方式は、CPtJのアク
セスピードが遅い場合は何ら問題無いが、CPUを20
MHz以上のクロックで使用し、アクセススピード50
〜100nS程度のDRAMを最高速で駆動する等の場
合、CPUの出力するアドレス7が安定してからアドレ
ス確定信号(AS)6がアサート(assert)する
までの時間が非常に短く、デコーダ5のアドレスデコー
ド出力が確定する以前にAS6がアサー卜してしまい、
誤ったDARMアクセス要求が発生してしまう恐れがあ
る。
In Figure 2, CPLlREQ14 is the D
An access request to the RAM, REFREQ8, is an access request from the refresh circuit, and is arbitrated by the refresh arbiter 1. Timing generator 2 is C
Creates RAS9 and column address strobe signal (CAS) to be given to DRAM by access from PU. Timing 3 Generator 1 controls RASIO during refresh, RAS9 and 10 are outputted via OR circuit 11. DRAM is refreshed using RAS-only refresh. Figure 3 shows a block diagram of a conventional example of the memory access method whose concept is shown in Figure 2. [Problems to be Solved by the Invention] The conventional memory access method described above has no problems when the access speed of CPtJ is slow, but it
Used with a clock of MHz or higher, access speed 50
When driving a DRAM at the maximum speed of ~100 nS, the time from when the address 7 output from the CPU becomes stable until the address confirmation signal (AS) 6 is asserted is very short, and the decoder 5 AS6 asserts before the address decode output is confirmed,
There is a risk that an erroneous DARM access request may occur.

例として32bitCPU  MC68020(モトロ
ーラ社)を20MHzノーウェイトで使用した場合、ア
ドレス確定からASアサートまで最小10nSとなって
おり、この間にアドレス7のデコードを終了しなければ
ならない。
For example, when a 32-bit CPU MC68020 (Motorola) is used at 20 MHz with no wait, the minimum time from address confirmation to AS assertion is 10 nS, and the decoding of address 7 must be completed during this time.

〔課題を解決するための手段〕[Means to solve the problem]

本発明のメモリアクセス方式は、リフレッシュを必要と
するダイナミックRAMを外部記憶素子とし、CPUが
出力したアドレスをデコードしたアドレスデコード結果
とアドレス確定信号との論理槓として随時発生する前記
CPUのアクセス要求と前記リフレッシュの要求とをリ
フレッシュアービタにより調停するメモリアクセス方式
において、前記CPUより出力された前記アドレス確定
信号を遅延させる遅延回路を含んでいる。
The memory access method of the present invention uses a dynamic RAM that requires refreshing as an external storage element, and handles access requests from the CPU that occur from time to time as a logical combination of an address decode result obtained by decoding an address output by the CPU and an address confirmation signal. The memory access method uses a refresh arbiter to arbitrate the refresh request, and includes a delay circuit that delays the address determination signal output from the CPU.

前記アドレス確定信号が前記アドレスデコード結果より
は早くなく最も早く前記リフレッシュアービタに入力す
るように前記遅延回路の遅延時間を設定してもよい. 〔実施例〕 次に、本発明について図面を参照して説明する. 第1図は本発明の一実施例のブロック図である. 本実施例は第3図に示す従来例にAS6を遅延させる遅
延回路4を付加して楕戒されている.遅延回路4の遅延
時間をDI,デコーダ5の遅延時間をD2、アドレス7
が確定してからAS6がアサートするまでの時間をTと
し、T(D2とすると、D1=D2−Tの時がD1の最
適値となる。この値をD1=Daとすると、Di <D
aならび誤アクセス発生の危険があり、DI>Daなら
ばDi−Daの時間は余裕(無駄)となる。現実には若
干の余裕を持たせた設定とすべきである。第4図にDi
>Daとした場合のタイミング図を示す.第4図中のア
クセス要求l2はリフレッシュアービタ1出力としての
CPUからのアクセス要求の波形である.第3図の従来
例における対応するアクセス要求13の波形も第4図に
併記した。デコーダ5の出力のハッチングを施した部分
はデコーダ5出力の確定前にAS6がアサートになって
いるため値が保証されない。
The delay time of the delay circuit may be set so that the address confirmation signal is input to the refresh arbiter earliest, not earlier than the address decoding result. [Example] Next, the present invention will be explained with reference to the drawings. FIG. 1 is a block diagram of an embodiment of the present invention. This embodiment is modified from the conventional example shown in FIG. 3 by adding a delay circuit 4 that delays AS6. Delay time of delay circuit 4 is DI, delay time of decoder 5 is D2, address 7
Let T be the time from when AS6 is asserted to when AS6 is asserted, and let T(D2 be the optimum value of D1.If D1=D2-T is the optimal value for D1.If this value is D1=Da, then Di<D
If DI>Da, the time for Di-Da is wasted (wasted). In reality, it should be set with some leeway. In Figure 4, Di
> Da is shown in the timing diagram. The access request l2 in FIG. 4 is the waveform of the access request from the CPU as the refresh arbiter 1 output. The waveform of the corresponding access request 13 in the conventional example of FIG. 3 is also shown in FIG. 4. The value of the hatched portion of the output of the decoder 5 is not guaranteed because AS6 is asserted before the output of the decoder 5 is determined.

〔発明の効果〕〔Effect of the invention〕

以上述べた様に本発明のメモリアクセス方式によれば、
CPUを高速のクロックで使用しているために、CPU
の出力するアドレスが安定してからアドレス確定信号(
AS)がアサートするまでの,時間が非常に短く、アド
レスデコード出力が確定する以前にAS出力がアサート
してしまう様な場合でも、アドレスのデコード時間を確
保して誤ったアクセスの発生を防止し、AS信号の遅延
時間を最適値に設定すれば、メモリに対する最高速のア
クセスを実現することができる、という効果がある。
As described above, according to the memory access method of the present invention,
Because the CPU is using a high-speed clock, the CPU
After the address output by is stable, the address confirmation signal (
AS) is asserted for a very short time, and even if the AS output is asserted before the address decode output is determined, the address decode time can be secured to prevent erroneous accesses from occurring. , by setting the delay time of the AS signal to an optimal value, it is possible to realize the fastest access to the memory.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の一実施例のブロック図、第2図は一般
的なメモリアクセス方式の概念図、第3図は従来例のブ
ロック図、第4図は第1図に示す実施例及び第3図に示
す従来例のタイミング図である。 1・・・リフレッシュアービタ、 2, 3・・・タイミン グジェレネー夕、 4・・・遅延回路、 5・・・デコーダ、 1 1・・・OR回路.
FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a conceptual diagram of a general memory access method, FIG. 3 is a block diagram of a conventional example, and FIG. 4 is a block diagram of the embodiment shown in FIG. 4 is a timing diagram of the conventional example shown in FIG. 3. FIG. DESCRIPTION OF SYMBOLS 1... Refresh arbiter, 2, 3... Timing generator, 4... Delay circuit, 5... Decoder, 1 1... OR circuit.

Claims (2)

【特許請求の範囲】[Claims] (1)リフレッシュを必要とするダイナミックRAMを
外部記憶素子とし、CPUが出力したアドレスをデコー
ドしたアドレスデコード結果とアドレス確定信号との論
理積として随時発生する前記CPUのアクセス要求と前
記リフレッシュの要求とをリフレッシュアービタにより
調停するメモリアクセス方式において、前記CPUより
出力された前記アドレス確定信号を遅延させる遅延回路
を含むことを特徴とするメモリアクセス方式。
(1) A dynamic RAM that requires refreshing is used as an external storage element, and the CPU's access request and the refresh request are generated at any time as a logical product of the address decoding result obtained by decoding the address output by the CPU and the address confirmation signal. What is claimed is: 1. A memory access method in which a refresh arbiter arbitrates the address determination signal, the method comprising: a delay circuit for delaying the address determination signal output from the CPU.
(2)前記アドレス確定信号が前記アドレスデコード結
果よりは早くなく最も早く前記リフレッシュアービタに
入力するように前記遅延回路の遅延時間を設定した請求
項1記載のメモリアクセス方式。
(2) The memory access method according to claim 1, wherein the delay time of the delay circuit is set so that the address confirmation signal is inputted to the refresh arbiter earliest, not earlier than the address decoding result.
JP2001811A 1990-01-08 1990-01-08 Memory access system Pending JPH03207082A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2001811A JPH03207082A (en) 1990-01-08 1990-01-08 Memory access system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2001811A JPH03207082A (en) 1990-01-08 1990-01-08 Memory access system

Publications (1)

Publication Number Publication Date
JPH03207082A true JPH03207082A (en) 1991-09-10

Family

ID=11511959

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2001811A Pending JPH03207082A (en) 1990-01-08 1990-01-08 Memory access system

Country Status (1)

Country Link
JP (1) JPH03207082A (en)

Similar Documents

Publication Publication Date Title
JP2003114825A (en) Memory control method, memory control circuit using the control method, and integrated circuit loaded with the memory control circuit
JP2704113B2 (en) Data processing device
KR970705141A (en) Method and apparatus for increasing the burst rate of an EDO DRAMS in a computer system
JPH03207082A (en) Memory access system
JP2004013618A (en) Access controller for synchronous semiconductor storage device
JP2923330B2 (en) Memory access control circuit of RISC processor
JPH06325570A (en) Dynamic memory refresh circuit
JP3720872B2 (en) Method for optimizing data transfer between system memory and PCI master device, and system for optimizing memory access time in a computer
JPH01243147A (en) Buffer storage device
KR100293358B1 (en) High speed dram access method
JPS6129489A (en) Controll system of dynamic memory
JPH0636558A (en) Method for refreshing dram
JPH0142017B2 (en)
JP2001175586A (en) Data processor and data processing system
JP2960110B2 (en) RISC processor system
JPH08241586A (en) Dram control device
JPH01232819A (en) Asynchronous signal latch circuit
JPH06119275A (en) Recovery time automatic insertion circuit
JPH05166370A (en) Memory controller
JPH0561762A (en) Memory controller
JPH1011405A (en) Memory access conflict control system
JPH02158852A (en) Memory access control circuit
JPH09297990A (en) Memory refresh control method and memory refresh controller
JP2002334050A (en) Circuit and method for memory control
JPS6215643A (en) Memory control circuit