Algebraic Methods for Wireless Coding
|
|
- Baldwin Gray
- 5 years ago
- Views:
Transcription
1 Algebraic Methods for Wireless Coding Frédérique Oggier California Institute of Technology UC Davis, Mathematics Department, January 31st 2007
2 Outline The Rayleigh fading channel Algebraic lattices and minimum discriminant Coherent space-time codes Cyclic division algebras Other examples Current and future work
3 The Rayleigh fading channel y = xh + v y = (y 1,..., y n ) R n is the received signal x = (x 1,..., x n ) R n is the transmitted codeword v N (0, σ 2 I ) is the noise H = diag(h 1,..., h n ) is the channel fading matrix, h i Rayleigh distributed
4 Decoding and error probability Assuming that H is known at the receiver, the decoding rule is ˆx = arg min x S y xh 2.
5 Decoding and error probability Assuming that H is known at the receiver, the decoding rule is ˆx = arg min x S y xh 2. Reliability is modeled by the pairwise probability of error, bounded by P(x ˆx) 1 2 x i ˆx i 8σ2 (x i ˆx i ) 2 = 1 2 (8σ 2 ) l x i ˆx i x i ˆx i 2 when the two codewords differ in l components.
6 Code design To design a code with low error probability, we have to: 1. Maximize the modulation diversity L = min(l), ideally L = n.
7 Code design To design a code with low error probability, we have to: 1. Maximize the modulation diversity L = min(l), ideally L = n. 2. For a given L, maximize the minimum product distance d p,min = min x i x i x x x i x i under the constraint of bounded average energy.
8 Previous work K. Boullé and J.-C. Belfiore, Modulation schemes designed for the Rayleigh channel,1992. X. Giraud and J.-C. Belfiore, Constellations Matched to the Rayleigh fading channel, J. Boutros and E. Viterbo, Signal Space Diversity: a power and bandwidth efficient diversity technique for the Rayleigh fading channel, G. Taricco and E. Viterbo, Performance of High Diversity Multidimensional Constellations, 1998.
9 Algebraic lattices
10 Algebraic lattices Let K be a number field of degree n and signature (r 1, r 2 ). The canonical embedding σ : K R n is defined by σ(α) = (σ 1 (α),..., σ r1 (α), Rσ r1 +1(α), Iσ r1 +1(α),...)
11 Algebraic lattices Let K be a number field of degree n and signature (r 1, r 2 ). The canonical embedding σ : K R n is defined by σ(α) = (σ 1 (α),..., σ r1 (α), Rσ r1 +1(α), Iσ r1 +1(α),...) Let O K be the ring of integers of K with integral basis {ω 1,..., ω n }. An algebraic lattice Λ = σ(o K ) has generator matrix M = σ 1 (ω 1 )... σ r1 (ω 1 )... Iσ r1 +r 2 (ω 1 )... σ 1 (ω n )... σ n (ω r1 )... Iσ r1 +r 2 (ω n ).
12 The modulation diversity Let K be a number field of signature (r 1, r 2 ). Theorem. Algebraic lattices exhibit a diversity L = r 1 + r 2.
13 The modulation diversity Let K be a number field of signature (r 1, r 2 ). Theorem. Algebraic lattices exhibit a diversity L = r 1 + r 2. In order to guarantee maximal diversity, we consider totally real number fields.
14 The minimum product distance Let Λ = σ(o K ) be an algebraic lattice. Theorem: The minimum product distance of an algebraic lattice Λ is det(λ) d p,min =, d K where d K is the discriminant of K.
15 The minimum product distance Let Λ = σ(o K ) be an algebraic lattice. Theorem: The minimum product distance of an algebraic lattice Λ is det(λ) d p,min =, d K where d K is the discriminant of K. Since finding small discriminants is a difficult question, we use Odlyzko s bound: d 1/n K C n.
16 Summary In order to get good codes for the Rayleigh fading channel, we need 1. a number field K totally real 2. of small discriminant 3. on which we can build a suitable algebraic lattice.
17 Summary In order to get good codes for the Rayleigh fading channel, we need 1. a number field K totally real 2. of small discriminant 3. on which we can build a suitable algebraic lattice. Explicit constructions available in all dimensions, which are shown to be optimal. F. Oggier and E. Viterbo, Algebraic number theory and code design for Rayleigh fading channels.
18 The Rayleigh fading channel Algebraic lattices and minimum discriminant Coherent space-time codes Cyclic division algebras Other examples Current and future work
19 The multiple antenna channel (I)
20 The multiple antenna channel (I) 1. Time t = 1: 1st receive antenna:y 11 = h 11 x 11 + h 12 x 21 + v 11
21 The multiple antenna channel (I) 1. Time t = 1: 1st receive antenna:y 11 = h 11 x 11 + h 12 x 21 + v 11 2nd receive antenna:y 21 = h 21 x 11 + h 22 x 21 + v Time t = 2:
22 The multiple antenna channel (I) 1. Time t = 1: 1st receive antenna:y 11 = h 11 x 11 + h 12 x 21 + v 11 2nd receive antenna:y 21 = h 21 x 11 + h 22 x 21 + v Time t = 2: 1st receive antenna:y 12 = h 11 x 12 + h 12 x 22 + v 12
23 The multiple antenna channel (I) 1. Time t = 1: 1st receive antenna:y 11 = h 11 x 11 + h 12 x 21 + v 11 2nd receive antenna:y 21 = h 21 x 11 + h 22 x 21 + v Time t = 2: 1st receive antenna:y 12 = h 11 x 12 + h 12 x 22 + v 12 2nd receive antenna:y 22 = h 21 x 12 + h 22 x 22 + v 22
24 The multiple antenna channel (II) We get the matrix equation ( ) ( ) ( ) ( y11 y 12 h11 h = 12 x11 x 12 v11 v + 12 y 21 y 22 h 21 h 22 x 21 x 22 v 21 v 22 }{{} space-time codeword X ).
25 Code design criteria (Coherent case) Reliability is modeled by the pairwise probability of error, bounded by P(X ˆX) const det(x ˆX) 2M. We assume the receiver knows the channel (coherent case).
26 Code design criteria (Coherent case) Reliability is modeled by the pairwise probability of error, bounded by P(X ˆX) const det(x ˆX) 2M. We assume the receiver knows the channel (coherent case). We need called fully diverse codes. det(x X ) 0 X X
27 Code design criteria (Coherent case) Reliability is modeled by the pairwise probability of error, bounded by P(X ˆX) const det(x ˆX) 2M. We assume the receiver knows the channel (coherent case). We need called fully diverse codes. det(x X ) 0 X X We attempt to maximize the minimum determinant min det(x X X X ) 2.
28 Previous work 1. E. Telatar,Capacity of multi-antenna Gaussian channels, V. Tarokh and N. Seshadri and A. R. Calderbank, Space-time codes for high data rate wireless communications: Performance criterion and code construction, B. Hassibi and B.M. Hochwald, High-Rate Codes That Are Linear in Space and Time, H. El Gamal and M.O. Damen, Universal space-time coding, 2003.
29 The idea behind division algebras The difficulty in building C such that det(x i X j ) 0, X i X j C, comes from the non-linearity of the determinant.
30 The idea behind division algebras The difficulty in building C such that det(x i X j ) 0, X i X j C, comes from the non-linearity of the determinant. If C is taken inside an algebra of matrices, the problem simplifies to det(x) 0, 0 X C.
31 The idea behind division algebras The difficulty in building C such that det(x i X j ) 0, X i X j C, comes from the non-linearity of the determinant. If C is taken inside an algebra of matrices, the problem simplifies to det(x) 0, 0 X C. A division algebra is a non-commutative field.
32 An example: cyclic division algebras Let Q(i) = {a + ib, a, b Q} information symbols.
33 An example: cyclic division algebras Let Q(i) = {a + ib, a, b Q} information symbols. Let L/Q(i) be a cyclic number field of degree n. A cyclic algebra A is defined as follows A = {(x 0, x 1,..., x n 1 ) x i L}
34 An example: cyclic division algebras Let Q(i) = {a + ib, a, b Q} information symbols. Let L/Q(i) be a cyclic number field of degree n. A cyclic algebra A is defined as follows A = {(x 0, x 1,..., x n 1 ) x i L} with basis {1, e,..., e n 1 } and e n = γ Q(i).
35 An example: cyclic division algebras Let Q(i) = {a + ib, a, b Q} information symbols. Let L/Q(i) be a cyclic number field of degree n. A cyclic algebra A is defined as follows A = {(x 0, x 1,..., x n 1 ) x i L} with basis {1, e,..., e n 1 } and e n = γ Q(i). Think of i 2 = 1.
36 An example: cyclic division algebras Let Q(i) = {a + ib, a, b Q} information symbols. Let L/Q(i) be a cyclic number field of degree n. A cyclic algebra A is defined as follows A = {(x 0, x 1,..., x n 1 ) x i L} with basis {1, e,..., e n 1 } and e n = γ Q(i). Think of i 2 = 1. A non-commutativity rule: λe = eσ(λ), σ : L L the generator of the Galois group of L/Q(i).
37 Cyclic algebras: matrix formulation 1. For n = 2, compute the multiplication by x of any y A: xy = (x 0 + ex 1 )(y 0 + ey 1 ) = x 0 y 0 + eσ(x 0 )y 1 + ex 1 y 0 + γσ(x 1 )y 1 λe = eσ(λ) = [x 0 y 0 + γσ(x 1 )y 1 ] + e[σ(x 0 )y 1 + x 1 y 0 ] e 2 = γ
38 Cyclic algebras: matrix formulation 1. For n = 2, compute the multiplication by x of any y A: xy = (x 0 + ex 1 )(y 0 + ey 1 ) = x 0 y 0 + eσ(x 0 )y 1 + ex 1 y 0 + γσ(x 1 )y 1 λe = eσ(λ) = [x 0 y 0 + γσ(x 1 )y 1 ] + e[σ(x 0 )y 1 + x 1 y 0 ] e 2 = γ 2. In the basis {1, e}, this yields ( x0 γσ(x xy = 1 ) x 1 σ(x 0 ) ) ( y0 y 1 ).
39 Cyclic algebras: matrix formulation 1. For n = 2, compute the multiplication by x of any y A: xy = (x 0 + ex 1 )(y 0 + ey 1 ) = x 0 y 0 + eσ(x 0 )y 1 + ex 1 y 0 + γσ(x 1 )y 1 λe = eσ(λ) = [x 0 y 0 + γσ(x 1 )y 1 ] + e[σ(x 0 )y 1 + x 1 y 0 ] e 2 = γ 2. In the basis {1, e}, this yields ( x0 γσ(x xy = 1 ) x 1 σ(x 0 ) ) ( y0 y 1 ). 3. There is thus a correspondence between x and its multiplication matrix. ( ) x0 γσ(x x = x 0 + ex 1 A 1 ). x 1 σ(x 0 )
40 Cyclic division algebras and encoding Proposition. If γ and its powers γ 2,..., γ n 1 are not a norm, then the cyclic algebra A is a division algebra.
41 Cyclic division algebras and encoding Proposition. If γ and its powers γ 2,..., γ n 1 are not a norm, then the cyclic algebra A is a division algebra. In general x x 0 γσ(x n 1 ) γσ 2 (x n 2 )... γσ n 1 (x 1 ) x 1 σ(x 0 ) γσ 2 (x n 1 )... γσ n 1 (x 2 )... x n 1 σ(x n 2 ) σ 2 (x n 3 )... σ n 1 (x 0 ) Each x i L encodes n information symbols..
42 Summary In order to get good space-time codes for the coherent multiple antenna channel, we follow those steps: 1. Take a cyclic number field L/Q(i) of degree n (# antennas). 2. Construct a cyclic division algebra.
43 Summary In order to get good space-time codes for the coherent multiple antenna channel, we follow those steps: 1. Take a cyclic number field L/Q(i) of degree n (# antennas). 2. Construct a cyclic division algebra. 3. This yields full diversity and a practical encoding, for any n.
44 Summary In order to get good space-time codes for the coherent multiple antenna channel, we follow those steps: 1. Take a cyclic number field L/Q(i) of degree n (# antennas). 2. Construct a cyclic division algebra. 3. This yields full diversity and a practical encoding, for any n. Constructions of codes are available where the algebraic structures are exploited to optimize the codes performance. J.-C. Belfiore, F. E. Oggier, E. Viterbo. Cyclic division algebras: a tool for space-time coding.
45 Summary In order to get good space-time codes for the coherent multiple antenna channel, we follow those steps: 1. Take a cyclic number field L/Q(i) of degree n (# antennas). 2. Construct a cyclic division algebra. 3. This yields full diversity and a practical encoding, for any n. Constructions of codes are available where the algebraic structures are exploited to optimize the codes performance. J.-C. Belfiore, F. E. Oggier, E. Viterbo. Cyclic division algebras: a tool for space-time coding. A 2 2 cyclic algebra based code is to be implemented in the future wireless standard e for wireless LANs.
46 The Rayleigh fading channel Algebraic lattices and minimum discriminant Coherent space-time codes Cyclic division algebras Other examples Current and future work
47 Differential unitary space-time codes (I) Consider the same scenario but with no channel information. How to decode?
48 Differential unitary space-time codes (I) Consider the same scenario but with no channel information. How to decode? We use differential unitary space-time modulation, i.e, S t = X zt S t 1, t = 1, 2,... where {X 0,..., X L 1 } are unitary and S 0 = I.
49 Differential unitary space-time codes (I) Consider the same scenario but with no channel information. How to decode? We use differential unitary space-time modulation, i.e, S t = X zt S t 1, t = 1, 2,... where {X 0,..., X L 1 } are unitary and S 0 = I. If we assume the channel is roughly constant, we have Y t = S t H + W t = X zt S t 1 H + W t = X zt (Y t 1 W t 1 ) + W t = X zt Y t 1 + W t.
50 Differential unitary space-time codes (I) Consider the same scenario but with no channel information. How to decode? We use differential unitary space-time modulation, i.e, S t = X zt S t 1, t = 1, 2,... where {X 0,..., X L 1 } are unitary and S 0 = I. If we assume the channel is roughly constant, we have Y t = S t H + W t = X zt S t 1 H + W t = X zt (Y t 1 W t 1 ) + W t = X zt Y t 1 + W t. The matrix H does not appear in the last equation.
51 Differential unitary space-time codes (II) Use a cyclic division algebra endowed with an involution: A M n (L) x X α(x) X xα(x) = 1 XX = I F. Oggier, Cyclic Algebras for Noncoherent Differential Space-Time Coding.
52 Differential unitary space-time codes (II) Use a cyclic division algebra endowed with an involution: A M n (L) x X α(x) X xα(x) = 1 XX = I F. Oggier, Cyclic Algebras for Noncoherent Differential Space-Time Coding. Use the Cayley transform of an Hermitian matrix A: X = (I + ia) 1 (I ia). F. Oggier, B. Hassibi, Algebraic Cayley differential Space-Time Codes.
53 Wireless networks (I) Y = [A 1 s,..., A R s]h + W The relays and the transmitter cooperate to encode the signal.
54 Wireless networks (II) Distributed space-time coding requires: 1. fully-diverse codewords [A 1 s,..., A R s] 2. where the matrices A i are unitary.
55 Wireless networks (II) Distributed space-time coding requires: 1. fully-diverse codewords [A 1 s,..., A R s] 2. where the matrices A i are unitary. The first algebraic strategies have been recently proposed, for one or multiple antennas.
56 Some open questions 1. Coherent space-time coding: Find large families of fully-diverse matrices with large determinant. Investigate crossed product algebras.
57 Some open questions 1. Coherent space-time coding: Find large families of fully-diverse matrices with large determinant. Investigate crossed product algebras. 2. Differential space-time coding: Find large families of unitary fully-diverse matrices. Investigate Lie algebras. 3. Wireless networks, coherent and non-coherent cases
58 Thank you for your attention!
On the Use of Division Algebras for Wireless Communication
On the Use of Division Algebras for Wireless Communication frederique@systems.caltech.edu California Institute of Technology AMS meeting, Davidson, March 3rd 2007 Outline A few wireless coding problems
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 informationProbability Bounds for Two-Dimensional Algebraic Lattice Codes
Probability Bounds for Two-Dimensional Algebraic Lattice Codes David Karpuk Aalto University April 16, 2013 (Joint work with C. Hollanti and E. Viterbo) David Karpuk (Aalto University) Probability Bounds
More informationAchieving the Full MIMO Diversity-Multiplexing Frontier with Rotation-Based Space-Time Codes
Achieving the Full MIMO Diversity-Multiplexing Frontier with Rotation-Based Space-Time Codes Huan Yao Lincoln Laboratory Massachusetts Institute of Technology Lexington, MA 02420 yaohuan@ll.mit.edu Gregory
More informationAlgebraic Cayley Differential Space Time Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 5, MAY 2007 1911 Algebraic Cayley Differential Space Time Codes Frédérique Oggier and Babak Hassibi Abstract Cayley space time codes have been proposed
More informationA Coding Strategy for Wireless Networks with no Channel Information
A Coding Strategy for Wireless Networks with no Channel Information Frédérique Oggier and Babak Hassibi Abstract In this paper, we present a coding strategy for wireless relay networks, where we assume
More informationSpace-Time Block Codes from Cyclic Division Algebras: An Introduction
Space-Time Block Codes from Cyclic Division Algebras: An Introduction Anders OF Hendrickson December 15, 2004 Coding theory addresses the problem of transmitting information accurately across noisy channels
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 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 informationPerfect Space-Time Block Codes and Ultra-Wideband
Perfect Space-Time Block Codes and Ultra-Wideband Kei Hao 1 Introduction In this report, we present the techniques for constructing Space-Time Block Codes based on division algebra Even though commutative
More informationPerfect Space Time Block Codes
Perfect Space Time Block Codes Frédérique Oggier, Ghaya Rekaya, Student Member IEEE, Jean-Claude Belfiore, Member IEEE and Emanuele Viterbo, Member IEEE Abstract arxiv:cs/0604093v1 [cs.it] 24 Apr 2006
More informationAlgebraic Multiuser Space Time Block Codes for 2 2 MIMO
Algebraic Multiuser Space Time Bloc Codes for 2 2 MIMO Yi Hong Institute of Advanced Telecom. University of Wales, Swansea, UK y.hong@swansea.ac.u Emanuele Viterbo DEIS - Università della Calabria via
More informationA Fast-Decodable, Quasi-Orthogonal Space Time Block Code for 4 2 MIMO
Forty-Fifth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 26-28, 2007 ThC6.4 A Fast-Decodable, Quasi-Orthogonal Space Time Block Code for 4 2 MIMO Ezio Biglieri Universitat Pompeu
More informationThe Aladdin-Pythagoras Space-Time Code
The Aladdin-Pythagoras Space-Time Code Joseph J Boutros Texas A&M University Department of Electrical Engineering Education City Doha Qatar boutros@tamuedu Hugues Randriambololona TELECOM ParisTech / LTCI
More informationFuchsian codes with arbitrary rates. Iván Blanco Chacón, Aalto University
20-09-2013 Summary Basic concepts in wireless channels Arithmetic Fuchsian groups: the rational case Arithmetic Fuchsian groups: the general case Fundamental domains and point reduction Fuchsian codes
More informationGolden Space-Time Block Coded Modulation
Golden Space-Time Block Coded Modulation Laura Luzzi Ghaya Rekaya-Ben Othman Jean-Claude Belfiore and Emanuele Viterbo Télécom ParisTech- École Nationale Supérieure des Télécommunications 46 Rue Barrault
More informationSignal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs
Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STCs arxiv:74.59v [cs.it] 9 pr 7 G. Susinder Rajan ECE Department Indian Institute of Science angalore 56, India
More informationLow Complexity Distributed STBCs with Unitary Relay Matrices for Any Number of Relays
Low Complexity Distributed STBCs with Unitary elay Matrices for Any Number of elays G. Susinder ajan Atheros India LLC Chennai 600004 India susinder@atheros.com B. Sundar ajan ECE Department Indian Institute
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 informationIN THE last several years, there has been considerable
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 8, AUGUST 2002 2291 Unitary Signal Constellations Differential Space Time Modulation With Two Transmit Antennas: Parametric Codes, Optimal Designs,
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 informationSystematic Design of Space-Frequency Codes with Full Rate and Full Diversity
Systematic Design of Space-Frequency Codes with Full Rate and Full Diversity Weifeng Su Department of ECE University of Maryland, College Park, MD 20742, USA Email: weifeng@engumdedu Zoltan Safar Department
More informationCyclic Division Algebras: A Tool for Space Time Coding
Foundations and Trends R in Communications and Information Theory Vol. 4, No. 1 (2007) 1 95 c 2007 F. Oggier, J.-C. Belfiore and E. Viterbo DOI: 10.1561/0100000016 Cyclic Division Algebras: A Tool for
More informationFull text available at: Algebraic Number Theory and Code Design for Rayleigh Fading Channels
Algebraic Number Theory and Code Design for Rayleigh Fading Channels Algebraic Number Theory and Code Design for Rayleigh Fading Channels Frédérique Oggier Institut de Mathématiques Bernoulli École Polytechnique
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 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 informationBounds on fast decodability of space-time block codes, skew-hermitian matrices, and Azumaya algebras
Bounds on fast decodability of space-time block codes, skew-hermitian matrices, and Azumaya algebras Grégory Berhuy, Nadya Markin, and B. A. Sethuraman 1 Abstract We study fast lattice decodability of
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 informationTraining-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks J Harshan Dept of ECE, Indian Institute of Science Bangalore 56001, India Email: harshan@eceiiscernetin B Sundar Rajan
More 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 informationA Construction of a Space Time Code Based on Number Theory
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH 00 753 A Construction of a Space Time Code Based on Number Theory Mohamed Oussama Damen, Associate Member, IEEE, Ahmed Tewfik, Fellow, IEEE,
More informationUsing Noncoherent Modulation for Training
EE8510 Project Using Noncoherent Modulation for Training Yingqun Yu May 5, 2005 0-0 Noncoherent Channel Model X = ρt M ΦH + W Rayleigh flat block-fading, T: channel coherence interval Marzetta & Hochwald
More informationBlind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices
Blind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices Héctor J. Pérez-Iglesias 1, Daniel Iglesia 1, Adriana Dapena 1, and Vicente Zarzoso
More informationLattices and Lattice Codes
Lattices and Lattice Codes Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology Hyderabad
More informationComplete Analysis of Space Time Group Codes
Complete Analysis of Space Time Group Codes Sirin Nitinawarat Dept. of Electrical and Computer Engineering University of Maryland College Park, MD 74 nitinawa@mail.umd.edu Nigel Boston Dept. of Electrical
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 informationProbability Bounds for Two-Dimensional Algebraic Lattice Codes
Noname manuscript No. (will be inserted by the editor) Probability Bounds for Two-Dimensional Algebraic Lattice Codes David A. Karpuk, Member, IEEE Camilla Hollanti, Member, IEEE Emanuele Viterbo, Fellow,
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 informationImproved Perfect Space-Time Block Codes
Improved Perfect Space-Time Block Codes K. Pavan Srinath and B. Sundar Rajan, Senior Member, IEEE Dept of ECE, The Indian Institute of Science, Bangalore-500, India Email:pavan,bsrajan}@ece.iisc.ernet.in
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title A family of fast-decodable MIDO codes from crossedproduct algebras over Authors Luzzi, Laura; Oggier,
More informationPerformance of Full-Rate Full-Diversity Space-Time Codes Under Quantization and Channel Estimation Error. Zhengwei Jiang
Performance of Full-Rate Full-Diversity Space-Time Codes Under Quantization and Channel Estimation Error by Zhengwei Jiang A thesis submitted in conformity with the requirements for the degree of Master
More informationSoft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas
Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antenn Jae-Dong Yang, Kyoung-Young Song Department of EECS, INMC Seoul National University Email: {yjdong, sky6174}@ccl.snu.ac.kr
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 informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
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 informationModulation Diversity in Fading Channels with Quantized Receiver
011 IEEE International Symposium on Information Theory Proceedings Modulation Diversity in Fading Channels with Quantized Receiver Saif Khan Mohammed, Emanuele Viterbo, Yi Hong, and Ananthanarayanan Chockalingam
More information12.4 Known Channel (Water-Filling Solution)
ECEn 665: Antennas and Propagation for Wireless Communications 54 2.4 Known Channel (Water-Filling Solution) The channel scenarios we have looed at above represent special cases for which the capacity
More informationSpace-Frequency Coded MIMO-OFDM with Variable Multiplexing-Diversity Tradeoff
Space-Frequency Coded MIMO-OFDM with Variable Multiplexing-Diversity Tradeoff Helmut Bölcsei and Moritz Borgmann Communication Technology Laboratory ETH Zurich ETH Zentrum, ETF E122 Sternwartstrasse 7
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 informationMMSE Optimal Space-Time Block Codes from Crossed Product Algebras
MMSE Optimal Space-Time Block Codes from Crossed roduct Algebras G Susinder Rajan and B Sundar Rajan Department of Electrical Communication Engineering Indian Institute of Science, Bangalore, India {susinder,
More informationELEC546 MIMO Channel Capacity
ELEC546 MIMO Channel Capacity Vincent Lau Simplified Version.0 //2004 MIMO System Model Transmitter with t antennas & receiver with r antennas. X Transmitted Symbol, received symbol Channel Matrix (Flat
More informationDetecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf
Detecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf Reading: Ch. 5 in Kay-II. (Part of) Ch. III.B in Poor. EE 527, Detection and Estimation Theory, # 5c Detecting Parametric Signals in Noise
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 informationHigh-Rate and Information-Lossless Space-Time Block Codes from Crossed-Product Algebras
High-Rate and Information-Lossless Space-Time Block Codes from Crossed-Product Algebras A Thesis Submitted for the Degree of Doctor of Philosophy in the Faculty of Engineering by Shashidhar V Department
More informationConstruction of MIMO MAC Codes Achieving the Pigeon Hole Bound
Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound Toni Ernvall and Roope Vehkalahti Turku Center for Computer Science and Department of Mathematics, University of Turku, Finland e-mails: {tmernv,
More informationOptimal Signal Constellations for Fading Space-Time Channels
Optimal Signal Constellations for Fading Space-Time Channels 1. Space-time channels Alfred O. Hero University of Michigan - Ann Arbor Outline 2. Random coding exponent and cutoff rate 3. Discrete K-dimensional
More informationEVER since Alamouti s work [1] a decade ago, division
1 Quadratic Forms and Space-Time Block Codes from Generalized Quaternion and Biquaternion Algebras Thomas Unger and Nadya Markin arxiv:0807.0199v4 [cs.it] 11 Apr 2011 Abstract In the context of space-time
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 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 informationCONSTRUCTION AND ANALYSIS OF A NEW QUATERNIONIC SPACE-TIME CODE FOR 4 TRANSMIT ANTENNAS
COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2005 International Press Vol. 5, No. 1, pp. 1-26, 2005 001 CONSTRUCTION AND ANALYSIS OF A NEW QUATERNIONIC SPACE-TIME CODE FOR 4 TRANSMIT ANTENNAS ROBERT CALDERBANK,
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 informationAlgebraic reduction for the Golden Code
Algebraic reduction for the Golden Code Ghaya Rekaya-Ben Othman, Laura Luzzi and Jean-Claude Belfiore TELECOM ParisTech, 46 rue Barrault, 753 Paris, France E-mail: {rekaya, luzzi, belfiore}@telecom paristech.fr
More informationOptimal Data and Training Symbol Ratio for Communication over Uncertain Channels
Optimal Data and Training Symbol Ratio for Communication over Uncertain Channels Ather Gattami Ericsson Research Stockholm, Sweden Email: athergattami@ericssoncom arxiv:50502997v [csit] 2 May 205 Abstract
More informationPerfect Space-Time Codes for Any Number of Antennas
TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY 1 Perfect Space-Time Codes for Any Number of Antennas Petros Elia, B A Sethuraman and P Vijay Kumar Abstract In a recent paper, perfect (n n) space-time
More informationCooperative Communication in Spatially Modulated MIMO systems
Cooperative Communication in Spatially Modulated MIMO systems Multimedia Wireless Networks (MWN) Group, Department Of Electrical Engineering, Indian Institute of Technology, Kanpur, India {neerajv,adityaj}@iitk.ac.in
More informationA Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels
A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels Mehdi Mohseni Department of Electrical Engineering Stanford University Stanford, CA 94305, USA Email: mmohseni@stanford.edu
More informationThe Asymmetric Golden Code for Fast Decoding on Time-Varying Channels
Wireless Personal Communications manuscript No. (will be inserted by the editor) The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels Mohanned O. Sinnokrot John R. Barry Vijay K. Madisetti
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 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 informationFour-Group Decodable Semi-Orthogonal Algebraic Space-Time Block Codes
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 27 proceedings Four-Group Decodable Semi-Orthogonal Algebraic Space-Time
More informationOn Design Criteria and Construction of Non-coherent Space-Time Constellations
On Design Criteria and Construction of Non-coherent Space-Time Constellations Mohammad Jaber Borran, Ashutosh Sabharwal, and Behnaam Aazhang ECE Department, MS-366, Rice University, Houston, TX 77005-89
More informationTiming errors in distributed space-time communications
Timing errors in distributed space-time communications Emanuele Viterbo Dipartimento di Elettronica Politecnico di Torino Torino, Italy viterbo@polito.it Yi Hong Institute for Telecom. Research University
More informationNew Coded Modulation for the Frequency Hoping OFDMA System.
New Coded Modulation for the Frequency Hoping OFDMA System. Kreshchuk Alexey Potapov Vladimir Institute for Information Transmission Problems of Russian Academy of Science Thirteenth International Workshop
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More information1186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 3, MARCH /$ IEEE
1186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 3, MARCH 2008 Diversity Multiplexing Tradeoff Outage Performance for Rician MIMO Channels Won-Yong Shin, Student Member, IEEE, Sae-Young Chung,
More informationOn the Throughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States
On the hroughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States Andreas Senst, Peter Schulz-Rittich, Gerd Ascheid, and Heinrich Meyr Institute for Integrated
More informationusing the Hamiltonian constellations from the packing theory, i.e., the optimal sphere packing points. However, in [11] it is shown that the upper bou
Some 2 2 Unitary Space-Time Codes from Sphere Packing Theory with Optimal Diversity Product of Code Size 6 Haiquan Wang Genyuan Wang Xiang-Gen Xia Abstract In this correspondence, we propose some new designs
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 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 informationSingle-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings Single-Symbol ML Decodable Distributed STBCs for
More informationarxiv:cs/ v1 [cs.it] 11 Sep 2006
0 High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks arxiv:cs/0609054v1 [cs.it] 11 Sep 2006 Zhihang Yi and Il-Min Kim Department of Electrical and Computer Engineering
More informationCapacity of multiple-input multiple-output (MIMO) systems in wireless communications
15/11/02 Capacity of multiple-input multiple-output (MIMO) systems in wireless communications Bengt Holter Department of Telecommunications Norwegian University of Science and Technology 1 Outline 15/11/02
More informationInverse Determinant Sums and Connections. Between Fading Channel Information Theory and Algebra
Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra Roope Vehkalahti, Hsiao-feng (Francis) Lu, Member, IEEE, Laura Luzzi, Member, IEEE arxiv:.6289v4 [cs.it] 0
More informationRECENTLY, several coherent modulation schemes which
Differential Modulation Diversity R. Schober 1 and L.H.-J. Lampe 2 1 Department of Electr. & Comp. Engineering, University of Toronto 2 Chair of Information Transmission, University of Erlangen-Nuremberg
More informationA View on Full-Diversity Modulus-Preserving Rate-One Linear Space-Time Block Codes
SIGNAL PROCESSING (TO APPEAR) A View on Full-Diversity Modulus-Preserving Rate-One Linear Space-Time Block Codes Shengli Zhou 1, Xiaoli Ma 2, and Krishna Pattipati 1 Paper Number: SIGPRO-D-05-00038 Associate
More informationSpace-Time Codes that are Approximately Universal for the Parallel, Multi-Block and Cooperative DDF Channels
Space-Time Codes that are Approximately Universal for the Parallel, Multi-lock and Cooperative DDF Channels Petros Elia Mobile Communications Department, EURECOM F-06904 Sophia Antipolis cedex, France
More informationAdaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems
ACSTSK Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems Professor Sheng Chen Electronics and Computer Science University of Southampton Southampton SO7 BJ, UK E-mail: sqc@ecs.soton.ac.uk
More informationA Precoding Method for Multiple Antenna System on the Riemannian Manifold
Journal of Communications Vol. 9, No. 2, February 2014 A Precoding Method for Multiple Antenna System on the Riemannian Manifold Lin Zhang1 and S. H. Leung2 1 Department of Electronic Engineering, City
More informationDiversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,
More informationAdvanced Spatial Modulation Techniques for MIMO Systems
Advanced Spatial Modulation Techniques for MIMO Systems Ertugrul Basar Princeton University, Department of Electrical Engineering, Princeton, NJ, USA November 2011 Outline 1 Introduction 2 Spatial Modulation
More informationCompute-and-Forward over Block-Fading Channels Using Algebraic Lattices
Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices Shanxiang Lyu, Antonio Campello and Cong Ling Department of EEE, Imperial College London London, SW7 AZ, United Kingdom Email: s.lyu14,
More informationEffect of Spatio-Temporal Channel Correlation on the Performance of Space-Time Codes
Effect of patio-temporal Channel Correlation on the Performance of pace-time Codes C. Fragouli, N. Al-Dhahir, W. Turin AT& T hannon Laboratories 18 Park Ave Florham Park, N 7932 Abstract The determinant
More informationDifferential spatial modulation for high-rate transmission systems
Nguyen et al. EURASIP Journal on Wireless Communications and Networking (2018) 2018:6 DOI 10.1186/s13638-017-1013-1 RESEARCH Open Access Differential spatial modulation for high-rate transmission systems
More informationFULL diversity achieving space-time code designs with
JOURNAL OF L A TEX CLASS FILES, VOL 6, NO 1, JANUARY 007 1 On Space-Time Code Design with A Conditional PIC Group Decoding Tianyi Xu and Xiang-Gen Xia, Fellow, IEEE Abstract Space-time code designs based
More informationA Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems
A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems Wei Zhang, Xiang-Gen Xia and P. C. Ching xxia@ee.udel.edu EE Dept., The Chinese University of Hong Kong ECE Dept., University of Delaware
More informationLayered Orthogonal Lattice Detector for Two Transmit Antenna Communications
Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications arxiv:cs/0508064v1 [cs.it] 12 Aug 2005 Massimiliano Siti Advanced System Technologies STMicroelectronics 20041 Agrate Brianza
More informationNon-coherent Multi-layer Constellations for Unequal Error Protection
Non-coherent Multi-layer Constellations for Unequal Error Protection Kareem M. Attiah, Karim Seddik, Ramy H. Gohary and Halim Yanikomeroglu Department of Electrical Engineering, Alexandria University,
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 information