2020
DOI: 10.1109/tsp.2020.2964250
|View full text |Cite
|
Sign up to set email alerts
|

Nonsmooth Optimization Algorithms for Multicast Beamforming in Content-Centric Fog Radio Access Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(16 citation statements)
references
References 40 publications
0
16
0
Order By: Relevance
“…It is plausible that a finer quantization results in a reduced error covariance ∆(x i ), hence leading to a higher throughput, but the soft-transfer of the quantized signals is limited by the capacity of STF according to (6). As analysed in detail in [21], SFT is much more efficient than hard-transfer fronthauling (HFT) in the face of limited fronthauling capacity. Furthermore, the signal transmitted by RRH i is…”
Section: B Content Transmission and Receptionmentioning
confidence: 99%
See 2 more Smart Citations
“…It is plausible that a finer quantization results in a reduced error covariance ∆(x i ), hence leading to a higher throughput, but the soft-transfer of the quantized signals is limited by the capacity of STF according to (6). As analysed in detail in [21], SFT is much more efficient than hard-transfer fronthauling (HFT) in the face of limited fronthauling capacity. Furthermore, the signal transmitted by RRH i is…”
Section: B Content Transmission and Receptionmentioning
confidence: 99%
“…In [18], no complexity analysis was provided, while the numerical examples in [19] are limited to the simplest and lowest-dimensional case of three single-antenna RRHs (n t = 1) serving three users. The path-following algorithms proposed in [21] handled more practical scenarios of five fourantenna RRHs serving five users, which became possible as a benefit of the structural exploitation of approximate zeroforcing beamforming. In contrast to the iterations used in [18], [19], the path-following algorithms of [21] invoke a convex fractional solver of polynomial complexity at each iteration.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Huang, J., and Dragotti, P.L., Learning Deep Analysis Dictionaries for Image Super-Resolution; TSP 2020 6633-6648 Huang, J., see Wang, X., TSP 202081-96 Huang, K., see Du, Y., TSP 20202128-2142Huang, K., see Fu, X., TSP 20202170-2185 Huang, K., see Yang, B., TSP 20202857-2869 Huang, L., see Wang, Y., TSP 2020 5457-5472 Huang, S., Gupta, S., and Dokmanic, I., Solving Complex Quadratic Systems With Full-Rank Random Matrices; TSP 2020 4782-4796 Huang, T., see Liu, X., TSP 2020 3929-3944 Huang, T., Shlezinger, N., Xu, X., Ma, D., Liu, Y., and Eldar, Y.C., Multi-Car-rier Agile Phased Array Radar; TSP 2020 5706-5721 Huang, T., Shlezinger, N., Xu, X., Liu, Y., and Eldar, Y.C., MAJoRCom: A Dual-Function Radar Communication System Using Index Modulation; TSP 2020 3423-3438 Huang, Y., see Li, J., TSP 2020 5602-5616 Huang, Y., Vorobyov, S.A., and Luo, Z., Quadratic Matrix Inequality Approach to Robust Adaptive Beamforming for General-Rank Signal Model; TSP 2020 2244-2255 Huang, Y., see 1515-1528Huemer, M., see Hofbauer, C., TSP 2020 Huo, K., see Zhang, X., TSP 2020 5138-5151 Hutchinson, M.N., see Rubaiyat, A.H.M., TSP 2020 3312-3324 Hwang, W., see Nguyen, H.T., TSP 20201455-1469 Hwang, W., and Heinecke, A., Un-Rectifying Non-Linear Networks for Signal…”
Section: + Check Author Entry For Coauthorsmentioning
confidence: 99%
“…Nonsmooth Optimization Algorithms for Multicast Beamforming in Content-Centric Fog Radio Access Networks. Nguyen, H.T., +, TSP 20201455-1469…”
Section: Internetmentioning
confidence: 99%