English
Related papers

Related papers: Maximal Orders in the Design of Dense Space-Time L…

200 papers

It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field…

Information Theory · Computer Science 2009-08-19 C. Hollanti , J. Lahtonen , K. Ranto , R. Vehkalahti

Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Camilla Hollanti , Frédérique Oggier

In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…

Information Theory · Computer Science 2012-02-28 Camilla Hollanti , Nadya Markin

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum…

Information Theory · Computer Science 2015-03-19 Laura Luzzi , Frédérique Oggier

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Information Theory · Computer Science 2021-02-22 Roope Vehkalahti , Laura Luzzi

We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…

Number Theory · Mathematics 2022-04-12 Nihar Gargava , Vlad Serban

We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of…

Information Theory · Computer Science 2008-04-14 K. Raj Kumar , Giuseppe Caire

Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions…

Information Theory · Computer Science 2017-10-05 Min Qiu , Lei Yang , Yixuan Xie , Jinhong Yuan

In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for…

Information Theory · Computer Science 2018-01-10 Laura Luzzi , Roope Vehkalahti

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive…

Information Theory · Computer Science 2016-11-18 Joakim Jalden , Petros Elia

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder

Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML)…

Information Theory · Computer Science 2009-01-28 Joakim Jalden , Petros Elia

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…

Information Theory · Computer Science 2015-07-28 Laura Luzzi , Roope Vehkalahti

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…

Information Theory · Computer Science 2015-01-28 Laura Luzzi , Roope Vehkalahti

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…

Information Theory · Computer Science 2022-08-19 Sebastian Stern , Cong Ling , Robert F. H. Fischer

The non-ergodic fading channel is a useful model for various wireless communication channels in both indoor and outdoor environments. Building on Poltyrev's work on infinite lattice constellations for the Gaussian channel, we derive a…

Information Theory · Computer Science 2016-05-16 M. Punekar , J. J. Boutros

The perfect space-time block codes (STBCs) are based on four design criteria - full-rateness, non-vanishing determinant, cubic shaping and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at…

Information Theory · Computer Science 2012-12-12 K. Pavan Srinath , B. Sundar Rajan

Diversity order is an important measure for the performance of communication systems over MIMO fading channels. In this paper, we prove that in MIMO multiple access systems (or MIMO point-to-point systems with V-BLAST transmission),…

Information Theory · Computer Science 2016-11-15 Mahmoud Taherzadeh , Amin Mobasher , Amir K. Khandani
‹ Prev 1 2 3 10 Next ›