Channel Capacity, Mutual Information, and Shannon Noisy-Channel Coding Theorem

Unit 6 — Multiple access and synchronization

Why this unit exists

The unit centers on multiuser field-monitoring network, where many low-power remote stations periodically report data to a shared collector. Its controlling difficulty is that contention, power imbalance and receiver synchronization dominate crowded periods. The four lessons isolate different parts of the mechanism, yet the delivered system must satisfy all of them at once. You will link equations to implementation, design measurements and deliberately test situations in which a convenient idealization becomes misleading.

Concept sequence

Lesson 6.1 — Direct-sequence spreading and processing gain

Spread spectrum distributes each narrowband data symbol across multiple chips and then despreads it by correlation with a matched sequence. Despreading strengthens a correctly aligned desired signal relative to certain uncorrelated narrowband interferers, but it cannot create signal energy. Chip timing must be aligned for the correlation peak. The code autocorrelation sidelobes and received interference statistics determine effective performance. Security or privacy must not be inferred from an easily observed spreading sequence.

Key relation: Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N.

Design boundary: The processing-gain ratio is not automatically a net SNR gain in additive white noise after a matched receiver when transmit energy per bit is held constant.

Lesson 6.2 — Code division and the near-far problem

Code division multiple access assigns distinguishable signatures to users occupying overlapping time-frequency resources. Ideal orthogonality is possible under tight synchronization and specific sequences, but asynchronous delays, multipath and unequal power destroy it. If one transmitter arrives much more strongly than another, even modest cross-correlation leaks excessive interference into the weak user's detector. Closed-loop power control, multiuser detection and interference cancellation are possible mitigations, each with stability, latency and estimation costs.

Key relation: In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values.

Design boundary: Power-control error and capture effect interact with receiver dynamic range; a digital multiuser detector cannot recover an ADC signal that has already saturated.

Lesson 6.3 — Timing acquisition and synchronization loops

Frame timing estimates where a candidate packet begins; symbol timing estimates the sampling phase that captures pulse energy while suppressing ISI. A preamble correlation peak provides a useful acquisition marker but can be blurred by multipath and repeated pattern ambiguity. Fine tracking commonly uses timing error detectors within a feedback loop. Error detector gain depends on pulse shape and SNR. The loop cannot choose arbitrary speed: wide bandwidth follows drift but passes more jitter, while narrow bandwidth filters noise at the cost of slower acquisition.

Key relation: For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path.

Design boundary: A high correlation peak can occur at a delayed echo; earliest-arrival ranging demands more than choosing the global maximum. Interference and sample-rate mismatch can also shift estimates.

Lesson 6.4 — Frequency hopping and coexistence

Frequency hopping can avoid repeatedly occupying the same narrowband interference source when the hop plan and interferer statistics are favorable. The receiver must know or acquire the hop timing and hopping pattern. Slow hopping uses several symbols per hop, while fast hopping can move multiple times per symbol. Regulatory requirements, spectral masks and available band plans strongly constrain real implementations. This book models abstract signals only and does not suggest transmitting on unlicensed or licensed frequencies without authorization.

Key relation: A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure.

Design boundary: The gain disappears if an interferer follows the sequence or covers the full hopping band. Some coexistence systems need sensing and coordination rather than purely pseudo-random hopping.

Integrated case study

An engineer reviews the architecture for multiuser field-monitoring network. The first review identifies the performance or integrity quantity at the receiver. The second asks which subsystem can change that quantity. The third checks the impact on user payload, energy consumption, delay and operating cost. A favorable conclusion requires comparable conditions; changing both the channel model and signal power while comparing decoders makes it impossible to attribute improvement to one change.

Three-stage assessment plan

1. Analytical baseline. Derive a transparent relation using one of the four listed key models. Describe the allowed parameter region, units and what was held constant in the comparison. For multiuser field-monitoring network, decide which model variable is realistically measurable and which must be inferred.

2. Synthetic controlled test. Isolate one impairment, vary its magnitude and compare to the baseline. Re-run with a different seed and a second numerical implementation. Build a plot with labeled axes and, for error probabilities, uncertainty intervals.

3. Engineering hand-off. Replace the idealized assumption with a more plausible impairment relevant to many low-power remote stations periodically report data to a shared collector. State which earlier conclusion remains reliable and which needs further data. Record what must be checked before a prototype is trusted outside the laboratory.

Unit questions

• Which of the four mechanisms is most likely to control acceptance for multiuser field-monitoring network, and what measured evidence would establish that claim?

• How would the design fail if the assumption “The processing-gain ratio is not automatically a net SNR gain in additive white noise after a matched receiver when transmit energy per bit is held constant.” were ignored?

• Identify a numerical sanity check, an implementation test, and a separate real-world validation requirement.

• Where would additional redundancy help and where might it merely increase latency or occupy already-limited bandwidth?

Suggested learning order

Read the four lessons in order; complete the simulation, then submit the project with a result table and the associated limitations.

Unit 6, Lesson 1: Direct-sequence spreading and processing gain

