default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUi-Kun Kwon
- > Home > Persons > Ui-Kun Kwon
Publications
- 2010
[j12]Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im:
Spectral efficient transmit diversity techniques without cyclic prefix for fading relay channels. IEEE Trans. Commun. 58(2): 568-577 (2010)- [j11]Chan-Ho Choi, Ui-Kun Kwon, Young-Jin Kim, Gi-Hong Im:
Spectral Efficient Cooperative Diversity Technique with Multi-Layered Modulation. IEEE Trans. Commun. 58(12): 3480-3490 (2010) - 2009
- [j10]Ui-Kun Kwon, Gi-Hong Im:
Cyclic delay diversity with frequency domain turbo equalization for uplink fast fading channels. IEEE Commun. Lett. 13(3): 184-186 (2009) - [j9]Ui-Kun Kwon, Gi-Hong Im, Jong-Bu Lim:
MIMO Spatial Multiplexing Technique With Transmit Diversity. IEEE Signal Process. Lett. 16(7): 620-623 (2009) - [j8]Young-Jin Kim, Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im:
An Effective PAPR Reduction of SFBC-OFDM for Multinode Cooperative Transmission. IEEE Signal Process. Lett. 16(11): 925-928 (2009) - [j7]Dae-Young Seol, Ui-Kun Kwon, Gi-Hong Im:
Performance of single carrier transmission with cooperative diversity over fast fading channels. IEEE Trans. Commun. 57(9): 2799-2807 (2009) - [j6]Ui-Kun Kwon, Dongsik Kim, Gi-Hong Im:
Amplitude clipping and iterative reconstruction of MIMO-OFDM signals with optimum equalization. IEEE Trans. Wirel. Commun. 8(1): 268-277 (2009) - [j5]Ui-Kun Kwon, Chan-Ho Choi, Gi-Hong Im:
Full-rate cooperative communications with spatial diversity for half-duplex uplink relay channels. IEEE Trans. Wirel. Commun. 8(11): 5449-5454 (2009) - 2008
- [j4]Dongsik Kim, Ui-Kun Kwon, Gi-Hong Im:
Pilot Position Selection and Detection for Channel Estimation of SC-FDE. IEEE Commun. Lett. 12(5): 350-352 (2008) - [c3]Dongsik Kim, Ui-Kun Kwon, Gi-Hong Im, Changyong Shin:
A Pilot Design Technique for Single-Carrier Transmission over Fast Fading Relay Channels. GLOBECOM 2008: 4715-4719 - [c2]Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im, Young-Doo Kim:
A Spectral efficient Relay-Based Transmit Diversity Technique for SC-FDE without Cyclic Prefix. ICC 2008: 4326-4330 - 2007
- [j3]Dae-Young Seol, Ui-Kun Kwon, Gi-Hong Im, Eungsun Kim:
Relay-based single carrier transmission with SFBC in uplink fast fading channels. IEEE Commun. Lett. 11(12): 928-930 (2007) - [j2]Ui-Kun Kwon, Gi-Hong Im, Eungsun Kim:
An Iteration Technique for Recovering Insufficient Cyclic Prefix and Clipped OFDM Signals. IEEE Signal Process. Lett. 14(5): 317-320 (2007) - [j1]Ui-Kun Kwon, Dongsik Kim, Ki-Ho Kim, Gi-Hong Im:
Amplitude Clipping and Iterative Reconstruction of STBC/SFBC-OFDM Signals. IEEE Signal Process. Lett. 14(11): 808-811 (2007) - [c1]Dae-Young Seol, Ui-Kun Kwon, Gi-Hong Im, Eungsun Kim:
Relay-Assisted SFBC Single Carrier Transmission Over Uplink Fast Fading Channels. GLOBECOM 2007: 3883-3887
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:13 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:
