• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1085-1092
• /
• 2012

Mobile communication systems define user state transition mechanisms in order to manage radio resources and battery power efficiently. In the state transition mechanism, a state with a higher energy consumption inherently offers a shorter access delay, so there is a tradeoff between the energy and delay performances. In this paper, we analyze the user state transition mechanism of UMTS by considering the bursty traffic attributes of mobile applications. We perform a numerical evaluation for both the energy consumption and the activation delay by Markov modeling of the state transition mechanism, and investigate their tradeoff relationship as functions of operational parameters. The resulting energy-delay tradeoff curves clearly show an achievable performance bound of the user state transition mechanism and also offer an optimal operation strategy to minimize the energy consumption while guaranteeing the delay requirement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1080-1086
• /
• 2014

In this paper, we analyze the tradeoff performance of a consensus algorithm when it is applied to the CSMA/CA-based distributed wireless network. The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the transmission delay on the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff relationship between these two performances and so there exists an optimal number of cooperating neighbors that minimizes the consensus time. The result for the optimal number of neighbors according to the number of nodes that participate in the consensus shows that it is optimal for all nodes to cooperate together in the small-scale network but it is optimal to limit the number of neighbors to a fixed value in the large-scale network with nodes greater than a certain value.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.3010-3012
• /
• 2005

Orthogonal frequency division multiplexing (OFDM) 시스템은 높은 peak-to-average power ratio(PAR) 문제를 가진다. 일반적으로, partial transmit sequence(PTS) 기법을 이용하여 최적의 PAR 감소 성능을 얻기 위해서는 나눈 부블록의 수와 위상 요소 (rotation factor)에 관한 모든 탐색을 해야 한다. 나눈 부블록 수와 factor 수가 많을수록 PAR 감소 성능은 그 만큼 증가하지만, 그에 비례하여 복잡성과 계산량 또한 지수적으로 증가하여 송신기에서의 시간지연과 전력소비를 초래한다. 따라서, PAR 감소 성능을 낮추면서 복잡성 또한 줄일 수 있는 방법이 요구된다. 하지만, 성능과 계산의 복잡성 사이에는 트레이드오프가 존재하여, 두가지를 동시에 줄이는 것은 매우 어렵다. 본 논문에서는, 성능과 복잡성 사이의 최적의 트레이드오프에 대해 분석하고, 제안한 PTS 기법의 성능을 기존의 복잡한 PTS 기법과 비교한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.3-4
• /
• 2017

DRAM, HDD의 성장세가 둔화되면서 NVM이 그 대안으로 떠오르고 있다. Xpoint, Z-SSD등 여러 고성능 NVM이 발표되고 있으며 DRAM의 성능을 목표로 하고 있다. 본 논문에서는 DRAM 수준의 고성능 NVM이 상용화 될 때 어느 정도의 성능과 가격지표를 보일 것이며 이에 대한 가격과 저장공간의 트레이드오프는 어느 정도일지 알아보기 위해 실험을 진행하였다. RAM disk로 NVM환경을 시뮬레이션 하였고 SSD, HDD 간 I/O 성능을 측정하였다. NVM과 SSD는 70배에서 200배, NVM과 디스크는 98배에서 3000배 이상 차이가 있음을 확인했다. 이 결과를 바탕으로 RAM disk와 SSD 가격지표를 조사하여 IOPS/$를 도출해 보았고 NVM이 7배의 IOPS/$를 가지지만 SSD가 18배의 GB/$를 가지는 것을 확인할 수 있었다.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.18 no.4
• /
• pp.117-129
• /
• 2023

Organizations must seek change in order to adapt to environmental changes and achieve better performance. However, despite this obvious statement, empirical analysis has been almost non-existent due to the difficulty of manipulating organizational performance or change. In this study, we overcame these limitations and analyzed the causes and effects of organizational change by assuming a professional sports team as a venture company, which is relatively easy to objectively measure and evaluate organizational change or performance. We systematically collected and preprocessed traditional and advanced metrics of National Basketball Association (NBA) statistics along with preprocessed trade data from eight years of regular seasons (2014~2015-2021~2022) to analyze our research model. Assessment of process macro model 7 derives the following empirical result. The results of the empirical analysis depict that NBA teams with low organizational performance in the previous season are more likely to make organizational changes through player trades to improve performance. Into the bargain player trades mediate the static relationship between the winning percentage in the previous season and the winning percentage in the current season. However, the indirect effect of a team's previous season's performance on player trades appears to vary depending on the current situations and context of each NBA team. Teams that made the playoffs in the previous season tend to make fewer trades than teams that did not and the previous season's performance is highly correlated with the current season's performance. On the other hand, teams that did not make the playoffs in the previous season tend to make a relatively larger amount of player trades in total, and the mediating effect of trades vanishes in this case. In other words, teams that did not make the playoffs in the previous season experience a larger change in performance due to trades than teams that made the playoffs, even if they achieved the same winning percentage. This empirical analysis of the inverse relationship between organizational change and the performance of professional sports teams has both theoretical and practical implications in the field of sports industry and management by analyzing the fundamentals of organizational change and the performance of professional sports teams.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.3-5
• /
• 2022