Module: Multiple access and synchronization. Prerequisites: Communication Systems I, introductory probability, linear systems, complex algebra and elementary Python or JavaScript.

Learning outcomes

• Explain direct-sequence spreading and processing gain from a physical or algorithmic model rather than memorizing an isolated equation.

• Distinguish assumptions, symbols, measured quantities and synthesized values in a complete communications link.

• Perform an independent limiting-case check and identify an operating region where the model fails.

• Design and document a reproducible synthetic experiment that tests a stated prediction.

System context and motivating decision

Consider multiuser field-monitoring network: many low-power remote stations periodically report data to a shared collector. In this setting, contention, power imbalance and receiver synchronization dominate crowded periods. The engineer therefore needs a model that is useful at the right reference plane, not an attractive formula copied from a different link. A quantity measured at the transmitter cannot automatically be used as if it were the receive-filter output, and uncoded symbol reliability cannot be silently treated as packet reliability. The purpose of this lesson is to connect direct-sequence spreading and processing gain with observable decisions in this chain.

Physical or algorithmic explanation

Spread spectrum distributes each narrowband data symbol across multiple chips and then despreads it by correlation with a matched sequence. Despreading strengthens a correctly aligned desired signal relative to certain uncorrelated narrowband interferers, but it cannot create signal energy. Chip timing must be aligned for the correlation peak. The code autocorrelation sidelobes and received interference statistics determine effective performance. Security or privacy must not be inferred from an easily observed spreading sequence.

Core mathematical relationship

Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N.

Meaning and conventions

The central expression above describes direct-sequence spreading and processing gain. Before calculating, identify the set of variables, their units and whether the expression applies to discrete or continuous time. When the relevant quantities are probabilities, confirm the conditioning event and whether samples are independent. When complex amplitudes occur, remember that a conjugate, not a real transpose, normally defines an energy inner product. Where a ratio of powers is stated in decibels, 10 log10 rather than 20 log10 is the appropriate conversion; for voltage magnitudes with identical impedances, a 20 log10 form may be suitable. This model is one part of the signal processing chain, not a substitute for a performance measurement.

Derive, calculate and inspect

First mark the source of the input and output quantities in Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N.. State which symbols are known, which must be estimated and which are chosen by design. Translate the equation into a reproducible step-by-step computation, then test zero or very small noise, an intermediate operating point and a stressed case. A result should remain physically interpretable under these changes. Where the relationship is approximate, determine the approximation error before interpreting small performance improvements as significant. Never add gains or losses twice because the same physical effect appears in two bookkeeping categories.

Fully explained example and verification

For 16 chips per symbol, the ratio of chip rate to symbol rate is 16 and nominal processing gain is 12.04 dB. If the symbol rate is 50 ksym/s, the chip rate is 800 kchips/s. Actual interference rejection is reduced by acquisition errors and nonideal code properties.

How to verify: Recompute the numeric statement from the specified inputs without reading a plotted curve. Re-run after increasing the most influential input by 10%, and explain the direction and approximate size of the change. Then compare that outcome with the limiting case for the model. A plausible number is not sufficient if the observation plane, normalization or statistical assumptions have changed.

Boundary conditions and common mistakes

The processing-gain ratio is not automatically a net SNR gain in additive white noise after a matched receiver when transmit energy per bit is held constant.

An additional failure mode in multiuser field-monitoring network arises when the local mechanism is interpreted as an end-to-end guarantee. For example, packets may be rejected by framing or replay checks even after an error-correcting decoder outputs a plausible bit sequence; conversely, a successful frame may be too late to serve a time-critical application. To separate causes, log the inputs and outputs of each major subsystem, retain the raw observation when possible, and name the exact stage at which a failure is declared.

Guided computational experiment

Correlate a ±1 16-chip sequence with cyclic shifts of itself and compare the peak with sidelobes. Add one sinusoidal interfering tone and show matched-filter output versus time alignment.

Reproducibility protocol. Record the independent variables, their increments and physical units; state random seeds, number of simulated trials and target metrics. Use two numerical implementations for at least one predicted point. When drawing a probability curve, use enough trials to estimate its uncertainty and report the confidence interval; small error counts produce unstable estimates. When a parameter sweep crosses a model limit, annotate the plot rather than truncating inconvenient results.

Problem set with targeted response guidance

Question 1. Reference planes and dimensional consistency

Draw the component-level path through many low-power remote stations periodically report data to a shared collector. Label exactly where the inputs to “Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N.” are acquired or estimated. Construct a three-column table of quantity, unit, and uncertainty source. Identify one tempting but invalid substitution and explain which physical interface it crosses.

Answer guidance: A complete solution has a block diagram and a clear distinction between physical measurement and algorithmic estimate. For direct-sequence spreading and processing gain, justify every normalization and explicitly say what is held constant when comparing two conditions.

Question 2. Rebuild the numerical case

Independently reconstruct the worked calculation for direct-sequence spreading and processing gain. Change the leading numerical parameter by 20%, holding other inputs fixed, and explain whether the result changes linearly or nonlinearly. Supply every intermediate numerical step.

