L interférence dans les réseaux non filaires
|
|
- Melina Myra Owen
- 5 years ago
- Views:
Transcription
1 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
2 Parts Part 1 Part 2 Part 3 Part 4 Part 5 Interference in Wireless Networks Resource Allocation Han & Kobayashi Interference Alignment The Compute-and-Forward tool 2 / 54
3 Part I Interference in Wireless Networks
4 Introduction Outline of current Part 1 Introduction 2 In cellular systems 3 In ad hoc networks 4 / 54
5 Introduction Next Frontier for Wireless Networks Cells in cellular wireless networks are becoming smaller and smaller as the density of users per space unit is becoming higher and higher. In wireless sensor networks, the density of sensors is becoming higher and higher as well. 5 / 54
6 Introduction Next Frontier for Wireless Networks Cells in cellular wireless networks are becoming smaller and smaller as the density of users per space unit is becoming higher and higher. In wireless sensor networks, the density of sensors is becoming higher and higher as well. Unwanted signals Each node receives a combination of its own signal and many unwanted ones. Wireless networks become more and more Interference Limited. 5 / 54
7 In cellular systems Outline of current Part 1 Introduction 2 In cellular systems 3 In ad hoc networks 6 / 54
8 In cellular systems Cellular network R Base Station T T T T Figure: One Cell : Many Users 7 / 54
9 In cellular systems Cellular network R Base Station T The Relay Channel Figure: Accessing to hidden Terminals 7 / 54
10 In cellular systems Cellular network Base Station T T The Multiple Access Channel Figure: Uplink 7 / 54
11 In cellular systems Cellular network Base Station T T The Broadcast Channel Figure: Downlink 7 / 54
12 In cellular systems Cellular network Base Station 2 Other system T Base Station 1 T The Interference Channel Figure: Many cells sharing the same Physical Resources 7 / 54
13 In ad hoc networks Outline of current Part 1 Introduction 2 In cellular systems 3 In ad hoc networks 8 / 54
14 In ad hoc networks Ad Hoc and Wireless Sensor Networks Interferences Ad Hoc and Wireless sensor networks can experience a high level of interference between nodes when the number of nodes per area unit is high and the physical resource is scarce. 9 / 54
15 In ad hoc networks Ad Hoc and Wireless Sensor Networks Interferences Ad Hoc and Wireless sensor networks can experience a high level of interference between nodes when the number of nodes per area unit is high and the physical resource is scarce. Properties of the Wireless Medium Main properties are Braodcast property. Superposition property. 9 / 54
16 Part II Resource Allocation
17 Solve the problem at the RRM level Outline of current Part 4 Solve the problem at the RRM level 5 Power Control 6 Subchannel allocation 11 / 54
18 Solve the problem at the RRM level At the Physical Layer Orthogonal Multiplexing Transmit signals from different cells/users at different Subbands (FDMA) Time Slots (TDMA) Interference problem is solved by avoiding Interference. But it is not enough / 54
19 Solve the problem at the RRM level At the Physical Layer Orthogonal Multiplexing Transmit signals from different cells/users at different Subbands (FDMA) Time Slots (TDMA) Interference problem is solved by avoiding Interference. But it is not enough... Interference as noise At receivers, the sum of all interfering signals is considered as noise. Definition of new parameters as P i hii 2 SINR i = N + 2 j i P j h ji for user i, where P j is the transmit power of user j, h ji is the attenuation from transmit cell j to receive cell i and N is the power of noise. 12 / 54
20 Solve the problem at the RRM level At the Physical Layer Orthogonal Multiplexing Transmit signals from different cells/users at different Subbands (FDMA) Time Slots (TDMA) Interference problem is solved by avoiding Interference. But it is not enough... Interference as noise At receivers, the sum of all interfering signals is considered as noise. Definition of new parameters as P i hii 2 SINR i = N + 2 j i P j h ji for user i, where P j is the transmit power of user j, h ji is the attenuation from transmit cell j to receive cell i and N is the power of noise. Interference has to be mitigated at the R adio R esource M anagement level. 12 / 54
21 Power Control Outline of current Part 4 Solve the problem at the RRM level 5 Power Control 6 Subchannel allocation 13 / 54
22 Power Control An Optimization Problem (Power Minimization) Consider many interfering cells (or pairs of users) sharing the same physical resource (time or frequency), 14 / 54
23 Power Control An Optimization Problem (Power Minimization) Consider many interfering cells (or pairs of users) sharing the same physical resource (time or frequency), Fixed Rate Target Data rates R k are given = Target SINR, γ k are given. Optimization problem: min P i P i subject to SINR k γ k and P i P max 14 / 54
24 Power Control An Optimization Problem (Power Minimization) Consider many interfering cells (or pairs of users) sharing the same physical resource (time or frequency), Fixed Rate Target Data rates R k are given = Target SINR, γ k are given. Optimization problem: min P i P i subject to SINR k γ k and P i P max Problem with solution [Pischella & B., 08] This problem has solutions whenever hkk 2 k, 2 > γ k. (1) j i h jk When (1) is not satisfied for some cell, then we say that the network is interferencelimited. No more degree of freedom is available. 14 / 54
25 Power Control Rate Maximization Same assumptions as before. Now we want to maximize a function ϕ(r 1,...,R K ) of the user rates. 15 / 54
26 Power Control Rate Maximization Same assumptions as before. Now we want to maximize a function ϕ(r 1,...,R K ) of the user rates. Which function ϕ? A natural function can be the the weighted sum rate w k R k k where weights w k are proportional to users queue length. 15 / 54
27 Power Control Rate Maximization Same assumptions as before. Now we want to maximize a function ϕ(r 1,...,R K ) of the user rates. Which function ϕ? A natural function can be the the weighted sum rate w k R k k where weights w k are proportional to users queue length. Resolution [Pischella & B., 10] It is a nonconvex optimization problem that can only be solved when SINR is high enough. 15 / 54
28 Subchannel allocation Outline of current Part 4 Solve the problem at the RRM level 5 Power Control 6 Subchannel allocation 16 / 54
29 Subchannel allocation OFDMA Use OFDMA ccess for the orthogonality option. 17 / 54
30 Subchannel allocation OFDMA Use OFDMA ccess for the orthogonality option. Rate-Constrained Users Frequency allocation can be done optimizing a criterion fostering carriers with better SINR. Solution is water filling -type. 17 / 54
31 Subchannel allocation OFDMA Use OFDMA ccess for the orthogonality option. Rate-Constrained Users Frequency allocation can be done optimizing a criterion fostering carriers with better SINR. Solution is water filling -type. Rate Maximization Subcarriers are not chosen when SINR falls below some threshold. Graph coloring algorithms may also be used for subcarrier allocation. 17 / 54
32 Part III Han & Kobayashi
33 Beyond Interference as Noise Outline of current Part 7 Beyond Interference as Noise 8 Han and Kobayashi [Han & Kobayashi, 81] 9 The W curve 19 / 54
34 Beyond Interference as Noise What is possible in Interference-Limited Networks? T 1 h 11 R 1 T 2 h 22 R 2 Figure: Channel Model 20 / 54
35 Beyond Interference as Noise What is possible in Interference-Limited Networks? T 1 h 11 R 1 h 21 h 12 T 2 h 22 R 2 Figure: Channel Model 20 / 54
36 Beyond Interference as Noise What is possible in Interference-Limited Networks? T 1 h 11 R 1 h 21 h 12 Model of the 2-user Interference Channel. Additive Gaussian noise is present at each receiver. T 2 h 22 R 2 Figure: Channel Model 20 / 54
37 Beyond Interference as Noise What is possible in Interference-Limited Networks? T 1 h 11 R 1 h 21 h 12 Model of the 2-user Interference Channel. Additive Gaussian noise is present at each receiver. T 2 h 22 R 2 Figure: Channel Model Is it better to decode interference? When the level of interference becomes high enough, then it is better, for the receiver, to decode both the legitimate user and the interferers. For low level interference: still consider interference as noise. 20 / 54
38 Han and Kobayashi [Han & Kobayashi, 81] Outline of current Part 7 Beyond Interference as Noise 8 Han and Kobayashi [Han & Kobayashi, 81] 9 The W curve 21 / 54
39 Han and Kobayashi [Han & Kobayashi, 81] Han and Kobayashi Coding Scheme Transmitters Each transmitter splits the data into Private data. Common data. It transmits both flows using superposition coding. 22 / 54
40 Han and Kobayashi [Han & Kobayashi, 81] Han and Kobayashi Coding Scheme Transmitters Each transmitter splits the data into Private data. Common data. It transmits both flows using superposition coding. Receivers R i decodes all data coming from T i. It only decodes common data from T j, j i. Private data from T j are treated as noise. 22 / 54
41 Han and Kobayashi [Han & Kobayashi, 81] Han and Kobayashi Coding Scheme Transmitters Each transmitter splits the data into Private data. Common data. It transmits both flows using superposition coding. Receivers R i decodes all data coming from T i. It only decodes common data from T j, j i. Private data from T j are treated as noise. Achievable Rates By optimizing the ratio between R c (common) and R p (private), significantly higher rates are achievable. 22 / 54
42 Han and Kobayashi [Han & Kobayashi, 81] A toy example PAM Constellation 8 PAM Transmitted Constellation 1 bit private and 2 bits common Non legitimate receiver decodes Figure: Example of an 8 PAM constellation 23 / 54
43 Han and Kobayashi [Han & Kobayashi, 81] A toy example PAM Constellation 8 PAM Transmitted Constellation 1 bit private and 2 bits common Non legitimate receiver decodes Figure: Example of an 8 PAM constellation Hierarchical Modulation. 23 / 54
44 The W curve Outline of current Part 7 Beyond Interference as Noise 8 Han and Kobayashi [Han & Kobayashi, 81] 9 The W curve 24 / 54
45 The W curve Generalized Degrees of Freedom Generalized D.O.F. Define α = loginr logsnr. Use Han and Kobayashi. 25 / 54
46 The W curve Generalized Degrees of Freedom Generalized D.O.F. Define α = loginr logsnr. Use Han and Kobayashi. Then the generalized DOF are defined as C(SNR,α) D(α) = lim SNR logsnr C is the capacity of the channel. C logsnr in absence of interference. 25 / 54
47 The W curve Generalized Degrees of Freedom Generalized D.O.F. Define α = loginr logsnr. Use Han and Kobayashi. Then the generalized DOF are defined as C(SNR,α) D(α) = lim SNR logsnr C is the capacity of the channel. C logsnr in absence of interference. D(α) 1 2/3 1/2 Interference as noise Generalized Degrees of freedom (W curve) [Etkin, Tse & Wang, 08] D(α) = 1 α 0 α 1/2 priv. D(α) = α 1/2 α 2/3 priv. + com. D(α) = 1 α/2 2/3 α 1 priv. + com. D(α) = α/2 1 α 2 com. D(α) = 1 α 2 com. 1/2 2 /3 1 2 α No more degree of freedom 25 / 54
48 Part IV Interference Alignment
49 Alignment Principles Interference Alignment consists in reserving space (not linear in general) for all interfering signals. The remaining space will be used by the wanted signal and will be free of interference. 27 / 54
50 Alignment Principles Interference Alignment consists in reserving space (not linear in general) for all interfering signals. The remaining space will be used by the wanted signal and will be free of interference. Which spaces Several types of alignment have been studied among which, 1 Linear over R or C. Needs space, time or frequency diversity. 2 Linear over Q. Does not need diversity. 3 Arithmetic (coding over residue rings). Does not need diversity. 27 / 54
51 Alignment Principles Interference Alignment consists in reserving space (not linear in general) for all interfering signals. The remaining space will be used by the wanted signal and will be free of interference. Which spaces Several types of alignment have been studied among which, 1 Linear over R or C. Needs space, time or frequency diversity. 2 Linear over Q. Does not need diversity. 3 Arithmetic (coding over residue rings). Does not need diversity. Main Constraint Needs channels knowledge at all transmitting sides. 27 / 54
52 Linear Interference Alignment [Cadambe & Jafar, 09] Outline of current Part 10 Linear Interference Alignment [Cadambe & Jafar, 09] 11 Integer Interference Alignment [Jafarian & Vishwanath, 11] 12 What is really alignment? 28 / 54
53 Linear Interference Alignment [Cadambe & Jafar, 09] Principle An example Suppose we have 3 receivers for 5 unknowns, y 1 = 3x 1 + 2x 2 + 3x 3 + x 4 + 5x 5 y 2 = 2x 1 + 4x 2 + x 3 3x 4 + 5x 5 y 3 = 4x 1 + 3x 2 + 5x 3 + 2x 4 + 8x 5 where receiver 1 only wants x / 54
54 Linear Interference Alignment [Cadambe & Jafar, 09] Principle An example Suppose we have 3 receivers for 5 unknowns, y 1 = 3x 1 + 2x 2 + 3x 3 + x 4 + 5x 5 y 2 = 2x 1 + 4x 2 + x 3 3x 4 + 5x 5 y 3 = 4x 1 + 3x 2 + 5x 3 + 2x 4 + 8x 5 Remark 1 In fact, the interfering beams span a 2 D space leaving one dimension free from interference for the wanted signal, H 4 = H 3 H 2 and H 5 = H 3 + H 2. where receiver 1 only wants x / 54
55 Linear Interference Alignment [Cadambe & Jafar, 09] Principle An example Suppose we have 3 receivers for 5 unknowns, y 1 = 3x 1 + 2x 2 + 3x 3 + x 4 + 5x 5 y 2 = 2x 1 + 4x 2 + x 3 3x 4 + 5x 5 y 3 = 4x 1 + 3x 2 + 5x 3 + 2x 4 + 8x 5 Remark 1 In fact, the interfering beams span a 2 D space leaving one dimension free from interference for the wanted signal, H 4 = H 3 H 2 and H 5 = H 3 + H 2. where receiver 1 only wants x 1. Remark 2 Vector u = [ ] is orthogonal to all interfering vectors. 29 / 54
56 Linear Interference Alignment [Cadambe & Jafar, 09] Principle An example Suppose we have 3 receivers for 5 unknowns, y 1 = 3x 1 + 2x 2 + 3x 3 + x 4 + 5x 5 y 2 = 2x 1 + 4x 2 + x 3 3x 4 + 5x 5 y 3 = 4x 1 + 3x 2 + 5x 3 + 2x 4 + 8x 5 where receiver 1 only wants x 1. Remark 2 Vector u = [ ] is orthogonal to all interfering vectors. Remark 1 In fact, the interfering beams span a 2 D space leaving one dimension free from interference for the wanted signal, H 4 = H 3 H 2 and H 5 = H 3 + H 2. Recovering x 1 Projecting the received vector along u gives, 9x 1 = 17y 1 y 2 10y 3 recovering x 1 from the 3 observed values y i. 29 / 54
57 Linear Interference Alignment [Cadambe & Jafar, 09] Principle An example Suppose we have 3 receivers for 5 unknowns, y 1 = 3x 1 + 2x 2 + 3x 3 + x 4 + 5x 5 y 2 = 2x 1 + 4x 2 + x 3 3x 4 + 5x 5 y 3 = 4x 1 + 3x 2 + 5x 3 + 2x 4 + 8x 5 where receiver 1 only wants x 1. Remark 2 Vector u = [ ] is orthogonal to all interfering vectors. Remark 1 In fact, the interfering beams span a 2 D space leaving one dimension free from interference for the wanted signal, H 4 = H 3 H 2 and H 5 = H 3 + H 2. Recovering x 1 Projecting the received vector along u gives, 9x 1 = 17y 1 y 2 10y 3 recovering x 1 from the 3 observed values y i. Linear Interference alignment allows many interfering users to communicate simultaneously over a small number of signalling dimensions by putting the interfering signals in a space of small dimension so that the desired signal can be projected into the null space of the interference. 29 / 54
58 Linear Interference Alignment [Cadambe & Jafar, 09] Feasibility Feasibility of interference alignment depends on the structure and probabilistic behavior of the channel matrix. 30 / 54
59 Linear Interference Alignment [Cadambe & Jafar, 09] Feasibility Feasibility of interference alignment depends on the structure and probabilistic behavior of the channel matrix. MIMO case For instance, for the symmetric K user interference channel where all transmitters have n t antennas and all receivers, n r antennas, interference alignment is feasible with probability 1 when d n t + n r K + 1 where d is the number of flows of each pair. 30 / 54
60 Linear Interference Alignment [Cadambe & Jafar, 09] Feasibility Feasibility of interference alignment depends on the structure and probabilistic behavior of the channel matrix. MIMO case For instance, for the symmetric K user interference channel where all transmitters have n t antennas and all receivers, n r antennas, interference alignment is feasible with probability 1 when d n t + n r K + 1 where d is the number of flows of each pair. Symbol extension Beamforming across multiple channel uses to increase space dimension. 30 / 54
61 Integer Interference Alignment [Jafarian & Vishwanath, 11] Outline of current Part 10 Linear Interference Alignment [Cadambe & Jafar, 09] 11 Integer Interference Alignment [Jafarian & Vishwanath, 11] 12 What is really alignment? 31 / 54
62 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. 32 / 54
63 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. Decoded signals are supposed to be: y 1 = x 1 + 4x 2 + 3x 3 y 2 = 2x 1 + x 2 + 3x 3 (2) y 3 = 6x 1 + 2x 2 + x 3 32 / 54
64 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. Decoded signals are supposed to be: y 1 = x 1 + 4x 2 + 3x 3 y 2 = 2x 1 + x 2 + 3x 3 (2) y 3 = 6x 1 + 2x 2 + x 3 Now, precoding is done at the transmitters such that x 1 = u 1 ; x 2 = 3u 2 ; x 3 = 2u 3 where u i carries information. 32 / 54
65 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. Decoded signals are supposed to be: y 1 = x 1 + 4x 2 + 3x 3 y 2 = 2x 1 + x 2 + 3x 3 (2) y 3 = 6x 1 + 2x 2 + x 3 Now, precoding is done at the transmitters such that x 1 = u 1 ; x 2 = 3u 2 ; x 3 = 2u 3 where u i carries information. Equation (2) becomes r 1 = y 1 = u u 2 + 6u 3 r 2 = y 2 = 2u 1 + 3u 2 + 6u 3. r 3 = 1 2 y 3 = 3u 1 + 3u 2 + u 3 32 / 54
66 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. Decoded signals are supposed to be: y 1 = x 1 + 4x 2 + 3x 3 y 2 = 2x 1 + x 2 + 3x 3 (2) y 3 = 6x 1 + 2x 2 + x 3 Now, precoding is done at the transmitters such that x 1 = u 1 ; x 2 = 3u 2 ; x 3 = 2u 3 where u i carries information. Equation (2) becomes r 1 = y 1 = u u 2 + 6u 3 r 2 = y 2 = 2u 1 + 3u 2 + 6u 3. r 3 = 1 2 y 3 = 3u 1 + 3u 2 + u 3 If u 1 Z 6, u 2 Z 2 and u 3 Z 3, then, u 1 = r 1 mod 6, u 2 = r 2 mod 2 and u 3 = r 3 mod / 54
67 Integer Interference Alignment [Jafarian & Vishwanath, 11] Alignment on Ideals This type of alignment will be studied on an example. We assume 3 pairs of transmitters/receivers. PAM constellations are used (transmission of integer symbols), i.e. x i Z. Decoded signals are supposed to be: y 1 = x 1 + 4x 2 + 3x 3 y 2 = 2x 1 + x 2 + 3x 3 (2) y 3 = 6x 1 + 2x 2 + x 3 Alignment Interference is aligned on ideals (6Z, 2Z and 3Z). Residue Symbols are received free of interference. Now, precoding is done at the transmitters such that x 1 = u 1 ; x 2 = 3u 2 ; x 3 = 2u 3 where u i carries information. Equation (2) becomes r 1 = y 1 = u u 2 + 6u 3 r 2 = y 2 = 2u 1 + 3u 2 + 6u 3. r 3 = 1 2 y 3 = 3u 1 + 3u 2 + u 3 If u 1 Z 6, u 2 Z 2 and u 3 Z 3, then, u 1 = r 1 mod 6, u 2 = r 2 mod 2 and u 3 = r 3 mod / 54
68 What is really alignment? Outline of current Part 10 Linear Interference Alignment [Cadambe & Jafar, 09] 11 Integer Interference Alignment [Jafarian & Vishwanath, 11] 12 What is really alignment? 33 / 54
69 What is really alignment? Framework Linear or integer Techniques of alignment all rely in fact on the same idea. Linear: Received signal (noiseless) belongs to a ring of multivariate polynomials (variables are channel gains). Interferences are put in an ideal. Integer: After approximation, channel gains are integer-valued. Received signal (noiseless) belongs to the ring of integers. Interferences are put in an ideal as well. 34 / 54
70 What is really alignment? Framework Linear or integer Techniques of alignment all rely in fact on the same idea. Linear: Received signal (noiseless) belongs to a ring of multivariate polynomials (variables are channel gains). Interferences are put in an ideal. Integer: After approximation, channel gains are integer-valued. Received signal (noiseless) belongs to the ring of integers. Interferences are put in an ideal as well. Coding Let R denote the ring of all possible (noiseless) received signal. Put all interferers in an ideal J of R and encode the desired signal in the residue ring R/J. 34 / 54
71 Part V The Compute-and-Forward tool
72 Lattices Outline of current Part 13 Lattices 14 Compute-and-Forward [Nazer & Gastpar 09] 15 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] 16 Is practical alignment feasible? 36 / 54
73 Lattices From Modulation and Coding / 54
74 Lattices From Modulation and Coding... What a lattice element could be F 2 F 2 Binary Encoder Data Modulator Labeling Lattice element? in the signal space Figure: Encoder and Modulator 37 / 54
75 Lattices From Modulation and Coding... What a lattice element could be F 2 F 2 Binary Encoder Data Modulator Labeling Lattice element? in the signal space Figure: Encoder and Modulator Requirements Encoder must be linear Modulation should be PAM, QAM or HEX Labeling (modulator) between binary codewords and modulated symbols has to respect some criteria 37 / 54
76 Lattices An example: the D 4 lattice (partition) QAM Partition à la Ungerboeck A subset B subset Figure: Labeling of subsets A and B 38 / 54
77 Lattices An example: the D 4 lattice (coding) Encoder Binary data Labeling (QAM1,QAM2) (A, A) (B, B) Binary data (uncoded) Figure: D 4 encoder 39 / 54
78 Lattices An example: the D 4 lattice (coding) Encoder Binary data Labeling (QAM1,QAM2) (A, A) (B, B) Binary data (uncoded) Figure: D 4 encoder The binary code is the (2,1) repetition code (linear) Modulation is QAM, labeling is the Ungerboeck labeling 39 / 54
79 Lattices An example: the D 4 lattice (coding) Encoder Binary data Labeling (QAM1,QAM2) (A, A) (B, B) Binary data (uncoded) Figure: D 4 encoder The binary code is the (2,1) repetition code (linear) Modulation is QAM, labeling is the Ungerboeck labeling One of the simplest examples of Construction A D 4 = (1 + ı)z[ı] 2 + (2,1) F2 39 / 54
80 Lattices Definition Lattice points An element v of Λ can be written as : v = a 1 v 1 + a 2 v a n v n, a 1,a 2,...,a n Z where (v 1,v 2,...,v n) is a basis of R n. The lattice Λ can be defined as : { } n Λ = a i v i a i Z i=1 40 / 54
81 Lattices Lattices : Generator matrix The set of vectors v 1,v 2,...,v n is a lattice basis. Definition Matrix M whose columns are vectors v 1,v 2,...,v n is a generator matrix of the lattice denoted Λ M. 41 / 54
82 Lattices Lattices : Generator matrix The set of vectors v 1,v 2,...,v n is a lattice basis. Definition Matrix M whose columns are vectors v 1,v 2,...,v n is a generator matrix of the lattice denoted Λ M. Each vector x = (x 1,x 2,...,x n) in Λ M, can be written as, x = M z where z = (z 1,z 2,...,z n) Z n. Lattice Λ M may be seen as the result of a linear transform applied to lattice Z n (cubic lattice). 41 / 54
83 Lattices Lattices : Geometric properties The generator matrix M describes the lattice Λ M, but it is not unique. All matrices M T where T has integer entries and dett = ±1 are generator matrices of Λ M. T is called a unimodular matrix. G = M M is the Gram matrix of the lattice. 42 / 54
84 Lattices Lattices : Geometric properties The generator matrix M describes the lattice Λ M, but it is not unique. All matrices M T where T has integer entries and dett = ±1 are generator matrices of Λ M. T is called a unimodular matrix. G = M M is the Gram matrix of the lattice. Definitions The fundamental parallelotope of Λ M is the region, P = { x R n x = a 1 v 1 + a 2 v a n v n, 0 a i < 1, i = 1...n } The fundamental volume is the volume of the fundamental parallelotope. It is denoted Vol ( Λ M ). The fundamental volume of the lattice is vol ( Λ M ) = det(m), which is det(g) either. 42 / 54
85 Lattices Lattices : Geometric properties The generator matrix M describes the lattice Λ M, but it is not unique. All matrices M T where T has integer entries and dett = ±1 are generator matrices of Λ M. T is called a unimodular matrix. G = M M is the Gram matrix of the lattice. Definitions The fundamental parallelotope of Λ M is the region, P = { x R n x = a 1 v 1 + a 2 v a n v n, 0 a i < 1, i = 1...n } The fundamental volume is the volume of the fundamental parallelotope. It is denoted Vol ( Λ M ). The fundamental volume of the lattice is vol ( Λ M ) = det(m), which is det(g) either. A bad basis is a basis with long vectors (large orthogonality defect). A good basis (or reduced basis) is a basis with short vectors (small orthogonality defect). 42 / 54
86 Lattices Z 2 lattice v 2 v 1 Z 2 lattice (v 1, v 2 ) Lattice Point Lattice Basis Fundamental Parallelotope Voronoi region 43 / 54
87 Lattices Z 2 lattice v 2 Properties Generator matrix is M = [ ] v 1 A QAM constellation is a finite part of Z 2. Z 2 lattice (v 1, v 2 ) Lattice Point Lattice Basis Fundamental Parallelotope Voronoi region 43 / 54
88 Lattices A 2 lattice v2 v1 The A2 lattice (v1, v2) Lattice point Lattice basis Fundamental parallelotope Voronoi region 44 / 54
89 Lattices A 2 lattice v2 v1 Properties Generator matrix is M = [ ] The A2 lattice An HEX constellation is a finite part of A 2, the hexagonal lattice. (v1, v2) Lattice point Lattice basis Fundamental parallelotope Voronoi region 44 / 54
90 Compute-and-Forward [Nazer & Gastpar 09] Outline of current Part 13 Lattices 14 Compute-and-Forward [Nazer & Gastpar 09] 15 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] 16 Is practical alignment feasible? 45 / 54
91 Compute-and-Forward [Nazer & Gastpar 09] Principles z h1x1 h j x j Relay k j =1 a j x j hkxk 46 / 54
92 Compute-and-Forward [Nazer & Gastpar 09] Principles Relay The Relay wants to reliably decode the result of computation λ = k j=1 a j x j. If x j are lattice points of some integer lattice, then λ is also a lattice point for some lattice. z h1x1 h j x j Relay k j =1 a j x j hkxk 46 / 54
93 Compute-and-Forward [Nazer & Gastpar 09] Principles Relay The Relay wants to reliably decode the result of computation λ = k j=1 a j x j. If x j are lattice points of some integer lattice, then λ is also a lattice point for some lattice. z h1x1 h j x j Relay k j =1 a j x j hkxk Received signal Received signal is y = k j=1 h j x j + z where x j Λ are lattice points, h j R and z iid Gaussian noise. Note that a j Z. 46 / 54
94 Compute-and-Forward [Nazer & Gastpar 09] Principles Relay The Relay wants to reliably decode the result of computation λ = k j=1 a j x j. If x j are lattice points of some integer lattice, then λ is also a lattice point for some lattice. z h1x1 h j x j Relay k j =1 a j x j hkxk Received signal Received signal is y = k j=1 h j x j + z where x j Λ are lattice points, h j R and z iid Gaussian noise. Note that a j Z. Goal Compute λ reliably. 46 / 54
95 Compute-and-Forward [Nazer & Gastpar 09] Computation Rate Computation Rate The computation rate defined in is ( R comp (h,a) = log 2 ( a 2 SNR h a ) 2 ) SNR h 2 and is achievable by using lattice codes for x i. 47 / 54
96 Compute-and-Forward [Nazer & Gastpar 09] Computation Rate Computation Rate The computation rate defined in is ( R comp (h,a) = log 2 ( a 2 SNR h a ) 2 ) SNR h 2 and is achievable by using lattice codes for x i. Maximization Maximization of R comp requires to choose a opt Z k ] as [Feng et al. 11], ( a opt = argmin a 0 a I SNR 1 + SNR h 2 H ) a = argmin a 0 a.q.a where H = [h i h j ]. Minimization of the symmetric form Q (Lattice Shortest Vector problem. Λ has Gram matrix Q). 47 / 54
97 Compute-and-Forward [Nazer & Gastpar 09] Computation Rate Computation Rate The computation rate defined in is ( R comp (h,a) = log 2 ( a 2 SNR h a ) 2 ) SNR h 2 and is achievable by using lattice codes for x i. Maximization Maximization of R comp requires to choose a opt Z k ] as [Feng et al. 11], ( a opt = argmin a 0 a I SNR 1 + SNR h 2 H ) a = argmin a 0 a.q.a where H = [h i h j ]. Minimization of the symmetric form Q (Lattice Shortest Vector problem. Λ has Gram matrix Q). Successive Minima Find the k successive minima of Λ. Reduce Λ. 47 / 54
98 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Outline of current Part 13 Lattices 14 Compute-and-Forward [Nazer & Gastpar 09] 15 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] 16 Is practical alignment feasible? 48 / 54
99 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Use Compute-and-Forward Each user transmits 2 data flows: private + common. Each receiver sees k = 2 or k = 3 data flows to decode. 49 / 54
100 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Use Compute-and-Forward Each user transmits 2 data flows: private + common. Each receiver sees k = 2 or k = 3 data flows to decode. Find the k successive minima related to Gram matrix Q. 2 or 3 computation rates R 1, R 2 and maybe R 3 with R 1 > R 2 > R 3. R 2 is always achievable. 49 / 54
101 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Use Compute-and-Forward Each user transmits 2 data flows: private + common. Each receiver sees k = 2 or k = 3 data flows to decode. Rates with common data Find the k successive minima related to Gram matrix Q. 2 or 3 computation rates R 1, R 2 and maybe R 3 with R 1 > R 2 > R 3. R 2 is always achievable Computation Rate for SNR = 40db First Equation Second Equation Sum Normalized Computation Rate h Figure: Sum Rate with Gauss Reduction 49 / 54
102 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Achievable Rates Symmetric interference channel: Received Signals are y 1 = x 1 + gx 2 + z 1 and y 2 = gx 1 + x 2 + z 2 ; 50 / 54
103 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Achievable Rates Symmetric interference channel: Received Signals are y 1 = x 1 + gx 2 + z 1 and y 2 = gx 1 + x 2 + z 2 ; Medium SNR Upper Bound And Achievable Rate On The Capacity (SNR = 20db) 4 The Upper Bound Achievable Rate 3.5 Sum Rate[Bits/Channel Use] g Figure: SNR = 20 db ; Achievable Sum-Rate 50 / 54
104 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] Achievable Rates Symmetric interference channel: Received Signals are y 1 = x 1 + gx 2 + z 1 and y 2 = gx 1 + x 2 + z 2 ; Medium SNR High SNR Upper Bound And Achievable Rate On The Capacity (SNR = 20db) Upper Bound And Achievable Rate On The Capacity (SNR = 50db) The Upper Bound Achievable Rate 9 8 The Upper Bound Achievable Rate 7 Sum Rate[Bits/Channel Use] Sum Rate[Bits/Channel Use] g g Figure: SNR = 20 db ; Achievable Sum-Rate Figure: SNR = 50 db ; Achievable Sum-Rate 50 / 54
105 Is practical alignment feasible? Outline of current Part 13 Lattices 14 Compute-and-Forward [Nazer & Gastpar 09] 15 1 interferer: (Almost) Achieving Capacity? [Nazer, Ordentlich & Erez, 12] 16 Is practical alignment feasible? 51 / 54
106 Is practical alignment feasible? From theory to practice Linear alignment Problems to overcome: Perfect knowledge of all channel gains at all transmitters. Based on Zero Forcing (becomes efficient when SNR ). No idea of its behavior at finite SNR. 52 / 54
107 Is practical alignment feasible? From theory to practice Linear alignment Problems to overcome: Perfect knowledge of all channel gains at all transmitters. Based on Zero Forcing (becomes efficient when SNR ). No idea of its behavior at finite SNR. Integer alignment (or more generally lattice alignment) Problems to overcome: Approximation of channel gains by integers generates additional noise. No design criterion for lattice codes right now. 52 / 54
108 Is practical alignment feasible? From theory to practice Linear alignment Problems to overcome: Perfect knowledge of all channel gains at all transmitters. Based on Zero Forcing (becomes efficient when SNR ). No idea of its behavior at finite SNR. Integer alignment (or more generally lattice alignment) Problems to overcome: Approximation of channel gains by integers generates additional noise. No design criterion for lattice codes right now. Fractal behavior Some values of channel gains lead to performances much worse than very close other ones. 52 / 54
109 Conclusion Open Problems On the Coding+Alignment side Find Lattice Codes adapted to the interference channel and find a practical way to align interferers. 53 / 54
110 Conclusion Open Problems On the Coding+Alignment side Find Lattice Codes adapted to the interference channel and find a practical way to align interferers. Other points Asynchronous Codes? / 54
111 Merci!!
Interference 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 informationLattices for Communication Engineers
Lattices for Communication Engineers Jean-Claude Belfiore Télécom ParisTech CNRS, LTCI UMR 5141 February, 22 2011 Nanyang Technological University - SPMS Part I Introduction Signal Space The transmission
More informationCompute-and-Forward for the Interference Channel: Diversity Precoding
Compute-and-Forward for the Interference Channel: Diversity Precoding Ehsan Ebrahimi Khaleghi, Jean-Claude Belfiore To cite this version: Ehsan Ebrahimi Khaleghi, Jean-Claude Belfiore. Compute-and-Forward
More informationAugmented Lattice Reduction for MIMO decoding
Augmented Lattice Reduction for MIMO decoding LAURA LUZZI joint work with G. Rekaya-Ben Othman and J.-C. Belfiore at Télécom-ParisTech NANYANG TECHNOLOGICAL UNIVERSITY SEPTEMBER 15, 2010 Laura Luzzi Augmented
More informationPrecoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap Or Ordentlich Dept EE-Systems, TAU Tel Aviv, Israel Email: ordent@engtauacil Uri Erez Dept EE-Systems, TAU Tel Aviv,
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 informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
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 informationApplications of Lattices in Telecommunications
Applications of Lattices in Telecommunications Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013 1 Sphere Decoder Algorithm Rotated Signal Constellations
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationSpace-Time Coding for Multi-Antenna Systems
Space-Time Coding for Multi-Antenna Systems ECE 559VV Class Project Sreekanth Annapureddy vannapu2@uiuc.edu Dec 3rd 2007 MIMO: Diversity vs Multiplexing Multiplexing Diversity Pictures taken from lectures
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 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 informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
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 informationPhase Precoded Compute-and-Forward with Partial Feedback
Phase Precoded Compute-and-Forward with Partial Feedback Amin Sakzad, Emanuele Viterbo Dept. Elec. & Comp. Sys. Monash University, Australia amin.sakzad,emanuele.viterbo@monash.edu Joseph Boutros, Dept.
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 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 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 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 informationOn the diversity of the Naive Lattice Decoder
On the diversity of the Naive Lattice Decoder Asma Mejri, Laura Luzzi, Ghaya Rekaya-Ben Othman To cite this version: Asma Mejri, Laura Luzzi, Ghaya Rekaya-Ben Othman. On the diversity of the Naive Lattice
More informationA Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks
A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks Daniel Frank, Karlheinz Ochs, Aydin Sezgin Chair of Communication Systems RUB, Germany Email: {danielfrank, karlheinzochs,
More informationOn the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel
On the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel Invited Paper Chenwei Wang, Tiangao Gou, Syed A. Jafar Electrical Engineering and Computer Science University of California,
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
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 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 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 informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationELEC E7210: Communication Theory. Lecture 10: MIMO systems
ELEC E7210: Communication Theory Lecture 10: MIMO systems Matrix Definitions, Operations, and Properties (1) NxM matrix a rectangular array of elements a A. an 11 1....... a a 1M. NM B D C E ermitian transpose
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 informationLattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm
Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE
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 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 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 informationOn the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation
On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang 1 arxiv:1308.3310v1 [cs.it] 15 Aug 2013
More informationAdvanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur
Advanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture - 19 Multi-User CDMA Uplink and Asynchronous CDMA
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 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 informationDegrees-of-Freedom for the 4-User SISO Interference Channel with Improper Signaling
Degrees-of-Freedom for the -User SISO Interference Channel with Improper Signaling C Lameiro and I Santamaría Dept of Communications Engineering University of Cantabria 9005 Santander Cantabria Spain Email:
More informationLecture 4 Capacity of Wireless Channels
Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:
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 informationFULL rate and full diversity codes for the coherent
1432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 4, APRIL 2005 The Golden Code: A 2 2 Full-Rate Space Time Code With Nonvanishing Determinants Jean-Claude Belfiore, Member, IEEE, Ghaya Rekaya,
More informationAdvanced Factorization Strategies for Lattice-Reduction-Aided Preequalization
Advanced Factorization Strategies for Lattice-Reduction-Aided Preequalization Sebastian Stern and Robert F.H. Fischer Institute of Communications Engineering, Ulm University, Ulm, Germany Email: {sebastian.stern,robert.fischer}@uni-ulm.de
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
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 informationSecure Multiuser MISO Communication Systems with Quantized Feedback
Secure Multiuser MISO Communication Systems with Quantized Feedback Berna Özbek*, Özgecan Özdoğan*, Güneş Karabulut Kurt** *Department of Electrical and Electronics Engineering Izmir Institute of Technology,Turkey
More informationFeasibility Conditions for Interference Alignment
Feasibility Conditions for Interference Alignment Cenk M. Yetis Istanbul Technical University Informatics Inst. Maslak, Istanbul, TURKEY Email: cenkmyetis@yahoo.com Tiangao Gou, Syed A. Jafar University
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 informationCoding over Interference Channels: An Information-Estimation View
Coding over Interference Channels: An Information-Estimation View Shlomo Shamai Department of Electrical Engineering Technion - Israel Institute of Technology Information Systems Laboratory Colloquium
More informationDemixing Radio Waves in MIMO Spatial Multiplexing: Geometry-based Receivers Francisco A. T. B. N. Monteiro
Demixing Radio Waves in MIMO Spatial Multiplexing: Geometry-based Receivers Francisco A. T. B. N. Monteiro 005, it - instituto de telecomunicações. Todos os direitos reservados. Demixing Radio Waves in
More information4184 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 12, DECEMBER Pranav Dayal, Member, IEEE, and Mahesh K. Varanasi, Senior Member, IEEE
4184 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 12, DECEMBER 2005 An Algebraic Family of Complex Lattices for Fading Channels With Application to Space Time Codes Pranav Dayal, Member, IEEE,
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 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 informationSome Goodness Properties of LDA Lattices
Some Goodness Properties of LDA Lattices Shashank Vatedka and Navin Kashyap {shashank,nkashyap}@eceiiscernetin Department of ECE Indian Institute of Science Bangalore, India Information Theory Workshop
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 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 informationInterference Decoding for Deterministic Channels Bernd Bandemer, Student Member, IEEE, and Abbas El Gamal, Fellow, IEEE
2966 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 5, MAY 2011 Interference Decoding for Deterministic Channels Bernd Bemer, Student Member, IEEE, Abbas El Gamal, Fellow, IEEE Abstract An inner
More informationCommunication over Finite-Ring Matrix Channels
Communication over Finite-Ring Matrix Channels Chen Feng 1 Roberto W. Nóbrega 2 Frank R. Kschischang 1 Danilo Silva 2 1 Department of Electrical and Computer Engineering University of Toronto, Canada 2
More informationUser Selection and Power Allocation for MmWave-NOMA Networks
User Selection and Power Allocation for MmWave-NOMA Networks Jingjing Cui, Yuanwei Liu, Zhiguo Ding, Pingzhi Fan and Arumugam Nallanathan Southwest Jiaotong University, Chengdu, P. R. China Queen Mary
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 informationInformation 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 informationOn Feasibility of Interference Alignment in MIMO Interference Networks
On Feasibility of Interference Alignment in MIMO Interference Networks Cenk M. Yetis, Member, IEEE, Tiangao Gou, Student Member, IEEE, Syed A. Jafar Senior Member, IEEE and Ahmet H. Kayran, Senior Member,
More informationMaxime GUILLAUD. Huawei Technologies Mathematical and Algorithmic Sciences Laboratory, Paris
1/21 Maxime GUILLAUD Alignment Huawei Technologies Mathematical and Algorithmic Sciences Laboratory, Paris maxime.guillaud@huawei.com http://research.mguillaud.net/ Optimisation Géométrique sur les Variétés
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 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 informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More informationLecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1
Fading : Theoretical Foundations of Wireless Communications 1 Thursday, May 3, 2018 9:30-12:00, Conference Room SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 23 Overview
More informationDiversity-Multiplexing Tradeoff of the Two-User Interference Channel
Diversity-Multiplexing Tradeoff of the Two-User Interference Channel arxiv:0905.0385v2 [cs.it] 8 Sep 2009 Adnan Raja and Pramod Viswanath April 9, 2018 Abstract Diversity-Multiplexing tradeoff DMT) is
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationOptimal Factorization in Lattice-Reduction-Aided and Integer-Forcing Linear Equalization
Optimal Factorization in Lattice-Reduction-Aided and Integer-Forcing Linear Equalization Sebastian Stern and Robert F.H. Fischer Institute of Communications Engineering, Ulm University, Ulm, Germany Email:
More information2-user 2-hop Networks
2012 IEEE International Symposium on Information Theory roceedings Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks Sang-Woon Jeon, Chien-Yi Wang, and Michael Gastpar School of Computer
More informationLecture 6: Modeling of MIMO Channels Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Theoretical Foundations of Wireless Communications 1 Wednesday, May 11, 2016 9:00-12:00, Conference Room SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 1 Overview
More informationAn Efficient Optimal Algorithm for Integer-Forcing Linear MIMO Receivers Design
An Efficient Optimal Algorithm for Integer-Forcing Linear MIMO Receivers Design Jinming Wen, Lanping Li, Xiaohu Tang, Wai Ho Mow, and Chintha Tellambura Department of Electrical and Computer Engineering,
More informationInterleave Division Multiple Access. Li Ping, Department of Electronic Engineering City University of Hong Kong
Interleave Division Multiple Access Li Ping, Department of Electronic Engineering City University of Hong Kong 1 Outline! Introduction! IDMA! Chip-by-chip multiuser detection! Analysis and optimization!
More informationOn the Robustness of Algebraic STBCs to Coefficient Quantization
212 Australian Communications Theory Workshop (AusCTW) On the Robustness of Algebraic STBCs to Coefficient Quantization J. Harshan Dept. of Electrical and Computer Systems Engg., Monash University Clayton,
More informationResource Management and Interference Control in Distributed Multi-Tier and D2D Systems. Ali Ramezani-Kebrya
Resource Management and Interference Control in Distributed Multi-Tier and D2D Systems by Ali Ramezani-Kebrya A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy
More informationTRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS
The 20 Military Communications Conference - Track - Waveforms and Signal Processing TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS Gam D. Nguyen, Jeffrey E. Wieselthier 2, Sastry Kompella,
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 4. Capacity of Fading Channels
1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February
More informationInteger-Forcing Linear Receiver Design over MIMO Channels
Globecom 0 - Signal Processing for Communications Symposium Integer-Forcing inear Receiver Design over MIMO Channels ili Wei, Member, IEEE and Wen Chen, Senior Member, IEEE Department of Electronic Engineering,
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 informationAchievable rates of MIMO downlink beamforming with non-perfect CSI: a comparison between quantized and analog feedback
Achievable rates of MIMO downlink beamforming with non-perfect CSI: a comparison between quantized and ana feedback Giuseppe Caire University of Sourthern California Los Angeles CA, 989 USA Nihar Jindal
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 informationTwo-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems
Two-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems Behrouz Khoshnevis and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario,
More informationInterference Alignment under Training and Feedback Constraints
Interference Alignment under Training and Feedbac Constraints Baile Xie, Student Member, IEEE, Yang Li, Student Member, IEEE, Hlaing Minn, Senior Member, IEEE, and Aria Nosratinia, Fellow, IEEE The 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 informationApplications of the Golden Code
Applications of the Golden Code Emanuele Viterbo DEIS - Università della Calabria via P. Bucci, Cubo 42C 87036 Rende (CS) - ITALY viterbo@deis.unical.it Yi Hong Institute for Telecom. Research University
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 informationConstellation Precoded Beamforming
Constellation Precoded Beamforming Hong Ju Park and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science University of California,
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 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 informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationInterference, Cooperation and Connectivity A Degrees of Freedom Perspective
Interference, Cooperation and Connectivity A Degrees of Freedom Perspective Chenwei Wang, Syed A. Jafar, Shlomo Shamai (Shitz) and Michele Wigger EECS Dept., University of California Irvine, Irvine, CA,
More informationMulti-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong
Multi-User Gain Maximum Eigenmode Beamforming, and IDMA Peng Wang and Li Ping City University of Hong Kong 1 Contents Introduction Multi-user gain (MUG) Maximum eigenmode beamforming (MEB) MEB performance
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
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 informationOn the Duality between Multiple-Access Codes and Computation Codes
On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch
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 information2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE Mai Vu, Student Member, IEEE, and Arogyaswami Paulraj, Fellow, IEEE
2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 Optimal Linear Precoders for MIMO Wireless Correlated Channels With Nonzero Mean in Space Time Coded Systems Mai Vu, Student Member,
More information