• Journal of the Korean Geosynthetics Society
• /
• v.8 no.3
• /
• pp.17-23
• /
• 2009

Conventional methods of reinforced slope analysis based on the concept of limit equilibrium have been widely adopted mainly due to their simplicity and short computation time. But depending upon the assumptions on the inter-slice forces, the factor of safety resulting from the limit equilibrium method is not uniquely determined. This paper describes a method to calculate the factor of safely of a slope using a numerical analysis. Recently some useful analysis techniques (Strength reduction method and the stability method using stress fields) by numerical analysis are proposed and their theory and characteristics applications are studied and investigated with simple examples in this paper.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.3
• /
• pp.33-40
• /
• 1994

Code Excited Linear Prediction(CELP) speech coders exhibit good performance at data rates below 4.8 kbps. This major drawback of CELP type coders is required much computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reducing complexity. In the pitch searching, we detect the segments of high correlation by a simple preprocessing, and then carry out the pitch searching only for the segments obtained by the preprocessing. By using the proposed method, we can get approximately $77\%$ complexity reduction in the pitch search.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.544-557
• /
• 2010

This paper addresses the problem of controlling the envelope's power peak of single carrier modulated signals, band limited by root-raised cosine (RRC) pulse shaping filters, in order to reduce power amplifier back-off for very small aperture terminals ground stations. Magnitude modulation (MM) is presented as a very efficient solution to the peak-to-average power ratio problem. This paper gives a detailed description of the MM concept and its recent evolutions. It starts by extending the look-up-table (LUT) based approach of the MM concept to M-ary constellations with M ${\leq}$ 16. The constellation and RRC symmetries are explored, allowing considerable reduction on LUT computation complexity and storage requirements. An effective multistage polyphase (MPMM) approach for the MM concept is then proposed. As opposed to traditional LUT-MM solutions, MM coefficients are computed in real-time by a low complexity multirate filter system. The back-off from high-power amplifier saturation is almost eliminated (reduction is greater than 95%) with just a 2-stage MPMM system even for very demanding roll-off cases (e.g., ${\alpha}$ = 0,1). Also, the MPMM is independent of modulation in use, allowing its easy application to constellations with M > 16.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.51-57
• /
• 1994

Code Excited Linear Prediction(CELP) vocoder exhibits good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their large amount of computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the pitch searching range by estimating the preliminary pitches. Applying the proposed method to the CELP vocoder, we can get approximately 87% complexity reduction in the pitch search.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.666-670
• /
• 2004

This paper presents a new approach for determining an accurate incentive levels of Direct Load Control (DLC) program using sequential Monte Carlo Simulation (MCS) techniques. The economic analysis of DLC resources needs to identify the hourly-by-hourly expected energy-not-served resulting from the random outage characteristics of generators as well as to reflect the availability and duration of DLC resources, which results the computational explosion. Therefore, the conventional methods are based on the scenario approaches to reduce the computation time as well as to avoid the complexity of economic studies. In this paper, we have developed a new technique based on the sequential MCS to evaluate the required expected load control amount in each hour and to decide the incentive level satisfying the economic constraints. And also the proposed approach has been considered multi-state as well as two-state of the generating units. In addition, we have applied the variance reduction technique to enhance the efficiency of the simulation. To show the efficiency and effectiveness of the suggested method the numerical studies have been performed for the modified IEEE reliability test system.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.158-167
• /
• 2017

Internet-based social and interactive video applications have become major constituents of the envisaged applications for next-generation multimedia networks. However, inherently dynamic network conditions, together with varying user expectations, pose many challenges for resource allocation mechanisms for such applications. Yet, in addition to addressing these challenges, service providers must also consider how to mitigate their operational costs (e.g., energy costs, equipment costs) while satisfying the end-user quality of service (QoS) expectations. This paper proposes a heuristic solution to the problem, where the energy incurred by the applications, and the monetary costs associated with the service infrastructure, are minimized while simultaneously maximizing the average end-user QoS. We evaluate the performance of the proposed solution in terms of serving probability, i.e., the likelihood of being able to allocate resources to groups of users, the computation time of the resource allocation process, and the adaptability and sensitivity to dynamic network conditions. The proposed method demonstrates improvements in serving probability of up to 27%, in comparison with greedy resource allocation schemes, and a several-orders-of-magnitude reduction in computation time, compared to the linear programming approach, which significantly reduces the service-interrupted user percentage when operating under variable network conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.379-385
• /
• 2015

This paper proposes the hardware architecture of high performance ALF(Adaptive Loop Filter) for efficient filter coefficient estimation. In order to make the original image which has high resolution and high quality into highly compressed image effectively and also, subjective image quality into improved image, the ALF technique of HEVC performs a filtering by estimating filter coefficients using statistical characteristics of image. The proposed ALF hardware architecture is designed with a 2-step pipelined architecture for a reduction in performance cycle by analysing an operation relationship of Cholesky decomposition for the filter coefficient estimation. Also, in the operation process of the Cholesky decomposition, a square root operation is designed to reduce logic area, computation time and computation complexity by using the multiplexer, subtracter and comparator. The proposed hardware architecture is designed using Xilinx ISE 14.3 Vertex-7 XC7VCX485T FPGA device and can support 4K UHD@40fps in real time at a maximum operation frequency of 186MHz.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.813-818
• /
• 2021

This paper proposes an optimized hardware implementation method for existing CIE1931 color gamut control algorithm. Among the post-processing methods of dehazing algorithms, existing algorithm with relatively low computations have the disadvantage of consuming many hardware resources by calculating large bits using Split multiplier in the computation process. The proposed algorithm achieves computational reduction and hardware miniaturization by reducing the predefined two matrix multiplication operations of the existing algorithm to one. And by optimizing the Split multiplier computation, it is implemented more efficient hardware to mount. The hardware was designed in the Verilog HDL language, and the results of logical synthesis using the Xilinx Vivado program were compared to verify real-time processing performance in 4K environments. Furthermore, this paper verifies the performance of the proposed hardware with mounting results on two FPGAs.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.19-29
• /
• 2010

A marketing model is changed from a customer acquisition to customer retention and it is being moved to a way that enhances the quality of customer interaction to add value to our customers. Such personalization is emerging from this background. The Web site is accelerate the adoption of a personalization, and in contrast to the rapid growth of data, quantitative analytical experience is required. For the automated analysis of large amounts of data and the results must be passed in real time of personalization has been interested in technical problems. A recommendation algorithm is an algorithm for the implementation of personalization, which predict whether the customer preferences and purchasing using the database with new customers interested or likely to purchase. As recommended number of users increases, the algorithm increases recommendation time is the problem. In this paper, to solve this problem, a recommendation system based on clustering and dimensionality reduction is proposed. First, clusters customers with such an orientation, then shrink the dimensions of the relationship between customers to low dimensional space. Because finding neighbors for recommendations is performed at low dimensional space, the computation time is greatly reduced.

• Journal of Advanced Marine Engineering and Technology
• /
• v.34 no.6
• /
• pp.858-863
• /
• 2010

In order to enhance encoding speed in dynamic image encoding using H.264/AVC, reducing the time for motion estimation which takes a large portion of the processing time is very important. An approach using graphics processing unit(GPU) as a coprocessor to assist the central processing unit(CPU) in computing massive data, will be a way to reduce the processing time. In this paper, we present an efficient block-level parallel algorithm for the motion estimation(ME) on a computer unified device architecture(CUDA) platform developed in general-purpose computation on GPU. Experiments are carried out to verify the effectiveness of the proposed algorithm.