• Korean Journal of Remote Sensing
• /
• v.18 no.5
• /
• pp.273-280
• /
• 2002

This paper describes a mathematical model and its utilization algorithm for calculating the accurate target position on the ellipsoidal earth surface which corresponds to a range-azimuth coordinates of unprocessed synthetic aperture radar (SAR) images. A geometrical model which is a set of coordinate transformations is described. The side-looking directional angle (off-nadir angle) is determined in an iterative fashion by using the model and the accurate slant range which is calculated from the range sampling timing of the instrument. The algorithm can be applied not only for the geolocation of SAR images but also for the high quality SAR image generation by calculating accurate Doppler parameters.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• Journal of Korean Society for Geospatial Information Science
• /
• v.12 no.1 s.28
• /
• pp.11-20
• /
• 2004

The purpose of this paper is to evaluate the applicability of GPS data for real-time traffic information collection especially after SA removal. Two major results have been reported. One is the GPS data availability and/or useful data point density for travel time estimation using Circle-X algorithm. 87.23% of data points can be mobilized after SA whereas only 29.94% of data was useful in calculating travel time. The other is the possible reduction of the buffer size that is used for screening the points of all GPS into useful and useless data, respectively. With these outcomes, it is safely expected that the regular GPS alone can provide the data points for real-time travel time estimation instead of the more expensive DGPS system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.55-60
• /
• 2023

When performing the multiplication m×r=p of two binary numbers m and r on a computer, there is a shift-and-add(SA) method in which no time-consuming multiplication is performed, but only addition and shift-right(SR). SA is a very simple method in which when the value of the multiplier r_i is 0, the result p is only SR with m×0=0, and when r_i is 1, the result p=p+m is performed with m×1=m, and p is SR. In SA, the number of SRs can no longer be shortened, and the improvement part is whether the number of additions is shortened. This paper proposes an SA method to minimize addition based on the fact that setting a smaller number to r when converted to a binary number to be processed by a computer can significantly reduce the number of additions compared to the case of setting a smaller number to r based on the decimals that humans perform. The number of additions to the proposed algorithm was compared for four cases with signs (-,-), (-,+), (+,-), and (+,+) for some numbers in the range [-127,128]. The conclusion obtained from the experiment showed that when determining m and r, it should be determined as a binary number rather than a decimal number.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.578-589
• /
• 2014

In this paper, we introduce the concept of cyber-physical intersection systems (CPIS) which interconnects roadside units (RSU) located at the intersection, on-board units (OBU) of moving vehicles, and the smartphone apps, named the Smartphone Agent (SA). At the pedestrian mode of the SA, the connectivity management schemes, such as a location update and a handover control algorithm, are proposed to better support the CPIS services while minimizing the power consumption of the pedestrian's smartphone. We develop a real prototype of the CPIS, including RSU, OBU, and the SA. Based on the numerical results collected from a pedestrian moving around the Pusan National University campus, we validate that the proposed connectivity management schemes can improve not only the power efficiency of the pedestrian's smartphone, but also the quality of the CPIS services.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1213-1216
• /
• 1987

In this paper, the application of AMFC(adaptive model - following-control) algorithm to the D.C motor speed control is investigated by using the 68000 microprocessor. Computer simulation in discrete AMFC algorithm shows that output errors caused by the external input and the variation of parameters in D.C motor are converged to zero.

• Journal of the Korean Society for Railway
• /
• v.2 no.1
• /
• pp.56-66
• /
• 1999

This purpose of this paper is to perform the readhesion control algorithm of the urban railway traction. A study on readhesion control algorithm is done for the adhesion system. This system has all characteristics of the voltage source converter by a process ability to regenerate power. The traction motor is controlled by IGBT inverter. The test equipment composes traction motor, torque-meter, clutch, and a tubular type of interia mass.

• Proceedings of the KSME Conference
• /
• 2001.06a
• /
• pp.939-944
• /
• 2001

Genetic algorithm is modelled on natural evolution and simulated annealing is based on the simulation of thermal annealing. Both genetic algorithm and simulated annealing are stochastic method. So they can find global optimum values. For compare efficiency of SA and GA's, some function value was maximized. In the result, that was a little better than GA's.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.699-701
• /
• 1997

The simulated annealing(SA) algorithm is a stochastic strategy for search of the ground state and a powerful tool for optimization, based on the annealing process used for the crystallization in physical systems. It's main disadvantage is the long convergence time. Therefore, this paper proposes a stochastic algorithm combined with conventional deterministic optimization method to reduce the computation time, which is called SDS(Stochastic-Deterministic-Stochastic) method.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2442-2444
• /
• 1998

This paper presents a method for designing a multiresolution orthogonal wavelet transform matrix and it is extended to the establishment of the wavelet transform domain sign algorithms(SA). It outperforms the conventional sign algorithm, with performance comparable to the LMS algorithm. Together with Daubechies type 1 wavelet, we could also save additional computations which are required in transforming data.