Answer guidance: The answer must reproduce the worked statement under its stated assumptions, account for units, and include an inverse or limiting check. If a result disagrees, trace the exact operation; do not round intermediate values until the final display.

Question 3. Competing design changes

For multiuser field-monitoring network, propose two ways to improve the outcome represented by Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N.: one changes a transmitter or source parameter, the other changes receiver processing. List their respective energy, implementation, latency and spectral costs.

Answer guidance: Grade the response on tradeoffs, not a single optimization metric. For this topic, specify which impairment each intervention addresses and whether a gain in one stage increases overhead elsewhere.

Question 4. Break the assumptions

Create a deliberately unrealistic operating point for direct-sequence spreading and processing gain and explain a specific broken assumption. Then propose a synthetic observation that would reveal the failure. Describe what a poorly documented analysis might incorrectly conclude.

Answer guidance: The response must identify an assumption explicitly and design a measurement that detects the discrepancy. Replacing one uncertain parameter with a convenient nominal value is not an assumption test.

Further engineering synthesis

To write a defensible report for direct-sequence spreading and processing gain, separate evidence into three columns: a derivation, a reproducible numerical implementation and a system-level observation. The derivation establishes the modeled relationship; simulation checks implementation and explore cases that are hard to calculate by hand; field observation tests the relevance of modeling assumptions. Failure of a field measurement to match the derivation may reveal either a coding bug or a missing physical effect. Avoid the reflex to adjust free parameters until curves agree, because that conceals rather than explains uncertainty.

Finally trace the effect of direct-sequence spreading and processing gain onto throughput, occupied bandwidth, energy per delivered information bit and deadline failures for multiuser field-monitoring network. Describe which of these metrics has a monotonic response to parameter changes and which displays a tradeoff. Explain the direction of the tradeoff with one numerical or plotted piece of evidence; where evidence is absent, label the claim as a hypothesis. Every numerical conclusion should be reproducible from recorded inputs.

Cross-reference: See the model for Unit 6, Unit 6 project brief and its assessment. The simulation depicts a deliberately simplified subproblem; it does not certify a live communication system.

Unit 6, Lesson 2: Code division and the near-far problem

Module: Multiple access and synchronization. Prerequisites: Communication Systems I, introductory probability, linear systems, complex algebra and elementary Python or JavaScript.

Learning outcomes

• Explain code division and the near-far problem from a physical or algorithmic model rather than memorizing an isolated equation.

• Distinguish assumptions, symbols, measured quantities and synthesized values in a complete communications link.

• Perform an independent limiting-case check and identify an operating region where the model fails.

• Design and document a reproducible synthetic experiment that tests a stated prediction.

System context and motivating decision

Consider multiuser field-monitoring network: many low-power remote stations periodically report data to a shared collector. In this setting, contention, power imbalance and receiver synchronization dominate crowded periods. The engineer therefore needs a model that is useful at the right reference plane, not an attractive formula copied from a different link. A quantity measured at the transmitter cannot automatically be used as if it were the receive-filter output, and uncoded symbol reliability cannot be silently treated as packet reliability. The purpose of this lesson is to connect code division and the near-far problem with observable decisions in this chain.

Physical or algorithmic explanation

Code division multiple access assigns distinguishable signatures to users occupying overlapping time-frequency resources. Ideal orthogonality is possible under tight synchronization and specific sequences, but asynchronous delays, multipath and unequal power destroy it. If one transmitter arrives much more strongly than another, even modest cross-correlation leaks excessive interference into the weak user's detector. Closed-loop power control, multiuser detection and interference cancellation are possible mitigations, each with stability, latency and estimation costs.

Core mathematical relationship

In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values.

Meaning and conventions

The central expression above describes code division and the near-far problem. Before calculating, identify the set of variables, their units and whether the expression applies to discrete or continuous time. When the relevant quantities are probabilities, confirm the conditioning event and whether samples are independent. When complex amplitudes occur, remember that a conjugate, not a real transpose, normally defines an energy inner product. Where a ratio of powers is stated in decibels, 10 log10 rather than 20 log10 is the appropriate conversion; for voltage magnitudes with identical impedances, a 20 log10 form may be suitable. This model is one part of the signal processing chain, not a substitute for a performance measurement.

Derive, calculate and inspect

First mark the source of the input and output quantities in In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values.. State which symbols are known, which must be estimated and which are chosen by design. Translate the equation into a reproducible step-by-step computation, then test zero or very small noise, an intermediate operating point and a stressed case. A result should remain physically interpretable under these changes. Where the relationship is approximate, determine the approximation error before interpreting small performance improvements as significant. Never add gains or losses twice because the same physical effect appears in two bookkeeping categories.

Fully explained example and verification

Suppose the undesired user's received power is 100 times the desired power (20 dB stronger), and the absolute normalized code cross-correlation is 0.1. The interference amplitude after despreading is 10*0.1=1 times the desired amplitude. Therefore the undesired contribution can be comparable to the desired decision signal despite a small correlation coefficient.

