The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Hardware Efficient Approximative Matrix Inversion for Linear Pre-Coding in Massive MIMO

På svenska

Author

Summary, in English

This paper describes a hardware efficient linear pre-coder for Massive MIMO Base Stations (BSs) comprising a very large number of antennas, say, in the order of 100s, serving multiple users simultaneously. To avoid hardware demanding direct matrix inversions required for the Zero-Forcing (ZF) pre-coder, we use low complexity Neumann series based approximations. Furthermore, we propose a method to speed-up the convergence of the Neumann series by using tri-diagonal pre-condition matrices, which lowers the complexity even further. As a proof of concept a flexible VLSI architecture is presented with an implementation supporting matrix inversion of sizes up-to 16 × 16. In 65 nm CMOS, a throughput of 0.5M matrix inversions per sec is achieved at clock frequency of 420 MHz with a 104K gate count.

Publishing year

2014

Language

English

Pages

1700-1703

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Massive MIMO
  • Pre-coder

Conference name

IEEE International Symposium on Circuits and Systems (ISCAS), 2014

Conference date

2014-06-01 - 2014-06-05

Conference place

Melbourne, Australia

Status

Published

Project

  • Distributed antenna systems for efficient wireless systems

Research group

  • Digital ASIC

ISBN/ISSN/Other

  • ISSN: 2158-1525
  • ISSN: 0271-4310