Skip to main content

What are the main lobe and side lobes in Beamforming

 

 What are the main lobe and side lobes in Beamforming?

You've probably noticed that in the diagram of beamforming, there are two types of lobes in beamforming patterns. One is the main lobe, while the others are side lobes. We intend to communicate with receivers with a stronger directional path from the transmitter when we produce beams for wireless communication. We can also see side lobes in this scenario. These side lobes, on the other hand, are not necessary for effective communication. As a result, we take various procedures to remove those side lobes or to reduce the number of side lobes as much as feasible; otherwise, inter-symbol interference occurs, and signal quality suffers.

Figure: Illustration of Main Lobe and Side lobes, where the x-axis denotes the angle of arrival (AOA) and angle of departure (AOD), respectively, while, the y-axis denotes the gain/power in dB (decibel).
   

In the case of MIMO antennas, our major goal is to reduce inter-symbol interface (ISI) by minimizing the number of side lobes, therefore we deploy antenna elements at half-wavelength intervals. It's a common practice to increase the power of the main lobe while reducing the power of the side lobes.


How to plot Main Lobes and Side lobes

The plotting of the main lobe and side lobes is not difficult. To begin, measure the received power at the receiver for a specific angle of arrival or departure (AOA/AOD).

For Example

At 28 GHz, UMi - LOS, 372-meter TX-RX Separation, Transmitted Power 30 dBm


The received power changes with parameters like the angle of arrival at the receiver, as seen in the example above.



We've plotted the graph of received power against the angle of arrival of the received signal in the diagram above. These are termed side lobes.

What causes the lobes to form?

Assume we have multiple transmitting antennas. Now, we gradually shift the phases of the antennas (using phase shifters (PSs) or manually), and the signal focuses on the resulting phase angles of those antennas.

 

Further Reading

Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

UGC NET Electronic Science June 2025 Question Paper with Answer Key & Detailed Solutions

Home / UGC NET PYQ / June 2025 Solved UGC NET Electronic Science June 2025 Question Paper with Answer Key and Full Explanations 📥 Download Question Paper (PDF) 2025 2024 2023 2022 2021 2020 Explanations 1.  Answer: Option (3) For forming a p-type semiconductor, the dopant must be a trivalent impurity (three valence electrons) so that it creates acceptor levels and holes become the majority carriers. Among the given elements, boron (B) is a group-III element (trivalent). Arsenic (As) and phosphorus (P) are group-V (pentavalent) donors that produce n-type material, and germanium (Ge) is a group-IV element usually used as the semiconductor, not as an acceptor dopant. Hence, doping an intrinsic semiconductor with B produces a p-type semiconductor. 2.  Answer: Option (4) The ohmic resistance of a JFET at zero gate bias is given by the standard relation: R DS(on) = V P / I DSS ...

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

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Q-function in BER vs SNR Calculation

Q-function in BER vs. SNR Calculation | Interactive Guide Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) ...

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

MATLAB Code for ASK, FSK, and PSK Comprehensive implementation of digital modulation and demodulation techniques with simulation results. 📘 Theory 📡 ASK Code 📶 FSK Code 🎚️ PSK Code 🕹️ Simulator 📚 Further Reading Amplitude Shift Frequency Shift Phase Shift Live Simulator ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation COPY % The code is written by SalimWireless.Com clc; clear all; close all; % Parameters Tb = 1; fc = 10; N_bits = 10; Fs = 100 * fc; Ts = 1/Fs; samples_per_bit = Fs * Tb; rng(10); binar...

Which of the following statements are correct? A. If the intermediate frequency is too high, poor selectivity results even if sharp cutoff filters are used in the IF stage.

  61) Which of the following statements are correct?  A. If the intermediate frequency is too high, poor selectivity results even if sharp cutoff filters are used in the IF stage.  B. A high value of intermediate frequency increases tracking difficulties.  C. As the intermediate frequency is lowered, image frequency rejection becomes better.  D. A very low intermediate frequency can make the selectivity too sharp.  Choose the correct answer from the options given below:  1. A and B only [Option ID = 3073]  2. B and C only [Option ID = 3074]  3. C and D only [Option ID = 3075]  4. B and D only [Option ID = 3076 Answer: 4  Previous yr Question papers with Full Explanations → Electronics and Communiaction Study Materials → Try Interactive Online Simulator Run the Simulation The Superheterodyne Principle The...

Shannon Limit Explained: Negative SNR, Eb/No and Channel Capacity

Understanding Negative SNR and the Shannon Limit An explanation of Signal-to-Noise Ratio (SNR), its behavior in decibels, and how Shannon's theorem defines the ultimate communication limit. Signal-to-Noise Ratio in Shannon’s Equation In Shannon's equation, the Signal-to-Noise Ratio (SNR) is defined as the signal power divided by the noise power: SNR = S / N Since both signal power and noise power are physical quantities, neither can be negative. Therefore, the SNR itself is always a positive number. However, engineers often express SNR in decibels: SNR(dB) When SNR = 1, the logarithmic value becomes: SNR(dB) = 0 When the noise power exceeds the signal power (SNR < 1), the decibel representation becomes negative. Behavior of Shannon's Capacity Equation Shannon’s channel capacity formula is: C = B log₂(1 + SNR) For SNR = 0: log₂(1 + SNR) = 0 When SNR becomes smaller (including negative values in dB), the expression approache...

Reed–Solomon Coding and Decoding

Reed–Solomon Coding and Decoding 1. Input Bitstream to Symbols Given input bitstream: 101011000… Choose symbol size: m = 3 ⇒ symbols in GF(2³) Grouping bits: 101 | 011 | 000 Binary to decimal symbols: [5, 3, 0] 2. Finite Field Construction GF(2³) Primitive polynomial: p(x) = x³ + x + 1 Element Polynomial Binary Decimal α⁰ 1 001 1 α¹ α 010 2 α² α² 100 4 α³ α + 1 011 3 α⁴ α² + α 110 6 α⁵ α² + α + 1 111 7 α⁶ α² + 1 101 5 3. Message Polynomial Choose RS(7,3): n = 7, k = 3 Message symbols: [5, 3, 0] Message polynomial: m(x) = 5 + 3x + 0x² 4. Generator Polynomial Number of parity symbols: n − k = 4 Generator polynomial: g(x) = (x − α)(x − α²)(x − α³)(x − α⁴) Expanded form: g(x) = x⁴ + 6x³ + x² + 6x + 1 5. RS Encoding (Polynomial Division) Multiply message by x⁴: x⁴m(x) = 5x⁴ + 3x⁵ Divide by generator polynomial: r(x) = 6 + 4x + 2x² + 5x³ Codeword polynomial: c(x) = x⁴m(x) + r(x) Final codeword symbols: [...