• Korean Management Science Review
• /
• v.18 no.1
• /
• pp.41-54
• /
• 2001

In this paper, we proposed a method to determine optimal wave source for mobile telephone communication. The approach is based on wave propagation simulation. Given a wave source we can determine wave propagation effects on every surfaces of wave simulation environment. The effect is evaluated as a cost function while the source’s position x, y, z work as variables for a parameter optimization. Wave propagated 3 dimensional space generates reflected waves whenever it hits boundary surface, it receives multiple waves which are reflected from various boundary surfacers in space. Three algorithms being implemented in this paper are based on a raytracing theory. If we get 3 dimensional geometry input as well as wave sources, we can compute wave propagation effects all over the boundary surfaces. In this paper, we present a new approach to compute wave propagation. First approach is tracing wave from a source. Source is modeled as a sphere casting vectors into various directions. This approach has limit in computing necessary wave propagation effects on all terrain surfaces. The second approach proposed is tracing wave backwards : tracing from a wave receiver to a wave source. For this approach we need to allocate a wave receiver on every terrain surfaces modeled, which requires enormous amount of computing time. But the second approach is useful for indoor wave propagation simulation. The last approach proposed in this paper is tracing sound by geometric computation. We allow direct, 1-relfe tion, and 2-reflection propagation. This approach allow us to save in computation time while achieving reasonable results. but due to the reflection limitaion, this approach works best in outdoor environment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.345-351
• /
• 2010

The finite volume time domain (FVTD) method gives accurate results for the calculation of electromagnetic wave propagation but it requires large amount of computer memory. In this paper we propose a modified FVTD that employs a time subdivision. The time-subdivided FVTD (TS-FVTD) method is enough to divide the space domain grid with a large step size. This method can reduce computation time and memory resources. We check the effectiveness of the proposed method in order to apply to the analysis of electromagnetic field from rough surface with dielectric waveguide.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.44-57
• /
• 2016

Rectification is used as a preprocessing to reduce the computation complexity of disparity estimation. However, rectification also requires a complex computation. To minimize the computing complexity, rectification using a lookup-table (R-LUT) has been introduced. However, since, the R-LUT consumes large amount of memory, rectification with compressed LUT (R-CLUT) has been introduced. However, the more we reduce the memory consumption, the more we need decoding overhead. Therefore, we need to attain an acceptable trade-off between the size of LUT and decoding overhead. In this paper, we present such a trade-off by adaptively combining simple coding methods, such as differential coding, modified run-length coding (MRLE), and Huffman coding. Differential coding is applied to transform coordinate data into a differential form in order to further improve the coding efficiency along with Huffman coding for better stability and MRLE for better performance. Our experimental results verified that our coding scheme yields high performance with maintaining robustness. Our method showed about ranging from 1 % to 16 % lower average inverse of compression ratio than the existing methods. Moreover, we maintained low latency with tolerable hardware overhead for real-time implementation.

• The Magazine of the IEIE
• /
• v.23 no.11
• /
• pp.89-100
• /
• 1996

A new stage-sliced pipiline structure is presented to design a high speed real time Global Positional Systems(GPS) applications. The CORDIC algorothm was revised to generate a pipeline structure, which will be used to produce a large amount of trigonometric computations rapidly. A stage-sliced approach was introduced to adjust the number of interative processes, and thereby to control the precision of computation results. Both the computation and the control circuits of the proposed architecture are included in a pipeline stage, which are intergrated into a stage slice. The circuit was prototyped using six FPGA chips : one is used for glue logics and five of the chips are used for pipeline slice implementation. A single FPGA chip comprising 7 pipeline stages provides one pipeline slice. To compensate and inter-slice time delay, dummy cycles are introduced in inter-slice signal exchanges.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5103-5115
• /
• 2015

In radar imaging, a target is usually consisted of a few strong scatterers which are sparsely distributed. In this paper, an improved sparse signal recovery algorithm based on smoothed l₀ (SL0) norm method is proposed to achieve high resolution ISAR imaging with limited pulse numbers. Firstly, one new smoothed function is proposed to approximate the l₀ norm to measure the sparsity. Then a single loop step is used instead of two loop layers in SL0 method which increases the searching density of variable parameter to ensure the recovery accuracy without increasing computation amount, the cost function is undated in every loop for the next loop until the termination is satisfied. Finally, the new set of solution is projected into the feasible set. Simulation results show that the proposed algorithm is superior to the several popular methods both in terms of the reconstruction performance and computation time. Real data ISAR imaging obtained by the proposed algorithm is competitive to several other methods.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.67-72
• /
• 2000

Particularly based on the signal bias removal(SBR) algorithm for compensating the corrupted speech, this paper presents a new algorithm which is independent of environments, minimizes the amount of computation, and is readily applicable to the conventional recognition system. To this end, a multiple-bias algorithm and a partial codebook search algorithm have been added to the conventional SBR algorithm. The simulation results show that combining the two algorithms proposed in this paper provides a reduction of computation time to 1/8 times as well as an improvement of the recognition rate from 77.58% of the conventional system to 81.32%.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.179-187
• /
• 2004

Password authenticated key exchange protocols for the symmetric model are easier to design, analyze and are more efficient than ones for the asymmetric model, but they are most likely to be broken by server's compromise. Though the protocols with provable security for the asymmetric model such as PAK-X and SNAPI-X are introduced, they need large amount of computation compared with the standard Diffie-Hellman key exchange. We present a systematic and efficient way to transform password authenticated key exchange protocols for the symmetric model into protocols for the asymmetric model. Thus, an efficient protocol for the asymmetric model can be constructed by a systematic protocol with low computation.

• ETRI Journal
• /
• v.31 no.6
• /
• pp.732-740
• /
• 2009

This paper describes the implementation of a digital audio effect system-on-a-chip (SoC), which integrates an embedded digital signal processor (DSP) core, audio codec intellectual property, a number of peripheral blocks, and various audio effect algorithms. The audio effect SoC is developed using a software and hardware co-design method. In the design of the SoC, the embedded DSP and some dedicated hardware blocks are developed as a hardware design, while the audio effect algorithms are realized using a software centric method. Most of the audio effect algorithms are implemented using a C code with primitive functions that run on the embedded DSP, while the equalization effect, which requires a large amount of computation, is implemented using a dedicated hardware block with high flexibility. For the optimized implementation of audio effects, we exploit the primitive functions of the embedded DSP compiler, which is a very efficient way to reduce the code size and computation. The audio effect SoC was fabricated using a 0.18 ${\mu}m$ CMOS process and evaluated successfully on a real-time test board.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.2
• /
• pp.125-130
• /
• 2016

In this paper, we deal with the dynamic walking of a humanoid robot. In our method, the inverted pendulum model is used as a dynamic model for a humanoid robot in which the Zero Moment Point (ZMP) and COG constraints of the robot are analyzed by considering the motion of the robot as that of an inverted pendulum. The motion of a humanoid robot should be generated by considering the dynamics of the robot, which commonly requires a large amount of computation. If a robot walks from one position to another while keeping the ZMP in the stable region, then the robot remains dynamically stable. The linear inverted pendulum model regards the whole robot as a point mass. It is simple, and relatively less computation is needed; however, it cannot model the whole dynamics of a humanoid robot. We propose a method for modeling a humanoid robot as an inverted pendulum system having 14 point masses. We also show that the dynamic stability of a humanoid robot can be determined more precisely by our method.