Ramp Pattern VI
- Updated2025-01-28
- 2 minute(s) read
Ramp Pattern VI
Generates an array containing a ramp pattern. You must manually select the polymorphic instance you want to use.

Let the sequence X represent Ramp Pattern. For the Ramp Pattern by Samples instance, if type is Linear, the Ramp Pattern VI generates the pattern according to the following equation:
xi = x0 + iΔxfor i = 0, 1, 2, …, n – 1
where x0 is the start. Δx = (end – start)/m. n is the samples. m = n if exclude end? is TRUE. Otherwise, m = n – 1.
Let the sequence X represent Ramp Pattern. If type is Logarithmic, the Ramp Pattern VI generates the pattern according to the following equation:
xi = exp[ln(x0) + iΔx]for i = 0, 1, 2, …, n – 1
where x0 is the start. Δx = [ln(end) – ln(start)]/m. start and end must be greater than 0. n is the samples. m = n if exclude end? is TRUE. Otherwise, m = n – 1.
For the Ramp Pattern by Delta instance, this VI generates the pattern according to the following equation:

for i = 0, 1, 2, …, n – 1, and
where x0 is the start, Δx is delta, and [ ] means round towards -Infinity.
The Ramp Pattern VI does not impose conditions on the relationship between start and end. Therefore, the Ramp Pattern VI can generate ramp-up and ramp-down patterns.
The following block diagram illustrates how to use the Ramp Pattern VI to generate the ramp pattern of any size greater than or equal to 1.
