Texas Instruments TMS320C3x 사용자 설명서
Circular Addressing
6-21
Addressing Modes
6.7
Circular Addressing
Many DSP algorithms, such as convolution and correlation, require a circular
buffer in memory. In convolution and correlation, the circular buffer acts as a
sliding window that contains the most recent data to process. As new data is
brought in, the new data overwrites the oldest data by increasing the pointer
to the data through the buffer in counter-clockwise fashion. When the pointer
accesses the end of the buffer, the device sets the pointer to the beginning of
the buffer. For example, Figure 6–4a shows a circular buffer that holds six values.
Figure 6–4b shows how this buffer is implemented in the ’C3x memory space.
Figure 6–5 shows this buffer after writing three values. Figure 6–6 shows this
buffer after writing eight values.
buffer in memory. In convolution and correlation, the circular buffer acts as a
sliding window that contains the most recent data to process. As new data is
brought in, the new data overwrites the oldest data by increasing the pointer
to the data through the buffer in counter-clockwise fashion. When the pointer
accesses the end of the buffer, the device sets the pointer to the beginning of
the buffer. For example, Figure 6–4a shows a circular buffer that holds six values.
Figure 6–4b shows how this buffer is implemented in the ’C3x memory space.
Figure 6–5 shows this buffer after writing three values. Figure 6–6 shows this
buffer after writing eight values.
Figure 6–4. Logical and Physical Representation of Circular Buffer
Start
End
Logical representation
Physical representation
Start
End
a)
b)
Figure 6–5. Logical and Physical Representation of Circular Buffer after Writing Three Values
Start
End
a) Logical representation
value0
value1
value2
value0
value2
value1
b) Physical representation
Start
End