Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Publiceringsår

2014

Språk

Engelska

Sidor

1700-1703

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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

Projekt

  • Distributed antenna systems for efficient wireless systems

Forskningsgrupp

  • Digital ASIC

ISBN/ISSN/Övrigt

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