• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.9-16
• /
• 1994

In this paper, we propose a frequency assignment algorithm to minimize intermodulation effect which is caused by nonlinear amplipification of the satellite transponder. Allmost all of the published algorithms up to now are applicable to one-level SCPC systems, the application range of those algorithms is very restricted from the viewpoint of actual practice. In this paper, we develope and propose a new frequency assignment algorithm which utilize the basic concept of Okinaka's DELINS-INSDEL algorithm to extend its applicabilty from one-level SCPC systems to multi-level systems. The proposed TDTI algorithm provides considerable generality in reducing intermodulation effect in practical satellite communication systems because of its alpplicability to multi-level and multi-bandwidth systems as well as one-level systems. Besides the TDTI algorithm which shows excellent characteristics in performance but requires somewhat long excution time. the WTDI-SDELINS algorithm is proposed in this paper to compensate TDTI's demerits in excution time. Considering the fact that there are very little published sterategies for multi-level and muti-bandwidth systems. the algorithm proposed in this paper is quite meaningful.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.111-116
• /
• 2007

The design problem of partial pole assignment (PPA) in two classes of frequency-domain MIMO models by constant gain feedback is investigated in this paper. Its aim is to design a constant gain feedback which changes only a subset of the open-loop eigenvalues, while the rest of them are kept unchanged in the closed-loop system. A near general parametric expression for the feedback gain matrix in term of a set of design parameter vectors and the set of the closed-loop poles, and a simple parametric approach for solving the proposed problem are presented. The set of poles do not need to be previously prescribed, and can be set undetermined and treated together with the set of parametric vectors as degrees of design freedom provided by the approach. An illustrative example shows that the proposed parametric method is simple and effective.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1608-1618
• /
• 2016

In this paper we introduce a graph theory approach to solve the frequency assignment problem(FAP) for military communication network. Prior algorithms are implemented adaptively to the problem, and enhanced algorithms are proposed to show that their results approximately approached the optimum performance. We also proposed polarization assignment algorithms to enhance the FAP performances.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.63-77
• /
• 2008

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. Hierarchical network design using genetic algorithm is the first three-tier (Macro, Micro, Pico) model. We increase the reality through applying to Electromagnetic Compatibility Constraints. Computational experiments on 72 problem instances which have $15{\sim}40$ candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers 90% of the demand.

• Journal of Korea Game Society
• /
• v.17 no.4
• /
• pp.137-148
• /
• 2017

Since the power consumption of data centers is large and computer serves take a large portion of it, there have been much research on the power saving of servers in various ways recently. Among the units of severs CPU is one of major power consuming units. In this paper, a method of client-server assignment for minimizing the CPU power consumption of servers in a game server cluster is proposed. We model the client-server assignment problem as an optimization problem, and find a solution to the problem using a simulated annealing-based technique. One of major features of our method is to select a proper operating frequency according to the amount of load on a server. The selection of a lower frequency in case of low load will result in reducing power consumption. To our survey, little research on client-server assignment in consideration of power consumption has been carried out.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1483-1494
• /
• 1993

Most studies analyse the frequecny polities intuitively based on the assumptin that there is no question in the frequency regulation by the government. But this paper started from the concept of frequency as economic goods. This paper conclude that frequency regulation by the government is needed to redistribute the economic surplus causing excessive demand. There are five methods in the frequency assignment-comparative healing, auction, lottery, Joint consortium and pioneer preference. The five methods are studied form the view of welfare economics and the respective political Implications are proposed in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.954-957
• /
• 2016

In cases of military communication plan, it often requires to find a proper solution for frequency assignment within feasible time. Minimizing the number of used resources are related to cost issue, hence it is a critical objective. When the dual polar antenna is used, the performance can be much developed by exploiting the polarization separation. In this paper, we propose an algorithm that assigns polarizations and frequencies within complexity of $O(N^2)$ based on the graph matching theory. We have verified that the proposed algorithm shows almost twice performance relative to the uni-polar frequency assignment algorithms and it approaches very closely to its theoretical optima.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.51-57
• /
• 2008

We present a modeling of constraint satisfaction problems and provide heuristic algorithms of backtracking search to optimize the frequency assignment. Our research objective is to find a frequency assignment that satisfies all the constraints using minimum number of frequencies while maximizing the number of community radio stations served for a given area. In order to get a effective solution, some ordering heuristics such as variable orderings and value orderings are provided to minimize the backtracking in finding all solutions within a limited time. To complement the late detection of inconsistency in the backtracking, we provide the consistency enforcing technique or constraint propagation to eliminate the values that are inconsistent with some constraints. By integrating backtracking search algorithms with consistency enforcing techniques, it is possible to obtain more powerful and effective algorithms of constraint satisfaction problems. We also provide the performance evaluation of proposed algorithms by comparing the theoretical lower bound and our computed solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1624-1630
• /
• 1999

Code division multiple access (CDMA) is a promising air interface technique for cellular systems. When an MS (Mobile Station) moves to an adjacent cell, the handoff between the serving cell and the target cell is needed. Compared with the hard handoffs, the soft handoffs between two CDMA channels with the identical frequency assignments and frame offsets can provide a better quality of service by minimizing the undesirable ping pong phenomenon of back-and forth handoffs between two adjacent cells in conventional hard handoffs. For the soft handoff of a call to an adjacent cell to be successful, the adjacent cell should assign to the call the same frame offset as that being used in the original cell by the call. In this paper, considering the assignment states of the frame offsets of the adjacent cells, a frame offset assignment algorithm for the originated call is proposed. And analytic method for the handoff blocking probability due to the lack of the frame offset capacity is also presented to show the advantage of the proposed algorithm with respect to the soft handoff blocking probability.