To download NI software, including the products shown below, visit ni.com/downloads.
Overview
This example VI enables the user to use a queue as a FIFO and store only the N most recently acquired points.
Description
Some data acquisition applications require storing only the N most recently acquired points. While it may be acceptable to store all the points in array and pull the final N points off the array after acquisition, this becomes impractical if the application is to run for a long time due to wasteful memory usage. This example code leverages the LabVIEW Queue as a FIFO to keep only the N most recently acquired points. This implementation is much faster than using an array due to the constant element shifting required in the array implementation.
Requirements to Run
Software
Hardware
Steps to Implement or Execute Code
Additional Information or References
Block Diagram
**This document has been updated to meet the current required format for the NI Code Exchange.**
Example code from the Example Code Exchange in the NI Community is licensed with the MIT license.