How to verify: Recompute the numeric statement from the specified inputs without reading a plotted curve. Re-run after increasing the most influential input by 10%, and explain the direction and approximate size of the change. Then compare that outcome with the limiting case for the model. A plausible number is not sufficient if the observation plane, normalization or statistical assumptions have changed.

Boundary conditions and common mistakes

Power-control error and capture effect interact with receiver dynamic range; a digital multiuser detector cannot recover an ADC signal that has already saturated.

An additional failure mode in multiuser field-monitoring network arises when the local mechanism is interpreted as an end-to-end guarantee. For example, packets may be rejected by framing or replay checks even after an error-correcting decoder outputs a plausible bit sequence; conversely, a successful frame may be too late to serve a time-critical application. To separate causes, log the inputs and outputs of each major subsystem, retain the raw observation when possible, and name the exact stage at which a failure is declared.

Guided computational experiment

Construct two sequences with adjustable correlation and vary relative received powers from -30 to +30 dB. Report the interference-to-signal ratio at the correlator output.

Reproducibility protocol. Record the independent variables, their increments and physical units; state random seeds, number of simulated trials and target metrics. Use two numerical implementations for at least one predicted point. When drawing a probability curve, use enough trials to estimate its uncertainty and report the confidence interval; small error counts produce unstable estimates. When a parameter sweep crosses a model limit, annotate the plot rather than truncating inconvenient results.

Problem set with targeted response guidance

Question 1. Reference planes and dimensional consistency

Draw the component-level path through many low-power remote stations periodically report data to a shared collector. Label exactly where the inputs to “In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values.” are acquired or estimated. Construct a three-column table of quantity, unit, and uncertainty source. Identify one tempting but invalid substitution and explain which physical interface it crosses.

Answer guidance: A complete solution has a block diagram and a clear distinction between physical measurement and algorithmic estimate. For code division and the near-far problem, justify every normalization and explicitly say what is held constant when comparing two conditions.

Question 2. Rebuild the numerical case

Independently reconstruct the worked calculation for code division and the near-far problem. Change the leading numerical parameter by 20%, holding other inputs fixed, and explain whether the result changes linearly or nonlinearly. Supply every intermediate numerical step.

Answer guidance: The answer must reproduce the worked statement under its stated assumptions, account for units, and include an inverse or limiting check. If a result disagrees, trace the exact operation; do not round intermediate values until the final display.

Question 3. Competing design changes

For multiuser field-monitoring network, propose two ways to improve the outcome represented by In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values.: one changes a transmitter or source parameter, the other changes receiver processing. List their respective energy, implementation, latency and spectral costs.

Answer guidance: Grade the response on tradeoffs, not a single optimization metric. For this topic, specify which impairment each intervention addresses and whether a gain in one stage increases overhead elsewhere.

Question 4. Break the assumptions

Create a deliberately unrealistic operating point for code division and the near-far problem and explain a specific broken assumption. Then propose a synthetic observation that would reveal the failure. Describe what a poorly documented analysis might incorrectly conclude.

Answer guidance: The response must identify an assumption explicitly and design a measurement that detects the discrepancy. Replacing one uncertain parameter with a convenient nominal value is not an assumption test.

Further engineering synthesis

To write a defensible report for code division and the near-far problem, separate evidence into three columns: a derivation, a reproducible numerical implementation and a system-level observation. The derivation establishes the modeled relationship; simulation checks implementation and explore cases that are hard to calculate by hand; field observation tests the relevance of modeling assumptions. Failure of a field measurement to match the derivation may reveal either a coding bug or a missing physical effect. Avoid the reflex to adjust free parameters until curves agree, because that conceals rather than explains uncertainty.

Finally trace the effect of code division and the near-far problem onto throughput, occupied bandwidth, energy per delivered information bit and deadline failures for multiuser field-monitoring network. Describe which of these metrics has a monotonic response to parameter changes and which displays a tradeoff. Explain the direction of the tradeoff with one numerical or plotted piece of evidence; where evidence is absent, label the claim as a hypothesis. Every numerical conclusion should be reproducible from recorded inputs.

Cross-reference: See the model for Unit 6, Unit 6 project brief and its assessment. The simulation depicts a deliberately simplified subproblem; it does not certify a live communication system.

Unit 6, Lesson 3: Timing acquisition and synchronization loops

Module: Multiple access and synchronization. Prerequisites: Communication Systems I, introductory probability, linear systems, complex algebra and elementary Python or JavaScript.

Learning outcomes

• Explain timing acquisition and synchronization loops from a physical or algorithmic model rather than memorizing an isolated equation.

• Distinguish assumptions, symbols, measured quantities and synthesized values in a complete communications link.

• Perform an independent limiting-case check and identify an operating region where the model fails.

• Design and document a reproducible synthetic experiment that tests a stated prediction.

System context and motivating decision

