EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 10 User.
NETCOD 2013 June 7-9, Calgary Broadcast Erasure Channel with Feedback: the Two Multicast Case Algorithms and Bounds Efe Onaran 1, Marios Gatzianas 2 and.
Derives the optimal achievable rate for MISO secondary users under coexistence constraints Proposes practical strategy for cognition and cooperation in.
Cooperative Network Coding
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Prakshep Mehta ( ) Guided By: Prof. R.K. Shevgaonkar
Relaying in networks with multiple sources has new aspects: 1. Relaying messages to one destination increases interference to others 2. Relays can jointly.
Andrea Goldsmith Stanford University DAWN ARO MURI Program Review U.C. Santa Cruz Oct 5, 2009 Joint work with Y. Chang, R. Dabora, D. Gunduz, I. Maric,
Enhancing Secrecy With Channel Knowledge
EE359 – Lecture 16 Outline MIMO Beamforming MIMO Diversity/Multiplexing Tradeoffs MIMO Receiver Design Maximum-Likelihood, Decision Feedback, Sphere Decoder.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Node Cooperation and Cognition in Dynamic Wireless Networks
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
EE360: Lecture 8 Outline Multiuser Detection
Ergodic Capacity of MIMO Relay Channel Bo Wang and Junshan Zhang Dept. of Electrical Engineering Arizona State University Anders Host-Madsen Dept. of Electrical.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Gaussian Interference Channel Capacity to Within One Bit David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 4, 2007 Joint work with Raul Etkin (HP)
EE359 – Lecture 15 Outline Announcements: HW due Friday MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing Tradeoffs.
Breaking Spectrum Gridlock through Cognitive and Cooperative Radios Andrea Goldsmith Stanford University Quantenna Communications, Inc MSR Cognitive Wireless.
EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements Progress reports due today, HW 2 posted March 5 lecture moved to March 7, 12-1:15pm,
Cooperative Diversity Scheme Based on MIMO-OFDM in Small Cell Network Dong-Hyun Ha Sejong University.
EE360: Lecture 12 Outline Underlay and Interweave CRs Announcements HW 1 posted (typos corrected), due Feb. 24 at 5pm Progress reports due Feb. 29 at midnight.
Communication over Bidirectional Links A. Khoshnevis, D. Dash, C Steger, A. Sabharwal TAP/WARP retreat May 11, 2006.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Zukang Shen, Jeffrey Andrews, and Brian Evans
Future Wireless Networks Ubiquitous Communication Among People and Devices Next-generation Cellular Wireless Internet Access Wireless Multimedia Sensor.
8: MIMO II: Capacity and Multiplexing Architectures Fundamentals of Wireless Communication, Tse&Viswanath 1 8. MIMO II: Capacity and Multiplexing Architectures.
Three-layer scheme dominates previous double-layer schemes Distortion-diversity tradeoff provides useful comparison in different operating regions Layered.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
1 Codage avec Information Adjacante (DPC : Dirty paper coding) et certaines de ses applications : Tatouage (Watermarking) MIMO broadcast channels Gholam-Reza.
Cooperative Wireless Networks Hamid Jafarkhani Director Center for Pervasive Communications and Computing
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
EE359 – Lecture 15 Outline Introduction to MIMO Communications MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing.
EE359 – Lecture 14 Outline Announcements: HW posted tomorrow, due next Thursday Will send project feedback this week Practical Issues in Adaptive Modulation.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
EE360: Lecture 9 Outline Announcements Cooperation in Ad Hoc Networks
Interference in MANETs: Friend or Foe? Andrea Goldsmith
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
Space Time Codes. 2 Attenuation in Wireless Channels Path loss: Signals attenuate due to distance Shadowing loss : absorption of radio waves by scattering.
Cognitive Radios Motivation: scarce wireless spectrum
We aim to exploit cognition to maximize network performance What is the side information at a cognitive node? What is the best encoding scheme given this.
Doc.: IEEE hew Submission March 2014 Submission Zhanji Wu, et. Al. Joint Coding and Modulation Diversity with RBD pre-coding MU-MIMO Date:
EE359 – Lecture 15 Outline Announcements: HW posted, due Friday MT exam grading done; l Can pick up from Julia or during TA discussion section tomorrow.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrusts 0 and 1 Metrics and Upper Bounds Muriel Medard, Michelle Effros and.
Cooperative Diversity Using Distributed Turbo Codes Bin Zhao and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
Jayanth Nayak, Ertem Tuncel, Member, IEEE, and Deniz Gündüz, Member, IEEE.
Rate Bounds for MIMO Relay Channels Using Precoding Caleb K. Lo, Sriram Vishwanath and Robert W. Heath, Jr. Wireless Networking and Communications Group.
October 28, 2005 Single User Wireless Scheduling Policies: Opportunism and Optimality Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Scheduling Considerations for Multi-User MIMO
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
March 18, 2005 Network Coding in Interference Networks Brian Smith and Sriram Vishwanath University of Texas at Austin March 18 th, 2005 Conference on.
EE359 – Lecture 16 Outline Announcements Proposals due this Friday, 5pm (create website, url) HW 7 posted today, due 12/1 TA evaluations: 10 bonus.
EE360: Lecture 13 Outline Capacity of Cognitive Radios Announcements Progress reports due Feb. 29 at midnight Overview Achievable rates in Cognitive Radios.
The Capacity of Interference Channels with Partial Transmitter Cooperation Ivana Marić Roy D. Yates Gerhard Kramer Stanford WINLAB, Rutgers Bell Labs Ivana.
Multiple Antennas.
EE359 – Lecture 16 Outline ISI Countermeasures Multicarrier Modulation
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Space Time Codes.
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Ivana Marić, Ron Dabora and Andrea Goldsmith
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Master Thesis Presentation
Jinhua Jiang, Ivana Marić, Andrea Goldsmith, and Shuguang Cui Summary
EE359 – Lecture 18 Outline Announcements Spread Spectrum
Compute-and-Forward Can Buy Secrecy Cheap
Joint Coding and Modulation Diversity with RBD pre-coding MU-MIMO
EE359 – Lecture 19 Outline Multiple Access
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

EE360: Lecture 13 Outline Cognitive Radios and their Capacity Announcements March 5 lecture moved to March 7, 12-1:15pm, Packard 364 Poster session scheduling (90 min): T 3/11: 12pm or 4pm; W 3/12: 4:30pm, F 3/14 12pm or 5pm. Overlay cognitive radios Overlay cognitive radios with MIMO Broadcast channels with cognitive relays Capacity versus robustness

Overlay Systems Cognitive user has knowledge of other user’s message and/or encoding strategy Used to help noncognitive transmission Used to presubtract noncognitive interference RX1 RX2 NCR CR

Transmission Strategy “Pieces” Rate splitting Precoding against interference at CR TX Cooperation at CR TX Precoding against interference at CR TX To allow each receiver to decode part of the other node’s message  reduces interference Removes the NCR interference at the CR RX To help in sending NCR’s message to its RX Must optimally combine these approaches “Achievable Rates in Cognitive Radios” by Devroye, Mitran, Tarokh

4 Results around 2007 b a 1 1 weak strong interference For Gaussian channel with P 1 =P 2 Wu et.al. Joviċić et.al. New encoding scheme uses same techniques as previous work: rate splitting, G-P precoding against interference and cooperation Differences: More general scheme than the one that suffices in weak interference Different binning than the one proposed by [Devroye et.al] and [Jiang et.al.] M.,Y.,K

Improved Scheme Transmission for Achievable Rates Rate split NCR CR The NCR uses single-user encoder The CR uses - Rate-splitting to allow receiver 2 to decode part of cognitive user’s message and thus reduce interference at that receiver - Precoding while treating the codebook for user 2 as interference to improve rate to its own receiver - Cooperation to increase rate to receiver 2 RX1 RX2 NCR CR

6 for input distributions that factor as Outer Bound The set of rate triples (R 0, R 1,R 2 ) satisfying For R 2 =0, U 2 =Ø, and by redefining R 0 as R 2 : outer bound for the IC with full cooperation

7 Outer Bound: Full Cooperation The exact same form as the Nair-El Gamal outer bound on the broadcast channel capacity The difference is in the factorization of the input distribution reflecting the fact that only one-way cooperation is possible The set of rate triples (R 0, R 1,R 2 ) satisfying for input distributions that factor as

