Discrete time Fourier transform is defined as the sum of the product of a sequence and complex exponent. In this chapter, classical sums that include fundamental functions (distributions) are solved in details. The “sum” implies that functions being transformed are sampled, that is to say, in the form of a discrete sequence.