In a previous post (here), we looked at using CORDIC (Co-ordinate Rotation by DIgital Computer) for understanding how a complex number can be rotated by an angle without using actual multipliers. Let us know try to understand how we can use CORDIC for finding the phase and magnitude of a complex number. Basics The CORDIC…
Using the services of a new author ‘RV’, we are starting a new series of articles in the blog. Typically in India, many of the competitive examinations pertaining to Engineering (GATE, IES) and rectuitment by private and public sector companies (ISRO, BSNL, BEL, BHEL) uses examination with objective questions for the first level screening. We…
In this post, let us try to derive the symbol error rate for 16-PSK (16-Phase Shift Keying) modulation. Consider a general M-PSK modulation, where the alphabets, are used. (Refer example 5-38 in [DIG-COMM-BARRY-LEE-MESSERSCHMITT]) Figure: 16-PSK constellation plot
Thanks to Mr. Raghava G D’s comments on the post discussing Question 38 on Communication from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper, realized that I had made an error in the solution. Have the updated the post with the right answer and additional explanations.
Question 6 on digital circuit from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper. Q6. Consider the given circuit In this circuit, the race around (A) does not occur (B) occurs when CLK=0 (C) occurs when CLK=1 and A=B=1 (D) occurs when CLK=1 and A=B=0
Let us try to understand simulation of a typical Orthogonal Frequency Division Multiplexing (OFDM) transmission defined per IEEE 802.11a specification. Orthogonal pulses In a previous post (here ), we have understood that the minimum frequency separation for two sinusoidals with arbitrary phases to be orthogonal is , where is the symbol period. In Orthogonal Frequency…
In a post on Minimum Shift Keying (MSK), we had discussed that MSK uses two frequencies which are separated by and phase discontinuity is avoided in symbol boundaries. In that post, we had discussed MSK as a continuous phase transmit signal and showed that phase changes through 0, 90, 180 and 270 degrees. In this…
It might be interesting to interpret the output of the fft() function in Matlab. Consider the following simple examples. fsMHz = 20; % sampling frequency fcMHz = 1.5625; % signal frequency N = 128; % fft size % generating the time domain signal x1T = exp(j*2*pi*fcMHz*[0:N-1]/fsMHz); x1F = fft(x1T,N); % 128 pt FFT figure; plot([-N/2:N/2-1]*fsMHz/N,fftshift(abs(x1F)))…
While trying to derive the theoretical bit error rate (BER) for BPSK modulation in a Rayleigh fading channel, I realized that I need to discuss chi square random variable prior. What is chi-square random variable? Let there be independent and identically distributed Gaussian random variables with mean and variance and we form a new random…
I happened to stumble on Prof. Andrew Ng’s Machine Learning classes which are available online as part of Stanford Center for Professional Development. The first lecture in the series discuss the topic of fitting parameters for a given data set using linear regression. For understanding this concept, I chose to take data from the top…
Some of us would have used Newton’s method (also known as Newton-Raphson method) in some form or other. The method has quite a bit of history, starting with the Babylonian way of finding the square root and later over centuries reaching the present recursive way of finding the solution. In this post, we will describe…
Question 38 on Communication from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper. Q38. A binary symmetric channel (BSC) has a transition probability of 1/8. If the binary transmit symbol X is such that P(X=0)=9/10, then the probability of error for an optimum receiver will be (A) 7/80 (B) 63/80 (C)…
Question 7 on digital from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper. Q7. The output Y of a 2-bit comparator is logic 1 whenever the 2 bit input A is greater than 2 bit input B. The number of combinations for which output is logic 1 is (A) 4 (B)…
From the previous posts on Linear Regression (using Batch Gradient descent, Stochastic Gradient Descent, Closed form solution), we discussed couple of different ways to estimate the parameter vector in the least square error sense for the given training set. However, how does the least square error criterion work when the training set is corrupted by…