Bit Error Rate (BER) for frequency shift keying with coherent demodulation

Following the request by Siti Naimah, this post discuss the bit error probability for coherent demodulation of binary Frequency Shift Keying (BFSK) along with a small Matlab code snippet. Using the definition provided in Sec 4.4.4 of [DIG-COMM-SKLAR]), in binary Frequency shift keying (BFSK), the bits 0’s and 1’s are represented by signals and having…

Read More

Happy New Year 2010

Wishing all the readers of dsplog.com a great year 2010 ! Its been a mixed year for dsplog. Some key milestones a) Crossing 1000 subscribers with 1100+ comments in March 2009 b) Crossing 100 posts with 2200 subscribers and 2600+ comments in October 2009 c) As I write this, we have 102 posts with 2603…

Read More

Convolutional code

Coding is a technique where redundancy is added to original bit sequence to increase the reliability of the communication. In this article, lets discuss a simple binary convolutional coding scheme at the transmitter and the associated Viterbi (maximum likelihood) decoding scheme at the receiver. Update: For some reason, the blog is unable to display the…

Read More

GATE-2012 ECE Q24 (math)

Question 24 on math from GATE (Graduate Aptitude Test in Engineering) 2012 Electronics and Communication Engineering paper. Q24. Two independent random variables X and Y are uniformly distributed in the interval [-1, 1]. The probability that max[X,Y] is less than 1/2 is (A) 3/4 (B) 9/16 (C) 1/4 (D) 2/3

Read More

Comparing BPSK, QPSK, 4PAM, 16QAM, 16PSK, 64QAM and 32PSK

I have written another article in DSPDesginLine.com. This article can be treated as the third post in the series aimed at understanding Shannon’s capacity equation. For the first two posts in the series are: 1. Understanding Shannon’s capacity equation 2. Bounds on Communication based on Shannon’s capacity The article summarizes the symbol error rate derivations…

Read More