本站已收录 番号和无损神作磁力链接/BT种子 

[Tutorialsplanet.NET] Udemy - Digital Signal Processing (DSP) From Ground Up™ in C

种子简介

种子名称: [Tutorialsplanet.NET] Udemy - Digital Signal Processing (DSP) From Ground Up™ in C
文件类型: 视频
文件数目: 105个文件
文件大小: 5.21 GB
收录时间: 2021-10-4 06:10
已经下载: 3
资源热度: 311
最近下载: 2024-12-23 07:24

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:95f3819ce6b3540b597eef8ef44d1026684f7853&dn=[Tutorialsplanet.NET] Udemy - Digital Signal Processing (DSP) From Ground Up™ in C 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[Tutorialsplanet.NET] Udemy - Digital Signal Processing (DSP) From Ground Up™ in C.torrent
  • 1. Set up/1. Setting up an Integrated Development Environment (IDE).mp415.73MB
  • 1. Set up/2. Overview of CodeBlocks.mp422.78MB
  • 1. Set up/3. Downloading gnuplot.mp418.37MB
  • 1. Set up/4. Installing gnuplot.mp415.23MB
  • 1. Set up/5. Overview of gnuplot.mp419.72MB
  • 10. Fast Fourier Transform (FFT)/1. An Overview of how FFT works..mp4141.2MB
  • 10. Fast Fourier Transform (FFT)/2. Understanding the complexity of calculating DFT directly.mp445.33MB
  • 10. Fast Fourier Transform (FFT)/3. How the Decimation -in-Time FFT Algorithm works.mp4161.94MB
  • 11. Digital Filter Design/1. Introduction to Digital Filters.mp457MB
  • 11. Digital Filter Design/10. Classification of digital filters.mp429.34MB
  • 11. Digital Filter Design/2. The Filter Kernel.mp431.5MB
  • 11. Digital Filter Design/3. The Impulse,Step and Frequency response.mp422.04MB
  • 11. Digital Filter Design/4. Understanding the Logarithmic scale and decibels.mp451.41MB
  • 11. Digital Filter Design/5. Information representations of a signal.mp469.72MB
  • 11. Digital Filter Design/6. Time domain parameters.mp467.16MB
  • 11. Digital Filter Design/7. Frequency domain parameters.mp422.36MB
  • 11. Digital Filter Design/8. Designing digital filters using the spectral inversion method.mp479.26MB
  • 11. Digital Filter Design/9. Designing digital filters using the spectral reversal method.mp448.29MB
  • 12. Designing Finite Impulse Response FIR) Filters/1. The Moving Average Filter.mp470.34MB
  • 12. Designing Finite Impulse Response FIR) Filters/2. The Multiple Pass Moving Average Filter.mp439.27MB
  • 12. Designing Finite Impulse Response FIR) Filters/3. The Recursive Moving Average Filter.mp479.72MB
  • 13. Designing Infinite Impulse Response (IIR) Filters/1. Introduction to Recursive Filters.mp412.72MB
  • 13. Designing Infinite Impulse Response (IIR) Filters/2. The Recursion Equation.mp429.95MB
  • 13. Designing Infinite Impulse Response (IIR) Filters/3. The Single-Pole Recursive Filter.mp447.09MB
  • 13. Designing Infinite Impulse Response (IIR) Filters/4. Digital Chebyshev Filters.mp431.96MB
  • 14. Designing Windowed-Sinc Filters/1. Introduction to Windowed-Sinc Filters.mp413.13MB
  • 14. Designing Windowed-Sinc Filters/10. Coding Developing the Band-pass Windowed-Sinc Filter Algorithm (Part III).mp465.11MB
  • 14. Designing Windowed-Sinc Filters/11. Coding Developing the Band-pass Windowed-Sinc Filter Algorithm (Part IV).mp4100.34MB
  • 14. Designing Windowed-Sinc Filters/12. Coding Developing the Band-pass Windowed-Sinc Filter Algorithm (Part V).mp432.55MB
  • 14. Designing Windowed-Sinc Filters/2. The Sinc Function and the Truncated Sinc Filter.mp455.45MB
  • 14. Designing Windowed-Sinc Filters/3. The Blackman window.mp416.51MB
  • 14. Designing Windowed-Sinc Filters/4. The Hamming and Blackman window equations.mp443.46MB
  • 14. Designing Windowed-Sinc Filters/5. Designing the Windowed Sinc filter.mp443.65MB
  • 14. Designing Windowed-Sinc Filters/6. Coding Developing the Low-pass Windowed-Sinc Filter Algorithm (Part I).mp4107.42MB
  • 14. Designing Windowed-Sinc Filters/7. Coding Developing the Low-pass Windowed-Sinc Filter Algorithm (Part II).mp4216.53MB
  • 14. Designing Windowed-Sinc Filters/8. Coding Developing the Band-pass Windowed-Sinc Filter Algorithm (Part I).mp476.35MB
  • 14. Designing Windowed-Sinc Filters/9. Coding Developing the Band-pass Windowed-Sinc Filter Algorithm (Part II).mp450.93MB
  • 15. FFT Convolution/1. Understanding how the Overlap-Add method works.mp468.56MB
  • 2. Getting started with gnuplot/1. Plotting signals with gnuplot.mp418.16MB
  • 2. Getting started with gnuplot/2. Plotting multiple signals in the same window.mp439.39MB
  • 3. Signal Statistics and Noise/1. Nature of a signal.mp442.73MB
  • 3. Signal Statistics and Noise/2. Mean and Standard Deviation.mp473.11MB
  • 3. Signal Statistics and Noise/3. Signal-to-Noise ratio.mp416.57MB
  • 3. Signal Statistics and Noise/4. Coding Developing the Signal Mean algorithm.mp467.68MB
  • 3. Signal Statistics and Noise/5. Coding Computing the Signal Mean.mp431.36MB
  • 3. Signal Statistics and Noise/6. Coding Developing the Signal Variance algorithm.mp480.75MB
  • 3. Signal Statistics and Noise/7. Coding Developing the Signal Standard Deviation algorithm.mp430.98MB
  • 4. Quantization and The Sampling Theorem/1. Quantization.mp443.96MB
  • 4. Quantization and The Sampling Theorem/2. Nyquist Theorem ( Sampling Theorem ).mp439.35MB
  • 4. Quantization and The Sampling Theorem/3. The Passive Low-Pass Filter.mp468.83MB
  • 4. Quantization and The Sampling Theorem/4. The Passive High-Pass Filter.mp428.9MB
  • 4. Quantization and The Sampling Theorem/5. The Modified Sallen-Key Filter.mp441MB
  • 4. Quantization and The Sampling Theorem/6. The Bessel, Chebyshev and Butterworth filters.mp455.3MB
  • 4. Quantization and The Sampling Theorem/7. Comparing the performance of the Bessel, Chebyshev and Butterworth filters.mp442.36MB
  • 4. Quantization and The Sampling Theorem/8. Information encoding Time-domain and frequency-domain encoding.mp425.85MB
  • 5. Linear Systems and Superposition/2. Signal naming conventions.mp422.77MB
  • 5. Linear Systems and Superposition/3. System Homogeneity.mp427.11MB
  • 5. Linear Systems and Superposition/4. System Additivity.mp49.63MB
  • 5. Linear Systems and Superposition/5. System Shift Invariance.mp419.39MB
  • 5. Linear Systems and Superposition/6. Synthesis and Decomposition.mp437.96MB
  • 5. Linear Systems and Superposition/7. Impulse Decomposition.mp437.38MB
  • 5. Linear Systems and Superposition/8. Step Decomposition.mp431.78MB
  • 6. Convolution/1. Introduction to Convolution.mp427.03MB
  • 6. Convolution/10. The Identity property of convolution.mp425.57MB
  • 6. Convolution/11. The Running Sum and First Difference.mp434.91MB
  • 6. Convolution/12. Coding Developing the Running Sum algorithm.mp495.06MB
  • 6. Convolution/2. The Delta Function and Impulse Response.mp438.71MB
  • 6. Convolution/3. The Convolution Kernel.mp4113.46MB
  • 6. Convolution/4. The Convolution Kernel (Part II).mp415.24MB
  • 6. Convolution/5. The Output side analysis and the convolution sum equation.mp475.75MB
  • 6. Convolution/6. Coding Developing the Convolution algorithm (Part I ).mp494.68MB
  • 6. Convolution/7. Coding Developing the Convolution algorithm (Part I I).mp442.39MB
  • 6. Convolution/8. Coding Developing the Convolution algorithm (Part III).mp455.06MB
  • 6. Convolution/9. Coding Developing the Convolution algorithm (Part IV).mp492.93MB
  • 7. Fourier Transsform/1. Introduction to Fourier Analysis.mp423.42MB
  • 7. Fourier Transsform/10. Coding Developing the Inverse DFT algorithm (Part II).mp479.92MB
  • 7. Fourier Transsform/11. Coding Developing the Inverse DFT algorithm (Part III).mp435.77MB
  • 7. Fourier Transsform/12. Coding Computing the DFT and IDFT of an ECG signal (Part I).mp449.57MB
  • 7. Fourier Transsform/13. Coding Computing the DFT and IDFT of an ECG signal (Part II).mp448.2MB
  • 7. Fourier Transsform/14. Coding Identifying the frequencies present in the DFT plot.mp472.69MB
  • 7. Fourier Transsform/15. Symmetry between Time domain and frequency domain -Duality.mp415.67MB
  • 7. Fourier Transsform/16. Polar Notation.mp447.89MB
  • 7. Fourier Transsform/17. Coding Rectangular notation to the polar notation ( Part I).mp489.66MB
  • 7. Fourier Transsform/18. Coding Rectangular notation to the polar notation ( Part II).mp484.58MB
  • 7. Fourier Transsform/19. Introduction to Spectral Analysis.mp441.1MB
  • 7. Fourier Transsform/2. Introduction to Discrete Fourier Transform.mp484.42MB
  • 7. Fourier Transsform/20. The Frequency Response.mp461.68MB
  • 7. Fourier Transsform/3. DFT Basis Functions.mp458MB
  • 7. Fourier Transsform/4. Deducing the Inverse DFT.mp455.43MB
  • 7. Fourier Transsform/5. Calculating the Discrete Fourier Transform (DFT).mp464.92MB
  • 7. Fourier Transsform/6. Code Developing the DFT algorithm (Part I).mp467.25MB
  • 7. Fourier Transsform/7. Code Developing the DFT algorithm (Part II).mp497.94MB
  • 7. Fourier Transsform/8. Code Developing the DFT algorithm (Part III).mp429.73MB
  • 7. Fourier Transsform/9. Coding Developing the Inverse DFT algorithm (Part I).mp439.76MB
  • 8. Complex Numbers/1. The Complex Number System.mp436.04MB
  • 8. Complex Numbers/2. Polar Representation of Complex Numbers.mp427.24MB
  • 8. Complex Numbers/3. Euler's Relation.mp424.37MB
  • 8. Complex Numbers/4. Representation of Sinusoids.mp434.3MB
  • 8. Complex Numbers/5. Representing Systems.mp427.51MB
  • 9. Complex Fourier Transform/1. Introduction to Complex Fourier Transform.mp429.53MB
  • 9. Complex Fourier Transform/2. Mathematical Equivalence.mp428.71MB
  • 9. Complex Fourier Transform/3. The Complex DFT Equation.mp410.7MB
  • 9. Complex Fourier Transform/4. Comparing Real DFT and Complex DFT.mp457.92MB
  • 9. Complex Fourier Transform/5. Coding Developing the Complex DFT equation (Part I).mp488.98MB
  • 9. Complex Fourier Transform/6. Coding Developing the Complex DFT equation (Part II ).mp463.47MB