Skip to main content

Successive Interference Cancellation (SIC)


Successive Interference Cancellation (SIC)

Ah, I see your point now more clearly. You're asking a crucial question: How can a device subtract the strong signal from the received signal if it doesn't know what the strong signal is?

This is the essence of Successive Interference Cancellation (SIC), and I’ll explain in detail how this actually works in practice:

The Key Idea Behind SIC

In SIC, the process of subtracting the strong signal to improve the weak signal relies on the fact that the receiver already knows the strong signal once it has decoded it. The confusion usually comes from the fact that it sounds like the receiver is magically subtracting something it doesn't know. Here's how it works:

Step-by-Step Breakdown of SIC

1. Superposed Transmission

Both users transmit their signals simultaneously, and the received signal at the receiver is the sum of both signals, as well as noise.

Received Signal = h1 * Signal1 + h2 * Signal2 + Noise
        

Here, h1 and h2 are the channel coefficients for each user, and the signals Signal1 and Signal2 are the transmitted signals from Users 1 and 2, respectively.

2. Decode the Strongest Signal First

  • The receiver first decodes the strongest signal (typically the user with the higher signal power or better channel conditions).
  • The receiver does this by applying an appropriate demodulation technique (like QPSK) to extract the data from the strongest signal. It knows the modulation scheme and can identify the transmitted symbols.
  • After decoding the strongest signal, the receiver now knows what that signal is. Importantly, this is where the receiver gains knowledge of the strong signal.

3. Subtract the Strong Signal

Once the strong signal has been decoded, it is subtracted from the received signal to eliminate its contribution as interference. This process effectively removes the strong signal from the received mixture.

Received Signal for User 2 (after SIC) = Received Signal - h1 * Decoded Signal1
        
  • The strong signal (Decoded Signal1) is multiplied by the channel coefficient h1 and then subtracted.
  • This leaves only the signal of the weak user, along with noise, for further decoding.

4. Decode the Weak Signal

  • With the interference from the strong user subtracted, the receiver now attempts to decode the weak user's signal.
  • Since the strong signal is no longer present, the weak signal can be decoded with much less interference.

5. Iterative Process (More Than Two Users)

  • If there are more than two users, the same process is repeated: decode the strongest signal, subtract it, and then decode the next strongest signal. This is why it is called Successive Interference Cancellation.

How the Receiver "Knows" the Strong Signal

  • The receiver does not need to know the strong signal in advance. It only needs to know it after it decodes it.
  • Using the modulation scheme, the receiver extracts symbols and reconstructs the transmitted signal.
  • The process of demodulation and decoding provides all the information needed for subtraction.

Key Assumptions for SIC to Work

  • Channel Knowledge: The receiver must know the channel coefficients via pilot symbols or feedback.
  • Perfect Decoding: Errors in decoding the strong signal lead to imperfect cancellation.
  • Known Modulation Scheme: Required to correctly demodulate and reconstruct the signal.
  • Sufficient SNR: The strongest signal must have high enough SNR for reliable decoding.

Example Scenario

  • User 1 has a much stronger signal than User 2.
  • The receiver decodes User 1’s signal first.
  • The decoded signal is subtracted from the received mixture.
  • User 2’s signal is then decoded with reduced interference.

Without SIC

Without SIC, the strong signal is treated as noise, leading to a higher symbol error rate (SER) for the weak user.

Summary

  • The receiver does not know the strong signal beforehand.
  • It decodes the strongest signal first and then subtracts it.
  • This enables clean decoding of weaker signals.

This is the core of how SIC works. Accurate decoding followed by subtraction allows weak signals to be recovered with much less interference.


Further Reading

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

ASK, FSK, and PSK (with MATLAB + Online Simulator)