Consider multiuser field-monitoring network: many low-power remote stations periodically report data to a shared collector. In this setting, contention, power imbalance and receiver synchronization dominate crowded periods. The engineer therefore needs a model that is useful at the right reference plane, not an attractive formula copied from a different link. A quantity measured at the transmitter cannot automatically be used as if it were the receive-filter output, and uncoded symbol reliability cannot be silently treated as packet reliability. The purpose of this lesson is to connect timing acquisition and synchronization loops with observable decisions in this chain.

Physical or algorithmic explanation

Frame timing estimates where a candidate packet begins; symbol timing estimates the sampling phase that captures pulse energy while suppressing ISI. A preamble correlation peak provides a useful acquisition marker but can be blurred by multipath and repeated pattern ambiguity. Fine tracking commonly uses timing error detectors within a feedback loop. Error detector gain depends on pulse shape and SNR. The loop cannot choose arbitrary speed: wide bandwidth follows drift but passes more jitter, while narrow bandwidth filters noise at the cost of slower acquisition.

Core mathematical relationship

For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path.

Meaning and conventions

The central expression above describes timing acquisition and synchronization loops. Before calculating, identify the set of variables, their units and whether the expression applies to discrete or continuous time. When the relevant quantities are probabilities, confirm the conditioning event and whether samples are independent. When complex amplitudes occur, remember that a conjugate, not a real transpose, normally defines an energy inner product. Where a ratio of powers is stated in decibels, 10 log10 rather than 20 log10 is the appropriate conversion; for voltage magnitudes with identical impedances, a 20 log10 form may be suitable. This model is one part of the signal processing chain, not a substitute for a performance measurement.

Derive, calculate and inspect

First mark the source of the input and output quantities in For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path.. State which symbols are known, which must be estimated and which are chosen by design. Translate the equation into a reproducible step-by-step computation, then test zero or very small noise, an intermediate operating point and a stressed case. A result should remain physically interpretable under these changes. Where the relationship is approximate, determine the approximation error before interpreting small performance improvements as significant. Never add gains or losses twice because the same physical effect appears in two bookkeeping categories.

Fully explained example and verification

For a length-8 BPSK preamble p=[1,1,1,-1,1,-1,-1,1], noiseless correlation at perfect alignment gives sum |p[n]|²=8. At an offset, the correlation depends on the sequence autocorrelation, and the magnitude can be lower or occasionally ambiguous for poorly selected preambles.

How to verify: Recompute the numeric statement from the specified inputs without reading a plotted curve. Re-run after increasing the most influential input by 10%, and explain the direction and approximate size of the change. Then compare that outcome with the limiting case for the model. A plausible number is not sufficient if the observation plane, normalization or statistical assumptions have changed.

Boundary conditions and common mistakes

A high correlation peak can occur at a delayed echo; earliest-arrival ranging demands more than choosing the global maximum. Interference and sample-rate mismatch can also shift estimates.

An additional failure mode in multiuser field-monitoring network arises when the local mechanism is interpreted as an end-to-end guarantee. For example, packets may be rejected by framing or replay checks even after an error-correcting decoder outputs a plausible bit sequence; conversely, a successful frame may be too late to serve a time-critical application. To separate causes, log the inputs and outputs of each major subsystem, retain the raw observation when possible, and name the exact stage at which a failure is declared.

Guided computational experiment

Generate one preamble followed by random payload, add two delayed echoes and noise, and plot correlator magnitude. Measure acquisition failure probability for multiple detection thresholds.

Reproducibility protocol. Record the independent variables, their increments and physical units; state random seeds, number of simulated trials and target metrics. Use two numerical implementations for at least one predicted point. When drawing a probability curve, use enough trials to estimate its uncertainty and report the confidence interval; small error counts produce unstable estimates. When a parameter sweep crosses a model limit, annotate the plot rather than truncating inconvenient results.

Problem set with targeted response guidance

Question 1. Reference planes and dimensional consistency

Draw the component-level path through many low-power remote stations periodically report data to a shared collector. Label exactly where the inputs to “For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path.” are acquired or estimated. Construct a three-column table of quantity, unit, and uncertainty source. Identify one tempting but invalid substitution and explain which physical interface it crosses.

Answer guidance: A complete solution has a block diagram and a clear distinction between physical measurement and algorithmic estimate. For timing acquisition and synchronization loops, justify every normalization and explicitly say what is held constant when comparing two conditions.

Question 2. Rebuild the numerical case

Independently reconstruct the worked calculation for timing acquisition and synchronization loops. Change the leading numerical parameter by 20%, holding other inputs fixed, and explain whether the result changes linearly or nonlinearly. Supply every intermediate numerical step.

Answer guidance: The answer must reproduce the worked statement under its stated assumptions, account for units, and include an inverse or limiting check. If a result disagrees, trace the exact operation; do not round intermediate values until the final display.

Question 3. Competing design changes

For multiuser field-monitoring network, propose two ways to improve the outcome represented by For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path.: one changes a transmitter or source parameter, the other changes receiver processing. List their respective energy, implementation, latency and spectral costs.

Answer guidance: Grade the response on tradeoffs, not a single optimization metric. For this topic, specify which impairment each intervention addresses and whether a gain in one stage increases overhead elsewhere.

Question 4. Break the assumptions

