Cs Task Report
Cs Task Report
EC3601-1
Communication Systems-II
Task Report for Communication Systems-II
AM A Task Report Submitted By
4 M-ary QAM 17
4.1 M-ary Quadrature Amplitude Modulation (M-ary QAM): . . . . 17
4.2 Block Diagram: . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
4.3 symbol constellation diagram for m-ary qam : . . . . . . . . . . . 18
4.4 Procedure: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
1
Task Report for Communication Systems-II
IT
4.4.1 Simulation Setup Procedure . . . . . . . . . . . . . . . . . 18
4.5 Simulated Circuit Diagram: . . . . . . . . . . . . . . . . . . . . . 19
4.6 Constellation Diagram: . . . . . . . . . . . . . . . . . . . . . . . . 20
4.7 Output Waveforms and Constellation Diagram: . . . . . . . . . . 20
6 Generation of PN sequence(32bits) 26
6.1 Theory: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
AM6.2 PN Sequence Generation Using LFSR: .
6.3 Mathematical Representation: . . . . . .
6.4 Circuit Diagram: . . . . . . . . . . . . .
6.5 Block Diagram: . . . . . . . . . . . . . .
6.6 Procedure for PN Sequence Generation:
6.7 Simulated Circuit: . . . . . . . . . . . .
6.8 Output: . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
26
26
26
26
28
29
29
M
IT
1 Pulse Code Modulation (PCM)
1.1 Pulse Code Modulation (PCM)
Pulse Code Modulation (PCM) is a digital modulation technique in which an
analog signal is sampled, quantized, and then encoded into a binary sequence
for digital transmission. PCM is commonly used in digital telecommunication
systems to convert analog voice signals into digital data.
1.1.1 Modulation
The modulation process in PCM involves three main steps:
1. Sampling: The continuous analog signal is sampled at regular intervals
to produce a discrete-time signal. The sampling rate must satisfy the Nyquist
AM
criterion, which states that the sampling frequency should be at least twice the
highest frequency present in the signal.
2. Quantization: The amplitude of each sample is approximated to the
nearest value from a finite set of levels. This process introduces a small error
known as quantization noise.
3. Encoding: Each quantized sample is represented as a binary code. The
resulting binary sequence is the digital representation of the original analog
signal.
The PCM signal can be represented mathematically as:
s[n] = Q(x(nTs ))
where:
• s[n]: PCM signal at the n-th sample
• Q(·): Quantization function
• x(nTs ): Sampled analog signal at sampling interval Ts
1.1.2 Demodulation
The demodulation process in PCM involves decoding the binary sequence back
into an analog signal. This process can be broken down into: Decoding: The
M
received binary sequence is converted back into discrete quantized values. Each
binary code corresponds to one quantization level.
2.Reconstruction: A low-pass filter is applied to the quantized values to re-
construct the original analog signal. The output signal is a close approximation
of the original input signal, with some loss due to quantization.
The reconstructed signal x̂(t) is given by:
∞
X t − nTs
x̂(t) = s[n] · sinc
n=−∞
Ts
where:
IT
• x̂(t): Reconstructed analog signal
• s[n]: Quantized sample at the n-th interval
• Ts : Sampling interval
• sinc(·): Sinc function, used to reconstruct the continuous signal from dis-
crete samples
In this way, PCM enables the transmission of analog signals in a digital
format by encoding and decoding the amplitude information through sampling,
quantization, and binary encoding.
1.2
AM Block Diagram:
IT
1.3 Basic Elements of PCM:
PCM consists of several key elements that convert an analog signal into a digital
signal for transmission and then back to an analog signal at the receiver. The
basic elements of a PCM system are:
1.3.1 Sampling:
• The continuous-time analog signal is sampled at regular intervals.
• The sampling rate must satisfy the Nyquist criterion, which states that the
sampling frequency should be at least twice the highest frequency present
in the analog signal.
AM
1.3.2 Quantization:
• After sampling, each sample is approximated to the nearest value from a
finite set of discrete levels. This process is called quantization.
• The difference between the actual sample and its quantized value is known
as quantization error.
1.3.3 Encoding:
• Each quantized sample is converted into a binary code using an encoder.
The number of bits required depends on the number of quantization levels
(L), where L = 2n , and n is the number of bits.
• The output of the encoder is a binary stream, representing the digital
version of the original analog signal.
• Noise and interference may affect the transmitted signal, but PCM is
robust to noise, ensuring reliable transmission.
IT
1.3.6 Reception and Decoding:
• At the receiver, the transmitted binary stream is decoded back into quan-
tized values.
• These values are used to reconstruct the signal through a process of digital-
to-analog conversion (DAC).
• Simulate the circuit and observe the PCM signal using virtual oscil-
loscopes or signal analyzers.
4. Build the PCM demodulator circuit:
• Add a phase detector and a digital decoder for demodulation.
IT
1.5 Simulated Circuit Diagram
AM
Figure 2: Simulated Circuit Diagram for PCM Modulation and Demodulation
IT
2 Delta Modulation (DM)
s[n] =
(
s[n − 1] + ∆ if x[n] > s[n − 1]
s[n − 1] − ∆ if x[n] < s[n − 1]
where:
• s[n]: The predicted signal value at the n-th sample
• x[n]: The actual sample value at the n-th sample
• ∆: Fixed step size
3. Binary Encoding: If the signal increases (i.e., x[n] > s[n − 1]), a ”1” is
transmitted; if it decreases (i.e., x[n] < s[n − 1]), a ”0” is transmitted. This
binary sequence represents the changes in the signal over time.
M
2.1.2 Demodulation
The demodulation process in Delta Modulation involves reconstructing the sig-
nal by integrating the binary data stream, adding or subtracting the fixed step
size ∆ based on the received bits.
1. Step Integration*: For each received bit:
• If the bit is ”1,” the reconstructed signal value increases by ∆.
• If the bit is ”0,” the reconstructed signal value decreases by ∆.
IT
2.Reconstruction: The demodulated signal ŝ[n] is reconstructed using the
following expression:
ŝ[n] = ŝ[n − 1] + b[n] · ∆
where:
• ŝ[n]: Reconstructed signal at the n-th sample
• b[n]: Binary value of the received bit at the n-th sample (1 for increase,
-1 for decrease)
IT
2.3 Procedure:
2.3.1 Simulation Setup Procedure
1. Open simulation software:
IT
2.4 Simulated Circuit Diagram:
IT
3 Amplitude Modulation and Demodulation (AM)
3.1.1 Modulation
In AM, the amplitude of the carrier signal is modified based on the message (or
information) signal. The mathematical representation of AM is:
AM
where:
s(t) = [1 + m(t)] · Ac cos(ωc t)
IT
3. DC Offset Removal: If necessary, the constant term (1) is removed to
retrieve the original message signal m(t).
The demodulated output can be represented as:
where senv (t) is the envelope of the rectified AM signal, and m̂(t) is the recovered
message signal after removing the DC offset.
IT
3.3 Circuit Diagram:
3.4 Procedure:
3.4.1 Simulation Setup Procedure
1. Open circuit simulation software:
IT
2. Build the modulator circuit:
• Design the modulator circuit with a carrier generator, message signal
generator, and modulator (e.g., mixer or multiplier).
3. Run the simulation:
• Simulate the circuit and observe the AM signal using virtual oscillo-
scopes or signal analyzers.
4. Build the demodulator circuit:
• Add a diode detector and low-pass filter in the simulation for the
demodulation process.
AM5. Run and verify the demodulation:
3.5
• Simulate the demodulation and check the recovered signal, comparing
it with the original message signal.
IT
3.6 Output Waveform
IT
4 M-ary QAM
where:
• AI and AQ : Amplitudes of the in-phase and quadrature components,
respectively.
IT
4.3 symbol constellation diagram for m-ary qam :
AM
Figure 13: symbol constellation Diagram for M-ary QAM Modulation
4.4 Procedure:
4.4.1 Simulation Setup Procedure
1. Open simulation software:
• Launch circuit simulation software such as MATLAB, Simulink, or
Multisim.
M
2. Build the M-ary QAM Modulator:
• Design the modulator with two signal paths: one for the in-phase
component (I) and one for the quadrature component (Q).
• Use two mixers (multipliers) to modulate the carrier signal with both
components, followed by summing them to form the QAM signal.
3. Run the modulation simulation:
• Simulate the M-ary QAM modulator and observe the constellation
diagram and transmitted signal on a virtual oscilloscope.
IT
4. Build the M-ary QAM Demodulator:
• Design the demodulator with two mixers, followed by low-pass filters
to extract the in-phase and quadrature components.
• Use a symbol detector to recover the transmitted symbols from the
received signal.
AM
4.5 Simulated Circuit Diagram:
Figure 14: Simulated Circuit Diagram for M-ary QAM Modulation and Demod-
ulation
M
IT
4.6 Constellation Diagram:
IT
5 Phase Locked Loop(PLL)
5.1 Theory:
A Phase Locked Loop (PLL) is a versatile electronic servo system that com-
pares the phase and frequency of a given signal with an internally generated
reference signal. It is used in various applications like frequency multiplication,
FM detector, AM modulator and demodulator, Frequency Shift Keying (FSK),
etc.
where fL is the lock range, C is the filter capacitor, and R = 3.6 × 103 . ation.
IT
5.2 Block Diagram
IT
5.2.1 MATLAB Code - Part 1
IT
5.2.2 MATLAB Code - Part 2
IT
5.3 Output Waveform:
AM
M
IT
6 Generation of PN sequence(32bits)
6.1 Theory:
A Pseudorandom Noise (PN) sequence is a sequence of binary values (0s and
1s) that appears random but is generated deterministically. PN sequences are
widely used in communication systems, cryptography, and spread spectrum
techniques, such as CDMA (Code Division Multiple Access).
A common method for generating PN sequences is through the use of a Lin-
ear Feedback Shift Register (LFSR). The LFSR is a shift register with feedback,
where the input bit is a linear function of the previous state of the register.
AM
6.2 PN Sequence Generation Using LFSR:
An LFSR generates a PN sequence by shifting bits through the register and
using feedback from specific positions of the register. The feedback function
is defined by the taps of the LFSR. For example, an n-bit LFSR with taps at
positions 1 and 3 will generate a sequence based on the XOR of the bits at those
positions.
The characteristic polynomial for an LFSR is a polynomial whose degree
represents the length of the register, and the taps correspond to the exponents
of the terms in the polynomial.
The sequence produced by the LFSR repeats after a certain period, which
depends on the number of bits in the register and the tap positions.
IT
AM
Figure 19: Circuit diagram for PN sequence generation using LFSR
M
IT
6.6 Procedure for PN Sequence Generation:
The PN sequence generator uses a linear feedback shift register (LFSR) config-
uration with feedback based on a polynomial p(z) = z 4 + z + 1. The steps for
generating the PN sequence are as follows:
1. Initialize the shift register with a non-zero seed value across registers
z0 , z1 , z2 , z3 , and z4 .
2. At each time step, compute the feedback bit by XORing the outputs of
z4 and z1 as specified by the feedback polynomial:
Feedback = z4 ⊕ z1
AM3. Shift the contents of each register to the next register:
• z3 is shifted to z4 ,
• z2 is shifted to z3 ,
• z1 is shifted to z2 ,
• z0 is shifted to z1 ,
IT
6.7 Simulated Circuit:
The simulated circuit for the PN sequence generator is shown in Figure 21. The
simulation can be performed using tool simulink, where you can simulate the
LFSR and observe the output sequence.
6.8 Output:
The output of the PN sequence generator is shown in Figure 22. This output is
the result of running the simulated circuit ,displaying the generated PN sequence
over time.
M