Error Probability Analysis of Binary Asymmetric Channels
نویسندگان
چکیده
In his world-famous paper of 1948, Shannon defined channel capacity as the ultimate rate at which information can be transmitted over a communication channel with an error probability that will vanish if we allow the blocklength to get infinitely large. While this result is of tremendous theoretical importance, the reality of practical systems looks quite different: no communication system will tolerate an infinite delay caused by an extremely large blocklength. On the other hand, it is not necessary to have an error probability that is exactly zero either, a small, but finite value will suffice. Therefore, the question arises what can be done in a practical scheme. In particular, what is the maximal rate at which information can be transmitted over a communication channel for a given fixed maximum blocklength (i.e., a fixed maximum delay) if we allow a certain maximal probability of error? In this project, we have started to study these questions.
منابع مشابه
Probabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملPrice Transmission, Threshold Behavior and Asymmetric Adjustment in Iranian Poultry Market
The Iranian poultry sector has experienced many significant structural changes in recent years. Such changes may have influenced price dynamics and transmission of shocks through marketing channels especially on retail markets. This paper investigate price transmission, threshold behavior and asymmetric adjustment in poultry sector of Ardebil (AR), east Azerbaijan (EA) and west Azerbaijan (WA) ...
متن کاملError probability of binary NFSK and DPSK with postdetection combining over correlated Rician channels
For binary noncoherent orthogonal frequency-shift keying and binary differential phase-shift keying over slow nonselective Rician fading channels having arbitrarily correlated branches and unequal branch powers, a closed-form expression for the symbol-error probability in the case of postdetection equal-gain combining is obtained directly from the characteristic function of the decision variable.
متن کاملCapacity-Approaching Joint Source-Channel Coding for Asymmetric Channels with Low-Density Parity-Check Codes
By only sending the parity bits, joint source-channel coding can be natively achieved with lowdensity parity-check codes. However, the code ensemble design of optimal low-density parity-check codes for joint source-channel coding over asymmetric communication channels is difficult. To circumvent such a difficulty, source-channel adaptors is proposed in this paper. By using the source-channel ad...
متن کاملBinary Communication in Entangled Channels
We analyze optical binary communication assisted by entanglement and show that: i) ideal entangled channels have smaller error probability than ideal single-mode coherent channels if the photon number of the channel is larger than one; ii) realistic entangled channels with heterodyne receivers have smaller error probability than ideal single-mode coherent channels if the photon number of the ch...
متن کامل