• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.175-186
• /
• 2023

In this article we look at the property of a 2 by 2 full matrix ring over the ring of integers, of being weakly right IQNN. This generalisation of the property of being right IQNN arises from products of idempotents and nilpotents. We shown that it is, indeed, a proper generalization of right IQNN. We consider the property of beign weakly right IQNN in relation to several kinds of factorizations of a free algebra in two indeterminates over the ring of integers modulo 2.

• Communications of Mathematical Education
• /
• v.31 no.3
• /
• pp.241-255
• /
• 2017

The 4th industrial revolution is coming. In order to prepare for the new learning environment with it, we may need digital mathematics textbooks that fully utilize all possible technologies. So various attempts have been made in elementary and middle school mathematics education. However, despite the importance of higher mathematics, we haven't seen a best possible math digital textbooks yet in Korea. In this paper, we introduce our new model of interactive math digital textbook about Linear Algebra/ Calculus/ Differential Equations/ Statistics/ Engineering Math. Especially, this manuscript focuses on our experience of using digital contents and interactive labs for developing a new model for linear algebra digital textbook. We introduce our works on linear algebra digital textbooks which include pdf e-book, web contents, video clips of lectures, interactive lab. Using this linear algebra digital textbook, students can freely use any mobile devices to access diverse learning materials, lessons, and hands-on exercises without any limitations. Also, times saved in the computation, coding, and typing process can be used to have more discussions for deeper understanding of mathematical concepts. This type of linear algebra digital textbook, which contains all interactive free cyber-lab with codes and all lectures for each sections, can be considered as a new model for the next generation of math digital textbook.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.1
• /
• pp.7-13
• /
• 2011

Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.4
• /
• pp.437-446
• /
• 2018

This paper describes the real-time logic implementation of orthogonal matching pursuit(OMP) algorithm for compressive sensing digital receiver. OMP contains various complex-valued linear algebra operations, such as matrix multiplication and matrix inversion, in an iterative manner. Xilinx Vivado high-level synthesis(HLS) is introduced to design the digital logic more efficiently. The real-time signal processing is realized by applying dataflow architecture allowing functions and loops to execute concurrently. Compared with the prior works, the proposed design requires 2.5 times more DSP resources, but 10 times less signal reconstruction time of $1.024{\mu}s$ with a vector of length 48 with 2 non-zero elements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.751-755
• /
• 2008

Formanek([2]) proved that $M_n(K)$, the matrix algebra has a nontrivial central polynomial when char K = 0. Also Razmyslov([3]) showed the same result using the essential weak identity. In this article we explicitly compute Formanek's central polynomial for $M_2(\mathbb{C})$ and $M_3(\mathbb{C})$ and classify the coefficients of the central polynomial.

• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.109-113
• /
• 1995

For a Hilbert space H, let L(H) denote the algebra of all bounded operators on H. For an $n \in N$, it is well known that any element $T \in L(\oplus^n H)$ is expressed as an $n \times n$ matrix each of whose entries lies in L(H) so that T is written as $$ (1) T = (T_{ij}), i, j = 1, 2, ..., n, T_{ij} \in L(H), $$ where $\oplus^n H$ is the direct sum Hilbert space of n copies of H.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1441-1456
• /
• 2017

We consider a 3-dimensional Riemannian manifold M with a circulant metric g and a circulant structure q satisfying $q^3=id$. The structure q is compatible with g such that an isometry is induced in any tangent space of M. We introduce three classes of such manifolds. Two of them are determined by special properties of the curvature tensor. The third class is composed by manifolds whose structure q is parallel with respect to the Levi-Civita connection of g. We obtain some curvature properties of these manifolds (M, g, q) and give some explicit examples of such manifolds.

• The Pure and Applied Mathematics
• /
• v.25 no.2
• /
• pp.171-180
• /
• 2018

In this paper, the necessary and sufficient conditions are considered for biprojectivity of Banach algebras $E_p(I)$. As an application, we investigate biprojectivity of convolution Banach algebras A(G) and $L^2(G)$ on a compact group G.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.827-832
• /
• 2007

Several partial orders on integral partitions have been studied with many applications such as majorizations, capacities of quantum memory and embeddabilities of matrix algebras. In particular, the embeddability, stable embeddability and strong-stable embeddability problems arise for finite dimensional irreducible modules over a complex simple Lie algebra L. We find a sufficient condition for an L-module strong-stably embeds into another L-module using formal character theory.