default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhihang Yi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j12]Zhihang Yi, Min-Chul Ju, Il-Min Kim:
Outage Probability and Optimum Power Allocation for Analog Network Coding. IEEE Trans. Wirel. Commun. 10(2): 407-412 (2011)- [j11]Zhihang Yi, Il-Min Kim, Dong In Kim:
Symbol Rate Upper-Bound on Distributed STBC with Channel Phase Information. IEEE Trans. Wirel. Commun. 10(3): 745-750 (2011) - [j10]Zhihang Yi, Min-Chul Ju, Hyoung-Kyu Song, Il-Min Kim:
BER and Diversity Order Analysis of Distributed Alamouti's Code with CSI-Assisted Relays. IEEE Trans. Wirel. Commun. 10(4): 1199-1211 (2011) - [j9]Zhihang Yi, Min-Chul Ju, Il-Min Kim:
Outage Probability and Optimum Combining for Time Division Broadcast Protocol. IEEE Trans. Wirel. Commun. 10(5): 1362-1367 (2011) - 2010
- [j8]Chris Conne, Min-Chul Ju, Zhihang Yi, Hyoung-Kyu Song, Il-Min Kim:
SER Analysis and PDF Derivation for Multi-Hop Amplify-and-Forward Relay Systems. IEEE Trans. Commun. 58(8): 2413-2424 (2010) - [c5]Zhihang Yi, Il-Min Kim, Robert Schober:
Finite-SNR Diversity-Multiplexing Tradeoff in Bidirectional Cooperative Networks. ICC 2010: 1-6
2000 – 2009
- 2009
- [j7]Zhihang Yi, Il-Min Kim:
Relay ordering in a multi-hop cooperative diversity network. IEEE Trans. Commun. 57(9): 2590-2596 (2009) - [j6]Zhihang Yi, Il-Min Kim:
Approximate BER expressions of distributed Alamouti's code in dissimilar cooperative networks with blind relays. IEEE Trans. Commun. 57(12): 3571-3578 (2009) - [j5]Zhihang Yi, Il-Min Kim:
An opportunistic-based protocol for bidirectional cooperative networks. IEEE Trans. Wirel. Commun. 8(9): 4836-4847 (2009) - [j4]Zhihang Yi, Il-Min Kim:
Optimum beamforming in the broadcasting phase of bidirectional cooperative communication with multiple decode-and-forward relays. IEEE Trans. Wirel. Commun. 8(12): 5806-5812 (2009) - [c4]Zhihang Yi, Il-Min Kim:
Approximate BER Expressions of Distributed Alamouti's Code in Two-Hop Systems. ICDCS Workshops 2009: 511-516 - 2008
- [j3]Zhihang Yi, Il-Min Kim:
Diversity order analysis of the decode-and-forward cooperative networks with relay selection. IEEE Trans. Wirel. Commun. 7(5-2): 1792-1799 (2008) - [c3]Zhihang Yi, Il-Min Kim:
Row-Monomial Distributed Orthogonal Space-Time Block Codes with Channel Phase Information. ICC 2008: 1185-1189 - [c2]Zhihang Yi, Il-Min Kim:
The Impact of Noise Correlation on the Single-Symbol ML Decodable Distributed STBCs. ICC 2008: 1220-1224 - [i3]Zhihang Yi, Il-Min Kim:
Finite-SNR Diversity-Multiplexing Tradeoff and Optimum Power Allocation in Bidirectional Cooperative Networks. CoRR abs/0810.2746 (2008) - 2007
- [j2]Zhihang Yi, Il-Min Kim:
Joint optimization of relay-precoders and decoders with partial channel side information in cooperative networks. IEEE J. Sel. Areas Commun. 25(2): 447-458 (2007) - [j1]Zhihang Yi, Il-Min Kim:
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks. IEEE Trans. Inf. Theory 53(8): 2977-2985 (2007) - [c1]Zhihang Yi, Il-Min Kim:
Decode-and-Forward Cooperative Networks with Relay Selection. VTC Fall 2007: 1167-1171 - [i2]Zhihang Yi, Il-Min Kim:
The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs. CoRR abs/0708.3387 (2007) - 2006
- [i1]Zhihang Yi, Il-Min Kim:
High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks. CoRR abs/cs/0609054 (2006)
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:05 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:
