US4845664A — On-chip bit reordering structure

Claim 1

Independent Claim 367 words

A random access memory chip, comprising: a chip memory organized to hold a plurality of separate blocks of data, with each of said data blocks containing M individual data units in contiguous groups of N data units, where M is greater than N, and N is greater than one, with each data unit having its own unique address within said blocks, said memory having a predetermined wrap protocol, wherein said wrap protocol is a prescribed order for calling for all of said M data units in a given data block starting with a designated target data unit address and proceeding in said prescribed order, wherein a data unit at the end of a data block is contiguous in said prescribed order with a data unit at the beginning of said data block so that said beginning data unit follows said end data unit in said data block; means for randomly addressing a data unit within a given block of data by means of a designated target address; an N data unit chip output parallel interface from said memory; chip register means for holding a given block of data, said chip register means having at least M register stages for holding said M data units of said given data block, wherein said M register stages are grouped into at least a first and a second contiguous groups of N stages each, said chip register means including first gating means for gating said first stage group of N register stages to said N data unit output parallel interface, followed in sequence, by said second stage group and higher groups; and chip steering means for providing in a first set, and in any desired order, the data unit at said target address along with N-1 data units having following contiguous addresses for said memory wrap protocol from within said data block to said first group of N register stages, and for providing each successive set of N data units with following contiguous addresses in said wrap protocol to said second and higher register stage groups, wherein the data unit, if any, following the end data unit in the data block is always the beginning data unit in the data block.

Claim 2

Dependent Claim 367 words

A random access memory chip, comprising: a chip memory organized to hold a plurality of separate blocks of data, with each of said data blocks containing M individual data units in contiguous groups of N data units, where M is greater than N, and N is greater than one, with each data unit having its own unique address within said blocks, said memory having a predetermined wrap protocol, wherein said wrap protocol is a prescribed order for calling for all of said M data units in a given data block starting with a designated target data unit address and proceeding in said prescribed order, wherein a data unit at the end of a data block is contiguous in said prescribed order with a data unit at the beginning of said data block so that said beginning data unit follows said end data unit in said data block; means for randomly addressing a data unit within a given block of data by means of a designated target address; an N data unit chip output parallel interface from said memory; chip register means for holding a given block of data, said chip register means having at least M register stages for holding said M data units of said given data block, wherein said M register stages are grouped into at least a first and a second contiguous groups of N stages each, said chip register means including first gating means for gating said first stage group of N register stages to said N data unit output parallel interface, followed in sequence, by said second stage group and higher groups; and chip steering means for providing in a first set, and in any desired order, the data unit at said target address along with N-1 data units having following contiguous addresses for said memory wrap protocol from within said data block to said first group of N register stages, and for providing each successive set of N data units with following contiguous addresses in said wrap protocol to said second and higher register stage groups, wherein the data unit, if any, following the end data unit in the data block is always the beginning data unit in the data block.

Claim 3

Dependent Claim 93 words

A memory chip as defined in claim 1, wherein said steering means comprises, second gating means associated with each register stage for receiving at least two different data units from said block of data and gating one and only one of said data units to its associated register stage; and means for providing each of said data units in said block of data to at least two different second gating means with the outputs of said at least two different second gating means being connected to register stages in different register state groups.

Claim 4

Dependent Claim 90 words

A memory chip as defined in claim 2, wherein said steering means includes means for programming each of said second gating means by generating control signals in response to a given target address to thereby provide said target address data unit along with said N-1 data units having following contiguous addresses in said memory wrap protocol to said first group of N register stages and for providing each successive set of N data units with following contiguous addresses in said wrap protocol to said second and high register stage groups.

Claim 5

Dependent Claim 54 words

A memory chip as defined in claim 3, wherein said memory includes a buffer for holding the data unit groups of a data block that contains a target address data unit; and wherein said providing means obtains data units from data unit groups held in said buffer for provision to said second gating means.

Claim 6

Dependent Claim 62 words

A memory chip as defined in claim 4, wherein said programming means comprises means for generating signals in accordance with a truth table in response to a target address; and means responsive to said truth table signal generating means for generating TRUE and COMPLEMENT control signals for controlling said second gating means for said M register stages in said chip register means.

Claim 7

Dependent Claim 83 words

A memory chip as defined in claim 5, wherein each of said second gating means comprises: a plurality of AND gates, with a different AND gate for each data unit group in said data block for receiving data therefrom, and with each of said plurality of AND gates receiving a control signal from said programming means; and an OR gate for providing a data unit from one of said plurality of AND gates to the associated register stage for that second gating means.

