Datasheet 搜索 > 微控制器 > ST Microelectronics（意法半导体） > STM32F102R4T6A 数据手册 > STM32F102R4T6A 开发手册 4/10 页
器件3D模型￥ 31.338
STM32F102R4T6A 开发手册 - ST Microelectronics（意法半导体）
制造商:
ST Microelectronics（意法半导体）
分类:
微控制器
封装:
LQFP-64
描述:
STMICROELECTRONICS STM32F102R4T6A 芯片, 微控制器, 32位, CORTEX-M3, 48MHZ, LQFP-64
Pictures:
3D模型
符号图
焊盘图
引脚图
产品图
页面导航:
应用领域在P10
导航目录
STM32F102R4T6A数据手册
Page:
of 10 Go
若手册格式错乱，请下载阅览PDF原文件
FIFO emulation with DMA AN3109
4/10 Doc ID 16795 Rev 1
1 FIFO emulation with DMA
1.1 FIFO overview
FIFO is an acronym for first in, first out. It is an abstraction of the ways of organizing and
manipulating data in terms of time and order. This expression describes a queue-processing
technique. It consists in the servicing of conflicting demands based on the principle of first-
come, first-served: the data that come in first are handled first, the data that come in next
are served after the first data in are removed, etc.
FIFO (first in first out) requires that the first data item input is the first output. It is necessary
to keep track of the amount of data items in the buffer so that data are not dropped or
duplicated.
A circular buffer is an efficient way of implementing a FIFO. Figure 1 shows an 8-byte
circular buffer.
Figure 1. Circular buffer diagram
This buffer has 8 bytes of storage. It is referred to as circular because the next position
accessed after position 7 is position 0.
Figure 2 shows two pointers used to control the movement of data into and out of the buffer.
Figure 2. Circular buffer pointer diagram
The write pointer points to the next available buffer location to be written. It is incremented
when data are placed into the buffer. The read pointer points to the next buffer location to be
read. It is incremented when data are fetched from the buffer.
AI
$ATAIN
$ATAOUT
7RITE
BUFFER
POINTER
2EAD
BUFFER
POINTER
AI
器件 Datasheet 文档搜索
AiEMA 数据库涵盖高达 72,405,303 个元件的数据手册，每天更新 5,000 多个 PDF 文件
