A. Grand, B. Rimoldi, R. Urbanke, and P. A. Whiting. Rate-splitting multiple access for discrete memoryless channels. IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 873-890, 2001.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reliable Communication Under Channel Uncertainty - Lapidoth, Narayan (1998) (25 citations) (Correct)
.... joint pmf on of the form where the time sharing random variable with values in the set is arbitrary, but may be limited to assume two values, say [44] Extensions to account for average input constraints are discussed in [66] 121] and [127] Lowcomplexity codes for the MAC are discussed in [70] and [105] It is interesting to note that even for a known MAC, the average probability of error and the maximal probability of error criteria can lead to different capacity regions [54] this is in contrast with the capacity of a known single user channel. The compound channel capacity region ....
A. Grant, R. Rimoldi, R. Urbanke, and P. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. Inform. Theory, to be published.
Time-Splitting Multiple-Access - Rimoldi (1999) Self-citation (Rimoldi) (Correct)
....know the channel impulse response to do successive 2 decoding. But of course, if the channel impulse response is known then the channel has a larger capacity region. For a summary of multiple access methods that allow one to approach any point in the capacity region see e.g. the introduction in [8]. The approach used in this paper is related to rate splitting multiple access (see [10] for Gaussian channels and [8] for general discrete memoryless channels) Yeh and Gallager [11] have developed a related approach which requires up to 1 2 M log 2 M M point to point codes. Our apporach was ....
....then the channel has a larger capacity region. For a summary of multiple access methods that allow one to approach any point in the capacity region see e.g. the introduction in [8] The approach used in this paper is related to rate splitting multiple access (see [10] for Gaussian channels and [8] for general discrete memoryless channels) Yeh and Gallager [11] have developed a related approach which requires up to 1 2 M log 2 M M point to point codes. Our apporach was motivated by [9] The paper is organized as follows. Section II discusses time splitting multiple access for ....
[Article contains additional citation context not shown here]
A. Grant, B. Rimoldi, R. Urbanke, and P. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. Inform. Theory, To appear.
A New Source-Splitting Approach to the Slepian-Wolf Problem - Todd Coleman Anna (2004) (Correct)
No context found.
A. Grand, B. Rimoldi, R. Urbanke, and P. A. Whiting. Rate-splitting multiple access for discrete memoryless channels. IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 873-890, 2001.
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