I am sampling a continuous signal $x_c(t)$ that follows a triangle function in the time domain, meaning:
$x_c(t)=\left\{\begin{array}{rl}1-|t/a|,&|t|<|a|\\ 0,&\mbox{otherwise}\end{array}\right.$
Parameter $a$ is an integer multiple of my sampling interval $T_0$ such that $a=kT_0$. Thus:
$x_d[n]=\left\{\begin{array}{rl}1-|n/k|,&|n|<|k|\\ 0,&\mbox{otherwise}\end{array}\right.$
I am wondering if a discrete-time Fourier transform $x_d[n]$ exists in closed-form, like the continuous-time Fourier transform of $x_c(t)$. I know that the continuous time triangle function is the convolution of two rectangular functions, and I know that the discrete-time Fourier transform exists in closed form for the rectangular function, however, I am having trouble writing down my sampled discrete version of the triangle function as a convolution of two discrete rectangles.
It is interesting that the inverse DTFT for the triangle function (i.e. triangle function in the frequency domain) is listed in this table and it looks very much like the Fourier transform of the continuous-time version. If the other side of the DTFT doesn't exist (in closed form), I'd be interested in learning the reason why, as I am new to the signal processing and Fourier analysis world.