English
Related papers

Related papers: Fundamental Limits of Infinite Constellations in M…

200 papers

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

Information Theory · Computer Science 2016-11-17 Johan Östman , Wei Yang , Giuseppe Durisi , Tobias Koch

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

Zhang et. al. recently derived upper and lower bounds on the achievable diversity of an N_R x N_T i.i.d. Rayleigh fading multiple antenna system using transmit antenna selection, spatial multiplexing and a linear receiver structure. For the…

Information Theory · Computer Science 2007-07-13 J. Jalden , B. Ottersten

The optical fiber multiple-input multiple-output (MIMO) channel with intensity modulation and direct detection (IM/DD) per spatial path is treated. The spatial dimensions represent the multiple modes employed for transmission and the…

Information Theory · Computer Science 2022-01-28 Metodi P. Yankov , Francesco Da Ros , Søren Forchhammer , Lars Gruner-Nielsen

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

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

We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…

Information Theory · Computer Science 2016-11-17 Camilla Hollanti , Jyrki Lahtonen , Hsiao-feng Francis 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. A design criterion based on the normalized minimum determinant is proposed…

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

We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark.…

Information Theory · Computer Science 2007-07-13 Albert Guillen i Fabregas , Emanuele Viterbo

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…

Information Theory · Computer Science 2009-12-24 S. Dusad , S. N. Diggavi

In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity…

Information Theory · Computer Science 2007-09-04 Mahmoud Taherzadeh , Amir K. Khandani

This paper surveys recent advances in the area of very large MIMO systems. With very large MIMO, we think of systems that use antenna arrays with an order of magnitude more elements than in systems being built today, say a hundred antennas…

Information Theory · Computer Science 2015-06-03 Fredrik Rusek , Daniel Persson , Buon Kiong Lau , Erik G. Larsson , Thomas L. Marzetta , Ove Edfors , Fredrik Tufvesson

In this paper, we analyze the fundamental tradeoff of diversity and multiplexing in multi-input multi-output (MIMO) channels with imperfect channel state information at the transmitter (CSIT). We show that with imperfect CSIT, a higher…

Information Theory · Computer Science 2009-08-16 Xiao Juan Zhang , Yi Gong

We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-$m$ block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the…

Information Theory · Computer Science 2007-11-26 Albert Guillen i Fabregas , Giuseppe Caire

In this correspondence, first-tier indirect (direct) discernible constellation expansions are defined for generalized orthogonal designs. The expanded signal constellation, leading to so-called super-orthogonal codes, allows the achievement…

Information Theory · Computer Science 2011-09-06 Dumitru Mihai Ionescu , Zhiyuan Yan

Future wireless networks must provide ever higher data rates. The available bandwidth increases roughly linearly as we increase the carrier frequency, but the range shrinks drastically. This paper explores if we can instead reach massive…

Signal Processing · Electrical Eng. & Systems 2024-12-02 Amna Irshad , Alva Kosasih , Emil Björnson , Luca Sanguinetti

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

Recently, the remarkable potential of a multiple-input multiple-output (MIMO) wireless communication system was unveiled for its ability to provide spatial diversity or multiplexing gains. For MIMO diversity schemes, it is already known…

Information Theory · Computer Science 2007-07-13 Hongyuan Zhang , Huaiyu Dai , Quan Zhou , Brian L. Hughes

The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their…

Information Theory · Computer Science 2008-05-13 Oren Somekh , Osvalso Simeone , Benjamin M. Zaidel , H. Vincent Poor , Shlomo Shamai
‹ Prev 1 2 3 10 Next ›