혼합 중요도(mixed criticality) 시스템은 안전에 중요한 기능을 우선시하도록 하는 추가적인 안전 요구사항이 존재한다. 그러나 기존 실시간 시스템의 설계로는 이를 만족하지 못하며, 높은 중요도 태스크가 다른 낮은 중요도 태스크로부터 간섭을 받아 데드라인 미스와 같은 문제를 일으키는 중요도 역전(criticality inversion) 문제가 발생할 수 있다. 이러한 중요도 역전 문제를 해결하기 위해 주기 변환(period transformation) 기법을 사용할 수 있지만, 스케줄링 오버헤드의 증가로 인해 오히려 전반적인 태스크의 응답시간이 증가하는 또 다른 문제가 발생하게 된다. 본 논문에서는 주기 변환과 스케줄링 오버헤드 간의 트레이드오프 관계를 설명하고, 실시간 리눅스 시스템에서 해당 문제점을 재연한 후 주기 변환의 적정선을 분석하고자 실험을 진행하였다. 그 결과, 중요도 역전 문제를 해결하기 위한 주기 변환을 그대로 적용할 경우, 문맥 교환이 48.7% 증가 및 스케줄링 오버헤드가 28.7% 증가로 인해 전반적인 응답시간이 증가하여 데드라인 미스가 다수 발생하는 결과를 확인할 수 있었다.

• Electronics and Telecommunications Trends
• /
• v.16 no.4 s.70
• /
• pp.41-53
• /
• 2001

본 논문에서는 현재 표준화 진행중인 디지털 저작권 관리 시스템의 다양한 기술들을 살펴본다. 저작권 관리 시스템을 구성하는 요소로 암호화, 접속 제한, 복사 제어, 신원 확인 등이 있으며 이러한 요소를 이루는 기술로 최근 워터마크의 연구가 활발히 진행중이다. 워터마크 기술은 응용 범위가 넓고 잠재적 개발 가능성이 크지만 아직까지 분명한 한계가 있으며, 강인성과 품질 사이에 요구사항이 서로 트레이드오프 상태에 있는 단점이 있다. 따라서 저작권 관리 시스템의 구현을 위해서는 먼저 시스템의 요구사항을 분명히 규정하고, 그것에 적합한 기술을 최적화하는 것이 필요하다.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.451-460
• /
• 2005

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low-level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters specific to a domain that affect the system-wide energy dissipation. A domain is a family of architectures and corresponding algorithms for a given application kernel. The high-level model also consists of functions for estimating energy, latency, and area that facilitate tradeoff analysis. Design space exploration(DSE) analyzes the design space defined by the domain and selects a set of designs. Low-level simulations are used for accurate performance estimation for the designs selected by the DSE and also for final design selection We illustrate our methodology using a family of architectures and algorithms for matrix multiplication. The designs identified by our methodology demonstrate tradeoffs among energy, latency, and area. We compare our designs with a vendor specified matrix multiplication kernel to demonstrate the effectiveness of our methodology. To illustrate the effectiveness of our methodology, we used average power density(E/AT), energy/(area x latency), as themetric for comparison. For various problem sizes, designs obtained using our methodology are on average $25\%$ superior with respect to the E/AT performance metric, compared with the state-of-the-art designs by Xilinx. We also discuss the implementation of our methodology using the MILAN framework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.121-127
• /
• 2010

In this paper, we propose a computationally efficient scheduling algorithm that can arbitrarily control the throughput-fairness tradeoff in a multiuser wireless communication environment. As a new scheduling criterion, we combine linearly two well-known scheduling criteria such as one of achieving the maximum sum throughput and the other of achieving the maximum fairness, so as to control the relative proportion of the throughput and the fairness according to a control factor. For linear combining two different criteria, their optimization directivenesses and the units should be unified first. To meet these requirements, we choose an instantaneous channel capacity as a scheduling criterion for maximizing the sum throughput and the average serving throughput for maximizing the fairness. Through a unified linear combining of two optimization objectives with the control factor, it can provide various throughput-fairness tradeoffs according to the control factors. For further simplification, we exploit a high signal-to-noise ratio (SNR) approximation of the instantaneous channel capacity. Through computer simulations, we evaluate the throughput and fairness performances of the proposed algorithm according to the control factors, assuming an independent Rayleigh fading multiuser channel. We also evaluate the proposed algorithm employing the high SNR approximation. From simulation results, we could see that the proposed algorithm can control arbitrarily the throughput-fairness performance between the performance of the scheduler aiming to the maximum sum throughput and that of the scheduler aiming to the maximum fairness, finally, we see that the high SNR approximation can give a satisfactory performance in this situation.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.805-810
• /
• 2019

We present a time-frequency analysis algorithm based on the multitaper method and the state-space frameworks. In general, time-frequency representations have a trade-off between the time duration and the spectral bandwidth by the uncertainty principle. To optimize the trade-off problems, the short-time Fourier transform and wavelet based algorithms have been developed. Alternatively, the authors proposed the state-space frameworks based on the multitaper method in the previous work. In this paper, we develop a real-time algorithm to estimate variances and spectrum using the state-space framework. We test our algorithm in spectral analysis of simulated data.