• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.224.1-224.1
• /
• 2005

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.5
• /
• pp.365-372
• /
• 2021

This paper deals with an optimal Weapon-Target Assignment (WTA) algorithm for Closed-In Weapon Systems (CIWS), considering variable burst time. In this study, the WTA problem for CIWS is formulated based on Mixed Integer Linear Programming (MILP). Unlike the previous study assuming that the burst time is fixed regardless of the engagement range, the proposed method utilizes the variable burst time based on the kill probability according to the engagement range. Thus, the proposed method can reflect a more realistic engagement situation and reduce the reaction time of CIWS against targets, compared to the existing method. In this paper, we first reformulate the existing MILP-based WTA problem to accommodate the variable burst Time. The proposed method is then validated through numerical simulations with the help of a commercial optimization tool.

• Journal of Convergence for Information Technology
• /
• v.11 no.5
• /
• pp.9-16
• /
• 2021

In binary-modulation non-orthogonal multiple access (NOMA), there has been rare researches for the 1+1 capacity region to be achieved; how much total power is required and what power allocation is assigned for this total power. In this paper, the average total transmitted power to achieve 1+1 capacity region of binary pulse amplitude modulation (2PAM) NOMA is investigated, with a tolerable loss. Then, based on the sufficient average total transmitted power, we calculate the power allocation coefficient to achieve 1+1 capacity region. Furthermore, it is shown by numerical results that with the tolerable loss less than 0.008, near 1+1 capacity region is achieved. We also calculate numerically the power allocation coefficient for both users to achieve near 1+1 capacity region. As a result, for 2PAM NOMA to operate near 1+1 capacity region, proper total power with appropriate power allocation could be calculated in design of NOMA systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1461-1470
• /
• 1998

Bit allocation or quantizer assigning problem is a basic and essential issue in lossy picture coding. It could be represented as minimizing overall distortion with the given constraint that total bits should not exceed allowed bit-budget. Optimal solution can be found by Lagrangian method. However this method needs much computational time and memory. This paper presents an approximation method that uses the activity measure. The comparison between the existing activity measuring techniques are made, and mapping function from activity value to the quantizer is proposed. Under MPEG-1 Intra coding situation, simulations show almost identical results compared to the optimal ones obtained by Lagrangian method with reduced computational time.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2
• /
• pp.63-70
• /
• 1998

특정 기지국에 호가 집중하는 경우, 통화차단율 증가로 인한 가입자에 대한 서비스 의 저하를 해결할 수 없다. 따라서 근접 기지국에 할당된 채널의 상당부분을 특정 기지국이 공용하도록 함으로서 채널이용률을 최대화하고 통화차단율을 최소화할 수 있는 중계망 구성 에 대한 연구가 절실히 요구된다. 본 논문에서는 특정 기지국에 발생하는 집중호를 근접 기 지국에 균등 분배케 함으로서 통화차단율을 최소화하고 가입자에 대한 통화서비스를 향상시 킬 수 있는 중계망 운용 알고리듬을 제안하고 컴퓨터 시뮬레이션을 통해 그 개선 정도를 확 인한다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.165-180
• /
• 2001

This study is on the design and performance evaluation of a multi medium access control(MAC) protocol for multimedia access in the wireless ATM network. In general, MAC protocols for multimedia data transmission are classified into the fixed slot allocation algorithm that allocates base-station slots equally over terminals, and the dynamic slot allocation algorithm that with flexible penetration. The conventional slot allocation algorithms assign slots based on the average bandwidths required for various services types. Although the algorithms have a wide bandwidth for real-time-variant services, the slots are being wasted due the service types. To improve the slot waste problem, this thesis proposes a method that minimizes the waste by assigning variable slots based on the most appropriate bandwidth after a base-station analyzes the service type requested from terminals.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.386-391
• /
• 2011

CRU (contiguous resource unit) composed of adjacent OFDMA subcarriers is popularly adopted for recently developed cellular communication standards, e.g. IEEE 802.16e/m. If multiple CRUs having different SNR are assigned to a mobile station, and multiple packet streams are independently transmitted by using H-ARQ transmission, an achievable data rate can be varied according to the channel allocation method of re-transmission packets and new transmission packets. In this paper, the optimum channel allocation method for the above stated problem, and several sub-optimum channel allocation methods to reduce the computational complexity of the optimum allocation method are proposed. According to the simulation results, a sub-optimum allocation method assigning a CRU having good SNR to new transmission packet shows marginal performance loss compared with optimum method, however, the computational complexity can be significantly reduced.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.11
• /
• pp.787-794
• /
• 2019

In this paper, a Mixed Integer Linear Programming(MILP) approach for solving optimal Weapon-Target Assignment(WTA) problem of multiple dissimilar Closed-In Weapon Systems (CIWS) is proposed. Generally, WTA problems are formulated in nonlinear mixed integer optimization form, which often requires impractical exhaustive search to optimize. However, transforming the problem into a structured MILP problem enables global optimization with an acceptable computational load. The problem of interest considers defense against several threats approaching the asset from various directions, with different time of arrival. Moreover, we consider multiple dissimilar CIWSs defending the asset. We derive a MILP form of the given nonlinear WTA problem. The formulated MILP problem is implemented with a commercial optimizer, and the optimization result is proposed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.24-30
• /
• 2009

This paper presents a simple resource allocation scheme for throughput enhancement in relay based orthogonal frequency division multiple access (OFDMA) cellular systems. The resource allocation schemes, which are based on the optimization problem, have high computational complexity. That is why a searching process is required on the overall allocable resources. Since these schemes should be performed in real time, we propose a simple resource allocation scheme which has very low computational complexity. Firstly, we formulate the optimization problem and draw observations for throughput maximization. Based on observations, we propose a three step allocation scheme that separates the allocable resources into three (i.e. relay, frequency and time). By doing so, the computational complexity can be reduced. Simulation results show that the proposed scheme has near-optimum performance in spite of its low computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1038-1044
• /
• 2010

Interference may severely deteriorate performance in wireless communication. Han-Kobayashi scheme splits each user's signal into private and common information so that the receiver removes the other's common signal for partial interference cancellation. This paper proposes an optimal power allocation to private and common signals for Han-Kobayashi scheme by using required SNR in a private information only system. Numerical results show that the proposed power allocation is quite close to the optimal power allocation based on exhaustive searches.