• 한국자동차공학회논문집
• /
• 제17권3호
• /
• pp.127-141
• /
• 2009

While the ever-increasing complexity of automotive software systems can be effectively managed through the adoption of a reliable real-time operating system (RTOS), it may incur additional resource usage to a resultant system. Due to the mass production nature of the automotive industry, reducing physical resources used by automotive software is of the utmost importance for cost reduction. OSEK OS is an automotive real-time kernel standard specifically defined to address this issue. Thus, it is very important to develop and exploit kernel mechanisms such that they can achieve minimal resource usage in the OSEK OS implementation. In this paper, we analyze the task subsystem, resource subsystem, application mode and conformance classes of OSEK OS as well as the OSEK Implementation Language (OIL). Based on our analysis, we in turn devise and implement kernel mechanisms to minimize the dynamic memory usage of the OSEK OS implementation. Finally, we show that our mechanisms effectively reduce the memory usage of OSEK OS and applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4220-4241
• /
• 2017

For the downlink energy-harvesting small cell network, this paper proposes an interference management algorithm based on distributed coalitional game. The cooperative interference management problem of the energy-harvesting small cells is modeled as a coalitional game with transfer utility. Based on the energy harvesting strategy of the small cells, the time sharing mode of the small cells in the same coalition is determined, and an optimization model is constructed to maximize the total system rate of the energy-harvesting small cells. Using the distributed algorithm for coalition formation proposed in this paper, the stable coalition structure, optimal time sharing strategy and optimal power distribution are found to maximize the total utility of the small cell system. The performance of the proposed algorithm is discussed and analyzed finally, and it is proved that this algorithm can converge to a stable coalition structure with reasonable complexity. The simulations show that the total system rate of the proposed algorithm is superior to that of the non-cooperative algorithm in the case of dense deployment of small cells, and the proposed algorithm can converge quickly.

• 대한의용생체공학회:의공학회지
• /
• 제19권3호
• /
• pp.321-325
• /
• 1998

일반적으로 현재의 초음파 의료영상시스템에서 지연시간의 계산에 사용하는 음속도는 인체의연조직에서의 평균속도인 1540m/s 의 값을 이용한다. 그러나 사람마다 혹은 매질의 특성에 따라 초음파의 속도가 크게 차이가 나서 고정된 속도를 이용한 집속 지연시간 계산에는 오차가 발생한다. 이는 해상도의 저하를 가져올 뿐만 아니라, 매질의 기하학적인 크기나 거리정보가 필요한, 심장이나 신장의 용적을 계산과 같은 경우에는 큰 오차를 가져온다. 따라서 매질의 속도를 정확히 구하는 것이 해상도 향상의 중요한 관건의 하나임을 알 수가 있다. 본 논문에서는 이를 위해 매질내의 관심영역에서의 밝기를 최대화시켜주는 접속지연시간 프로파일을 구해 매질 내에서의 옴파의 속도를 측정하여 실제 초음파 팬텀에 적응하여 좋은 결과를 얻을 수 있었다.

• 방송공학회논문지
• /
• 제21권2호
• /
• pp.140-148
• /
• 2016

HEVC(High Efficiency Video Coding)는 H.264/AVC 대비하여 두 배 가까이 높은 압축률을 갖지만 부호화기의 복잡도가 크게 증가하였다. 이러한 높은 복잡도는 실시간 소프트웨어 부호화기 구현에 있어 문제가 될 수 있다. 부호화기의 계산복잡도를 줄이기 위하여 본 논문에서는 첫 번째로 화면 내 예측과정에서 입력 영상의 변환계수의 분포를 분석하여 예측블록의 크기와 모드를 빠르게 결정짓는 방법을 제안한다. 두 번째로, cbf(coded block flag)를 이용하여 예측블록의 크기를 빠르게 결정짓는 방법도 제안한다. 제안된 방법은 HM16.0 대비 0.8%의 비트율 증가하였지만 41%의 부호화 속도를 향상시켰다.

• 경영과학
• /
• 제10권1호
• /
• pp.139-156
• /
• 1993

Various ATM switches have been proposed since Asynchronous Transfer Mode (ATM) was recognized as appropriate for implementing broadband integrated services digital network (BISDN). An ATM switching network may be evaluated on two sides : traffic performances (maximum throughput, delay, and packet loss probability, etc.) and structural features (complexity, i.e. the number of switch elements necessary to construct the same size switching network, maintenance, modularity, and fault tolerance, etc.). ATM switching networks proposed to date tend to show the contrary characteristics between structural features and traffic performance. The Knockout Switch, which is well known as one of ATM switches, shows a good traffic performance but it needs so many switch elements and buffers. In this paper, we propose an input and output buffered Knockout Switch for the purpose of reducing the number of switch elements and buffers of the existing Knockout Switch. We analyze the traffic performance and the structural features of the proposed switching architecture through a discrete time Markov chain and compare with those of the existing Knockout Switch. It was found that the proposed architecture could reduce more than 40 percent of switch elements and more than 30 percent of buffers under a given requirement of cell loss probability of the switch.

• 전자공학회논문지CI
• /
• 제46권2호
• /
• pp.1-9
• /
• 2009

본 논문에서는 H.264/AVC의 I-slice의 모든 블록들을 복원하지 않고 블록의 경계 부분만을 복원하여 intra prediction을 고속으로 수행하는 방법을 개발한다 이를 위하여 intra prediction의 참조 화소들로 구성될 수 있는 차이 블록의 경계를 고속으로 복원하는 고속 역 정수 DCT를 개발한다. 고속으로 복원된 차이 경계 화소들과 각 예측 모드에 알맞게 구한 예측 화소들을 더하여 경계 화소들을 update하며, intra prediction에 필요한 참조 화소들로 구성한다. 개발된 기법은 H.264/AVC의 정수 DCT와 호환성을 유지하고, 고화질 영상 부호화시 사용되는 대표적인 HD 시퀀스에 적용 가능함을 실험으로 검증하였다.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.360-366
• /
• 2011

In this paper, we investigate the problem of power allocation in a heterogeneous network that is composed of a pair of cognitive users (CUs) and an infrastructure-based primary network. Since CUs have only limited effective spectrum-sensing ability and primary users (PUs) are not active all the time in all locations and licensed bands, we set up a new multi-area model to characterize the heterogeneous network. A novel combined interference-avoidance policy corresponding to different PU-appearance situations is introduced to protect the primary network from unacceptable disturbance and to increase the spectrum secondary-reuse efficiency. We use dual decomposition to transform the original power allocation problem into a two-layer optimization problem. We propose a low-complexity joint power-optimizing method to maximize the transmission rate between CUs, taking into account both the individual power-transmission constraints and the combined interference power constraint of the PUs. Numerical results show that for various values of the system parameters, the proposed joint optimization method with combined PU protection is significantly better than the opportunistic spectrum access mode and other heuristic approaches.

• 한국수소및신에너지학회논문집
• /
• 제27권1호
• /
• pp.106-113
• /
• 2016

Lean burn engine, classified into port injection and direct injection, is recognized as a promising way to meet better fuel economy. Especially, LPG direct injection engine is becoming increasingly popular due to their potential for improved fuel economy and emissions. Also, LPDi engine has the advantages of higher power output, higher thermal efficiency, higher EGR tolerance due to the operation characteristics of increased volumetric efficiency, compression ratio and ultra-lean combustion scheme. However, LPDi engine has many difficulties to be solved, such as complexity of injection control mode (fuel injection timing, injection rate), fuel injection pressure, spark timing, unburned hydrocarbon and restricted power. This study is investigated to the influence of spark timing, fuel injection position and fuel injection rate on the combustion stability of LPDi engine. Piston shape is constituted the bowl type piston. The characteristics of combustion is analyzed with the variations of spark timing, fuel injection position and fuel injection rate (early injection, late injection) in a LPDi engine.

• Journal of Communications and Networks
• /
• 제14권1호
• /
• pp.15-20
• /
• 2012

As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve this problem and provide the desired complexity, dynamic behavior, and fairness features of 3G and beyond 3G mobile communication systems, this paper proposes a novel cross-layer dynamic integrated priority-computing scheme that computes the priority based on a variety of factors, including quality of service requirements, subscriber call types, waiting time, movement mode, and traffic load from the corresponding layers. It is observed from simulation results that the proposed dynamic integrated priority scheme provides enhanced performance.

• 한국정보과학회논문지:정보통신
• /
• 제29권2호
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.