Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The implementation of the zero-order hold algorithm in the context of digital signal processing. The algorithm processes a continuous-time signal by approximating it with a series of discrete-time samples. The initial values, number of samples, sampling frequency, and granularity, and then calculates the time and value of each sample using a for loop. The document also includes the print statements for displaying the time, sample value, accumulated output, and accumulated error at each step.
Typology: Study notes
1 / 1
This page cannot be seen from the preview
Don't miss anything!
t 0 = 5 ‘Initial time n = 3 ‘Number of samples f = 2 ‘Sampling frequency h = 1/6 ‘Granularity
d = 1/ f ‘Sampling interval m = d / h ‘Granules per sample ‘Final time
k = 0 for i = 0 to n
for j = 0 to m - 1 t ( k )= t 0 + i d + j h x ( k ) = x 1 k = k + 1 next j next i
y = 0 v = 0 print t (0) , x (0) , y , v for k = 1 to mn y = y + v h v = v + [ x ( k ) - 4 v ] h print t ( k ) , x ( k ) , y , v next k
