Massive MIMO Systems Massive MIMO is an emerging technology,

Slides:



Advertisements
Similar presentations
Doc.:IEEE /1275r0 Submission Laurent Cariou Nov, 2010 Slide 1 Complexity reduction for time domain H matrix feedback Authors: Date:
Advertisements

Underwater Acoustic MIMO Channel Capacity
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Presenter: Raghu Ranganathan ECE / CMR Tennessee Technological University March 22th, 2011 Smart grid seminar series Yao Liu, Peng Ning, and Michael K.
Fast Bayesian Matching Pursuit Presenter: Changchun Zhang ECE / CMR Tennessee Technological University November 12, 2010 Reading Group (Authors: Philip.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Cooperative Multiple Input Multiple Output Communication in Wireless Sensor Network: An Error Correcting Code approach using LDPC Code Goutham Kumar Kandukuri.
Interference Alignment as a Rank Constrained Rank Minimization Dimitris S. Papailiopoulos and Alexandros G. Dimakis USC Globecom 2010.
1/44 1. ZAHRA NAGHSH JULY 2009 BEAM-FORMING 2/44 2.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
An Iterative Optimization Strategy in Multiple Points to Multiple Points MIMO (M4) Mobile Communication Systems MCL Yun-Shen Chang
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
APPLICATION OF SPACE-TIME CODING TECHNIQUES IN THIRD GENERATION SYSTEMS - A. G. BURR ADAPTIVE SPACE-TIME SIGNAL PROCESSING AND CODING – A. G. BURR.
Introduction to Cognitive radios Part two HY 539 Presented by: George Fortetsanakis.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
EE359 – Lecture 15 Outline Announcements: HW due Friday MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing Tradeoffs.
Normalised Least Mean-Square Adaptive Filtering
Cooperative Diversity Scheme Based on MIMO-OFDM in Small Cell Network Dong-Hyun Ha Sejong University.
Multiple Criteria Optimisation for Base Station Antenna Arrays in Mobile Communication Systems By Ioannis Chasiotis PhD Student Institute for Communications.
Introduction to Adaptive Digital Filters Algorithms
Zukang Shen, Jeffrey Andrews, and Brian Evans
1 Performance Analysis of Coexisting Secondary Users in Heterogeneous Cognitive Radio Network Xiaohua Li Dept. of Electrical & Computer Engineering State.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
Fast and incoherent dictionary learning algorithms with application to fMRI Authors: Vahid Abolghasemi Saideh Ferdowsi Saeid Sanei. Journal of Signal Processing.
Submission doc.: IEEE /0627r0 May 2015 Hakan Persson, EricssonSlide 1 Beam Selection for Hybrid MIMO Precoding Date: Authors:
1 Energy Efficiency of MIMO Transmissions in Wireless Sensor Networks with Diversity and Multiplexing Gains Wenyu Liu, Xiaohua (Edward) Li and Mo Chen.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Ali Al-Saihati ID# Ghassan Linjawi
EE359 – Lecture 15 Outline Introduction to MIMO Communications MIMO Channel Decomposition MIMO Channel Capacity MIMO Beamforming Diversity/Multiplexing.
The Group Lasso for Logistic Regression Lukas Meier, Sara van de Geer and Peter Bühlmann Presenter: Lu Ren ECE Dept., Duke University Sept. 19, 2008.
Efficient Beam Selection for Hybrid Beamforming
Doc.: IEEE /0553r1 Submission May 2009 Alexander Maltsev, Intel Corp.Slide 1 Path Loss Model Development for TGad Channel Models Date:
MIMO Communications and Algorithmic Number Theory G. Matz joint work with D. Seethaler Institute of Communications and Radio-Frequency Engineering Vienna.
Sparse Signals Reconstruction Via Adaptive Iterative Greedy Algorithm Ahmed Aziz, Ahmed Salim, Walid Osamy Presenter : 張庭豪 International Journal of Computer.
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
Vaida Bartkutė, Leonidas Sakalauskas
Cross-Layer Schemes for Antenna Array Based Wireless Ad Hoc Networks – Design and Analysis Jayakrishnan Mundarath Jointly Advised by : Prof. Parmesh Ramanathan.
Doc.: IEEE /1145r0 Submission September 2015 Intel CorporationSlide 1 SU-MIMO Configurations for IEEE ay Date: Authors:
Iterative detection and decoding to approach MIMO capacity Jun Won Choi.
Abstract: In many scenarios, wireless presents a tempting "last-mile" alternative to a wired connection for the delivery of internet service. However,
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.
Spectrum Sensing In Cognitive Radio Networks
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Doc.: aj Submission November 2014 Slide 1 Shiwen He , Haiming Wang Quasi-Orthogonal STBC for IEEE aj ( 45GHz ) Authors/contributors:
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Multiple Antennas.
Doc.: IEEE /0935r1 Submission July 2011 Fei Tong, CSRSlide 1 An improved non-compressed beamforming feedback format for 11ac Date:
IEEE S802.16maint-08/218 [ 3-Bit 2-Transmit and 4-bit 4-Transmit Antenna Codebooks for Closed-Loop MIMO ] IEEE Presentation Submission Template.
The Transportation and Assignment Problems
EE359 – Lecture 14 Outline Practical Issues in Adaptive Modulation
Is there a promising way?
Space Time Codes.
A Physical Interpretation of Beamforming, BLAST and SVD Algorithms
Month Year doc.: IEEE yy/xxxxr0 November 2016
Quantized Angular Beamforming for mmWave Channels
Jinseok Choi, Brian L. Evans and *Alan Gatherer
Antenna selection and RF processing for MIMO systems
Yinsheng Liu, Beijing Jiaotong University, China
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Near-Optimal Hybrid Analog and Digital Precoding for Downlink mmWave Massive MIMO Systems Linglong Dai1, Xinyu Gao1, Jinguo Quan2, and Shuangfeng Han3,
Xinyu Gao1, Linglong Dai1, Ying Sun1, Shuangfeng Han2, and Chih-Lin I2
Linglong Dai, Xinyu Gao, and Zhaocheng Wang
Null Space Learning in MIMO Systems
Master Thesis Presentation
On the Design of RAKE Receivers with Non-uniform Tap Spacing
Outline Sparse Reconstruction RIP Condition
Implicit Channel Sounding in IEEE (Feasibility Study)
Presentation transcript:

A New Approach to Beamformer Design for Massive MIMO Systems Based on k-regularity Gilwon Lee Dept. of Electrical Engineering KAIST Joint work with Juho Park, Youngchul Sung and Junyeong Seo GLOBECOM 2012 Workshop LTE-B4G, Dec. 3, 2012

Massive MIMO Systems Massive MIMO is an emerging technology, which scales up MIMO by an order of magnitude. Antenna arrays with a few hundred elements. Massive MIMO Rate↑ Transmission reliability↑ Energy efficiency↑

Practical Issues on Massive MIMO Antenna elements: cheap. But, the multiple RF chains associated with multiple antennas are costly in terms of size, power and hardware. The number of RF chains is restricted in massive MIMO systems.

System Model Single user massive MIMO BS MS Assumptions (1) (2) (3) RF chain RF chain Assumptions (1) The size of antenna array at the MS is limited (2) (3) due to hardware constraint.

The Conventional Method: Antenna Selection At transmitter RF chain RF chain RF chain Antenna selection: M RF chains select M different antennas out of the NT available transmit antennas. Hardware Complexity↓

The Conventional Method: Antenna Selection At transmitter RF chain RF chain Antenna Selection RF chain However, the performance of antenna selection should be far interior to that of a method using all of transmit antennas. Especially, the gap of performance will be increasing as NT increases.

The Proposed Scheme: k-regular Beamformer At transmitter RF chain RF chain Antenna Selection RF chain k-regular beamformer RF chain

The Proposed Scheme: k-regular Beamformer Specifically RF chain k-regular beamformer k-regular beamformer: Each of the M data streams is multiplied by k complex gains and assigned to k out of the available NT transmit antennas and signals assigned to the same transmit antenna will be added to be transmitted.

The Proposed Scheme: k-regular Beamformer For example, Each column of V has k=2 nonzero elements. ⇒ k-regularity or k-sparse constraint But, how to design the matrix V?

Problem Formulation Data k-regular streams beamformer Channel k-regularity Problem) k-regular constraint power constraint Assumptions M independent data stream transmission with equal power for each stream There is no power amp in k-regular beamformer

