English
Related papers

Related papers: Towards a complete DMT classification of division …

200 papers

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

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

This paper considers shifted inverse determinant sums arising from the union bound of the pairwise error probability for space-time codes in multiple-antenna fading channels. Previous work by Vehkalahti et al. focused on the approximation…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Laura Luzzi , Jean-Claude Belfiore

In this paper we are concentrating on the diversity-multiplexing gain trade-off (DMT) of some space-time lattice codes. First we give a DMT bound for lattice codes having restricted dimension. We then recover the well known results of the…

Information Theory · Computer Science 2011-05-19 Roope Vehkalahti , Hsiao-feng Lu

Since the invention of space-time coding numerous algebraic methods have been applied in code design. In particular algebraic number theory and central simple algebras have been on the forefront of the research. In this paper we are turning…

Information Theory · Computer Science 2011-05-19 Roope Vehkalahti , Hsiao-feng Lu

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

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

In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…

Number Theory · Mathematics 2019-02-20 Alexander Gorodnik , Amos Nevo

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…

Information Theory · Computer Science 2017-01-11 Antonio Campello , Cong Ling , Jean-Claude Belfiore

In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel.…

Information Theory · Computer Science 2015-03-17 Walid Abediseid , Mohamed Oussama Damen

This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A general union bound based code design criterion is obtained…

Information Theory · Computer Science 2014-03-26 Laura Luzzi , Roope Vehkalahti

This work concentrates on the study of inverse determinant sums, which arise from the union bound on the error probability, as a tool for designing and analyzing algebraic space-time block codes. A general framework to study these sums is…

Information Theory · Computer Science 2013-10-01 Roope Vehkalahti , Hsiao-feng Lu , Laura Luzzi

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

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

For a locally compact second countable group G and a lattice subgroup Gamma, we give an explicit quantitative solution of the lattice point counting problem in general domains in G, provided that i) G has finite upper local dimension, and…

Dynamical Systems · Mathematics 2009-03-10 Alexander Gorodnik , Amos Nevo

An extension of the popular diversity-multiplexing tradeoff framework to the low-SNR (or wideband) regime is proposed. The concept of diversity gain is shown to be redundant in this regime since the outage probability is SNR-independent and…

Information Theory · Computer Science 2015-03-19 Sergey Loyka , Georgy Levin

We use finite group topological lattice gauge theory, also known as the quantum double model, as a lens to explore a notion of topological order enriched by a non-invertible symmetry. For invertible symmetry enriched topological order,…

Strongly Correlated Electrons · Physics 2026-05-28 Lea E. Bottini , Clement Delcamp , Edmund Heng , Campbell K. McLauchlan , Dominic J. Williamson

In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was…

Information Theory · Computer Science 2014-05-20 Amaro Barreal , Camilla Hollanti , David Karpuk , Hsiao-feng Lu

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

The problem of straggler mitigation in distributed matrix multiplication (DMM) is considered for a large number of worker nodes and a fixed small finite field. Polynomial codes and matdot codes are generalized by making use of algebraic…

Information Theory · Computer Science 2024-01-25 Adrián Fidalgo-Díaz , Umberto Martínez-Peñas
‹ Prev 1 2 3 10 Next ›