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

Corner turn memory address generator

Assignee: Westinghouse Electric Corp
•
Filing: 1981-11-06
•
Granted: 1984-11-20
•
Expires: 2001-11-06
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An address generator for corner turn memories which are dimensioned in integral powers of two is disclosed. A binary adder is utilized to combine the current address with a binary number which specifies the amount to be added to the current address to generate the next address of the corner turn sequence. Limiting the dimensions of the memory to integral powers of two simplifies the circuitry necessary to generate the corner turn address sequence.

Inventors

  • 👤 Martin W. Czekalski

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 22:47
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F9/00; G06F9/06; G06F9/30; G06F9/34; G06F9/345

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 319 words
Circuitry for generating an address sequence, each member of said address sequence specifying a storage location in a digital memory for storing data, said data being arranged as a data matrix having first and second dimensions designated as (M) columns and (N) rows, each element of said data matrix occupying at least one storage location in said memory with the product (M) (N) being an integral power of two, comprising in combination: (a) adder means having at least first and second data input terminals and data output terminals; (b) first storage means comprising a shift register having data input and data output terminals for storing a first digital number, said first digital number comprising a member of said address sequence to produce at said data output terminals said first digital number said storage means further comprising means operable to shift said shift register one bit each time the output signal of said adder means is equal to ((M×N)-1); (c) second storage means for storing a second number to be added to said first digital number to generate a second member of said address sequence; (d) third storage means having data input and data output terminals for storing the current member of said address sequence to produce at said data output terminals of said third storage means said current member of said address sequence; (e) circuit means for (1) coupling said first digital number to said first data input terminals of said adder means, (2) coupling means for coupling said second number to said second data input terminals of said adder, (3) coupling means for coupling said data output terminals of said adder means to said input data terminals of said first storage means, and (f) clock signal means for sequentially storing the output of said adder means in said third storage means, thereby producing sequential members of said address sequence at the output terminal of said third storage means.
Claim 2
Dependent Claim 319 words
Circuitry for generating an address sequence, each member of said address sequence specifying a storage location in a digital memory for storing data, said data being arranged as a data matrix having first and second dimensions designated as (M) columns and (N) rows, each element of said data matrix occupying at least one storage location in said memory with the product (M) (N) being an integral power of two, comprising in combination: (a) adder means having at least first and second data input terminals and data output terminals; (b) first storage means comprising a shift register having data input and data output terminals for storing a first digital number, said first digital number comprising a member of said address sequence to produce at said data output terminals said first digital number said storage means further comprising means operable to shift said shift register one bit each time the output signal of said adder means is equal to ((M×N)-1); (c) second storage means for storing a second number to be added to said first digital number to generate a second member of said address sequence; (d) third storage means having data input and data output terminals for storing the current member of said address sequence to produce at said data output terminals of said third storage means said current member of said address sequence; (e) circuit means for (1) coupling said first digital number to said first data input terminals of said adder means, (2) coupling means for coupling said second number to said second data input terminals of said adder, (3) coupling means for coupling said data output terminals of said adder means to said input data terminals of said first storage means, and (f) clock signal means for sequentially storing the output of said adder means in said third storage means, thereby producing sequential members of said address sequence at the output terminal of said third storage means.
Claim 3
Dependent Claim 36 words
Circuitry in accordance with claim 1 wherein the carry output signal of the most significant bit of said adder means is coupled to the carry input port of the least significant bit of said adder means.
Claim 4
Dependent Claim 23 words
Circuitry in accordance with claim 2 further including a multiplexer for selectively coupling the bits of said shift register to said adder means.
Claim 5
Dependent Claim 29 words
Circuitry in accordance with claim 3 further including a second multiplexer selectively coupling the carry signal of said adder means to the carry input port of said adder means.
Claim 6
Dependent Claim 33 words
Circuitry in accordance with claim 3 further including circuitry responsive to the output of said adder means and to an externally supplied mode signal thereby permitting specific values for ((M×N)-1) to be selected.

References Cited (Backward Citations)

US3969704A Cited
US4028666A Cited
US4037211A Cited
US4167778A Cited
US4093995A Cited
US4120043A Cited
US4131943A Cited
US4080599A Cited
US4166289A Cited
US4189767A Cited
US4393444A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-11-20 1988-05-21 1988-11-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-11-20 1992-05-21 1992-11-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-11-20 1996-05-21 1996-11-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag