Multiple-input multiple-output (MIMO) communication systems

Slides:



Advertisements
Similar presentations
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Advertisements

MIMO Communication Systems
Prakshep Mehta ( ) Guided By: Prof. R.K. Shevgaonkar
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Comparison of different MIMO-OFDM signal detectors for LTE
NEWCOM – SWP2 MEETING 1 Impact of the CSI on the Design of a Multi-Antenna Transmitter with ML Detection Antonio Pascual Iserte Dpt.
Diversity techniques for flat fading channels BER vs. SNR in a flat fading channel Different kinds of diversity techniques Selection diversity performance.
Mohammad Jaber Borran, Mahsa Memarzadeh, and Behnaam Aazhang June 29, 2001 Coded Modulation for Orthogonal Transmit Diversity.
Mattias Wennström Signals & Systems Group Mattias Wennström Uppsala University Sweden Promises of Wireless MIMO Systems.
IERG 4100 Wireless Communications
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
STBC BASED STTC CODES OPTIMIZED DESIGNS FOR THREE TRANSMIT ANTENNA SYSTEMS CANCES Jean-Pierre XLIM - Dépt. C 2 S 2 UMR CNRS 6172 ENSIL Parc ESTER - BP.
Space Time Block Codes Poornima Nookala.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Digital Communications I: Modulation and Coding Course
Space-time Diversity Codes for Fading Channels
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS (MIMO)
Modulation, Demodulation and Coding Course
Equalization in a wideband TDMA system
Wireless Communication Elec 534 Set IV October 23, 2007
Super-Orthogonal Space- Time BPSK Trellis Code Design for 4 Transmit Antennas in Fast Fading Channels Asli Birol Yildiz Technical University,Istanbul,Turkey.
Multilevel Coding and Iterative Multistage Decoding ELEC 599 Project Presentation Mohammad Jaber Borran Rice University April 21, 2000.
Coded Transmit Macrodiversity: Block Space-Time Codes over Distributed Antennas Yipeng Tang and Matthew Valenti Lane Dept. of Comp. Sci. & Elect. Engg.
Lecture 9,10: Beam forming Transmit diversity Aliazam Abbasfar.
Ali Al-Saihati ID# Ghassan Linjawi
EEE-752 Emerging Wireless Networks MIMO Riaz Hussain FA08-PCE-003 Ph.D. Student Department of Electrical Engineering COMSATS Institute.
Iterative Multi-user Detection for STBC DS-CDMA Systems in Rayleigh Fading Channels Derrick B. Mashwama And Emmanuel O. Bejide.
Space-Time and Space-Frequency Coded Orthogonal Frequency Division Multiplexing Transmitter Diversity Techniques King F. Lee.
Medicaps Institute of Technology & Management Submitted by :- Prasanna Panse Priyanka Shukla Savita Deshmukh Guided by :- Mr. Anshul Shrotriya Assistant.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Coded Modulation for Multiple Antennas over Fading Channels
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
ITERATIVE CHANNEL ESTIMATION AND DECODING OF TURBO/CONVOLUTIONALLY CODED STBC-OFDM SYSTEMS Hakan Doğan 1, Hakan Ali Çırpan 1, Erdal Panayırcı 2 1 Istanbul.
EE 3220: Digital Communication
Digital Communications Chapeter 3. Baseband Demodulation/Detection Signal Processing Lab.
The Effect of Channel Estimation Error on the Performance of Finite-Depth Interleaved Convolutional Code Jittra Jootar, James R. Zeidler, John G. Proakis.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Last time, we talked about:
Space Time Codes. 2 Attenuation in Wireless Channels Path loss: Signals attenuate due to distance Shadowing loss : absorption of radio waves by scattering.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
3: Diversity Fundamentals of Wireless Communication, Tse&Viswanath 1 3. Diversity.
7: MIMO I: Spatial Multiplexing and Channel Modeling Fundamentals of Wireless Communication, Tse&Viswanath 1 7. MIMO I: Spatial Multiplexing and Channel.
Iterative detection and decoding to approach MIMO capacity Jun Won Choi.
Channel Capacity of MIMO Channels 指導教授:黃文傑 老師 指導教授:黃文傑 老師 學 生:曾凱霖 學 生:曾凱霖 學 號: M 學 號: M 無線通訊實驗室 無線通訊實驗室.
Multipe-Symbol Sphere Decoding for Space- Time Modulation Vincent Hag March 7 th 2005.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
A Simple Transmit Diversity Technique for Wireless Communications -M
EE359 – Lecture 15 Outline Announcements: HW posted, due Friday MT exam grading done; l Can pick up from Julia or during TA discussion section tomorrow.
Bandpass Modulation & Demodulation Detection
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
SMARAD / Radio Laboratory 1 Overview of MIMO systems S Postgraduate Course in Radio Communications Sylvain Ranvier
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
Multiple Antennas.
9: Diversity-Multiplexing Tradeoff Fundamentals of Wireless Communication, Tse&Viswanath MIMO III: Diversity-Multiplexing Tradeoff.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
The Viterbi Decoding Algorithm
Space Time Codes.
Space-Time and Space-Frequency Coded Orthogonal Frequency Division Multiplexing Transmitter Diversity Techniques King F. Lee.
Advanced Wireless Networks
Diversity Lecture 7.
Equalization in a wideband TDMA system
Modulation and Coding Schemes
Space Time Coding and Channel Estimation
Chapter 6.
Equalization in a wideband TDMA system
On the Design of RAKE Receivers with Non-uniform Tap Spacing
MIMO (Multiple Input Multiple Output)
Presentation transcript:

