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)

    “It is worth the while to detect new faculties in man,—he is so much the more divine; and anything that fairly excites our admiration expands us. The Indian, who can find his way so wonderfully in the woods, possesses an intelligence which the white man does not,—and it increases my own capacity, as well as faith, to observe it. I rejoice to find that intelligence flows in other channels than I knew. It redeems for me portions of what seemed brutish before.”
    —Henry David Thoreau (1817–1862)