Слайд 3Communication system
Noise
Noise refers to the unwanted signals that tend to disturb the
![Communication system Noise Noise refers to the unwanted signals that tend to](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-2.jpg)
transmission and processing of message signals in a communication system. The source generating the noise may be located inside or outside the system.
Transmitter
A transmitter processes the incoming message signal so as to make it suitable for transmission through a channel and subsequent reception
Receiver
A receiver extracts the desired message signals from the received signals at the channel output.
Слайд 5Project Plan
Groups: 3 students
7 weeks – 6 parts & defense (with report)
![Project Plan Groups: 3 students 7 weeks – 6 parts & defense (with report)](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-4.jpg)
Слайд 7Part 1
Input: “Text.txt” file (English text).
Goal: C++ (or another) program finds all
![Part 1 Input: “Text.txt” file (English text). Goal: C++ (or another) program](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-6.jpg)
symbols (not only letters) in this text and computes their probabilities.
Outpit: list of all unique symbols from the text with their probabilities.
Example:
A – 0,014
B – 0,012
…
Слайд 8Part 2
Input: “Text.txt” file and the result from Part 1.
Goal: Encode the
![Part 2 Input: “Text.txt” file and the result from Part 1. Goal:](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-7.jpg)
text from the “Text.txt” file using Shannon-Fano or Huffman algorithm with probabilities from Part 1.
Output: a sequence of binary digits.
Example:
101101011…
Слайд 9Part 3
Input: a sequence of binary digits from Part 2.
Goal: Decode back
![Part 3 Input: a sequence of binary digits from Part 2. Goal:](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-8.jpg)
into text the result binary sequence after Part2 (Shannon-Fano or Huffman code).
Output: a text identical to an initial text from “Text.txt” file.
Слайд 10Part 4
Input: a sequence of binary digits from Part 2.
Goal: Encode the
![Part 4 Input: a sequence of binary digits from Part 2. Goal:](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-9.jpg)
result binary sequence after Part2 (Shannon-Fano or Huffman code) with Hamming code.
Output: a sequence of binary digits ready for error-correction.
Слайд 11Part 5
Input: a sequence of binary digits from Part 4.
Goal: Add errors
![Part 5 Input: a sequence of binary digits from Part 4. Goal:](/_ipx/f_webp&q_80&fit_contain&s_1440x1080/imagesDir/jpg/1052771/slide-10.jpg)
to the result binary sequence after Part4 (Hamming code) with a certain interval.
Output: a sequence of binary digits after Hamming code with artificially created errors.