default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaohu Shang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c19]Siyou Ma, Chi Hu, Fei Deng, Yuyao Zhou, Xiaohu Shang, Linbo Wu, Wei Zou, Chunlei Li, Wansheng Yang, Hao Zhang, Fei Ren:
Combinational Metamorphic Testing for Deep Learning based Target Detection CPS Systems. QRS Companion 2021: 250-255
2010 – 2019
- 2015
- [c18]Xiaohu Shang:
Partial capacity boundary of parallel Gaussian Z interference channels. ISIT 2015: 206-210 - 2014
- [j14]Xiaohu Shang:
Interference Mitigation and Signal Enhancement for Multiuser MIMO Interference Channels With Redundant Antennas. IEEE Trans. Inf. Theory 60(8): 4770-4785 (2014) - [j13]Fangfang Zhu, Xiaohu Shang, Biao Chen, H. Vincent Poor
:
On the Capacity of Multiple-Access-Z-Interference Channels. IEEE Trans. Inf. Theory 60(12): 7732-7750 (2014) - [c17]Xiaohu Shang:
Interference mitigation and signal enhancement for K-user MIMO interference channels. ISIT 2014: 3092-3096 - 2013
- [j12]Xiaohu Shang, Biao Chen:
Gaussian Interference Channels: An Information Theoretic Point of View. Found. Trends Commun. Inf. Theory 10(3): 247-378 (2013) - [j11]Xiaohu Shang, H. Vincent Poor:
Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels. IEEE Trans. Inf. Theory 59(1): 132-153 (2013) - 2012
- [j10]Xiaohu Shang, H. Vincent Poor:
Capacity Region of Vector Gaussian Interference Channels With Generally Strong Interference. IEEE Trans. Inf. Theory 58(6): 3472-3496 (2012) - [c16]Xiaohu Shang, H. Vincent Poor:
Capacity for MIMO Gaussian interference channels with generally strong and noisy interference. ISIT 2012: 2786-2790 - 2011
- [j9]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels. IEEE Trans. Inf. Theory 57(1): 210-226 (2011) - [j8]Lalitha Sankar, Xiaohu Shang, Elza Erkip, H. Vincent Poor:
Ergodic Fading Interference Channels: Sum-Capacity and Separability. IEEE Trans. Inf. Theory 57(5): 2605-2626 (2011) - [j7]Xiaohu Shang, H. Vincent Poor:
On the Capacity of Type I Broadcast-Z-Interference Channels. IEEE Trans. Inf. Theory 57(5): 2648-2666 (2011) - [j6]Xiaohu Shang, Biao Chen, Harold Vincent Poor:
Multiuser MISO Interference Channels With Single-User Detection: Optimality of Beamforming and the Achievable Rate Region. IEEE Trans. Inf. Theory 57(7): 4255-4273 (2011) - [j5]Hyungsik Ju, Xiaohu Shang, H. Vincent Poor, Daesik Hong:
Bi-Directional Use of Spatial Resources and Effects of Spatial Correlation. IEEE Trans. Wirel. Commun. 10(10): 3368-3379 (2011) - [c15]Xiaohu Shang, H. Vincent Poor:
On the capacity of Gaussian broadcast channels that receive interference. CISS 2011: 1-5 - [c14]Hyungsik Ju, Xiaohu Shang, H. Vincent Poor, Daesik Hong:
Rate Improvement of Beamforming Systems via Bi-Directional Use of Spatial Resources. GLOBECOM 2011: 1-5 - [c13]Fangfang Zhu, Xiaohu Shang, Biao Chen, H. Vincent Poor:
On the Capacity of Multiple-Access-Z-Interference Channels. ICC 2011: 1-6 - [i12]Xiaohu Shang, H. Vincent Poor:
Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels. CoRR abs/1108.0870 (2011) - [i11]Xiaohu Shang, H. Vincent Poor:
Capacity Region of Vector Gaussian Interference Channels with Generally Strong Interference. CoRR abs/1108.1136 (2011) - 2010
- [j4]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Capacity regions and sum-rate capacities of vector Gaussian interference channels. IEEE Trans. Inf. Theory 56(10): 5030-5044 (2010) - [c12]Xiaohu Shang, H. Vincent Poor:
On the weighted sum-rate capacity of broadcast channels that generate interference. ISIT 2010: 614-618 - [i10]Fangfang Zhu, Xiaohu Shang, Biao Chen, H. Vincent Poor:
On the Capacity of Multiple-Access-Z-Interference Channels. CoRR abs/1011.1225 (2010)
2000 – 2009
- 2009
- [j3]Xiaohu Shang, Gerhard Kramer, Biao Chen:
A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels. IEEE Trans. Inf. Theory 55(2): 689-699 (2009) - [c11]Xiaohu Shang, Biao Chen, H. Vincent Poor:
On the Optimality of Beamforming for Multi-User MISO Interference Channels with Single-User Detection. GLOBECOM 2009: 1-5 - [c10]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Noisy-interference sum-rate capacity of parallel Gaussian interference channels. ISIT 2009: 2597-2601 - [i9]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference Channels. CoRR abs/0903.0595 (2009) - [i8]Lalitha Sankar, Xiaohu Shang, Elza Erkip, H. Vincent Poor:
Ergodic Fading Interference Channels: Sum-Capacity and Separability. CoRR abs/0906.0744 (2009) - [i7]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Capacity Regions and Sum-Rate Capacities of Vector Gaussian Interference Channels. CoRR abs/0907.0472 (2009) - [i6]Xiaohu Shang, Biao Chen, H. Vincent Poor:
Multi-User MISO Interference Channels with Single-User Detection: Optimality of Beamforming and the Achievable Rate Region. CoRR abs/0907.0505 (2009) - [i5]Xiaohu Shang, Biao Chen, H. Vincent Poor:
On the Optimality of Beamforming for Multi-User MISO Interference Channels with Single-User Detection. CoRR abs/0908.3171 (2009) - [i4]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
MIMO Z-Interference Channels: Capacity Under Strong and Noisy Interference. CoRR abs/0911.4530 (2009) - 2008
- [j2]Xiaohu Shang, Biao Chen, John D. Matyjas:
Sum Capacity Optimality of Orthogonal Transmissions in Vector Gaussian Multiple Access Channels. IEEE Trans. Wirel. Commun. 7(11-1): 4304-4311 (2008) - [c9]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
On the capacity of MIMO interference channels. Allerton 2008: 700-707 - [c8]Lalitha Sankar, Xiaohu Shang, Elza Erkip, H. Vincent Poor:
Ergodic two-user interference channels: Is separability optimal? Allerton 2008: 723-729 - [c7]Xiaohu Shang, Gerhard Kramer, Biao Chen:
Outer bound and noisy-interference sum-rate capacity for symmetric Gaussian interference channels. CISS 2008: 385-389 - [c6]Xiaohu Shang, Biao Chen, Gerhard Kramer:
On Sum-Rate Capacity of Parallel Gaussian Symmetric Interference Channels. GLOBECOM 2008: 916-920 - [c5]Xiaohu Shang, Gerhard Kramer, Biao Chen:
New outer bounds on the capacity region of Gaussian interference channels. ISIT 2008: 245-249 - [i3]Xiaohu Shang, Gerhard Kramer, Biao Chen:
New Outer Bounds on the Capacity Region of Gaussian Interference Channels. CoRR abs/0801.2185 (2008) - [i2]Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
On the Capacity of MIMO Interference Channels. CoRR abs/0807.1543 (2008) - 2007
- [c4]Xiaohu Shang, Biao Chen, John D. Matyjas:
Sum Capacity (Sub)Optimality of Orthogonal Transmissions in Vector Gaussian Multiple Access Channels. ICASSP (3) 2007: 401-404 - [c3]Xiaohu Shang, Biao Chen:
A New Computable Achievable Rate Region for the Gaussian Interference Channel. ISIT 2007: 2191-2195 - [c2]Xiaohu Shang, Biao Chen:
An Inner Bound of Capacity Region for the Gaussian Interference Channel. WCNC 2007: 2048-2052 - [i1]Xiaohu Shang, Gerhard Kramer, Biao Chen:
A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels. CoRR abs/0712.1987 (2007) - 2006
- [j1]Xiaohu Shang, Biao Chen, Michael J. Gans:
On the Achievable Sum Rate for MIMO Interference Channels. IEEE Trans. Inf. Theory 52(9): 4313-4320 (2006) - [c1]Xiaohu Shang, Biao Chen, Michael J. Gans:
On Achievable Sum Rate for Vector Gaussian Interference Channels. ISIT 2006: 2215-2219
Coauthor Index
aka: Harold Vincent Poor
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 2025-01-24 18:12 CET 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:
