Skip to main content

Comparison of FDMA, TDMA, & CDMA | Methods of Transmitting and Receiving ...




Two key multiple access techniques utilized in 2G GSM are TDMA and FDMA. The advantages of modulation techniques have already been explored. TDM and FDM allow several data streams to pass through the channel between transmitter and receiver at the same time. We can figure out what they are based on their names. For example, each GSM channel has a bandwidth of 200 KHz. Furthermore, a single channel can connect up to eight users at the same time via different time slots.
 

1. FDMA:


Frequency Division Multiple Access (FDMA) is the full name for this technique. The entire available bandwidth is subdivided into several sections or frequency bands using this strategy. Each sub-band is assigned to a certain device. It's also feasible to apply TDMA on each of the sub-bands separately.
 

2. TDMA: [↗]


Time Division Multiple Access (TDMA) is the full name for this technique. TDMA is a multiple access technology that allows us to connect many devices to a base station or access point by providing them distinct time slots. Conceptually, we use a timing "rotator" in TDMA to establish distinct slots, and then we use TDMA to link multiple devices. For example, each 2G GSM channel has a bandwidth of 200 KHz, and we connect eight users using TDMA time slots.
 

3. CDMA:[↗]

Code Division Multiple Access (CDMA) is the full name for this technique. 3G technology was the first to widely use this strategy. Different forms of coding are used in Code Division Multiple Access. The term "CDMA" can refer to a variety of communication protocols. The fundamental idea is to give each mobile phone a special code. These codes are all mutually orthogonal to one another. For example, a base station (BS) emits a signal containing many codes, which many devices attempt to decode. The signal will only be fully received by the intended user; it will be discarded by others. Simply put, we can say that there is a conference room and that there are numerous individuals speaking different languages in it. Now that one of the speakers is speaking Chinese, only those who are familiar with the language will be able to understand. A person who does not speak Chinese will hear it only as noise. The same thing happens when users have access to CDMA.

Each user in this scenario has access to the full frequency band and is free to transmit at any moment. In comparison to FDMA and TDMA, CDMA is hence more flexible. Other CDMA plans take advantage of system resources to provide multiple channels.

Spread spectrum techniques include frequency-hopping CDMA technology. Pseudorandom (PN) codes assigned to each user are used to spread the signal that will be broadcast. In frequency-hopping, this is comparable to FDMA because each user will be transmitting at a separate frequency as a result. As the PN code evolves, the user will eventually be broadcasting over a different carrier frequency for each time slot, which is akin to TDMA.
[Click here to read about CDMA in details]


4. Comparison of TDMA & FDMA:


1. In FDMA, users can transmit and receive in different frequency bands at the same time.


2. In TDMA, transmission and reception take place on the same frequency range, but at different time slots.


3. For FDMA, guard frequency bands are necessary to prevent interference, resulting in system overhead.


4. Guard time slots are required for TDMA to prevent overlapping, which affects spectral efficiency.


5. TDMA is generally more efficient in digital systems compared to traditional FDMA in terms of managing multiple users.




We can conclude from the three multiple access techniques mentioned above that we can send multiple data streams utilizing those techniques over a single signal path / route. It is also clear that while using the same transmission medium, desired users can access independent signals.


5. Advantages of CDMA Technique over FDMA and TDMA

The use of a CDMA system has some key benefits. There may be excessive multipath propagation when signals are sent across a random medium. This phenomenon results in small-scale fading. A frequency selective channel is one sort of fading channel that attenuates some frequencies more than others. Because of this, received signal strength inside this kind of channel can fluctuate significantly. 

A user in a poor frequency band will only use that specific band for a brief amount of time in an FH-CDMA scheme. Therefore, CDMA systems can aid in combating fading channels. This is a primary benefit of CDMA.

Another advantage to a CDMA code is the privacy that it can afford a user. Any receiver can pick up the wideband signal, but only the user with the correct code can decode the transmission.








Contact Us

Name

Email *

Message *

Popular Posts

MIMO Channel Matrix | Rank and Condition Number

MIMO / Massive MIMO MIMO Channel Matrix | Rank and Condition...   The channel matrix in wireless communication is a matrix that describes the impact of the channel on the transmitted signal. The channel matrix can be used to model the effects of the atmospheric or underwater environment on the signal, such as the absorption, reflection or scattering of the signal by surrounding objects. When addressing multi-antenna communication, the term "channel matrix" is used. Let's assume that only one TX and one RX are in communication and there's no surrounding object. Here, in our case, we can apply the proper threshold condition to a received signal and get the original transmitted signal at the RX side. However, in real-world situations, we see signal path blockage, reflections, etc.,  (NLOS paths [↗]) more frequently. The obstruction is typically caused by building walls, etc. Multi-antenna communication was introduced to address this issue. It makes diversity app...

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 Calculation 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 figur...

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

How to Mount Google Drive in Google Colab

How to Mount Google Drive in Google Colab Google Colab provides temporary storage during a session. Any files stored in the /content directory will be deleted when the runtime disconnects. To store datasets, trained models, and results permanently, it is recommended to mount your Google Drive in Colab. Mounting Google Drive allows your notebook to access files directly from your Drive and save outputs there so they remain available even after the Colab session ends. Step 1: Import the Drive Module First import the Google Colab drive module. from google.colab import drive Step 2: Mount Google Drive Run the following command to mount your Google Drive. from google.colab import drive drive.mount('/content/drive') After running the command: A link will appear in the output. Click the link and log in to your Google account. Copy the authentication code provided. Paste the code back into the notebook. Or, a Google authentication page will a...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...

Wiener Filter in MATLAB

  MATLAB Code  % Wiener Filter Based on Wiener-Hopf Equation % This script demonstrates how to apply the Wiener filter to recover % a reference signal from a noisy signal using the Wiener-Hopf equation. % The filter minimizes the mean squared error between the noisy signal and the reference signal. clear; close all; clc; % Signal Parameters fs = 4000; % Sampling frequency (Hz) T = 1; % Total recording time (seconds) L = T * fs; % Signal length (samples) tt = (0:L-1) / fs; % Time vector ff = (0:L-1) * fs / L; % Frequency vector % Generate Reference Signal (a sinusoid) y = sin(2 * pi * 120 * tt); % Reference sinusoidal signal y = y(:); % Ensure column vector % Create Noisy Signal by Adding Gaussian Noise x = 0.50 * randn(L, 1) + y; % Noisy signal x = x(:); % Ensure column vector % Define Filter Order (Number of Coefficients) N = 200; % Apply Wiener Filter using custom function [xest, b, MSE] = wienerFilt(x, y, N); % Plot Results figure; subplot(411); plot(tt, x, 'k'), hold on, p...

QPSK Online Simulator (Signal Generation)

Simulator for QPSK Modulation Quadrature (4-PSK) Bitstream (Even length) Carrier Freq (Hz) Samples Per Symbol Run QPSK Simulation The Math Behind QPSK Quadrature Phase Shift Keying (QPSK) is a form of digital modulation that transmits two bits per symbol by changing the phase of a carrier wave. s(t) = A cos(2Ï€f c t + θ n ) Phase (θ n ): Each pair of bits (dibit) corresponds to a specific phase shift. In Gray coding, we use: "00" → Ï€/4 (45°) "01" → 3Ï€/4 (135°) "11" → 5Ï€/4 (225°) "10" → 7Ï€/4 (315°) Efficiency: Since 4 phases are used, QPSK carries double the data of BPSK in the same bandwidth. ...

Overmodulation & Distortion in AM

Overmodulation in AM and How It Causes Distortion 1. AM Signal Equation s(t) = A c [1 + μ m(t)] cos(2Ï€ f c t) A c = carrier amplitude m(t) = normalized modulating signal (|m(t)| ≤ 1) μ = modulation index 2. Modulation Index μ = A m / A c - Normal AM: 0 < μ ≤ 1 → no distortion - Overmodulation: μ > 1 → distortion occurs 3. Envelope and Overmodulation A(t) = A c [1 + μ m(t)] - For undistorted AM: 1 + μ m(t) ≥ 0 at all times - If μ > 1: 1 + μ m(t) < 0 at negative peaks → carrier flips Example: Let m(t) = cos(2Ï€ f m t), A c = 1 V, μ = 1.2 Minimum envelope: A min = A c [1 - 1.2] = -0.2 V Negative amplitude → envelope crosses zero → 180° phase flip 4. Mathematical Consequence -A c cos(θ) = A c cos(θ + Ï€) This phase reversal is what causes distortion in the demodulated signal. 5. Instantaneous AM Signal s...