Claim 8

Dependent Claim 46 words

A memory chip as defined in claim 6, wherein said first gating means comprises a plurality of register gates, one for each register stage group of N stages, said register gates gating the data in said associated register stage groups into said N bit output interface.

Claim 9

Dependent Claim 116 words

A memory chip as defined in claim 1, wherein each data unit in said data unit groups has a data unit position n therein, where n=1,2. . . N; and wherein each of said register stages in said chip register means is associated with a different prescribed data unit position n; wherein said steering means comprises, for each register stage, means for providing a data unit from its prescribed data unit position n from each of said data unit groups in a given data block; and second means for gating one and only one data unit from said providing means to its associated register stage in accordance with said target address to effect said wrap protocol.

Claim 10

Dependent Claim 88 words

A memory chip as defined in claim 8, wherein said steering means includes means for programming each second gating means by generating control signals in response to a given target address to thereby provide said target address data unit along with said N-1 data units having following contiguous addresses in said memory wrap protocol to said first group of N register stages and for providing each successive set of N data units with following contiguous addresses in said wrap protocol to said second and higher register stage groups.

Claim 11

Dependent Claim 54 words

A memory chip as defined in claim 9, wherein said memory includes a buffer for holding the data unit groups of a data block that contains a target address data unit, and wherein said providing means obtains data units from data unit groups held in said buffer for provision to said second gating means.

Claim 12

Dependent Claim 57 words

A memory chip as defined in claim 10, wherein said programming means comprises means for generating signals in accordance with a truth table in response to a target address; and means responsive to said truth table signal generating means for generating TRUE and COMPLEMENT control signals for controlling said second gating means for said M register stages.

Claim 13

Dependent Claim 83 words

A memory chip as defined in claim 11, wherein each of said second gating means comprises: a plurality of AND gates, with a different AND gate for each data unit group in said data bloc for receiving data therefrom, and with each of said plurality of AND gates receiving a control signal from said programming means; and an OR gate for providing a data unit from one of said plurality of AND gates to the associated register stage for that second gating means.

Claim 14

Dependent Claim 47 words

A memory chip as defined in claim 12, wherein said first gating means comprises a plurality of register gates, one for each register stage group of N stages, said register gates gating the data in said associated register stage groups into said N data unit output interface.

Claim 15

Independent Claim 351 words

A method for transferring a block of data held within a random access memory chip to an N data unit output parallel interface, said memory being organized to hold a plurality of said blocks of data, with each of said blocks containing M individual data units in an initial data unit order and in contiguous groups of N data units, where M is greater than N and N is greater than one, with each data unit having its own unique address within said block, said memory having a predetermined wrap protocol, wherein said wrap protocol is a prescribed order calling for said M data units in a given data block starting with a designated target data unit address and proceeding in said prescribed order, wherein a data unit at the end of a data block is contiguous in said prescribed order with a data unit at the beginning of said data block so that said beginning data unit follows said end data unit, comprising the internal chip operations of: randomly addressing a data unit within a given block of data held in a memory chip by means of a designated target address; holding said data block in its initial data unit order within said memory chip; reordering said data unit order within said memory chip so that the data unit with the target address along with the N-1 data units having following contiguous addresses in said memory wrap protocol are held in any order in the first N positions in said data unit order, and reordering so that each successive set of N data units with following contiguous addresses in said wrap protocol is held in the second and higher N position groups in the order, respectively wherein the data unit, if any, following the end data unit in the data block is always the beginning data unit in the data block; and gating said first N positions in said reordered data unit order in said chip memory to said N data unit chip output parallel interface, followed, in sequence, by said second N position group and higher N position groups.

Claim 16

Independent Claim 351 words

A method for transferring a block of data held within a random access memory chip to an N data unit output parallel interface, said memory being organized to hold a plurality of said blocks of data, with each of said blocks containing M individual data units in an initial data unit order and in contiguous groups of N data units, where M is greater than N and N is greater than one, with each data unit having its own unique address within said block, said memory having a predetermined wrap protocol, wherein said wrap protocol is a prescribed order calling for said M data units in a given data block starting with a designated target data unit address and proceeding in said prescribed order, wherein a data unit at the end of a data block is contiguous in said prescribed order with a data unit at the beginning of said data block so that said beginning data unit follows said end data unit, comprising the internal chip operations of: randomly addressing a data unit within a given block of data held in a memory chip by means of a designated target address; holding said data block in its initial data unit order within said memory chip; reordering said data unit order within said memory chip so that the data unit with the target address along with the N-1 data units having following contiguous addresses in said memory wrap protocol are held in any order in the first N positions in said data unit order, and reordering so that each successive set of N data units with following contiguous addresses in said wrap protocol is held in the second and higher N position groups in the order, respectively wherein the data unit, if any, following the end data unit in the data block is always the beginning data unit in the data block; and gating said first N positions in said reordered data unit order in said chip memory to said N data unit chip output parallel interface, followed, in sequence, by said second N position group and higher N position groups.

