Question 1(a) [3 marks]#
Define Continuous time Signal and Discrete time Signal with Wave form.
Answer:
Signal Type | Definition | Waveform |
---|---|---|
Continuous Time Signal | Signal defined for all values of time with no breaks | graph LR; A[t] --> B[x(t)]; style B fill:#fff,stroke:#333,stroke-width:2px |
Discrete Time Signal | Signal defined only at discrete time intervals | graph LR; A[n] --> B[x[n]]; style B fill:#fff,stroke:#333,stroke-width:2px |
Diagram:
Mnemonic: “Continuous Curves, Discrete Dots”
Question 1(b) [4 marks]#
Explain Energy and power signal.
Answer:
Parameter | Energy Signal | Power Signal |
---|---|---|
Definition | Has finite energy but zero average power | Has finite average power but infinite energy |
Mathematical Expression | ∫|x(t)|²dt < ∞ | lim(T→∞) (1/2T)∫|x(t)|²dt < ∞ |
Examples | Pulse, Decaying exponential | Sine wave, Square wave |
Nature | Finite duration or decreasing amplitude | Periodic or infinite duration |
Diagram:
Mnemonic: “Energy Expires, Power Persists”
Question 1(c) [7 marks]#
Explain block diagram of digital communication system.
Answer:
graph LR A[Source] --> B[Source Encoder] B --> C[Channel Encoder] C --> D[Digital Modulator] D --> E[Channel] E --> F[Digital Demodulator] F --> G[Channel Decoder] G --> H[Source Decoder] H --> I[Destination]
Block | Function |
---|---|
Source | Generates message to be transmitted |
Source Encoder | Converts message to digital sequence, removes redundancy |
Channel Encoder | Adds controlled redundancy for error detection/correction |
Digital Modulator | Converts digital symbols to waveforms suitable for channel |
Channel | Transmission medium, adds noise and distortion |
Digital Demodulator | Converts received waveforms back to digital symbols |
Channel Decoder | Detects/corrects errors using added redundancy |
Source Decoder | Reconstructs original message from digital sequence |
Mnemonic: “Send Signals Carefully, Digital Messages Communicate Data Safely”
Question 1(c) OR [7 marks]#
Explain Unit Step function and Unit impulse function.
Answer:
Function | Mathematical Definition | Properties | Applications |
---|---|---|---|
Unit Step Function (u(t)) | u(t) = 0 for t < 0 u(t) = 1 for t ≥ 0 | - Represents sudden transition - Integral of impulse function | System response analysis |
Unit Impulse Function (δ(t)) | δ(t) = 0 for t ≠ 0 ∫δ(t)dt = 1 | - Infinitesimally narrow pulse - Sampling property - Derivative of step function | Sampling, system analysis |
Diagrams:
Mnemonic: “Step Stays steady after zero, Impulse Instantly appears then vanishes”
Question 2(a) [3 marks]#
A signal carries 8 bit/signal elements. If 1000 signal elements sent per second. Find the bit rate.
Answer:
Parameter | Value |
---|---|
Bits per signal element | 8 bits |
Signal elements per second | 1000 |
Calculation | Bit rate = (Bits per signal element) × (Signal elements per second) |
Bit rate | = 8 × 1000 = 8000 bits/second or 8 kbps |
Mnemonic: “Bits per signal × Signals per second = Bits per second”
Question 2(b) [4 marks]#
Explain Even and Odd signal.
Answer:
Signal Type | Mathematical Definition | Properties | Examples |
---|---|---|---|
Even Signal | x(-t) = x(t) | - Symmetric about y-axis - Cosine is even | Cosine function, |t| |
Odd Signal | x(-t) = -x(t) | - Anti-symmetric about y-axis - Sine is odd | Sine function, t |
Diagram:
Mnemonic: “Even reflects Exactly, Odd reflects Oppositely”
Question 2(c) [7 marks]#
Explain the block diagram of ASK modulator and de-modulator with waveform.
Answer:
ASK Modulator:
graph LR A[Digital Input] --> B[Product Modulator] C[Carrier Generator] --> B B --> D[ASK Output]
ASK Demodulator:
graph LR A[ASK Signal] --> B[Envelope Detector] B --> C[Comparator] C --> D[Digital Output]
Waveforms:
Concept | Description |
---|---|
ASK Modulation | Amplitude varies according to digital data (0 or 1) |
Modulator Components | Product modulator multiplies carrier with digital signal |
Demodulator Components | Envelope detector extracts amplitude, comparator regenerates digital signal |
Mnemonic: “ASK Adjusts Signal’s Knockout amplitude”
Question 2(a) OR [3 marks]#
A signal has a bit rate of 4000 bit/second and a baud rate of 1000 baud. How many data elements are carried by each signal element?
Answer:
Parameter | Value |
---|---|
Bit rate | 4000 bits/second |
Baud rate | 1000 baud (signal elements/second) |
Formula | Number of data elements = Bit rate ÷ Baud rate |
Data elements per signal | = 4000 ÷ 1000 = 4 bits/signal element |
Mnemonic: “Bits divided by Bauds equals Bits per signal”
Question 2(b) OR [4 marks]#
Explain Periodic and aperiodic signal.
Answer:
Signal Type | Definition | Mathematical Condition | Examples |
---|---|---|---|
Periodic Signal | Repeats after fixed time interval | x(t) = x(t+T) for all t | Sine wave, Square wave |
Aperiodic Signal | Does not repeat after any time interval | x(t) ≠ x(t+T) for any T | Pulse, Noise |
Diagram:
Mnemonic: “Periodic Perfectly repeats, Aperiodic Alters always”
Question 2(c) OR [7 marks]#
Explain the block diagram of PSK modulator and de-modulator with waveform.
Answer:
PSK Modulator:
graph LR A[Digital Input] --> B[Phase Shifter] C[Carrier Generator] --> B B --> D[PSK Output]
PSK Demodulator:
graph LR A[PSK Signal] --> B[Product Detector] C[Carrier Recovery] --> B B --> D[Low Pass Filter] D --> E[Decision Device] E --> F[Digital Output]
Waveforms:
Parameter | Description |
---|---|
PSK Modulation | Phase shifts according to digital data (0 or 1) |
Phase States | 0° for bit ‘1’, 180° for bit ‘0’ |
Advantages | Better noise immunity than ASK |
Mnemonic: “PSK Phases Shift with Knowledge”
Question 3(a) [3 marks]#
Explain the working of FSK modulator with block diagram and output Waveform.
Answer:
FSK Modulator Block Diagram:
graph LR A[Digital Input] --> B[Voltage Controlled Oscillator] B --> C[FSK Output]
FSK Waveforms:
- Principle: Digital bit ‘1’ sends carrier with frequency f1, bit ‘0’ sends carrier with frequency f2
- Working: Voltage controlled oscillator changes frequency based on input bit value
Mnemonic: “Frequency Shifts for Knowledge transmission”
Question 3(b) [4 marks]#
Draw the PSK modulation waveform for the sequence of 1010110110.
Answer:
Table for PSK modulation:
Bit | Phase |
---|---|
1 | 0° |
0 | 180° |
Mnemonic: “One-Zero, Phase-Shifts, Keep-Signal Modulated”
Question 3(c) [7 marks]#
Draw the ASK and FSK modulation waveform for the sequence of 1100110101.
Answer:
Digital Input Sequence: 1100110101
Table for comparison:
Bit | ASK | FSK |
---|---|---|
1 | Carrier ON (high amplitude) | Higher frequency (f1) |
0 | Carrier OFF (zero/low amplitude) | Lower frequency (f2) |
Mnemonic: “Amplitude Shows Knowledge, Frequency Shifts Knowledge”
Question 3(a) OR [3 marks]#
Explain the working of MSK modulator with block diagram and output Waveform.
Answer:
MSK Modulator Block Diagram:
graph LR A[Digital Input] --> B[Serial to Parallel] B -->|I-Channel| C[I-Channel Modulator] B -->|Q-Channel| D[Q-Channel Modulator] E[Carrier Generator] --> C E -->|90° Phase Shift| D C --> F[Adder] D --> F F --> G[MSK Output]
MSK Features:
- Continuous phase FSK with frequency deviation exactly half bit rate
- Phase changes occur smoothly (no abrupt phase changes)
- Better spectral efficiency than FSK
Mnemonic: “Minimum Shift Keeps spectrum narrow”
Question 3(b) [4 marks]#
Draw the constellation diagram of 8-PSK and 16-QAM.
Answer:
8-PSK Constellation:
16-QAM Constellation:
Modulation | Description |
---|---|
8-PSK | 8 points equally spaced around circle, 3 bits per symbol |
16-QAM | 16 points in square grid, varying amplitude and phase, 4 bits per symbol |
Mnemonic: “PSK Points on Single circle, QAM Quadrature Amplitude Matrix”
Question 3(c) OR [7 marks]#
Draw BPSK and QPSK modulation waveform for 1010101011.
Answer:
BPSK Modulation:
QPSK Modulation (grouping bits in pairs):
Bit Pair | QPSK Phase |
---|---|
10 | 90° |
00 | 180° |
01 | 270° |
11 | 0° |
Mnemonic: “Binary Phase Shifts Keys, Quadrature Phase Shifts Keys”
Question 4(a) [3 marks]#
Encode the data using Shanon Fano code for below probability sequence. P = {0.30, 0.25, 0.20, 0.12, 0.08, 0.05}
Answer:
Symbol | Probability | Shannon-Fano Code |
---|---|---|
S1 | 0.30 | 00 |
S2 | 0.25 | 01 |
S3 | 0.20 | 10 |
S4 | 0.12 | 110 |
S5 | 0.08 | 1110 |
S6 | 0.05 | 1111 |
Process:
- Sort symbols by decreasing probability
- Split into two groups with nearly equal probability (0.30+0.25=0.55, 0.20+0.12+0.08+0.05=0.45)
- Assign 0 to first group, 1 to second group
- Recursively continue for each subgroup
Mnemonic: “Separate, Fano divides, Code efficiently”
Question 4(b) [4 marks]#
Explain Hamming code.
Answer:
Aspect | Description |
---|---|
Definition | Linear error-correcting code that detects double errors and corrects single errors |
Parity bits | For m data bits, need k parity bits where 2^k ≥ m+k+1 |
Position | Parity bits placed at positions 1, 2, 4, 8, 16… (powers of 2) |
Error detection | Calculate syndrome to locate error position |
Example Hamming(7,4):
Mnemonic: “Hamming Helps Handle Bit Errors”
Question 4(c) [7 marks]#
Compare TDMA and FDMA.
Answer:
Parameter | TDMA (Time Division Multiple Access) | FDMA (Frequency Division Multiple Access) |
---|---|---|
Basic Principle | Divides channel by time slots | Divides channel by frequency bands |
Resource Allocation | Each user gets entire bandwidth for short time | Each user gets portion of bandwidth all the time |
Guard Period | Time guard bands between slots | Frequency guard bands between channels |
Synchronization | Strict timing synchronization required | No timing synchronization needed |
Efficiency | Higher, due to burst transmission | Lower, due to fixed assignment |
Complexity | More complex | Relatively simple |
Examples | GSM, DECT | FM radio, Traditional satellite systems |
Diagram:
Mnemonic: “Time Divides Multiple Access, Frequency Divides Multiple Access”
Question 4(a) OR [3 marks]#
Encode the data using Huffman code for below probability sequence. P = {0.4, 0.2, 0.2, 0.1, 0.1}
Answer:
Symbol | Probability | Huffman Code |
---|---|---|
S1 | 0.4 | 0 |
S2 | 0.2 | 10 |
S3 | 0.2 | 11 |
S4 | 0.1 | 100 |
S5 | 0.1 | 101 |
Process:
- Start with sorted probabilities
- Combine lowest two probabilities (0.1+0.1=0.2)
- Rearrange and repeat until only two nodes remain
- Assign bits by traversing tree
Tree Construction:
Mnemonic: “Huffman Helps encode High-frequency data”
Question 4(b) OR [4 marks]#
Explain parity code.
Answer:
Aspect | Description |
---|---|
Definition | Simple error detection scheme that adds parity bit |
Types | Even parity: total 1s is even Odd parity: total 1s is odd |
Calculation | XOR all data bits to generate parity bit |
Capability | Detects odd number of errors, cannot correct errors |
Examples:
Mnemonic: “Parity Provides Primitive Error detection”
Question 4(c) OR [7 marks]#
Explain FDMA Technique in detail.
Answer:
FDMA (Frequency Division Multiple Access):
graph TD A[Available Bandwidth] --> B[Frequency Division] B --> C[User 1 Channel] B --> D[User 2 Channel] B --> E[User 3 Channel] B --> F[User N Channel]
Parameter | Description |
---|---|
Basic Principle | Total bandwidth divided into non-overlapping frequency bands |
Channel Assignment | Each user assigned dedicated frequency band |
Guard Bands | Small frequency gaps between channels to prevent interference |
Duplexing | Usually implemented with FDD (Frequency Division Duplexing) |
Advantages | Simple implementation, no synchronization required |
Disadvantages | Inefficient for bursty traffic, fixed allocation wastes bandwidth |
Applications | AM/FM radio, Traditional cable TV, First-generation mobile systems |
Frequency Allocation:
Mnemonic: “Fixed Division for Multiple Access”
Question 5(a) [3 marks]#
Explain E1 Career system.
Answer:
Parameter | Description |
---|---|
Description | European standard digital transmission format |
Capacity | 2.048 Mbps |
Channel Structure | 32 time slots (numbered 0-31) |
Voice Channels | 30 voice channels (64 kbps each) |
Signaling | Time slot 16 for signaling |
Frame Alignment | Time slot 0 for synchronization |
Diagram:
Mnemonic: “E1 Enables 30 + 2 time slots”
Question 5(b) [4 marks]#
Explain TDMA Access technique.
Answer:
Parameter | Description |
---|---|
Definition | Multiple access technique that divides time into slots for different users |
Working Principle | Each user gets entire bandwidth for a short time period |
Frame Structure | Time divided into frames, frames divided into slots |
Guard Time | Small time gap between slots to prevent overlap |
Synchronization | Requires precise timing synchronization |
TDMA Frame Structure:
Mnemonic: “Time Divides Multiple Access”
Question 5(c) [7 marks]#
Explain IoT − Concept, Features, Advantages and Disadvantages.
Answer:
IoT Concept:
graph TD A[Physical Objects] -->|Sensors| B[Internet Connectivity] B --> C[Data Collection] C --> D[Data Analysis] D --> E[Automated Actions] E --> A
Aspect | Description |
---|---|
Concept | Network of physical objects embedded with sensors, software, and connectivity |
Features | - Connectivity (devices connected to internet) - Intelligence (smart decision making) - Sensing (collecting data from environment) - Automation (minimal human intervention) - Scalability (handles many devices) |
Advantages | - Improved efficiency and productivity - Better resource management - Enhanced decision making - Convenience and time-saving - New business opportunities |
Disadvantages | - Security vulnerabilities - Privacy concerns - Complexity in implementation - Compatibility issues - Dependence on internet |
Application Areas:
- Smart homes, cities
- Healthcare monitoring
- Industrial automation
- Agriculture
- Transportation
Mnemonic: “Internet of Things: Connected, Automated, Smarter Decisions”
Question 5(a) OR [4 marks]#
Explain T1 Career TDM system.
Answer:
Parameter | Description |
---|---|
Description | North American standard digital transmission format |
Capacity | 1.544 Mbps |
Channel Structure | 24 time slots (channels) + 1 framing bit |
Voice Channels | 24 voice channels (64 kbps each) |
Frame Structure | 193 bits per frame (24 × 8 + 1) |
Signaling | Robbed bit signaling (least significant bit) |
Diagram:
Mnemonic: “T1 Transmits 24 channels”
Question 5(b) OR [3 marks]#
Compare TDM and FDM.
Answer:
Parameter | TDM (Time Division Multiplexing) | FDM (Frequency Division Multiplexing) |
---|---|---|
Basic Principle | Divides channel by time | Divides channel by frequency |
Signal Separation | In time domain | In frequency domain |
Guard Bands | Time guard bands | Frequency guard bands |
Implementation | Digital technique | Analog technique (originally) |
Crosstalk | Less susceptible | More susceptible |
Synchronization | Required | Not required |
Diagram:
Mnemonic: “Time Divides Multiplexing, Frequency Divides Multiplexing”
Question 5(c) OR [7 marks]#
Explain security components of information security.
Answer:
The CIA Triad of Information Security:
graph TD A[Information Security] --> B[Confidentiality] A --> C[Integrity] A --> D[Availability] B --> E[Encryption, Access Controls] C --> F[Hashing, Digital Signatures] D --> G[Redundancy, Fault-tolerance]
Component | Description | Implementation Methods |
---|---|---|
Confidentiality | Protection against unauthorized access | - Encryption - Access controls - Authentication - Steganography |
Integrity | Ensuring data is accurate and unaltered | - Hashing - Digital signatures - Version control - Checksums |
Availability | Ensuring systems are accessible when needed | - Redundancy - Backups - Disaster recovery - Fault tolerance |
Authentication | Verifying identity | - Passwords - Biometrics - Smart cards - Multi-factor |
Non-repudiation | Preventing denial of actions | - Digital signatures - Audit logs - Timestamps |
Security Threats:
- Malware (viruses, worms, trojans)
- Social engineering
- Denial of Service (DoS)
- Man-in-the-middle attacks
- Insider threats
Mnemonic: “CIA Protects All Network Data”