The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Blind Demixing for Low-Latency Communication
Abstract
In next-generation wireless networks, low-latency communication is critical to support emerging diversified applications, e.g., tactile Internet and virtual reality. In this paper, a novel blind demixing approach is developed to reduce the channel signaling overhead, thereby supporting low-latency communication. Specifically, we develop a low-rank approach to recover the original information only based on the single observed vector without any channel estimation. To address the unique challenges of multiple non-convex rank-one constraints, the quotient manifold geometry of the product of complex symmetric rank-one matrices is exploited. This is achieved by equivalently reformulating the original problem that uses complex asymmetric matrices to the one that uses Hermitian positive semidefinite matrices. We further generalize the geometric concepts of the complex product manifold via element-wise extension of the geometric concepts of the individual manifolds. The scalable Riemannian optimization algorithms, i.e., the Riemannian gradient descent algorithm and the Riemannian trust-region algorithm, are then developed to solve the blind demixing problem efficiently with low iteration complexity and low iteration cost. The statistical analysis shows that the Riemannian gradient descent with spectral initialization is guaranteed to linearly converge to the ground truth signals provided sufficient measurements. In addition, the Riemannian trust-region algorithm is provable to conver…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The key observation is that blind demixing is able to perform low-latency data decoding for multiple users from the sum of bilinear measurements without channel estimation at both the transmitters and receivers [188], [189].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [188]
Citations
Cites
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Goldsmith, A. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511841224 · Cited by 10,658
Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications
Al-Fuqaha, A., Guizani, M., Mohammadi, M., Aledhari, M., & Ayyash, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2444095 · Cited by 8,630
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
Scaling up MIMO: Opportunities and challenges with very large arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., Edfors, O., Tufvesson, F., Print, P., Rusek, F., Persson, D., et al. (2013) · Cited by 4,089
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets
Durisi, G., Koch, T., & Popovski, P. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2537298 · Cited by 1,154
Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels
Bajwa, W. U., Haupt, J., Sayeed, A. M., & Nowak, R. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2042415 · Cited by 1,152
A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841349 · Cited by 883
Simsek, M., Aijaz, A., Dohler, M., Sachs, J., & Fettweis, G. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2525398 · Cited by 753
Manopt, a Matlab toolbox for optimization on manifolds
Boumal, N., Mishra, B., Absil, P.-A., & Sepulchre, R. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5200 · Cited by 737
Toward Interconnected Virtual Reality: Opportunities, Challenges, and Enablers
Bastug, E., Bennis, M., Medard, M., & Debbah, M. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1601089 · Cited by 550
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Global rates of convergence for nonconvex optimization on manifolds
Boumal, N., Absil, P.-A., & Cartis, C. (2019) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drx080 · Cited by 271
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
Ge, R., Jin, C., & Zheng, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.00708 · Cited by 199
RTRMC: A Riemannian trust-region method for low-rank matrix completion
Boumal, N., & Absil, P.-A. (2011) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 143
Fixed-rank matrix factorizations and Riemannian low-rank optimization
Mishra, B., Meyer, G., Bonnabel, S., & Sepulchre, R. (2012) · Computational statistics (Zeitschrift) · doi:10.1007/s00180-013-0464-z · Cited by 142
Sharp Recovery Bounds for Convex Demixing, with Applications
McCoy, M. B., & Tropp, J. A. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9191-2 · Cited by 108
Large-scale convex optimization for ultra-dense cloud-RAN
Shi, Y., Zhang, J., Letaief, K. B., Bai, B., & Chen, W. (2015) · IEEE Wireless Communications · doi:10.1109/mwc.2015.7143330 · Cited by 108
Self-citationBlind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
Ling, S., & Strohmer, T. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2701342 · Cited by 103
Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
Ling, S., & Strohmer, T. (2017) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iax022 · Cited by 61
Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
Shi, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2544758 · Cited by 56
Self-citationThe Achievable Performance of Convex DemixingPreprint
McCoy, M. B., & Tropp, J. A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.7478 · Cited by 45
Nonconvex Demixing From Bilinear Measurements
Dong, J., & Shi, Y. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2864660 · Cited by 37
Self-citationBlind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
Huang, W. T., & Hand, P. (2018) · SIAM Journal on Imaging Sciences · doi:10.1137/17m1151390 · Cited by 36
Radio interferometric calibration using a riemannian manifold
Yatawatta, S. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638382 · Cited by 22
On the interpolation of calibration solutions obtained in radio interferometry
Yatawatta, S. (2012) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/sts069 · Cited by 13
Painless Breakups—Efficient Demixing of Low Rank Matrices
Strohmer, T., & Wei, K. (2017) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-017-9564-4 · Cited by 10
Blind demixing and deconvolution with noisy data at near optimal rate
Stöger, D., Jung, P., & Krahmer, F. (2017) · Wavelets and Sparsity · doi:10.1117/12.2271571 · Cited by 5
Blind Demixing and Deconvolution with Noisy Data: Near-optimal Rate
Stöger, D., Jung, P., & Krahmer, F. (2017) · International ITG Workshop on Smart Antennas · Cited by 3
Research works printed but not linked: 1
- grant, 2014, CVX MATLAB Software for Disciplined Convex Programming
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
Self-citationBlind Over-the-Air Computation and Data Fusion via Provable Wirtinger Flow
Dong, J., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2970338 · Cited by 65
Self-citationLearning Shallow Neural Networks via Provable Gradient Descent with Random Initialization
Xia, S., & Shi, Y. (2019) · ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2019.8682855 · Cited by 7
Self-citation
Metadata
- Authors
- Dong, J., Yang, K., & Shi, Y.
- Affiliations
- ShanghaiTech University (CN)
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2019-02
- Volume
- 18
- Issue
- 2
- Pages
- 897-911
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W2906602402
- Cited by
- 22
- References
- 34
- Citations by year
- 2026: 1 · 2024: 3 · 2023: 1 · 2022: 1 · 2021: 4 · 2020: 6 · 2019: 5
- FWCI
- 2.95
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Wireless Communications (publishedVersion)
- Funders
- National Natural Science Foundation of China (61601290)
- Shanghai Sailing Program (16YF1407700)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
- Physical Sciences › Engineering › Aerospace Engineering › Radar Systems and Signal Processing
- Keywords
- low-latency communication, low-rank recovery, quotient manifolds, positive semidefinite Hermitian matrices, Riemannian optimization, Riemannian gradient descent, tactile internet, virtual reality
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.