• Journal of Information Technology Services
• /
• v.5 no.1
• /
• pp.191-198
• /
• 2006

Boolean matrices have been successfully used in various areas, and many researches have been performed on them. However, almost all the researches focus on the efficient multiplication of two boolean matrices and no research has been shown to deal with the multiplication of all boolean matrices and their consecutive multiplications. The paper suggests a mathematical theory that enables the efficient consecutive multiplications of all $l{\times}n,\;n{\times}m,\;and\;m{\times}k$ boolean matrices, and discusses its computational complexity and the execution results of the consecutive multiplication algorithm based on the theory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.123-129
• /
• 2006

In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.95-101
• /
• 1990

Parallel optical arithmetic techniques have been developed using the correlation property of optical phase conjugate wave generated by degenerated four wave-mixing. In this paper, conventional rectangular-type coded pattern used for optical logic system is replaced by circular one for effective beam coupling in a photorefractive $BaTiO_3$ material. By adequately adjusting the distance between circular-type pixels of the input pattern and grouping the correlated output, optical binary half addition/subtraction, binary multiplication and, matrix-matrix computation are demonstrated.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.994-997
• /
• 2003

행렬 연산은 계산 과학을 사용하는 공학 물리, 화학, 생명 과학, 경제학 등에서 다양하게 사용되고 있으며 이 행렬은 크기가 크고 대부분의 원소가 0 값을 갖는 희소 행렬일 경우가 많다. 본 논문에서는 희소 행렬의 연산 중, 회로 설계 시 최적화 과정에 사용되는 연산에서 문제가 되는 희소 행렬 A 와 블록 대각 행렬 H에 대하여 AH$A^{T}$ 의 연산을 효율적으로 행하는 방법들을 검토하고 메모리 접근 횟수를 모델링하여 수행 속도와 메모리 사용량 면에서 비교한다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.68-78
• /
• 2005

A new emotion-based image retrieval method is proposed in this paper. The research was motivated by Soen's evaluation of human emotion on color patterns. Thirteen pairs of adjective words expressing emotion pairs such as like-dislike, beautiful-ugly, natural-unnatural, dynamic-static, warm-cold, gay-sober, cheerful-dismal, unstablestable, light-dark, strong-weak, gaudy-plain, hard-soft, heavy-light are modeled by 19-dimensional color array and $4{\times}3$ gray matrix in off-line. Once the query is presented in text format, emotion model-based query formulation produces the associated color array and gray matrix. Then, images related to the query are retrieved from the database based on the multiplication of color array and gray matrix, each of which is extracted from query and database image. Experiments over 450 images showed an average retrieval rate of 0.61 for the use of color array alone and an average retrieval rate of 0.47 for the use of gray matrix alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.9 no.3
• /
• pp.127-131
• /
• 1984

The IOVMM(Incoherent Optical Vector Matrix Multiplier) is constructed, which can process much information very fast by incogerent light source, and its experimental results are compared with the theoretical values. The input vector and matirx elements are limited to the positive number in this paper. The input vector is made by the LED array and the matrix is encoded on the film by the area modulation method. The result of the vector-matrix multiplication is detected by the photodiode array through the lens system. The analog multiplexer is used for looking at output signal on one channel.

• Electronics and Telecommunications Trends
• /
• v.13 no.4 s.52
• /
• pp.59-69
• /
• 1998

The terminology of data prefetching is introduced, which includes stride, repeat distance, stall, pending stall, prefetch degree, prefetch distance, and prefetch offset. The effectiveness of hardware data prefetching in reducing cache misses is shown by presenting a square matrix multiplication example. Thereafter the pitfalls of prefetching and possible solutions are discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.35-42
• /
• 2006

In this paper we implement a new simulator for performance analysis of a parallel digital signal processing distributed shared memory multiprocessor systems. using Parsec The key idea of this simulator is suitable in simulation of system that uses DMA function of TMS320C6701 DSP chip and local memory which have fast access time. Also, because correction of performance parameter and reconfiguration for hardware components are easy, we can analyze performance of system in various execution environments. In the simulation, FET, 2D FET, Matrix Multiplication. and Fir Filter, which are widely used DSP algorithms. have been employed. Using our simulator, the result has been recorded according to different the number of processor, data sizes, and a change of hardware element. The performance of our simulator has been verified by comparing those recorded results.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.11-16
• /
• 2010

We present an efficient algorithm for rendering sweep surfaces using programmable graphics hardware. A sweep surface can be represented by a cross-section curve undergoing a spline motion. This representation has a simple matrix-vector multiplication structure that can easily be adapted to programmable graphics hardware. The data for the motion and cross-section curves are stored in texture memory. The vertex processor considers a pair of surface parameters as a vertex and evaluates its coordinates and normal vector with a single matrix multiplication. Using the GPU in this way is between 10 and 40 times as fast as CPU-based rendering.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.10a
• /
• pp.19-24
• /
• 1997

In this study, we extend the application of the interface-matrix(IM) method for reflector modeling to Analytic Flux Expansion Nodal (AFEN) method. This include the modifications of the surface-averaged net current continuity and the net leakage balance conditions for IM method in accordance with AFEN fomular. AFEN-interface matrix (AFEN-IM) method has been tested against ZION-1 benchmark problem. The numerical result AFEN-IM method shows 1.24% of maximum error and 0.42% of root-mean square error in assembly power distribution, and 0.006%Δk of neutron multiplication factor. This result proves that the interface-matrix method for reflector modeling can be useful in AFEN method.