Fifo memory system.

0001This invention relates to first-in, first-out (FIFO) memory systems of the kind including a RAM memory, write pointer register means adapted to store the address of the next data element to be written into said RAM memory, and read pointer register meanns adapted to store the address of the next data element to be read from said RAM memory.

0002The invention also relates to a method for buffing data between two buses.

0003A FIFO memory system of the kind specified is known from US Patent No. 4,751,671. The known memory system includes an address comparator which provides an output signal when the FIFO memory is either full or empty. The known system has the disadvantage that if the FIFO buffer becomes full, processing operations in a data processing system including the FIFO memory system may be adversely affected.

0004It is an object of the present invention to provide a FIFO memory system wherein the aforementioned disadvantage is alleviated and which has a flexible applicability.

0005Therefore, according to one aspect of the present invention, there is provided a FIFO memory system of the kind specified, characterized by offset generator means adapted to compare the contents of said write and read pointer register means and to generate an output signal representing the amount of memory space occupied, programmable offset register means adapted to provide a programmed offset signal, and comparator means adapted to compare said offset signal and said prrogrammed offset signal and to provide an output signal when said offset signal is greater than or equal to said programmed offset signal.

0006According to another aspect of the present invention, there is provided a method for buffering data between two data buses, characterized by the steps of: loading a programmable offset register with a programmed offset value; writing a data element into a RAM memory; incrementing a write pointer register to identify the address of the next data element to be written into said RAM memory; providing a read pointer register for identifying the address of the next data element to be read from said RAM memory; comparing the contents of said write and read pointer registers and generating an offset value therefrom; comparing said offset value with said programmed offset value; and generating a ready signal indicating said RAM memory is ready to be read when said offset value is greater than or equal to said programmed offset value.

0007It will be appreciated that a system and method according to the invention have the advantage that the level at which the FIFO buffer is indicated as being ready to be read may be optimized for a given system in which the FIFO buffer is utilized.

0008One embodiment of the present invention will now be described by way of example, with reference to the accompanying drawings in which:- <ul id="ul0001" list-style="none"><li>Figure 1 is a block diagram of a FIFO memory system according to one form of the present invention.</li><li>Figure 2 is a circuit diagram showing an example of a programmable offset register for use with the FIFO memory system shown in Figure 1.</li><li>Figure 3 is a block diagram of the comparator shown in Figure 1.</li><li>Figure 4 is a circuit diagram showing an example of a binary wrap around detector for use in the comparator shown in Figure 3.</li><li>Figure 5 is a circuit diagram showing an example of a flag generator for use in the comparator shown in Figure 3.</li><li>Figures 6A-6C show a circuit diagram of a five bit Gray code pointer register which may be used as the write or read pointer register shown in Figure 1.</li><li>Figures 7A-7B, 8A-8B, 9A-9C, 10A-10C, and 11A-11B form a circuit diagram showing an example of a five bit Gray code offset generator which may be used as the offset generator in Figure 1.</li><li>Figure 12 is a circuit diagram showing an example of a binary to Gray code converter which may be used as the converter in Figure 1.</li><li>Figure 13 is a circuit diagram showing an example of a Gray code greater than or equal to circuit which may be used in the comparator shown in Figure 3.</li><li>Figure 14 is a circuit diagram showing an example of a Gray code wrap around detector which may be used in the comparator shown in Figure 3.</li></ul>

0009Figure 1 shows a block diagram of a FIFO memory system 10 according to one form of the present invention. System 10 includes a RAM memory 12, a write pointer register 14, a read pointer register 16, an offset generator 18, a programmable offset register 20, and a comparator 22. There are two embodiments of the present invention described herein. The first involves the use of binary signals in a synchronous environment (hereinafter referred to as the binary system), and the second involves minimum change coded signals (hereinafter referred to as the minimum change system). As used herein, the term "minimum change code" refers to a code having the property that all successive code words differ in only one digit. Minimum change codes are sometimes referred to as cyclic codes. The minimum change system may also include a converter 24 as will be discussed more thoroughly hereinafter.

0010Briefly, in operation, write and read pointer registers 14 and 16 track the current write and read addresses, respectively, of data stored in RAM 12. These current addresses are provided to offset generator 18 which determines an offset value representing the amount of data stored in RAM 12. A programmed offset value is loaded into programmable offset register 20. Comparator 22 generates an EMPTY/, or FULL/ signal when RAM 12 is empty or full, respectively. Comparator 22 generates a READY/ signal indicating that RAM 12 is ready to be read when the amount of data in RAM 12 is greater than or equal to the programmed offset value. It should be noted that, as used herein, the symbol "/" following a signal name indicates that the signal is active low. This should not be considered as limiting the invention, but is employed only to completely describe the best mode in practicing the subject invention.

0011When a data element is to be written into RAM 12 (DATA IN), RAM 12 is enabled by a WRITE signal received on a control line, and the data element is written into RAM 12 at an address (WR ADD) provided by write pointer register 14. Write pointer register 14 is incremented upon the receipt of the WRITE signal, and generates at an output thereof the write address (WR ADD) of the next data element to be written into RAM 12. Write pointer register 14 also stores the address of the next data element to be written into RAM 12.

0012When a data element is to be read from RAM 12 (DATA OUT), RAM 12 is enabled by a READ signal received on a control line, and the data element is read from RAM 12 at an address (RD ADD) provided by read pointer register 16. Read pointer register 16 is incremented upon the receipt of the READ signal, and generates at an output thereof the read address (RD ADD) of the next data element to be read from RAM 12. Read pointer register 16 also stores the address of the next data element to be read from RAM 12.

0013The contents of write pointer register (WR ADD) and read pointer register 16 (RD ADD) are provided to offset generator 18. WR ADD and RD ADD are compared in offset generator 18 and an offset value or signal (OFF), representing the amount of occupied memory space in RAM 12, is generated and transferred to comparator 22. In the binary system, write and read pointer registers 14 and 16 are binary counters and offset generator 18 is a binary subtractor with OFF = WR ADD - RD ADD. In the minimum change system, write and read pointer registers 14 and 16 count in minimum change code and offset generator 18 performs in minimum change code an equivalent binary subtraction of WR ADD and RD ADD and thereby generate a minimum change coded OFF signal. An example of a write or read pointer register 14 or 16 for a minimum change system utilizing Gray code is shown in Figure 6A-6C, and an offset generator 18 utilizing Gray code is shown in Figures 7-11.

0014The programmed offset value which is loaded into programmable offset register 20 represents the amount of data to be stored in RAM 12 before the ready signal is given. Typically, this will be less than full, but may be varied according to the needs of the particular system or application in which the memory system 10 of the present invention is to be utilized. For the binary system, the programmed offset signal (POFF) is transferred directly from register 20 to comparator 22. For the minimum change system, the programmed offset signal may be stored in register 20 in either minimum change or binary code. If POFF is stored in minimum change code, it is transferred directly to comparator 22. If POFF is stored in binary, converter 24 (which connects offset register 20 to comparator 22) will convert the binary number into minimum change code and transfer the result to comparator 22. One form of a converter 24 for converting binary to minimum change code is shown in Figure 12.

0015Comparator 22 compares the offset signal (OFF) with the programmed offset signal (POFF) and generates a READY signal when OFF is greater than or equal to POFF. Referring to Figure 3, comparator 22 includes a wrap around detector 26, a greater than or equal to test circuit 28, and a flag generator 30. The purpose of the wrap around detector 26 is to eliminate ambiguity in the meaning of OFF = 0. Since OFF = 0 can mean either RAM 12 is empty or full, wrap around detector 26 tracks OFF and monitors changes therein to determine if RAM 12 is approaching full or empty. Just before RAM 12 is full, detector 26 generates an active low signal WRAP/, and when RAM 12 is not full, the WRAP/ signal from detector 26 is an inactive high signal. Greater than or equal to test circuit 28 receives both OFF and POFF and determines when OFF is greater than or equal to POFF and generates an active low signal GE/ at such time at an output of circuit 28. Flag generator 30 is connected to the outputs of detector 26, circuit 28, and offset generator 18 and receives the WRAP/, GE/, and OFF signals, respectively, therefrom. Generator 30 generates a FULL/ signal indicating RAM 12 is full when OFF=0 and WRAP/=0. Generator 30 generates an EMPTY/ signal when OFF=0 and WRAP/=1. Generator 30 generates a READY signal when GE/=0 or when RAM 12 is full.

0016Referring to Figure 1, write pointer register 14 receives a RESET signal and a WRITE signal, and generates a WR ADD signal on address bus 32. Address bus 32 is connected to an input of RAM 12 and offset generator 18. Read pointer register 16 receives a RESET signal and a READ signal, and generates a RD ADD signal on address bus 34. Address bus 34 is connected to an input of RAM 12 and offset generator 18. RAM 12 receives the WRITE and READ signals from control lines, and receives DATA from data bus 36. As noted previously, RAM 12 is dual ported having both an input data bus 36 and an output data bus 38 which allows simultaneous reads and writes to RAM 12. DATA is read out of RAM 12 on data bus 38 after first passing through multiplexer (MUX) 40. Offset generator 18 receives the WR ADD and RD ADD signals and generates an offset (OFF) signal on bus 42.

0017Programmable offset register 20 receives RESET/ and LD OFFSET/ signals, and receives OFFSET DATA from data bus 44. Although not shown, data bus 44 may be connected to data bus 36 so that only a single data bus may be required for the present system, and so that OFFSET DATA may be transmitted to register 20 on data bus 36. OFFSET DATA is loaded into register 20 when register 20 is enabled by receipt of a control signal (LD OFFSET). Register 20 stores OFFSET DATA and provides the same on bus 46 in the form of the programmed offset (POFF) signal. Bus 46 is connected to an input of MUX 40 and to an input of converter 24. MUX 40 is provided with a control line for receiving a read programmed offset (RD POFF) signal which selects the POFF signal on bus 46 to be output on data bus 38. As noted previously, converter 24 is not required for the binary system, in which case bus 46 is connected directly to an input of comparator 22. For the minimum change system, where OFFSET DATA is stored in register 20 in binary form, bus 46 is connected to an input of converter 24 and the output of converter 24 is connected to an input of comparator 22 through bus 48.

0018Comparator 22 receives the OFF and POFF signals on busses 42 and 48, respectively. Comparator 22 also receives an offset register zero (ORZ/) from programmable offset register 20 and a RESET signal. Three signals are generated by comparator 22 -- EMPTY/, READY/, and FULL/.

0019Figure 2 shows more detail of programmable offset register 20. The OFFSET DATA is stored in a plurality of parallel D type flipflops 50a, 50b, ... , 50n. The number of flipflops 50, i.e., the value of n, is such that 2ⁿ is the same as the number of addressable locations in RAM 12. Each flipflop 50 has a D input for receiving one of the parallel lines of OFFSET DATA from data bus 44. The CR input receives the control signal LD OFFSET/. Whenever LD OFFSET/ is active, OFFSET DATA on data bus 44 is loaded or latched into flipflops 50. OFFSET DATA in flipflops 50 is available on the Q outputs as the programmed offset data POFF. The Q outputs are also connected as inputs to an OR gate 52 which provides an active low output ORZ/ whenever all of the Q outputs are low. The ORZ/ signal is utilized by comparator 22 as will be discussed more fully hereinafter. Each flipflop 50 also receives the RESET/ signal at its R input for resetting the flipflop upon receipt of the signal.

0020Figure 3 shows a block diagram of comparator 22. Comparator 22 comprises wrap around detector 26, greater than or equal to test circuit 28, and flag generator 30. Wrap around detector 26 receives the offset signal OFF and a RESET/ signal and generates at its output a WRAP/ signal. Greater than or equal to test circuit 28 receives both the offset signal OFF and the programmed offset signal POFF and generates at its output a GE/ (greater than or equal to) signal. The GE/ signal is asserted whenever OFF is greater than or equal to POFF. Flag generator 30 receives as inputs WRAP/, GE/, ORZ/, and OFF, and generates EMPTY/, READY/, AND FULL/ signals.

0021Figure 4 is a circuit diagram of a wrap around detector 26 such as may be used in a binary system. Detector 26 includes a D type flipflop 54, an OR gate 56, and an AND gate 58. AND gate 58 receives as inputs the high n-1 bits of the OFF signal, i.e., OFF_n, OFF_n-1, ... , OFF₂. OR gate 56 receives as inputs the output of AND gate 58 and the FULL signal. The D input of flipflop 54 is connected to the output of OR gate 56. The CK input to flipflop 54 receives a SYSTEM CLOCK signal. This synchronizes the operation of wrap around detector 28 and prevents glitching of the output such as may occur in a binary system where more than a single bit of the OFF signal may change for each read or write operation. Flipflop 54 provides the WRAP/ signal at its Q/ output. When flipflop 54 is initially reset, WRAP/ is inactive high. As RAM 12 fills up, OFF will increment until finally each bit OFF_n, ... OFF₂ will equal 1 and the output of AND gate 58 will go high. At this point WRAP/ will become active low.

0022Figure 5 shows a circuit diagram of flag generator 30 such as may be employed in either the binary or minimum change system according to the present invention. Flag generator 30 includes inverters 60a, 60b, ... , 60n, NAND gate 62, inverters 64, 66 and 68, NAND gates 70 and 72, inverter 74, inverters 76a, 76b, ... , 76n, AND gate 78, inverter 80, NOR gate 82, and multiplexer (MUX) 84. NAND gate 62 receives as inputs the n bits of the OFF signal inverted by inverters 60a, 60b, ... , 60n. NAND gate 70 receives as inputs the output of NAND gate 62 inverted by inverter 64 and the WRAP/ signal. NAND gate 62 provides at its output the EMPTY/ signal which is asserted when RAM 12 is empty. It will be noted that EMPTY/ will only be asserted when OFF is zero and WRAP/ is inactive high. NAND gate 72 receives as inputs the WRAP/ signal inverted by inverter 68 and the output of NAND gate 62 inverted by inverter 66. It will be noted that FULL/ will only be asserted when OFF is zero and WRAP/ is active low. AND gate 78 receives as inputs the WRAP/ signal inverted by inverter 74, and the high n-1 bits of the OFF signal inverted by inverters 76a, 76b, ... , 76n. NOR gate 82 receives as inputs the output of AND gate 78 and the GE/ signal inverted by inverter 80. MUX 84 receives as a first input the FULL/ signal and as a second input the output of NOR gate 82. The select input of MUX 84 is the ORZ/ signal. When ORZ/ is active low (meaning that the programmed offset is zero), the first input is selected. This means that READY/ will only be asserted when FULL/ is asserted. In other words, a ready signal will only be given when RAM 12 is full. If ORZ/ is inactive high (meaning a value has been loaded in the offset register), the second input is selected, meaning the ready signal will only be given when OFF is greater than or equal to POFF. When RAM 12 is full, the offset is zero (OFF₀=0, ..., OFF_n-1=0), WRAP/=0, and GE/=1. The output of AND gate 78 will be 1, so the output of NOR gate 82 will be 0. Thus, gate 78 effectively holds the READY/ signal from multiplexer 84 active low while RAM 12 is full

0023As discussed previously, there are two embodiments of the present invention disclosed and discussed herein, namely, a binary system and a minimum change system. At this point the discussion the binary system is essentially complete. To recap with reference to Figure 1, it has been disclosed that write pointer register 14 and read pointer register 16 are conventional binary counters, and offset generator 18 is a conventional binary subtractor. RAM 12 and MUX 40 are also conventional with RAM 12 being a dual ported RAM in a preferred embodiment. Programmable offset register 20 is disclosed and discussed with reference to Figure 2. Converter 24 is not required for the binary system. Comparator 22 is disclosed and discussed with reference to Figure 3. A binary wrap around detector is disclosed and discussed with reference to Figure 4. A binary greater than or equal to test circuit is a conventional binary comparator circuit. A flag generator is disclosed and discussed with reference to Figure 5.

0024With respect to the minimum change system, an example of a minimum change code write or read pointer register will be discussed with reference to Figures 6A-6C. A minimum change code offset register 18 will be discussed with reference to Figures 7-11. A binary to minimum change code converter 24 will be discussed with reference to Figure 12. A minimum change code greater than or equal to test circuit will be discussed with reference to Figure 13, and a minimum change code wrap around detector will be discussed with reference to Figure 14.

0025Refer now to Figures 6A-6C which are connected according to the map of Figure 6 shown on the same sheet as Figure 6C. A circuit diagram of a Gray code pointer register such as may be used in a minimum change system for write pointer register 14 or read pointer register 16 is disclosed. Gray code is well known in the art as a type of minimum change code. Minimum change code differs from binary in that each incremental advance in a count only changes one bit whereas binary code may change any number of bits. For example, the numbers 1, 2, and 3 are represented as 01, 10, and 11, respectively, in binary. Note that in counting from 1 to 2 in binary both bits are changed. In contrast, 1, 2, and 3 in Gray code are 01, 11, and 10. Note that in each incremental increase only one bit changes. The following table shows the complete five-bit Gray code sequence and, for comparison, the equivalent binary notation. <tables id="tabl0001" num="0001"><table frame="all"><tgroup cols="3" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center"><u style="single">Decimal Number</u></entry><entry namest="col2" nameend="col2" align="center"><u style="single">Gray code</u></entry><entry namest="col3" nameend="col3" align="center"><u style="single">Binary</u></entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="right">0</entry><entry namest="col2" nameend="col2" align="right">00000</entry><entry namest="col3" nameend="col3" align="right">00000</entry></row><row><entry namest="col1" nameend="col1" align="right">1</entry><entry namest="col2" nameend="col2" align="right">00001</entry><entry namest="col3" nameend="col3" align="right">00001</entry></row><row><entry namest="col1" nameend="col1" align="right">2</entry><entry namest="col2" nameend="col2" align="right">00011</entry><entry namest="col3" nameend="col3" align="right">00010</entry></row><row><entry namest="col1" nameend="col1" align="right">3</entry><entry namest="col2" nameend="col2" align="right">00010</entry><entry namest="col3" nameend="col3" align="right">00011</entry></row><row><entry namest="col1" nameend="col1" align="right">4</entry><entry namest="col2" nameend="col2" align="right">00110</entry><entry namest="col3" nameend="col3" align="right">00100</entry></row><row><entry namest="col1" nameend="col1" align="right">5</entry><entry namest="col2" nameend="col2" align="right">00111</entry><entry namest="col3" nameend="col3" align="right">00101</entry></row><row><entry namest="col1" nameend="col1" align="right">6</entry><entry namest="col2" nameend="col2" align="right">00101</entry><entry namest="col3" nameend="col3" align="right">00110</entry></row><row><entry namest="col1" nameend="col1" align="right">7</entry><entry namest="col2" nameend="col2" align="right">00100</entry><entry namest="col3" nameend="col3" align="right">00111</entry></row><row><entry namest="col1" nameend="col1" align="right">8</entry><entry namest="col2" nameend="col2" align="right">01100</entry><entry namest="col3" nameend="col3" align="right">01000</entry></row><row><entry namest="col1" nameend="col1" align="right">9</entry><entry namest="col2" nameend="col2" align="right">01101</entry><entry namest="col3" nameend="col3" align="right">01001</entry></row><row><entry namest="col1" nameend="col1" align="right">10</entry><entry namest="col2" nameend="col2" align="right">01111</entry><entry namest="col3" nameend="col3" align="right">01010</entry></row><row><entry namest="col1" nameend="col1" align="right">11</entry><entry namest="col2" nameend="col2" align="right">01110</entry><entry namest="col3" nameend="col3" align="right">01011</entry></row><row><entry namest="col1" nameend="col1" align="right">12</entry><entry namest="col2" nameend="col2" align="right">01010</entry><entry namest="col3" nameend="col3" align="right">01100</entry></row><row><entry namest="col1" nameend="col1" align="right">13</entry><entry namest="col2" nameend="col2" align="right">01011</entry><entry namest="col3" nameend="col3" align="right">01101</entry></row><row><entry namest="col1" nameend="col1" align="right">14</entry><entry namest="col2" nameend="col2" align="right">01001</entry><entry namest="col3" nameend="col3" align="right">01110</entry></row><row><entry namest="col1" nameend="col1" align="right">15</entry><entry namest="col2" nameend="col2" align="right">01000</entry><entry namest="col3" nameend="col3" align="right">01111</entry></row><row><entry namest="col1" nameend="col1" align="right">16</entry><entry namest="col2" nameend="col2" align="right">11000</entry><entry namest="col3" nameend="col3" align="right">10000</entry></row><row><entry namest="col1" nameend="col1" align="right">17</entry><entry namest="col2" nameend="col2" align="right">11001</entry><entry namest="col3" nameend="col3" align="right">10001</entry></row><row><entry namest="col1" nameend="col1" align="right">18</entry><entry namest="col2" nameend="col2" align="right">11011</entry><entry namest="col3" nameend="col3" align="right">10010</entry></row><row><entry namest="col1" nameend="col1" align="right">19</entry><entry namest="col2" nameend="col2" align="right">11010</entry><entry namest="col3" nameend="col3" align="right">10011</entry></row><row><entry namest="col1" nameend="col1" align="right">20</entry><entry namest="col2" nameend="col2" align="right">11110</entry><entry namest="col3" nameend="col3" align="right">10100</entry></row><row><entry namest="col1" nameend="col1" align="right">21</entry><entry namest="col2" nameend="col2" align="right">11111</entry><entry namest="col3" nameend="col3" align="right">10101</entry></row><row><entry namest="col1" nameend="col1" align="right">22</entry><entry namest="col2" nameend="col2" align="right">11101</entry><entry namest="col3" nameend="col3" align="right">10110</entry></row><row><entry namest="col1" nameend="col1" align="right">23</entry><entry namest="col2" nameend="col2" align="right">11100</entry><entry namest="col3" nameend="col3" align="right">10111</entry></row><row><entry namest="col1" nameend="col1" align="right">24</entry><entry namest="col2" nameend="col2" align="right">10100</entry><entry namest="col3" nameend="col3" align="right">11000</entry></row><row><entry namest="col1" nameend="col1" align="right">25</entry><entry namest="col2" nameend="col2" align="right">10101</entry><entry namest="col3" nameend="col3" align="right">11001</entry></row><row><entry namest="col1" nameend="col1" align="right">26</entry><entry namest="col2" nameend="col2" align="right">10111</entry><entry namest="col3" nameend="col3" align="right">11010</entry></row><row><entry namest="col1" nameend="col1" align="right">27</entry><entry namest="col2" nameend="col2" align="right">10110</entry><entry namest="col3" nameend="col3" align="right">11011</entry></row><row><entry namest="col1" nameend="col1" align="right">28</entry><entry namest="col2" nameend="col2" align="right">10010</entry><entry namest="col3" nameend="col3" align="right">11100</entry></row><row><entry namest="col1" nameend="col1" align="right">29</entry><entry namest="col2" nameend="col2" align="right">10011</entry><entry namest="col3" nameend="col3" align="right">11101</entry></row><row><entry namest="col1" nameend="col1" align="right">30</entry><entry namest="col2" nameend="col2" align="right">10001</entry><entry namest="col3" nameend="col3" align="right">11110</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="right">31</entry><entry namest="col2" nameend="col2" align="right">10000</entry><entry namest="col3" nameend="col3" align="right">11111</entry></row></tbody></tgroup></table></tables> The use of Gray code in the subject invention prevents output glitches such as may occur when counting in binary code. In other words, when more than a single bit in a number changes, one of the bits may change instantaneously before another. This may create momentary errors in operations performed on such numbers. Unless the entire system is to be controlled by a clock the output may glitch or provide an incorrect signal in response thereto.

0026The Figure 6 embodiment shows a Gray code pointer register 86 for N = 5. Register 86 includes five D type flipflops 88a, 88b, 88c, 88d, and 88e. Each flipflop 88 receives on its CK input an INC (increment) signal. The INC signal is either the WRITE or READ signal shown in Figure 1 depending upon whether register 86 is being used as write pointer register 14 or read pointer register 16, respectively. Receipt of the INC signal increments register 86 by changing one of the five GCP_i bits. The INC signal is a typical square wave pulse having a leading and trailing edge. Each flipflop responds to the trailing edge of the INC signal so that register 86 is not incremented until the trailing edge of the INC signal occurs. It should be noted that the INC signal, in the form of either the WRITE or READ signal is also received by RAM 12 (see Figure 1). In order to assure that data is written into or read out of the correct address in RAM 12, RAM 12 responds to the <u style="single">leading</u> edge of the WRITE or READ signal. Thus, data is stored or read from RAM 12 before the address in pointer register 14 or 16 is incremented.

0027The Q output of each flipflop 88 provides one bit of GCP (Gray code pointer) signal. The GCP signal is equivalent to the WR ADD or RD ADD signal shown in Figure 1. The D input to each flipflop 88 receives a signal which is a function of the GCP signal from the Q output of all of the flipflops 88. The signals are processed through a matrix of logic gates. For example, as shown in Figure 6A, register 86 includes EX OR gate 90, inverters 92a, 92b, 92c, and 92d, AND gate 94 and EX OR gate 96. EX OR gate 90 receives as inputs the Q output of flipflops 88a and 88b. The input of inverter 92d receives the output of EX OR gate 90. The inputs of inverters 92a, 92b, and 92c receive as inputs the Q outputs of flipflops 88e, 88d, and 88c, respectively. AND gate 94 receives as inputs the outputs of inverters 92a, 92b, 92c, and 92d. EX OR gate 96 receives as inputs the output of AND gate 94 and the Q output of flipflop 88a. The D input of flipflop 88a receives the output of FX OR gate 96. Register 86 further includes EX OR gate 98, inverters 100a, 100b, and 100c, AND gate 102 and EX OR gate 104. EX OR gate 98 receives as inputs the output of flipflops 88a and 88b. The input of inverter 100c receives the output of EX OR gate 98. The inputs of inverters 100a, and 100b receive as inputs the Q outputs of flipflops 88e, and 88d, respectively. AND gate 102 receives as inputs the outputs of inverters 100a, 100b, and 100c, and the output of flipflop 88c. EX OR gate 104 receives as inputs the output of AND gate 102 and the Q output of flipflop 88b. The D input of flipflop 88b receives the output of EX OR gate 104.

0028Referring to Figure 6B, register 86 further includes EX OR gates 106 and 108, inverters 110a, and 110b, AND gate 112 and EX OR gate 114. EX OR gate 106 receives as inputs the Q output of flipflops 88a and 88b. EX OR gate 108 receives as inputs the output of EX OR gate 106 and the Q output of flipflop 88c. The input of inverter 110b receives the output of EX OR gate 108. The input of inverter 110a receives as its input the Q output of flipflop 88e. AND gate 112 receives as inputs the outputs of inverters 110a, and 110b, and the output of flipflop 88d. EX OR gate 114 receives as inputs the output of AND gate 112 and the Q output of flipflop 88c. The D input of flipflop 88c receives the output of EX OR gate 114. Register 86 further includes EX OR gates 116, 118, and 120, inverter 122, AND gate 124 and EX OR gate 126. EX OR gate 116 receives as inputs the Q output of flipflops 88a and 88b. EX OR gate 118 receives as inputs the output of EX OR gate 116 and the Q output of flipflop 88c. EX OR gate 120 receives as inputs the output of EX OR gate 118 and the Q output of flipflop 88d. The input of inverter 122 receives the output of EX OR gate 120. AND gate 124 receives as inputs the output of inverter 122, and the output of flipflop 88e. EX OR gate 126 receives as inputs the output of AND gate 124 and the Q output of flipflop 88d. The D input of flipflop 88d receives the output of EX OR gate 126.

0029Referring to Figure 6C, register 86 further includes EX OR gates 128, 130, 132, 134 and 136, and inverter 135. EX OR gate 128 receives as inputs the Q output of flipflops 88a and 88b. EX OR gate 130 receives as inputs the output of EX OR gate 128 and the Q output of flipflop 88c. EX OR gate 132 receives as inputs the output of EX OR gate 130 and the Q output of flipflop 88d. EX OR gate 134 receives as inputs the output of EX OR gate 132 and the Q output of flipflop 88e. Inverter 135 receives as an input the output of EX OR gate 134. EX OR gate 136 receives as inputs the output of inverter 135 and the Q output of flipflop 88e. The D input of flipflop 88e receives the output of EX OR gate 136.

0030Figures 7-11 are a logic circuit diagram of a Gray code offset generator 138 such as may be employed as offset generator 18 in Figure 1. As with Figure 6, the Figure 7-11 embodiment is for N = 5. Figures 7A-­7B show logic circuitry for generating GCOFF₀ (the first of five bits of the Gray code offset signal), Figures 8A-8B show logic circuitry for generating GCOFF₁, Figure 9A-9C show logic circuitry for generating GCOFF₂, Figures 10A-10C show logic circuitry for generating GCOFF₃, Figures 11A-11B show logic circuitry for generating GCOFF₄. Generator 138 receives as inputs WR ADD and RD ADD signals from write pointer register 14 and read pointer register 16 shown in Figure 1. Since generator 138 operates in Gray code, registers 14 and 16 may be of the type shown and described in Figure 6. Thus, the external signals received by generator 138 are designated GCW_RP (Gray code write pointer) and GCR_DP (Gray code read pointer). The five bits con-rising GCW_RP are denoted as GCW_RP₀, GCW_RP₁, GCW_RP₂, GCW_RP₃, and GCW_RP₄, and the five bits comprising GCR_DP are denoted as GCR_DP₀, GCR_DP₁, GCR_DP₂, GCR_DP₃, and GCR_DP₄. Other inputs to circuit elements of generator 138 include the inverted signals GCW_RP₀/, GCW_RP₁/, GCW_RP₂/, GCW_RP₃/, GCW_RP₄/, GCR_DP₀/, GCR_DP₁/, GCR_DP₂/, GCR_DP₃/, and GCR_DP₄/. The logic gates and their interconnections are clearly shown in Figures 7A-7E and will not be discussed in detail herein. It should be noted that the numbered connectors terminating with an open circle depict connections to logic element inputs with similarly numbered circles. Each output bit GCOFF₀, GCOFF₁, GCOFF₂, GCOFF₃, and GCOFF₄, is provided at an output of NAND gate 140, 142, 144, and NOR gate 146, and 147, respectively. A second inverted output bit GCOFF₀/, GCOFF₁/, GCOFF₂/, GCOFF₃/, and GCOFF₄/, is also provided by an inverter connected to each output of NAND gates 140, 142, 144, and NOR gates 146, and 147, respectively.

0031As noted previously, with reference to Figure 1, converter 24 is not required for the binary system and is employed in the minimum change system when the programmed offset value is stored in register 20 in binary. Figure 12 shows a circuit diagram of a binary to Gray code converter 148. The embodiment shown is for an N = 5. Converter 148 includes a plurality of EX OR gates 150a, 150b, 150c, and 150d. Binary signals are denoted as POFF₄, POFF₃, POFF₂, POFF₁, and POFF₀, and Gray code signals are denoted as GCPOFF₄, GCPOFF₃, GCPOFF₂, GCPOFF₁, and GCPOFF₀. The POFF₄ signal line is connected directly to the GCPOFF₄ signal line. EX OR gate 150a receives as inputs POFF₄ and POFF₃ and provides GCPOFF₃ as an output. EX OR gate 150b receives as inputs POFF₃ and POFF₂ and provides GCPOFF₂ as an output. EX OR gate 150c receives as inputs POFF₂ and POFF₁ and provides GCPOFF₁ as an output. EX OR gate 150d receives as inputs POFF₃ and POFF₀ and provides GCPOFF₀ as an output.

0032As discussed previously, comparator 22 as shown in Figures 1 and 3, includes wrap around detector 26, greater than or equal to test circuit 28, and flag generator 30. For the minimum change system, a Gray code greater than or equal test circuit 152 is shown in Figure 13. As with the Figures 7-11 embodiment, N = 5. Test circuit 152 comprises a plurality of logic gates connected as shown in Figure 9. It will be noted that the inputs to circuit 152 include the various GCOFF and GCPOFF signals and/or the inverse of such signals. The output of circuit 152 is the GE/ signal which is active low whenever GCOFF is greater than or equal to GCPOFF. The GE/ signal is provided as an input to the flag generator 30 shown in Figure 5.

0033Figure 14 shows a Gray code wrap around detector 154 such as may be employed in a minimum change system for the wrap around detector 26 shown in Figure 3. Wrap around detector 154 is illustrates an embodiment for N = 5. Detector 154 includes a D type flipflop 156 and a NAND gate 158. NAND gate 158 receives as inputs Gray code offset signals GCOFF₄, GCOFF₃, and GCOFF₂. The output of NAND gate 158 is provided to the CK input of flipflop 156. The GCOFF₁ signal is provided to the D input of flipflop 156. The active low WRAP/ signal is provided at the Q/ output of flipflop 156. The WRAP/ signal is provided as an input to the flag generator shown in Figure 5.

0034It will be clear to those skilled in the art that the present invention is not limited to the specific embodiments disclosed and illustrated herein. Nor is the minimum change system embodiment limited to circuits utilizing Gray code. Rather, the invention may be applied equally to circuits utilizing other minimum change codes.