Summary of new technique How far are the achievable rates from the outer bound? Capacity for other regimes? Achievable rates: combine rate splitting precoding against interference at encoder 1 cooperation at encoder 1 Outer bound Follows from standard approach: invoke Fano’s inequality Reduces to outer bound for full cooperation for R 2 =0 Has to be evaluated for specific channels

Performance Gains from Cognitive Encoding CR broadcast bound outer bound this scheme DMT schemes

Insights Orthogonalizing transmissions is suboptimal Canceling strong interference is beneficial Cooperation can be exploited Rate-splitting can be used for partially canceling interference Precoding against interference can be exploited RX1 RX2 NCR CR

Cognitive MIMO Networks Coexistence conditions: Noncognitive user unaware of secondary users Cognitive user doesn’t impact rate of noncognitive user Encoding rule for the cognitive encoder: Generates codeword for primary user message Generates codeword for its message using dirty paper coding Two codewords superimposed to form final codeword NC TX C TX NC RX C RX RX1 RX2 CR NCR

Achievable rates (2 users) For MISO secondary users, beamforming is optimal Maximum achievable rate obtained by solving Closed-form relationship between primary/secondary user rates.

MIMO cognitive users (2 Users) Propose two (suboptimal) cognitive strategies D-SVD Precode based on SVD of cognitive user’s channel P-SVD Project cognitive user’s channel onto null space between C TX and NC RX, then perform SVD on projection

Multi-user Cognitive MIMO Networks Achievable rates with two primary users Cognitive MIMO network with multiple primary users Extend analysis to multiple primary users Assume each transmitter broadcasts to multiple users Primary receivers have one antenna Secondary users are MISO. Main Result: With appropriate power allocation among primary receivers, the secondary users achieve their maximum possible rate.

Other Overlay Systems Cognitive relays Cognitive Relay 1 Cognitive Relay 2 Cognitive BSs

Broadcast Channel with Cognitive Relays (BCCR) Enhance capacity via cognitive relays Cognitive relays overhear the source messages Cognitive relays then cooperate with the transmitter in the transmission of the source messages data Source Cognitive Relay 1 Cognitive Relay 2

Channel Model Sender (Base Station) wishes to send two independent messages to two receivers Messages uniformly generated Each cognitive relay knows only one of the messages to send

Coding Scheme for the BCCR Each message split into two parts: common and private Cognitive relays cooperate with the base station to transmit the respective common messages Each private message encoded with two layers l Inner layer exposed to the respective relay l Outer layer pre-codes for interference (GGP coding)

Achievable Rate Region Joint probability distribution Achievable rate region: all rates (R 12 +R 11,R 21 +R 22 ) s.t.

Generality of the Result Without the cognitive relays BCCR reduces to a generic BC Correspondingly, rate region reduces to Marton’s region for the BC (best region to date for the BCs) Without the base station BCCR reduces to an IC Correspondingly, rate region reduces to the Han- Kobayashi Region for the IC (best region for ICs)

Improved Robustness Without cognitive relays When base station is gone, the entire transmission is dead With cognitive relays When base station is gone, cognitive relays can pick up the role of base station, and the ongoing transmission continues Cognitive relays and the receivers form an interference channel data Source

A Numerical Example Special Gaussian configuration with a single cognitive relay, Rate region for this special case (obtained from region for BCCR)

A Numerical Example No existing rate region can be specialized to this region for the example except [Sridharan et al’08] This rate region also demonstrates strict improvement over one of the best known region for the cognitive radio channel ([Jiang-Xin’08] and [Maric et al’08]) Channel parameters: a = 0.5, b = 1.5; P 1 = 6, P 2 = 6;

Overlay Challenges Complexity of transmission and detection Obtaining information about channel, other user’s messages, etc. Full-duplex vs. half duplex Synchronization And many more …

Summary Overlay techniques substantially increase capacity Can be applied to many types of systems Cognitive networks Ad hoc networks Cellular systems Hybrid systems Uses all “tricks” from BC, MAC, interference channels More details on channel capacity in tutorial paper (to be presented) and Chapter 2 of “Principles of Cognitive Radio”: to be posted Very interesting to reduce these ideas to practice: much room for innovation

Student Presentation “Blind Null Space Learning” By Alexandros Manolakos