Farzad Parvaresh

Orcid: 0000-0001-5292-0915

According to our database1, Farzad Parvaresh authored at least 47 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
High Impedance Faults Detection in Distribution Systems Using Signal Correlations.
IEEE Trans. Instrum. Meas., 2024

2023
On the diversity-multiplexing trade-off of hybrid diamond relay channels.
Phys. Commun., October, 2023

New upper bounds on the size of permutation codes under Kendall τ-metric.
Cryptogr. Commun., September, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.
IEEE J. Sel. Areas Inf. Theory, 2023

4-Cycle Free Spatially Coupled LDPC Codes with an Explicit Construction.
CoRR, 2023

2022
New table of Bounds on Permutation Codes under Kendall τ-Metric.
Proceedings of the 10th Iran Workshop on Communication and Information Theory, 2022

2021
On the performance of ECF-based multi-threshold receiver in NOMA systems for vehicular communications with unknown impulsive noise.
Veh. Commun., 2021

ECF-Based Estimator for the LOS Power in Uplink NOMA System With Unknown Impulsive Noise.
IEEE Signal Process. Lett., 2021

DMT analysis and optimal scheduling for two-hop parallel relay networks.
Phys. Commun., 2021

DMT analysis and optimal scheduling for FSO relaying communications.
IET Commun., 2021

A New Probabilistic Constellation Shaping Scheme for APSK Modulation.
Proceedings of the Iran Workshop on Communication and Information Theory, 2021

2020
On optimal relaying strategies for VANETs over double Nakagami-m fading channels.
Wirel. Networks, 2020

Coded Load Balancing in Cache Networks.
IEEE Trans. Parallel Distributed Syst., 2020

2019
Decentralized Hierarchical Coded Caching Over Heterogeneous Wireless Networks with Multi-level Popularity Content.
Wirel. Pers. Commun., 2019

Two-Dimensional Super-Resolution via Convex Relaxation.
IEEE Trans. Signal Process., 2019

High Resolution Compressed Sensing Radar Using Difference Set Codes.
IEEE Trans. Signal Process., 2019

Target recognition and discrimination based on multiple-frequencies LFM signal with subcarrier hopping.
Multidimens. Syst. Signal Process., 2019

Tomlinson-Harashima precoding for transmitter-side inter-symbol interference cancellation in PSK modulation.
IET Commun., 2019

Eliminating Impulsive Noise in Pilot-Aided OFDM Channels via Dual of Penalized Atomic Norm.
IEEE Commun. Lett., 2019

2018
Power System Frequency Estimation Using Adaptive Accelerated MUSIC.
IEEE Trans. Instrum. Meas., 2018

Phasor Estimation Algorithm Based on Complex Frequency Filters for Digital Relaying.
IEEE Trans. Instrum. Meas., 2018

2017
Using NLMS Algorithms in Cyclostationary-Based Spectrum Sensing for Cognitive Radio Networks.
Wirel. Pers. Commun., 2017

Diversity-Multiplexing Trade-Off of Half-Duplex Single Relay Networks.
IEEE Trans. Inf. Theory, 2017

2016
Computing diversity-multiplexing trade-off of static QMF communication strategy in half-duplex diamond relay channels.
Proceedings of the 8th International Symposium on Telecommunications, 2016

2015
On the suboptimality of DDF and static QMF communication strategies in half-duplex single relay networks.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

2014
Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit.
IEEE Trans. Inf. Theory, 2014

Efficient Capacity Computation and Power Optimization for Relay Networks.
IEEE Trans. Inf. Theory, 2014

Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations.
IEEE Trans. Inf. Theory, 2014

Phase retrieval of sparse L-ary signals from magnitudes of their Fourier transform.
Proceedings of the Iran Workshop on Communication and Information Theory, 2014

2013
Using Superposition Codebooks and Partial Decode-and-Forward in Low-SNR Parallel Relay Networks.
IEEE Trans. Inf. Theory, 2013

On Min-Cut Algorithms for Half-Duplex Relay Networks
CoRR, 2013

On computing half-duplex relaying capacity in networks with orthogonal channels.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

On efficient min-cut approximations in half-duplex relay networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums.
SIAM J. Discret. Math., 2012

Bounds on the minimum energy-per-bit for bursty traffic in diamond networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Approximately counting the number of constrained arrays via the sum-product algorithm.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Superposition of binary and Gaussian codebooks to relay data in diamond networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On computing the capacity of relay networks in polynomial time.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Asymptotic enumeration of binary matrices with bounded row and column weights.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009
On the reconstruction of block-sparse signals with an optimal number of measurements.
IEEE Trans. Signal Process., 2009

2008
Recovering Sparse Signals Using Sparse Measurement Matrices in Compressed DNA Microarrays.
IEEE J. Sel. Top. Signal Process., 2008

Sparse measurements, compressed sampling, and DNA microarrays.
Proceedings of the IEEE International Conference on Acoustics, 2008

Explicit measurements with almost optimal thresholds for compressed sensing.
Proceedings of the IEEE International Conference on Acoustics, 2008

2007
Algebraic list-decoding of error-correcting codes.
PhD thesis, 2007

2006
On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...