Shannons :calculating simple uncertainty

  • Thread starter Thread starter Calmstorm
  • Start date Start date
  • Tags Tags
    Uncertainty
AI Thread Summary
To measure the uncertainty at the transmitter for a two-tone image transmitted line-by-line, the formula H(X) = - W{ Pilog(Pi) } - B{Qj log (Qj)} can be used, where W represents the number of white pixels and B the number of black pixels. The probabilities Pi and Qj correspond to the likelihood of encountering a white or black pixel, respectively. For a square NxN image, the total number of pixels is N^2, which informs the length of the transmitted sequence. Understanding these calculations helps in assessing the information content and efficiency of the transmission. Accurate measurement of uncertainty is crucial for optimizing data transmission in digital communications.
Calmstorm
Messages
4
Reaction score
0
If I were to use a two-tone image e.g. fax, and were to transmit it line-by-line, where the the individual pixels which make up the line were independent of each other, how would I measure the uncertainty at the transmitter? Also what would the length of the the transmited sequence be if the image was a square NxN image?

I think the uncertainty is H(X)= - W{ Pilog(Pi) } -B{Qj log (Qj)}
where:
W=number of white pixels in the sequence
Pi=probability of a white pixel.
B=number of black pixels in seqence
Qj=probability of a black pixel.

Any ideas would be very helpful...thank you in advance!
 
Physics news on Phys.org
Do not cross-post.
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
2
Views
3K
Replies
1
Views
3K
Replies
4
Views
1K
Replies
18
Views
3K
Replies
6
Views
30K
Replies
7
Views
2K
Replies
14
Views
6K
Back
Top