Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Shirani Chaharsooghi, Farhad
Positions
Assistant Professor
,
Knight Foundation School of Computing and Information Sciences
,
College of Engineering and Computing
fshirani@fiu.edu
Share this page
Twitter
Email
Copy link
Share
Scholarly & Creative Works
Research
Contact
Identifiers
View All
Scholarly & Creative Works
selected scholarly works & creative activities
Article
2022
Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems
.
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
. 40:1632-1651.
Full Text via DOI:
10.1109/JSAC.2022.3143212
Web of Science:
000782800100020
2022
Fundamental Privacy Limits in Bipartite Networks Under Active Attacks
.
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
. 40:940-954.
Full Text via DOI:
10.1109/JSAC.2022.3142299
Web of Science:
000757850600020
2022
MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies
.
IEEE TRANSACTIONS ON COMMUNICATIONS
. 70:1580-1594.
Full Text via DOI:
10.1109/TCOMM.2021.3133430
Web of Science:
000770007700013
2021
A New Achievable Rate-Distortion Region for Distributed Source Coding
.
IEEE TRANSACTIONS ON INFORMATION THEORY
. 67:4485-4503.
Full Text via DOI:
10.1109/TIT.2021.3084307
Web of Science:
000663524000013
2021
An Algebraic and Probabilistic Framework for Network Information Theory
Full Text via DOI:
10.1561/0100000083
Web of Science:
000602529700001
2019
A General Framework for Temporal Fair User Scheduling in NOMA Systems
Full Text via DOI:
10.1109/JSTSP.2019.2903745
Web of Science:
000469330100003
Conference
2021
On Graph Matching Using Generalized Seed Side-Information
. 2726-2731.
Full Text via DOI:
10.1109/ISIT45174.2021.9518130
Web of Science:
000701502202138
2020
ON THROUGHPUT OF MILLIMETER WAVE MIMO SYSTEMS WITH LOW RESOLUTION ADCS
.
2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS
. 5255-5259.
Full Text via DOI:
10.1109/icassp40776.2020.9053050
Web of Science:
000615970405103
2019
On the Sub-Optimality of Single-Letter Coding Over Networks
.
IEEE TRANSACTIONS ON INFORMATION THEORY
. 6115-6135.
Full Text via DOI:
10.1109/TIT.2019.2917434
Web of Science:
000487041200010
2019
Quasi Structured Codes for Multi-Terminal Communications
.
IEEE TRANSACTIONS ON INFORMATION THEORY
. 6263-6289.
Full Text via DOI:
10.1109/TIT.2019.2930591
Web of Science:
000487041200019
2019
A Concentration of Measure Approach to Database De-anonymization
. 2748-2752.
Full Text via DOI:
10.1109/isit.2019.8849392
Web of Science:
000489100302169
2019
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers
. 602-606.
Full Text via DOI:
10.1109/isit.2019.8849484
Web of Science:
000489100300122
2019
On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints
. 2534-2538.
Full Text via DOI:
10.1109/isit.2019.8849623
Web of Science:
000489100302126
2019
Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems
Full Text via DOI:
10.1109/pimrcw.2019.8880848
Web of Science:
000535511200006
2019
Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems
. 597-601.
Full Text via DOI:
10.1109/isit.2019.8849378
Web of Science:
000489100300121
2018
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes
.
IEEE TRANSACTIONS ON INFORMATION THEORY
. 3781-3809.
Full Text via DOI:
10.1109/TIT.2018.2804439
Web of Science:
000430747100033
2018
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback
. 1126-1130.
Web of Science:
000448139300226
2018
Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels
. 2356-2360.
Web of Science:
000448139300473
2018
Matching Graphs with Community Structure: A Concentration of Measure Approach
. 1028-1035.
Web of Science:
000461021200143
2018
Opportunistic Temporal Fair Scheduling for Non-Orthogonal Multiple Access
. 391-398.
Web of Science:
000461021200056
2018
Optimal Active Social Network De-anonymization Using Information Thresholds
. 1445-1449.
Web of Science:
000448139300290
2018
Typicality Matching for Pairs of Correlated Graphs
. 221-225.
Web of Science:
000448139300045
2017
A New Achievable Rate Region for Multiple-Access Channel with States
. 36-40.
Web of Science:
000430345200008
2017
An Information Theoretic Framework for Active De-anonymization in Social Networks Based on Group Memberships
. 470-477.
Web of Science:
000428047800065
2017
On the Correlation between Boolean Functions of Sequences of Random Variables
. 1301-1305.
Web of Science:
000430345201073
2017
On the Necessity of Structured Codes for Communications over MAC with Feedback
. 2298-2302.
Web of Science:
000430345202073
2017
On the Sub-optimality of Single-letter Coding in Multi-terminal Communications
. 1823-1827.
Web of Science:
000430345201178
2017
Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
. 253-257.
Web of Science:
000442659900045
2016
New Sufficient Conditions for Multiple-Access Channel with Correlated Sources
. 2019-2023.
Web of Science:
000390098702017
2016
Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding
. 730-734.
Web of Science:
000390098700146
2016
Trade-off between Communication and Cooperation in the Interference Channel
. 2214-2218.
Web of Science:
000390098702056
2015
Beyond Group Capacity in Multi-terminal Communications
. 2081-2085.
Web of Science:
000380904702027
2015
New Lattice Codes for Multiple-Descriptions
. 1580-1584.
Web of Science:
000380904701127
2014
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem
. 576-580.
Web of Science:
000346496100115
2014
Finite Block-Length Gains in Distributed Source Coding
. 1702-1706.
Web of Science:
000346496101168
2013
Distributed Source Coding in Absence of Common Components
. 1362-1366.
Web of Science:
000348913401099
2011
Multiple access channel with correlated channel states and cooperating encoders
. 628-632.
Full Text via DOI:
10.1109/ITW.2011.6089573
2011
A New Method for Variable Elimination in Systems of Inequations
. 1215-1219.
Web of Science:
000297465101080
Preprint
2024
CorBin-FL: A Differentially Private Federated Learning Mechanism using Common Randomness
2024
On Non-Interactive Simulation of Distributed Sources with Finite Alphabets
2024
Non-Linear Analog Processing Gains in Task-Based Quantization
2024
Quantum Advantage in Non-Interactive Source Simulation
2023
The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation
2022
On Non-Interactive Source Simulation via Fourier Transform
2022
Capacity Gains in MIMO Systems with Few-Bit ADCs Using Nonlinear Analog Circuits
2022
Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms
2022
Quantifying the Capacity Gains in Coarsely Quantized SISO Systems with Nonlinear Analog Operators
2022
Lattices from Linear Codes: Source and Channel Networks
2022
Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks
2022
MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations
2021
Fundamental Privacy Limits in Bipartite Networks under Active Attacks
2020
A Concentration of Measure Approach to Correlated Graph Matching
2020
On the Joint Typicality of Permutations of Sequences of Random Variables
2019
A New Achievable Rate-Distortion Region for Distributed Source Coding
2019
On the Rates of Convergence in Learning of Optimal Temporally Fair Schedulers
2019
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers
2019
Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems
2019
A Concentration of Measure Approach to Database De-anonymization
2018
Matching Graphs with Community Structure: A Concentration of Measure Approach
2018
A General Framework for Temporal Fair User Scheduling in NOMA Systems
2018
Typicality Matching for Pairs of Correlated Graphs
2018
Optimal Active Social Network De-anonymization Using Information Thresholds
2018
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback
2017
Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
2017
An Information Theoretic Framework for Active De-anonymization in Social Networks Based on Group Memberships
2017
On the Sub-optimality of Single-Letter Coding over Networks
2017
On the Sub-optimality of Single-letter Coding in Multi-terminal Communications
2017
On the Correlation between Boolean Functions of Sequences of Random Variables
2016
Trade-off between Communication and Cooperation in the Interference Channel
2016
Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding
2016
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes
2014
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem
Research
principal investigator on
Collaborative Research: CCSS: Towards Energy-Efficient Millimeter Wave Wireless Networks: A Unified Systems and Circuits Framework
awarded by
National Science Foundation
2023 - 2026
Collaborative Research: CIF: Small: A New Paradigm for Distributed Information Processing, Simulation and Inference in Networks: The Promise of Law of Small Numbers
awarded by
National Science Foundation
2022 - 2024
co-principal investigator on
Grant
National University Transportation Center for Transportation Cyber Security and Resiliency (TraCR)
awarded by
U.S. Department of Transportation
2023 - 2024
Contact
full name
Farhad
Shirani Chaharsooghi
Identifiers
ORCID iD
https://orcid.org/0000-0003-1316-3899
(confirmed)
visualizations
Co-author Network
Co-investigator Network
Map of Science