default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJibing Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
[j10]Jibing Wang, Xiaodong Wang:
Optimal linear space-time spreading for multiuser MIMO communications. IEEE J. Sel. Areas Commun. 24(1): 113-120 (2006)- [j9]Jibing Wang, Xiaodong Wang:
Superimposed Training-Based Noncoherent MIMO Systems. IEEE Trans. Commun. 54(7): 1267-1276 (2006) - [j8]Xiaodong Wang, Vikram Krishnamurthy, Jibing Wang:
Stochastic gradient algorithms for design of minimum error-rate linear dispersion codes in MIMO wireless systems. IEEE Trans. Signal Process. 54(4): 1242-1255 (2006) - [j7]Jibing Wang, Xiaodong Wang:
Optimum design of noncoherent cayley unitary space-time codes. IEEE Trans. Wirel. Commun. 5(7): 1942-1951 (2006) - 2005
- [j6]Jibing Wang, Xiaodong Wang, Mohammad Madihian:
Design of minimum error-rate Cayley differential unitary space-time codes. IEEE J. Sel. Areas Commun. 23(9): 1779-1787 (2005) - [j5]Jibing Wang, Xiaodong Wang, Mohammad Madihian:
On the optimum design of space-time linear-dispersion codes. IEEE Trans. Wirel. Commun. 4(6): 2928-2938 (2005) - 2004
- [j4]Jibing Wang, Marvin K. Simon, Kung Yao:
On the optimum design of unitary cyclic group space-time codes. IEEE Trans. Commun. 52(5): 706-710 (2004) - [j3]Jibing Wang, Marvin K. Simon, Michael P. Fitz, Kung Yao:
On the performance of space-time codes over spatially correlated Rayleigh fading channels. IEEE Trans. Commun. 52(6): 877-881 (2004) - 2003
- [j2]Marvin K. Simon, Jibing Wang:
Noncoherent detection of orthogonal modulation combined with Alamouti space-time coding. J. Commun. Networks 5(2): 124-134 (2003) - 2002
- [j1]Jibing Wang, Ezio Biglieri, Kung Yao:
Asymptotic performance of space-frequency codes over broadband channels. IEEE Commun. Lett. 6(12): 523-525 (2002)
Conference and Workshop Papers
- 2005
- [c6]Jibing Wang, Xiaodong Wang, Mohammad Madihian:
Optimal design of noncoherent Cayley unitary space-time codes. EUSIPCO 2005: 1-4 - [c5]Inaki Berenguer, Xiaodong Wang, Narayan Prasad, Jibing Wang, Mohammad Madihian:
Design of minimium-error-rate lattice (space-time) codes via stochastic optimization and gradient estimation. GLOBECOM 2005: 2374-2378 - 2004
- [c4]Jibing Wang, Marvin K. Simon, Michael P. Fitz, Kung Yao:
On the performance of space-time codes with transmit correlation. ICC 2004: 712-716 - 2003
- [c3]Jibing Wang, Marvin K. Simon, Kung Yao:
On the optimum design of differential unitary space-time modulation. GLOBECOM 2003: 1968-1972 - 2002
- [c2]Jibing Wang, Kung Yao:
Space-time coded wideband CDMA systems. VTC Spring 2002: 260-264 - [c1]Jibing Wang, Kung Yao:
Multiuser spatio-temporal coding for wireless communications. WCNC 2002: 276-279
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-04-24 23:14 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:
