Shansuo Liang
Orcid: 0000-0002-4589-4138
According to our database1,
Shansuo Liang
authored at least 22 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Commun., May, 2024
Proceedings of the IEEE International Conference on Communications, 2024
2023
IEEE Trans. Wirel. Commun., November, 2023
IEEE Commun. Lett., August, 2023
Orthogonal AMP for Problems With Multiple Measurement Vectors and/or Multiple Transforms.
IEEE Trans. Signal Process., 2023
Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models.
Proceedings of the IEEE Information Theory Workshop, 2023
Lossy Compression via Sparse Regression Codes: An Approximate Message Passing Approach.
Proceedings of the IEEE Information Theory Workshop, 2023
Proceedings of the 12th International Symposium on Topics in Coding, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise.
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
Slotted Concatenated Coding Scheme for Asynchronous Uplink Unsourced Random Access with a Massive MIMO Receiver.
Proceedings of the 2022 IEEE 33rd Annual International Symposium on Personal, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the IEEE Global Communications Conference, 2022
Modulation for Massive Unsourced Random Access Based on Tensor Block Term Decomposition.
Proceedings of the IEEE Globecom 2022 Workshops, 2022
2020
IEEE Trans. Commun., 2020
On the Finite Length Performance of Sparse Regression Codes with Peak-Power Limitation.
Proceedings of the IEEE Information Theory Workshop, 2020
Proceedings of the IEEE Global Communications Conference, 2020
2019
IEEE Wirel. Commun. Lett., 2019
IEEE Trans. Wirel. Commun., 2019
2017
Clipping Can Improve the Performance of Spatially Coupled Sparse Superposition Codes.
IEEE Commun. Lett., 2017