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.

High Throughput Constant Envelope Pre-coder for Massive MIMO Systems

Författare

Summary, in English

This study describes a high throughput constant envelope (CE) pre-coder for Massive MIMO systems. A large number of antennas (M), in the order of 100s, serve a relatively small number of users (K) simultaneously. The stringent amplitude constraint (only phase changes) in the CE scheme is motivated by the use of highly power-efficient non-linear RF power amplifiers. We propose a scheme that computes the CE signals to be transmitted based on box-constrained regression (coordinatedescent),with an O(2MK) complexity per iteration per user

symbol. A highly scalable systolic architecture is implemented, where M Processing Elements (PEs) perform the pre-coding for a system with up to K = 16 users. This systolic architecture results in a very high throughput of 500 Msamples/sec (at 500 MHz clock rate) with a gate count of 14 K per PE in 65 nm technology.

Publiceringsår

2015

Språk

Engelska

Publikation/Tidskrift/Serie

2015 IEEE International Symposium on Circuits and Systems (ISCAS)

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • massive mimo
  • pre-coding
  • constant envelope
  • gradient descent

Conference name

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

Conference date

2015-05-24 - 2015-05-27

Conference place

Lisbon, Portugal

Status

Published

Projekt

  • Distributed antenna systems for efficient wireless systems

Forskningsgrupp

  • Digital ASIC

ISBN/ISSN/Övrigt

  • ISBN: 978-1-4799-8391-9