Wireless propagation (Introduction to groundwave propagation, sky…
Open in the Padhaiko app3.4 Wireless Propagation and Frequency Bands
Unbounded radio waves travel from transmitting to receiving antennas through three primary propagation mechanisms, governed chiefly by operating frequency (pages="added").
Three Modes of Wireless Propagation
- Ground Wave (Surface Wave) Propagation (): Electromagnetic waves hug the Earth's curvature via diffraction and induced ground currents. It requires vertical polarization (horizontal electric fields short-circuit against the conducting ground). Range is reliable day and night, especially over seawater, and supports AM broadcasting and maritime navigation.
- Sky Wave Propagation (, HF band): Radio waves radiated skyward are refracted back toward Earth by ionized layers of the ionosphere ( altitude). Signals can bounce between Earth and the ionosphere across multiple hops for intercontinental shortwave and amateur radio links.
- Skip Distance & Skip Zone: The distance from the transmitter to the nearest point where the sky wave returns is the skip distance. The ring between the end of ground-wave reception and the first sky-wave return is the skip (dead) zone.
- Line-of-Sight (Space Wave) Propagation (, VHF and above): Above , waves pierce through the ionosphere instead of refracting back. Communication relies on direct unobstructed line-of-sight paths between elevated transmitting and receiving antennas (plus weak ground-reflected rays).
Line-of-Sight Horizon and Free-Space Path Loss
Because atmospheric refraction bends radio waves slightly downward ( effective Earth-radius factor), the maximum radio line-of-sight distance between antenna heights and (in meters) is:
As a wave spreads spherically over distance at wavelength , the Free-Space Path Loss (FSPL) between isotropic antennas is:
ITU Frequency Bands
| Band | Frequency Range | Wavelength | Primary Propagation Mode | Typical Applications |
|---|---|---|---|---|
| VLF (Very Low) | Ground wave | Submarine communication, time signals | ||
| LF (Low) | Ground wave | Aviation/marine beacons, longwave radio | ||
| MF (Medium) | Ground wave (day), Sky wave (night) | AM radio broadcasting () | ||
| HF (High) | Sky wave (ionospheric bounce) | International shortwave, amateur radio, aviation | ||
| VHF (Very High) | Line-of-sight (space wave) | FM radio (), VHF TV, ATC voice | ||
| UHF (Ultra High) | Line-of-sight | Cellular (), Wi-Fi (), Bluetooth, GPS | ||
| SHF (Super High) | Line-of-sight | Wi-Fi (), microwave backhaul, satellite (C/Ku/Ka) | ||
| EHF (Extremely High) | Line-of-sight (rain sensitive) | mmWave, radar, point-to-point gigabit backhaul |
3.5 Error Detection and Correction
Channel impairments corrupt bits during transit, producing either single-bit errors (one isolated bit flipped) or burst errors (two or more consecutive/clustered bits altered). To protect integrity, the channel encoder adds redundant check bits to a -bit dataword to form an -bit codeword () (DC Ch8).
Hamming Distance and Error Capabilities
Hamming Distance and Minimum Distance
- Hamming Distance : The number of bit positions in which two equal-length binary strings and differ, computed by counting the s in .
- Minimum Hamming Distance : The smallest Hamming distance between any pair of distinct valid codewords in a code set.
- Detection and Correction Bounds:
- To guarantee detection of up to bit errors per codeword: .
- To guarantee correction of up to bit errors per codeword: .
- To simultaneously correct errors and detect errors: .
Error Detection Techniques
- Simple Parity Check (1D): Appends a single parity bit so the total number of s in the codeword is even (even parity) or odd (odd parity). It detects any odd number of bit errors (), but misses any even number of bit flips.
- Two-Dimensional (2D) Parity Check: Organizes bits into a matrix and transmits parity bits for every row and every column. It detects all -, -, and -bit errors, detects most burst errors up to the column width, and can locate a single-bit error at the intersection of the failed row and column.
- Checksum:
- Sender: Splits the message into segments of bits each, sums all segments using 1's complement arithmetic (wrapping any end-around carry back into the LSB), and takes the bitwise complement (1's complement) of the sum as the checksum segment appended to the frame.
- Receiver: Sums all received segments (data + checksum) using 1's complement arithmetic and complements the result. If the final value is (sum was all s), the frame is accepted; otherwise it is rejected.
- Cyclic Redundancy Check (CRC): Treats bit strings as binary polynomials over (addition and subtraction are both XOR, with no carries or borrows).
- Sender: Given -bit data and an -bit generator polynomial of degree , append zeros to (forming ), divide modulo-2 by , and append the -bit remainder to form the transmitted codeword .
- Receiver: Divides the received frame by the same . A zero remainder indicates no detected error; a nonzero remainder proves corruption.
Single-Bit Error Correction: Hamming Code and Systematic Linear Block Codes
Hamming Code
A Hamming code places parity bits at power-of- positions () among data bits, where is the smallest integer satisfying:
Each parity bit (at position ) covers every bit position whose binary index has bit equal to :
- (position ): checks positions
- (position ): checks positions
- (position ): checks positions
At the receiver, recomputing each parity check forms the syndrome . If , no error occurred; if , the decimal value of directly identifies the exact bit position to flip.
Systematic Linear Block Codes (LBC)
In a systematic Linear Block Code, the sum (modulo-2) of any two codewords is another valid codeword (DC Ch8). A -bit message row vector produces an -bit codeword via the generator matrix :
The corresponding parity-check matrix satisfies . For a received vector , the receiver computes the syndrome ; indicates a valid codeword, while identifies an error.
3.6 Data Compression: Lossless and Lossy
Source coding (data compression) maps source symbols to compact bit sequences by removing statistical redundancy (DC Ch8).
Information Theory Metrics: Self-Information, Entropy, and Efficiency
Self-Information, Entropy, and Coding Efficiency
Let a discrete source emit symbols with probabilities ():
- Self-Information: Uncertainty resolved upon observing symbol :
(Base yields nats, where ; base yields Hartleys, where .)
- Source Entropy : Average information (and theoretical minimum average bits per symbol) emitted by the source:
reaches its maximum when all symbols are equiprobable ().
- Average Codeword Length & Transmission Efficiency: If symbol is assigned a codeword of length bits:
Lossless vs. Lossy Compression
| Aspect | Lossless Compression | Lossy Compression |
|---|---|---|
| Reconstruction | Exact bit-for-bit recovery of original data | Approximate recovery; discards imperceptible details |
| Compression Ratio | Moderate ( to typical), bounded by entropy | Very high ( to ) |
| Core Techniques | Huffman coding, Shannon-Fano coding, Run-Length Encoding (RLE), LZ77/LZW | Quantization, Discrete Cosine Transform (DCT), psychoacoustic/visual masking |
| Use Cases | Text, source code, executables, databases, PNG, ZIP, FLAC | Natural photos (JPEG), audio (MP3, AAC), video (MPEG, H.264) |
Lossless Compression Algorithms
Both Huffman and Shannon-Fano produce prefix-free (instantaneous) codes, meaning no valid codeword is a prefix of any other codeword so the bitstream decodes uniquely without delimiters (DC Ch8).
- Binary Huffman Coding (Bottom-Up, Optimal):
- List symbols in descending order of probability.
- Combine the two smallest-probability symbols into a new merged node whose probability is their sum, and re-insert it in sorted order.
- Repeat until a single root node () remains.
- Label upper/lower (or left/right) branches at every merge with
0and1consistently, and read each symbol's codeword from the root to its leaf. Huffman coding guarantees the smallest possible among symbol-by-symbol prefix codes ().
- Shannon-Fano Coding (Top-Down):
- Arrange symbols in decreasing order of probability.
- Partition the list into two groups whose probability sums are as nearly equal as possible.
- Append
0to every symbol in the upper group and1to every symbol in the lower group. - Recursively repeat partitioning on each group containing more than one symbol until every symbol sits alone.
Worked Examples
1
Two microwave antennas of heights and communicate over a line-of-sight link at ().
- Calculate the maximum radio line-of-sight distance (using ).
- Compute the Free-Space Path Loss in over .
1. Maximum line-of-sight distance:
Since , the link is well within the radio horizon.
2. Free-space path loss at :
- .
- Free-space path loss .
2
Using CRC with dataword 100100 and generator key 1101 ():
- Determine the CRC remainder and the transmitted codeword.
- Verify that dividing the error-free codeword by
1101produces remainder000, and show that a single-bit error flipping the last bit to100100000yields a nonzero remainder.
1. Sender CRC division (key length zeros appended): Append zeros to 100100 to form 100100000, then divide modulo-2 (XOR) by 1101:
111101 (quotient)
---------
1101 ) 100100000
1101
----
1000
1101
----
1010
1101
----
1110
1101
----
0110
0000
----
1100
1101
----
001 <-- 3-bit CRC remainderAppending 001 gives the transmitted codeword 100100001.
2. Receiver check (no error vs. 1-bit error):
- Error-free (
100100001): Dividing100100001by1101follows the same steps until the final row1101 ^ 1101 = 000(all zeros accepted). - Corrupted (
100100000): The final XOR becomes1100 ^ 1101 = 001(nonzero error detected and frame rejected).
- CRC remainder =
001; transmitted codeword =100100001. - Error-free remainder =
000; corrupted100100000remainder =001(error detected).
3
- Construct the Hamming code (even parity) for the -bit message
1000. - Suppose a channel flips bit position so the receiver gets
1110100. Compute the syndrome and recover the original data.
1. Encode 1000 into Hamming code: Here and since . Place data bits at positions and parity bits at positions :
- checks (for even parity).
- checks .
- checks .
Codeword (positions to ): 1110000.
2. Error detection and correction on 1110100: Label received bits and recompute even-parity checks:
Syndrome . Flipping bit (1 0) corrects the codeword to 1110000, recovering message 1000.
- Encoded Hamming codeword =
1110000. - Syndrome =
101(); flipping bit restores1110000and data1000.
4
A source emits five symbols with probabilities . Construct a Binary Huffman code (minimum-variance placement), compute the source entropy , average codeword length , and coding efficiency .
Sort symbols and perform Huffman merges: Sort descending: .
- Merge the two smallest probabilities and , and place the combined node at the top of the tie-group for minimum codeword-length variance.
- Merge the two lowest nodes and .
- The remaining three nodes are , , and . Breaking the tie by merging with (
0branch at root) leaves on the1branch at root so all lengths remain balanced (minimum variance):- Root (
0,1):- Under :
000;1(0,1)010,011. - Under :
010;111.
- Under :
- Root (
Tabulate codes, entropy, average length, and efficiency:
| Symbol | Probability | Codeword | Length |
|---|---|---|---|
00 | |||
10 | |||
11 | |||
010 | |||
011 |
Codewords: , , , , ; , , efficiency .
Exercises
Exercises
Describe ground-wave, sky-wave, and line-of-sight propagation with their typical frequency bands and applications. Two line-of-sight antennas have heights and ; find their maximum radio horizon distance.
Wireless propagation modes:
- Ground Wave (, VLF/LF/MF): Vertically polarized waves follow Earth's curvature via diffraction; used in AM radio and maritime navigation.
- Sky Wave (, HF): Waves reflect/refract from ionospheric layers for long-distance multi-hop links; exhibits a skip zone; used in international shortwave and amateur radio.
- Line-of-Sight (, VHF/UHF/SHF/EHF): Waves travel directly between unobstructed elevated antennas; used in FM radio, TV, Wi-Fi, cellular, and microwave/satellite links.
Maximum radio horizon distance ():
Ground wave (), sky wave (), and line-of-sight (); maximum radio horizon distance is .
Define Hamming distance and minimum Hamming distance (). For a block code with , how many bit errors can it guarantee to (a) detect, and (b) correct? Also compute .
Definitions and XOR calculation: The Hamming distance is the number of differing bit positions between two equal-length words (s in ); is the smallest distance over all pairs of distinct codewords.
Error detection and correction limits for :
- Detection: errors.
- Correction: errors.
; a code with detects up to errors and corrects up to errors.
Explain the 1's complement checksum method. Compute the -bit checksum for the three -bit data segments 1011, 0110, and 1101, and verify the receiver's check when no errors occur.
Sender checksum calculation ( bits): Add the first two segments in binary: 1011 + 0110 = 10001 (carry-out 1 wraps around: 0001 + 1 = 0010). Add the third segment: 0010 + 1101 = 1111 (no carry). Take the 1's complement of 1111 Checksum = 0000. Transmitted segments: 1011, 0110, 1101, 0000.
Receiver verification: Sum all four received segments with 1's complement wrap-around: 1111 + 0000 = 1111. Complementing gives 0000 (), so the frame is accepted as error-free.
Checksum = 0000; at the receiver, the 1's complement sum of all four segments is 1111, whose complement is 0000 (valid).
Using CRC generator (10011), find the transmitted codeword for message 10110011, and verify that the receiver gets zero remainder when no error occurs.
Append zeros (101100110000) and divide modulo-2 by 10011:
10011 ) 101100110000
10011
-----
010101
10011
-----
011010
10011
-----
10010
10011
-----
000100 (remainder = 0100)Appending 0100 yields the transmitted -bit codeword 101100110100.
Receiver verification: Dividing 101100110100 by 10011 gives exact cancellation in the final step (10011 ^ 10011 = 0000), yielding remainder 0000 (no error).
CRC remainder = 0100; transmitted codeword = 101100110100 (receiver remainder = 0000).
The generator matrix for a systematic Linear Block Code is:
Obtain all valid codewords and determine the minimum Hamming distance of this code.
Derive the parity equations from : Using :
Tabulate all codewords and find :
| Message | Parity | Codeword | Hamming Weight |
|---|---|---|---|
000 | 000 | 000000 | |
001 | 101 | 001101 | |
010 | 110 | 010110 | |
011 | 011 | 011011 | |
100 | 111 | 100111 | |
101 | 010 | 101010 | |
110 | 001 | 110001 | |
111 | 100 | 111100 |
For any linear block code, equals the minimum Hamming weight among all nonzero codewords, which is (can detect errors or correct error).
The codewords are 000000, 001101, 010110, 011011, 100111, 101010, 110001, 111100, with .
Find the Huffman code for four symbols with probabilities . Calculate the source entropy , average code length , and coding efficiency .
Construct the Huffman code:
- Merge the two smallest symbols and (
0,1). - Merge (
0) and (1) . - Merge (
0) and (1) .
Codewords: ( bit), ( bits), ( bits), ( bits).
Calculate entropy, average length, and efficiency:
Codewords: , , , ; , , efficiency .
Differentiate between lossless and lossy data compression. Apply Shannon-Fano coding to the five-symbol source with probabilities , and compute its coding efficiency.
Lossless vs. Lossy compression: Lossless compression guarantees exact reconstruction of the original bit stream (required for text, programs, and structured records), whereas lossy compression discards perceptually minor information to achieve much higher compression ratios for images, audio, and video.
Shannon-Fano partitioning: Sorted list: .
- First split (closest to ): (sum
0) vs. (sum1). - Split :
00,01. - Split (each ): (
010) vs. (1), then110,111.
Entropy, average length, and efficiency:
Shannon-Fano codes: , , , , ; , , efficiency .