Unformatted text preview: Hint: inputs b and c have the same transition probabilities. 4. P6.60: Slightly diferent ±rom what I had said I would put on the HW in class: In a binary erasure channel bits “disappear” without probability p (output state ’ e ’), else bits are received without error, i.e., P ( Y = 1 /X = 1)) = 1-p = P ( Y = /X = 0) and P ( Y = e/X = 0) = P ( Y = e/X = 1) = p . I± P ( X = 0) = α , determine the mutual in±ormation I ( X ; Y ) as a ±unction o± α , then the value o± α that maximizes I ( X ; Y ) and hence the channel capacity....
View Full Document
- Spring '09
- Variance, Probability theory, AWGN, complex AWGN channel