Carbon-copying onto the dirty relay channel

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Carbon-copying onto the dirty relay channel

Full text

Pdf (666 KB)

Source

International Conference On Communications And Mobile Computing archive
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly table of contents

Leipzig, Germany

SESSION: Cooperative Cognitive Networks workshop table of contents

Pages 505-511

Year of Publication: 2009

ISBN:978-1-60558-569-7

Authors

Abdellatif Zaidi	Université Catholique de Louvain, Louvain-la-Neuve, Belgium
Luc Vandendorpe	Université Catholique de Louvain, Louvain-la-Neuve, Belgium

Sponsors

ACM: Association for Computing Machinery
: Wiley-Blackwell

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 26, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1582379.1582489 What is a DOI?

ABSTRACT

We consider the problem of transmission over a relay version of the carbon-copying onto dirty paper. In this setup, additive Gaussian outside interferences corrupt both transmissions to the relay and to the destination; and only the source knows the interferences (in a noncausal manner). We first focus on the case of one interference corrupting both links; and then we focus on the case of two independent interferences. For each of these two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decodeand-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn. The established results may be of importance for the emerging field of cooperation in presence of some cognitive radios that might be aware of some of other users messages intended to a common receiver.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. Mitola, Cognitive Radio: an Integrated Agent Architecture for Software Defined Radio. PhD thesis, KTH Royal Institute of Technology, Stockholm, Sweeden, 2000.
	2	N. Devroye, P. Mitran, and V. Tarokh, "Limits on communications in a cognitive radio channel," IEEE Communications Magazine, vol. 44, pp. 44--49, Jun. 2006.
	3	N. Devroye, P. Mitran, and V. Tarokh, "Achievable rates in cognitive radio channels," IEEE Trans. Inf. Theory, vol. 52, pp. 1813--1827, May 2006.
	4	A. Zaidi, L. Vandendorpe, and P. Duhamel, "Lower bounds on the capacity regions of the multi-relay channel and the multi-relay broadcast channel with non-causal side-information," in Proc. IEEE Int. Conf. on Communications, ICC, Glasgow, UK, Jun. 2007, pp. 6005--6011.
	5	A. Zaidi and L. Vandendorpe, "Rate regions for the partially-cooperative relay-broadcast channel with non-causal side information," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1246--1250.
	6	A. Zaidi and L. Vandendorpe, "Lower bounds on the capacity of the relay channel with states at the source," EURASIP Journal on Wireless Communications and Networking, Sep. 2008 (submitted for publication).
	7	A. Zaidi, S. Kotagiri, J. N. Laneman, and L. Vandendorpe, "Cooperative relaying with state at the relay," in Proc. IEEE Information Theory Workshop, Porto, Portugal, May 2008, pp. 139--143.
	8	A. Zaidi, S. Kotagiri, J. N. Laneman, and L. Vandendorpe, "Cooperative relaying with state available non-causally at the relay," IEEE Trans. Inf. Theory, Dec. 2008 (submitted for publication).
	9	M. H. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. 29, pp. 439--441, May 1983.
	10	S. Kotagiri and J. N. Laneman, "Achievable rates for multiple access channels with state information known at one encoder," in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, 2004.
	11	A. Khisti, U. Erez, A. Lapidoth, and G. Wornell, "Carbon copying onto dirty paper," IEEE Trans. Inf. Theory, vol. 53, pp. 1814--1827, May 2007.
	12	T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. IT-25, pp. 572--584, Sep. 1979.
	13	S. Kotagiri and J. Laneman, "Multiaccess channels with state known to one encoder: A case of degraded message sets," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1566--1570.
	14	A. Somekh-Baruch, S. Shamai (Shitz), and S. Verdù, "Cooperative multiple access encoding with states available at one transmitter," IEEE Trans. Inf. Theory, vol. 54, pp. 4448--4469, Oct. 2008.
	15	A. Zaidi, S. Kotagiri, J. N. Laneman, and L. Vandendorpe, "Multiaccess channels with state known to one encoder: Another case of degraded message sets," in Proc. IEEE Int. Symp. Information Theory, 2009 (accepted for publication).
	16	P. Mitran, N. Devroye, and V. Tarokh, "On compound channels with side information at the transmitter," IEEE Trans. Inf. Theory, vol. 52, pp. 1745--1755, Ap. 2006.