- Видео 15
- Просмотров 64 569
Graduate tutorial
Добавлен 18 сен 2019
Signal Flow Graph Method |Introduction| |Part-1| |Control Systems|
#controlsystems #controlsystem #signalflowgraph #sgf
Просмотров: 5
Видео
Block diagram Reduction Method | Part-3| | Control System |
Просмотров 1116 часов назад
#controlsystems #controlsystem #blockdiagram
Block diagram Reduction Method | Part-2| | Control System |
Просмотров 1121 час назад
#controlsystems #controlsystem #blockdiagram
Block diagram Reduction Method | Part-1| | Control System |
Просмотров 20День назад
#controlsystems #controlsystem #blockdiagram
Basics of Fourier transform |Why it is so Important | |Signals and Systems|
Просмотров 719Год назад
This video will help to know the importance of Fourier transform in signal processing. #fouriertransform #signalandsystem
Impulse Response of a System | Signal and Systems |
Просмотров 75Год назад
This tutorial will help to understand why we always calculate the impulse response of a system. #dsp #signalandsystem #impulseresponse
RTD- Resistance Temperature Detector Principle & Working- Electronic Measurement & Instrumentation
Просмотров 7064 года назад
#rtd #transducer #emi
Principle, Operation and Gauge Factor Calculation of Strain Gauge | EMI |
Просмотров 18 тыс.4 года назад
#straingauge #transducer #emi
Different Type of Transducers in Electronic Measurement and Instrumentation (EMI)
Просмотров 7694 года назад
#transducer #emi #electronicmeasurement
Simulation of Transmitter and Receiver for 16-QAM (MATLAB Experiment)
Просмотров 11 тыс.4 года назад
#matlab #matlabtutorials #qam #16qam #simulation
Simulation of Transmitter and Receiver for Quadrature Phase Shift Keying (QPSK) (MATLAB Experiment)
Просмотров 7 тыс.4 года назад
#QPSK #MATLAB #matlab #matlabtutorials #qpsk #simulation
Fast Fourier Transform (FFT) Example Problem | Decimation in Time (DIT) | | DSP |
Просмотров 5575 лет назад
#DSP #DigtalSiganlProcessing #FFT #DFT #Fast Fourier transform #DecimationinTime
Discrete Fourier Transform Matrix method | DFT | | Digital Signal Processing | | DSP |
Просмотров 2025 лет назад
#DSP #DigtalSiganlProcessing #DFT #Discrete Fourier transform
Fast Fourier Transform (FFT) Decimation in Time (DIT) radix-2 method | Digital Signal Processing |
Просмотров 7495 лет назад
#DSP #DigtalSiganlProcessing #FFT #Fast Fourier Transform
Difference between DTFT and DFT (Discrete Fourier transform) | Digital Signal Processing | | DSP |
Просмотров 25 тыс.5 лет назад
#DSP #DigtalSiganlProcessing #DTFT #DFT #Discrete Fourier transform)
THANK YOU. Best video ever to understand this topic, I am shocked by how good you are
helpful! thanks !
thank god you are here !!!
put some captions pls, hard to understand anything with this audio
In This video....❌ In This Tutorial.....❌ In This lecture.....❌ In This Video Tutorial Lecture ✅ 👍🏻
Drho/Ds=DR and Drho/Ds=Drho how
Very compact and precise. Thank you for the clear explanation of the topic.
EXCELLENT!
WTF, you are the best person I have seen who talks about the difference between these two shits. Thank you so much.
Thank-you sir
Length of the sequence is N=3
So amplitude vs time, to amplitude vs frequency where it is easier to understand. 👍
To the point and detailed video. Thanks alot I was searching for this for a long time!
What is 'w' equal to in DTFT sir? Is it w=2π/N or w=2π/T?? In DFT it is w=2πkn/N......
Amazing
the way you are explaining the topic is superb sir
very good
well done..many thx
Super sir
🖤🖤
Hello could you please give us the pdf or ppt file in the description box
clc; clear; clear var; %% N=3e5; alpha16qam=[-3 -1 1 3]; Es_N0_dB =[0:20]; ipHat=zeros(1,N); %% for ii=1:length(Es_N0_dB) ip=randsrc(1,N,alpha16qam)+j*randsrc(1,N,alpha16qam); s=(1/sqrt(10))*ip; n=1/sqrt(2)*[randn(1,N)+j*randn(1,N)]; y=s+10^(-Es_N0_dB(ii)/20)*n; y_re=real(y); y_im=imag(y); ipHat_re(find(y_re< -2/sqrt(10)))=-3; ipHat_re(find(y_re> 2/sqrt(10)))=3; ipHat_re(find(y_re>-2/sqrt(10) & y_re<=0))=-1; ipHat_re(find(y_re>0 & y_re<=2/sqrt(10)))=1; ipHat_im(find(y_im< -2/sqrt(10)))=-3; ipHat_im(find(y_im> 2/sqrt(10)))=3; ipHat_im(find(y_im> -2/sqrt(10) & y_im<=0))=-1; ipHat_im(find(y_im> 0 & y_im<=2/sqrt(10)))=1; ipHat = ipHat_re + j*ipHat_im; nErr(ii)=size(find([ip- ipHat]),2); end %% simBer=nErr/N; theoryBer=3/2*erfc(sqrt(0.1*(10.^(Es_N0_dB/10)))); figure semilogy(Es_N0_dB,theoryBer,'b.-','LineWidth',1); hold on semilogy(Es_N0_dB,simBer,'mx-','LineWidth',1); axis([0 20 1e-5 1]) grid on
Thanks
Well, the calculation is wrong
Sir, the calculation is correct. The range of n is from 0 to 2 only, that's why there are only three terms in K=0 calculation.
*PLZ HELP*. Given a pressure of 2kpa, nominal resistance of 120 ohm, diameter of strain gauge 0.1mm, a GF of 2. What will be the change in resistance value of the strain gauge?....in short I wanta formula to calculate the change in resistance of strain gauge for a given INPUT PRESSURE
could you attach link of the code and experiment
thankuu sir
Thank you. You made the difficult topic so easy to understand!
can you provide the code in a pdf form
Thanks alot for this presentation, but there is a small mistake done. X(0)=Sum(from 0 to 3) of (1/3)= 4*(1/3)= 4/3, cz the number of terms is 4. Thank you!!!
Thank you for your comment. Sir, the calculation is correct. The range of n is from 0 to 2 only, that's why there are only three terms in K=0 calculation.
Great informational video . Sir audio level is low. One more point i have to add is that digital processor works on discrete values .Thus we convert dtft to dft.
Thank you for sharing !!
well done
not audible.
Sir voice is not audible
thank you sir
Thanks for good explanation
very good explanation keep it up i am feeling lucky