📘 Overview 📘 Amplitude Shift Keying (ASK) 📘 Frequency Shift Keying (FSK) 📘 Phase Shift Keying (PSK) 📘 Which of the modulation techniques—ASK, FSK, or PSK—can achieve higher bit rates? 🧮 MATLAB Codes 📘 Simulator for binary ASK, FSK, and PSK Modulation 📚 Further Reading ASK or OFF ON Keying ASK is a simple (less complex) Digital Modulation Scheme where we vary the modulation signal's amplitude or voltage by the message signal's amplitude or voltage. We select two levels (two different voltage levels) for transmitting modulated message signals. For example, "+5 Volt" (upper level) and "0 Volt" (lower level). To transmit binary bit "1", the transmitter sends "+5 Volts", and for bit "0", it sends no power. The receiver uses filters to detect whether a binary "1" or "0" was transmitted. ...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation 🧮 MATLAB Code for BER calculation 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received compared to the total number of bits sent. BER = (number of bits received in error) / (total number of transmitted bits) What is Signal-to-Noise Ratio (SNR)? SNR is the ratio of signal power to noise powe...

Calculation of SNR from FFT bins in MATLAB

📘 Overview 🧮 MATLAB Code for Estimation of SNR from FFT bins 🧮 MATLAB Code for SNR from PSD using Kaiser Window 📚 Further Reading Here, you can find the SNR of a received signal from periodogram / FFT bins using the Kaiser operator. The beta (β) parameter characterizes the Kaiser window, which controls the trade-off between the main lobe width and the side lobe level. Steps Set up the sampling rate and time vector Compute the FFT and periodogram Calculate the frequency resolution and signal power Exclude the signal power from noise calculation Compute the noise power and SNR MATLAB Code for Estimation of SNR from FFT bins clc; clear; close all; % Parameters fs = 8000; f_tone = 1000; N = 8192; t = (0:N-1)/fs; % Generate signal + noise signal = sin(2*pi*f_tone*t); SNR_true_dB = 20; signal_power = mean(signal.^2); noise_power = signal_power / (10^(SNR_true_dB/10)); noisy_signal = signal + sqrt(noise_power) * randn(1, N); % Apply ...

MATLAB Code for ASK, FSK, and PSK (with Online Simulator)

📘 Overview & Theory 🧮 MATLAB Code for ASK 🧮 MATLAB Code for FSK 🧮 MATLAB Code for PSK 🧮 Simulator for binary ASK, FSK, and PSK Modulations 📚 Further Reading ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation % The code is written by SalimWireless.Com % Clear previous data and plots clc; clear all; close all; % Parameters Tb = 1; % Bit duration (s) fc = 10; % Carrier frequency (Hz) N_bits = 10; % Number of bits Fs = 100 * fc; % Sampling frequency (ensure at least 2*fc, more for better representation) Ts = 1/Fs; % Sampling interval samples_per_bit = Fs * Tb; % Number of samples per bit duration % Generate random binary data rng(10); % Set random seed for reproducibility binary_data = randi([0, 1], 1, N_bits); % Generate random binary data (0 or 1) % Initialize arrays for continuous signals t_overall = 0:Ts:(N_bits...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

Constellation Diagrams of ASK, PSK, and FSK with MATLAB Code + Simulator

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Comparing Baseband and Passband Implementations of ASK, FSK, and PSK

📘 Overview 🧮 Baseband and Passband Implementations of ASK, FSK, and PSK 🧮 Difference betwen baseband and passband 📚 Further Reading 📂 Other Topics on Baseband and Passband ... 🧮 Baseband modulation techniques 🧮 Passband modulation techniques   Baseband modulation techniques are methods used to encode information signals onto a baseband signal (a signal with frequencies close to zero). Passband techniques shift these signals to higher carrier frequencies for transmission. Here are the common implementations: Amplitude Shift Keying (ASK) [↗] : In ASK, the amplitude of the signal is varied to represent different symbols. Binary ASK (BASK) is a common implementation where two different amplitudes represent binary values (0 and 1). ASK is simple but susceptible to noise. ASK Baseband (Digital Bits) ASK Passband (Modulated Carrier)     Fig 1:  ASK Passband Modulation (...

LDPC Encoding and Decoding Techniques

📘 Overview & Theory 🧮 LDPC Encoding Techniques 🧮 LDPC Decoding Techniques 📚 Further Reading 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved.  Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmitted via very noisy channel. Applications requiring highly reliable information transport over bandwidth restrictions in the presence of noise are increasingly using LDPC codes. 1. LDPC Encoding Technique The proper form of H matrix is derived from the given matrix by doing multiple row operations as shown above. In the above, H is parity check matrix and G is generator matrix. If you consider matrix H as [-P' | I] then matrix G will b...