Multiple-access channel with correlated states and cooperating encoders
Multiple-access channel with correlated states and cooperating encoders
- Author(s): M.J. Emadi ; M. Zamanighomi ; M.R. Aref
- DOI: 10.1049/iet-com.2011.0838
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Thank you
Your recommendation has been sent to your librarian.
- Author(s): M.J. Emadi 1 ; M. Zamanighomi 1 ; M.R. Aref 1
-
-
View affiliations
-
Affiliations:
1: Information Systems and Security Lab (ISSL) Electrical Engineering Department, Sharif University of Technology, Tehran, Iran
-
Affiliations:
1: Information Systems and Security Lab (ISSL) Electrical Engineering Department, Sharif University of Technology, Tehran, Iran
- Source:
Volume 6, Issue 13,
5 September 2012,
p.
1857 – 1867
DOI: 10.1049/iet-com.2011.0838 , Print ISSN 1751-8628, Online ISSN 1751-8636
- « Previous Article
- Table of contents
- Next Article »
In this study, a two-user discrete memoryless multiple-access channel with two correlated states known non-causally at the corresponding encoder is considered. Each encoder transmits a message independent of the other encoder's and tries to cooperate with it. To consider cooperative encoders, it is assumed that each encoder strictly-causally receives and finds out the other encoder's transmitted signals and tries to cooperate with the other encoder by transmitting its message. A special case is also studied in which the common part of the states is known at the both encoders, resulting in a larger rate region. For these two scenarios, achievable rate regions are derived using a combination of block-Markov and Gel'fand-Pinsker coding techniques, and outer bounds are also established. For the second scenario, the achievable rate region of the Gaussian model is derived, and some implications of the results are discussed.
Inspec keywords: multi-access systems; encoding; Markov processes; cooperative communication; memoryless systems; Gaussian channels
Other keywords:
Subjects: Multiple access communication; Markov processes; Codes; Radio links and equipment
References
-
-
1)
- T.M. Cover , A.A. El Gammal . Capacity theorems for relay channels. IEEE Trans. Inf. Theory , 5 , 572 - 584
-
2)
- Willems, F.M.J., Van der Meulen, E.C., Schalkwijk, J.P.M.: `Achievable rate region for the multiple access channel with generalised feedback', Proc. Annual Allerton Conf. on Communication, Control and Computing, 1983, p. 284–292.
-
3)
- A. Somekh-Baruch , S. Shamai , S. Verdu . Cooperative multiple access encoding with states available at one transmitter. IEEE Trans. Inf. Theory , 10 , 4448 - 4469
-
4)
- F.M.J. Willems , E.C. van der Meulen . The discrete memoryless multiple-access channel with cribbing encoders. IEEE Trans. Inf. Theory , 3 , 313 - 327
-
5)
- M. Li , O. Simeone , A. Yener . Multiple access channels with states causally known at transmitters. IEEE Trans. Inf. Theory
-
6)
- Haghi, A., Khosravi-Farsani, R., Aref, M.R., Marvasti, F.: `The capacity region of fading multiple access channels with cooperative encoders and partial CSIT', Proc. IEEE Int. Symp. on Information Theory (ISIT’10), June 2010, Austin, TX, USA, p. 485–489.
-
7)
- Reza, K.h., Marvazti, F.: `Capacity bounds for multiuser channels with non-causal channel state information at the transmitters', Proc. IEEE Information Theory Workshop (ITW’11), October 2011, Paraty, Brazil, p. 195–199.
-
8)
- A. Haghi , R. Khosravi-Farsani , M.R. Aref , F. Marvasti . The capacity region of p-transmitter/q-receiver multiple access channels with common information. IEEE Trans. Inf. Theory , 11 , 7359 - 7376
-
9)
- I. Csiszar , J. Korner . Broadcast channels with confidential messages. IEEE Trans. Inf. Theory , 3 , 339 - 348
-
10)
- I. Csiszar , J. Korner . (1981) Information theory: coding theorems for discrete memoryless systems.
-
11)
- C.E. Shannon . Channels with side information at the transmitter. IBM J. Res. Develop. , 289 - 293
-
12)
- Kim, Y.H., Sutivong, A., Sigurj́ Jonsson, S.: `Multiple user writing on dirty paper', Proc. IEEE Int. Symp. on Information Theory (ISIT’04), June–July 2004, Chicago, IL, USA, p. 534.
-
13)
- M. Costa . Writing on dirty paper. IEEE Trans. Inf. Theory , 3 , 439 - 441
-
14)
- S.I. Bross , A. Lapidoth . The state-dependent multiple-access channel with states available at a cribbing encoder.
-
15)
- Lapidoth, A., Steinberg, Y.: `The multiple access channel with causal and strictly causal side information at the encoders', Proc. Int. Zurich Seminar on Communications (IZS), March 2010, Zurich, Switzerland, p. 13–16.
-
16)
- Bross, S.I., Lapidoth, A., Wigger, M.A.: `The Gaussian MAC with conferencing encoders', Proc. IEEE Int. Symp. on Information Theory (ISIT’08), July 2008, Toronto, ON, Canada, p. 2702–2706.
-
17)
- Kotagiri, S., Laneman, J.N.: `Multiaccess channels with state known to one encoder: a case of degraded message sets', Proc. IEEE Int. Symp. on Information Theory (ISIT’07), June 2007, Nice, France, p. 1566–1570.
-
18)
- Ahlswede, R.: `Multiway communication channels', Proc. Second Int. Symp. Information Theory, 1971, Tsahkadsor, p. 23–52, Armenaian, S.S.R..
-
19)
- Somekh-Baruch, A., Shamai, S., Verdu, S.: `Cooperative multiple access encoding with states available at one transmitter', Proc. IEEE Int. Symp. on Information Theory (ISIT’07), June 2007, Nice, France, p. 1556–1560.
-
20)
- F.M.J. Willems . The discrete memoryless multiple channel with partially cooperating encoders. IEEE Trans. Inf. Theory , 3 , 441 - 445
-
21)
- Aref, M.R.: `Information flow in relay networks', 1980, PhD, Stanford University.
-
22)
- S. Kotagiri , J.N. Laneman . Multiple access channels with state information known to some encoders and independent messages. EURASIP J. Wirel. Commun. Netw. , 1 - 14
-
23)
- R. Khosravi-Farsani , F. Marvasti . Multiple access channels with cooperative encoders and channel state information. European Trans. Telecommun.
-
24)
- S.A. Jafar . Capacity with causal and non-causal side information: a unified view. IEEE Trans. Inf. Theory , 12 , 5468 - 5474
-
25)
- Gel'fand, S.I., Pinsker, M.S.: `On Gaussian channels with random parameters', Proc. IEEE Int. Symp. on Information Theory (ISIT’83), September 1984, St Jovite, Canada, p. 247–250.
-
26)
- G. Keshet , Y. Steinberg , N. Merhav . (2008) Channel coding in the presence of side information: subject review.
-
27)
- A.B. Carleial . Multiple-access channels with different generalised feedback signals. IEEE Trans. Inf. Theory , 6 , 841 - 850
-
28)
- Lapidoth, A., Steinberg, Y.: `The multiple access channel with two independent states each known causally at one encoder', Proc. IEEE Int. Symp. on Information Theory (ISIT’10), June 2010, Austin, TX, USA, p. 480–484.
-
29)
- Somekh-Baruch, A., Shamai, S., Verdu, S.: `Cooperative encoding with asymmetric state information at the transmitters', Proc. Allerton Conf. on Communication, Control, and Computing, October 2006, Monticello, IL, USA.
-
30)
- Shannon, C.E.: `Two-way communication channels', Proc. fourth Berkeley Symp. on Mathematics, Statistics and Probabiliyt, June 20–July 30 1960, Berkeley, CA, USA, p. 611–644, vol. 1.
-
31)
- Zaidi, A., Kotagiri, S., Laneman, J.N., Vandendorpe, L.: `Multiaccess channels with state known to one encoder: another case of degraded message sets', Proc. IEEE Int. Symp. on Information Theory (ISIT’09), Jun.-Jul 2009, Seoul, Korea, p. 2376–2380.
-
32)
- Y. Cemal , Y. Steinberg . Coding problems for channels with partial state information at the transmitter. IEEE Trans. Inf. Theory , 12 , 4521 - 4536
-
33)
- H. Permuter , S. Shamai , A. Somekh-Baruch . Message and state cooperation in multiple access channels. IEEE Trans. Inf. Theory , 10 , 6379 - 6396
-
34)
- T.M. Cover , J.A. Thomas . (2006) Elements of information theory.
-
35)
- Zaidi, A., Piantanida, P.S., Shamai, Sh.: `Multiple access channel with states known non-causally at one encoder and only strictly causally at the other encoder', Proc. IEEE Int. Symp. on Information Theory (ISIT’11), July 31–August 5 2011, St Petersburg, Russia, p. 2802–2806.
-
36)
- Liao, H.: `A coding theorem for multiple accesss communications', Proc. IEEE Int. Symp. on Information Theory (ISIT), 1972, Asilomar.
-
37)
- T. Philosof , R. Zamir , U. Erez . Technical report: achievable rates for the MAC with correlated channel-state information.
-
38)
- S.I. Gel'fand , M.S. Pinsker . Coding for channel with random parameters. Probl. Control Inf. Theory , 1 , 19 - 31
-
1)