Claims
- 1. A method for accessing a synchronous random access memory, said method comprising:
- in a read operation, receiving a memory address in an nth clock cycle and outputting in an (n+1)th clock cycle data stored in said synchronous random access memory corresponding to said memory address received in said nth clock cycle, where n is an integer; and
- in a write operation, receiving in a kth clock cycle a memory address to which data is to be written, and receiving in a (k+1)th clock cycle data to be stored in said synchronous random access memory at said memory address received in said kth clock cycle, where k is an integer,
- wherein said nth clock cycle can be the (k+1)th clock cycle.
- 2. The method of claim 1 further comprising:
- storing data received in an rth write operation in an input circuit of said synchronous random access memory; and
- storing during a (r+1)th write operation in a memory of said synchronous random access memory said data stored in said input circuit during said rth write operation.
- 3. The method of claim 2 further comprising:
- comparing an address received in a jth read operation to an address corresponding to data stored in said input circuit; and
- outputting data from said memory corresponding to said address received in said jth read operation when said address received in said jth read operation does not match said address corresponding to data stored in said input circuit and outputting said data stored in said input circuit when said address received in said jth read operation matches said address corresponding to data stored in said input circuit.
- 4. A method for accessing a synchronous random access memory, said method comprising:
- in a read operation, receiving a memory address in an nth clock cycle and outputting in an (n+d)th clock cycle data stored in said synchronous random access memory corresponding to said memory address received in said nth clock cycle, where n is an integer; and
- in a write operation, receiving in a kth clock cycle a memory address to which data is to be written, and receiving in a (k+d)th clock cycle data to be stored in said synchronous random access memory at said memory address received in said kth clock cycle, where k is an integer,
- wherein said nth clock cycle can be the (k+1)th clock cycle, wherein
- d equals a selected integer.
- 5. The method of claim 4 wherein d equals 1.
- 6. The method of claim 4 wherein d equals 2.
- 7. The method of claim 4 wherein d equals at least 3.
- 8. A synchronous random access memory comprising:
- in a read operation, means for receiving a memory address on a rising edge of an nth clock cycle and outputting in an (n+d)th clock cycle data stored in said synchronous random access memory corresponding to said memory address received in said nth clock cycle; and
- in a write operation, means for receiving a memory address on the rising edge of a kth clock cycle and for receiving on a rising edge of a (k+d)th clock cycle data to be stored in said synchronous random access memory data at said memory address received in said kth clock cycle,
- wherein d equals any one of 1, 2, 3, 4, . . . N, where N is a selected integer, and
- wherein said nth clock cycle can be a clock cycle sequentially following said kth clock cycle with no clock cycles intervening between said nth clock cycle and said kth clock cycle.
- 9. A synchronous random access memory comprising:
- in a read operation, means for receiving a memory address on a rising edge of an nth clock cycle and outputting in an (n+d)th clock cycle data stored in said synchronous random access memory corresponding to said memory address received in said nth clock cycle; and
- in a write operation, means for receiving a memory address on a rising edge of a kth clock cycle and for receiving on a rising edge of a (k+d)th clock cycle data to be stored in said synchronous random access memory data at said memory address received in said kth clock cycle,
- wherein d equals any one of 1, 2, 3, 4, . . . N, where N is a selected integer, and
- wherein said kth clock cycle can be a clock cycle sequentially preceding said nth clock cycle with no clock cycles intervening between said nth clock cycle and said kth clock cycle.
Parent Case Info
This application is a division of application Ser. No. 08/635,128, filed Apr. 19, 1996.
US Referenced Citations (9)
Divisions (1)
|
Number |
Date |
Country |
Parent |
635128 |
Apr 1996 |
|