Half-Duplex Gaussian Relay Networks with Interference Processing Relays
|
|
- Diane Ford
- 5 years ago
- Views:
Transcription
1 Half-Duplex Gaussian Relay Networks with Interference Processing Relays Bama Muthuramalingam Srikrishna Bhashyam Andrew Thangaraj Department of Electrical Engineering Indian Institute of Technology Madras Dec 2010 Srikrishna Bhashyam (IIT Madras) Dec / 26
2 Wireless Relay Networks Single shared resource wireless channel Wireless systems: Time-variations, Interference Relaying important in spectrally efficient wireless networks Srikrishna Bhashyam (IIT Madras) Dec / 26
3 Relaying: What is known/unknown? Single source-destination pair Gaussian relay networks Capacity unknown for arbitrary topology Cut-set upper bound Achievable rates for specific protocols and topologies Appproximate capacity Srikrishna Bhashyam (IIT Madras) Dec / 26
4 Wireless Relaying: Assumptions and Results Duplex SNR Cooperation Topology Full Large MIMO Arbitrary, Directed Half All Limited Restricted No MIMO Arbitrary Srikrishna Bhashyam (IIT Madras) Dec / 26
5 Wireless Relaying: Assumptions and Results Duplex SNR Cooperation Topology Full Large MIMO Arbitrary, Directed Half All Limited Restricted No MIMO Arbitrary [Avestimehr et al] Both, Large SNR, MIMO, Arbitrary directed Constant gap to capacity [Sreeram et al] Both, Large SNR, MIMO, Arbitrary Diversity-multiplexing trade-off [Chang et al] Half duplex, All SNR, Limited, Restricted Rates close to capacity [Bagheri et al] Half duplex, All SNR, No MIMO, Restricted Constant gap to capacity Srikrishna Bhashyam (IIT Madras) Dec / 26
6 Our Assumptions Half-duplex All SNR No MIMO/Limited cooperation Restricted, arbitrary Decode-and-Forward Srikrishna Bhashyam (IIT Madras) Dec / 26
7 Our Work Multistage relaying Heuristic scheduling of states + Coding for interference networks Flow optimization Interference processing vs. Interference avoidance Strong and weak interference conditions Srikrishna Bhashyam (IIT Madras) Dec / 26
8 States of a Half-Duplex Network Each node: Transmit, Receive, or Idle Each state is an interference network Srikrishna Bhashyam (IIT Madras) Dec / 26
9 Choice of States: Observations Interference Avoidance Only one node can transmit at any time Interference Processing Source should be in transmit mode Destination should be in receive mode Relays should be in both transmit and receive modes Required for information flow Atleast two node-disjoint paths required for source to be transmitting in all chosen states Srikrishna Bhashyam (IIT Madras) Dec / 26
10 Two-Path Two-State Schedule Shortest (three-hop) paths connecting S and D Path P1: S 2 4 D Path P2: S 3 5 D Path P3: S 2 5 D Path P4: S 3 4 D. Only two pairs of node-disjoint paths: (P1, P2) and (P3, P4). States from (P1, P2): State S1: Nodes S, 3, 4 transmit, Nodes 2, 5, D receive State S2: Nodes S, 2, 5 transmit, Nodes 3, 4, D receive Srikrishna Bhashyam (IIT Madras) Dec / 26
11 Coding for each state M N interference network [Carleial1978] Possible message from each transmitter to each subset of receivers M(2 N 1) possible rates M user Interference channel M possible messages (M rates) Achievable rate regions based on Superposition Successive interference cancellation Dirty paper coding Srikrishna Bhashyam (IIT Madras) Dec / 26
12 Common Broadcast (CB) Rate limited by weakest link Receivers employ SIC/MAC decoding Srikrishna Bhashyam (IIT Madras) Dec / 26
13 Superposition Coding (SC) Transmitters send superposed codewords Constraints involve power allocation parameters (non-linear) Larger rate region than CB Srikrishna Bhashyam (IIT Madras) Dec / 26
14 Dirty paper coding (DPC) at the source Source: origin for all messages; knows m 3 and m 4 Source does DPC to eliminate interference at receiver 2 Can be combined with CB or SC at other transmitters Srikrishna Bhashyam (IIT Madras) Dec / 26
15 Coding for the Two-Stage Relay Example DPC-SC State S1: Nodes S (1), 3, 4 transmit, Nodes 2, 5, D (6) receive Node S: Transmit to Node 2 using DPC Node 3: Transmit to Node 5 Node 4: Transmit to Nodes 5 and D using SC Srikrishna Bhashyam (IIT Madras) Dec / 26
16 Flow Optimization Joint optimization problem Scheduling constraints maximize Rate subject to State k is ON for λ k units of time Total transmission time is one unit Rate region constraints appropriate rate region depending on the coding scheme Flow constraints Total flow in a link (i, j) = k flow in link (i, j) in state k Outgoing flow from Node i - Incoming flow to Node i = Rate, if i = S, -Rate, if i = D, 0, otherwise. Srikrishna Bhashyam (IIT Madras) Dec / 26
17 Two-Stage Relay Flow optimization: DPC-SC z 1 2 z 1 4 (1 )z 1 + βz 2 1 S z 2 βz 2 z 1 6 D (1 β)z 2 + z 1 3 z 2 5 Link in State S 1 Link in State S 2 Srikrishna Bhashyam (IIT Madras) Dec / 26
18 Two-Stage Relay Flow optimization max R = z 1 + z 2, 0 λ 1,λ 2,,β 1 subject to rate constraints Flow in each link less than average rate z 1 λ 1 R S2, z 1 λ 2 R 24, z 2 λ 2 R S3, z 2 λ 1 R 35, (1 )z 1 + βz 2 λ 1 R 4D, (1 β)z 2 + z 2 λ 2 R 5D, z 1 λ 1 R 45, βz 2 λ 2 R 54, Scheduling constraint: 0 λ 1 + λ 2 1 Rates chosen according to rate region of interference network (R S2, R 35, R 45, R 4D ) R 1, (R S3, R 24, R 54, R 5D ) R 2. Srikrishna Bhashyam (IIT Madras) Dec / 26
19 Cut-Set Upper Bound S D Ω Ω c Full Duplex Network 1 R Half Duplex Network 2 R sup λ k min Ω min Ω I (X Ω ; Y Ωc X Ωc ). M k=1 λ k I (X(k) Ω ; Y (k) Ωc Ωc X(k) ). 1 T. Cover et al, Elements of information theory, John Wiley 2 M. Khojestepour,et al,,bounds on achievable rates for general multiterminal n/ws with practical constraints, IPSN, 2003 Srikrishna Bhashyam (IIT Madras) Dec / 26
20 Numerical Results Parameters: R 1 R 3 2 β 4 Tx power, P = 3 units Noise variance, σ 2 = 1 Variable channel gains S 1 δ 3 β 5 δ 6 D R 2 R 4 Comparison: Interference avoidance throughput - Lower bound Upper bound Achievable rates of the proposed relaying schemes Srikrishna Bhashyam (IIT Madras) Dec / 26
21 Two Stage Relay Network - vary β = δ, = 1, = 1 Achievable Rate Bound CB SC DPC CB DPC SC IA Lower bound (DPC CB) = 1.99 db Lower bound (CB) = 5.01 db Upper bounds Cut-Set bound = C(2 2 P) = 1.40 Source rate C( 2 P) = δ = β (db) Srikrishna Bhashyam (IIT Madras) Dec / 26
22 Two Stage Relay Network - vary β = δ, = 1, = 1 Achievable Rate Bound CB SC DPC CB DPC SC IA Lower bound (DPC CB) = 1.99 db Lower bound (CB) = 5.01 db Upper bounds Cut-Set bound = C(2 2 P) = 1.40 Source rate C( 2 P) = 1 Large β Strong interference S R 1 R 3 D, S R 2 R 4 D δ = β (db) Srikrishna Bhashyam (IIT Madras) Dec / 26
23 Two Stage Relay Network - vary β = δ, = 1, = 1 Achievable Rate Bound CB SC DPC CB DPC SC IA Lower bound (DPC CB) = 1.99 db δ = β (db) Lower bound (CB) = 5.01 db Upper bounds Cut-Set bound = C(2 2 P) = 1.40 Source rate C( 2 P) = 1 Large β Strong interference S R 1 R 3 D, S R 2 R 4 D Small β S R 1 R 4 D, S R 2 R 3 D Srikrishna Bhashyam (IIT Madras) Dec / 26
24 Two Stage Relay Network - vary β = δ, = 1, = 1 Achievable Rate Bound CB SC DPC CB DPC SC IA Lower bound (DPC CB) = 1.99 db δ = β (db) Lower bound (CB) = 5.01 db Upper bounds Cut-Set bound = C(2 2 P) = 1.40 Source rate C( 2 P) = 1 Large β Strong interference S R 1 R 3 D, S R 2 R 4 D Small β S R 1 R 4 D, S R 2 R 3 D β = 0 db DPC is better SC and CB are same Srikrishna Bhashyam (IIT Madras) Dec / 26
25 Two Stage Relay Network - vary β = δ, = 1, = 1 Achievable Rate Bound CB SC DPC CB DPC SC IA Lower bound (DPC CB) = 1.99 db δ = β (db) Lower bound (CB) = 5.01 db Upper bounds Cut-Set bound = C(2 2 P) = 1.40 Source rate C( 2 P) = 1 Large β Strong interference S R 1 R 3 D, S R 2 R 4 D Small β S R 1 R 4 D, S R 2 R 3 D β = 0 db DPC is better SC and CB are same HD relaying meets the bound for some channel gains Srikrishna Bhashyam (IIT Madras) Dec / 26
26 Strong Interference h 46, h 56 2-user MAC: 2C( 2 P) C(2h 2 min P) where h min = min ( h 45, h 35 ) Srikrishna Bhashyam (IIT Madras) Dec / 26
27 Weak Interference h 46, h 56 2-user MAC: C( 2 P) C ( ) h 2 35 P 1+h45 2 P Srikrishna Bhashyam (IIT Madras) Dec / 26
28 Strong and Weak Interference Bounds Weak interference bound = 3.63 db Strong interference bound = 2.68 db (A) Achievable Rate Weak interference condition not satisfied Strong interference bound = 0.88 db (B) Bound MDF Protocol (db) (A): h 23 = h 25 = h 45 = h 34 =, h S2 = h S3 = h 5D = h 4D = 1, h 24 = h 35 = 1.25 (B): h 23 = h 25 = h 45 = h 34 = h 5D =, h S2 = h S3 = h 24 = h 35 = h 4D = 0.58 Srikrishna Bhashyam (IIT Madras) Dec / 26
29 Grid network Source Sink 8 β β β β β β β β β Three states S D β β D S β β S D β Srikrishna Bhashyam (IIT Madras) Dec / 26
30 Performance in Grid Network, β = 1, = 1, vary 1.5 Achievable Rate Bound CB SC DPC CB DPC SC IA (db) Srikrishna Bhashyam (IIT Madras) Dec / 26
31 Summary States of a relay network as interference networks Scheduling of states using path heuristic Interference processing receivers at the relays No cooperative decoding between relays Strong and weak interference conditions on channel gains Srikrishna Bhashyam (IIT Madras) Dec / 26
Information Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results
Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel
More informationTrust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems
Introduction Main Results Simulation Conclusions Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Mojtaba Vaezi joint work with H. Inaltekin, W. Shin, H. V. Poor, and
More informationPhysical-Layer MIMO Relaying
Model Gaussian SISO MIMO Gauss.-BC General. Physical-Layer MIMO Relaying Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv University August 5, 2011 Model Gaussian
More informationMulti-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering
Multi-User Communication: Capacity, Duality, and Cooperation Niar Jindal Stanford University Dept. of Electrical Engineering February 3, 004 Wireless Communication Vision Cellular Networks Wireless LAN
More informationCapacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming
Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming Authors: Christian Lameiro, Alfredo Nazábal, Fouad Gholam, Javier Vía and Ignacio Santamaría University of Cantabria,
More informationComparison of Full-Duplex and Half-Duplex Modes with a Fixed Amplify-and-Forward Relay
Comparison of Full-Duplex and Half-Duplex Modes with a Fixed Amplify-and-Forward Relay Taneli Riihonen, Stefan Werner, and Risto Wichman Helsinki University of Technology, Finland IEEE WCNC, Budapest,
More informationIN this paper, we show that the scalar Gaussian multiple-access
768 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 On the Duality of Gaussian Multiple-Access and Broadcast Channels Nihar Jindal, Student Member, IEEE, Sriram Vishwanath, and Andrea
More informationIncremental Coding over MIMO Channels
Model Rateless SISO MIMO Applications Summary Incremental Coding over MIMO Channels Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv University Gregory W. Wornell,
More informationAnatoly Khina. Joint work with: Uri Erez, Ayal Hitron, Idan Livni TAU Yuval Kochman HUJI Gregory W. Wornell MIT
Network Modulation: Transmission Technique for MIMO Networks Anatoly Khina Joint work with: Uri Erez, Ayal Hitron, Idan Livni TAU Yuval Kochman HUJI Gregory W. Wornell MIT ACC Workshop, Feder Family Award
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationSecrecy Outage Performance of Cooperative Relay Network With Diversity Combining
Secrecy Outage erformance of Cooperative Relay Network With Diversity Combining Khyati Chopra Dept. of lectrical ngineering Indian Institute of Technology, Delhi New Delhi-110016, India mail: eez148071@ee.iitd.ac.in
More informationSecrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View
Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View P. Mohapatra 9 th March 2013 Outline Motivation Problem statement Achievable scheme 1 Weak interference
More informationInteractive Interference Alignment
Interactive Interference Alignment Quan Geng, Sreeram annan, and Pramod Viswanath Coordinated Science Laboratory and Dept. of ECE University of Illinois, Urbana-Champaign, IL 61801 Email: {geng5, kannan1,
More informationGraph-based Codes for Quantize-Map-and-Forward Relaying
20 IEEE Information Theory Workshop Graph-based Codes for Quantize-Map-and-Forward Relaying Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli and Suhas Diggavi EPFL, Switzerland, UCLA,
More informationInterference Channels with Source Cooperation
Interference Channels with Source Cooperation arxiv:95.319v1 [cs.it] 19 May 29 Vinod Prabhakaran and Pramod Viswanath Coordinated Science Laboratory University of Illinois, Urbana-Champaign Urbana, IL
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationMulti-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems
Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User
More informationK User Interference Channel with Backhaul
1 K User Interference Channel with Backhaul Cooperation: DoF vs. Backhaul Load Trade Off Borna Kananian,, Mohammad A. Maddah-Ali,, Babak H. Khalaj, Department of Electrical Engineering, Sharif University
More informationRematch and Forward: Joint Source-Channel Coding for Communications
Background ρ = 1 Colored Problem Extensions Rematch and Forward: Joint Source-Channel Coding for Communications Anatoly Khina Joint work with: Yuval Kochman, Uri Erez, Ram Zamir Dept. EE - Systems, Tel
More informationSum Capacity of General Deterministic Interference Channel with Channel Output Feedback
Sum Capacity of General Deterministic Interference Channel with Channel Output Feedback Achaleshwar Sahai Department of ECE, Rice University, Houston, TX 775. as27@rice.edu Vaneet Aggarwal Department of
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 11, NOVEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 11, NOVEMBER 2016 7357 Buffer-Aided Diamond Relay Network With Block Fading and Inter-Relay Interference Renato Simoni, Vahid Jamali, Student
More informationCognitive Multiple Access Networks
Cognitive Multiple Access Networks Natasha Devroye Email: ndevroye@deas.harvard.edu Patrick Mitran Email: mitran@deas.harvard.edu Vahid Tarokh Email: vahid@deas.harvard.edu Abstract A cognitive radio can
More informationApproximate capacity region of the two-pair bidirectional Gaussian relay network
Approximate capacity region of the two-pair bidirectional Gaussian relay network Aydin Sezgin UC Irvine CA USA asezgin@uci.edu M. Amin Khajehnejad Caltech Pasadena CA USA amin@caltech.edu A. Salman Avestimehr
More informationOn the Capacity of the Two-Hop Half-Duplex Relay Channel
On the Capacity of the Two-Hop Half-Duplex Relay Channel Nikola Zlatanov, Vahid Jamali, and Robert Schober University of British Columbia, Vancouver, Canada, and Friedrich-Alexander-University Erlangen-Nürnberg,
More informationMegaMIMO: Scaling Wireless Throughput with the Number of Users. Hariharan Rahul, Swarun Kumar and Dina Katabi
MegaMIMO: Scaling Wireless Throughput with the Number of Users Hariharan Rahul, Swarun Kumar and Dina Katabi There is a Looming Wireless Capacity Crunch Given the trends in the growth of wireless demand,
More informationMulti-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems
Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User
More informationA Comparison of Cooperative Transmission Schemes for the Multiple Access Relay Channel
A Comparison of Cooperative Transmission Schemes for the ultiple Access elay Channel André Angierski andre.angierski@uni-rostock.de 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING
More informationOn Network Interference Management
On Network Interference Management Aleksandar Jovičić, Hua Wang and Pramod Viswanath March 3, 2008 Abstract We study two building-block models of interference-limited wireless networks, motivated by the
More informationTHE practical bottleneck of today s communication networks
1 Interference Channel with Generalized Feedback (a.k.a. with source cooperation: Part I: Achievable Region Shuang (Echo Yang and Daniela Tuninetti Abstract An Interference Channel with Generalized Feedback
More information820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY Stefano Rini, Daniela Tuninetti, and Natasha Devroye
820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY 2012 Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results Stefano Rini, Daniela Tuninetti,
More informationApproximately achieving Gaussian relay. network capacity with lattice-based QMF codes
Approximately achieving Gaussian relay 1 network capacity with lattice-based QMF codes Ayfer Özgür and Suhas Diggavi Abstract In [1], a new relaying strategy, quantize-map-and-forward QMF scheme, has been
More informationDEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE
DEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE Daohua Zhu, A. Lee Swindlehurst, S. Ali A. Fakoorian, Wei Xu, Chunming Zhao National Mobile Communications Research Lab, Southeast
More informationBounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
Bounds on Achievable Rates for General Multi-terminal Networs with Practical Constraints Mohammad Ali Khojastepour, Ashutosh Sabharwal, and Behnaam Aazhang Department of Electrical and Computer Engineering
More informationInformation Theory Meets Game Theory on The Interference Channel
Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationApproximate Ergodic Capacity of a Class of Fading Networks
Approximate Ergodic Capacity of a Class of Fading Networks Sang-Woon Jeon, Chien-Yi Wang, and Michael Gastpar School of Computer and Communication Sciences EPFL Lausanne, Switzerland {sangwoon.jeon, chien-yi.wang,
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
More informationL interférence dans les réseaux non filaires
L interférence dans les réseaux non filaires Du contrôle de puissance au codage et alignement Jean-Claude Belfiore Télécom ParisTech 7 mars 2013 Séminaire Comelec Parts Part 1 Part 2 Part 3 Part 4 Part
More informationOn the Capacity Region of the Gaussian Z-channel
On the Capacity Region of the Gaussian Z-channel Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@eng.umd.edu ulukus@eng.umd.edu
More informationThe Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference
The Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference Soheyl Gherekhloo, Anas Chaaban, and Aydin Sezgin Chair of Communication Systems RUB, Germany Email: {soheyl.gherekhloo,
More informationTime-division multiplexing for green broadcasting
Time-division multiplexing for green broadcasting Pulkit Grover and Anant Sahai Wireless Foundations, Department of EECS University of California at Berkeley Email: {pulkit, sahai} @ eecs.berkeley.edu
More informationA digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model
A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model M. Anand, Student Member, IEEE, and P. R. Kumar, Fellow, IEEE Abstract For every Gaussian
More informationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)
More informationLimited Feedback in Wireless Communication Systems
Limited Feedback in Wireless Communication Systems - Summary of An Overview of Limited Feedback in Wireless Communication Systems Gwanmo Ku May 14, 17, and 21, 2013 Outline Transmitter Ant. 1 Channel N
More informationError Exponent Region for Gaussian Broadcast Channels
Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationAdaptive Successive Transmission in Virtual Full-Duplex Cooperative NOMA
Adaptive Successive Transmission in Virtual Full-Duplex Cooperative NOMA Young-bin Kim Future Access Network Division KDDI Research, Inc Fujimino-shi, Japan yo-kim@kddi-researchjp Kosuke Yamazaki Future
More informationOn the Capacity of the Interference Channel with a Relay
On the Capacity of the Interference Channel with a Relay Ivana Marić, Ron Dabora and Andrea Goldsmith Stanford University, Stanford, CA {ivanam,ron,andrea}@wsl.stanford.edu Abstract Capacity gains due
More informationApproximate Sum-Capacity of Full- and Half-Duplex Asymmetric Interference Channels with Unilateral Source Cooperation
1 Approximate Sum-Capacity of Full- and Half-Duplex Asymmetric Interference Channels with Unilateral Source Cooperation Martina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim Eurecom, Sophia Antipolis,
More informationClean relaying aided cognitive radio under the coexistence constraint
Clean relaying aided cognitive radio under the coexistence constraint Pin-Hsun Lin, Shih-Chun Lin, Hsuan-Jung Su and Y.-W. Peter Hong Abstract arxiv:04.3497v [cs.it] 8 Apr 0 We consider the interference-mitigation
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationLecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO
More informationOn Source-Channel Communication in Networks
On Source-Channel Communication in Networks Michael Gastpar Department of EECS University of California, Berkeley gastpar@eecs.berkeley.edu DIMACS: March 17, 2003. Outline 1. Source-Channel Communication
More informationA Comparison of Two Achievable Rate Regions for the Interference Channel
A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationHarnessing Interaction in Bursty Interference Networks
215 IEEE Hong Kong-Taiwan Joint Workshop on Information Theory and Communications Harnessing Interaction in Bursty Interference Networks I-Hsiang Wang NIC Lab, NTU GICE 1/19, 215 Modern Wireless: Grand
More informationDiversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks Shuangqing Wei Abstract Synchronization of relay nodes is an important and critical issue in exploiting cooperative
More informationDuality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels
2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar
More informationMax-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference
1 Max-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference Ioannis Kriidis, Member, IEEE, John S. Thompson, Member, IEEE, Steve McLaughlin, Senior Member, IEEE, and Norbert Goertz,
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationOutage Capacity of the Fading Relay Channel in the Low SNR Regime
Outage Capacity of the Fading Relay Channel in the Low SNR Regime Amir Salman Avestimehr Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2006-36
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationEnergy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels
Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels Shuangqing Wei, Ragopal Kannan, Sitharama Iyengar and Nageswara S. Rao Abstract In this paper, we first provide
More informationOn the K-user Cognitive Interference Channel with Cumulative Message Sharing Sum-Capacity
03 EEE nternational Symposium on nformation Theory On the K-user Cognitive nterference Channel with Cumulative Message Sharing Sum-Capacity Diana Maamari, Daniela Tuninetti and Natasha Devroye Department
More informationA Coding Strategy for Wireless Networks with no Channel Information
A Coding Strategy for Wireless Networks with no Channel Information Frédérique Oggier and Babak Hassibi Abstract In this paper, we present a coding strategy for wireless relay networks, where we assume
More informationSpatial and Temporal Power Allocation for MISO Systems with Delayed Feedback
Spatial and Temporal Power Allocation for MISO Systems with Delayed Feedback Venkata Sreekanta Annapureddy 1 Srikrishna Bhashyam 2 1 Department of Electrical and Computer Engineering University of Illinois
More informationPrimary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel
Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel Stefano Rini, Ernest Kurniawan and Andrea Goldsmith Technische Universität München, Munich, Germany, Stanford University,
More informationOptimal Utility-Lifetime Trade-off in Self-regulating Wireless Sensor Networks: A Distributed Approach
Optimal Utility-Lifetime Trade-off in Self-regulating Wireless Sensor Networks: A Distributed Approach Hithesh Nama, WINLAB, Rutgers University Dr. Narayan Mandayam, WINLAB, Rutgers University Joint work
More informationMulti-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design K Sreeram Department of ECE Indian Institute of Science Bangalore, India Email: sreeramkannan@eceiiscernetin
More informationRandom Access Protocols for Massive MIMO
Random Access Protocols for Massive MIMO Elisabeth de Carvalho Jesper H. Sørensen Petar Popovski Aalborg University Denmark Emil Björnson Erik G. Larsson Linköping University Sweden 2016 Tyrrhenian International
More informationTraining-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks J Harshan Dept of ECE, Indian Institute of Science Bangalore 56001, India Email: harshan@eceiiscernetin B Sundar Rajan
More informationDegrees of freedom of wireless interference network
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 2011 Degrees of freedom of wireless interference network Lei Ke Iowa State University Follow this and additional
More informationCooperative Interference Alignment for the Multiple Access Channel
1 Cooperative Interference Alignment for the Multiple Access Channel Theodoros Tsiligkaridis, Member, IEEE Abstract Interference alignment (IA) has emerged as a promising technique for the interference
More informationOptimal Power Allocation for Parallel Gaussian Broadcast Channels with Independent and Common Information
SUBMIED O IEEE INERNAIONAL SYMPOSIUM ON INFORMAION HEORY, DE. 23 1 Optimal Power Allocation for Parallel Gaussian Broadcast hannels with Independent and ommon Information Nihar Jindal and Andrea Goldsmith
More informationCommon Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel
Wang, ISIT 2011 p. 1/15 Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel Chih-Chun Wang, Jaemin Han Center of Wireless Systems and Applications (CWSA) School
More informationResource Allocation for Wireless Fading Relay Channels: Max-Min Solution 1 2
Submitted to IEEE Trans. Inform. Theory, Special Issue on Models, Theory and odes for elaying and ooperation in ommunication Networs, Aug. 2006, revised Jan. 2007 esource Allocation for Wireless Fading
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationCapacity bounds for multiple access-cognitive interference channel
Mirmohseni et al. EURASIP Journal on Wireless Communications and Networking, :5 http://jwcn.eurasipjournals.com/content///5 RESEARCH Open Access Capacity bounds for multiple access-cognitive interference
More informationThe Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference
The and The Binary Dirty Multiple Access Channel with Common Interference Dept. EE - Systems, Tel Aviv University, Tel Aviv, Israel April 25th, 2010 M.Sc. Presentation The B/G Model Compound CSI Smart
More informationContinuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks
Continuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks Husheng Li 1 and Huaiyu Dai 2 1 Department of Electrical Engineering and Computer
More informationMulti-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. X, NO. X, DECEMBER 007 Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective Melda Yuksel, Student Member, IEEE, and Elza
More informationCommunication Games on the Generalized Gaussian Relay Channel
Communication Games on the Generalized Gaussian Relay Channel Dileep M. alathil Department of Electrical Engineering University of Southern California manisser@usc.edu Rahul Jain EE & ISE Departments University
More informationGaussian Relay Channel Capacity to Within a Fixed Number of Bits
Gaussian Relay Channel Capacity to Within a Fixed Number of Bits Woohyuk Chang, Sae-Young Chung, and Yong H. Lee arxiv:.565v [cs.it] 23 Nov 2 Abstract In this paper, we show that the capacity of the threenode
More informationTransmission Strategies for the Gaussian Parallel Relay Channel. by Seyed Saeed Changiz Rezaei
Transmission Strategies for the Gaussian Parallel Relay Channel by Seyed Saeed Changiz Rezaei A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of
More informationDelay QoS Provisioning and Optimal Resource Allocation for Wireless Networks
Syracuse University SURFACE Dissertations - ALL SURFACE June 2017 Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks Yi Li Syracuse University Follow this and additional works
More informationTwo-Way Training: Optimal Power Allocation for Pilot and Data Transmission
564 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 9, NO. 2, FEBRUARY 200 Two-Way Training: Optimal Power Allocation for Pilot and Data Transmission Xiangyun Zhou, Student Member, IEEE, Tharaka A.
More informationCapacity of All Nine Models of Channel Output Feedback for the Two-user Interference Channel
Capacity of All Nine Models of Channel Output Feedback for the Two-user Interference Channel Achaleshwar Sahai, Vaneet Aggarwal, Melda Yuksel and Ashutosh Sabharwal 1 Abstract arxiv:1104.4805v3 [cs.it]
More informationOn the Power Allocation for Hybrid DF and CF Protocol with Auxiliary Parameter in Fading Relay Channels
On the Power Allocation for Hybrid DF and CF Protocol with Auxiliary Parameter in Fading Relay Channels arxiv:4764v [csit] 4 Dec 4 Zhengchuan Chen, Pingyi Fan, Dapeng Wu and Liquan Shen Tsinghua National
More informationVariable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks
Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks Hideki Ochiai Department of Electrical and Computer Engineering, Yokohama National University 79-5 Tokiwadai, Hodogaya-ku,
More informationCooperative Communication in Spatially Modulated MIMO systems
Cooperative Communication in Spatially Modulated MIMO systems Multimedia Wireless Networks (MWN) Group, Department Of Electrical Engineering, Indian Institute of Technology, Kanpur, India {neerajv,adityaj}@iitk.ac.in
More informationDiversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,
More informationPerformance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks
Communications and Networ, 2010, 2, 87-92 doi:10.4236/cn.2010.22014 Published Online May 2010 (http://www.scirp.org/journal/cn Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless
More informationThe Capacity Region of the Gaussian Cognitive Radio Channels at High SNR
The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR 1 Stefano Rini, Daniela Tuninetti and Natasha Devroye srini2, danielat, devroye @ece.uic.edu University of Illinois at Chicago Abstract
More informationResearch Article Lower Bounds on the Capacity of the Relay Channel with States at the Source
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 009, Article ID 63496, pages doi:101155/009/63496 Research Article Lower Bounds on the Capacity of the Relay
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationPerformance Limits and Design Issues in Wireless Networks
Performance Limits and Design Issues in Wireless Networks Thesis by Amir Farajidana In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology
More informationInformation Theory for Wireless Communications, Part II:
Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the
More informationEfficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel
Efficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel Ahmad Abu Al Haija ECE Department, McGill University, Montreal, QC, Canada Email: ahmad.abualhaija@mail.mcgill.ca
More informationOn Capacity Under Received-Signal Constraints
On Capacity Under Received-Signal Constraints Michael Gastpar Dept. of EECS, University of California, Berkeley, CA 9470-770 gastpar@berkeley.edu Abstract In a world where different systems have to share
More informationInterference Channel aided by an Infrastructure Relay
Interference Channel aided by an Infrastructure Relay Onur Sahin, Osvaldo Simeone, and Elza Erkip *Department of Electrical and Computer Engineering, Polytechnic Institute of New York University, Department
More informationFeedback Capacity of the Gaussian Interference Channel to Within Bits: the Symmetric Case
1 arxiv:0901.3580v1 [cs.it] 23 Jan 2009 Feedback Capacity of the Gaussian Interference Channel to Within 1.7075 Bits: the Symmetric Case Changho Suh and David Tse Wireless Foundations in the Department
More information