|
|
By doctorj, on October 21st, 2008% Below is an introduction to the convolution sum for discrete-time systems. Once you characterize the system with a given impulse as an input and find it corresponding impulsive output, then any arbitrary input can be decompose as a summation of time-shifted weighted impulses. The resulting output is simply a summation of time-shifted weighted impulse responses. . . . → Read More: Convolution Sum for Discrete-Time Systems
By doctorj, on October 12th, 2008% http://www.freedomuniversity.tv/promotions/algebra/lessonnotesp.htm. For questions, contact Professor Santiago (aka Dr J) at john@e-liteworks.com or visit the above link for more videos. . . . → Read More: High School Math – Factoring Polynomials
By doctorj, on October 6th, 2008% I’ve recently found a set of videos on YouTube posted by Stanford University. The course is entitled, Fourier Transform and Its Applications. In the layout at the above link, I would add lecture notes to follow the video lecture. I assume Stanford has those available for their students and if you read on the description [...] . . . → Read More: Fourier Transform and Its applications
By doctorj, on October 5th, 2008% A graphical simulation from the University of Colorado, Boulder is used to give you insight on how the slope and y-intercept changes a linear graph or line. . . . → Read More: Linear Equations
By doctorj, on October 5th, 2008% http://www.FreedomUniversity.TV, Contact Prof Santiago john@e-liteworks.com. The video describes finding the greatest common factor and is a preliminary discussion to factoring polynomials. For a complete 11-week course in introductory algebra, visit http://www.FreedomUniversity.TV. . . . → Read More: Algebra Help – Greatest Common factors
|
|