Claim 17

Dependent Claim 93 words

A method as defined in claim 14, wherein said initial data unit order holding step includes the step of holding said bits from said given data block in successive groups of N data units; and making each data unit in said block of data accessible to at least two different positions in said reordered data unit order, with these a least two positions being in different groups of N data units; and gating one and only one data unit obtained from said making step into said position in said reordered data unit order.

Claim 18

Dependent Claim 48 words

A method as defined in claim 15, wherein said reordering step gating includes the step of controlling the gating for each data unit position in said reordered data unit order by generating a truth table of TRUE and COMPLEMENT control signals in response to a given target address.

Claim 19

Dependent Claim 142 words

A method as defined in claim 14, wherein said initial data unit order holding step includes the step of holding said data units from said given data block in successive groups of N data units, with each data unit in said data unit group having a data unit position n, where n=1,2, . . . N; and wherein each of said positions in said reordered data unit order is associated with a different prescribed data unit position n; and wherein said reordering step comprises the steps of, for each position in said reordered data unit order, obtaining a data unit from its prescribed data unit position n from each of said data unit groups in said given data block; and gating one and only one data unit obtained from said obtaining step to its associated position in said reordered data unit order.

Claim 20

Dependent Claim 46 words

A method as defined in claim 17, wherein said reordering step gating includes the step of controlling the gating for each position in said reordered data unit position by generating a truth table of TRUE and COMPLEMENT control signals in response to a given target address.

Claim 21

Dependent Claim 335 words

A random access memory chip, comprising: a chip memory organized to hold a plurality of separate blocks of data, with each of said data blocks containing M individual data buts in an initial order in contiguous groups of N bits, where M is greater than N, and N is greater than one, with each data unit having its own unique address within said block, said memory having a predetermined wrap protocol wherein said wrap protocol is a prescribed order calling for said M bits to be accessed starting with a target bit address and proceeding in said prescribed order, wherein a bit at the end of a data block is contiguous in said prescribed order with a bit at the beginning of said data block so that said beginning bit follows said end bit in said data block; chip address means for randomly addressing a data bit in a given block of data held in said chip memory by means of a target address; an N bit chip output parallel interface from said chip memory; means for holding said given data block in its initial data bit order within said chip; means for reordering said data bit order into a reordered data bit order so that the bit with the target address along with N-1 bits having following contiguous addresses in said memory wrap protocol are held in any order in the first N positions in said reordered data bit order, and reordering so that each successive set of N bits with following contiguous addresses in said wrap protocol is held in second and higher N position groups, respectively, within said reordered data bit order, wherein the bit, if any, following the end bit in the data block is always the beginning bit in the data block; and first chip gating means for gating said first N positions in said reordered data bit order to said N bit chip output parallel interface, followed, in sequence, by said second N positions and higher N position groups.

Claim 22

Dependent Claim 335 words

A random access memory chip, comprising: a chip memory organized to hold a plurality of separate blocks of data, with each of said data blocks containing M individual data buts in an initial order in contiguous groups of N bits, where M is greater than N, and N is greater than one, with each data unit having its own unique address within said block, said memory having a predetermined wrap protocol wherein said wrap protocol is a prescribed order calling for said M bits to be accessed starting with a target bit address and proceeding in said prescribed order, wherein a bit at the end of a data block is contiguous in said prescribed order with a bit at the beginning of said data block so that said beginning bit follows said end bit in said data block; chip address means for randomly addressing a data bit in a given block of data held in said chip memory by means of a target address; an N bit chip output parallel interface from said chip memory; means for holding said given data block in its initial data bit order within said chip; means for reordering said data bit order into a reordered data bit order so that the bit with the target address along with N-1 bits having following contiguous addresses in said memory wrap protocol are held in any order in the first N positions in said reordered data bit order, and reordering so that each successive set of N bits with following contiguous addresses in said wrap protocol is held in second and higher N position groups, respectively, within said reordered data bit order, wherein the bit, if any, following the end bit in the data block is always the beginning bit in the data block; and first chip gating means for gating said first N positions in said reordered data bit order to said N bit chip output parallel interface, followed, in sequence, by said second N positions and higher N position groups.

