In the discussion above, it is assumed unrealistically that all messages are transmitted without error.
Shannon laid forth the idea that once information became digital, it could be transmitted without error.
The probability that a character is transmitted without error is labeled p; hence, the probability of error is 1 − p. Consider what happens as zeros and ones, hereafter referred to as bits, emerge from the receiving end of the channel.
The probability that a character is transmitted without error is labeled p; hence, the probability of error is 1 − p. The binary symmetric channelThis type of channel transmits only two distinct characters, generally interpreted as 0 and 1, hence the designation binary.
These contain internal tricks that allow the receiver to determine whether what has been received is accurate and, ideally, to reconstruct the correct version if it is not.Such codes go back to 1948, the year when Claude Shannon, universally regarded as the father of coding theory, published a paper which showed the maximum theoretical rate at which information can be transmitted without error.
We assume that the data contained in the headers are transmitted without error.
Usually, throughput is defined as the number of information bits that are transmitted without error per unit-time.
We use the throughput formula defined in [8], as the net number of information bits that are transmitted without error per unit time.
In particular, we have assumed that each packet has a delay threshold, transmission channels undergo Rayleigh fading, SUs posses perfect CSIs and ACKs are transmitted without error and delay.
Since we assume that the side information is transmitted without errors, the BER of QPSK-modulated signal over the AWGN channel is given by.
In an error-free communication channel, the message is transmitted without any error to the channel output.
