Difference between revisions of "Exercise 2.5: DSL Error Protection"
From LNTwww
m (Text replacement - "Category:Aufgaben zu Beispiele von Nachrichtensystemen" to "Category:Examples of Communication Systems: Exercises") |
|||
(4 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
− | {{quiz-Header|Buchseite= | + | {{quiz-Header|Buchseite=Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL |
}} | }} | ||
− | [[File: | + | [[File:EN_Bei_A_2_5.png|right|frame|$\rm ADSL$ error protection]] |
− | + | In order to decisively reduce the bit error rate of $\rm xDSL$ systems, various backup procedures have been proposed in the specifications to counteract the two most common causes of errors: | |
− | * | + | *Bit errors due to impulse and crosstalk interference on the (two-wire) line, |
− | * | + | *clipping of signal peaks due to lack of dynamic range of the transmit amplifiers (''clipping''). |
− | + | The diagram shows the error protection measures for $\rm ADSL/DMT$. These are implemented in two different paths: | |
− | * | + | *In the ''fast-path'' one relies on lower waiting times. |
− | * | + | *In the ''interleaved-Path'' a lower bit error rate is expected. |
− | + | The assignment of the bits to these paths is done by a multiplexer $\rm (MUX)$ with synchronization control. | |
Line 26: | Line 26: | ||
− | + | Hint: | |
− | * | + | *This exercise belongs to the chapter [[Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL|"Methods to Reduce the Bit Error Rate in DSL"]]. |
Line 34: | Line 34: | ||
− | === | + | ===Questions=== |
<quiz display=simple> | <quiz display=simple> | ||
− | { | + | {Which statements are true for the two paths? |
|type="[]"} | |type="[]"} | ||
− | + | + | + The ''interleaved-path'' has greater latency. |
− | - | + | - The ''fast-Path'' is more susceptible to AWGN noise. |
− | + | + | + The ''fast-Path'' is more susceptible to bundle errors. |
− | { | + | {What are the tasks of the ''cyclic redundancy check'' (CRC) and the ''Scrambler''? |
|type="[]"} | |type="[]"} | ||
− | + CRC | + | + CRC forms a parity-check value with $8$ bits from data blocks. |
− | - | + | - The redundancy of the CRC is very high. |
− | + | + | + The scrambler should avoid long zero sequences and one sequences. |
− | + CRC | + | + CRC and (de)scrambler are implemented with shift registers. |
− | { | + | {Which statements are true regarding forward error correction? |
|type="[]"} | |type="[]"} | ||
− | - DSL/DMT | + | - DSL/DMT uses convolutional coding. |
− | + DSL/DMT | + | + DSL/DMT uses Reed-Solomon coding. |
− | + | + | + The coding is done on byte level. |
− | - | + | - It is a symbol-wise coding. |
− | { | + | {What are the tasks performed by ''interleaving'' and ''de-interleaving''? |
|type="[]"} | |type="[]"} | ||
− | + | + | + Improved correction capabilities for "Reed-Solomon". |
− | + Interleaver | + | + Interleaver and de-interleaver work on byte level. |
− | - | + | - Interleaving adds redundancy. |
− | - Interleaving | + | - Interleaving is particularly suitable for real-time applications. |
− | { | + | {What are the tasks of the blocks ''"Tone Ordering"'' and ''"Gain Scaling"''? |
|type="[]"} | |type="[]"} | ||
− | + | + | + Measurement of the channel characteristics of each bin. |
− | + | + | + Allocation of the individual QAM signals to bins. |
− | + | + | + By ''tone ordering'' one can further reduce the bit error rate. |
Line 78: | Line 78: | ||
</quiz> | </quiz> | ||
− | === | + | ===Solution=== |
{{ML-Kopf}} | {{ML-Kopf}} | ||
− | '''(1)''' | + | '''(1)''' Correct are <u>statements 1 and 3</u>: |
− | * | + | *Due to the lack of an interleaver in the ''fast-path'', this path is less protected against bunching errors. |
− | * | + | *On the other hand, for AWGN noise, an interleaver does not reduce the bit error rate. |
− | * | + | *The disadvantage of an interleaver is the large waiting times (''latency''), since this distributes the input bits over a large time range in order to turn bundle errors into single errors after the de-interleaver, which is constructed in the same way, and which can then be removed by forward error correction (''FEC''). |
− | '''(2)''' | + | '''(2)''' Correct <u>statements 1, 3, and 4</u>: |
− | * | + | *Both the [[Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL#Cyclic_redundancy_check|"CRC"]] (''Cyclic Redundancy Check'') as well as [[Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL#Scrambler_and_en.E2.80.93scrambler|"Scrambler/De-scrambler"]] are implemented with shift registers of length $8$ and $23$ respectively. |
− | * | + | *The ''scrambler'' is redundancy-free (that is, it has exactly as many output bits as input bits) and is self-synchronizing after a short run-in time. |
− | * | + | *The redundancy of CRC is very low. It is not error correction in the true sense, but rather control of particularly important data, such as that for frame synchronization. |
− | '''(3)''' | + | '''(3)''' Correct <u> statements 2 and 3</u>: |
− | * | + | *In the $\rm LNTww$–book "[[Channel_Coding]]", there is a detailed chapter on the[[Channel_Coding/Definition_and_Properties_of_Reed-Solomon_Codes|" Reed-Solomon Codes"]]. |
− | * | + | *These are byte-level block codes, i.e., not symbol-by-symbol coding. |
− | '''(4)''' | + | '''(4)''' Correct are <u>statements 1 and 2</u> in contrast to the last two: |
− | * | + | *The [[Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL#Interleaving_and_en.E2.80.93interleaving|"Interleaving"]] is redundancy-free and results in large latency and delay, so it should be avoided for real-time applications. |
− | '''(5)''' | + | '''(5)''' <u>All of the above statements</u> are correct, as can be read in detail on the [[Examples_of_Communication_Systems/Methods_to_Reduce_the_Bit_Error_Rate_in_DSL#Gain_scaling_and_tone_ordering|"Gain scaling and tone ordering"]] page. |
{{ML-Fuß}} | {{ML-Fuß}} | ||
− | + | [[Category:Examples of Communication Systems: Exercises|^2.4 BER Lowering at DSL | |
− | [[Category:Examples of Communication Systems: Exercises|^2.4 | ||
^]] | ^]] |
Latest revision as of 18:32, 25 March 2023
In order to decisively reduce the bit error rate of $\rm xDSL$ systems, various backup procedures have been proposed in the specifications to counteract the two most common causes of errors:
- Bit errors due to impulse and crosstalk interference on the (two-wire) line,
- clipping of signal peaks due to lack of dynamic range of the transmit amplifiers (clipping).
The diagram shows the error protection measures for $\rm ADSL/DMT$. These are implemented in two different paths:
- In the fast-path one relies on lower waiting times.
- In the interleaved-Path a lower bit error rate is expected.
The assignment of the bits to these paths is done by a multiplexer $\rm (MUX)$ with synchronization control.
Hint:
- This exercise belongs to the chapter "Methods to Reduce the Bit Error Rate in DSL".
Questions
Solution
(1) Correct are statements 1 and 3:
- Due to the lack of an interleaver in the fast-path, this path is less protected against bunching errors.
- On the other hand, for AWGN noise, an interleaver does not reduce the bit error rate.
- The disadvantage of an interleaver is the large waiting times (latency), since this distributes the input bits over a large time range in order to turn bundle errors into single errors after the de-interleaver, which is constructed in the same way, and which can then be removed by forward error correction (FEC).
(2) Correct statements 1, 3, and 4:
- Both the "CRC" (Cyclic Redundancy Check) as well as "Scrambler/De-scrambler" are implemented with shift registers of length $8$ and $23$ respectively.
- The scrambler is redundancy-free (that is, it has exactly as many output bits as input bits) and is self-synchronizing after a short run-in time.
- The redundancy of CRC is very low. It is not error correction in the true sense, but rather control of particularly important data, such as that for frame synchronization.
(3) Correct statements 2 and 3:
- In the $\rm LNTww$–book "Channel Coding", there is a detailed chapter on the" Reed-Solomon Codes".
- These are byte-level block codes, i.e., not symbol-by-symbol coding.
(4) Correct are statements 1 and 2 in contrast to the last two:
- The "Interleaving" is redundancy-free and results in large latency and delay, so it should be avoided for real-time applications.
(5) All of the above statements are correct, as can be read in detail on the "Gain scaling and tone ordering" page.