Signal Processing for Communication Systems
Markov chains are useful in computing the probability of events that are observable. However, in many real world applications, the events that we are interested in are usually hidden, that is we don’t observe them directly. These hidden events need to be inferred. For example, given a sentence in a natural language we only observe the … Read more
Key focus: Markov chains are a probabilistic models that describe a sequence of observations whose occurrence are statistically dependent only on the previous ones. ● Time-series data like speech, stock price movements.● Words in a sentence.● Base pairs on the rung of a DNA ladder. States and transitions Assume that we want to model the … Read more
The Shannon power efficiency limit is the limit of a band-limited system irrespective of modulation or coding scheme. It informs us the minimum required energy per bit required at the transmitter for reliable communication. It is also called unconstrained Shannon power efficiency Limit. If we select a particular modulation scheme or an encoding scheme, we … Read more
Digital Modulations 101 — 5 lessons (same on every page in this path) 1. BPSK → 2. QPSK → 3. M-PSK sim (you are here) → 4. QAM sim → 5. EVM Tools: BER vs Eb/N0 · EVM → SNR · Eb/N0 ↔ SNR Side reading for Digital Modulations 101. Use this comparison after QPSK … Read more
Information theory path: BPSK AWGN → Shannon capacity → Shannon power-efficiency limit → Capacity calculator In one sentence: Shannon capacity is the highest rate (bits per channel use, or bits per second for a continuous-time bandlimited AWGN channel) at which information can be sent with arbitrarily small error probability. Shannon theorem dictates the maximum … Read more