Results 261 to 270 of about 1,703,653 (303)
Some of the next articles are maybe not open access.
On the decoder error probability of block codes
IEEE Transactions on Communications, 1992Summary: By using coding and combinational techniques, an explicit formula is derived which enumerates the complete weight distribution of decodable words of block codes using partially known weight distributions. Also an approximation formula for nonbinary block codes is obtained.
openaire +1 more source
An improvement on blocking probability for SDMA
2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471), 2002Space division multiple access (SDMA) is a technique that can be superimposed on traditional multiple access schemes such as frequency division multiple access (FDMA), time division multiple access (TDMA) or code division multiple access (CDMA) to increase the system capacity.
null Wen-Jye Huang, J.F. Doherty
openaire +1 more source
Block and decoded error probabilities of DPSK in AWGN
IEEE Transactions on Communications, 1994In this letter, we consider the error correlation in differential phase-shift keying (DPSK) demodulation in terms of its effects on the block and decoded error probabilities. The exact block and decoded error probabilities are derived and computed for additive white Gaussian noise (AWGN).
Qiang Wang 0013 +3 more
openaire +2 more sources
Blocking Probability Estimation for Trunk Reservation Networks
2007 IEEE International Conference on Communications, 2007In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called overflow priority classification approximation (OPCA), is considered as an alternative to the ...
Garvesh Raskutti +3 more
openaire +1 more source
Blocking Probabilities for a Class of Spiderweb Channel Graphs
IEEE Transactions on Communications, 1980The blocking probabilities for spiderweb channel graphs are well known to be difficult to compute. Recently, Takagi studied a class of spiderweb channel graphs and gave recursive equations for computing their blocking probabilities. In this paper we use a recent result in combinatorics to give a dosed form solution for the recursive equations ...
openaire +1 more source
Blocking Probability in OBS Networks
2009Computing the blocking probability of bursts at the core nodes in an OBS network is important for many reasons. First, it helps to understand the loss process of bursts and provide exact analytical expression for the loss rate of bursts at the core nodes.
T. Venkatesh, C. Siva Ram Murthy
openaire +1 more source
Computing the Blocking Probabilities for Spiderweb Channel Graphs
IEEE Transactions on Communications, 1982The problem of computing the blocking probabilities for spiderweb channel graphs is known to be difficult even under the simplifying Lee model. There have been only a few successful cases reported in the literature, all restricted to special types of four-stage channel graphs.
openaire +1 more source
Reciprocity of blocking probabilities in multiservice loss systems
IEEE Transactions on Communications, 1988A general reciprocity relation is pointed out that is obeyed by the blocking probabilities in multiservice loss systems managed under a coordinate convex access. This in turn means that several user classes compete for a common pool of resource, the mutual differential influences on the blocking probabilities of the traffic streams are equal.
openaire +1 more source
Blocking Probability in a Caching Hierarchy
2011We develop a performance model for the availability of a MobileTV service in a caching hierarchy network. The probability that bandwidth for the service is available is calculated as a function of channel popularity, the number of available channels, cache sizes, network configuration, and content viewing behavior.
Lu, Y. +3 more
openaire +1 more source

