Scaling laws and techniques in decentralised processing of interfered Gaussian channels

European Transactions on Telecommunications

Volumn 22, Issue 5, 2011, Pages 240-253

  Sanderovich, Amichai ^a   Peleg, Michael ^a   Shamai, Shlomo ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE; AMOUNT OF INFORMATION; BOUNDING TECHNIQUES; COMMUNICATION RATE; CUT-SET; DECENTRALISED; FINITE CAPACITY; GAUSSIAN CHANNELS; INTERFERING SIGNALS; LOWER BOUNDS; PRE-LOG; REMOTE DESTINATION; UPPER BOUND;

TELECOMMUNICATION; TRANSMITTERS;

SCALING LAWS;

EID: 80052088681     PISSN: 1124318X     EISSN: 15418251     Source Type: Journal    
DOI: 10.1002/ett.1507     Document Type: Article

References (27)

1. Sanderovich A, Shamai S, Steinberg Y, Kramer G,. Communication via decentralized processing. IEEE Transactions on Information Theory July 2008; 54 (7): 3008-3023.
2. Sanderovich A, Somekh O, Poor V, Shamai S,. Uplink macro diversity of limited backhaul cellular network. IEEE Transactions on Information Theory August 2009; 55 (8): 3457-3478.
3. Sanderovich A, Shamai S, Steinberg Y,. Distributed MIMO, receiver-achievable rates and upper bounds. IEEE Transactions on Information Theory October 2009; 55 (10): 4419-4438.
4. Hedby G,. Error bounds for the Euclidean channel subject to intentional jamming. IEEE Transactions on Information Theory March 1994; 40 (2): 594-600.
5. Tekin E, Yener A,. The general Gaussian multiple-access and two-way wire-tap channels: achievable rates and cooperative jamming. IEEE Transactions on Information Theory June 2008; 54 (6): 2735-2751.
6. Maric I, Dabora R, Goldsmith A,. Generalized relaying in the presence of interference. 42nd Asilomar Conference on Signals, Systems and Computers,October 2008; 1579-1582.
7. Maric I, Dabora R, Goldsmith A,. On the capacity of the interference channel with a relay. IEEE International Symposium on Information Theory, Toronto, Ontario, Canada,July 2008; 554-558.
8. Dabora R, Maric I, Goldsmith A,. Interference forwarding in multiuser networks. IEEE Global Telecommunications Conference, GLOBECOM 2008,November 2008; 1-5.
9. Sahin O, Simeone O, Erkip E,. Interference channel aided by an infrastructure relay. IEEE International Symposium on Information Theory, Seoul, S. Korea, June 2009; 2023-2027.
10. Wang I-H, Tse DNC,. Interference mitigation through limited receiver cooperation. IEEE Transactions on Information Theory May 2011; 57 (5): 2913-2940.
11. Nazer B, Gastpar M,. The case for structured random codes in network communication theorems. Proceedings of the IEEE Information Theory Workshop (ITW 2007), Lake Tahoe, CA,September 2007.
12. Nazer B, Gastpar M,. Structured random codes and sensor network coding theorems. Proceedings of the 2008 International Zurich Seminar on Communications, Zurich, Switzerland, March 2008.
13. Krithivasan D, Pradhan S,. Lattice for distributed source coding: jointly Gaussian sources and reconstruction of a linear function. IEEE Transactions on Information Theory July 2007. Available:.
14. Philosof T, Khisti A, Erez U, Zamir R,. Lattice strategies for the dirty multiple access channel. Proceedings of IEEE International Symposium Info Theory (ISIT2007), Nice, France,June 2007; 386-390.
15. Poltyrev G,. On coding without restrictions for the AWGN channel. IEEE Transactions on Information Theory March 1994; 40: 409-417.
16. Erez U, Zamir R,. Achieving 1 2 log (1 + S N R) on the AWGN channel with lattice encoding and decoding. IEEE Transactions on Information Theory October 2004; 50 (10): 2293-2314.
17. Zamir R, Shamai S, Erez U,. Nested linear/lattice codes for structured multiterminal binning. IEEE Transactions on Information Theory June 2002; 48 (6): 1250-1276. (Pubitemid 34759844)
18. Forney GD, Trott MD, Chung S,. Sphere-bound-achieving coset codes and multilevel coset codes. IEEE Transactions on Information Theory May 2000; 46: 820-850.
19. Conway JH, Sloane NJA,. Voronoi regions of lattices, second moments of polytopes, and quantization. IEEE Transactions on Information Theory March 1982; IT-28: 211-226. (Pubitemid 12499774)
20. Nazer B, Gastpar M,. Compute-and-forward: harnessing interference through structured codes. IEEE International Symposium on Information Theory, Toronto, Ontario, Canada,July 2008.
21. Mallik S, Koetter R,. Helpers for cleaning dirty papers. 7th International ITG Conference on Source and Channel Coding (SCC2008), Stadthaus, Ulm, Germany,January 2008.
22. Philosof T, Zamir R,. The rate loss of single letter characterization for the dirty multiple access channel. IEEE Information Theory Workshop (ITW2008), Proto, Portugal, May 2008.
23. Kröner J, Marton K,. How to encode the module-two sum of binary sources. IEEE Transactions on Information Theory March 1979; IT-25 (2): 219-221. (Pubitemid 9443306)
24. Orlitsky A, Roche R,. Coding for computing. IEEE Transactions on Information Theory March 2001; 47 (3): 903-917. (Pubitemid 32425425)
25. Avestimehr S, Diggavi S, Tse D,. A deterministic approach to wireless relay networks. Proceedings of Allerton Conference on Communication, Control, and Computing, Urbana, IL, September 2007.
26. Sanderovich A, Peleg M, Shamai S,. Multipoint decentralized processing of interfered Gaussian channel: scaling laws. Proceedings of 26th IEEE Convention of Electrical and Electronics Engineers in Israel, Eilat, IL,November 2010.
27. Cover TM, Thomas JA,. Elements of Information Theory, John Wiley & Sons, Inc.: City College of New York, 1991.