• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.27-33
• /
• 2006

Boolean matrices are applied to a variety of areas and used successfully in many applications, and there are many researches on boolean matrices. Most researches deal with the multiplication of boolean matrices, but all of them focus on the multiplication of two boolean matrices and very few researches deal with the multiplication between many n$\times$m boolean matrices and all m$\times$k boolean matrices. The paper discusses the existing optimal algorithms for the multiplication of two boolean matrices are not suitable for the multiplication between a n$\times$m boolean matrix and all m$\times$k boolean matrices, establishes a theory that enables the efficient multiplication of a n$\times$m boolean matrix and all m$\times$k boolean matrices, and shows the execution results of a multiplication algorithm designed with this theory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.799-808
• /
• 2012

Bit operation of scrambler in the WAVE System become less efficient because parallel processing is impossible in terms of hardware and software. In this paper, we propose algorism to find the starting position of the matrix table. Also, when bit operation algorithm of scrambler and algorithms for matrix table, algorithm used to find starting position of the matrix table were compared with the performance as 8 bit, 16bit, 32 bit processing units. As a result, the number of processing times per second could be done 2917.8 times more in an 8-bit, 5432.1 times in a 16-bit, 10277.8 times in a 32 bit. Therefore, algorithm to find the starting position of the matrix table improves the speed of the scrambler in the WAVE and the receiving speed of a variety of information gathering and precision over the Vehicle to Infra or Vehicle to Vehicle in the Intelligent Transport Systems.

• Korean Journal of Mathematics
• /
• v.20 no.2
• /
• pp.161-176
• /
• 2012

The authors [6] introduced the concept of a complete matrix of grade $g$ > 3 to describe a structure theorem for complete intersections of grade $g$ > 3. We show that a complete matrix can be used to construct the Eagon-Northcott complex [7]. Moreover, we prove that it is the minimal free resolution $\mathbb{F}$ of a class of determinantal ideals of $n{\times}(n+2)$ matrices $X=(x_{ij})$ such that entries of each row of $X=(x_{ij})$ form a regular sequence and the second differential map of $\mathbb{F}$ is a matrix $f$ defined by the complete matrices of grade $n+2$.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1760-1766
• /
• 2010

The linearized suffix tree (LST) is an array data structure supporting traversals on suffix trees. We apply this LST to two dimensional (2D) suffix trees and obtain a space-efficient substitution of 2D suffix trees. Given an $n{\times}n$ text matrix and an $m{\times}m$ pattern matrix over an alphabet ${\Sigma}$, our 2D-LST provides pattern matching in $O(m^2log{\mid}{\Sigma}{\mid})$ time and $O(n^2)$ space.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.137-144
• /
• 2013

A delay-locked loop (DLL) that generates a 32-phase clock with the operating frequency of 125 MHz is introduced. The proposed DLL uses a delay line of $4{\times}8$ matrix architecture to improve a differential non-linearity (DNL) of the delay line. Furthermore, a integral non-linearity (INL) of the proposed DLL is improved by calibrating phases of clocks that is supplied to four points of an input stage of the $4{\times}8$ matrix delay line. The proposed DLL is fabricated by using $0.11-{\mu}m$ CMOS process with a 1.2 V supply. The measured operating frequency range of the implemented DLL is 40 MHz to 280 MHz. At the operating frequency of 125MHz, the measurement results shows that the DNL and INL are +0.14/-0.496 LSB and +0.46/-0.404 LSB, respectively. The measured peak-to-peak jitter of the output clock is 30 ps when the peak-to-peak jitter of the input clock is 12.9 ps. The area and power consumption of the implemented DLL are $480{\times}550{\mu}m^2$ and 9.6 mW, respectively.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.361-364
• /
• 2001

