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.

Lattice Structures of Precoders Maximizing the Minimum Distance in Linear Channels

In English

Författare

Summary, in English

This paper investigates linear precoding over nonsingular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is subject to an energy constraint. It is shown that the optimal precoder only produces a finite number of different lattices, namely perfect lattices, at the receiver. The well-known densest lattice packings are instances of perfect lattices, but are not always the solution. This is a counter-intuitive result as previous work in the area showed a tight connection between densest lattices and minimum distance. Since there are only finite many different perfect lattices, they can theoretically be enumerated offline. A new upper bound on the optimal minimum distance is derived, which significantly improves upon a previously reported bound, and is useful when actually constructing the precoders.

Publiceringsår

2015

Språk

Engelska

Sidor

908-916

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

61

Issue

2

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • MIMO
  • modulation
  • lattices

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448