Multiple-input multiple-output (MIMO) communication systems Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems System model NT transmit antennas NR receive antennas k : time index (k = 1, ..., K) (coded) data symbols an(k), E[|an(k)|2] = Es Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems System model (m = 1, ..., NR; k = 1, ..., K) wm(k) : complex i.i.d. AWGN, E[|wm(k)|2] = N0 hm,n : complex Gaussian zero-mean i.i.d. channel gains (Rayleigh fading), E[|hm,n|2] = 1 r(k) = Ha(k) + w(k) R = HA + W Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems System model Rb : information bitrate Rs : symbol rate per transmit antenna Eb : energy per infobit Es : energy per symbol (code rate) Es = EbrMIMOlog2(M) Rb = RsNTrMIMOlog2(M) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems System model Spectrum transmitted bandpass signal BRF  Rs (necessary condition to avoid ISI between successive symbols) All NT transmitted signals are simultaneously in the same frequency interval Bandwidth efficiency : Rb/Rs = NTrMIMOlog2(M) (bit/s/Hz) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems ML detection Log-likelihood function ln(p(R |A, H) : ML detection : (minimization over all symbol matrices that obey the encoding rule) Frobenius norm of X : Trace of square matrix M : Properties : Tr[PQ] = Tr[QP], Tr[M] = Tr[MT] XH denotes Hermitian transpose (= complex conjugate transpose (X*)T) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Bit error rate (BER) symbol matrix A represents NTKrMIMOlog2(M) infobits : # infobits in which A(i) and A(i) are different Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Bit error rate (BER) (averaging over statistics of H) PEP(i,0)(H) = Pr[||R - HA(i)||2 < ||R - HA(0)||2| A = A(0), H] PEP(i,0)(H) : pairwise error probability, conditioned on H PEP(i,0) = EH[PEP(i,0)(H)] : pairwise error probability, averaged over H Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Bit error rate (BER) Define error matrix : D(i,0) = A(0) - A(i) Averaging over Rayleigh fading channel statistics : set of eigenvalues of NTxNT matrix D(i,0)(D(i,0))H (these eigenvalues are real-valued non-negative) Advanced Modulation and Coding : MIMO Communication Systems

To be further considered Single-input single-output (SISO) systems : NT = NR = 1 Single-input multiple-output (SIMO) systems : NT = 1, NR  1 Multiple-input multiple-output (MIMO) systems : NT  1, NR  1 Spatial multiplexing : ML detection, ZF detection Space-time coding : trellis coding, delay diversity, block coding Advanced Modulation and Coding : MIMO Communication Systems

Single-input single-output (SISO) systems Advanced Modulation and Coding : MIMO Communication Systems

SISO : observation model Observation model : r(k) = ha(k) + w(k) k = 1, ..., K Bandwidth efficiency : Rb/Rs = rSISOlog2(M) (bit/s/Hz) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems SISO : ML detection ML detector looks for codeword that is closest (in Euclidean distance) to {u(k)} # codewords = In general : decoding complexity exponential in K (trellis codes, convolutional codes : complexity linear in K by using Viterbi algorithm) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems SISO : PEP computation Conditional PEP : squared Euclidean distance between codewords {a(0)(k)} and {a(i)(k)} decreases exponentially with Eb/N0 Average PEP, AWGN (|h| = 1) : inversely proportional to Eb/N0 Average PEP, Rayleigh fading : (occasionally, |h| becomes very small  large PEP) Advanced Modulation and Coding : MIMO Communication Systems

SISO : numerical results BER fading channel >> BER AWGN channel Advanced Modulation and Coding : MIMO Communication Systems

SISO : numerical results coding gain on fading channel << coding gain on AWGN channel Advanced Modulation and Coding : MIMO Communication Systems

Single-input multiple-output (SIMO) systems Advanced Modulation and Coding : MIMO Communication Systems

SIMO : observation model Same transmitter as for SISO; NR antennas at receiver Observation model : rm(k) = hma(k) + wm(k) m = 1, ..., NR; k = 1, ..., K Bandwidth efficiency : Rb/Rs = rSIMOlog2(M) (bit/s/Hz) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems SIMO : ML detection ML detector looks for codeword that is closest to {u(k)} Same decoding complexity as for SISO Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems SIMO : PEP computation Conditional PEP : decreases exponentially with Eb/N0 PEP, AWGN (|hm| = 1) : total received energy per symbol increases by factor NR as compared to SISO  same PEP as with SISO, but with Eb replaced by NREb (“array gain” of 10log(NR) dB) inversely proportional to (Eb/N0)^NR PEP, Rayleigh fading : PEP is smaller than in SISO setup with Eb replaced by NREb - “array gain” of 10log(NR) dB - additional “diversity gain” (diversity order NR) : probability that (|h|2)avg is small, decreases with NR Advanced Modulation and Coding : MIMO Communication Systems

SISO : statistical properties of <|h|2> Advanced Modulation and Coding : MIMO Communication Systems

SISO : statistical properties of <|h|2> Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results AWGN channel : array gain of 10log(NR) dB Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results array gain diversity gain fading channel : array gain + diversity gain Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results fading channel : array gain + diversity gain Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results fading channel : array gain + diversity gain Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results fading channel : coding gain increases with NR Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results fading channel : coding gain increases with NR Advanced Modulation and Coding : MIMO Communication Systems

SIMO : numerical results fading channel : coding gain increases with NR Advanced Modulation and Coding : MIMO Communication Systems

Multiple-input multiple-output (MIMO) systems Advanced Modulation and Coding : MIMO Communication Systems

MIMO : observation model (m = 1, ..., NR; k = 1, ..., K) R = HA + W at any receive antenna, symbols from different transmit antennas interfere Bandwidth efficiency : Rb/Rs = NTrMIMOlog2(M) (bit/s/Hz) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems MIMO : ML detection ML detector : # different symbol matrices A =  detector complexity in general increases exponentially with NTrMIMO and K Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems MIMO : PEP computation PEP, Rayleigh fading : # nonzero eigenvalues equals rank(D(i,0)), with 1  rank(D(i,0))  NT PEP(i,0) inversely proportional to (Eb/N0)^(NRrank(D(i,0))) PEPs that dominate BER are those for which D(i,0) = A(0)-A(i) has minimum rank.  Advanced Modulation and Coding : MIMO Communication Systems

MIMO : spatial multiplexing Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Spatial multiplexing codewords transmitted by different antennas are statistically independent codeword transmitted by antenna #n Aim : to increase bandwidth efficiency by a factor NT as compared to SISO/SIMO Bandwidth efficiency : Rb/Rs = NTrlog2(M) Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : ML detection ML detector : (un)T : n-th row of HHR As HHH is nondiagonal, codewords on different rows must be detected jointly instead of individually # different symbol matrices A =  ML detector complexity increases exponentially with NT as compared to SISO/SIMO Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : PEP computation D(i,0) nonzero  rank(D(i,0))  1 rank(D(i,0)) = 1 when all rows of D(i,0) are proportional to a common row vector dT = (d(1), ..., d(k), ..., d(K)). Example : D(i,0) has only one nonzero row; this corresponds to a detection error in only one row of A  Denoting the n-th row of a rank-1 error matrix D(i,0) by an dT, the bound on the corresponding PEP is dominating PEPs are inversely proportional to (Eb/N0)^NR  diversity order NR (same as for SIMO) Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : zero-forcing detection Complexity of ML detection is exponential in NT Simpler sub-optimum detection : zero-forcing (ZF) detection linear combination of received antenna signals rm(k) to eliminate mutual interference between symbols an(k) from different transmit antennas and to minimize resulting noise variance Condition for ZF solution to exist : rank(H) = NT (this requires NR  NT) r(k) = Ha(k) + w(k) rank(H) = NT  (HHH)-1 exists z(k) = (HHH)-1HHr(k) = a(k) + n(k) n(k) = (HHH)-1HHw(k) z(k) : no interference between symbols from different transmit antennas E[n(k)nH(k)] = N0(HHH)-1 : ni(k) and nj(k) correlated when ij Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : zero-forcing detection Sequences {an(k)} are detected independently instead of jointly, ignoring the correlation of the noise on different outputs : Complexity of ZF detector is linear (instead of exponential) in NT Performance penalty : diversity equals NR-NT+1 (instead of NT) Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : numerical results ML detection : penalty w.r.t. SIMO decreases with increasing NR Advanced Modulation and Coding : MIMO Communication Systems

Spatial multiplexing : numerical results ZF detection : same BER as SIMO with NR-NT+1 receive antennas Advanced Modulation and Coding : MIMO Communication Systems

MIMO : space-time coding Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Space-time coding Aim : to achieve higher diversity order than with SIMO  any D(i,0) must have rank larger than 1 (max. rank is NT, max. diversity order is NTNR)  coded symbols must be distributed over different transmit antennas and different symbol intervals (“space-time” coding) Property : rMIMO  1/NT is necessary condition to have rank NT for all D(i,0)  at max. diversity, Rb/Rs  log2(M) Rb/Rs limited by bandwidth efficiency of uncoded SIMO/SISO Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Three classes of space-time coding : space-time trellis codes (STTrC) delay diversity space-time block codes (STBC) Advanced Modulation and Coding : MIMO Communication Systems

STTrC : trellis representation L input bits at beginning of k-th symbol interval S(k) : state at beginning of k-th symbol interval state transitions : (S(k+1), a(k)) determined by (S(k), b(k)) trellis diagram : (L=1) 2L branches leaving from each state 2L branches entering each state Advanced Modulation and Coding : MIMO Communication Systems

STTrC : bandwidth efficiency rMIMO = L/(NTlog2(M))  Rb/Rs = L (bit/s/Hz) at max. diversity : rMIMO  1/NT  L  log2(M) #states (exponential in NT) ML decoding by means of Viterbi algorithm : decoding complexity linear (instead of exponential) in K but still exponential in NT (at max. diversity) Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems STTrC : example Example for NT = 2, 4 states, 4-PSK, L = 2 infobits per coded symbol pair entryi,j : 2 data symbols corresponding to transition from state i to state j any D(i,0) has columns (0, d1)T, (d2, 0)T with nonzero d1 and d2  rank = 2, i.e., max. rank max. diversity (NTNR = 2NR), max. bandwidth efficiency (L = log2(M)), corresponding to max. diversity Advanced Modulation and Coding : MIMO Communication Systems

Delay diversity : transmitter Example : NT = 3 maximum possible diversity order !  rank(D(i,0)) = NT  diversity order = NTNR Advanced Modulation and Coding : MIMO Communication Systems

Delay diversity : bandwidth efficiency Equivalent configuration : Bandwidth efficiency (for K >> 1) : Rb/Rs = NTrMIMOlog2(M) = rlog2(M)  same bandwidth efficiency as SIMO/SISO with code rate r Max. bandwidth efficiency (at max. diversity) of log2(M) achieved for r = 1 (uncoded delay diversity) Advanced Modulation and Coding : MIMO Communication Systems

Delay diversity : trellis representation Uncoded delay diversity (r = 1) can be interpreted as space-time trellis code : state S(k) = (a(k-1), a(k-2), ..., a(k-NT+1)) #states = input at time k : a(k) output during k-th symbolinterval : (a(k), a(k-1), ..., a(k-NT+1)) decoding complexity : linear in K, exponential in NT Advanced Modulation and Coding : MIMO Communication Systems

Space-time block codes ML decoding of space-time code : minimizing ||R - HA||2 over all possible codewords A A contains NTK coded symbols, which corresponds to NTKrMIMOlog2(M) infobits In general, ML decoding complexity is exponential in NTK Space-time block codes can be designed to yield maximum diversity and to reduce ML decoding to simple symbol-by-symbol decisions  decoding complexity linear (instead of exponential) in NTK Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems STBC : example 1 Example 1 : NT = 2 (Alamouti code ) (A has orthogonal rows, irrespective of the values of a1 and a2)  AAH = (|a1|2 + |a2|2)I2 ML decoding (H = (h1, h2), R = (r1, r2), a1 and a2 i.i.d. symbols) no cross-terms involving both a1 and a2  symbol-by-symbol detection Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems STBC : example 1 orthogonal rows  rank = 2 (= max. rank for NT = 2)  Assume M-point constellation  A contains 4 symbols, i.e. 4log2(M)rMIMO = 2log2(M) infobits  rMIMO = 1/2 (= 1/NT) : highest possible rate for max. diversity Alamouti space-time block code yields - maximum diversity (i.e., 2NR) - maximum corresponding bandwidth efficiency (i.e., Rb/Rs = log2(M)) - small ML decoding complexity Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems STBC : example 2 Example 2 : NT = 3 AAH = 2(|a1|2 + |a2|2 + |a3|2 + |a4|2)I3 rows of A are orthogonal  any D(i,0) has rank = 3  max. diversity (i.e., 3NR) ML detection of (a1, a2, a3, a4) : symbol-by-symbol detection (no cross-terms) rMIMO = 1/6 (1/NT = 1/3) Bandwidth efficiency : Rb/Rs = 4log2(M)/8 = log2(M)/2 i.e., only half of the max. possible value for max. diversity max. bandwidth efficiency (under restriction of max. diversity and symbol-by-symbol detection) cannot be achieved for all values of NT Advanced Modulation and Coding : MIMO Communication Systems

STBC : numerical results Advanced Modulation and Coding : MIMO Communication Systems

STBC : numerical results Advanced Modulation and Coding : MIMO Communication Systems

STBC : numerical results Advanced Modulation and Coding : MIMO Communication Systems

STBC : numerical results Advanced Modulation and Coding : MIMO Communication Systems

Summary : SISO/SIMO/MIMO Advanced Modulation and Coding : MIMO Communication Systems

Advanced Modulation and Coding : MIMO Communication Systems Summary : MIMO (*) assuming max. diversity NTNR is achieved Remark : spatial multiplexing with ZF detection - complexity linear in NT - diversity order is NR-NT+1 Advanced Modulation and Coding : MIMO Communication Systems