• IE interfaces
• /
• v.17 no.4
• /
• pp.466-471
• /
• 2004

In this paper, I develop a simple dynamic resource allocation algorithm that reduces the call blocking rate by improving the resource utilization of the WCDMA (Wideband Code Division Multiple Access) systems under multimedia service environment. Simulation results show that the proposed algorithm significantly reduces the blocking rate of high speed multimedia calls. The algorithm developed in this paper is currently working in the commercial WCDMA IMT-2000 system.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.1
• /
• pp.229-234
• /
• 1998

We study on a terrain contour matching algorithm using Radial Basis Functions(RBFs) for aided inertial navigation system for position fixing aircraft, cruise missiles or re-entry vehicles. The parameter optimization technique is used for updating the parameters describing the characteristics of an area with modified Gaussian least square differential correction algorithm and the step size limitation filter according to the amount of updates. We have applied the algorithm for matching a sampled area with a target area supposed that the area data are available from Radar Terrain Sensor(RTS) and Reference Altitude Sensor(RAS)

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1331-1342
• /
• 2009

In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.774-777
• /
• 2004

RAIM techniques based on TLS have rarely born addressed because TLS requires a great number of computations. In this paper, the special form of the observation matrix H, that is, one column is exactly known, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm makes us enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.31-34
• /
• 2005

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• Journal of Positioning, Navigation, and Timing
• /
• v.3 no.1
• /
• pp.17-23
• /
• 2014

Satellite Based Augmentation Systems (SBAS) provide ionospheric corrections at geographically five degree-spaced Ionospheric Grid Points (IGPs) and confidence bounds, called Grid Ionospheric Vertical Errors (GIVEs), on the error of those corrections. Since the ionosphere is one of the largest error sources which may threaten the safety of a single frequency Global Navigation Satellite System (GNSS) user, the ionospheric correction and integrity bound algorithm is essential for the development of SBAS. The current single frequency based SBAS, already deployed or being developed, implement the ionospheric correction and error bounding algorithm of the Wide Area Augmentation System (WAAS) developed for use in the United States. However, the ionospheric condition is different for each region and it could greatly degrade the performance of SBAS if its regional characteristics are not properly treated. Therefore, this paper discusses key factors that should be taken into consideration in the development of the ionospheric correction and integrity bound algorithm optimized for the Korean SBAS. The main elements of the conventional GIVE monitor algorithm are firstly reviewed. Then, this paper suggests several areas which should be investigated to improve the availability of the Korean SBAS by decreasing the GIVE value.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.1-6
• /
• 2009

Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.2
• /
• pp.98-109
• /
• 2010

This paper deals with a new method of unmanned aerial vehicle (UAV) recovery when a UAV fails to get a global positioning system (GPS) signal at an unprepared site. The proposed method is based on the simultaneous localization and mapping (SLAM) algorithm. It is a process by which a vehicle can build a map of an unknown environment and simultaneously use this map to determine its position. Extensive research on SLAM algorithms proves that the error in the map reaches a lower limit, which is a function of the error that existed when the first observation was made. For this reason, the proposed method can help an inertial navigation system to prevent its error of divergence with regard to the vehicle position. In other words, it is possible that a UAV can navigate with reasonable positional accuracy in an unknown environment without the aid of GPS. This is the main idea of the present paper. Especially, this paper focuses on path planning that maximizes the discussed ability of a SLAM algorithm. In this work, a SLAM algorithm based on extended Kalman filter is used. For simplicity's sake, a blimp-type of UAV model is discussed and three-dimensional pointed-shape landmarks are considered. Finally, the proposed method is evaluated by a number of simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1214-1222
• /
• 2006

In this paper, an efficient direction-r)f-arrival based adaptive beamforming algorithm for orthogonal frequency-division multiple-access smart antenna systems is proposed. The proposed algorithm provides a high performance by steering main beams to the directions of a desired signal, whereas steering nulls to the directions of the interference, using the estimated directions. The beamforming outputs obtained by steering the main beams to the distinct directions of resolvable multipath signals are combined in a maximal ratio manner to exploit angular diversity gain. The performance elf the proposed algorithm is finally evaluated in cellular mobile environments to verify its efficiency and is compared with that of least-squares beamforming algorithm, by taking the WiBro system as a target system.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.1-9
• /
• 2002

Converged LAN accepts diverse traffics so that performance analysis is very important for successful development of converged LAN. In this paper, we develop simulation program using SALM II and simulate queue management scheme and scheduling algorithm for converged LAN. The result of simulation shows the effect of performance for cyclic service algorithm larger than priority algorithm using weight. And queue management can be easy by implementation of Back Pressure scheme.