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

Joonki Kim

dblp:165/1552 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-5583-1085ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 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.

Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata
sequential machines
0.011972
The Simplification of Sequential Machines with Input Restrictions · IEEE Trans. Computers 1972
Automata and formal languages
finite automata
0.011972
The Simplification of Sequential Machines with Input Restrictions · IEEE Trans. Computers 1972

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

input restriction analysis · 0.0
YearPublicationVenuePosition
2020 Location-Based Operation Strategy for SIC-enabled D2D Communications
abstract
In this paper, we propose a novel location-based operation strategy for Device-to-Device (D2D) communication which exploits successive interference cancellation (SIC). First, we investigate the characteristics of SIC-enabled D2D, and then propose a new resource selection scheme to fully exploit cellular uplink (UL) resources and downlink (DL) resources using only location information. Second, we propose a new power allocation scheme designed to overcome the problem of excess outages in cellular users. Simulation results show that the proposed schemes show good D2D throughput performance compared to the existing schemes, while guaranteeing reliability for cellular users.
Jehyun Heo, Insik Jung, Joonki Kim, Daesik Hong
VTC Fall4
2018 Multi-User Detections for Sparse Code Multiple Access System
abstract
This paper proposes a new multi-user detection scheme for sparse code multiple access (SCMA) system in grant- free scenario. SCMA systems use a message passing algorithm which considers all user equipments (UEs) to be active. However, in a practical system, UEs do not always request resources. A multi-user detection procedure enables the decoder to mitigate interference from proper active UEs and to ignore the signal from inactive UEs. Therefore, we propose a multi-user detection scheme for SCMA system. The simulation results present that the proposed SCMA receiver structure achieves a remarkable enhancement in false alarm probability, miss detection probability.
Joonki Kim, Daesik Hong
VTC Fall1
2017 Performance of Full Duplex in Non-Full Buffer Traffic Model
abstract
Full-duplex (FD) systems ideally double the system capacity compared to conventional half-duplex (HD) systems. However, we can obtain that goal only when FD systems always have both downlink (DL) and uplink (UL) traffic loads. This paper sheds new light on whether FD can achieve this promising performance enhancement in more realistic traffic settings. We first provide the sum capacity of the FD system when DL and UL traffic loads are different. In addition, we define the FD gain according to traffic loads and compare FD performance with the HD system which is based on time-division duplex (TDD). We then analyze the effect of traffic loads and residual self- interference (SI) on the FD system. Simulation results and analysis reveal that FD performance decreases in a limited traffic setting.
Jonghyun Bang, Joonki Kim, Daesik Hong
GLOBECOM3
1972 The Simplification of Sequential Machines with Input Restrictions
abstract
A procedure is presented for simplifying the flow table of a sequential machine M when, in addition to the given flow table, it is specified that certain input sequences cannot occur. It is assumed that M receives its input from the output of another machine M, and that the restricted sequences are therefore those sequences that M, cannot generate.
Joonki Kim, Monty Newborn
IEEE Trans. Computers1