Six 1080p cameras, a LiDAR, an IMU, and GNSS can share one compute platform and still disagree about when things happened. The cameras alone produce about 4.5 Gbit/s (RAW12, 30 fps) before any AI model runs, and each source arrives through its own interface, at its own rate, with its own timing model. Deserializers with frame sync, PTP, DMA, and zero-copy software paths already handle this in many systems. The sections below cover where they stop being enough, and what an FPGA costs at that point.
- Bandwidth rarely justifies an FPGA in a sensor data path. Keeping each measurement's acquisition timing attached to its payload through aggregation is the stronger reason.
- An FPGA timestamp applied at the interface records arrival time. When the gap between acquisition and arrival varies, a fixed calibration offset cannot fully correct it.
- A 1 ms timing error is 2 cm of travel at 20 m/s, or roughly 3 pixels at 90°/s with a 60° field of view across 1920 pixels. The timing budget follows from motion and from how the data is used.
- Deserializers, PTP-capable NICs, and DMA cover many systems. An FPGA adds cost and verification work unless one data path needs functions that no single fixed-function device provides.
- RDMA, RoCEv2, and GPUDirect RDMA act on different segments of the path, and Jetson's shared DRAM means the discrete-GPU copy diagram does not apply.
- One row in the selection table rarely justifies an FPGA. The case strengthens when several rows move to the right at once.