• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.25-28
• /
• 2001

A theory of binary wavelets has been recently proposed by using two-band perfect reconstruction filter banks over binary field . Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations since its operation is accomplished by matrix multiplication. In this paper, a fast BWT algorithm which utilizes filtering operation instead or matrix multiplication is presented . It is shown that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the decomposition and reconstruction or an N ${\times}$ N image, the proposed algorithm requires only 2LN$^2$ multiplications and 2(L-1)N$^2$addtions when the filter length is L, while the BWT needs 2N$^3$multiplications and 2N(N-1)$^2$additions.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.459-461
• /
• 2006

The successive multiplication of all $n{\times}n$ boolean matrices is necessary for applications such as D-class computation. But, no research has been performed on it despite many researches dealing with boolean matrices. The paper suggests a theory with which successively multiplying a $n{\times}n$ boolean matrix by all $n{\times}n$ boolean matrices can be done efficiently, applies it to the successive multiplication of all $n{\times}n$ boolean matrices and shows its execution results.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.125-132
• /
• 2001

IBM developed the MPI-IO, we call it MPI-2, on the General Parallel File System. We designed and implemented various Matrix Multiplication Benchmarks to evaluate its performances. The MPI-IO on the General Parallel File System shows four kinds of data access methods : the non-collective and blocking, the collective and blocking, the non-collective and non-blocking, and the split collective operation. In this paper, we propose benchmarks to measure the IO time and the computation time for the data access methods. We describe not only its implementation but also the performance evaluation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.619-622
• /
• 2002

In this paper, we propose a new blocking method, multiple blocking, and examine the efficiency of the method in basic matrix operations. In the best case for the matrix multiplication C=AB＋C, the multiple blocking improves the performance by more than 10%, compared to the conventional single blocking method.

• Journal of the Korean Mathematical Society
• /
• v.48 no.6
• /
• pp.1125-1142
• /
• 2011

In this paper, we define some new sequence spaces of infinite matrices regarded as operators on $l_2$ by using algebraic properties of such the matrices under the Schur product multiplication. Some of their basic properties as well as duality and preduality are discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.71-75
• /
• 1985

Transmission characteristics of a linear double rectangular taper is analysed by the trans-mission matrix of the taper. The total transmission matrix of the taper is obtained by multiplication of transmission matrices of smrjll taper sections which is decided into uniform length along the taper axis. The VSWR calculated from the transmission matrix is compared with those of Johnson and Matsumaru.

• Journal of the Korean School Mathematics Society
• /
• v.6 no.2
• /
• pp.87-99
• /
• 2003

As the development of computer science discrete mathematics has been developed accordingly. Discrete mathematics is one of the vital element for the development of the computer and IT technologies since it is the theoretical basis for these field of technologies. Currently, according the Seventh Curriculum Standards in Mathematics, high school students may participate in the class of discrete mathematics as one of their optional curriculum. However, discrete mathematics is a new to the most students in high school. Therefore, the teaching methods for the class of discrete mathematics must be carefully designed so that students acknowledge the importance of this new subject. For this purpose, we first show that why the algorithm is needed and then analyze the problem involved in the method of the traditional matrix multiplications. Finally, we suggest two matrix multiplication algorithms which are more efficient than the traditional method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.778-785
• /
• 2006

In this paper, two possible ways for mode shape expansion are proposed and opened for discussion for future use. The first method minimizes the modal flexibility error between the experimental and analytical mode shapes corresponding to the measured DOFs to find the multiplication matrix which can be treated as the least-squares minimization problem. In the second method, Normalized Modal Difference (NMD) is used to calculate multiplication matrix using the analytical DOFs corresponding to measured DOfs. This matrix is then used to expand the measured mode shape to unmeasured DOFs. A simulated simply supported beam is used to demonstrate the performance of the methods. These methods are then compared with two most promising existing methods namely Kidder dynamic expansion and Modal expansion methods. It is observed that the performance of the modal flexibility method is comparable with existing methods. NMD also have the potential to expand the mode shapes though it is seen more sensitive to the distribution of error between FEM and actual test data.

• 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.