Create a deliberately unrealistic operating point for timing acquisition and synchronization loops and explain a specific broken assumption. Then propose a synthetic observation that would reveal the failure. Describe what a poorly documented analysis might incorrectly conclude.

Answer guidance: The response must identify an assumption explicitly and design a measurement that detects the discrepancy. Replacing one uncertain parameter with a convenient nominal value is not an assumption test.

Further engineering synthesis

To write a defensible report for timing acquisition and synchronization loops, separate evidence into three columns: a derivation, a reproducible numerical implementation and a system-level observation. The derivation establishes the modeled relationship; simulation checks implementation and explore cases that are hard to calculate by hand; field observation tests the relevance of modeling assumptions. Failure of a field measurement to match the derivation may reveal either a coding bug or a missing physical effect. Avoid the reflex to adjust free parameters until curves agree, because that conceals rather than explains uncertainty.

Finally trace the effect of timing acquisition and synchronization loops onto throughput, occupied bandwidth, energy per delivered information bit and deadline failures for multiuser field-monitoring network. Describe which of these metrics has a monotonic response to parameter changes and which displays a tradeoff. Explain the direction of the tradeoff with one numerical or plotted piece of evidence; where evidence is absent, label the claim as a hypothesis. Every numerical conclusion should be reproducible from recorded inputs.

Cross-reference: See the model for Unit 6, Unit 6 project brief and its assessment. The simulation depicts a deliberately simplified subproblem; it does not certify a live communication system.

Unit 6, Lesson 4: Frequency hopping and coexistence

Module: Multiple access and synchronization. Prerequisites: Communication Systems I, introductory probability, linear systems, complex algebra and elementary Python or JavaScript.

Learning outcomes

• Explain frequency hopping and coexistence from a physical or algorithmic model rather than memorizing an isolated equation.

• Distinguish assumptions, symbols, measured quantities and synthesized values in a complete communications link.

• Perform an independent limiting-case check and identify an operating region where the model fails.

• Design and document a reproducible synthetic experiment that tests a stated prediction.

System context and motivating decision

Consider multiuser field-monitoring network: many low-power remote stations periodically report data to a shared collector. In this setting, contention, power imbalance and receiver synchronization dominate crowded periods. The engineer therefore needs a model that is useful at the right reference plane, not an attractive formula copied from a different link. A quantity measured at the transmitter cannot automatically be used as if it were the receive-filter output, and uncoded symbol reliability cannot be silently treated as packet reliability. The purpose of this lesson is to connect frequency hopping and coexistence with observable decisions in this chain.

Physical or algorithmic explanation

Frequency hopping can avoid repeatedly occupying the same narrowband interference source when the hop plan and interferer statistics are favorable. The receiver must know or acquire the hop timing and hopping pattern. Slow hopping uses several symbols per hop, while fast hopping can move multiple times per symbol. Regulatory requirements, spectral masks and available band plans strongly constrain real implementations. This book models abstract signals only and does not suggest transmitting on unlicensed or licensed frequencies without authorization.

Core mathematical relationship

A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure.

Meaning and conventions

The central expression above describes frequency hopping and coexistence. Before calculating, identify the set of variables, their units and whether the expression applies to discrete or continuous time. When the relevant quantities are probabilities, confirm the conditioning event and whether samples are independent. When complex amplitudes occur, remember that a conjugate, not a real transpose, normally defines an energy inner product. Where a ratio of powers is stated in decibels, 10 log10 rather than 20 log10 is the appropriate conversion; for voltage magnitudes with identical impedances, a 20 log10 form may be suitable. This model is one part of the signal processing chain, not a substitute for a performance measurement.

Derive, calculate and inspect

First mark the source of the input and output quantities in A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure.. State which symbols are known, which must be estimated and which are chosen by design. Translate the equation into a reproducible step-by-step computation, then test zero or very small noise, an intermediate operating point and a stressed case. A result should remain physically interpretable under these changes. Where the relationship is approximate, determine the approximation error before interpreting small performance improvements as significant. Never add gains or losses twice because the same physical effect appears in two bookkeeping categories.

Fully explained example and verification

If a transmitter spends equal time across 20 channels and one channel has persistent interference, the expected fraction of hops landing on that channel is 1/20=5%, assuming uniform hopping and independence. That estimate does not imply only 5% packet loss, because packet lengths, coding and hop dwell matter.

How to verify: Recompute the numeric statement from the specified inputs without reading a plotted curve. Re-run after increasing the most influential input by 10%, and explain the direction and approximate size of the change. Then compare that outcome with the limiting case for the model. A plausible number is not sufficient if the observation plane, normalization or statistical assumptions have changed.

Boundary conditions and common mistakes

The gain disappears if an interferer follows the sequence or covers the full hopping band. Some coexistence systems need sensing and coordination rather than purely pseudo-random hopping.

An additional failure mode in multiuser field-monitoring network arises when the local mechanism is interpreted as an end-to-end guarantee. For example, packets may be rejected by framing or replay checks even after an error-correcting decoder outputs a plausible bit sequence; conversely, a successful frame may be too late to serve a time-critical application. To separate causes, log the inputs and outputs of each major subsystem, retain the raw observation when possible, and name the exact stage at which a failure is declared.

