output
19922026
most citedA fast approach for overcomplete sparse decomposition based on smoothed L0 norm

1.1k citations

Showing 2017 · cs.ITShow all

12 papers · 2 filters

cs.IT2017★ 73 cited

Multi-antenna Interference Management for Coded Caching

Antti Tölli, Seyed Pooya Shariatpanahi, Jarkko Kaleva +1

A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup…

cs.IT2017★ 29 cited

Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis

Mahdi Haghifam, Mohammad Robat Mili, Behrooz Makki +2

We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords,…

cs.IT2017★ 3 cited

Iterative method for simultaneous sparse approximation

Sahar Sadrizadeh, Shahrzad Kiani, Mahdi Boloursaz +1

This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of depe…

cs.IT2017★ 7 cited

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes

Kamran Kalbasi, S. Jamaloddin Golestani

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellatio…

cs.IT2017

Storage, Communication, and Load Balancing Trade-off in Distributed Cache Networks

Mahdi Jafari Siavoshani, Ali Pourmiri, Seyed Pooya Shariatpanahi

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approa…

cs.IT2017

Energy-Efficient Transponder Configuration for FMF-based Elastic Optical Networks

Mohammad Hadi, Mohammad Reza Pakravan

We propose an energy-efficient procedure for transponder configuration in FMF-based elastic optical networks in which quality of service and physical constraints are guaranteed and…

cs.IT2017

MIMO Underwater Visible Light Communications: Comprehensive Channel Study, Performance Analysis, and Multiple-Symbol Detection

Mohammad Vahid Jamali, Pooya Nabavi, Jawad A. Salehi

In this paper, we analytically study the bit error rate (BER) performance of underwater visible light communication (UVLC) systems with binary pulse position modulation (BPPM). We…

cs.IT2017★ 24 cited

Existence and Continuity of Differential Entropy for a Class of Distributions

Hamid Ghourchian, Amin Gohari, Arash Amini

In this paper, we identify a class of absolutely continuous probability distributions, and show that the differential entropy is uniformly convergent over this space under the metr…

cs.IT2017

How Compressible are Innovation Processes?

Hamid Ghourchian, Arash Amini, Amin Gohari

The sparsity and compressibility of finite-dimensional signals are of great interest in fields such as compressed sensing. The notion of compressibility is also extended to infinit…

cs.IT2017★ 9 cited

Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2

Qian Yu, Mohammad Ali Maddah-Ali, A. Salman Avestimehr

We consider a basic caching system, where a single server with a database of files (e.g. movies) is connected to a set of users through a shared bottleneck link. Each user…

cs.IT2017★ 1 cited

On the Capacity of a Class of Signal-Dependent Noise Channels

Hamid Ghourchian, Gholamali Aminian, Amin Gohari +2

In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive Gaussian signal-dependent noise (AGSDN) channe…

cs.IT2017

Integer-Forcing Message Recovering in Interference Channels

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

In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compar…