Abstract
In this paper, we analyze inner and outer bounding capacity region of two-user multiple-access relay channel (MARC) with side information (SI) non-causally known at one encoder in different scenarios. First, we obtain a general capacity inner bound including various previous results as its special cases, where, the informed encoder transmits two-layer individual description of side information to the relay and destination, and block Markov, superposition, Marton and Gel’fand-Pinsker coding at the encoders and sliding-window decoding at the receiver are exploited. This individual side information can be considered as the partial SI at the relay and destination, which can potentially increase the transmission rates, especially for the uninformed encoder. Second, to show practical importance of the obtained inner bound, we extend it to the Gaussian version, which can be used in studying the coverage region and energy efficiency. Third, we study outer bounding the capacity region, aiming at outer bounds less than cut set bounds, by considering a general MARC with partial decode and forward (PDF) strategy at the relay. Finally, the obtained Gaussian inner bound is evaluated numerically, and we showed that our capacity inner bound results in more sum-rate in comparison with the previous studies.
Similar content being viewed by others
Data availability
Not applicable.
References
Shannon, C. E. (1958). Channels with side information at the transmitter. IBMJ Research and Development, 2(4), 289–293.
Kuznetsov, N. V., & Tsybakov, B. S. (1974). Coding in memories with defective cells. Problemy Peredachi Informatsii, 10(2), 52–60.
Gel’fand, S. I., & Pinsker, M. S. (1980). Coding for channel with random parameters. Problems of Control and Information Theory, 9(1), 19–31.
Costa, M. (1983). Writing on dirty paper (corresp.). IEEE Transactions on Information Theory, 29(3), 439–441.
Anzabi-Nezhad, N. S., Hodtani, G. A., & Molavi Kakhki, M. (2013). Information theoretic exemplification of the receiver re-cognition and a more general version for the costa theorem. IEEE Communications Letters, 17(1), 107–110.
Das, A., & Narayan, P. (2002). Capacities of time-varying multiple access channels with side information. IEEE Transactions on Information Theory, 48(1), 4–25.
Jafar, S. A. (2006). Capacity with casual and non-casual side information-aunified view. IEEE Transactions on Information Theory, 52(12), 5468–5474.
Philosof, T., Zamir, R., & Erez, U. (2008). Technical report: Achievable rates for the MAC with correlated channel-state information. ArXiv, abs/0812.4803.
Zamir, R., Shamai, S., & Erez, U. (2002). Nested linear/lattice codes for structured multiterminal binning. IEEE Transactions on Information Theory, 48(6), 1250–1276.
Philosof, T., & Zamir, R. (2009). On the loss of single-letter characterization: The dirty multiple access channel. IEEE Transactions on Information Theory, 55(6), 2442–2454.
Philosof, T., Zamir, R., Erez, U., & Khisti, A. J. (2011). Lattice strategies for the dirty multiple access channel. IEEE Transactions on Information Theory, 57(8), 5006–5035.
Erez, U., Shamai, S., & Zamir, R. (2005). Capacity and lattice strategies for canceling known interference. IEEE Transactions on Information Theory, 51(11), 3820–3833.
Kotagiri, S. P., & Laneman, J. N. (2008). Multiaccess channels with state known to some encoders and independent messages. EURASIP Journal on Wireless Communications and Networking, 2008(1), 450680.
Kotagiri, S. P., & Laneman, J. N. (2007). Multiaccess channels with state known to one encoder: A case of degraded message sets. In IEEE international symposium on information theory (ISIT) (pp. 1566–1570), Nice.
Zaidi, A., Kotagiri, S. P., laneman, J. N., & Vandendorpe, L. (2009). Multiaccess channels with state known to one encoder: another case of degraded message stes. In IEEE international symposium on information theory (ISIT) (pp. 2376–2380), Seoul.
Cemal, Y., & Steinberg, Y. (2005). The multiple access channel with partial state information at the encoders. IEEE Transactions on Information Theory, 51(11), 3392–4003.
Bahmani, E., & Hodtani, G. A. (2012). Achievable rate regions for the dirty multiple access channel with partial side information at the transmitters. In IEEE international symposium on information theory (ISIT) (pp. 1702–1706), Cambridge, MA.
Bahmani, E., & Hodtani, G. A. (2013). Capacity for the doubly dirty multiple access channel with partial side information at the transmitters. IET Communications, 7(11), 1099–1108.
Bahmani, E., & Hodtani, G. A. (2015). Achievable rate regions for a three-user multiple access channel with partial side information. Transactions on Emerging Telecommunications Technologies, 26(4), 616–629.
Monemzadeh, M., Bahmani, E., Hodtani, G. A., & Seyedin, S. A. (2014). Gaussian doubly dirty compound multiple-access channel with partial side information at the transmitters. IET Communications, 8(12), 2181–2192.
Van der Meulen, E. C. (1971). Three-terminal communication. Advances in Applied Probability, 3(1), 120–154.
Cover, T. M., & Gamal, A. E. (1979). Capacity theorems for relay channel. IEEE Transactions on Information Theory, 25(5), 572–584.
Gamal, A. E., & Zahedi, S. (2005). Capacity of A class of relay channels with orthogonal components. IEEE Transactions on Information Theory, 51(5), 1815–1817.
Hodtani, G. A., & Aref, M. (2009). Unified approach to the capacity evaluation of the relay channel. IET Communications, 3(7), 1208–1215.
Host-Madsen, A., & Zhang, J. (2005). Capacity bounds and power allocation for wireless relay channels. IEEE Transactions on Information Theory, 51(6), 2020–2040.
Braginskiy, E., Steiner, A., & Shitz, S. S. (2012). Oblivious sequential decode and forward cooperative strategies for the wireless relay channel. IEEE Transactions on Communications, 60(11), 3228–3238.
Zhang, L., Jiang, J., Goldsmith, A. J., & Cui, S. (2011). Study of Gaussian relay channels with correlated noises. IEEE Transactions on Communications, 59(3), 863–876.
Aggarwal, V., Bennatan, A., & Calderbank, A. R. (2009). On maximizing coverage in Gaussian relay channels. IEEE Transactions on Information Theory, 55(6), 2518–2536.
Alizadeh, A., & Hodtani, G. A. (2012). Analysis of coverage region for MIMO relay channel. In International symposium on wireless communication systems (pp. 626–630).
Zaidi, A., Shamai, S. S., Piantanida, P., & Vandendorpe, L. (2013). Bounds on the capacity of the relay channel with noncausal state at the source. IEEE Transactions on Information Theory, 59(5), 2639–2672.
Zaidi, A., Kotagiri, S. P., & Laneman, J. N. (2010). Cooperative relaying with state available non-causally at the relay. IEEE Transactions on Information Theory, 56(5), 2272–2298.
Shen, J., Wang, D.-J., Wang, O., & Zhang, G. (2017). Decode-forward relaying with state available noncausally at the relay. In International conference on information technology and management engineering (pp. 258–269), Beijing, China.
Kramer, G., & Van Wijngaarden, A. J. (2000). On the white gaussian multiple-access relay channel. In IEEE international symposium on information theory (p. 40). Sorrento, Italy.
Kramer, G., Gupta, P., & Gastpar, M. (2004). Information-theoretic multihopping for relay networks. In International Zurich seminar on communications (pp. 192–195). Zurich, Switzerland.
Sankaranarayanan, L., Kramer, G., & Mandayam, N. (2004). Hierarchical sensor networks: capacity bounds and cooperative strategies using the multiple-access relay channel model. In First annual IEEE communications society conference on sensor and Ad Hoc communications and networks (pp. 191–199), Santa Clara, CA, USA.
Sankaranarayanan, L., Kramer, G., & Mandayam, N. (2007). Offset encoding for multipleaccess relay channels. IEEE Transactions on Information Theory, 53(10), 3814–3821.
Tandon, R., & Poor, H. V. (2011). On the capacity region of multiple-access relay channels. In Annual conference on information sciences and systems (pp. 1–5), Baltimore, MD.
Sankar, L., Mandayam, N. B., & Poor, H. V. (2009). On the sum-capacity of degraded Gaussian multiple-access relay channels. IEEE Transactions on Information Theory, 55(12), 5394–5411.
Sahebalam, A., Osmani, M., & Hodtani, G. A. (2013). General and new inner bound for multiple-access relay channel and two certain capacity theorems. IET Communications, 7(13), 1348–1359.
Osmani, M., & Hodtani, G. A. (2014). On multiple-access relay channel with common message. Transactions on Emerging Telecommunications Technologies, 27(8), 1030–1043.
Osmani, M., Sahebalam, A., & Hodtani, G. A. (2013). Multiple-access relay channels with non-causal side information at the relay. In IEEE international symposium on information theory (pp. 2631–2635). Istanbul.
Etminan, J., Mohanna, F., & Hodtani, G. A. (2018). A new general inner bound for multiple-access relay channel with non-causal side information at one encoder and common message. In Iran workshop on communication and information theory, Tehran, Iran, 2018.
Etminan, J., Mohanna, F., & Hodtani, G. A. (2021). Effects of relay and side information at one encoder on the coverage regions in Gaussian multiple-access channel. Transactions on Emerging Telecommunications Technologies, 2021, e4313. https://doi.org/10.1002/ett.4313.
Etminan, J., Mohanna, F., & Hodtani, G. A. (2021). A general achievable rate region and two certain capacity regions for slepian-wolf multiple-access relay channel with non-causal side information at one encoder. IET Communications, 15(4), 497–512.
Permuter, H. H., Shamai, S., & Somekh-Baruch, A. (2011). Message and state cooperation in multiple access channels. IEEE Transactions on Information Theory, 57(10), 6379–6396.
Funding
Not applicable
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All authors have declare that they have no conflict of interest.
Code availability
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendices
In details for Appendix B, Appendix C and Appendix D:
-
a
: follows since Fano’s inequality.
-
b
: follows since Csiszar-Korners’s sum identity.
-
c
: follows since \(X_{Ri}-W_0W_1^{\prime }W_2^{\prime }S_{i+1}^nY_{D}^{i-1}-W_1^{\prime \prime } W_2^{\prime \prime }S_{i}\).
-
d
: follows since \(W_1^{\prime \prime }-W_0W_1^{\prime }W_2^{\prime }W_2^{\prime \prime }S_{i+1}^n-S_{i}\).
-
e
: follows since \(W_1^{\prime }-W_0W_2^{\prime }S_{i+1}^n-S_{i}\).
-
f
: follows since \(X_{Ri}=f\left( Y_{R}^{i-1}\right) \)
-
g
: follows since \(H\left( S_{i}\right) =H\left( S_i|S_{i+1}^n\right) \).
-
h
: follows since \(X_{1i}=f\left( W_0W_1^{\prime }W_1^{\prime \prime }\right) \).
-
k
: follows since \(W_1^{\prime \prime }-W_0W_1^{\prime }W_2^{\prime }Y_{D}^{i-1}S_{i+1}^n-S_{i}\).
-
l
: follows since the channel is degraded.
-
n
: follows since \(W_1^{\prime }W_1^{\prime \prime }-X_{1i}-Y_{Ri}Y_{Di}\).
-
t
: follows since \(X_{0i}=f\left( W_0\right) \), \(X_{1Di}=f\left( W_1\right) \) and \(X_{2Di}=f\left( W_2,S^n\right) \).
-
q
: follows since \(Y_{Ri}-X_{0i}S_iX_{Ri}-X_{1Di}X_{2Di}\) and \(Y_{Di}-X_{1Di}X_{2Di}S_iX_{Ri}-X_{0i}Y_{Ri}\).
-
r
: follows since \(Y_R^{i-1}X_{Ri}-Y_D^nW_0W_1W_2S^{i-1}-S_i\)
A Proof of the Theorem 2
By using the channel inputs distribution and auxiliary random variables defined in Sect. 3.2 we extended the results of the remark 1 to Gaussian continuous channel, Hence:
Where, we define \({\tilde{Y}}_R=\frac{X_2}{d_{2R}^{\frac{\alpha }{2}}}+\frac{S}{d_{SR}^{\frac{\alpha }{2}}}+Z_R\) and \({\tilde{Y}}_D=\frac{X_2}{d_{2D}^{\frac{\alpha }{2}}}+\frac{V_{R_2}}{d_{RD}^{\frac{\alpha }{2}}}+\frac{S}{d_{SD}^{\frac{\alpha }{2}}}+Z_D\) and by using MMSE estimator it can be shown that:
And consequently, it can be shown that:
Also, similarly it can be shown that:
And the proof is completed.
B Proof of Theorem 3
For brevity, only some bounds are proved. The other bounds can be done similarly.
C Proof of Theorem 4
For brevity, only some bounds are proved. The other bounds can be done similarly.
D Proof of Theorem 5
For brevity, only some bounds are proved. The other bounds can be done similarly.
Rights and permissions
About this article
Cite this article
Etminan, J., Mohanna, F. & Abed Hodtani, G. Inner and outer bounding capacity region for multiple-access relay channel with non-causal side information at one encoder. Wireless Netw 28, 85–106 (2022). https://doi.org/10.1007/s11276-021-02815-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-021-02815-8