output
19922026
Showing 2016 · cs.ITShow all

20 papers · 2 filters

cs.IT2016★ 27 cited

Reliable recovery of hierarchically sparse signals for Gaussian and Kronecker product measurements

Ingo Roth, Martin Kliesch, Axel Flinth +2

We propose and analyze a solution to the problem of recovering a block sparse signal with sparse blocks from linear measurements. Such problems naturally emerge inter alia in the c…

cs.IT2016

Private Information Retrieval in Distributed Storage Systems Using an Arbitrary Linear Code

Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat

We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate …

cs.IT2016★ 21 cited

Low-latency Ultra Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes

Johan Östman, Giuseppe Durisi, Erik G. Ström +3

Future autonomous systems require wireless connectivity able to support extremely stringent requirements on both latency and reliability. In this paper, we leverage recent developm…

cs.IT2016★ 7 cited

Vehicle-to-Vehicle Communications with Urban Intersection Path Loss Models

Mouhamed Abdulla, Erik Steinmetz, Henk Wymeersch

Vehicle-to-vehicle (V2V) communication can improve road safety and traffic efficiency, particularly around critical areas such as intersections. We analytically derive V2V success…

cs.IT2016

Transmission Strategies for Remote Estimation with an Energy Harvesting Sensor

Ayca Ozcelikkale, Tomas McKelvey, Mats Viberg

We consider the remote estimation of a time-correlated signal using an energy harvesting (EH) sensor. The sensor observes the unknown signal and communicates its observations to a…

cs.IT2016★ 67 cited

Location-Aided Pilot Contamination Avoidance for Massive MIMO Systems

L. Srikar Muppirisetty, Themistoklis Charalambous, Johnny Karout +2

Pilot contamination, defined as the interference during the channel estimation process due to reusing the same pilot sequences in neighboring cells, can severely degrade the perfor…

cs.IT2016★ 8 cited

Finite Length Weight Enumerator Analysis of Braided Convolutional Codes

Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat

Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes (SC-TCs) with excellent belief propagation (BP) thresholds. In this paper, we analyze the perfo…

cs.IT2016★ 391 cited

Direct Localization for Massive MIMO

Nil Garcia, Henk Wymeersch, Erik G. Larsson +2

Large-scale MIMO systems are well known for their advantages in communications, but they also have the potential for providing very accurate localization thanks to their high angul…

cs.IT2016

Unequal Error Protection in Coded Slotted ALOHA

Mikhail Ivanov, Fredrik Brannstrom, Alexandre Graell i Amat +1

We analyze the performance of coded slotted ALOHA systems for a scenario where users have different error protection requirements and correspondingly can be divided into user class…

cs.IT2016★ 13 cited

Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations

Alex Alvarado, Erik Agrell, Fredrik Brännström

A classical problem in digital communications is to evaluate the symbol error probability (SEP) and bit error probability (BEP) of a multidimensional constellation over an additive…

cs.IT2016★ 784 cited

Massive Machine-type Communications in 5G: Physical and MAC-layer solutions

Carsten Bockelmann, Nuno Pratas, Hosein Nikopour +5

Machine-type communications (MTC) are expected to play an essential role within future 5G systems. In the FP7 project METIS, MTC has been further classified into "massive Machine-T…

cs.IT2016★ 4 cited

Improved Lower Bounds on Mutual Information Accounting for Nonlinear Signal-Noise Interaction

Naga V. Irukulapati, Marco Secondini, Erik Agrell +2

In fiber-optic communications, evaluation of mutual information (MI) is still an open issue due to the unavailability of an exact and mathematically tractable channel model. Tradit…

cs.IT2016★ 66 cited

Spatially Coupled Turbo-Like Codes

Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat

In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider…

cs.IT2016★ 33 cited

On the Performance of RF-FSO Links with and without Hybrid ARQ

Behrooz Makki, Tommy Svensson, Thomas Eriksson +1

This paper studies the performance of hybrid radio-frequency (RF) and free-space optical (FSO) links assuming perfect channel state information (CSI) at the receiver. Considering t…

cs.IT2016

Performance Analysis of ARQ-based RF-FSO Links

Behrooz Makki, Tommy Svensson, Thomas Eriksson +1

In this letter, we study the performance of hybrid radio-frequency (RF) and free-space optical (FSO) links using automatic repeat request (ARQ). We derive closed-form expressions f…

cs.IT2016★ 425 cited

Throughput Analysis of Massive MIMO Uplink with Low-Resolution ADCs

Sven Jacobsson, Giuseppe Durisi, Mikael Coldrey +2

We investigate the uplink throughput achievable by a multiple-user (MU) massive multiple-input multiple-output (MIMO) system in which the base station is equipped with a large numb…

cs.IT2016★ 6 cited

Modulation Format Independent Joint Polarization and Phase Tracking for Coherent Receivers

Cristian B. Czegledi, Erik Agrell, Magnus Karlsson +1

The state of polarization and the carrier phase drift dynamically during transmission in a random fashion in coherent optical fiber communications. The typical digital signal proce…

cs.IT2016★ 1 cited

A Beta-Beta Achievability Bound with Applications

Wei Yang, Austin Collins, Giuseppe Durisi +2

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson functions is proposed. This bound is the dual of a converse bound established ea…

cs.IT2016

Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks

Mohsen Hejazi, Seyed Mohammad Azimi-Abarghouyi, Behrooz Makki +2

This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of…

cs.IT2016★ 50 cited

Distributed Storage in Mobile Wireless Networks with Device-to-Device Communication

Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova +1

We consider the use of distributed storage (DS) to reduce the communication cost of content delivery in wireless networks. Content is stored (cached) in a number of mobile devices…