diff --git a/experiment-descriptor.json b/experiment-descriptor.json index 85486cb..15344c0 100644 --- a/experiment-descriptor.json +++ b/experiment-descriptor.json @@ -40,7 +40,7 @@ { "target": "index.html", "source": "simulation/binary_erasure_channel.html", - "label": "Binary Channels", + "label": "Simulation", "unit-type": "task", "content-type": "simulation" }, diff --git a/experiment/aim.md b/experiment/aim.md index 89697a3..93914c3 100644 --- a/experiment/aim.md +++ b/experiment/aim.md @@ -1,3 +1 @@ -### Aim of the experiment - This experiment will enable the user to understand the above aspects of these channels. The user is expected to know basics of probability distributions (such as Bernoulli, Binomial, and Gaussian distributions) and the notion of conditional probability, to execute this experiment. The user should ideally read the theory part of this experiment first, before attempting the questions. \ No newline at end of file diff --git a/experiment/pretest.json b/experiment/pretest.json index 0384e6d..28544c9 100644 --- a/experiment/pretest.json +++ b/experiment/pretest.json @@ -46,7 +46,7 @@ "d": "$p_X(0)=0.3,\\hspace{0.2cm} p_X(1)=0.6$." }, "explanations": { - "a": "Wrong answer. This option is a valid Binomial distribution, not a Bernoulli distribution.", + "a": "Incorrect answer. This option is a valid Binomial distribution, not a Bernoulli distribution.", "b": "Incorrect answer. A Bernoulli random variable takes only two values.", "c": "Correct answer! A Bernoulli random variable takes two possible values (often represented as $0$ or $1$), and the probabilities should sum to $1$.", "d": "Incorrect answer! A Bernoulli random variable does take only two possible values (often represented as $0$ or $1$. However their probabilities should sum to $1$." diff --git a/experiment/procedure.md b/experiment/procedure.md index ce4dab8..0cfa290 100644 --- a/experiment/procedure.md +++ b/experiment/procedure.md @@ -1,5 +1,3 @@ -### Procedure - The experiment consists of three sub-experiments, through which the user will be systematically understanding the essential mathematical aspects of three important probabilistic channels, discussed in the theory part of this experiment. These channels are : 1. The Binary Erasure Channel, which erases each bit transmitted independently with probability $\epsilon$. The erasure symbol is denoted by $?$. @@ -8,7 +6,7 @@ The experiment consists of three sub-experiments, through which the user will be The detailed working of this experiment is as follows. -## Overview of the Experiment window +### Overview of the Experiment window
@@ -21,11 +19,11 @@ The experiment window consists of the following components:
4. **Observation box**: The observation box displays the feedback messages based on the user's input.
5. **Action box**: The action box contains the input elements and buttons to perform the task.
-## Experiment 1: Binary Input Discrete Memoryless Channels
+### Experiment 1: Binary Input Discrete Memoryless Channels
There are three tasks in this sub-experiment.
-### Task 1: Binary Erasure Channel
+#### Task 1: Binary Erasure Channel
1. **Select Output Vectors**: Select the possible output vectors ($\vec{y}$) of the Binary Erasure Channel $BEC(\epsilon)$ whose input vector $\vec{x}$ is given. After selection, the boxes will turn green and deselecting them will turn them to gray.
-### Task 3: Additive White Gaussian Noise Channel
+#### Task 3: Additive White Gaussian Noise Channel
1. **Enter probability values**: According to the statement about the AWGN channel displayed, enter the values in the input boxes provided in the expression that represents the probability density of the output.
A codeword needs to be sent through a Binary Symmetric Channel \( (BEC(\epsilon)) \) as shown below. Select the possible vectors that could be received through this channel.
+A codeword needs to be sent through a Binary Symmetric Channel \( (BEC(\epsilon)) \) as shown + below. Select the possible vectors that could be received through this channel.
\( {x} =\) [] →
@@ -126,122 +137,124 @@