G. S. Poltyrev, "Coding for channel with asynchroneous multiple access," Probl. Peredachi Informatsii, vol. 19, pp. 12--21, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Time-Splitting Multiple-Access - Rimoldi (1999) (Correct)
....region C = P X 1 P X 2 Delta Delta DeltaP X M R[W ; P X 1 P X 2 Delta Delta Delta PXM ] 9) where the union is over all product input distributions. The capacity region of the asynchronous multiple access channel with arbitrarily large shifts between time indices is the closure of C [16, 17], whereas if shifts are bounded or the multiple access channel is synchronous then its capacity is the closure of the convex hull of C [18, 19] In this paper we consider only asynchronous channels. It follows that any point in the interior of the capacity region must be in R[W ; P X 1 P X 2 ....
G. S. Poltyrev, "Coding for channel with asynchroneous multiple access," Probl. Peredachi Informatsii, vol. 19, pp. 12--21, 1983.
Rate-Splitting Multiple Access for Discrete Memoryless.. - Grant, Rimoldi.. (1996) (2 citations) (Correct)
....) M such that R(S) I(X S ; Y jX S c ) 8S [M ] 1) where R(S) 4 = X i2S R i ; 2) and X S 4 = X i ) i2S ; 3) and let C = p X 1 p X 2 Delta Delta Deltap X M R[W ; p X 1 p X 2 Delta Delta Delta p XM ] 4) where the union is over all product input distributions. Poltyrev [1] and Hui and Humblet [2] showed that the asynchronous 1 capacity region is the closure of C. The closure of the convex hull of C is the synchronous capacity region which was first proved by Ahlswede [3] and Liao [4] and subsequently, as a special case of a more general result, by Slepian and ....
....and the bottom layer is decoded last. 1 3a 2a 3b 2b Figure 7: Layered representation of an order for M = 3 inputs. To associate an order to each ff = ff 2 ; Delta Delta Delta ; ff M ) 2 I M Gamma1 , we first define a generalized order A [M ] according to the following recursion. Let A [1] Delta = 11) and for i integer greater than 1 let A [i] be the list obtained by interleaving A [i Gamma1] with (i1; i2; Delta Delta Delta ; i(2 i Gamma1 ) For example, A [1] 11) A [2] 21; 11; 22) and A [3] 31; 21; 32; 11; 33; 22; 34) Fig. 8 shows the equivalent layered ....
[Article contains additional citation context not shown here]
G. S. Poltyrev, "Coding for channel with asynchroneous multiple access," Probl. Peredachi Informatsii, vol. 19, pp. 12--21, 1983.
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