Skip to main content

Analog Beamforming vs Digital beamforming



1. Analog Beamforming:

Beamforming is a method of focusing a signal in a certain direction to provide sufficient signal strength at the receiver end of the communication process. We normally require more than one closely located antenna to form a beam in a specific direction and focus the resultant signal from antennas to use beam forming. We can also use phase shifters (PSs) to control the phases of a signal. We employ MIMO (multiple input multiple output antenna) [↗] to provide beam forming. In a MIMO system, antennas are normally positioned in a half-wavelength interval of the operating frequency.


We commonly employ beam forming when we need to send a signal over a great distance (e.g., for radar communication) and omnidirectional transmission isn't feasible. On the other hand, we can use beam forming to extend the range of our signal without boosting TX power.


Similarly, 5G communication [Read More] makes advantage of an incredibly high frequency [↗]. As a result, it suffers from severe path loss [↗], and its short wavelength is easily absorbed by air gases, vapor, and other particles. With sufficient power, such an extremely high-frequency band can only go a short distance. As a result, we use beam forming to cover greater distances. We get a stronger and narrower beam by increasing the number of antennas without raising the TX power. It is an important advantage of beamforming.

There are several methods of beam formation, but they are usually divided into three categories: 1. Analog beam forming 2. Digital Beamforming 3. Hybrid Beamforming. In analog beam formation, the beam is steered at both the transmitter and receiver end, and the best beam pairs are selected for communication. More simply, we aim to send signals at varying angles of departure, or AOD, from the transmitter side. We do the same thing using angles of arrival (AOA) on the receiver side, then only connect the best beams from both the transmitter and receiver sides. We can only change the phases (or, the direction of signal transmission) of a signal in analog beam forming, and there is only one data stream between the transmitter and receiver.
 
analog beamforming
Get MATLAB Code for Analog and Digital Beamforming


The number of antennas on both the transmitter and receiving sides may be seen in the diagram above. To form a beam, more than one neighboring antenna is required. The fact that there is just one RF Chain on both the transmitter and receiver sides is a crucial aspect of analog beam formation. The number of RF chains determines the number of simultaneous data streams accessible between the transmitter and receiver. In the diagram above, we steer the beam at the transmitter to find the optimal beam, while the receiver listens in an omnidirectional manner. The same thing happens at the receiver's end, where the receiver tries directional beams while the transmitter radiates in an omnidirectional manner. Then, using adequate feedback, the best beam pairs from both sides are connected. RF chains contain mixers, power amplifiers, etc.

In the following chapters, we'll look into digital beam forming, which allows multiple data streams to be sent and received simultaneously. We'll also talk about canceling interference between many devices and canceling interference between simultaneous data streams.



2. Digital Beamforming:

Unlike analog pre-coding, we can send signals with a variety of phases and amplitudes. Different phases signify different things, such as the ability to steer the beam in different directions. On the other hand, we can also regulate the transmitted signal's amplitude. If we need to reduce the signal's amplitude in a specific antenna element, we can easily do it.

The signal that was received is denoted by

y=√pHDs + n
where, p=average received power
H=channel matrix
D= digital or baseband pre-coder
s= symbol vector
n = additive white Gaussian noise

Each antenna is connected to a distinct transmit and receive (TR) module or RF chain in the system diagram below.


analog beamforming

Fig: Digital Beamforming


We know that point-to-point communication between MIMO is conceivable, such as h11, h12, h22, and so on. For example, 'h22' denotes channel gain or the link between the second antenna on the transmitter and the second antenna on the receiver. 



Also Read about:

more ...

📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

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) x = 1.0 Q(x) = 0.1587 ...
Read more

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...
Read more

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...
Read more

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...
Read more

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →
Read more

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):
Read more

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...
Read more