Are you bothered by speed of the speed of the simulations which you develop in Matlab/Octave? I was not bothered much, till I ran into the Viterbi decoder. If you recall, the Matlab/Octave simulation script for BER computation with hard soft decision Viterbi algorithm provided in post Viterbi with finite survivor state memory took around…
Question 46 on math from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper. Q46. The maximum value of in the interval [1, 6] is (A) 21 (B) 25 (C) 41 (D) 46 Solution Let us start by finding the critical points of the function . The first derivative is, . Solving by…
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.
The previous post on phase noise discussed about finding the root mean square phase noise for a given phase noise profile. In this post let us discuss about the impact of phase noise on the error vector magnitude (evm) of a transmit symbol.
This is the third post in the series discussing receiver diversity in a wireless link. Receiver diversity is a form of space diversity, where there are multiple antennas at the receiver. The presence of receiver diversity poses an interesting problem – how do we use ‘effectively‘ the information from all the antennas to demodulate the…
We have installed Google FriendConnect on dspLog.com. With Google Friend Connect, you can: (a) You can interact with other members who have similiar interests. You will come to know the list of other sites (apart from dspLog.com) where the members have joined. You can add a member as a friend and so on. (b) You…
Thanks to Prof. K V S Hari, I was informed that the centenary year for Indian Institute of Science (IISc), Bangalore starts on May 27th 2008. As part of the event, a conference with the theme Managing Complexity in a Distributed World (MCDES) is to be held at IISc from May27th to 31st 2008.
Given that we have discussed Binary to Gray code conversion, let us discuss the Gray to BInary conversion. Conversion from Gray code to natural Binary Let be the equivalent Gray code for an bit binary number with representing the index of the bit. 1. For , i.e, the most significant bit (MSB) of the Gray…
In the post on Viterbi decoder and soft input Viterbi decoder, we discussed a convolutional encoding scheme with rate 1/2, constraint length and having generator polynomial and having generator polynomial . If the number of uncoded bits is , then the number of coded bits at the output of the convolutional encoder is . Decoding…
After almost 6 months with the Smashing Theme template, its time for a change. Recently I stumbled upon the Deep Blue template from DailyBlogTips. I liked the clean blue-green-white combination and and felt it might be a good fit for www.dsplog.com. Hope you agree. One key feature which I like is addition of tag cloud…
An earlier post we discussed hard decision decoding for a Hamming (7,4) code and simulated the the bit error rate. In this post, let us focus on the soft decision decoding for the Hamming (7,4) code, and quantify the bounds in the performance gain.
On July30th, 2008 I had sent a request for feedback to 93 subscribers who have opted to receive articles over email. As on 3rd August, I received the response from around 8 persons. Not bad, around 8.5% response. Thanks a lot for the feedback. I will summarize the response from the group and note down…
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…