Over an additive abelian group G of order g and for a given positive integer $\lambda$, a generalized Hadamard matrix GH(g, $\lambda$) is defined as a gλ$\times$gλ matrix[h(i, j)], where 1 $\leq i \leqg\lambda and 1 \leqj \leqg\lambda$, such that every element of G appears exactly $\lambd$atimes in the list h($i_1, 1) -h(i_2, 1), h(i_1, 2)-h(i_2, 2), …, h(i_1, g\lambda) -h(i_2, g\lambda), for any i_1\neqi_2$. In this paper, we propose a new method of expanding a GH(g^m, \lambda_1) = B = [B_{ij}] over G^m$ by replacing each of its m-tuple B_{ij} with B_{ij} + GH(g, $\lambda_2) where m = g\lambda_2. We may use g^m/\lambda_1 (not necessarily all distinct) GH(g, \lambda_2$)s for the substitution and the resulting matrix is defined over the group of order g.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10A
• /
• pp.943-951
• /
• 2006

Multi-input-multi-output (MIMO) systems are considered to improve the capacity and reliability of next generation mobile communication. However, the multiple RF chains associated with multiple antennas are costly in terms of size, power and hardware. Antenna selection is a low-cost low-complexity alternative to capture many of the advantages of MIMO systems. We proposed new joint Tx/Rx antenna selection algorithm with low complexity. The proposed algorithm is a method selects $L_R{\times}L_T$ channel matrix out of $L_R{\times}L_T$ entire channel gain matrix where $L_R{\times}L_T$ matrix selects alternate Tx antenna with Rx antenna which have the largest channel gain to maximize Frobenius norm. The feature of this algorithm is very low complexity compare with Exhaustive search which have optimum capacity. In case of $4{\times}4$ antennas selection out of $8{\times}8$ antennas, the capacity decreases $0.5{\sim}2dB$ but the complexity also decreases about 1/10,000 than optimum exhaustive search.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.301-315
• /
• 2005

Let $\{A_u,\;u=0,\;1,\;2,\;{\cdots}\}$ be a sequence of coefficient matrices such that ${\sum}_{u=0}^{\infty}{\parallel}A_u{\parallel}<{\infty}$ and ${\sum}_{u=0}^{\infty}\;A_u{\neq}O_{m{\times}m}$, where for any $m{\times}m(m{\geq}1)$, matrix $A=(a_{ij})$, ${\parallel}A{\parallel}={\sum}_{i=1}^m{\sum}_{j=1}^m{\mid}a_{ij}{\mid}$ and $O_{m{\times}m}$ denotes the $m{\times}m$ zero matrix. In this paper, a functional central limit theorem is derived for a stationary m-dimensional linear process ${\mathbb{X}}_t$ of the form ${\mathbb{X}_t}={\sum}_{u=0}^{\infty}A_u{\mathbb{Z}_{t-u}}$, where $\{\mathbb{Z}_t,\;t=0,\;{\pm}1,\;{\pm}2,\;{\cdots}\}$ is a stationary sequence of linearly positive quadrant dependent m-dimensional random vectors with $E({\mathbb{Z}_t})={{\mathbb{O}}$ and $E{\parallel}{\mathbb{Z}_t}{\parallel}^2<{\infty}$.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.105-121
• /
• 2009

In this paper we will be interested in characterizing and computing matrices $X\;{\in}\;C^{n{\times}n}$ that satisfy $e^X$ = A, that is logarithms of A. The study in this work goes through two lines. The first is concerned with a theoretical study of the solution set, S(A), of $e^X$ = A. Along the second line computational approaches are considered to compute the principal logarithm of A, LogA.

• Journal of the Korea Institute of Building Construction
• /
• v.23 no.6
• /
• pp.773-784
• /
• 2023

Since 2007, the government has been actively working to enhance the quality of public buildings, as evidenced by initiatives like the "National Basic Architecture Plan" and, since 2014, the "Building Service Industry Promotion Act." Despite these efforts, educational facilities continue to experience more frequent defects compared to large-scale apartment constructions. This study aims to analyze the primary causes of crack formation in educational facilities, employing the 2×2 MATRIX and IPA techniques to develop efficient crack prediction models. The research includes a review of relevant literature and an analysis of data from the Office of Education spanning 2019 to 2021 to pinpoint significant defects. Subsequently, 15 factors related to crack defects were identified through surveys and expert consultations. The 2×2 Matrix analysis of these factors highlighted the challenges in work processes and the effectiveness of preventative measures for crack formation, focusing on key areas for improvement. The findings from this study are anticipated to significantly contribute to the prevention and management of structural cracks in educational facilities, ensuring their long-term integrity.