← Back to Patent Explorer
US5319759A Expired / Lapsed US ⏱️ 0.0 years remaining

Burst address sequence generator

Assignee: Wistron Corp
•
Filing: 1991-04-22
•
Granted: 1994-06-07
•
Expires: 2011-04-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A burst address sequence generator generates a sequence comprised of 2 n addresses (where n is an integer greater than 1) which are compatible with an INTEL 80486 CPU burst order. A first embodiment of the burst address sequence generator latches an initial address, and uses a binary up counter and exclusive or (XOR) logic to generate the sequence of addresses. A second embodiment of the burst address sequence generator requires a shorter delay time to generate the addresses, and is comprised of a delay unit, an inverter, a counter, and a programmable logic device, such as a PAL or a PLD. Both embodiments are adaptable for use with a dynamic random access memory (DRAM). The design of each embodiment is readily applicable to generate the sequence of addresses necessary to transmit 2 n data units of 2 m bytes per unit, where both m and n are integers greater than 1.

Inventors

  • 👤 Wan-Kan Chan

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 09:59
CPC Classifications
G; G11; G11C; G11C8/00; G11C8/04

Claims Analysis

Total Claims: 2
Claim 1
Independent Claim 296 words
A pulse train burst sequence generator for generating 2 n pulse train address sequences from a starting address, A(0, . . . , m+n-1), where n is an integer greater than 1, comprising: delay means having an input coupled to a column address strobe (CAS#) signal, said delay means producing at its output a delayed copy of the CAS# signal, said delay being greater than the retaining time of a column address; a phase inverter coupled to the delayed CAS# signal, for producing an inverted delayed CAS# signal; an n-bit binary up counter for generating an ascending sequence of numbers, having a first input terminal coupled to a signal for initializing the count to zero, a second input terminal coupled to the inverted delayed CAS# signal for triggering a count operation of the counter, and an output terminal comprising n count signals, C(0, . . . , n-1); a logic device coupled to the n count signals (C(0, . . . , n-1)), n address signals (A(m, . . . , m+n-1)), n row address signals (RA(0, 1, . . . , n-1)), a multiplexer selection signal (MUX), and an address latch enable signal (ALE), for producing n dynamic memory address signals (MA(0, . . . , n-1)), wherein the logic device includes n latches coupled to the n address signal (A(m, . . . , m+n-1)) for storing an initial value of the n address signals (LA(m, . . . , m+n-1)), and wherein further each dynamic memory address signal MA(i) (where i is an integer from 0 to n-1) has the following relationship to the inputs: MA(i)=Mux*RA(i)+/Mux*A(m+1)*/ALE+/Mux*(LA(m+i):+:C(i))*ALE, where "*" represents a logical AND operation, "+" represents a logical OR operation, "/" represents a logical NOT operation, and ":+:" represents a logical EXCLUSIVE OR operation.
Claim 2
Dependent Claim 296 words
A pulse train burst sequence generator for generating 2 n pulse train address sequences from a starting address, A(0, . . . , m+n-1), where n is an integer greater than 1, comprising: delay means having an input coupled to a column address strobe (CAS#) signal, said delay means producing at its output a delayed copy of the CAS# signal, said delay being greater than the retaining time of a column address; a phase inverter coupled to the delayed CAS# signal, for producing an inverted delayed CAS# signal; an n-bit binary up counter for generating an ascending sequence of numbers, having a first input terminal coupled to a signal for initializing the count to zero, a second input terminal coupled to the inverted delayed CAS# signal for triggering a count operation of the counter, and an output terminal comprising n count signals, C(0, . . . , n-1); a logic device coupled to the n count signals (C(0, . . . , n-1)), n address signals (A(m, . . . , m+n-1)), n row address signals (RA(0, 1, . . . , n-1)), a multiplexer selection signal (MUX), and an address latch enable signal (ALE), for producing n dynamic memory address signals (MA(0, . . . , n-1)), wherein the logic device includes n latches coupled to the n address signal (A(m, . . . , m+n-1)) for storing an initial value of the n address signals (LA(m, . . . , m+n-1)), and wherein further each dynamic memory address signal MA(i) (where i is an integer from 0 to n-1) has the following relationship to the inputs: MA(i)=Mux*RA(i)+/Mux*A(m+1)*/ALE+/Mux*(LA(m+i):+:C(i))*ALE, where "*" represents a logical AND operation, "+" represents a logical OR operation, "/" represents a logical NOT operation, and ":+:" represents a logical EXCLUSIVE OR operation.

References Cited (Backward Citations)

US5126975A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag