H. Liao, "A coding theorem for multiple access communications," ISIT, 1972.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....single user channel is the multiple access channel which models the channel with several transmitters that share the same transmission medium and a single receiver. The capacity region and coding theorems for such a channel were established independently by R.Ahlswede and H. Liao in [6] 7] and [8]. They showed that the capacity region of a multiple access channel is a convex hull of a union of pentagons. Shortly after that, A.Wyner [9] and T.Cover [10] gave a simplified version of these results for memoryless channels. Another important information theoretic parameter, the error exponents ....

....and there is a need to extend the usual single cell model to multiple cells. This has been accomplished in [16] where a simple model that describes the cellular environment has been introduced and respective information theoretic parameters analyzed. Extending the results of [6] 7] [8] to the case of CDMA the capacity region of synchronous CDMA multiple access AWGN channel has been derived in [3] and later reformulated in [17] as 1 (P,G) ju (R,R2, Ra: Ri logliji H: JC 1, K iEJ (1.6) where matrix H = W 2) SS T (W ) and Ii I is [J[ x [J[ dimensional unity ....

H. Liao, "A coding theorem for multiple-access communications," Proc. Int. Symp. Info. Theory, 1972.

....requiring feedback) This paper considers the limits imposed by information theory on the T out of M coding problem for the multiple access channel with static assignment. The first information theoretic result for the multiple access channel was obtained independently by Ahlswede [2] and Liao [3] , who determined the capacity region for two synchronized users. Some extensions of this work appear in [4] 8] Cover, McEliece and Posner [9] have shown that the same capacity region is valid for a mildly frameasynchronous multiple access channel in which the relative delays between users are ....

H. Liao, "A coding theorem for multiple access communications," in Proc. Int. Symp. Information Theory, Asilomar, CA, 1972; also "Multiple Access Channels," Ph.D. dissertation, Dept. Elec. Eng., Univ. of Hawaii, 1972.

....theory is to determine the minimum average error probability which can be achieved on a two user discrete memoryless multipleaccess channel using a block code with rate pair (RX ; R Y ) and blocklength n. The most fundamental result of this theory is the coding theorem of Ahlswede [1] and Liao [10] which asserts that, for any (RX ; R Y ) in the interior of a certain set C and all sufficiently large n, there exists a multiuser code with an error probability arbitrarily close to zero. Conversely, for any (RX ; R Y ) outside of C, the error probability is bounded away from zero. The set C, ....

H. Liao, "A coding theorem for multiple access communications," in Proc. Int. Symp. Information Theory, Asilomar, CA, 1972; also "Multiple Access Channels," Ph.D. dissertation, Dept. of Elec. Eng., Univ. of Hawaii, 1972.

....0 , 1 X M 0 , 1 Figure 1: The M User Binary Adder Channel (BAC) reliable communication can be assured. The users are independent of one another, and P i denotes the probability that the i th user transmits a 1 at any given time unit, i.e. P i = D Prob[X i = 1 ] Ahlswede and Liao [2,5], proved that for any discrete time and memoryless multiple access channel with independent inputs (of which our BAC is a special case) 1) C SUM (M) max I(X 1 , X 2 , X M ; Y) where the maximum is taken over all possible probability distributions P(X 1 , X 2 , X M ) of the ....

H. Liao, A coding theorem for multiple access communications, in Proc. Int. Symp. Information Theory, Asilomar, Ca., 1972; also Multiple Access Channels, Ph.D. dissertation, Dept. Elec. Eng., Univ. of Hawaii, 1972.

No context found.

H. Liao, "A coding theorem for multiple access communications," ISIT, 1972.

No context found.

H. Liao, "A coding theorem for multiple access communication," in Int. Symp. Information Theory (Asilomar,

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC