Migration to new template (skin)

Hi, Those visiting the blog might have noticed a fresh look to the dspLog. This new feel is thanks to the Thesis Magazine Skin provided by FourBlogger Skins. Click here to view more details. There some more tinkering required at some places. But, in general most of the settings are taken care. Hope you like…

Read More

BPSK BER with OFDM modulation

Oflate, I am getting frequent requests for bit error rate simulations using OFDM (Orthogonal Frequency Division Multiplexing) modulation. In this post, we will discuss a simple OFDM transmitter and receiver, find the relation between Eb/No (Bit to Noise ratio) and Es/No (Signal to Noise ratio) and compute the bit error rate with BPSK.

Read More

BER with Matched Filtering

In the post on transmit pulse shaping filter, we had discussed pulse shaping using rectangular and sinc. In this post we will discuss about optimal receiver structure when pulse shaping is used at the transmitter. The receiver structure is also called as matched filter. For the discussion, we will assume rectangular pulse shaping, the channel…

Read More

Happy Birthday – dspLog

An important milestone for the dspLog happened on Oct 21st 2008. On this day last year, the blog migrated from the Blogger platform to the independently hosted platform at www.dsplog.com ! Belated birthday wishes for the blog!!! 🙂 Looking back, the first year was satisfying – both in terms of contents and traffic. We started…

Read More

Matlab or C for Viterbi Decoder?

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…

Read More

GATE-2012 ECE Q7 (digital)

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)…

Read More