Guided computational experiment

Simulate packet delivery across 20 abstract channels with one blocked channel and compare uniform, static, and avoidance scheduling under the same offered data load.

Reproducibility protocol. Record the independent variables, their increments and physical units; state random seeds, number of simulated trials and target metrics. Use two numerical implementations for at least one predicted point. When drawing a probability curve, use enough trials to estimate its uncertainty and report the confidence interval; small error counts produce unstable estimates. When a parameter sweep crosses a model limit, annotate the plot rather than truncating inconvenient results.

Problem set with targeted response guidance

Question 1. Reference planes and dimensional consistency

Draw the component-level path through many low-power remote stations periodically report data to a shared collector. Label exactly where the inputs to “A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure.” are acquired or estimated. Construct a three-column table of quantity, unit, and uncertainty source. Identify one tempting but invalid substitution and explain which physical interface it crosses.

Answer guidance: A complete solution has a block diagram and a clear distinction between physical measurement and algorithmic estimate. For frequency hopping and coexistence, justify every normalization and explicitly say what is held constant when comparing two conditions.

Question 2. Rebuild the numerical case

Independently reconstruct the worked calculation for frequency hopping and coexistence. Change the leading numerical parameter by 20%, holding other inputs fixed, and explain whether the result changes linearly or nonlinearly. Supply every intermediate numerical step.

Answer guidance: The answer must reproduce the worked statement under its stated assumptions, account for units, and include an inverse or limiting check. If a result disagrees, trace the exact operation; do not round intermediate values until the final display.

Question 3. Competing design changes

For multiuser field-monitoring network, propose two ways to improve the outcome represented by A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure.: one changes a transmitter or source parameter, the other changes receiver processing. List their respective energy, implementation, latency and spectral costs.

Answer guidance: Grade the response on tradeoffs, not a single optimization metric. For this topic, specify which impairment each intervention addresses and whether a gain in one stage increases overhead elsewhere.

Question 4. Break the assumptions

Create a deliberately unrealistic operating point for frequency hopping and coexistence and explain a specific broken assumption. Then propose a synthetic observation that would reveal the failure. Describe what a poorly documented analysis might incorrectly conclude.

Answer guidance: The response must identify an assumption explicitly and design a measurement that detects the discrepancy. Replacing one uncertain parameter with a convenient nominal value is not an assumption test.

Further engineering synthesis

To write a defensible report for frequency hopping and coexistence, separate evidence into three columns: a derivation, a reproducible numerical implementation and a system-level observation. The derivation establishes the modeled relationship; simulation checks implementation and explore cases that are hard to calculate by hand; field observation tests the relevance of modeling assumptions. Failure of a field measurement to match the derivation may reveal either a coding bug or a missing physical effect. Avoid the reflex to adjust free parameters until curves agree, because that conceals rather than explains uncertainty.

Finally trace the effect of frequency hopping and coexistence onto throughput, occupied bandwidth, energy per delivered information bit and deadline failures for multiuser field-monitoring network. Describe which of these metrics has a monotonic response to parameter changes and which displays a tradeoff. Explain the direction of the tradeoff with one numerical or plotted piece of evidence; where evidence is absent, label the claim as a hypothesis. Every numerical conclusion should be reproducible from recorded inputs.

Cross-reference: See the model for Unit 6, Unit 6 project brief and its assessment. The simulation depicts a deliberately simplified subproblem; it does not certify a live communication system.

Unit 6 project — Multiple access and synchronization

Design brief

Create an original computer-based engineering investigation of multiuser field-monitoring network: many low-power remote stations periodically report data to a shared collector. The stakeholder fears that contention, power imbalance and receiver synchronization dominate crowded periods. Deliver a short technical report that combines the four models in Unit 6, an independent numeric calculation, a simple synthetic implementation and a comparison between two candidate solutions.

Required artifact A — model assumptions and operating points

Write a system block diagram and a table defining the reference points for all quantities in the four lessons. Include a benign operating point and two stresses, one concerning code division and the near-far problem and the other concerning frequency hopping and coexistence. Give symbolic units and numerical values. Make clear which values are synthetic; do not label simulated observations as measured data.

Required artifact B — two methods, one controlled comparison

Implement an equation or algorithm from Direct-sequence spreading and processing gain, then independently recompute a selected point. Next vary an input related to Timing acquisition and synchronization loops while holding the baseline model fixed. Record the dependent metric at at least ten settings; if the output is an estimated failure probability, run multiple seeds and show sampling uncertainty. Report a parameter setting at which the second candidate outperforms the first and one at which it does not.

Required artifact C — intentionally broken assumption

