51 citations · 101 across the 9 of their papers we have counts for
11 papers
4-Cycle Free Spatially Coupled LDPC Codes with an Explicit Construction
Zeinab Roostaie, Mohammad Gholami, Farzad Parvaresh
Spatially coupled low-density parity-check (SC-LDPC) codes are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used.…
New Upper Bounds on the Size of Permutation Codes under Kendall -Metric
Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari +3
We first give two methods based on the representation theory of symmetric groups to study the largest size of permutation codes of length i.e. subsets of the set …
Eliminating Impulsive Noise in Pilot-Aided OFDM Channels via Dual of Penalized Atomic Norm
Iman Valiulahi, Farzad Parvaresh, Ali Asghar Beheshti
In this paper, we propose a novel estimator for pilot-aided orthogonal frequency division multiplexing (OFDM) channels in an additive Gaussian and impulsive perturbation environmen…
Two-Dimensional Super-Resolution via Convex Relaxation
Iman Valiulahi, Sajad Daei, Farzan Haddadi +1
In this paper, we address the problem of recovering point sources from two dimensional low-pass measurements, which is known as super-resolution problem. This is the fundamental co…
Coded Load Balancing in Cache Networks
Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri +1
We consider load balancing problem in a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Previously proposed load balancing solu…
High Resolution Compressed Sensing Radar using Difference Set Codes
Iman Taghavi, Mohamad F. Sabahi, Farzad Parvaresh +1
In this paper, we consider compressive sensing (CS)-based recovery of delays and Doppler frequencies of targets in high resolution radars. We propose a novel sub-Nyquist sampling m…
On Min-Cut Algorithms for Half-Duplex Relay Networks
Raúl Etkin, Farzad Parvaresh, Ilan Shomorony +1
Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem…
Using Superposition Codebooks and Partial Decode and Forward in Low SNR Parallel Relay Networks
Farzad Parvaresh, Raul Etkin
A new communication scheme for Gaussian parallel relay networks based on superposition coding and partial decoding at the relays is presented. Some specific examples are proposed i…
Diamond Networks with Bursty Traffic: Bounds on the Minimum Energy-Per-Bit
Ilan Shomorony, Raúl Etkin, Farzad Parvaresh +1
When data traffic in a wireless network is bursty, small amounts of data sporadically become available for transmission, at times that are unknown at the receivers, and an extra am…
Efficient Capacity Computation and Power Optimization for Relay Networks
Farzad Parvaresh, Raul Etkin
The capacity or approximations to capacity of various single-source single-destination relay network models has been characterized in terms of the cut-set upper bound. In principle…
On the reconstruction of block-sparse signals with an optimal number of measurements
Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi
Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of…