CS601: Data Communication — Complete Cheat Sheet
Every definition, formula, example, and diagram from the complete handouts (Topics 1–220, 361 pages).
Chapter 1: Introduction to Data Communication
- Communication: Sharing of information, either local or remote.
- Telecommunications: Communication at a distance — includes telephony, telegraph, television, etc.
- Data Communications: Exchange of data between two devices via some form of transmission medium.
A Simple Communication Model
A simple communication model consists of a source generating data, a transmitter converting data to signals, a transmission system (medium) carrying signals, a receiver converting signals back to data, and a destination capturing the data.
Effectiveness of a Data Communication System
Depends on four fundamental characteristics:
- Delivery: The system must deliver data to the correct destination. Data must be received by the intended device or user and only by that device or user.
- Accuracy: The system must deliver data accurately. Data altered in transmission and left uncorrected are unusable.
- Timeliness: The system must deliver data in a timely manner. Data delivered late are useless. For video/audio, this means delivering data as produced, in the same order, without significant delay (real-time transmission).
- Jitter: Variation in the packet arrival time. Uneven delay in delivery of audio/video packets. E.g., if some packets arrive with 30 ms delay and others with 40 ms delay, uneven quality results.
Five Components of a Data Communication System
- Message: The information (data) to be communicated. Forms: text, numbers, images, audio, video.
- Sender: The device that sends the data message (computer, workstation, phone, camera, etc.).
- Receiver: The device that receives the message (computer, workstation, phone, TV, etc.).
- Transmission Medium: The physical path by which a message travels — twisted-pair wire, coaxial cable, fiber-optic cable, radio waves.
- Protocol: A set of rules that governs data communications. An agreement between communicating devices. Without a protocol, two devices may be connected but not communicating.
Data Representation
Information comes in different forms:
- Text: Represented as a bit pattern — a sequence of bits (0s and 1s). Different sets of bit patterns are called coding systems (e.g., ASCII, Unicode).
- Numbers: Also represented by bit patterns. Not coded as text; directly converted to binary.
- Images: Composed of a matrix of pixels. Pixel color/intensity encoded into bit patterns (e.g., RGB).
- Audio: Continuous (analog) signal — recorded and converted to digital.
- Video: Sequence of images (frames) displayed in time — either continuous or a combination of images.
Data Flow (Transmission Modes)
Communication between two devices can occur in three modes:
| Mode | Description | Example |
|---|---|---|
| Simplex | Unidirectional. Only one device can transmit, the other can only receive. Entire channel capacity used in one direction. | Keyboard, traditional monitor, TV broadcast. |
| Half-Duplex | Bidirectional but not simultaneously. Each station can transmit and receive, but not at the same time. | Walkie-talkie, CB radio. |
| Full-Duplex | Simultaneous bidirectional communication. Both stations can transmit and receive at the same time. | Telephone network, mobile phone. |
The key distinction between Half-Duplex and Full-Duplex is simultaneousness. Half-duplex allows two-way traffic but only one direction at a time; full-duplex allows concurrent two-way traffic.
Chapter 2: Networks & Physical Topologies
Network: Interconnection of a set of devices capable of communication. Devices can be hosts (computers, phones) or connecting devices (routers, switches, modems).
Network Criteria
A network must meet certain criteria:
- Performance: Measured by Throughput (actual data transfer rate) and Delay (time for data to travel). Depends on number of users, type of medium, hardware/software capabilities.
- Reliability: Measured by frequency of failure, time to recover, and network robustness in a catastrophe.
- Security: Protection of data from unauthorized access and damage, implementation of policies for breach recovery.
Physical Structures
- Link: A communications pathway that transfers data from one device to another.
- Point-to-Point Connection: Dedicated link between two devices. Entire capacity reserved for those two devices.
- Multipoint (Shared) Connection: More than two devices share a single link. Capacity shared spatially or temporally.
Physical Topologies
Topology = the geometric representation of the relationship of all links and linking devices (Links + Nodes = Topology). Four basic topologies:
| Topology | Formula / Key Detail | Pros | Cons |
|---|---|---|---|
| Mesh | Dedicated links. Links = \(\frac{N(N-1)}{2}\). I/O ports per device = \(N-1\). | Robust; no traffic congestion; secure; easy fault identification. | Expensive cabling; difficult installation; high hardware cost. |
| Star | All nodes connect to central hub/switch. Links = \(N\). | Less expensive than mesh; easy to install and reconfigure; single-link failure doesn't affect others. | Single point of failure (hub/switch failure kills entire network). |
| Bus | Multipoint connection. One backbone cable; drop lines and taps connect nodes. | Easy installation; cheap cabling (less cable than mesh/star). | Difficult reconfiguration; limited tap count; cable break disables entire network. |
| Ring | Dedicated links to left and right neighbors. Circular signal flow. | Easy to install and reconfigure; simple fault isolation. | Unidirectional traffic; break in ring disables the whole network (unless dual-ring). |
$$\text{Total Duplex Links} = \frac{N(N-1)}{2}$$
Each device needs \(N - 1\) I/O ports.
Chapter 3: Network Types, Switching & The Internet
Network Classification
Networks are classified by: Size, Geographical Coverage, and Ownership.
Local Area Networks (LAN)
- Usually privately owned.
- Connects hosts in a single office, building, or campus.
- Can be as simple as two PCs and a printer in someone's home office, or extend throughout a company.
- Each device in a LAN has a host address.
Wide Area Networks (WAN)
- Wider geographical span than LAN — spans a town, state, country, or the world.
- Interconnects connecting devices such as switches, routers, or modems.
- Normally created and run by communication companies (ISPs, telcos).
- Point-to-Point WAN: Connects two devices through a transmission medium (e.g., leased line).
- Switched WAN: Connects multiple end systems through switching nodes (e.g., backbone of the Internet).
- Internetwork: When two or more networks are connected — the result is an internetwork (or internet with lowercase 'i').
Switching
| Feature | Circuit-Switched Network | Packet-Switched Network |
|---|---|---|
| Path | Dedicated physical path established before transmission. | No dedicated path; packets routed independently. |
| Resources | Bandwidth reserved and dedicated for entire session. | No reservation; channels shared dynamically. |
| Congestion | No congestion once circuit is set up. | Possible delay/packet loss if bandwidth insufficient (queuing). |
| Utilization | Low (silence wastes capacity). | High — efficient for bursty data. |
| Example | Traditional telephone networks. | The Internet. |
The Internet
- An internet (lowercase 'i') = two or more networks that can communicate with each other.
- The Internet (uppercase 'I') = the worldwide communication system composed of thousands of interconnected networks.
- Users access the Internet through Internet Service Providers (ISPs).
Internet History
- Telegraph and telephone networks before 1960: constant-rate communication only.
- ARPANET — first packet-switched network (early 1970s).
- Birth of the Internet and TCP/IP (presented 1973, officially adopted 1983).
- MILNET — military network split from ARPANET.
- CSNET — Computer Science Network for universities without ARPANET access.
- NSFNET — National Science Foundation Network, backbone for academic and research traffic.
- Internet today — a massive global infrastructure.
Internet Standards & Administration
- Internet Draft: A working document submitted by individuals or groups. No official status yet.
- Request for Comments (RFC): A published document detailing Internet standards and
information. Types:
- Proposed Standard — a stable, well-understood specification.
- Draft Standard — at least two independent implementations exist.
- Internet Standard — fully mature specification.
- Historic — obsolete or superseded.
- Experimental — for testing purposes.
- Informational — provides general information.
- Internet administration bodies include ISOC (Internet Society), IAB (Internet Architecture Board), IETF (Internet Engineering Task Force), IRTF (Internet Research Task Force).
Chapter 4: Protocol Layering & TCP/IP Protocol Suite
Protocol: Rules that both sender, receiver, and all intermediate devices must follow to communicate effectively.
Protocol Layering: For complex communication, we need a protocol at each layer. Simple communication may use one protocol; complex communication requires a stack of protocols.
Advantages & Disadvantages of Protocol Layering
- Advantages:
- Modularity: Each layer can be independently designed and updated.
- Separation of Service & Implementation: Each layer provides a service without exposing how it works.
- Reduced Complexity & Cost.
- Disadvantages: None really! Protocol layering is universally beneficial.
Two Principles of Protocol Layering
- Bidirectional Communication: Each layer must perform two opposite tasks, one in each direction.
- Identical Objects: The two objects under each layer at both communicating sites should be identical.
Logical Connections
Each layer has an imaginary (logical) connection to the same layer at the other side. Data appears to flow horizontally between peer layers, though it physically flows vertically through the stack.
TCP/IP Protocol Suite (5 Layers)
- The protocol suite used in the Internet today.
- Each layer provides specific functionality; hierarchical protocol.
- Presented in 1973 and chosen as the official protocol of the Internet in 1983.
| Layer | Name | Data Unit | Key Functions |
|---|---|---|---|
| 5 | Application | Message | Supports network applications and user interfaces. Protocols: HTTP, FTP, SMTP, DNS, Telnet. |
| 4 | Transport | Segment (TCP) / User Datagram (UDP) | Process-to-process delivery. Connection control, flow control, error control. Protocols: TCP, UDP. |
| 3 | Network | Datagram | Source-to-destination packet delivery across networks. Logical addressing (IP) and routing. |
| 2 | Data Link | Frame | Node-to-node delivery. Framing, physical addressing (MAC), flow control, error control, access control. |
| 1 | Physical | Bits | Bit-level transmission over physical medium. Encoding, data rate, bit synchronization, physical topology, transmission mode. |
Identical Objects at Each Layer
- Layer 5 (Application): Identical objects are messages.
- Layer 4 (Transport): Identical objects are segments or user datagrams.
- Layer 3 (Network): Identical objects are datagrams.
- Layer 2 (Data Link): Identical objects are frames.
- Layer 1 (Physical): Identical objects are bits.
Encapsulation & Decapsulation
As a message travels down the sender's protocol stack, each layer adds its own header (and trailer at Data Link layer) — this is Encapsulation. At the receiver, as data moves up the stack, these headers are stripped — this is Decapsulation.
This is an important concept in Internet protocol layering. Each layer header contains control information needed by the peer layer at the other end.
Addressing in TCP/IP
Every communication needs at least two addresses: Source Address and Destination Address. The Physical Layer is an exception (no addressing).
| Layer | Address Type | Size | Example |
|---|---|---|---|
| Application | Specific Address (user-friendly) | Variable | student@vu.edu.pk, www.google.com |
| Transport | Port Address | 16-bit | Port 80 (HTTP), Port 23 (Telnet) |
| Network | Logical (IP) Address | 32-bit (IPv4) / 128-bit (IPv6) | 192.168.1.1 |
| Data Link | Physical (MAC) Address | 48-bit (6 bytes) | 07:01:02:01:2C:4B |
| Physical | None | — | — |
Chapter 5: The OSI Model
The Open System Interconnection (OSI) Model
- Developed by the International Organization for Standardization (ISO), established in 1947.
- Close to three-fourths of countries represented.
- Introduced the OSI Model in the late 1970s.
- OSI is a 7-Layer Model.
OSI Model vs TCP/IP Protocol Suite
- Two layers of OSI are missing from TCP/IP:
- Session Layer: Establishes, maintains, and synchronizes interactions (dialog control, synchronization points).
- Presentation Layer: Handles data translation, encryption/decryption, compression, formatting.
- In TCP/IP, the Application layer = Application + Presentation + Session (of OSI).
Why the OSI Model Did Not Succeed
Three reasons OSI did not replace TCP/IP:
- Bad Timing: OSI was completed when TCP/IP was already fully in place and widely adopted.
- Bad Technology: Some layers in OSI were not fully defined; the model was complex.
- Bad Performance: Performance of TCP/IP was better than that of OSI implementations.
Data Communication vs. Computer Networks
Data Communication covers the fundamentals of how data is transmitted: analog & digital transmission, transmission media, switching, error detection and correction, media access and data link control, wired and wireless LANs. Computer Networks focuses on the higher-level protocols and applications built on top.
Chapter 6: Analog & Digital Signals
Communication at the Physical Layer
The physical layer deals with the actual transmission of bits over a physical medium.
Analog vs. Digital Data
- Analog Data: Continuous values — has infinite possible values. Example: analog clock hands, human voice.
- Digital Data: Discrete values — has a limited number of defined values. Example: digital clock, data stored in a computer.
Analog vs. Digital Signals
- Signals represent data — signals can be analog or digital.
- Analog Signal: Infinite levels of intensity over time — a smooth, continuous waveform.
- Digital Signal: Limited number of defined values — a step-function waveform with discrete levels.
Periodic & Non-Periodic Signals
- Both analog and digital signals can be periodic or non-periodic.
- Periodic Signal: Completes a pattern within a measurable time frame; repeats the pattern over identical periods (cycles).
- Non-Periodic Signal: No pattern; changes without repeating.
- In data communications, we use: Periodic ANALOG signals and Non-periodic DIGITAL signals.
Periodic Analog Signals
- Can be simple or composite.
- Simple Periodic Analog Signal: The sine wave — cannot be decomposed into simpler signals.
- Composite Periodic Analog Signal: Composed of multiple sine waves.
Sine Wave — Three Parameters
1. Peak Amplitude (\(A\))
- The absolute value of the signal's highest intensity.
- Proportional to the energy it carries.
- Measured in Volts (for electrical signals).
2. Frequency (\(f\)) and Period (\(T\))
- Period (T): Amount of time required to complete 1 cycle (in seconds).
- Frequency (f): Number of periods (cycles) in 1 second (in Hertz).
- Relationship: \(f = \frac{1}{T}\) or \(T = \frac{1}{f}\)
- Hz (Hertz) = 1 cycle/s
- kHz = \(10^3\) Hz
- MHz = \(10^6\) Hz
- GHz = \(10^9\) Hz
- THz = \(10^{12}\) Hz
- s (Second)
- ms (Millisecond) = \(10^{-3}\) s
- μs (Microsecond) = \(10^{-6}\) s
- ns (Nanosecond) = \(10^{-9}\) s
- ps (Picosecond) = \(10^{-12}\) s
Example: Home power frequency is 60 Hz. Period = \(T = 1/60 = 0.0166\) s = 16.6 ms.
Example: Period of a signal is 100 ms. Frequency = \(f = 1/T = 1/(100 \times 10^{-3}) = 10\) Hz = 0.01 kHz.
3. Phase (or Phase Shift, \(\phi\))
- Position of the waveform relative to time \(t = 0\).
- Describes the amount of shift; indicates the start of the first cycle.
- Measured in degrees or radians.
- \(0°\): starts at 0 amplitude going up. \(90° = \pi/2\) rad: starts at peak. \(180° = \pi\) rad: starts at 0 going down.
Example: A sine wave is offset 1/6 cycle with respect to time 0. Phase = \(\frac{1}{6} \times 360° = 60°\). In radians = \(\frac{1}{6} \times 2\pi = \frac{\pi}{3}\) rad ≈ 1.047 rad.
Wavelength (\(\lambda\))
Wavelength is the distance a simple signal travels in one period through a transmission medium. It binds the period/frequency to propagation speed:
$$\lambda = v \times T = \frac{v}{f}$$
Where \(v\) is the propagation speed (typically \(2 \times 10^8\) to \(3 \times 10^8\) m/s depending on medium). If propagation speed changes, wavelength changes but frequency remains the same.
Time Domain vs. Frequency Domain
- Time-Domain Plot: Shows changes in signal amplitude over time (amplitude vs. time). Phase is not explicitly shown.
- Frequency-Domain Plot: Shows peak amplitude vs. frequency. A single sine wave is a single spike. More compact when dealing with multiple sine waves.
- The frequency domain is more compact and useful when dealing with composite signals (e.g., three sine waves at different frequencies are three spikes).
Chapter 7: Composite Signals & Bandwidth
Composite Signals
- A single sine wave can only carry limited information (one frequency component).
- A composite signal is made up of multiple simple sine waves.
- Can be periodic or non-periodic.
- Based on Fourier analysis, any composite signal can be decomposed into a set of simple sine waves with different frequencies, amplitudes, and phases.
- A periodic composite signal decomposes into discrete frequencies (e.g., \(f\), \(3f\), \(9f\), etc.).
- A non-periodic composite signal decomposes into a continuous range of frequencies.
Bandwidth
Bandwidth is an important characteristic that measures network performance. It can be used in two different contexts:
- Bandwidth in Hertz: Range of frequencies contained in a composite signal. \(B = f_{max} - f_{min}\).
- Bandwidth in bps: Number of bits a channel, link, or network can transmit per second.
The bandwidth is normally the difference between the highest and lowest frequencies in a composite signal.
Example: A periodic signal is decomposed into five sine waves with frequencies of 100, 300, 500, 700, and 900 Hz. What is its bandwidth?
Solution: \(B = f_{max} - f_{min} = 900 - 100 = 800\) Hz. The spectrum shows 5 spikes at those frequencies, all with max amplitude 10 V.
Chapter 8: Digital Signals & Bit Rate
Digital Signals
- Information can also be represented by a digital signal.
- Example: 1 = positive voltage, 0 = zero voltage.
- A digital signal can have more than two levels — we can send more than one bit per level.
Signal Levels and Bits
If a signal has \(L\) levels, each level needs \(\log_2 L\) bits:
$$\text{Bits per level} = \log_2(L)$$
- 2 levels → \(\log_2 2 = 1\) bit per level.
- 4 levels → \(\log_2 4 = 2\) bits per level.
Example: 8 levels → \(\log_2 8 = 3\) bits per level.
Example: 9 levels → \(\log_2 9 ≈ 3.17\) bits. Not realistic — must be integer and power of 2. So we need 4 bits per level (supports 16 levels).
Bit Rate
- Bit Rate: Number of bits sent in 1 second, expressed in bits per second (bps).
- Most digital signals are non-periodic, so period and frequency are not appropriate. We use bit rate instead.
Text download: 100 pages/sec. Each page = 24 lines × 80 chars × 8 bits = 15,360 bits. Bit rate = \(100 \times 24 \times 80 \times 8 = 1,536,000\) bps ≈ 1.536 Mbps.
Digitized voice: 4 kHz bandwidth, sampled at \(2 \times 4000 = 8000\) samples/sec, 8 bits/sample. Bit rate = \(8000 \times 8 = 64,000\) bps = 64 kbps.
HDTV: 1920 × 1080 pixels, 30 frames/sec, 24 bits/pixel. Bit rate = \(1920 \times 1080 \times 30 \times 24 ≈ 1.49\) Gbps. Compressed to 20–40 Mbps.
Bit Length
Analogous to wavelength for analog signals. Bit length = distance one bit occupies on the medium:
$$\text{Bit Length} = \text{Propagation Speed} \times \text{Bit Duration}$$
Digital Signal as a Composite Analog Signal
- Based on Fourier analysis, a digital signal is a composite analog signal.
- Vertical line in time domain → frequency of infinity.
- Horizontal line in time domain → frequency of zero.
- Therefore, a digital signal has an infinite bandwidth (frequencies from 0 to ∞).
Chapter 9: Transmission of Digital Signals
A digital signal (periodic or non-periodic) is a composite analog signal with frequencies between zero and infinity — infinite bandwidth. Two approaches for transmission:
Baseband Transmission
- Sending a digital signal without changing it to an analog signal.
- Requires a low-pass channel — a channel with bandwidth starting from 0 Hz.
- Dedicated medium required (e.g., cable between two devices).
- With a wide low-pass channel, we can approximate the digital signal well.
- With a narrow low-pass channel, only the lower harmonics pass — the received signal is a rough approximation.
Broadband Transmission (Modulation)
- Changing the digital signal to an analog signal for transmission.
- Modulation allows us to use a bandpass channel — a channel with bandwidth that does not start from zero.
- Bandpass channels are more available than low-pass channels.
- The digital signal modulates a carrier signal (analog) for transmission.
Chapter 10: Transmission Impairments & SNR
Transmission media are not perfect. The signal sent is not the same as the signal received. Three causes of impairment:
1. Attenuation
- Loss of energy as a signal travels through a medium.
- The medium's resistance converts some signal energy to heat.
- To compensate, amplifiers are used to boost the signal.
Decibel (dB)
- Unit measuring relative strength of two signals or one signal at two different points.
- Negative if signal is attenuated; positive if signal is amplified.
$$dB = 10 \log_{10}\left(\frac{P_2}{P_1}\right)$$
Example: Signal power reduced to one half (\(P_2 = 0.5P_1\)): \(dB = 10 \log_{10}(0.5) = 10 \times (-0.301) = -3.01\) dB. A loss of 3 dB = losing half the power.
Example: Signal amplified 10 times (\(P_2 = 10P_1\)): \(dB = 10 \log_{10}(10) = 10\) dB.
Cascading Example: Signal passes through: attenuation (-3 dB), then amplifier (+7 dB), then attenuation (-3 dB). Total = \(-3 + 7 + (-3) = +1\) dB. dB values are additive for cascaded stages.
dBm (Decibel-milliwatt)
Measures signal power relative to 1 milliwatt:
$$dBm = 10 \log_{10}\left(\frac{P_m}{1\text{ mW}}\right)$$
Example: dBm = −30. What is the power? \(-30 = 10\log_{10}(P_m)\) → \(\log_{10}(P_m) = -3\) → \(P_m = 10^{-3}\) mW = 0.001 mW = 1 μW.
Example: Cable loss is 5 × (−0.3) = −1.5 dB over 5 km distance.
2. Distortion
- Signal changes its form or shape.
- Occurs in composite signals made of different frequencies.
- Each frequency component has its own propagation speed and therefore its own delay.
- Differences in delay create differences in phase if the delay is not exactly the same as the period duration.
- Result: signal components arrive out of phase, distorting the composite signal.
3. Noise
Random, unwanted signals that corrupt the transmitted signal. Four types:
- Thermal Noise: Random motion of electrons in a wire creates extra signal. Present in all electronic media. Cannot be eliminated.
- Induced Noise: From external sources such as motors, appliances, electromagnetic interference.
- Crosstalk: Effect of one wire on another — unwanted coupling between parallel wire pairs.
- Impulse Noise: High-amplitude spikes of very short duration. Caused by power surges, lightning, etc. Major source of errors in digital data.
Signal-to-Noise Ratio (SNR)
Measures the ratio of average signal power to average noise power:
$$\text{SNR} = \frac{\text{Average Signal Power}}{\text{Average Noise Power}}$$
$$\text{SNR}_{dB} = 10\log_{10}(\text{SNR})$$
- High SNR = clean signal.
- Low SNR = noisy, corrupted signal.
Example: Signal power = 10 mW, noise power = 1 μW. SNR = \(\frac{10 \times 10^{-3}}{1 \times 10^{-6}} = 10000\). SNR_dB = \(10\log_{10}(10000) = 40\) dB.
Example (Noiseless channel): Noise = 0 → SNR = ∞, SNR_dB = ∞. This is an ideal — can never be achieved in real life.
Chapter 11: Data Rate Limits — Nyquist & Shannon
How fast can we send data (in bps) over a channel? Data rate depends on three factors:
- The bandwidth available.
- The level of the signals we use.
- The quality of the channel (level of noise).
Two theoretical formulas were developed to calculate data rate limits:
Noiseless Channel: Nyquist Bit Rate
For a noiseless channel, the Nyquist formula defines the theoretical maximum bit rate:
$$\text{Bit Rate}_{max} = 2 \times B \times \log_2(L)$$
Where \(B\) = bandwidth (Hz), \(L\) = number of signal levels.
Finding a balance between bit rate and system reliability — increasing levels increases bit rate but makes the system more susceptible to noise.
Example: Noiseless channel, bandwidth = 3000 Hz, 2 signal levels. Max bit rate = \(2 \times 3000 \times \log_2(2) = 2 \times 3000 \times 1 = 6000\) bps.
Example: Same channel, 4 signal levels. Max bit rate = \(2 \times 3000 \times \log_2(4) = 2 \times 3000 \times 2 = 12000\) bps.
Noisy Channel: Shannon Capacity
In reality, channels are always noisy. Claude Shannon (1944) introduced the formula for theoretical highest data rate:
$$C = B \times \log_2(1 + \text{SNR})$$
Where \(C\) = capacity (bps), \(B\) = bandwidth (Hz), SNR = signal-to-noise ratio (power ratio).
Shannon formula defines an upper limit; gives capacity regardless of signal levels. It is independent of the number of signal levels.
Example: Extremely noisy channel, SNR ≈ 0. \(C = B \times \log_2(1 + 0) = B \times 0 = 0\) bps. Cannot receive any data through this channel regardless of bandwidth.
Example: Telephone line bandwidth = 3000 Hz, SNR = 3162. \(C = 3000 \times \log_2(3163) ≈ 3000 \times 11.62 ≈ 34,860\) bps ≈ 34.86 kbps.
Example: SNR_dB = 36, B = 2 MHz. First convert: \(36 = 10\log_{10}(\text{SNR})\) → \(\text{SNR} = 10^{3.6} ≈ 3981\). Then \(C = 2 \times 10^6 \times \log_2(3982) ≈ 2 \times 10^6 \times 11.96 ≈ 23.9\) Mbps.
Simplified (high SNR): When SNR is very high, \(1 + \text{SNR} ≈ \text{SNR}\), so \(C ≈ B \times \frac{\text{SNR}_{dB}}{3}\). For the above: \(C ≈ 2 \times 10^6 \times 36/3 = 24\) Mbps.
Using Both Limits in Practice
- Shannon's formula gives the upper limit on data rate.
- Nyquist formula gives the required number of signal levels.
- In practice: Use Shannon to find max capacity → choose a target rate below it → use Nyquist to find the needed signal levels.
Problem: Channel with 1 MHz bandwidth, SNR = 63. Find appropriate bit rate and signal level.
- Shannon: \(C = 10^6 \times \log_2(1 + 63) = 10^6 \times \log_2(64) = 10^6 \times 6 = 6\) Mbps (upper limit).
- Choose target rate lower than 6 Mbps → 4 Mbps.
- Nyquist: \(4 \times 10^6 = 2 \times 10^6 \times \log_2(L)\) → \(\log_2(L) = 2\) → \(L = 4\). Need 4 signal levels.
Chapter 12: Network Performance
Data transmission over a network: how good is our network? Three characteristics of network performance:
- Bandwidth
- Throughput
- Latency (Delay)
Bandwidth
Used in two contexts: Bandwidth in Hertz (range of frequencies in a composite signal) and Bandwidth in bps (number of bits a channel/link/network can transmit).
Example: Subscriber line bandwidth = 4 kHz for voice/data. Data transmission can be up to 56,000 bps using a sophisticated modem.
Example: If the telephone company improves the line to 8 kHz bandwidth, we can send 112,000 bps using the same modem technology.
Throughput
- Measure of how fast we can actually send data through a network.
- Bandwidth ≠ Throughput. A link may have bandwidth \(B\) bps, but we can only send \(T\) bps with \(T \leq B\).
- Throughput is always less than or equal to bandwidth.
Example: Network bandwidth = 10 Mbps, passes 12,000 frames/minute, each frame = 10,000 bits. Throughput = \(\frac{12000 \times 10000}{60} = 2,000,000\) bps = 2 Mbps (one-fifth of bandwidth).
Latency (Delay)
Defines how long it takes for an entire message to completely arrive at the destination from the time the first bit is sent.
$$\text{Latency} = \text{Propagation Time} + \text{Transmission Time} + \text{Queuing Time} + \text{Processing Delay}$$
Propagation Time
$$\text{Propagation Time} = \frac{\text{Distance}}{\text{Propagation Speed}}$$
Propagation speed in cable ≈ \(2.4 \times 10^8\) m/s.
Transmission Time
$$\text{Transmission Time} = \frac{\text{Message Size (bits)}}{\text{Bandwidth (bps)}}$$
Queuing Time & Processing Delay
- Queuing Time: Time spent waiting in buffers at intermediate routers/switches. Varies dynamically based on traffic load.
- Processing Delay: Time required by routers to read packet headers, check errors, determine routing paths.
Example: Distance = 12,000 km, propagation speed = \(2.4 \times 10^8\) m/s. Propagation time = \(\frac{12000 \times 1000}{2.4 \times 10^8} = 50\) ms. A bit can cross the Atlantic in 50 ms if there's a direct cable.
Example: 2.5 KB message, bandwidth = 1 Gbps, distance = 12,000 km. Propagation time = 50 ms. Transmission time = \(\frac{2500 \times 8}{10^9} = 0.020\) ms. Dominant factor is propagation time (short message, high bandwidth).
Example: 5 MB image, bandwidth = 1 Mbps, distance = 12,000 km. Propagation time = 50 ms. Transmission time = \(\frac{5000000 \times 8}{10^6} = 40\) s. Here, transmission time dominates (large message, lower bandwidth).
Bandwidth-Delay Product (BDP)
Defines the number of bits that can fill a link. Think of the link as a pipe — cross-section = bandwidth, length = delay.
$$\text{BDP (bits)} = \text{Bandwidth (bps)} \times \text{Delay (s)}$$
- Case 1 (Narrow pipe): Bandwidth = 1 bps, Delay = 5 s → BDP = 5 bits.
- Case 2 (Wide pipe): Bandwidth = 4 bps, Delay = 5 s → BDP = 20 bits.
Jitter
- Jitter is a problem if different packets encounter different delays and the application is time-sensitive (audio/video).
- Example: First packet delay = 20 ms, second = 45 ms, third = 40 ms → the application endures jitter.
- Causes uneven quality in real-time playback.
Chapter 13: Digital Transmission — Line Coding
Digital Transmission Overview
Digital Transmission includes: Digital-to-Digital Conversion (Line Coding, Block Coding, Scrambling) and Analog-to-Digital Conversion (PCM, Delta Modulation).
Signal Element vs. Data Element
- Data Element: Smallest entity representing a piece of information — the bit. Data elements are carried.
- Signal Element: Shortest unit (pulse/level) of a digital signal. Signal elements are carriers.
- Ratio \(r = \frac{\text{Data Elements}}{\text{Signal Elements}}\).
Data Rate vs. Signal Rate
- Data Rate (Bit Rate): Number of data elements (bits) sent in 1 sec → bps.
- Signal Rate (Baud Rate, Pulse Rate, Modulation Rate): Number of signal elements sent in 1 sec → baud.
- Relationship: \(S = c \times N \times \frac{1}{r}\) baud, where \(c\) = case factor (typically 1/2 for worst or 1 for best case), \(N\) = data rate, \(r\) = data elements per signal element.
Signal rate = 100 baud, 1 data element per signal element → Data rate = 100 bps.
Line Coding
Converts a sequence of bits to a digital signal. Data stored as sequences of bits in computer memory; line coding converts these to signal elements for transmission over a low-pass channel.
Five broad categories of line coding schemes:
| Scheme | Category | Levels | Rules & Features | Self-Sync? | DC Component? |
|---|---|---|---|---|---|
| Unipolar NRZ | Unipolar | 2 (0V, +V) | 1 = +V, 0 = 0V. Simple but has DC component and no sync. | No | Yes |
| NRZ-L (Level) | Polar | 2 (−V, +V) | Voltage level determines bit. 0 = +V, 1 = −V. | No | Yes |
| NRZ-I (Invert) | Polar | 2 (−V, +V) | Inversion at beginning = 1; No transition = 0. | No (for 0s) | Yes |
| RZ (Return-to-Zero) | Polar | 3 (−V, 0, +V) | Signal returns to zero in middle of each bit. 1 = high→zero; 0 = low→zero. | Yes | No |
| Manchester | Biphase (Polar) | 2 (−V, +V) | Transition in middle of bit. 0 = high→low; 1 = low→high (IEEE 802.3 Ethernet). | Yes | No |
| Differential Manchester | Biphase (Polar) | 2 (−V, +V) | Always transition in middle (sync). Transition at beginning = 0; No transition at beginning = 1. | Yes | No |
| Bipolar AMI | Bipolar | 3 (−V, 0, +V) | 0 = 0V. 1 = alternating +V and −V. | No (for 0s) | No |
| Pseudoternary | Bipolar | 3 (−V, 0, +V) | 1 = 0V. 0 = alternating +V and −V. (Opposite of AMI.) | No (for 1s) | No |
| 2B1Q | Multilevel | 4 (−3V, −1V, +1V, +3V) | Groups of 2 bits → 1 signal element with 4 voltage levels. 00=−3V, 01=−1V, 10=+1V (or +3V), 11=+3V (or +1V). | No | Possible |
- Biphase schemes (Manchester, Differential Manchester) provide self-synchronization but require double the bandwidth.
- Bipolar AMI has narrow bandwidth (no DC component) but loses synchronization for long runs of 0s.
- NRZ schemes are simple and efficient but lack synchronization capability.
Chapter 14: Block Coding & Scrambling
Block Coding (mB/nB)
- Changes a block of m bits into a block of n bits (where \(n > m\)).
- Uses mB/nB encoding technique.
- Adds redundancy to ensure synchronization.
- Block coding gives us redundancy and improves line coding performance.
4B/5B Encoding
- Converts 4-bit groups into 5-bit groups.
- Mapping designed so that no more than 3 consecutive 0s appear.
- Used with NRZ-I line coding (NRZ-I syncs on 1s; limiting zeros ensures sync).
- 4B/5B with NRZ-I solves the synchronization issue of NRZ-I.
- The 4B/5B mapping has specific codes: e.g., 0000 → 11110, 0001 → 01001, etc.
Example: Data rate = 1 Mbps. With 4B/5B + NRZ-I: The 4B/5B encoding increases bit rate to \(1 \times \frac{5}{4} = 1.25\) Mbps. NRZ-I minimum bandwidth = \(\frac{N}{2} = \frac{1.25 \times 10^6}{2} = 625\) kHz.
With Manchester coding alone: Minimum bandwidth = \(N = 1\) MHz (double the NRZ bandwidth). So 4B/5B + NRZ-I is more efficient than Manchester.
8B/10B Block Encoding
Maps 8-bit groups to 10-bit groups. Provides even greater redundancy and better error detection capabilities. Used in high-speed networks.
Scrambling
Biphase schemes are suitable for LAN but not for long distance. Block coding + NRZ-I solves sync but has DC component. Bipolar AMI has narrow bandwidth (no DC) but synch issue (long series of 0s). Scrambling is the solution.
- Scrambling replaces consecutive zero pulses with violations without increasing the data rate.
- The system inserts required pulses based on defined scrambling rules.
- AMI is used with scrambling to achieve both narrow bandwidth and synchronization.
B8ZS (Bipolar with 8-Zero Substitution)
- Replaces 8 consecutive zeros.
- If last non-zero pulse was positive (+): replace with
000+-0-+. - If last non-zero pulse was negative (−): replace with
000-+0+-. - Violations occur at positions 4 and 7.
HDB3 (High-Density Bipolar 3-Zero)
- Replaces 4 consecutive zeros.
- Decision based on number of non-zero pulses since last substitution being odd or even.
| Last Pulse Polarity | Odd # of 1s since last sub → 000V | Even # of 1s since last sub → B00V |
|---|---|---|
| Positive (+) | 0 0 0 + (V = same polarity = violation) |
- 0 0 - (B = opposite, V = same = violation) |
| Negative (−) | 0 0 0 - (V = same polarity = violation) |
+ 0 0 + (B = opposite, V = same = violation) |
Chapter 15: Analog-to-Digital Conversion (PCM & Delta Modulation)
Process of converting analog data (e.g., voice, music) to digital data — Digitization. Two techniques:
1. Pulse Code Modulation (PCM)
Most common technique. Employs a PCM Encoder with three processes:
Step 1: Sampling (PAM)
- The analog signal is sampled at periodic intervals.
- Three different sampling methods: ideal sampling, natural sampling, flat-top sampling.
- Nyquist Sampling Theorem: The sampling rate must be at least twice the highest
frequency:
$$f_s \geq 2 \times f_{max}$$
- Example: Sampling a sine wave at three rates:
- \(f_s = 4f\) (2× Nyquist rate) → excellent recovery.
- \(f_s = 2f\) (exactly Nyquist rate) → acceptable recovery.
- \(f_s = f\) (half Nyquist rate) → aliasing, signal cannot be recovered.
Step 2: Quantization
- Sampling produces a series of pulses with amplitude values between min and max signal amplitude.
- These are an infinite set with non-integral values — not suitable for encoding.
- We quantize the sampled output into certain levels based on the range of amplitudes and accuracy needed.
- The quantized values are rounded to the nearest predefined level.
- Quantization introduces quantization error (difference between actual and quantized value).
Step 3: Encoding
- After quantization, each quantized level is assigned a binary code (codeword).
- The number of bits per sample = \(\log_2(\text{number of quantization levels})\).
PCM Decoder (Signal Recovery)
The decoder reverses the process: binary codes → quantized levels → low-pass filter → reconstructed analog signal.
2. Delta Modulation (DM)
- A simpler technique than PCM.
- PCM finds the value of the signal amplitude for each sample; DM finds the change from the previous sample.
- No code words needed — only sends 1 bit per sample:
- If current sample > previous → send 1 (step up).
- If current sample < previous → send 0 (step down).
- Delta Modulation Components: Modulator (with staircase function generator and comparator) and Demodulator (with staircase function generator and low-pass filter).
- PCM: More complex, more accurate, uses multiple bits per sample.
- DM: Simpler, less accurate, uses only 1 bit per sample but requires higher sampling rate.
Chapter 16: Transmission Modes
How do we transmit data? Wiring and data stream considerations. Do we send 1 bit at a time, or group bits?
Parallel Transmission
- Binary data (1s and 0s) organized in groups of n bits.
- We send n bits at a time instead of just one.
- n wires required to send n bits simultaneously.
- Advantage: Fast. Disadvantage: Expensive (many wires), only practical for short distances.
Serial Transmission
- One bit follows another — only one communication channel needed.
- Cheaper than parallel for long distances.
- Three types of serial transmission:
Asynchronous Transmission
- Timing of signal is not important — the receiver re-synchronizes at the start of each character.
- Each character preceded by a start bit (0) and followed by a stop bit(s) (1).
- Gap between characters can vary.
- Simple and cheap but has overhead due to start/stop bits.
Synchronous Transmission
- Bits are sent as a continuous stream of frames without start/stop bits.
- Frames include synchronization flags (e.g.,
01111110). - Sender and receiver clocks are synchronized.
- More efficient than asynchronous for large data blocks.
Isochronous Transmission
- For real-time audio and video.
- Synchronization between characters is not enough — the entire stream must be synchronized.
- Guarantees fixed-rate data delivery.
- Ensures data arrives at a fixed rate to prevent jitter in real-time applications.
Chapter 17: Digital-to-Analog Conversion (ASK, FSK, PSK, QAM)
Process of changing one of the characteristics of an analog signal (carrier) based on information in digital data. A sine wave has 3 characteristics: Amplitude, Frequency, Phase. By changing one, we represent digital data.
Aspects of Digital-to-Analog Conversion
Bit Rate vs. Baud Rate
- In analog transmission of digital data, baud rate ≤ bit rate.
- Data element vs. signal element: A signal element can carry multiple data elements.
- Bandwidth required is proportional to signal rate (except FSK).
- Carrier Signal: A high-frequency signal that serves as a base for the information signal. Modified by modulation.
Example: Analog signal carries 4 bits per signal element. 1000 signal elements/sec → Bit rate = \(4 \times 1000 = 4000\) bps.
Example: Bit rate = 8000 bps, baud rate = 1000. Bits per signal element = \(8000/1000 = 8\). Signal levels needed = \(2^8 = 256\).
Types of Digital-to-Analog Conversion
1. Amplitude Shift Keying (ASK)
- Amplitude of the carrier signal is varied to create signal elements.
- Frequency and phase remain constant while amplitude changes.
- Binary ASK (BASK) / On-Off Keying (OOK): 1 = carrier amplitude; 0 = zero amplitude.
- Bandwidth: \(B = (1+d) \times S\) where \(d\) is a factor between 0 and 1, \(S\) = baud rate.
- Implementation: Uses a multiplier — carrier signal × digital signal.
Example: Available bandwidth = 100 kHz (200 to 300 kHz). With \(d = 1\): Carrier frequency \(f_c = \frac{200+300}{2} = 250\) kHz. Bit rate = \(\frac{B}{(1+d)} = \frac{100}{2} = 50\) kbps.
2. Frequency Shift Keying (FSK)
- Frequency of the carrier signal is varied to represent data.
- Peak amplitude and phase remain constant.
- Binary FSK (BFSK): Two different frequencies represent 0 and 1.
- Frequency is constant for the duration of one signal element but changes if the data element changes.
- Implementation: Uses voltage-controlled oscillator (VCO).
Example: Available bandwidth = 100 kHz (200 to 300 kHz), \(d = 1\). Carrier frequency = 250 kHz. For BFSK, bandwidth is larger than ASK because it uses two frequencies.
3. Phase Shift Keying (PSK)
- Phase of the carrier is varied to represent two or more different signal elements.
- Peak amplitude and frequency remain constant.
- PSK is relatively more common than ASK or FSK.
- Binary PSK (BPSK): Two phases (0° and 180°) represent 0 and 1.
- QPSK (Quadrature PSK): Four phases (45°, 135°, 225°, 315°) — each signal element carries 2 bits.
- Implementation of BPSK: Uses a multiplier with in-phase carrier.
Example: Find bandwidth for QPSK at 12 Mbps, \(d = 0\). Baud rate = \(12 \times 10^6 / 2 = 6 \times 10^6\). Bandwidth = \((1+0) \times 6 \times 10^6 = 6\) MHz.
Constellation Diagram
- Helps define the phase and amplitude of a signal element using two carriers (one in-phase, one in quadrature).
- Signal element represented as a dot in the diagram.
- X-axis = in-phase carrier amplitude; Y-axis = quadrature carrier amplitude.
- Distance from origin = amplitude; angle = phase.
4. Quadrature Amplitude Modulation (QAM)
- PSK is limited by equipment's ability to distinguish small phase differences.
- Why not combine ASK and PSK? → QAM.
- QAM changes both phase and amplitude.
- Allows more signal elements (higher bit rate) in the same bandwidth.
- Common QAM variants: 4-QAM, 8-QAM, 16-QAM, 32-QAM, 64-QAM, 128-QAM, 256-QAM.
- Constellation diagrams show different QAM configurations.
Chapter 18: Analog-to-Analog Modulation
Representation of analog information by an analog signal. Required when the medium can only pass a bandpass (not baseband) channel. Three types:
1. Amplitude Modulation (AM)
- The amplitude of the carrier is varied to reflect changes in the modulating signal.
- Bandwidth of AM: \(B_{AM} = 2B\) where \(B\) is the bandwidth of the modulating signal.
- Carrier frequency should be at least \(2f_{max}\) of the modulating signal.
2. Frequency Modulation (FM)
- The frequency of the carrier is varied to reflect changes in the modulating signal.
- Bandwidth of FM: \(B_{FM} = 2(1 + \beta)B\) where \(\beta\) is the modulation index.
- FM requires more bandwidth than AM but provides better noise immunity.
3. Phase Modulation (PM)
- The phase of the carrier is varied to reflect changes in the modulating signal.
- Bandwidth of PM: \(B_{PM} = 2(1 + \beta)B\) — same formula structure as FM.
- Implementation uses a Voltage Controlled Oscillator (VCO) and a differentiator (\(d/dt\)).
- AM is simplest but most susceptible to noise.
- FM has better noise immunity but uses more bandwidth.
- PM is similar to FM in characteristics.
Chapter 19: Multiplexing (FDM, WDM, TDM)
Multiplexing: Simultaneous transmission of multiple signals across a single data link. Instead of adding individual links for each new channel, install higher-bandwidth links and use each to carry multiple signals.
A multiplexer (MUX) combines signals; a demultiplexer (DEMUX) separates them. The link is divided into channels.
Categories of Multiplexing
- Frequency-Division Multiplexing (FDM) — analog technique.
- Wavelength-Division Multiplexing (WDM) — analog, for fiber optics.
- Time-Division Multiplexing (TDM) — digital technique.
Frequency-Division Multiplexing (FDM)
- An analog technique applied when the bandwidth of a link (in Hz) is greater than the combined bandwidths of the signals to be transmitted.
- Signals generated by each sending device modulate different carrier frequencies.
- These modulated signals are combined into a single composite signal for transport.
- Guard bands: Small bandwidth gaps between channels to prevent interference.
- FDM Multiplexing: Modulate → combine → send over single link.
- FDM De-Multiplexing: Filter → demodulate → separate signals.
Example: 3 voice channels (each 4 kHz) combined into a 12 kHz link (20–32 kHz). No guard bands. Channel 1: 20–24 kHz, Channel 2: 24–28 kHz, Channel 3: 28–32 kHz.
Example: 5 channels, each 100 kHz bandwidth, guard band = 10 kHz. Minimum link bandwidth = \(5 \times 100 + 4 \times 10 = 540\) kHz.
The Analog Carrier System (Analog Hierarchy)
- Telephone companies multiplex signals from lower-bandwidth lines onto higher-bandwidth lines using FDM.
- Hierarchical structure: Groups → Supergroups → Mastergroups → Jumbogroups.
Wavelength-Division Multiplexing (WDM)
- Designed to use the high data-rate capability of fiber-optic cable.
- Fiber data rate is higher than metallic cable — using fiber for a single line wastes bandwidth.
- WDM combines several light signals of different wavelengths onto a single fiber.
- Conceptually the same as FDM but operates on light frequencies.
- Uses prisms (or diffraction gratings) to multiplex and demultiplex light signals.
- Multiplexer combines different wavelengths; demultiplexer separates them.
Time-Division Multiplexing (TDM)
- A digital process that allows several connections to share the high bandwidth of a link.
- Time is shared — each connection occupies a portion of time in the link.
- Two types: Synchronous TDM and Statistical (Asynchronous) TDM.
Synchronous TDM
- Each input is assigned a fixed time slot in each frame, regardless of whether the source has data to send.
- Time slots are organized into frames; a frame contains one slot per input.
- Interleaving: Taking turns — data from each source placed into successive slots.
- If a source has no data, its slot is empty (wasted).
Example: Each input connection = 1 kbps, 1 bit per slot. Duration of each input slot = \(1/1000 = 1\) ms. If 3 inputs: output slot = \(1/3\) ms. Frame duration = 1 ms (contains 3 slots).
TDM Techniques
- Multilevel Multiplexing: Multiple lower-rate inputs are combined to match a higher-rate output.
- Multiple-Slot Multiplexing: A source with higher data rate gets multiple slots per frame.
- Pulse Stuffing: When input rates don't perfectly divide the output rate, dummy bits are stuffed to equalize rates.
Digital Hierarchy (DS and T/E Lines)
| DS Level | T Line | Data Rate | Voice Channels |
|---|---|---|---|
| DS-0 | — | 64 kbps | 1 |
| DS-1 | T-1 | 1.544 Mbps | 24 |
| DS-2 | T-2 | 6.312 Mbps | 96 |
| DS-3 | T-3 | 44.736 Mbps | 672 |
| DS-4 | T-4 | 274.176 Mbps | 4032 |
T-1 Line: Carries 24 voice channels (24 × 64 kbps) plus 1 framing bit per frame = 24 × 8 + 1 = 193 bits per frame. At 8000 frames/sec: \(193 \times 8000 = 1.544\) Mbps.
| E Level | Data Rate | Voice Channels |
|---|---|---|
| E-1 | 2.048 Mbps | 30 |
| E-2 | 8.448 Mbps | 120 |
| E-3 | 34.368 Mbps | 480 |
| E-4 | 139.264 Mbps | 1920 |
Statistical TDM (Asynchronous TDM)
- In synchronous TDM, empty slots waste bandwidth.
- Statistical TDM allocates slots dynamically — only active sources get slots.
- Each slot carries an address to identify the source.
- More efficient utilization of bandwidth, but requires addressing overhead.
Chapter 20: Spread Spectrum
In wireless applications, stations must share the medium without interception by eavesdroppers and without being subject to jamming from malicious intruders. Spread spectrum adds redundancy and spreads the original spectrum needed for each station.
Principles of Spread Spectrum
- Bandwidth allocated to each station is larger than what is needed — to allow redundancy.
- The spreading process should be independent of the original signal.
- The receiver uses the same spreading code to recover the original signal.
Two Spread Spectrum Techniques
1. Frequency Hopping Spread Spectrum (FHSS)
- M different carrier frequencies are modulated by the source signal.
- At one moment, the signal modulates one carrier frequency; at the next moment, it modulates another.
- The pattern of frequency changes is determined by a pseudorandom code known to both sender and receiver.
- Frequency selection: A pseudorandom number generator creates a pattern that controls the frequency synthesizer.
- FHSS Cycles: The system hops through a predetermined sequence of frequencies.
- Bandwidth sharing: Multiple stations can use the same band by using different hopping patterns.
2. Direct Sequence Spread Spectrum (DSSS)
- DSSS also expands the bandwidth of the original signal, but the process is different.
- We replace each data bit with n bits using a spreading code.
- Each bit is assigned a code of n bits called chips.
- The chip rate is n times that of the data bit rate.
- The bandwidth of the transmitted signal is n times the bandwidth of the original signal.
- The receiver uses the same spreading code (chips) to recover the original data.
- FHSS: Changes carrier frequency over time; bandwidth spread across frequency hops.
- DSSS: Expands each bit into multiple chips; bandwidth spread continuously.
- Both provide security against eavesdropping and resistance to jamming.
Quick Reference: All Key Formulas
| Formula | Expression | Variables |
|---|---|---|
| Period ↔ Frequency | \(T = 1/f\), \(f = 1/T\) | \(T\) = period (s), \(f\) = frequency (Hz) |
| Wavelength | \(\lambda = v/f = v \times T\) | \(v\) = propagation speed (m/s) |
| Bandwidth (Hz) | \(B = f_{max} - f_{min}\) | Composite signal frequency range |
| Bits per Level | \(\text{bits} = \log_2(L)\) | \(L\) = number of signal levels |
| Bit Length | \(\text{Bit Length} = v / \text{Bit Rate}\) | |
| Mesh Topology Links | \(N(N-1)/2\) | \(N\) = number of devices |
| Decibel (dB) | \(dB = 10\log_{10}(P_2/P_1)\) | \(P_1\) = input power, \(P_2\) = output |
| dBm | \(dBm = 10\log_{10}(P_{mW})\) | \(P_{mW}\) = power in milliwatts |
| SNR | \(\text{SNR} = P_{signal}/P_{noise}\) | |
| SNR in dB | \(\text{SNR}_{dB} = 10\log_{10}(\text{SNR})\) | |
| Nyquist Bit Rate | \(\text{BitRate} = 2B\log_2(L)\) | \(B\) = bandwidth, \(L\) = levels |
| Shannon Capacity | \(C = B\log_2(1+\text{SNR})\) | \(B\) = bandwidth, SNR = power ratio |
| Shannon (high SNR) | \(C \approx B \times \text{SNR}_{dB}/3\) | |
| Latency | \(\text{Lat} = t_{prop} + t_{trans} + t_{queue} + t_{proc}\) | |
| Propagation Time | \(t_{prop} = \text{Distance} / v\) | \(v\) = propagation speed |
| Transmission Time | \(t_{trans} = \text{Size (bits)} / \text{BW (bps)}\) | |
| Bandwidth-Delay Product | \(\text{BDP} = \text{BW} \times \text{Delay}\) | Result in bits |
| Signal Rate (Baud) | \(S = c \times N / r\) | \(c\) = case factor, \(N\) = bit rate, \(r\) = ratio |
| Nyquist Sampling Rate | \(f_s \geq 2 f_{max}\) | \(f_s\) = sampling frequency |
| ASK Bandwidth | \(B = (1+d) \times S\) | \(d\) = factor (0–1), \(S\) = baud rate |
| AM Bandwidth | \(B_{AM} = 2B\) | \(B\) = signal bandwidth |
| FM/PM Bandwidth | \(B = 2(1+\beta)B\) | \(\beta\) = modulation index |
| FDM Guard Band | \(B_{total} = n \times B_{ch} + (n-1) \times B_{guard}\) | \(n\) = channels |
| T-1 Frame | \(193 \text{ bits} = 24 \times 8 + 1\) | 8000 frames/s → 1.544 Mbps |