Claim 23

Dependent Claim 93 words

A memory chip as defined in claim 19, wherein said initial bit order holding means includes means for holding said bits from said given data block in successive groups of N bits; and means for making each bit in said block of data accessible to at least two different positions in said reordered data bit order, with these at least two position being in different groups of N bits; and second means for gating one and only one data bit obtained from said making means into said position in said reordered bit order.

Claim 24

Dependent Claim 47 words

A memory chip as defined in claim 20 wherein said second gating means includes means for controlling said second gating for each bit position in said reordered bit order by generating a truth table of TRUE and COMPLEMENT control signals in response to said given target address.

Claim 25

Dependent Claim 43 words

A memory chip as defined in claim 21, wherein said reordering means includes a chip register for holding said given block of data, with said register having at least M register stages for holding said M data bits of said given data block.

Claim 26

Dependent Claim 56 words

A memory chip as defined in claim 22, wherein said initial data bit order holding means comprises a buffer for holding N bit groups of said given data block that contains said target address bit; and wherein said providing means obtains bits from bit groups held in said buffer for provision to said second gating means.

Claim 27

Dependent Claim 81 words

A memory chip as defined in claim 23, wherein each of said second gating means comprises: a plurality of AND gates, with a different AND gate for each bit group in said data block for receiving data therefrom, and with each of said plurality of AND gates receiving a control signal from said controlling means; and an OR gate for providing bit data from one of said plurality of AND gates to the associated register stage for that second gating means.

Claim 28

Dependent Claim 131 words

A memory chip as defined in claim 19, wherein said initial bit order holding means includes means for holding said bits from said given data block in successive groups of N bits, with each bit in said bit group having a bit position n, where n=1,2, . . . N; and wherein said reordering means comprises means for associating each position in said reordered bit data order with a different prescribed bit position n; and further includes for each such position, means for obtaining a bit from its associated bit position n from each of said bit groups in said data block in said holding means; and second means for gating one and only one data bit obtained from said obtaining means to said associated position in said reordered bit order.

Claim 29

Dependent Claim 46 words

A memory chip as defined in claim 25, wherein said second gating means includes means for controlling said gating for each bit position in said reordered bit order by generating a truth table of TRUE and COMPLEMENT control signals in response to said given target address.

Claim 30

Dependent Claim 43 words

A memory chip as defined in claim 26, wherein said reordering means includes a chip register for holding said given block of data, with said register having at least M register stages for holding said M data bits of said given data block.

Claim 31

Dependent Claim 55 words

A memory chip as defined in claim 27, wherein said initial data bit order holding means comprises a buffer for holding bit groups of said given data block that contains said target address bit; and wherein said providing means obtains bits from bit groups held in said buffer for provision to said second gating means.

Claim 32

Dependent Claim 81 words

A memory chip as defined in claim 28, wherein each of said second gating means comprises: a plurality of AND gates, with a different AND gate for each bit group in said data block for receiving data therefrom, and with each of said plurality of AND gates receiving a control signal from said controlling means; and an OR gate for providing bit data from one of said plurality of AND gates to the associated register stage for that second gating means.

Claim 33

Dependent Claim 72 words

A memory chip as defined in claim 1, wherein said first gating means comprises a first register gate for receiving and gating said first group of N stages to said N data unit output interface in accordance with a TOGGLE logic signal; and a second register gate for receiving and gating said second group of N stages to said N data unit output interface in accordance with a NOT TOGGLE logic signal.

Claim 34

Dependent Claim 92 words

A memory chip as defined in claim 19, wherein said first chip gating means for receiving and gating said N position groups in said reordered data bit order to said N bit chip output interface comprises a first register gate for receiving and gating said first N positions to said N bit chip output parallel interface in accordance with a TOGGLE logic signal, and a second register gate for receiving and gating said second N positions to said N bit chip output parallel interface in accordance with a NOT TOGGLE logic signal.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1992-07-03	1993-01-02	1993-07-04	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1996-07-03	1997-01-02	1997-07-04	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2000-07-03	2001-01-02	2001-07-04	$7700.00	Window Closed / Lapsed

On-chip bit reordering structure

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag