FIFO memory having a memory region modifiable during operation
AssigneeRobert Bosch GmbH
InventorsTimo Giesselmann, Konstantin Buck, Rainer Dorsch
Life of this patent
Estimating the term…
Abstract
A FIFO memory having a modifiable memory region; the FIFO memory being configured as a linear memory and as a circular buffer; the FIFO memory having a state machine that contains a new base value and a new top value for definition of a memory region allocated in the future, the lower boundary of which region is defined by the new base value and the upper boundary of which is defined by the new top value, and the state machine is configured in such a way that in a read mode and/or a write mode of the FIFO memory, the allocated memory region of the FIFO memory is modifiable by shifting the base pointer to the new base value, and/or by shifting the top pointer to the new top value.
Claims5
A FIFO memory, comprising:
- a modifiable memory region, the FIFO memory being configured as a linear memory, and as a circular buffer;
- and
- a state machine that includes a base pointer, a top pointer, a write pointer, and a read pointer, the FIFO memory containing a currently allocated memory region whose lower boundary is defined by the base pointer and whose upper boundary is defined by the top pointer, the write pointer defining a current write address and the read pointer defining a current read address, the state machine further including a new base value and a new top value for defining a memory region allocated in the future, a lower boundary of which region is defined by the new base value and an upper boundary of which is defined by the new top value;
- wherein in at least one of a read mode of the FIFO memory and a write mode of the FIFO memory, the state machine is configured to modify an allocated memory region of the FIFO memory by at least one of:
- for shifting the base pointer to the new base value when the new base value is at least as low as a location to which the read pointer is presently set:
- determining, in a first determination, whether a first condition, that a location to which the write pointer is presently set equals a current value of the top pointer, is satisfied;
- and
- performing the shifting of the base pointer to the new base value in response to a result of the first determination being that the first condition is satisfied;
- and
- for shifting the top pointer to the new top value when the new top value is at least as high as the location to which the write pointer is presently set:
- determining, in a second determination, whether a second condition, that the location to which the read pointer is presently set equals a current value of the base pointer, is satisfied;
- and
- performing the shifting of the top pointer to the new top value in response to a result of the second determination being that the second condition is satisfied.
Dependencies are inferred from the claim text.