Observations In combinatorial approach, (brute search) Impossible to implement should be required to find optimum V Need an algorithm to reduce complexity!

Observations Without k-regular constraint, the optimal transmit beamforming matrix V is given by where (SVD) is i-th column of The matrix is called eigen beamforming matrix Based on this fact, we can propose a method to design k-regular beamformer.

The Maximum Correlation Method A simple way to design k-regular BF matrix: to approximate the eigen beamforming matrix of H under k-regular constraint Maximum correlation method (MCM) ⇒ Pick k largest absolute values in v and let other values be zeroes. After then, normalize it Very simple, Systematic ⇒ Possible to analyze Heuristic ⇒ Performance loss

The Relaxed Problem Original Problem -norm relaxation of k-regular constraint ⇒ where How can we solve the relaxed problem?

Iterative Shrinkage Thresholding Algorithm For a convex function ⇔ < Iterative Shrinkage Thresholding Algorithm (ISTA) > Shrinkage operator Gradient method where Here,

Iterative Shrinkage Thresholding Algorithm ⇔ If we directly apply ISTA to our problem

Iterative Shrinkage Thresholding Algorithm ⇔ If we directly apply ISTA to our problem without the power constraint, Shrinkage operator for i-th column vector where

Projected ISTA (PISTA) With the power constraint, Projected ISTA (PISTA) Metric projection of vector i-th column onto B

Projected ISTA (PISTA) The Projected ISTA for k-regular Beamformer Design 0. (Initialization) Generate randomly 1. (PISTA) Update 2. (Stop criterion) If 3. (Hard-thresholding) For update, update, 4. (Power adjusting) For

Simulation Results Antenna selection scheme: Parameters:

Simulation Results k-regular beamformer scheme: Parameters: 200% gain Antenna Selection gain 200%

Simulation Results k-regular beamformer scheme with varying k Parameters: eigen BF gain Antenna Selection gain with small k

Simulation Results Distribution of antennas over numbers of connections Parameters: 89% 69% 44% 28% A large portion of antennas are not connected to signals for small k

Simulation Results

Conclusion Proposed k-regular beamformer architecture Proposed PISTA and MCM to design k-regular beamforming Enable system designers to choose optimal trade-off their hardware constraint and required rate performance showed that the proposed k-regular BF significantly improves the rate gain over simple antenna selection