
By doctorj, on November 15th, 2009% One of many videos on digital signal processing. Initial background is needed to discuss the basics of DSP. Here, we talk about the remarkable mathematical relationship and formula known as Euler’s formula. Some of the links in the post above are “affiliate links.” This means if you click on the link and purchase the item, [...] . . . → Read More: Digital Signal Processing (DSP) Tutorial: Euler’s Formula – Part 1
By doctorj, on November 15th, 2009% This is an introduction to digital signal processing. Here, we begin with an background introduction with geometric series and its application to finding the Fourier Transform for discretetime signals. Note when we talk about discretetime signals the example given in the video is for aperiodic signals. Signals that are continuous or discrete in the timedomain [...] . . . → Read More: Digital Signal Processing (DSP) Tutorial: Introduction to Geometric Series and the DiscreteTime Fourier Transform
By doctorj, on July 6th, 2009% In analog or continuous systems the Fourier transform played a key role in analyzing signals and systems. The inverse z transform represents a timedomain sequence of a z transform function. We note that the z transform for digital signals or discretetime signals is the digital counterpart of the Laplace transform for continuoustime signals. Both the [...] . . . → Read More: zTransform Tutorial: zTransform and Inverse zTransform Examples & Functions
By doctorj, on July 5th, 2009% We introduce the ztransform bringing polynomials and rational functions to help analyze linear discretetime systems. The discretetime convolution (or FIR convolution) is equivalent to polynomial multiplication and algebraic operations in the z transform domain can be translated as combining or decomposing linear timeinvariant (LTI) systems. The most common ztransforms are rational functions, that is, the [...] . . . → Read More: Overview and Introduction to the zTransform (Polynomial & Rational Functions)

