Search results

Create the page "Channel Coding/" on this wiki! See also the search results found.

Exercise 4.9: Higher-Level Modulation
[[File:EN_Inf_A_4_9.png|right|frame|Some channel capacity curves]] The graph shows AWGN channel capacity curves over the  $10 \cdot \lg (E_{\rm S}/{N_0})$:

8 KB (1,199 words) - 16:28, 4 November 2021
Exercise 1.3: Channel Models BSC - BEC - BSEC - AWGN
{{quiz-Header|Buchseite=Channel Coding/Channel Models and Decision Structures [[File:EN_KC_A_1_3.png|right|frame|Channel models  "BSEC"  and  "AWGN"]]

8 KB (1,103 words) - 17:57, 23 January 2023
Exercise 2.14: Petersen Algorithm?
...cording_to_Reed-Solomon_Coding|"Error Correction According to Reed-Solomon Coding"]]  the decoding of Reed–Solomon codes with the  "Petersen Already since the invention of Reed–Solomon coding in 1960,  many scientists and engineers were engaged in the developmen

4 KB (536 words) - 01:41, 13 November 2022
Exercise 4.1Z: Log Likelihood Ratio at the BEC Model
[[File:P_ID2978__KC_Z_4_1.png|right|frame|BEC channel model]] ...sure_Channel_.E2.80.93_BEC| $\text{BEC channel }$]]  ("binary erasure channel")  with

6 KB (848 words) - 17:18, 28 November 2022
Exercise 4.1: Log Likelihood Ratio
[[File:EN_KC_A_4_1.png|right|frame|Considered channel models]] ...d ratio"  $\rm (LLR)$  we start from the  "binary symmetric channel"  $\rm (BSC)$  as in the  [[Channel_Coding/Soft-in_Soft-Out_

11 KB (1,668 words) - 17:27, 23 January 2023
Exercise 1.17: About the Channel Coding Theorem
[[File:EN_KC_A_1_17.png|right|frame|Channel capacity  $($green$)$  and code rates  $($red dots$)$  ...its_of_Channel_Coding#Channel_coding_theorem_and_channel_capacity|"channel coding theorem"]]:

5 KB (818 words) - 16:48, 28 September 2022
Examples of Communication Systems/Entire GSM Transmission System
|Vorherige Seite=Speech Coding #Speech signals are compressed by speech coding by factor  $8$   ⇒   from  $104 \ \rm kbit/s$&nbsp

16 KB (2,468 words) - 16:10, 20 February 2023
Exercise 3.8: General Packet Radio Service
...combined  $($"multislot capability"$)$.  In addition,  four coding schemes with different data rates are defined as  $\text{CS - 1}$&nbsp *For convolutional coding,  a code of rate  $1/2$  is used,  which doubles the&

7 KB (1,064 words) - 19:30, 28 January 2023
Exercise 4.Ten: QPSK Channel Capacity
Given are the AWGN channel capacity limit curves for the modulation methods ...; can be asymptotically achieved with BPSK (or QPSK) with suitable channel coding.

8 KB (1,346 words) - 11:29, 10 November 2021
Exercise 2.16: Bounded Distance Decoding: Decision Regions
[[File:EN_KC_A_2_16.png|right|frame|Two coding space schemes]] {Which coding space scheme applies to the Hamming codes?

7 KB (1,128 words) - 17:31, 23 January 2023
Exercise 2.11Z: Erasure Channel for Symbols
[[File:P_ID2543__KC_Z_2_11.png|right|frame|Erasure channel for symbols:  "m–BEC"]] ..."Binary Erasure Channel"]]  $\rm (BEC)$ describes a bit-level erasure channel:

6 KB (824 words) - 15:12, 21 October 2022
Exercise 2.6: Modified MS43 Code
...  This is a 4B3T code with four code tables,  which are used for coding according to the running digital sum  (after  $l$ blocks): ...r  [[Digital_Signal_Transmission/Block_Coding_with_4B3T_Codes|"Block Coding with 4B3T Codes"]].

7 KB (1,113 words) - 17:56, 24 October 2022
Exercise 2.5: DSL Error Protection
- DSL/DMT uses convolutional coding. + DSL/DMT uses Reed-Solomon coding.

5 KB (751 words) - 19:32, 25 March 2023
Exercise 1.4Z: Modified MS43 Code
...e with the four code tables shown in the graphic,  which are used for coding according to the so-called "running digital sum"  $($after  $l$&n ...r  [[Digital_Signal_Transmission/Block_Coding_with_4B3T_Codes|"Block Coding with 4B3T Codes"]]  of the book  "Digital signal transmission".

7 KB (1,049 words) - 17:55, 24 October 2022
Exercise 1.13Z: Binary Erasure Channel Decoding again
..._Decision_Structures#Binary_Erasure_Channel_. E2.80.93_BEC|"Binary Erasure Channel"]]  $\rm (BEC)$. [[Category:Channel Coding: Exercises|^1.5 Linear Block Code Decoding

4 KB (604 words) - 19:00, 1 November 2022
Exercise 4.08Z: Basics about Interleaving
Interleaving is required,  for example,  for a channel with burst error characteristics in order to distribute the errors within t ...only such make sense – interleaving is essential also with the AWGN channel,  because then there are also always $($some$)$ input sequences, 

6 KB (876 words) - 14:53, 14 December 2022
Exercise 2.8: Code Comparison: Binary, AMI and 4B3T
...n pulse and for the total system frequency response  (of transmitter, channel and decoder,  without encoder)  a cosine rolloff characteristic w ...ignal_Transmission/Symbolwise_Coding_with_Pseudo-Ternary_Codes|"Symbolwise Coding with Pseudo-Ternary Codes"]].

5 KB (742 words) - 17:43, 25 May 2022
Examples of Communication Systems/Further Developments of the GSM
...bsp; $14.4 \ \rm kbit/s$  for data communication.  HSCSD enables channel bundling by combining multiple time slots,  as is also used in ISDN.&n ...advantageous for applications with uniform bandwidth,  since here the channel does not have to be shared with anyone. Examples include video and image tr

17 KB (2,679 words) - 16:14, 20 February 2023
Exercise 3.1Z: Convolution Codes of Rate 1/2
...[[Channel_Coding/Basics_of_Convolutional_Coding| "Basics of Convolutional Coding"]]. - $k$:     Number of information bits processed per coding step,

7 KB (1,006 words) - 19:26, 16 November 2022
Channel Coding/Error Probability and Application Areas
|Vorherige Seite=Error Correction According to Reed-Solomon Coding |Nächste Seite=Basics of Convolutional Coding

17 KB (2,621 words) - 15:51, 13 December 2022