The Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference
|
|
- Kory Benson
- 5 years ago
- Views:
Transcription
1 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
2 The
3 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Channels with Side Information at the Transmitter S W Encoder X p(y x, s) Y Decoder Ŵ Channel S - Side information available at Tx. Causal/Non-Causal Side Information Shannon setting: S is known causally at Tx. Gel fand-pinsker setting: S is known non-causally at Tx.
4 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Channels with Side Information at the Transmitter Shannon Setting Capacity ( 58) C causal =max p(t) P(T ) I (T ; Y ) T - the set of all functions ( strategies ) from S to X. Equivalent to a DMC whose inputs are all strategies t T. Uses only the current state s i. (though has access to all past states s i 1 ) Gel fand-pinsker Setting Capacity ( 80) C non-causal =max p(u,x s) {I (U; Y ) I (U; S)} U - auxiliary random variable, which satisfies: U (X, S) Y Both results generalize to continuous alphabets.
5 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Dirty Paper Channel Y = X + S + N S N W Encoder 1 n n i=1 x2 i P X X Y Ŵ Decoder S - interference, known (causally/non-causally) at Tx with average power P S. N -AWGNwithaveragepowerP N.
6 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Dirty Paper Channel Non-Causal Gaussian Side Information (Costa 83) Gaussian interference: S N(0, P S ). Select the auxiliary U = X + αs, X N(0, P X ) independent of S N(0, P S ). Interference does not reduce capacity: C = 1 2 log(1 + SNR) Causal Gaussian Side Information (ESZ 05) Capacity is not known in general. In the limit of high SNR (SNR ): C causal = 1 2πe 2 log (1 + SNR) 12 Extension (Cohen-Lapidoth 02, ZSE 02, ESZ 05) True to arbitrary side information as well.
7 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Lattice Strategies / Tomlinson-Harashima Precoding V U αs Transmitter Receiver Encoder + mod-λ X Channel Decoder N + Y α + X =[v αs U] mod Λ; ( mod [ L 2, L 2) ) U Unif[ L/2, L/2) - dither, known at both ends. v - information baring signal. Y =[αy + U] mod Λ = [v + N eff ] mod Λ, N eff =(1 α)u + αn. Remark In this scheme, P S can be arbitrarily large. S mod-λ Y
8 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Lattice Strategies / Tomlinson-Harashima Precoding Performances SNR eff P X P Neff SNR α MMSE SNR+1 R 1 2 log(snr eff) 1 2 Shaping Loss 1+SNR. 2πe log 12 = 1 2 log(1 + SNR) Causality Loss {}}{ Reducing the causality/shaping loss is possible using multi-dimensional lattices. Requires non-causal knowledge of S. 1 2πe log In the limit of dimension going to infinity, the shaping loss can be avoided. (ZSE 02, ESZ 05) (The Voronoi region approaches a sphere)
9 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Applications of Dirty Paper Coding Model serves as an information-theoretic framework for (known) interference cancellation in: ISI channels. Information embedding. MIMO broadcast channels. Assumption: Tx knows channel gains.
10 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Imperfect Channel Knowledge Perfect channel knowledge is not always available! Why Imperfect Channel Knowledge? Channel estimation errors. Finite feedback. Quantization errors. Finite accuracy. Compound Channel with Side Information Special case of the compound channel with side information problem.
11 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Compound Channel W Encoder X Channel p β (y x, s) β B Y Decoder β is constant and unknown to Tx. Capacity is the same when β is known/unknown at Rx. Compound Achievable rate = worst case over all β values. Capacity (Blackwell-Breiman-Thomasian 59, Dobrushin 59, Wolfowitz 60) C = max inf I β(x ; Y ) p(x) P(X ) β B Remark Generalizes to continuous alphabets. Ŵ
12 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Compound Channels with Side Information at Tx S W Encoder X p β (y x, s) Y Decoder Ŵ Channel Capacity is not known in general. Extending the proof of Gel fand and Pinsker gives upper and lower bounds. Bounds do not coincide due to the presence of feedback Y1 i 1 in U.
13 B/G Model Compound CSI Smart Rx Smart Tx MIMO DPC THP Motivation Compound Compound GP Compound Channels with Side Information at Tx Upper and Lower Bounds for Non-Causal Side Information (Mitran-Devroye-Tarokh 06) C l C C u C l = max inf [I β(u; Y W ) I (U; S W )] p(u x,s,w)p(x s,w)p(w) β B C u = max inf max [I β(u; Y W ) I β (U; S W )] p(x s,w)p(w) β B p β (u x,s,w)
14 B/G Model Compound CSI Smart Rx Smart Tx MIMO Perfect DP Compound DP Dirty Paper Channel Dirty paper channel with perfect channel knowledge: Y = X + S + N S β S N W Encoder 1 n n i=1 x2 i P X X Y Ŵ Decoder SNR P X P N β [1 Δ, 1 + Δ] is known to Rx but not to Tx. SIR P X P S β constant (non-ergodic) for whole transmission. Constant (non-ergodic) for whole transmission.
15 B/G Model Compound CSI Smart Rx Smart Tx MIMO Perfect DP Compound DP Compound Dirty Paper Channel Dirty paper channel with imperfect channel knowledge: Y = X + S β + N S N 1 β W Encoder X Y Decoder Ŵ 1 n n i=1 x2 i P X β [1 Δ, 1 + Δ] - Compound. Constant (non-ergodic) for whole transmission. β is known to Rx but not to Tx. Compound Achievable rate = worst case over all β values.
16 B/G Model Compound CSI Smart Rx Smart Tx MIMO THP Compound Channel with Causal Side Information Non-Causal Side Information Gives upper and lower bounds (Mitran et al. 06). Causal Side Information Extension of Shannon s technique works! Capacity: C casual = max inf I β(t ; Y ) p(t) P(T ) β B Strategies from the current state only (s i ) need to be considered. Non Single-Letter Expression for Non-Causal Side Information 1 k I β(t; Y) C non casual = lim sup k max inf p(t) β
17 B/G Model Compound CSI Smart Rx Smart Tx MIMO THP Back to the Compound Dirty Paper Channel... Scalar Lattice Strategies We focus first on scalar (one-dim.) lattice strategies. Remark α is used at both ends (Tx and Rx). Transmitter Knows β The problem reduces to classical DPC case (β 1). Transmitter Does NOT know β What is the best strategy? Work as before? ( Naïve Approach ) Can receiver do better? ( Smart Rx ) Can transmitter do better? ( Smart Tx )
18 B/G Model Compound CSI Smart Rx Smart Tx MIMO Naïve Approach Work as Before Transmitter X =[v αs U] mod Λ. Receiver Remark Y =[αy + U] mod Λ = [v + N β eff ] mod Λ, 1) =(1 α)u + α(β S + αn. β N β eff P S R =0 even when SNR and for any value of α! What can we do?
19 B/G Model Compound CSI Smart Rx Smart Tx MIMO Scheme Performances Moral Smart Receiver Distinguish between α R T Transmitter X =[v α T S U] mod Λ. Receiver Y =[α R Y + U] mod Λ = [v + N β eff ] mod Λ, N β eff =(1 α R)U +(α T β α R ) S β + α RN. Remarks α R = α T - Bad! For time being, we optimize w.r.t. SNR wc eff.
20 B/G Model Compound CSI Smart Rx Smart Tx MIMO Scheme Performances Moral Naïve Approach SNR eff = λ Naïve (β)(1 + SNR) 1 λ Naïve (β) (1 β)2 Smart Rx (MMSE Estimation) SIR + SNR SIR SNR eff = λ(β)(1 + SNR) λ MMSE (β) α MMSE R = 1+ 1 SIR + 1 SNR 1+ 1 SIR + 1 SNR + SNR SIR (1 β)2 αmmse T β 1+ SIR 1+ 1 SIR + 1 SNR
21 B/G Model Compound CSI Smart Rx Smart Tx MIMO Scheme Performances Moral High SNR Limit α T 1. α MMSE R = 1+ β SIR 1+ 1 SIR = SIR+β SIR+1. Optimized α R SNR wc eff = 1+SIR (1 β) 2. Non-Optimized α R SNR wc eff = SIR (1 β) 2. Strong interference: (SIR 0) Smart Rx achieves positive rates!
22 B/G Model Compound CSI Smart Rx Smart Tx MIMO Scheme Performances Moral Example: SIR = 1, Δ=1/ Ignoring β MMSE Estimation SINR [db] SNR [db] Remark Even for SIR = 1, the gain is 3dB, in the limit of high SNR.
23 B/G Model Compound CSI Smart Rx Smart Tx MIMO Scheme Performances Moral Moral Conclusions In the high SNR regime, the scheme is interference limited due to β. But... Ignoring β at Rx is suboptimal and could lead to significant rate losses. For large S, Rx partially compensates for ignorance of Tx. max SNR wc eff criterion max MI criterion Achievable Rate of (Deterministic) THP Strategies R d THP =max α T 1 min max β α R ( ε(β,α T,α R ) h N β eff,g 2 log(snr eff)+ε(β,α T,α R ) 1 2 log ) ( ) h N β eff and N β eff,g is Gaussian with the same power as Nβ eff. ( ) 2πe, 12
24 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Smart Transmitter So far - Smart Rx. Tx does not know β, but is aware of its ignorance... Can Tx do better? How about Guessing β? α T varies from symbol to symbol. Common Randomness: for any α T,Rxusesoptimalα R as previously. Increases (worsens) the MSE. Improves the mutual-information.
25 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Motivation Effective Noise Expression (Reminder) Setting N β eff =(1 α R)U +(α T β α R ) S β + α RN Concentrate on SIR 0andSNR. Model as a noiseless channel (N = 0). All noise is self noise : Y =[v + N β eff ] mod Λ N β eff = α β α U Remarks True for multi-dimensional lattices as well. Capacity would be infinite if β were known at Tx!
26 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Motivation Example (B =2) β {1 ± Δ} α T 1 minimizes the MSE but achieves a finite rate. P(α T =1 Δ) = P(α T =1+Δ)=0.5 obtains a larger MSE, but achieves infinite rate. Corollary Optimizing MSE Optimizing Rate
27 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal MMSE Max.SNR Max. Rate MMSE Criterion SNR eff =max min f (α) β P X E α (N β eff ) 2. Maximal SNR Criterion SNR eff =max min E α f (α) β P X ( N β eff ) 2. Maximal Rate Criterion RTHP r =max f (α) Rr THP (f )=max min I β(v ; Y α). f (α) β
28 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Achievable Rates Using Random THP strategies Maximal Rate R r THP = for Δ 1/3. max f (α): Supp{f (α)} [ Δ,Δ] [ min E α β [ Δ,Δ] Remark True for multi-dimensional lattices as well. Finding f (α) Finding optimal f (α) is analytically hard. log Instead, we evaluate for several f (α) choices. α β α ],
29 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Robust DPC Performance 7 6 f (α) P(α=1)=1 5 R [nats] 4 1 Δ 1 1+Δ α Δ
30 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Robust DPC Performance 7 6 f (α) Unif[1 Δ,1+Δ] P(α=1)=1 5 R [nats] 4 1 Δ 1 1+Δ α Δ
31 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Robust DPC Performance 7 6 f (α) V like Unif[1 Δ,1+Δ] P(α=1)=1 5 R [nats] 4 1 Δ 1 1+Δ α Δ
32 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Robust DPC Performance 7 6 Upper Bound V like Unif[1 Δ,1+Δ] P(α=1)=1 5 R [nats] Δ
33 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Noisy Case Effective Noise Expression ( N β eff =(1 α R)U + α R α) β S β + α RN. Strong Interference: N β eff = α β α U + β α N. Self noise component is dominant Use random α. Gaussian component is dominant Use deterministic α.
34 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Rates for SNR = 17dB α=1 α=α MMSE Unif[1 Δ,1+Δ] Unif[α MMSE (1 Δ),α MMSE (1+Δ)] R [nats] Δ
35 B/G Model Compound CSI Smart Rx Smart Tx MIMO Motivation Criteria Rates Noisy Non-Causal Non-Causal Case and Multi-Dimensional Lattices High SNR, Low SIR Results stay exactly the same. Only self noise component is present. Noise and information signal gain shaping together. Corollary: No need to increase dimension! General Case Gaining some shaping is possible. Costa Random Binning for Gaussian S Non-Compound Case: U = X + αs is optimal. Compound Case: Selecting Costa s α like α T in the THP scheme, gives identical results!
36 B/G Model Compound CSI Smart Rx Smart Tx MIMO Model Linear-ZF DPC Rates Robustness Implications for MIMO Broadcast Channels Model and Transmission Scheme Y i = h T i X + N i i =1, 2 X = X 1 t 1 + X 2 t 2 X i - Information signal to user i =1, 2 t i - Unit vector in Tx direction of user i =1, 2 Channel Estimation Inaccuracies h i - Actual channel vectors. Transmitter has estimation h i h i. Assume small inaccuracies angular inaccuracies are dominant.
37 B/G Model Compound CSI Smart Rx Smart Tx MIMO Model Linear-ZF DPC Rates Robustness Linear Zero-Forcing x 1 x 2 h 1 h 1 ε 1 θ ε2 h 2 h 2 h i - true channel vectors h i - estimated ε i - angular errors
38 B/G Model Compound CSI Smart Rx Smart Tx MIMO Model Linear-ZF DPC Rates Robustness Dirty Paper Coding x 1 h 1 h 1 ε 1 θ ε2 x 2 h 2 h 2 h i - true channel vectors h i - estimated ε i - angular errors
39 B/G Model Compound CSI Smart Rx Smart Tx MIMO Model Linear-ZF DPC Rates Robustness Achievable Rates Linear Zero-Forcing Dirty-Paper Coding ( ) R log 1+ SNR 1 h 1 2 sin 2 (θ) SNR 2 h 1 2 o(1) Δ 2 +1 ( ) R log 1+ SNR 2 h 2 2 sin 2 (θ) SNR 1 h 2 2 o(1) Δ 2 +1 ) R 1 ( log SNR 1 h 1 2 sin 2 (θ) SNR 1 h 1 2 o(1) sec 2 (θ)δ 2 +1 ) R 2 ( log SNR 2 h 2 2 SNR 1 h 2 2 o(1). Δ 2 +1
40 B/G Model Compound CSI Smart Rx Smart Tx MIMO Model Linear-ZF DPC Rates Robustness Robustness to Channel Uncertainty Which Scheme is More Robust? When SNR 2 sec 2 (θ) > SNR 1 : Dirty paper coding is more robust than linear ZF! Improved Schemes Both schemes can be improved using: ( Smart Tx )
41 Model and Sum-Capacity Rate Region Binary Dirty Multiple-Access with Common Interference Binary Dirty MAC with Common Interference
42 Channel Model Model and Sum-Capacity Rate Region N Bernoulli(ε) -Noise. Y = X 1 X 2 S N S Bernoulli(1/2) - Known to both encoders. 1 Input ( power ) constraints: n w H(x i ) q i. Sum-Capacity R1+R2 = u.c.e. max { H b (q 1 + q 2 ) H b (ε), 0 } Time-sharing is essential. (In contrast to the Gaussian case) Cooperation between encoders does not increase capacity. (In contrast to the Gaussian case) Binary Dirty MAC with Common Interference
43 Model and Sum-Capacity Rate Region Clean MAC Dirty MAC Clean MAC Rate Regions for q 1 =1/6, q 2 =1/ R2 [bits] Capacity Region Sum Capacity Improved Onion Peeling Onion Peeling Time Sharing (one Tx at a time) h b (q1*q2) h b (q2) h (q2*q1) h (q1) b b R1 [bits] Binary Dirty MAC with Common Interference
44 Model and Sum-Capacity Rate Region Clean MAC Dirty MAC Dirty MAC Rate Regions for q 1 =1/6, q 2 =1/ R2 [bits] Clean Sum Capacity (UB) Clean MAC Capacity (UB) TS between OP Improved Onion Peeling Time Sharing (one Tx at a time) Onion Peeling h b (q1*q2) h b (q2) h (q2*q1) h (q1) b b R1 [bits] Binary Dirty MAC with Common Interference
45 Smart Tx DMAC Supplementary Supplementary
46 Smart Tx DMAC Rates UB Achievable Rates Using Random THP strategies Deterministic Selection α 1 RTHP r (f Deter) = log Δ = log 1 Δ Uniform Distribution α [ Δ, Δ] RTHP r (f Unif) = 1 [ (1 + Δ) log(1 + Δ) 2Δ (1 Δ) log(1 Δ) 2Δ log(2δ) ] RTHP r (f Deter) V-like Distribution f V like (α) = α 1 Δ 2, α 1 Δ R r THP (f V like) = 1 2Δ 2 [ (1 Δ 2 )log(1 Δ 2 )+Δ 2 log(δ 2 ) ]. Supplementary
47 Upper Bound Smart Tx DMAC Rates UB Remarks Optimal f (α) I β (V ; Y )thesameforallβ. Optimal f (α) is not symmetric around 1. Becomes more symmetric as Δ decreases. Upper Bound R r THP log(1 + Δ) log(δ) + 1 Proof: I β (V ; Y )=min{e α [log α] E α [log α β ]} β min {log(1 + Δ) E α [log( α β mod Λ)]} β log(1 + Δ) 1 Δ log x dx 2Δ Δ =log(1+δ) log(δ) + 1. Supplementary
48 Smart Tx DMAC Binary Dirty Multiple Access Channel Doubly-Dirty MAC (PZE 09) S = S 1 S 2. S 1, S 2 Bernoulli(1/2). Capacity Region: { } C(q 1, q 2 )= (R 1, R 2 ):R 1 + R 2 uch [H b (q min ) H b (ε)] q min min{q 1, q 2 } Single-Informed User (PZE 09) Only user 1 knows S. Capacity Region: C(q 1, q 2 ) = cl conv { (R 1, R 2 ): R 2 H b (q 2 ε) H b (ε) R 1 + R 2 H b (q 1 ) H b (ε) }. Supplementary
THE dirty-paper (DP) channel, first introduced by
On the obustness of Dirty Paper Coding Anatoly Khina and Uri Erez, Member, IEEE Abstract A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative
More informationBinary Dirty MAC with Common State Information
Binary Dirty MAC with Common State Information Anatoly Khina Email: anatolyk@eng.tau.ac.il Tal Philosof Email: talp@eng.tau.ac.il Ram Zamir Email: zamir@eng.tau.ac.il Uri Erez Email: uri@eng.tau.ac.il
More informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
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 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 informationMMSE estimation and lattice encoding/decoding for linear Gaussian channels. Todd P. Coleman /22/02
MMSE estimation and lattice encoding/decoding for linear Gaussian channels Todd P. Coleman 6.454 9/22/02 Background: the AWGN Channel Y = X + N where N N ( 0, σ 2 N ), 1 n ni=1 X 2 i P X. Shannon: capacity
More informationInformation Dimension
Information Dimension Mina Karzand Massachusetts Institute of Technology November 16, 2011 1 / 26 2 / 26 Let X would be a real-valued random variable. For m N, the m point uniform quantized version of
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 informationOn Compound Channels With Side Information at the Transmitter
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 52, NO 4, APRIL 2006 1745 On Compound Channels With Side Information at the Transmitter Patrick Mitran, Student Member, IEEE, Natasha Devroye, Student Member,
More informationThe Dirty MIMO Multiple-Access Channel
The Dirty MIMO Multiple-Access Channel Anatoly Khina, Caltech Joint work with: Yuval Kochman, Hebrew University Uri Erez, Tel-Aviv University ISIT 2016 Barcelona, Catalonia, Spain July 12, 2016 Motivation:
More informationOn the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels
On the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels Giuseppe Caire University of Southern California Los Angeles, CA, USA Email: caire@usc.edu Nihar
More informationMultiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets
Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Shivaprasad Kotagiri and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame,
More informationInteractions of Information Theory and Estimation in Single- and Multi-user Communications
Interactions of Information Theory and Estimation in Single- and Multi-user Communications Dongning Guo Department of Electrical Engineering Princeton University March 8, 2004 p 1 Dongning Guo Communications
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 informationThe Effect upon Channel Capacity in Wireless Communications of Perfect and Imperfect Knowledge of the Channel
The Effect upon Channel Capacity in Wireless Communications of Perfect and Imperfect Knowledge of the Channel Muriel Medard, Trans. on IT 000 Reading Group Discussion March 0, 008 Intro./ Overview Time
More informationSimultaneous SDR Optimality via a Joint Matrix Decomp.
Simultaneous SDR Optimality via a Joint Matrix Decomposition Joint work with: Yuval Kochman, MIT Uri Erez, Tel Aviv Uni. May 26, 2011 Model: Source Multicasting over MIMO Channels z 1 H 1 y 1 Rx1 ŝ 1 s
More informationGeneralized Writing on Dirty Paper
Generalized Writing on Dirty Paper Aaron S. Cohen acohen@mit.edu MIT, 36-689 77 Massachusetts Ave. Cambridge, MA 02139-4307 Amos Lapidoth lapidoth@isi.ee.ethz.ch ETF E107 ETH-Zentrum CH-8092 Zürich, Switzerland
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 informationAppendix B Information theory from first principles
Appendix B Information theory from first principles This appendix discusses the information theory behind the capacity expressions used in the book. Section 8.3.4 is the only part of the book that supposes
More informationECE Information theory Final
ECE 776 - Information theory Final Q1 (1 point) We would like to compress a Gaussian source with zero mean and variance 1 We consider two strategies In the first, we quantize with a step size so that the
More informationHalf-Duplex Gaussian Relay Networks with Interference Processing Relays
Half-Duplex Gaussian Relay Networks with Interference Processing Relays Bama Muthuramalingam Srikrishna Bhashyam Andrew Thangaraj Department of Electrical Engineering Indian Institute of Technology Madras
More informationInterference Alignment at Finite SNR for TI channels
Interference Alignment at Finite SNR for Time-Invariant channels Or Ordentlich Joint work with Uri Erez EE-Systems, Tel Aviv University ITW 20, Paraty Background and previous work The 2-user Gaussian interference
More informationInformation Theory - Entropy. Figure 3
Concept of Information Information Theory - Entropy Figure 3 A typical binary coded digital communication system is shown in Figure 3. What is involved in the transmission of information? - The system
More informationBroadcasting over Fading Channelswith Mixed Delay Constraints
Broadcasting over Fading Channels with Mixed Delay Constraints Shlomo Shamai (Shitz) Department of Electrical Engineering, Technion - Israel Institute of Technology Joint work with Kfir M. Cohen and Avi
More informationThe Duality Between Information Embedding and Source Coding With Side Information and Some Applications
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 5, MAY 2003 1159 The Duality Between Information Embedding and Source Coding With Side Information and Some Applications Richard J. Barron, Member,
More informationCompetition and Cooperation in Multiuser Communication Environments
Competition and Cooperation in Multiuser Communication Environments Wei Yu Electrical Engineering Department Stanford University April, 2002 Wei Yu, Stanford University Introduction A multiuser communication
More informationAn Information-Theoretic Analysis of Dirty Paper Coding for Informed Audio Watermarking
1 An Information-Theoretic Analysis of Dirty Paper Coding for Informed Audio Watermarking Andrea Abrardo, Mauro Barni, Andrea Gorrieri, Gianluigi Ferrari Department of Information Engineering and Mathematical
More informationOn the Rate-Limited Gelfand-Pinsker Problem
On the Rate-Limited Gelfand-Pinsker Problem Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 ravit@umd.edu ulukus@umd.edu Abstract
More informationChapter 4. Data Transmission and Channel Capacity. Po-Ning Chen, Professor. Department of Communications Engineering. National Chiao Tung University
Chapter 4 Data Transmission and Channel Capacity Po-Ning Chen, Professor Department of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 30050, R.O.C. Principle of Data Transmission
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 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 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 informationOutage-Efficient Downlink Transmission Without Transmit Channel State Information
1 Outage-Efficient Downlink Transmission Without Transmit Channel State Information Wenyi Zhang, Member, IEEE, Shivaprasad Kotagiri, Student Member, IEEE, and J. Nicholas Laneman, Senior Member, IEEE arxiv:0711.1573v1
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 informationLecture 2: August 31
0-704: Information Processing and Learning Fall 206 Lecturer: Aarti Singh Lecture 2: August 3 Note: These notes are based on scribed notes from Spring5 offering of this course. LaTeX template courtesy
More informationDegrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel
/33 Degrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel Presented by Paul de Kerret Joint work with Antonio Bazco, Nicolas Gresset, and David Gesbert ESIT 2017 in Madrid,
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 informationLecture 4 Channel Coding
Capacity and the Weak Converse Lecture 4 Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 15, 2014 1 / 16 I-Hsiang Wang NIT Lecture 4 Capacity
More informationChapter 9 Fundamental Limits in Information Theory
Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For
More informationBounds and Capacity Results for the Cognitive Z-interference Channel
Bounds and Capacity Results for the Cognitive Z-interference Channel Nan Liu nanliu@stanford.edu Ivana Marić ivanam@wsl.stanford.edu Andrea J. Goldsmith andrea@wsl.stanford.edu Shlomo Shamai (Shitz) Technion
More informationCapacity of the Discrete Memoryless Energy Harvesting Channel with Side Information
204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener
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 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 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 informationRevision of Lecture 5
Revision of Lecture 5 Information transferring across channels Channel characteristics and binary symmetric channel Average mutual information Average mutual information tells us what happens to information
More informationStructured interference-mitigation in two-hop networks
tructured interference-mitigation in two-hop networks Yiwei ong Department of Electrical and Computer Eng University of Illinois at Chicago Chicago, IL, UA Email: ysong34@uicedu Natasha Devroye Department
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 informationCapacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel
Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel Jun Chen Dept. of Electrical and Computer Engr. McMaster University Hamilton, Ontario, Canada Chao Tian AT&T Labs-Research 80 Park
More informationDecomposing the MIMO Wiretap Channel
Decomposing the MIMO Wiretap Channel Anatoly Khina, Tel Aviv University Joint work with: Yuval Kochman, Hebrew University Ashish Khisti, University of Toronto ISIT 2014 Honolulu, Hawai i, USA June 30,
More informationThe Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component
1 The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component Nan Liu, Ivana Marić, Andrea J. Goldsmith, Shlomo Shamai (Shitz) arxiv:0812.0617v1 [cs.it] 2 Dec 2008 Dept. of
More informationCODING FOR COOPERATIVE COMMUNICATIONS. A Dissertation MOMIN AYUB UPPAL
CODING FOR COOPERATIVE COMMUNICATIONS A Dissertation by MOMIN AYUB UPPAL Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of
More informationCommunication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1
Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1 Mahmoud Taherzadeh, Amin Mobasher, and Amir K. Khandani Coding & Signal Transmission Laboratory Department of Electrical & Computer
More informationACOMMUNICATION situation where a single transmitter
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 1875 Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member, IEEE, and John M. Cioffi, Fellow, IEEE Abstract This paper
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 informationChannel Estimation with Low-Precision Analog-to-Digital Conversion
Channel Estimation with Low-Precision Analog-to-Digital Conversion Onkar Dabeer School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai India Email: onkar@tcs.tifr.res.in
More informationSum Capacity of Gaussian Vector Broadcast Channels
Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member IEEE and John M. Cioffi, Fellow IEEE Abstract This paper characterizes the sum capacity of a class of potentially non-degraded Gaussian
More informationEquivalence for Networks with Adversarial State
Equivalence for Networks with Adversarial State Oliver Kosut Department of Electrical, Computer and Energy Engineering Arizona State University Tempe, AZ 85287 Email: okosut@asu.edu Jörg Kliewer Department
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 informationPrinciples of Communications
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @
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 informationC.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University
Quantization C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University http://www.csie.nctu.edu.tw/~cmliu/courses/compression/ Office: EC538 (03)5731877 cmliu@cs.nctu.edu.tw
More informationShannon meets Wiener II: On MMSE estimation in successive decoding schemes
Shannon meets Wiener II: On MMSE estimation in successive decoding schemes G. David Forney, Jr. MIT Cambridge, MA 0239 USA forneyd@comcast.net Abstract We continue to discuss why MMSE estimation arises
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 informationof noise samples, assumed to be circularly-symmetric complex Gaussian with i.i.d. components such that z i N C (0 N 0 ). Then, the t :r GBC is describ
On Achivable Rates in a Multi-Antenna Broadcast Downlink Giuseppe Caire y Shlomo Shamaiz y Eurecom { Sophia-Antipolis { France z Technion {Haifa{Israel Abstract A Gaussian broadcast channel with r single-antenna
More informationDistributed Power Control and lcoded Power Control
WiOpt, Paris, France Distributed Power Control and lcoded Power Control S. Lasaulce(*), joint work with [authors] (*) L2S (CNRS CentraleSupelec) lasaulce@lss.supelec.fr May 18, 2017 Coded Power Control
More informationChannel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.
Channel capacity Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5. Exercices Exercise session 11 : Channel capacity 1 1. Source entropy Given X a memoryless
More informationVECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK
VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La
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 informationarxiv: v1 [cs.it] 4 Jun 2018
State-Dependent Interference Channel with Correlated States 1 Yunhao Sun, 2 Ruchen Duan, 3 Yingbin Liang, 4 Shlomo Shamai (Shitz) 5 Abstract arxiv:180600937v1 [csit] 4 Jun 2018 This paper investigates
More informationA Close to Capacity Dirty Paper Coding Scheme
SUBMITTED TO IEEE TRANS. ON INFORM. THEORY, APR.,, REVISED VERSION SEPTEMBER, A Close to Capacity Dirty Paper Coding Scheme Uri Erez and Stephan ten Brink Abstract The writing on dirty paper channel model
More informationLow-High SNR Transition in Multiuser MIMO
Low-High SNR Transition in Multiuser MIMO Malcolm Egan 1 1 Agent Technology Center, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic. 1 Abstract arxiv:1409.4393v1
More informationA General Formula for Compound Channel Capacity
A General Formula for Compound Channel Capacity Sergey Loyka, Charalambos D. Charalambous University of Ottawa, University of Cyprus ETH Zurich (May 2015), ISIT-15 1/32 Outline 1 Introduction 2 Channel
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 informationLecture 6 Channel Coding over Continuous Channels
Lecture 6 Channel Coding over Continuous Channels I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw November 9, 015 1 / 59 I-Hsiang Wang IT Lecture 6 We have
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 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 informationELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS
EC 32 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 207 Second Semester ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS Time: Three Hours
More informationLecture 14 February 28
EE/Stats 376A: Information Theory Winter 07 Lecture 4 February 8 Lecturer: David Tse Scribe: Sagnik M, Vivek B 4 Outline Gaussian channel and capacity Information measures for continuous random variables
More informationLattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Dinesh Krithivasan and S. Sandeep Pradhan Department of Electrical Engineering and Computer Science,
More informationCapacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback
2038 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback Vincent
More informationMulticoding Schemes for Interference Channels
Multicoding Schemes for Interference Channels 1 Ritesh Kolte, Ayfer Özgür, Haim Permuter Abstract arxiv:1502.04273v1 [cs.it] 15 Feb 2015 The best known inner bound for the 2-user discrete memoryless interference
More informationSparse Regression Codes for Multi-terminal Source and Channel Coding
Sparse Regression Codes for Multi-terminal Source and Channel Coding Ramji Venkataramanan Yale University Sekhar Tatikonda Allerton 2012 1 / 20 Compression with Side-Information X Encoder Rate R Decoder
More informationUniversal Anytime Codes: An approach to uncertain channels in control
Universal Anytime Codes: An approach to uncertain channels in control paper by Stark Draper and Anant Sahai presented by Sekhar Tatikonda Wireless Foundations Department of Electrical Engineering and Computer
More informationResearch Article Multiaccess Channels with State Known to Some Encoders and Independent Messages
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and etworking Volume 2008, Article ID 450680, 14 pages doi:10.1155/2008/450680 Research Article Multiaccess Channels with State
More informationLecture 4 Noisy Channel Coding
Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem
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 informationThe Method of Types and Its Application to Information Hiding
The Method of Types and Its Application to Information Hiding Pierre Moulin University of Illinois at Urbana-Champaign www.ifp.uiuc.edu/ moulin/talks/eusipco05-slides.pdf EUSIPCO Antalya, September 7,
More informationOuter Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation
Outer Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation Parthajit Mohapatra, Chandra R. Murthy, and Jemin Lee itrust, Centre for Research
More informationI. Introduction. Index Terms Multiuser MIMO, feedback, precoding, beamforming, codebook, quantization, OFDM, OFDMA.
Zero-Forcing Beamforming Codebook Design for MU- MIMO OFDM Systems Erdem Bala, Member, IEEE, yle Jung-Lin Pan, Member, IEEE, Robert Olesen, Member, IEEE, Donald Grieco, Senior Member, IEEE InterDigital
More informationMemory in Classical Information Theory: A Brief History
Beyond iid in information theory 8- January, 203 Memory in Classical Information Theory: A Brief History sergio verdu princeton university entropy rate Shannon, 948 entropy rate: memoryless process H(X)
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 informationDelay, feedback, and the price of ignorance
Delay, feedback, and the price of ignorance Anant Sahai based in part on joint work with students: Tunc Simsek Cheng Chang Wireless Foundations Department of Electrical Engineering and Computer Sciences
More informationChapter 4: Continuous channel and its capacity
meghdadi@ensil.unilim.fr Reference : Elements of Information Theory by Cover and Thomas Continuous random variable Gaussian multivariate random variable AWGN Band limited channel Parallel channels Flat
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationOn Multiple User Channels with State Information at the Transmitters
On Multiple User Channels with State Information at the Transmitters Styrmir Sigurjónsson and Young-Han Kim* Information Systems Laboratory Stanford University Stanford, CA 94305, USA Email: {styrmir,yhk}@stanford.edu
More informationOn the Optimality of Treating Interference as Noise in Competitive Scenarios
On the Optimality of Treating Interference as Noise in Competitive Scenarios A. DYTSO, D. TUNINETTI, N. DEVROYE WORK PARTIALLY FUNDED BY NSF UNDER AWARD 1017436 OUTLINE CHANNEL MODEL AND PAST WORK ADVANTAGES
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 informationImproved Sum-Rate Optimization in the Multiuser MIMO Downlink
Improved Sum-Rate Optimization in the Multiuser MIMO Downlin Adam J. Tenenbaum and Raviraj S. Adve Dept. of Electrical and Computer Engineering, University of Toronto 10 King s College Road, Toronto, Ontario,
More informationMMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING
MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING Yichuan Hu (), Javier Garcia-Frias () () Dept. of Elec. and Comp. Engineering University of Delaware Newark, DE
More informationShannon s noisy-channel theorem
Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for
More information