A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Sum-set Inequalities from Aligned Image Sets: Instruments for Robust GDoF Bounds
[article]
2017
arXiv
pre-print
Preserved Fulltext
Other Versions
These bounds generalize the aligned image sets approach, and are useful instruments to obtain GDoF characterizations for wireless networks, especially with multiple antenna nodes, subject to arbitrary ...
We obtain tight GDoF characterization for specific instance of this channel with the aid of sum-set inequalities. ...
and derive a tight GDoF bound for this channel using our sum-set inequalities. ...
arXiv:1703.01168v2
fatcat:sthmbg3n5zb4zd3izyumzjcsne
Sum-set inequalities from aligned image sets: Instruments for robust GDoF bounds
2017
2017 IEEE International Symposium on Information Theory (ISIT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These bounds generalize the aligned image sets approach, and are useful instruments to obtain GDoF characterizations for wireless networks, especially with multiple antenna nodes, subject to arbitrary ...
We obtain tight GDoF characterization for specific instance of this channel with the aid of sum-set inequalities. ...
and derive a tight GDoF bound for this channel using our sum-set inequalities. ...
doi:10.1109/isit.2017.8006615
dblp:conf/isit/DavoodiJ17
fatcat:w2ms22xfwfb5lhuoyo6mglhcwq
Exploring Aligned-Images Bounds: Robust Secure GDoF of 3-to-1 Interference Channel
2021
ICC 2021 - IEEE International Conference on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Sum-set inequalities based on Aligned-Images bounds have been recently introduced as essential elements of converse proofs for asymptotic/approximate wireless network capacity characterizations under robust ...
We identify regimes where existing sum-set inequalities are sufficient, settling the GDoF for those settings. ...
One of the most promising recent advances is the emergence of the so called Aligned-Images Sum-set Inequalities. ...
doi:10.1109/icc42927.2021.9500935
fatcat:t7fmu25mgvca7pultbpkcflppy
Optimality of Treating Inter-Cell Interference as Noise Under Finite Precision CSIT
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our result constitutes yet another successful application of robust outer bounds based on the aligned images (AI) approach. ...
We show that in this case, the GDoF optimality of mc-TIN extends to the entire mc-CTIN regime, where GDoF benefits due to interference alignment (IA) are lost. ...
The proof of our results is based on a new application of robust outer bounds based on the aligned images approach. By following in the footsteps of Chan et al. ...
arXiv:2001.05935v1
fatcat:mnlyyjwbz5grbjmzpn66j62veq
Cellular Networks With Finite Precision CSIT: GDoF Optimality of Multi-Cell TIN and Extremal Gains of Multi-Cell Cooperation
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2008.08945v1 fatcat:njlja6ceqncftjm3kiq3cqpwfy
The converse proof of this result relies on a new application of aligned images bounds. ...
We show that this extremal GDoF gain is bounded by small constants in the mc-TIN and mc-CTIN regimes, yet scales logarithmically with the number of cells in the mc-SLS regime. ...
For each cycle π ∈ Π, a cycle bound is a bound on the sum-GDoF of users in the set (s k , k) : s k ∈ l k , (l k , k) ∈ {π} . ...
arXiv:2008.08945v2
fatcat:lddqo7g6una3rpivrbjun6xmfi
Generalized Degrees of Freedom of the Symmetric Cache-Aided MISO Broadcast Channel With Partial CSIT
2019
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On the other hand, a cut-set-based argument in conjunction with a GDoF outer bound for a parallel MISO BC under channel uncertainty are used for the converse. ...
We further show that the characterized order-optimal GDoF is also attained in a decentralized setting, where no coordination is required for content placement in the caches. ...
The authors are also grateful to Reviewer 1 for suggesting a shorter and more direct proof for Lemma 1. ...
doi:10.1109/tit.2019.2914204
fatcat:my26gubupnghzilde5dvegidfq
Generalized Degrees of Freedom of the Symmetric Cache-Aided MISO Broadcast Channel with Partial CSIT
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
On the other hand, a cut-set-based argument in conjunction with a GDoF outer bound for a parallel MISO BC under channel uncertainty are used for the converse. ...
We further show that the characterized order-optimal GDoF is also attained in a decentralized setting, where no coordination is required for content placement in the caches. ...
The authors are also grateful to Reviewer 1 for suggesting a shorter and more direct proof for Lemma 1. ...
arXiv:1712.05244v2
fatcat:vnypegsbbnfx7bnztl5b2oyeue
On the Optimality of Treating Inter-Cell Interference as Noise: Downlink Cellular Networks and Uplink-Downlink Duality
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
of multi-cell TIN in the GDoF (and approximate capacity) sense. ...
This is accomplished by deriving a new genie-aided outer bound for the IBC, that reveals a novel BC-type order that holds amongst users in each constituent BC (or cell) under inter-cell interference, which ...
In this case, IA gains achieved in the CTIN regime will most likely collapse, as suggested by bounds based on aligned images (AI) [25, 26] . ...
arXiv:1909.12275v1
fatcat:kzicii2qsfgdfoju44r3mu44dq
Optimality of Simple Layered Superposition Coding in the 3 User MISO BC with Finite Precision CSIT
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
With α_ij representing the channel strength parameter for the link from the j^th antenna of the transmitter to the i^th receiver, we prove that SLS is GDoF optimal without the need for time-sharing if ...
We study the K=3 user multiple input single output (MISO) broadcast channel (BC) with M=3 antennas at the transmitter and 1 antenna at each receiver, from the generalized degrees of freedom (GDoF) perspective ...
In order to facilitate direct applications of AIS arguments in the future, a collection of basic sumset inequalities based on AIS is presented in [24] as essential instruments for robust GDoF bounds. ...
arXiv:1801.07419v2
fatcat:lxwylk4xlvcdzcdshdxnli6jcu
Implementation of Fog computing for reliable E-health applications
2015
2015 49th Asilomar Conference on Signals, Systems and Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
He received the B.A.Sc. degree (with honors) from the University of British Columbia, Vancouver, BC, Canada, in 1985 and the M.A.Sc. and Ph.D. degrees from The 5th generation (5G) wireless communication ...
An important aspect is robust and resource efficient preamble design to minimize missed detection and false alarm probabilities of service requests. ...
Moreover, we propose the achievable scheme for a certain setting that achieves sum DoF upper-bound. ...
doi:10.1109/acssc.2015.7421170
dblp:conf/acssc/CraciunescuMMKP15
fatcat:qm6mki5z6bcvrfimkmqjyrxaxm
Fundamental limits of robust interference management: from content-oblivious to content-aware wireless networks
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For a symmetric setting, in terms of channel strength levels, partial channel knowledge levels and cache sizes, we characterize the sum-generalized-degrees-of-freedom (sum-GDoF) up to a constant multiplicative ...
We further show that the characterized order-optimal sum-GDoF is also attained in a decentralized setting, where no coordination is required for content placement in the caches. ...
At the heart of our converse proof is a sum-GDoF upper-bound for a parallel MISO BC with partial CSIT, which extends a family of robust outer-bounds based on the aligned image sets approach, initially ...
doi:10.25560/79298
fatcat:qufeh3rf5zcsleosrtbdtaneqm