Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gi-Wan Yoon

dblp:70/1978 · also Giwan Yoon · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-3773-8039ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Graphics, computer vision, multimedia, augmented reality and games · 3Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Ubiquitous computing and smart environments
location-based services
0.212013
A Probabilistic Place Extraction Algorithm Based on a Superstate Model · IEEE Trans. Mob. Comput. 2013
Physical-layer communications › channel coding › decoding algorithms
maximum-likelihood decoding
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications
MIMO
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › signal detection
MIMO detection
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › MIMO › space-time coding › space-time block codes
quasi-orthogonal space-time block codes
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › MIMO › space-time coding
space-time block codes
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.012013
A Probabilistic Place Extraction Algorithm Based on a Superstate Model · IEEE Trans. Mob. Comput. 2013

Methods — techniques the papers use, named apart from their topics

superstate model · 0.3hidden markov model · 0.3QR decomposition · 0.1
YearPublicationVenuePosition
2022 Suppression of Range Ambiguity in Spaceborne SAR With Elevation Beam Pattern Mask Design
abstract
In this letter, we present a method to design an elevation beam pattern mask for spaceborne synthetic aperture radar (SAR) to reduce the range ambiguity. The proposed two-way elevation beam pattern mask, which requires relatively low sidelobe levels only in the direction of strong range ambiguous echoes, can be highly suitable for enhancing the range ambiguity to signal ratio (RASR). The power levels of the different ambiguous echoes are estimated based on the backscattering coefficient model and satellite geometry. To meet the two-way beam pattern mask, both transmit and receive beam patterns are synthesized simultaneously through the minimax algorithm. To confirm the effectiveness of this mask design method, the RASR performance is evaluated by using various swaths.
Jiho Ryu, Dong-Woo Yi, Se-Young Kim, Gi-Wan Yoon
IEEE Geosci. Remote. Sens. Lett.4
2014 Address-based crowdsourcing radio map construction for Wi-Fi positioning systems
abstract
A radio map is a collection of fingerprints and collected location information. To build more accurate Wi-Fi positioning system (WPS), a more precise radio map should be prepared in advance. Despite GPS signals are usually unreachable in most indoor venues, GPS signals are commonly used as reference locations to tag the collected fingerprints. As a result, WPS has not been able to achieve high performance in accuracy indoors, even if the place is rich in Wi-Fi signals. This paper introduces a novel method to construct a radio map without any use of GPS signals. Users' home or office address is used instead to tag the locations of collected Wi-Fi signals. Since the method utilizes Wi-Fi signals collected indoors, a more precise radio map construction is possible. For evaluation, we tested the method at four deliberately selected residential and downtown areas in Daejeon and Seoul, Korea. Once the data collection rate rises above 50%, the average error distance was within 10m or less. This indicates that address-based crowdsourcing radio map construction can be an effective means to construct global-scale but precise radio maps at low cost.
Dongsoo Han 0001, Byeongcheol Moon, Gi-Wan Yoon
IPIN3
2013 A Probabilistic Place Extraction Algorithm Based on a Superstate Model
abstract
Research on place extraction has been of interest for the detection of meaningful places that users visit. Because interpretations of meaningful places may be different according to location-based applications, a universal place extraction algorithm that is able to detect all kinds of meaningful places needs to be developed. Unfortunately, most previously proposed place extraction algorithms failed to show high place detection accuracy and also failed to perfectly detect meaningful places. In this work, we propose a new place extraction algorithm that can significantly enhance the accuracy of place extraction. The basic concept of the proposed algorithm is a superstate model, which is an extension of the Hidden Markov Model (HMM); we substituted superstates for the simple probabilistic distributions of the HMM. Our proposed algorithm shows remarkable detection accuracy in place extraction, significantly higher than any other previously proposed algorithms. Furthermore, the proposed algorithm can efficiently operate in mobile environments because its computations are simple.
Choon-Oh Lee, Gi-Wan Yoon, Dongsoo Han 0001
IEEE Trans. Mob. Comput.2
2012 Performance analysis of OSTBC in gamma-gamma fading channels
abstract
The multi-input multi-output (MIMO) system with a subcarrier intensity modulation (SIM) scheme in free-space optics (FSO) has a huge merit for ultra wide band communications mainly due to its diversity gain to be able to mitigate the signal scintillation caused by the atmospheric turbulence. In this study, we have analyzed the performance of the orthogonal space-time block codes (OSTBCs) in FSO links. In particular, the power series expressions of the outage probability and average bit error rate (BER) of the OSTBC for any number of antennas are derived in gamma-gamma fading channels using the SIM scheme. According to the analysis, the 3×2 OSTBC scheme could achieve a significantly high signal-to-noise ratio (SNR) gain of 62.5 dB in a strong turbulence regime, and also a moderately high SNR gain of 48 dB in a moderate turbulence regime over the no diversity at the BER of 10-6. Monte Carlo simulation results verify the accuracy of our analysis.
Eunju Lee 0002, Gi-Wan Yoon, Jaedon Park, Suil Kim
WCNC2
2009 A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
Signal Process.4
2007 Efficient Algorithm for Blind Detection of Orthogonal Space-Time Block Codes
abstract
This letter proposes an efficient decoder for signal detection in orthogonal space-time block coded systems employing phase-shift keying modulation without channel state information at the receiver. The proposed decoder consists of a sphere decoder and a QRD-based decoder. Simulation results show that the proposed decoder enables the system to trade off performance improvement against complexity
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
IEEE Signal Process. Lett.4
2006 Low Complexity Maximum-likelihood Decoder for VBLAST-STBC scheme in MIMO Wireless Communication Systems
abstract
In this work, we propose a low-complexity maximum-likelihood decoding approach based on QR decomposition (QRD) for signal detection in VBLAST-STBC systems, which employ less receive antennas than transmit antennas. With the example illustration of (6,3) system using rate 3/4 STBC for three transmit antennas, computer simulations are implemented to verify the performance and complexity of the proposed decoder
Van-Su Pham, Minh-Tuan Le, Linh Mai, Gi-Wan Yoon
VTC Spring4
2005 Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code
abstract
This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder. The proposed algorithm enables the QSTBC to achieve ML performance with significant reduction in computational load for any high-level modulation scheme.
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
IEEE Trans. Commun.4
2003 A new MUD algorithm for smart antenna
Jaedon Park, Minh-Tuan Le, Gi-Wan Yoon, Jewoo Kim
Signal Process.3