The limitations you must investigate include: (1) The processing-gain ratio is not automatically a net SNR gain in additive white noise after a matched receiver when transmit energy per bit is held constant. (2) A high correlation peak can occur at a delayed echo; earliest-arrival ranging demands more than choosing the global maximum. Interference and sample-rate mismatch can also shift estimates. Choose the more relevant limitation for multiuser field-monitoring network, inject an impairment that invalidates the original assumption, and explain in technical language why the ideal calculation no longer predicts the result. An analysis that merely says “noise got worse” will not pass this requirement.

Required artifact D — user-level consequence

The application is many low-power remote stations periodically report data to a shared collector. Define payload size, raw resource rate, protocol overhead, retransmission rule and the deadline for an accepted message. Trace low-level failure through framing and decoding into delivery success, delay and useful goodput. Prefer a table containing both one-attempt performance and end-to-end outcomes. Explain what real deployment measurements would be required.

Reproducibility and reporting rubric

Submit the source code, version or runtime description, seed list, parameter ranges and generated CSV. Use descriptive filenames, include a short README with instructions for a fresh run, and test one identity or limiting case. Cite the assumptions that make each formula valid. Allocate 30% to physics and mathematical correctness, 25% to experiment design, 20% to interpretation and failure analysis, 15% to reproducibility, and 10% to clarity. An unsupported claim of production readiness receives no credit.

Oral defense prompts

Explain why Code division and the near-far problem was included or excluded in the final design. Which numerical result is most sensitive to a poorly known parameter? What single new piece of hardware or field evidence would most change the conclusion? Finally, explain why the synthetic model is adequate for learning but does not establish a radio license, an optical product certification or safety compliance.

Unit 6 assessment — Multiple access and synchronization

Context: many low-power remote stations periodically report data to a shared collector

Problems (at least three required per unit)

Question 1: Direct-sequence spreading and processing gain

Problem: Starting with Multiplying a data symbol by an N-chip ±1 spreading sequence increases occupied chip rate; nominal processing gain is 10log10(N) dB when chip and symbol periods satisfy Tc=Ts/N., produce a dimensionally consistent worked example and one limiting case, then identify the violated assumption in this scenario: The processing-gain ratio is not automatically a net SNR gain in additive white noise after a matched receiver when transmit energy per bit is held constant.

Mark scheme (10 points): 3 for model and assumptions, 3 for correct arithmetic or logical steps, 2 for limiting-case check, 2 for explaining why the stated limitation changes the conclusion. A correct final number without units and reference plane earns no more than 5 points.

Question 2: Code division and the near-far problem

Problem: Starting with In a two-user spread-spectrum receiver, the undesired despread amplitude is proportional to sqrt(P_interference) times code cross-correlation; near-far imbalance can dominate small correlation values., produce a dimensionally consistent worked example and one limiting case, then identify the violated assumption in this scenario: Power-control error and capture effect interact with receiver dynamic range; a digital multiuser detector cannot recover an ADC signal that has already saturated.

Mark scheme (10 points): 3 for model and assumptions, 3 for correct arithmetic or logical steps, 2 for limiting-case check, 2 for explaining why the stated limitation changes the conclusion. A correct final number without units and reference plane earns no more than 5 points.

Question 3: Timing acquisition and synchronization loops

Problem: Starting with For a known preamble p[n], acquisition can maximize |sum_n r[n+m]p*[n]| over candidate delays m; the strongest peak need not equal the earliest propagation path., produce a dimensionally consistent worked example and one limiting case, then identify the violated assumption in this scenario: A high correlation peak can occur at a delayed echo; earliest-arrival ranging demands more than choosing the global maximum. Interference and sample-rate mismatch can also shift estimates.

Mark scheme (10 points): 3 for model and assumptions, 3 for correct arithmetic or logical steps, 2 for limiting-case check, 2 for explaining why the stated limitation changes the conclusion. A correct final number without units and reference plane earns no more than 5 points.

Question 4: Frequency hopping and coexistence

Problem: Starting with A hopped carrier takes frequencies from an allowed set according to a time-indexed sequence; dwell duration, hop spacing and synchronization govern interference exposure., produce a dimensionally consistent worked example and one limiting case, then identify the violated assumption in this scenario: The gain disappears if an interferer follows the sequence or covers the full hopping band. Some coexistence systems need sensing and coordination rather than purely pseudo-random hopping.

Mark scheme (10 points): 3 for model and assumptions, 3 for correct arithmetic or logical steps, 2 for limiting-case check, 2 for explaining why the stated limitation changes the conclusion. A correct final number without units and reference plane earns no more than 5 points.

Question 5: Joint design

Combine two lessons in the multiuser field-monitoring network case. Propose a before/after experiment where only one controlled variable changes and show how you will report both a link-level metric and a delivered-payload metric.

Mark scheme: prioritize controlled comparison (4), technically justified outcome (4), reproducible evidence (2).

Question 6: Critical evidence review

Find a plausible but unsupported claim of improvement, identify which additional variable may account for the effect, and design one negative control to disprove your own conclusion.

Mark scheme: claims supported by computed or experimentally generated data receive credit; appeals to authority or unsupported statements do not.

Submission policy

Use explicit parameter values, code or workings, and a conclusion that distinguishes verified arithmetic from engineering assumptions.