A pre-decoder error rate and a post-decoder error rate do not measure the same bit stream. Forward error correction deliberately adds redundancy so a receiver can infer intended information despite corrupted coded symbols. The decoder-input metric describes evidence before that correction decision; the decoder-output metric describes residual mistakes after it.
Suppose a teaching block carries 800 information bits as a 1,000-bit coded word. Forty coded bits disagree with their transmitted values, giving a stipulated pre-decoder BER of 40/1,000=4%. The decoder corrects the pattern but leaves two information bits wrong, giving a post-decoder BER of 2/800=0.25%. Dividing both counts by 1,000 would falsely pretend the denominators are the same.
That example is a supplied code outcome, not a claim that every code corrects forty errors or produces two residual errors. Real results depend on the code, decoder, modulation, channel, soft information, interleaving, block length and definition used by the instrument.
This guide develops a focused reader question within the Wireless Communication subject guide. It adds a complete evidence chain, original worked examples, changed-context checks and explicit limits. Read it with The Gold Standard of Education | Learning That Transfers into Life and the How X Works.
Every dataset and calculation below is an invented teaching case. It does not report a real institution, building, website audit or wireless test. Use current documentation, qualified specialists and applicable rules for operational decisions.
The reader job is to locate the counter in the receive chain. Draw demodulation, decoder input, decoder decision, integrity check and higher-layer delivery in order. Attach every error count to the exact bit population and interval at that point.
Pre-FEC evidence can warn that correction margin is shrinking even while post-FEC delivery appears clean. Post-FEC evidence tells us what escaped correction at a defined output, but a reported zero is limited by how many bits were observed. Neither metric alone establishes application reliability.
Some systems estimate pre-decoder BER from soft decisions or re-encoding rather than comparing every received coded bit with a known transmitted sequence. That estimate has a method and calibration. A residual counter may count bit errors, uncorrectable blocks, checksum failures or codeword errors; those outcomes must not be renamed into one another.
The examples use exact transmitted sequences so the stage distinction can be learned. Operational links often lack direct truth bits during normal service and rely on device-specific performance monitoring. Compare values only after confirming definitions, code mode, interval and units.
The practical transfer test changes error placement while holding the count fixed. A code may correct one dispersed pattern and fail on a burst with the same number of wrong coded bits. This shows why pre-decoder BER does not uniquely determine residual output.
The final report should preserve both health and outcome evidence. State the pre-decoder condition, post-decoder residual, block failures, traffic interval and user-visible delivery. A clean application result during a short test can coexist with weak correction margin.
A practical evidence plan begins with a block diagram and a counter dictionary. For every field in a device interface, write the producing stage, unit, interval, reset behavior, eligible traffic and treatment of discarded blocks. “Pre-FEC BER” is still incomplete if the interface does not say whether it is a direct comparison, a re-encoded estimate or a soft-decision-derived estimate.
The observation interval matters twice. It controls statistical exposure and it controls whether bursts disappear into an average. Preserve cumulative counters and shorter windows when both are available. If a counter resets during a test, split the record rather than subtracting across the reset. If it saturates, report a lower bound and the saturation event.
Code transitions need a boundary record. A link can change modulation and coding scheme as conditions vary, so one long average may combine several denominators, code rates and correction capabilities. Segment by mode before comparing input and residual error evidence. A low post-decoder rate accumulated mainly during a robust mode should not be assigned to a faster mode that occupied only a short interval.
Validation should include patterns that stress different mechanisms: dispersed errors, bursts, deep fades and short clean periods. The goal is not to prove that one number predicts every outcome. It is to learn where the relationship between input evidence and decoder output changes. Reserve some trials for confirmation after thresholds or alert rules are chosen.
The reporting sentence should therefore contain both stages: under code mode M and interval T, the decoder-input method reported one condition, the decoder output reported another, and a stated number of blocks were erased or failed. That sentence remains useful even when a later decoder version changes the relationship.
eduKateSG · Wireless Communication
Find your next learning step
Keep the decoder input, decoder output, coded-bit denominator, information-bit denominator, block decisions, erasures and measurement interval distinct.
ROUTE 1 · CHAPTERS 1–6
Locate the measurement stage
Define coded and information bits, decoder input and output, BER and correction outcomes.
ROUTE 2 · CHAPTERS 7–12
Protect the decoder evidence
Handle block failures, interleaving, soft information, erasures, thresholds and floors.
ROUTE 3 · CHAPTERS 13–18
Change the link context
Test code rate, burst structure, modulation, windows, uncertainty and end-to-end meaning.
ROUTE 4 · CHAPTERS 19–22
Audit and continue
Repair metric mixing, preserve counters, compare systems and use standards.
Full chapter contents · Wireless Communication subject guide
Chapter contents
Locate the measurement stage · Chapters 1–6
2. Distinguish coded bits from information bits
3. Define BER as a ratio with a named population
4. Work the two-stage example completely
5. Keep correction success separate from low input error rate
Protect the decoder evidence · Chapters 7–12
7. Separate uncorrectable blocks from residual bit errors
8. Track erasures and discarded outputs
9. Understand why interleaving changes the pattern
10. Preserve soft-decision information
Change the link context · Chapters 13–18
13. Change the code rate without losing denominators
14. Separate modulation decisions from decoder evidence
15. Preserve burst timing and observation windows
16. Propagate counter and estimator uncertainty
Audit and continue · Chapters 19–22
19. Repair pre and post comparisons
20. Build a decoder evidence ledger
Place the modulation decision, FEC decoder input, corrected output and packet integrity check in sequence. A metric without a stage label cannot be interpreted reliably.
Start with a claim ledger. Write the reported quantity, numerator, denominator, observational unit, time window and transformation rule in separate fields. Mark every value as observed, stipulated, estimated or assumed. This prevents a familiar label from silently carrying a different measurement basis into the calculation. Keep the raw record beside each derived value so another reader can reproduce the step and locate any disagreement.
A fictional receiver counts 50 disagreements among 10,000 coded bits before decoding and one disagreement among 8,000 information bits afterward. These are two rates over related but different populations.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to move the counter from hard decisions to soft-decision estimates and list the new method information required. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 2 OF 22 · Locate the measurement stage
2. Distinguish coded bits from information bits
Forward error correction adds redundancy. The decoder-input denominator can therefore exceed the information-bit denominator even when both cover the same codewords. Record code rate and puncturing or shortening rules.
Draw the mechanism before interpreting the number. Show where material, information or probability enters, what transformation occurs, and where a loss or bias can arise. Then ask which observation would distinguish two plausible explanations. A mechanism diagram is useful only when every arrow has a stated condition and an evidence route.
A rate-0.8 teaching code maps 800 information bits to 1,000 coded bits. Ten input errors give 1% pre-decoder BER; one residual information error gives 0.125% post-decoder BER.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to change the code rate to one half while preserving information length and input error count. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 3 OF 22 · Locate the measurement stage
3. Define BER as a ratio with a named population
BER is an error count divided by eligible bit trials under a stated comparison rule. The label alone does not identify stage, traffic, interval or whether the value is measured or estimated.
Use two checks that fail differently. Reconstruct an input from outputs, calculate a limiting case, or solve the same example from the original definitions. Agreement matters most when the checks do not simply repeat the same assumption in different notation. Preserve the first result in the audit trail if a later check changes it.
The statement BER=10^-4 becomes useful only after adding 100 errors among 1,000,000 decoder-input coded bits over a ten-minute interval.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to keep the same numerical rate but move it to decoder output and explain why the operational meaning changes. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 4 OF 22 · Locate the measurement stage
4. Work the two-stage example completely
Calculate each rate from its own count and denominator, then show the decoder outcome separately. Do not infer a correction count by subtracting unlike numerators unless bit identities and mappings are available.
Keep the comparison fair. Hold the population, interval, boundary, protocol and unit constant before treating a difference as evidence of change. If one of those conditions differs, report the difference as a changed context and either standardise it transparently or narrow the claim.
Forty of 1,000 coded bits are wrong before decoding. Two of 800 information bits are wrong afterward. The rates are 4% and 0.25%; saying thirty-eight bits were corrected is not justified because the streams are encoded differently.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to supply a mapping for a small systematic code and trace individual positions instead of subtracting counts. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 5 OF 22 · Locate the measurement stage
5. Keep correction success separate from low input error rate
A decoder can produce a correct block despite several input errors within its capability. Conversely, a structured pattern can cause a failure at a lower raw count. The code and pattern matter.
Separate a measurement from the decision built on it. A value can be calculated correctly while remaining too uncertain, too local or too method-dependent for the intended action. Report the numerical result, the conditions that make it interpretable and the next observation needed for the real decision.
Two codewords each contain six wrong coded bits. The first pattern is corrected; the second becomes an uncorrectable block. Equal pre-decoder counts do not force equal post-decoder outcomes.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to rearrange one pattern across interleaved codewords and observe whether the decoder boundary changes the result. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 6 OF 22 · Locate the measurement stage
6. Use known truth only when it is really known
Direct BER measurement requires a reference sequence aligned with the received decisions. In-service systems may estimate quality through re-encoding, parity evidence or other performance monitors. Label the estimator.
Treat missing and excluded observations as data. Record why they are absent, whether absence is related to the process being studied, and which denominator they leave. A clean table produced by silently dropping difficult cases is less trustworthy than an incomplete table whose limits are explicit.
A laboratory pattern generator supplies exact transmitted bits, while a live device exposes a vendor pre-FEC estimate. Both display 2×10^-3, but only one comes from direct bit comparison in this example.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to validate the estimator against a known pattern across several signal conditions. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 7 OF 22 · Protect the decoder evidence
7. Separate uncorrectable blocks from residual bit errors
A decoder can flag a codeword as uncorrectable without reporting how many output bits are wrong. A block-error rate and a post-decoder BER therefore need different numerators and denominators.
Preserve sequence and identity. Two datasets with the same totals can imply different mechanisms when events occur in a different order or belong to different units. Keep timestamps, sample identifiers, request or cohort boundaries, and processing stages until the reader question no longer depends on them.
Three of 10,000 codewords fail integrity checks. That gives a block failure rate of 0.03%, but the residual bit count inside those blocks remains unknown.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to bound possible residual bits using only block length and failed-block count. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 8 OF 22 · Protect the decoder evidence
8. Track erasures and discarded outputs
Some receivers discard failed blocks or mark erasures. A BER calculated only on delivered blocks can look excellent while losses rise. Preserve attempted, decoded, discarded and delivered counts.
Test a deliberately changed case. Change one assumption while holding the rest fixed, calculate again, and explain why the conclusion moves or stays stable. Transfer is demonstrated when the reasoning survives a new context, not when the original numbers are merely substituted into the same line of arithmetic.
Of 1,000 blocks, twenty are discarded and the remaining 980 have zero observed residual errors. Reporting only zero post-decoder BER hides the 2% erasure outcome.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to include erased blocks in an application-delivery ledger without inventing their unknown bit errors. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 9 OF 22 · Protect the decoder evidence
9. Understand why interleaving changes the pattern
Interleaving spreads adjacent channel errors across several codewords. It does not remove errors; it changes which decoder constraint sees them. Compare before and after deinterleaving explicitly.
State the boundary of inference in the answer itself. Name the system, population, representation or interval to which the result applies, then name one tempting stronger claim that the evidence cannot support. This turns a caveat into part of the reasoning rather than an afterthought.
A burst corrupts twelve adjacent coded bits. Without interleaving they fall in one codeword; with a stipulated mapping they become two errors in each of six codewords.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to hold the burst length fixed and shorten the interleaver depth to find when concentration returns. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 10 OF 22 · Protect the decoder evidence
10. Preserve soft-decision information
Soft decoders use confidence values, not only hard zeros and ones. Two hard-decision patterns with the same apparent pre-decoder BER can produce different outcomes when reliabilities differ.
Use uncertainty as structure rather than decoration. Identify which input controls the conclusion, vary it over a defensible range, and show whether the decision changes. A long list of generic caveats is weaker than one sensitivity calculation tied to the actual mechanism.
Both cases have four hard errors. In one, the wrong decisions have weak confidence and are corrected; in the other, two wrong decisions have strong misleading confidence and the decoder fails.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to remove the soft information and compare the hard-decision decoder outcome. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 11 OF 22 · Protect the decoder evidence
11. Treat thresholds as code-specific evidence
A pre-FEC threshold can be a qualification or monitoring limit associated with a code, implementation and target outcome. It is not a universal boundary that transfers to every decoder.
Finish with an evidence package. Include the raw observations, definitions, exclusions, processing version, calculations, validation result and decision rule. A future reviewer should be able to reproduce the result and understand what would require the conclusion to be revised.
Device A specifies a threshold for code mode X. Applying that number to device B using mode Y produces a comparison without a shared validation basis.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to switch code mode on the same device and confirm which threshold metadata must change. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 12 OF 22 · Protect the decoder evidence
12. Interpret a reported zero through exposure
Zero observed residual errors provides an upper bound shaped by the number of bits tested and the confidence method. It does not establish a physical probability of exactly zero.
Start with a claim ledger. Write the reported quantity, numerator, denominator, observational unit, time window and transformation rule in separate fields. Mark every value as observed, stipulated, estimated or assumed. This prevents a familiar label from silently carrying a different measurement basis into the calculation. Keep the raw record beside each derived value so another reader can reproduce the step and locate any disagreement.
A short test observes zero errors in 10,000 bits; a longer test observes zero in 10^9 bits. Both display zero, but the second constrains rare errors much more strongly.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to use a stated confidence rule to compare upper bounds rather than the displayed zeros. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 13 OF 22 · Change the link context
13. Change the code rate without losing denominators
A lower code rate adds more redundancy for the same information payload, changing coded-bit exposure and often correction capability. Compare information throughput, coded bits and error outcomes separately.
Draw the mechanism before interpreting the number. Show where material, information or probability enters, what transformation occurs, and where a loss or bias can arise. Then ask which observation would distinguish two plausible explanations. A mechanism diagram is useful only when every arrow has a stated condition and an evidence route.
Two modes carry 1,000 information bits. Mode A sends 1,250 coded bits and Mode B sends 2,000. Fifty input errors correspond to 4% and 2.5% pre-decoder BER respectively.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to hold channel error probability rather than error count constant and recalculate expected input errors. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 14 OF 22 · Change the link context
14. Separate modulation decisions from decoder evidence
Modulation and demodulation determine symbol or bit likelihoods delivered to the code. Changing modulation, mapping or signal conditions can change pre-decoder evidence before the FEC algorithm itself changes.
Use two checks that fail differently. Reconstruct an input from outputs, calculate a limiting case, or solve the same example from the original definitions. Agreement matters most when the checks do not simply repeat the same assumption in different notation. Preserve the first result in the audit trail if a later check changes it.
A receiver changes modulation while retaining the same FEC code. The new hard-decision BER cannot be attributed to the decoder because it is measured at its input.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to hold modulation fixed and change only the decoder algorithm to isolate an output effect. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 15 OF 22 · Change the link context
15. Preserve burst timing and observation windows
Average BER can hide short periods that overwhelm decoder or interleaver memory. Keep instantaneous, interval-average, minimum and maximum statistics with interval definitions when the device provides them.
Keep the comparison fair. Hold the population, interval, boundary, protocol and unit constant before treating a difference as evidence of change. If one of those conditions differs, report the difference as a changed context and either standardise it transparently or narrow the claim.
Nine minutes have near-zero input errors and one second has a severe burst. A ten-minute average can look moderate while the burst produces all failed blocks.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to recalculate in one-second windows and identify the operational event hidden by the long average. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 16 OF 22 · Change the link context
16. Propagate counter and estimator uncertainty
Finite samples, alignment errors, counter saturation and estimator bias can affect reported rates. A precise decimal display does not remove those limits.
Separate a measurement from the decision built on it. A value can be calculated correctly while remaining too uncertain, too local or too method-dependent for the intended action. Report the numerical result, the conditions that make it interpretable and the next observation needed for the real decision.
A counter reports 998 to 1,002 input errors depending on alignment across 10^7 bits. Report the resulting interval rather than a single unjustified sixth decimal place.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to double the observation length while keeping alignment uncertainty fixed and see which error source dominates. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 17 OF 22 · Change the link context
17. Connect residual errors to packets carefully
Post-decoder bit errors may cluster or trigger integrity checks, retransmissions and discards. The earlier packet-error lesson shows that BER alone does not determine packet-error rate without boundaries and error distribution.
Treat missing and excluded observations as data. Record why they are absent, whether absence is related to the process being studied, and which denominator they leave. A clean table produced by silently dropping difficult cases is less trustworthy than an incomplete table whose limits are explicit.
Two links have the same post-decoder BER. One places residual errors in separate packets; the other clusters them in one packet. Their damaged-packet counts differ.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to map a specified residual trace into fixed packet boundaries and count affected packets. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 18 OF 22 · Change the link context
18. Keep end-to-end reliability beyond the decoder
A clean FEC output does not rule out loss, duplication, reordering, congestion or application failure elsewhere. The decoder is one stage in the communication path.
Preserve sequence and identity. Two datasets with the same totals can imply different mechanisms when events occur in a different order or belong to different units. Keep timestamps, sample identifiers, request or cohort boundaries, and processing stages until the reader question no longer depends on them.
A link reports no residual bit errors but loses packets during a queue overflow. Treating post-FEC BER as delivery success would miss the failure mechanism.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to hold the radio outcome fixed and introduce a transport retry timeout downstream. State what changes, what remains comparable and what the new result still cannot establish.
Before comparing two displayed BER values, check stage, denominator, code mode, bit population, interval, estimator and treatment of failed blocks. If any differ, narrow the comparison.
Test a deliberately changed case. Change one assumption while holding the rest fixed, calculate again, and explain why the conclusion moves or stays stable. Transfer is demonstrated when the reasoning survives a new context, not when the original numbers are merely substituted into the same line of arithmetic.
A dashboard compares Device A pre-FEC average over 15 minutes with Device B post-FEC instantaneous value. The ranking is meaningless until the measurements are aligned.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to create a common test profile and state the fields that make the comparison reproducible. State what changes, what remains comparable and what the new result still cannot establish.
Store device, channel, modulation, code mode, code rate, interleaver, counter stage, bit denominator, errors, failed blocks, erasures, interval and method. Preserve raw counters before deriving rates.
State the boundary of inference in the answer itself. Name the system, population, representation or interval to which the result applies, then name one tempting stronger claim that the evidence cannot support. This turns a caveat into part of the reasoning rather than an afterthought.
A reviewer traces 400 input errors among 2×10^6 coded bits, two failed codewords, zero observed residual errors among delivered bits and one discarded packet.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to change firmware and repeat the test while retaining the earlier method version for comparison. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 21 OF 22 · Audit and continue
21. Choose the metric that matches the decision
Pre-decoder evidence is useful for link margin and early warning; post-decoder evidence describes residual correctness at a defined point; failed blocks and delivery measures describe other consequences. Use a small set with explicit roles.
Use uncertainty as structure rather than decoration. Identify which input controls the conclusion, vary it over a defensible range, and show whether the decision changes. A long list of generic caveats is weaker than one sensitivity calculation tied to the actual mechanism.
A maintenance alert uses rising pre-FEC BER while service reporting uses failed-block and application-delivery outcomes. Neither counter is forced to stand in for the other.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to design an alert that requires both margin deterioration and a confirmed service effect. State what changes, what remains comparable and what the new result still cannot establish.
CHAPTER 22 OF 22 · Audit and continue
22. Continue with standards and adjacent evidence
The OpenConfig interface model exposes separately named pre-FEC and post-FEC BER statistics with defined intervals, illustrating why stage labels matter. ETSI TR 101 290 describes measurement guidance for digital video broadcasting systems and BER-related decoder evidence. The existing BER versus packet-error guide develops the separate question of mapping residual bit patterns into packet outcomes.
Finish with an evidence package. Include the raw observations, definitions, exclusions, processing version, calculations, validation result and decision rule. A future reviewer should be able to reproduce the result and understand what would require the conclusion to be revised.
The transferable habit is to label the stream before calculating the rate. Decoder input, decoder output and delivered application data are connected, but they are not interchangeable evidence.
Before moving on, identify the observation that would most directly challenge the current explanation. If no feasible observation exists, narrow the claim instead of hiding the ambiguity.
A changed-context transfer check is to apply the ledger to a link with one erased codeword, zero residual errors in delivered blocks and a rising pre-decoder estimate, then state the strongest defensible conclusion. State what changes, what remains comparable and what the new result still cannot establish.
Contents · Previous chapter · Return to Wireless Communication