• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1216-1221
• /
• 2005

The GPS software receiver based on the SDR(Software Defined Radio) technology provides the ability to easily adopt other signal processing algorithms without changing or modifying the hardware of the GPS receiver. However, it is difficult to implement the GPS software receiver using a commercial processor because of heavy computation load for processing the GPS signals in real time. This paper proposes an efficient GPS signal processing scheme and correlator structure to reduce the computation load for processing the GPS signal in the GPS software receiver, which uses a patterned look-up table method to generate the correlation value between the GPS signals and the replica signals. In this paper, it is explained that the computation load of the proposed scheme is much smaller than that of the previous GPS signal processing scheme. Finally, the processing time of the proposed scheme is compared with that of the previous scheme, and the improvement is shown from the viewpoint of the computation load.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.26-31
• /
• 2017

When mobile navigator device accesses data randomly, the cache memory performance is rapidly deteriorated due to low memory access locality. For instance, GPS (General Positioning System) of navigator program for automobiles or drones, that are currently in common use, uses data from 32 satellites and computes current position of a receiver. This computation of positioning is the major part of GPS which accounts more than 50% computation in the program. In this computation task, the satellite signals are received in real time and stored in buffer memories. At this task, since necessary data cannot be sequentially stored, the data is read and used at random. This data accessing patterns are generated randomly, thus, memory system performance is worse by low data locality. As a result, it is difficult to process data in real time due to low data localization. Improving the low memory access locality inherited on the algorithms of conventional communication applications requires a certain optimization technique to solve this problem. In this study, we try to do optimizations with data and memory to improve the locality problem. In experiment, we show that our case study can improve processing speed of core computation and improve our overall system performance by 14%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3103-3120
• /
• 2015

This paper presents a single-phase energy metering chip with built-in calibration function to measure electric power quantities. The entire chip consists of an analog front end, a filter block, a computation engine, a calibration engine, and an external interface block. The key design issues are how to reduce the implementation costs of the computation engine from repeatedly used arithmetic operations and how to simplify calibration procedure and reduce calibration time. The proposed energy metering chip simplifies the computation engine using time-division multiplexed arithmetic units. It also provides a simple and fast calibration scheme by using integrated digital calibration functionality. The chip is fabricated with 0.18-μm six-layer metal CMOS process and housed in a 32-pin quad-flat no-leads (QFN) package. It operates at a clock speed of 4096 kHz and consumes 9.84 mW in 3.3 V supply.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4329-4348
• /
• 2019

Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.475-488
• /
• 2003

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

• Journal of Information Technology Applications and Management
• /
• v.22 no.3
• /
• pp.105-114
• /
• 2015

This paper presents a fast Time Difference of Arrival (TDOA) estimation for sound source localization. TDOA is the time difference between the arrival times of a signal at two sensors. We propose a partial cross correlation method to increase the speed of TDOA estimation for sound source localization. We do this by predicting which part of the cross correlation function contains the required TDOA value with the help of the signal energies, and then we compute the cross correlation function in that direction only. Experiments show approximately 50% reduction in the cross correlation computation time thereby increasing the speed of TDOA computation. This makes it very relevant for real world surveillance.

• Journal of Mechanical Science and Technology
• /
• v.17 no.4
• /
• pp.545-561
• /
• 2003

We use the first-passage-time formulation by Torquato, Kim and Cule ［J. Appl. Phys., Vol. 85, pp. 1560∼1571 (1999) ］, which makes use of the first-passage region in association with the diffusion tracer's Brownian movement, and develop a new efficient Brownian motion simulation method to compute the effective conductivity of digitized composite media. By using the new method, one can remarkably enhance the speed of the Brownian walkers sampling the medium and thus reduce the computation time. In the new method, we specifically choose the first-passage regions such that they coincide with two, four, or eight digitizing units according to the dimensionality of the composite medium and the local configurations around the Brownian walkers. We first obtain explicit solutions for the relevant first-passage-time equations in two-and three-dimensions. We then apply the new method to solve the illustrative benchmark problem of estimating the effective conductivities of the checkerboard-shaped composite media. for both periodic and random configurations. Simulation results show that the new method can reduce the computation time about by an order of magnitude.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2451-2454
• /
• 2003

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses met scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, speech, spectrogram analysis, searching time reduced about 37.5％, 46.21％, 46.3％, 51.29％ in average, computational amount is reduced about 44.76％, 49.44％, 47.03％, 57.40％. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.