• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.452-456
• /
• 2010

Multiplication is a fundamental arithmetic operation in many digital signal processing (DSP) and communication algorithms. The group CSD (GCSD) multiplier was recently proposed based on the variation of canonical signed digit (CSD) encoding and partial product sharing. This multiplier provides an efficient design when the multiplications are performed only with a few predetermined coefficients (e.g., FFT). In this paper, it is shown that, by exploiting the characteristics of the filter coefficients, GCSD multipliers can be used for the efficient implementation of time-multiplexed FIR filters.

• Journal of the Chungcheong Mathematical Society
• /
• v.1 no.1
• /
• pp.27-32
• /
• 1988

In this paper, we study the multipliers of $A^p_q$ into $L^{p^{\prime}}$ when 0 < p' < p. For this purpose, we study the condition on the measure ${\mu}$ satisfying $A^p_q{\subset}A^{p^{\prime}}(d{\mu})$. It turns out that the quotient $k_q={\mu}/v_q$ over hyperbolic ball of radius less than 1 belongs to $L^s_q$, where $\frac{1}{s}+\frac{p^{\prime}}{p}=1$. For the proof, we replace the norm of $k_q$ by the Riemann sum, and then use a result of interpolation theory.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.811-814
• /
• 2000

It this paper a VLSI architecture of the Shape-Adaptive Discrete Cosine Transform (SA-DCT) is described, which can be employed dedicatedly for MPEG-4 video codec. Adopting a fast DCT algorithm, the number of multipliers can be reduced by half in comparison with a conventional algorithm. This SA-DCT core with a small additional amount of hardware can perform the SA-Inverse DCT (SA-IDCT) by sharing multipliers and a transportation memory. The proposed SA-DCT core is integrated with 40,000 gates by using 0.35$mu$m triple-metal CMOS technology, which operates at 20 Mhz, and hence enables the realtime codec of CIF ($352{\times}288$ pixels) pictures.

• Journal of KIEE
• /
• v.11 no.1
• /
• pp.51-54
• /
• 2001

In this paper, a MW-Mvar investment technique focused on minimizing the system loss is presented. An optimization technique, in which the system loss is defined as the objective function and the power flow equations as the constraints, is introduced to obtain the Lagrangian multipliers λP and λQ. The Lagrangian multipliers imply the variation of the system loss with respect to incremental bus power and are used as MW-Mvar investment indices for minimizing the system loss. ΔP MW and ΔQ Mvar are invested, step by step, by the priority of λP and λQ index given for each bus. Derivation of the index uses the information from normal power flow calculation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.7
• /
• pp.1078-1082
• /
• 2017

This paper presents an L1 optimization based filtering technique which effectively eliminates the optical misalignment effects encountered in the squint guidance mode with strapdown seekers. We formulated a series of L1 optimization problems in order to separate the bias and the gradient components from the measured data, and solved them via the alternating direction method of multipliers (ADMM) and sparse matrix decomposition techniques. The proposed technique was able to rapidly detect arbitrary discontinuities and gradient changes from the measured signals, and was shown to effectively cancel the undesirable effects coming from the seeker misalignment angles. The technique was implemented on embedded flight computers and the real-time operational performance was verified via the hardware-in-the-loop simulation (HILS) tests in parallel with the automatic target recognition algorithms and the intra-red synthetic target images.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.5
• /
• pp.233-240
• /
• 2021

We propose a novel, highly accurate approximate multiplier using different types of inexact 4-2 compressors. The importance of low hardware costs leads us to develop approximate multiplication for error-resilient applications. Several rules are developed when selecting a topology for designing the proposed multiplier. Our highly accurate multiplier design considers the different error characteristics of adopted compressors, which achieves a good error distribution, including a low relative error of 0.02% in the 8-bit multiplication. Our analysis shows that the proposed multiplier significantly reduces power consumption and area by 45% and 26%, compared with the exact multiplier. Notably, a trade-off relationship between error characteristics and hardware costs can be achieved when considering those of existing highly accurate approximate multipliers. In the image blending, edge detection and image sharpening applications, the proposed 8-bit approximate multiplier shows better performance in terms of image quality metrics compared with other highly accurate approximate multipliers.

• Communications for Statistical Applications and Methods
• /
• v.29 no.4
• /
• pp.441-451
• /
• 2022

In the era of bigdata, scalability is a crucial issue in learning models. Among many others, the Alternating Direction of Multipliers (ADMM, Boyd et al., 2011) algorithm has gained great popularity in solving large-scale problems efficiently. In this article, we propose applying the ADMM algorithm to solve the least square problem penalized by the pairwise-difference penalty, frequently used to identify group structures among coefficients. ADMM algorithm enables us to solve the high-dimensional problem efficiently in a unified fashion and thus allows us to employ several different types of penalty functions such as LASSO, Elastic Net, SCAD, and MCP for the penalized problem. Additionally, the ADMM algorithm naturally extends the algorithm to distributed computation and real-time updates, both desirable when dealing with large amounts of data.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.613-622
• /
• 2023

In this paper, finite element method is applied to solve boundary control problem governed by elliptic variational inequality with an infinite number of variables. First, we introduce some important features of the finite element method, boundary control problem governed by elliptic variational inequalities with an infinite number of variables in the case of the control and observation are on the boundary is introduced. We prove the existence of the solution by using the augmented Lagrangian multipliers method. A triangular type finite element method is used.

• Journal of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.395-408
• /
• 2024

There have been numerous studies on the characteristics of the solutions of ordinary differential equations for optimization methods, including gradient descent methods and alternating direction methods of multipliers. To investigate computer simulation of ODE solutions, we need to trace pseudo-orbits by real orbits and it is called shadowing property in dynamics. In this paper, we demonstrate that the flow induced by the alternating direction methods of multipliers (ADMM) for a C² strongly convex objective function has the eventual shadowing property. For the converse, we partially answer that convexity with the eventual shadowing property guarantees a unique minimizer. In contrast, we show that the flow generated by a second-order ODE, which is related to the accelerated version of ADMM, does not have the eventual shadowing property.

• Communications of the Korean Mathematical Society
• /
• v.16 no.2
• /
• pp.205-210
• /
• 2001

In this paper we will determine Schur multipliers of some finite p-groups of order p$^4$.