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

Dae Young Kim 0001

dblp:63/270-1 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2008
0000-0003-2916-1126ORCID · corroborated

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

Computer networks · 6 · 3 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

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
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.011989
Power suppression at the Nyquist frequency for pilot-aided PAM and QAM systems · IEEE Trans. Commun. 1989
Physical-layer communications › modulation › pulse modulation
pulse amplitude modulation
0.011989
Power suppression at the Nyquist frequency for pilot-aided PAM and QAM systems · IEEE Trans. Commun. 1989
Physical-layer communications › modulation
quadrature amplitude modulation
0.011989
Power suppression at the Nyquist frequency for pilot-aided PAM and QAM systems · IEEE Trans. Commun. 1989
Physical-layer communications › modulation
line coding
0.011987
Run-Length-Limited Variants of Duobinary and Modified Duobinary · IEEE Trans. Commun. 1987
Physical-layer communications › channel coding
runlength-limited coding
0.011987
Run-Length-Limited Variants of Duobinary and Modified Duobinary · IEEE Trans. Commun. 1987
Information theory › communication channels
intersymbol interference
0.011985
A Condition for Stable Minimum-Bandwidth Line Codes · IEEE Trans. Commun. 1985
Coding theory › constrained coding
line codes
0.011985
A Condition for Stable Minimum-Bandwidth Line Codes · IEEE Trans. Commun. 1985
Physical-layer communications
synchronization
0.011989
Power suppression at the Nyquist frequency for pilot-aided PAM and QAM systems · IEEE Trans. Commun. 1989

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

low-redundancy coding · 0.0dual-pilot tone calibration · 0.0power spectrum analysis · 0.0error probability analysis · 0.0power spectral density analysis · 0.0
YearPublicationVenuePosition
2008 Design of an Enhanced Handover Algorithm Based on a New Adaptive SR-ARQ for Next-Generation Mobile Communication Networks
abstract
Next-generation mobile communication networks are supposed to provide various high capacity multimedia services to mobile users using various kinds of access networks. Among them, the WiNGS system developed by ETRI as one of 4G mobile system provides high performance RATs (Radio Access Technology) and network architecture with IP connectivity for merging them. In this paper, we propose a new link layer Selective-Repeat Automatic Repeat Request (SR-ARQ) mechanism that solves packet re-ordering problems during handovers and enhances handover performance in WiNGS system. In the proposed mechanism, we adopt an adaptive timer in the sending node in order to prevent unnecessary packet retransmission during handovers, and a delayed NAK scheme in the receiving node to prevent detection of temporal packet reordering due to handover delay. We implemented the proposed SR-ARQ mechanism in ns-2 simulator for performance evaluation. The simulation results show that the proposed SR-ARQ enhances handover performance for the WiNGS system by preventing unnecessary retransmission and reordering.
ManKyu Park, Yun Chul Choi, Jae Yong Lee 0001, Byung-Chul Kim, Dae Young Kim 0001, Jae Ho Kim
ISPA5
2007 Modulation Classification of Analog and Digital Signals Using Neural Network and Support Vector Machine
Cheol-Sun Park, Dae Young Kim 0001
ISNN (3)2
2003 Secure Session Key Exchange for Mobile IP Low Latency Handoffs
Hyun Gon Kim, Dooho Choi, Dae Young Kim 0001
ICCSA (2)3
1997 A Distributed Grant Based High-Speed ATM MAC Protocol
abstract
This paper describes a shared medium access protocol for residential home and small business customer ATM network application with distributed multimedia services. This protocol offers global fairness for the whole network and, at the same time, offers a local priority mechanism for different traffic on each node. The traffic of B-ISDN services is characterized for real or non-real time multimedia, which means the local priority mechanism is very important for different traffic in a node to support real time multimedia traffic effectively. Simulation results show this protocol has higher performance than already announced protocols. This paper also shows a hardware structure of the high-speed ATM MAC (HAM) protocol.
Sun-Moo Kang, Byung-Cheon Jeon, Dae Young Kim 0001
ICC (2)3
1997 Efficient interleaving method in wireless ATM networks
abstract
This paper proposes a method of reducing the cell loss probability by interleaving the header and data bits in wireless ATM networks where bit errors are likely to occur in bursts. Analytic modeling of the proposed method and a subsequent calculation shows a substantial improvement in cell loss probability due to burst errors, which has been also verified by computer simulation. This paper also proposes a header interleaving expansion method and techniques of applying the interleaving method to physical layer protocols. The proposed methods are easily applicable to the B-ISDN physical layer protocol and have a small processing delay.
Sung Ho Lim, Dae Young Kim 0001
ISCC2
1995 A distributed cycle reset protocol for the high-speed LAN/MAN
abstract
For the existing shared medium access protocol, a serious problem is the performance decreasing against the increasing distance and speed in the shared medium high speed LAN/MAN application, caused by the overhead of access control. In this paper, a new protocol is proposed to reduce the overhead using distributed access function. It uses distributed cycle reset function and token reset function at the same time. That is the reason why the proposed protocol is named Distributed Cycle Reset (DCR) protocol. The proposed protocol combines merits of the distributed cycle reset algorithm and the centralized reset algorithm on the basis of cycle concept controlling bandwidth usage for each terminal. Simulation result shows the performance of this protocol increased throughput comparing with other similar protocols.
Gun Seo, Sun-Moo Kang, Dae Young Kim 0001, Hong-Bum Jeon
LCN3
1989 Power suppression at the Nyquist frequency for pilot-aided PAM and QAM systems
abstract
Two low-redundancy codes for in-band pilot insertion are introduced. KF10 suppresses the baseband PAM and the modulated QAM signal power at the Nyquist frequency so that the dual-pilot tone calibration technique of recent interest can be arranged to convey both a symbol timing and a carrier reference to the receiver. OF00 suppresses the signal power at zero as well as the Nyquist frequency and allows the utilization of a triple-pilot scheme which provides, in addition to a symbol timing, a carrier reference with no 180 degrees phase ambiguity.>
Dae Young Kim 0001, Kamilo Feher
IEEE Trans. Commun.1
1987 Run-Length-Limited Variants of Duobinary and Modified Duobinary
abstract
Techniques for varying duobinary and modified duobinary, which are two of the most important partial-response codes, to limit their run lengths without destroying their minimum bandwidth property, are introduced. One of the example codes is the first run-length-limited variant of duobinary ever known, and the other two are already publicized variants of modified duobinary, but are described either in more detail or from a different point of view. Performance figures of the three codes such as power spectrum, eye width, and error probability are experimentally confirmed to be acceptable for all engineering purposes.
Dae Young Kim 0001, Je In Baek, Jae-Kyoon Kim, Sang-Kyoon Hyun, Yoon-Kyoo Park
IEEE Trans. Commun.1
1985 A Condition for Stable Minimum-Bandwidth Line Codes
abstract
By generalizing a concept on a power spectral zero at the Nyquist frequency, a condition for the line codes' capability to signal with the minimum bandwidth is established. From the condition, lower bounds of eyewidth are obtained for various values of a new system parameter called intersymbol interference sum variation (ISV). As an application of the condition, the nonminimum-bandwidth bipolar code is modified to a minimum-bandwidth code, which can be directly used in conventional bipolar signaling systems with increased bandwidth efficiency.
Dae Young Kim 0001, Jae-Kyoon Kim
IEEE Trans. Commun.1