Difference between revisions of "Aufgaben:Exercise 2.1: Coding with and without Loss"
m (Text replacement - "code symbol sequence" to "encoded sequence") |
|||
(31 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
− | {{quiz-Header|Buchseite= | + | {{quiz-Header|Buchseite=Information_Theory/General_Description |
}} | }} | ||
− | [[File: | + | [[File:EN_Inf_A_2_1.png|right|frame|Keywords related to <br>the topic "Coding"]] |
− | + | Three types of coding methods are distinguished, namely: | |
− | + | *Line Coding ⇒ Chapter "Coded and Multilevel Transmission" in the book "[[Digital_Signal_Transmission]]", | |
− | + | *Channel Coding ⇒ book "[[Channel_Coding]]", | |
− | + | *Source Coding ⇒ Chapter "Source Coding - Data Compression" in the book "[[Information_Theory]]". | |
− | |||
− | + | All these basic coding methods have in common that the source signal $q(t)$ is represented by a encoded sequence $\langle c_\nu \rangle $. With a digital source (with or w/o memory) the source signal $q(t)$ can be described by the source symbol sequence $\langle q_\nu \rangle $. | |
− | + | At the receiver, the sink symbol sequence $\langle v_\nu \rangle $ or the sink signal $v(t)$ is obtained from the regenerated symbol sequence $\langle r_\nu \rangle $. This is called "decoding", sometimes also "signal reconstruction". | |
− | + | All the terms listed on the right belong to one of the three disciplines listed above, between which there is a certain affinity, but which are quite different in terms of objective and mathematical handling. | |
− | + | A further distinguishing feature in "coded transmission" is: | |
− | + | * One speaks of a "lossless coding procedure", if after decoding $\langle v_\nu \rangle = \langle q_\nu \rangle$ applies. <br>Otherwise, the coding procedure is called "lossy". | |
− | : | + | * The prerequisite for this classification is error-free transmission: $\langle r_\nu \rangle = \langle c_\nu \rangle$. |
− | === | + | |
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | Hints: | ||
+ | *The exercise belongs to the chapter [[Information_Theory/Allgemeine_Beschreibung|General Description of Source Coding]]. | ||
+ | *The following questions '''(3)''' to '''(6)''' refer to the keywords in the above graphic. | ||
+ | |||
+ | |||
+ | |||
+ | ===Questions=== | ||
<quiz display=simple> | <quiz display=simple> | ||
− | { | + | {In which coding procedures is redundancy added? |
|type="[]"} | |type="[]"} | ||
− | + | + | + Line coding methods, |
− | + | + | + Channel coding methods, |
− | - | + | - Source coding methods. |
− | { | + | {Which coding methods can be lossy? |
|type="[]"} | |type="[]"} | ||
− | - | + | - Line coding methods, |
− | - | + | - Channel coding methods, |
− | + | + | + Source coding methods. |
− | { | + | {How many of the terms given in the chart are counted as "Line Coding"? |
|type="{}"} | |type="{}"} | ||
− | $N_\text{LC}$ | + | $N_\text{LC} \ = \ $ { 2 } |
− | { | + | {How many of the terms in the graph are counted as "Channel Coding"? |
|type="{}"} | |type="{}"} | ||
− | $N_\text{ | + | $N_\text{ChC}\ = \ $ { 4 } |
− | { | + | {How many of the terms given in the graph are counted as "lossless Source Coding"? |
|type="{}"} | |type="{}"} | ||
− | $N_\text{ | + | $N_\text{SC (lossless)} \ = \ $ { 4 } |
− | { | + | {Which statements apply to the lossy source coding methods? |
|type="[]"} | |type="[]"} | ||
− | + AMR | + | + AMR and EFR are used in cellular mobile radio. |
− | - GIF, JPG | + | - GIF, JPG and MP3 are compression methods for pictures. |
− | + MP3 | + | + MP3 is used to compress audio files. |
Line 67: | Line 78: | ||
</quiz> | </quiz> | ||
− | === | + | ===Solution=== |
{{ML-Kopf}} | {{ML-Kopf}} | ||
− | + | '''(1)''' <u>Proposed solutions 1 and 2</u> are correct: | |
+ | * In line coding, redundancy is added to adapt the transmitted signal to the spectral characteristics of the channel. | ||
+ | *With channel coding, redundancy is also added specifically, in this case to be able to use it at the receiver for error detection and/or error correction. | ||
+ | *The aim of source coding is to reduce redundancy as much as possible in order to be able to store or transmit the information of the source as efficiently as possible. | ||
+ | |||
+ | |||
+ | |||
+ | '''(2)''' Correct <u>answer is 3</u>: | ||
+ | *In line and channel coding, lossy techniques would be counterproductive. | ||
+ | *In contrast, source coding for analog input signals (audio, video, etc.) is lossy per se. | ||
− | |||
− | |||
− | : | + | '''(3)''' The following are line coding methods: |
+ | *the 4B3T codes (there are several variants of this, all of which work in blocks), | ||
+ | *the AMI code (symbol-wise ⇒ at each coding step, a binary character is read in and a ternary character is output). | ||
− | |||
− | + | Consequently, $N_\text{LC}\hspace{0.15cm}\underline{ = 2}$. | |
− | |||
− | |||
− | + | '''(4)''' In the book "Channel Coding" are dealt with: | |
+ | *the Hamming codes, | ||
+ | *the Reed-Solomon codes, | ||
+ | *the convolutional codes, | ||
+ | *the turbo codes. | ||
− | |||
− | + | The correct result is accordingly $N_\text{ChC}\hspace{0.15cm}\underline{ = 4}$. | |
− | |||
− | |||
− | + | '''(5)''' In lossless source coding, the receiver can completely reconstruct the message of the source if no transmission error has occurred. | |
− | + | Lossless source coding schemes include | |
+ | *the Huffman code, | ||
+ | *the different variants of the Lempel-Ziv algorithm, | ||
+ | *the run-length code, | ||
+ | *the well-known compression programme "Winzip". | ||
− | |||
− | + | All these procedures can only be used with digital input ⇒ $N_\text{SC (lossless)}\hspace{0.15cm}\underline{ = 4}$. | |
− | |||
− | |||
− | + | '''(6)''' <u>Statements 1 and 3</u> are correct: | |
+ | * Only GIF and JPG are applied to pictures. MP3 has been the most widely used audio compression program for years. | ||
+ | *The AMR codec and the EFR codec are used for GSM and UMTS in Mobile Communication. | ||
{{ML-Fuß}} | {{ML-Fuß}} | ||
Line 113: | Line 134: | ||
− | [[Category: | + | [[Category:Information Theory: Exercises|^2.1 General Description^]] |
Latest revision as of 13:07, 16 August 2021
Three types of coding methods are distinguished, namely:
- Line Coding ⇒ Chapter "Coded and Multilevel Transmission" in the book "Digital Signal Transmission",
- Channel Coding ⇒ book "Channel Coding",
- Source Coding ⇒ Chapter "Source Coding - Data Compression" in the book "Information Theory".
All these basic coding methods have in common that the source signal $q(t)$ is represented by a encoded sequence $\langle c_\nu \rangle $. With a digital source (with or w/o memory) the source signal $q(t)$ can be described by the source symbol sequence $\langle q_\nu \rangle $.
At the receiver, the sink symbol sequence $\langle v_\nu \rangle $ or the sink signal $v(t)$ is obtained from the regenerated symbol sequence $\langle r_\nu \rangle $. This is called "decoding", sometimes also "signal reconstruction".
All the terms listed on the right belong to one of the three disciplines listed above, between which there is a certain affinity, but which are quite different in terms of objective and mathematical handling.
A further distinguishing feature in "coded transmission" is:
- One speaks of a "lossless coding procedure", if after decoding $\langle v_\nu \rangle = \langle q_\nu \rangle$ applies.
Otherwise, the coding procedure is called "lossy".
- The prerequisite for this classification is error-free transmission: $\langle r_\nu \rangle = \langle c_\nu \rangle$.
Hints:
- The exercise belongs to the chapter General Description of Source Coding.
- The following questions (3) to (6) refer to the keywords in the above graphic.
Questions
Solution
- In line coding, redundancy is added to adapt the transmitted signal to the spectral characteristics of the channel.
- With channel coding, redundancy is also added specifically, in this case to be able to use it at the receiver for error detection and/or error correction.
- The aim of source coding is to reduce redundancy as much as possible in order to be able to store or transmit the information of the source as efficiently as possible.
(2) Correct answer is 3:
- In line and channel coding, lossy techniques would be counterproductive.
- In contrast, source coding for analog input signals (audio, video, etc.) is lossy per se.
(3) The following are line coding methods:
- the 4B3T codes (there are several variants of this, all of which work in blocks),
- the AMI code (symbol-wise ⇒ at each coding step, a binary character is read in and a ternary character is output).
Consequently, $N_\text{LC}\hspace{0.15cm}\underline{ = 2}$.
(4) In the book "Channel Coding" are dealt with:
- the Hamming codes,
- the Reed-Solomon codes,
- the convolutional codes,
- the turbo codes.
The correct result is accordingly $N_\text{ChC}\hspace{0.15cm}\underline{ = 4}$.
(5) In lossless source coding, the receiver can completely reconstruct the message of the source if no transmission error has occurred.
Lossless source coding schemes include
- the Huffman code,
- the different variants of the Lempel-Ziv algorithm,
- the run-length code,
- the well-known compression programme "Winzip".
All these procedures can only be used with digital input ⇒ $N_\text{SC (lossless)}\hspace{0.15cm}\underline{ = 4}$.
(6) Statements 1 and 3 are correct:
- Only GIF and JPG are applied to pictures. MP3 has been the most widely used audio compression program for years.
- The AMR codec and the EFR codec are used for GSM and UMTS in Mobile Communication.