Ramp Pattern VI

Ramp Pattern by Samples

samples is the number of samples of the Ramp Pattern. If samples is less than two, the VI sets Ramp Pattern to an empty array and returns an error. The default is 128. If samples is 1 and exclude end? is TRUE, the VI returns an array with one element of start.

end is the ending value, or final value, of Ramp Pattern. The default is 1.

start is the starting value, or first value, of Ramp Pattern. The default is 0.

exclude end? specifies whether Ramp Pattern includes end. Ramp Pattern does not include end if exclude end? is TRUE. The default is FALSE. If samples is 1 and exclude end? is TRUE, the VI returns an array with one element of start, with no error.

type specifies the type of Ramp Pattern to generate.

0	Linear (default)
1	Logarithmic

Ramp Pattern returns the ramp pattern of samples. The largest Ramp Pattern this VI can generate depends on the amount of memory in your system, and it is theoretically limited to 2,147,483,647 (2³¹ – 1) elements.

error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster.

Ramp Pattern by Delta

	delta is the interval between two adjacent samples in Ramp Pattern. The default is 0.
	end is the ending value, or final value, of Ramp Pattern. The default is 1.
	start is the starting value, or first value, of Ramp Pattern. The default is 0.
	Ramp Pattern returns the ramp pattern of samples. The largest Ramp Pattern this VI can generate depends on the amount of memory in your system, and it is theoretically limited to 2,147,483,647 (2³¹ – 1) elements.
	samples is the number of samples of the Ramp Pattern.
	error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster.

Ramp Pattern Details

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:

x_i = x₀ + ix

for i = 0, 1, 2, …, n – 1

where x₀ 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:

x_i = exp[ln(x₀) + ix]

for i = 0, 1, 2, …, n – 1

where x₀ 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 x₀ 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.