default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShansuo Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Lei Liu
, Shansuo Liang, Li Ping:
On Capacity Optimality of OAMP: Beyond IID Sensing Matrices and Gaussian Signaling. IEEE Trans. Commun. 72(5): 2519-2535 (2024)- [c13]Huiqi Liu, Wai Ho Mow, Shansuo Liang:
Generalization and Construction of Single-Section Sparse Regression Codes. ICC 2024: 611-616 - 2023
- [j8]Haiwen Cao, Jiongyue Xing, Shansuo Liang:
CRC-Aided Sparse Regression Codes for Unsourced Random Access. IEEE Commun. Lett. 27(8): 1944-1948 (2023) - [j7]Lei Liu, Yiyao Cheng, Shansuo Liang, Jonathan H. Manton, Li Ping:
On OAMP: Impact of the Orthogonal Principle. IEEE Trans. Commun. 71(5): 2992-3007 (2023) - [j6]Yiyao Cheng, Lei Liu, Shansuo Liang, Jonathan H. Manton, Li Ping:
Orthogonal AMP for Problems With Multiple Measurement Vectors and/or Multiple Transforms. IEEE Trans. Signal Process. 71: 4423-4440 (2023) - [j5]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
An Efficient Two-Stage SPARC Decoder for Massive MIMO Unsourced Random Access. IEEE Trans. Wirel. Commun. 22(11): 8275-8289 (2023) - [c12]Yizhou Xu, Yuhao Liu, Shansuo Liang, Ting-Yi Wu, Bo Bai, Jean Barbier, TianQi Hou:
Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing. ISIT 2023: 785-790 - [c11]Teng Fu, Yuhao Liu, Jean Barbier, Marco Mondelli, Shansuo Liang, TianQi Hou:
Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. ISIT 2023: 1178-1183 - [c10]Yiyao Cheng, Lei Liu, Shansuo Liang, Jonathan H. Manton, Li Ping:
Orthogonal AMP for Problems with Multiple Measurement Vectors and/or Multiple Transforms. ISTC 2023: 1-5 - [c9]Nian Guo, Shansuo Liang, Wei Han:
Power Allocation for the Base Matrix of Spatially Coupled Sparse Regression Codes. ISTC 2023: 1-5 - [c8]Huihui Wu, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
Lossy Compression via Sparse Regression Codes: An Approximate Message Passing Approach. ITW 2023: 288-293 - [c7]Yizhou Xu, TianQi Hou, Shansuo Liang, Marco Mondelli:
Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models. ITW 2023: 294-298 - [i10]Teng Fu, Yuhao Liu, Jean Barbier, Marco Mondelli, Shansuo Liang, TianQi Hou:
Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. CoRR abs/2302.03306 (2023) - [i9]Yizhou Xu, Yuhao Liu, Shansuo Liang, Ting-Yi Wu, Bo Bob Bai, Jean Barbier, TianQi Hou:
Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing. CoRR abs/2303.08406 (2023) - [i8]Yiyao Cheng, Lei Liu, Shansuo Liang, Jonathan H. Manton, Li Ping:
Orthogonal AMP for Problems with Multiple Measurement Vectors and/or Multiple Transforms. CoRR abs/2304.08038 (2023) - [i7]Nian Guo, Shansuo Liang, Wei Han:
Power Allocation for the Base Matrix of Spatially Coupled Sparse Regression Codes. CoRR abs/2305.07865 (2023) - 2022
- [c6]Zhenting Luan, Yuchi Wu, Shansuo Liang, Wei Han, Bo Bai, Liping Zhang:
Modulation for Massive Unsourced Random Access Based on Tensor Block Term Decomposition. GLOBECOM (Workshops) 2022: 637-643 - [c5]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
Accelerated Maximum-Likelihood for Massive MIMO Unsourced Random Access. GLOBECOM 2022: 1576-1581 - [c4]Lei Liu, Shansuo Liang, Li Ping:
Capacity Optimality of OAMP in Coded Large Unitarily Invariant Systems. ISIT 2022: 1384-1389 - [c3]Wenjie Wang, Juntao You, Shansuo Liang, Wei Han, Bo Bai:
Slotted Concatenated Coding Scheme for Asynchronous Uplink Unsourced Random Access with a Massive MIMO Receiver. PIMRC 2022: 246-252 - [i6]Lei Liu, Yiyao Cheng, Shansuo Liang, Jonathan H. Manton, Li Ping:
On Orthogonal Approximate Message Passing. CoRR abs/2203.00224 (2022) - [i5]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
An Efficient Two-Stage SPARC Decoder for Massive MIMO Unsourced Random Access. CoRR abs/2203.03836 (2022) - [i4]Lei Liu, Shansuo Liang, Li Ping:
Capacity Optimality of OAMP in Coded Large Unitarily Invariant Systems. CoRR abs/2206.11680 (2022) - [i3]Yizhou Xu, Tianqi Hou, Shansuo Liang, Marco Mondelli:
Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models. CoRR abs/2212.01572 (2022) - 2021
- [i2]Lei Liu, Shansuo Liang, Li Ping:
Capacity Optimality of OAMP: Beyond IID Sensing Matrices and Gaussian Signaling. CoRR abs/2108.08503 (2021) - 2020
- [j4]Shansuo Liang, Chulong Liang, Junjie Ma, Ping Li:
Compressed Coding, AMP-Based Decoding, and Analog Spatial Coupling. IEEE Trans. Commun. 68(12): 7362-7375 (2020) - [c2]Shansuo Liang, Chulong Liang, Junjie Ma, Li Ping:
Compressed-Coding and Analog Spatial-Coupling using AMP based Decoding. GLOBECOM 2020: 1-6 - [c1]Shansuo Liang, Bo Bai, Gong Zhang:
On the Finite Length Performance of Sparse Regression Codes with Peak-Power Limitation. ITW 2020: 1-5 - [i1]Shansuo Liang, Chulong Liang, Junjie Ma, Li Ping:
Compressed Coding, AMP Based Decoding and Analog Spatial Coupling. CoRR abs/2002.04808 (2020)
2010 – 2019
- 2019
- [j3]Shansuo Liang, Xiaodong Wang, Li Ping:
Semi-Blind Detection in Hybrid Massive MIMO Systems via Low-Rank Matrix Completion. IEEE Trans. Wirel. Commun. 18(11): 5242-5254 (2019) - [j2]Shansuo Liang, Jun Tong, Li Ping:
On Iterative Compensation of Clipping Distortion in OFDM Systems. IEEE Wirel. Commun. Lett. 8(2): 436-439 (2019) - 2017
- [j1]Shansuo Liang, Junjie Ma, Li Ping:
Clipping Can Improve the Performance of Spatially Coupled Sparse Superposition Codes. IEEE Commun. Lett. 21(12): 2578-2581 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
