• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.1316-1318
• /
• 2009

Nonideality of LED lens and diffuser as well as crosstalk between backlights should be compensated because they have large effects on image qualities. The computation complexities of conventional compensations are greatly increased as resolution becomes higher. The block based compensation is proposed to alleviate the computation complexity considering backlight profiles and image pixel characteristics.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.28-36
• /
• 2002

Regarding efficient development of computer graphic animations, lots of techniques for editing or transforming existing motion data have been developed. Basically, the motion transformation techniques follow optimization process. To make the animation be natural, almost all the techniques utilize kinematics and dynamics in constructing constraints for the optimization. Since the kinematic and dynamic structures of virtual characters to be animated are very complex, the most time-consuming part is known to the optimization process. In order to suggest some guide lines to engineers involved in the motion transformation, in this paper, we analyze the computational complexities for typical motion transformation in quantitative manner as well as the possibility for parallel computation.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.05a
• /
• pp.94-97
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• Transactions of Materials Processing
• /
• v.10 no.5
• /
• pp.389-395
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes with large aspect ratio, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem. as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.113-120
• /
• 2014

In this paper, I present a new echo canceller using the adaptive cascade system identification (CSI) method, which a system response is divided into several responses so that each response is adaptively estimated and combined. Echo cancellation is required for a dual-duplex DSL, in order to allow each individual loop to operate in a full duplex fashion. Echo cancellation was one of the most difficult aspects of DSL design, requiring high linearity and total echo return loss in excess of 70 dB. Especially, for a fickle response, if the response is estimated by an adaptive filter, the filter needs more taps and the performance is decreased. But the response is divided into several responses, the computation complexities are decreased and the performance is increased. For the stage constant n, which represents the number of stages, if the response is not divided (n=1), the computation complexity of multiply is $2N^2$. And if the response is divided into two responses (n=2), the computation complexity of multiply is $2N^2$. Also, if n=3, the computation complexity is ${\frac{2}{3}}N^2$. Therefore, it is known that the computation complexity is decreased as n is increased. Finally, this proposed method is verified through simulation of echo canceller for digital subscriber line (DSL) application.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.23-38
• /
• 1995

In manfacturing systems, to overcome the inherent complexities and uncertainties, due-dates are usually decided by some simple rules. This study proposes a computational procedure for estimating production lead time for computerized manufacturing systems. Based on the current system status stored in the computers, the procedure estimates production lead time for an incoming order. The result is more accurate than the ones produced by old rules, and yet the procedure is fast in computation speed enough to use in real time. Simulations are used to prove these.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2000.10a
• /
• pp.158-161
• /
• 2000

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2000.04a
• /
• pp.21-25
• /
• 2000

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of expense and computation time For multi-stage sheet metal forming processes numerical analysis is expense difficult to carry out the to its complexities and convergence problem. It also requires lots of computation time. For the analysis of elliptic cup with large aspect ratio intermediate sliding constraint surfaces are difficult to describe. in this paper multi-stage finite element inverse analysis is applied to multi-stage elliptic cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. To describe intermediate sliding constraint surfaces an analytic scheme is introduced to deal with merged-arc type sliding surfaces.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1703-1708
• /
• 2005

This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.