Noisy-channel Coding Theorem - Channel Coding Theorem For Non-stationary Memoryless Channels

Channel Coding Theorem For Non-stationary Memoryless Channels

We assume that the channel is memoryless, but its transition probabilities change with time, in a fashion known at the transmitter as well as the receiver.

Then the channel capacity is given by

C=\lim \inf \max_{p^(X_1),p^(X_2),...}\frac{1}{n}\sum_{i=1}^nI(X_i;Y_i).

The maximum is attained at the capacity achieving distributions for each respective channel. That is, C=\lim \inf \frac{1}{n}\sum_{i=1}^n C_i where is the capacity of the ith channel.

Read more about this topic:  Noisy-channel Coding Theorem

Famous quotes containing the words channel, theorem and/or channels:

    “This is what the Church is said to want, not party men, but sensible, temperate, sober, well-judging persons, to guide it through the channel of no-meaning, between the Scylla and Charybdis of Aye and No.”
    —Cardinal John Henry Newman (1801–1890)

    “To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
    —Albert Camus (1913–1960)

    “Television is becoming a collage—there are so many channels that you move through them making a collage yourself. In that sense, everyone sees something a bit different.”
    —David Hockney (b. 1937)