• Kyungpook Mathematical Journal
• /
• 제63권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.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제31권3호
• /
• pp.241-255
• /
• 2017

스마트 교육 환경과 4차 산업 혁명 시대를 맞이하여 편리한 기능을 갖는 다양한 테크놀로지들을 활용하는 새로운 차원의 디지털 수학 교과서가 필요하게 되었다. 한국의 경우 초 중등 수학 교육에서는 여러 다양한 시도가 있었으나 대학 수학교육의 경우 디지털 수학 교과서 관련 연구는 미비하였다. 본 논문에서는 선형대수학을 중심으로 디지털 콘텐츠와 대화형 실습실을 활용하는 디지털 교과서를 소개한다. 본 교과서는 본 연구진이 직접 개발하여 누구나 http://matrix.skku.ac.kr/LA-K에서 다운로드 받을 수 있도록 제공하였으며, 기존의 종이 교과서(서책형)를 단순히 pdf 형태의 파일로 변환하여 애니메이션이나 참고자료 등을 추가한 수준에서 벗어나 전자책, 웹 콘텐츠, 강의 동영상, 대화형 실습실을 포함한다. 본 선형대수학 디지털 교과서는 학생들이 어떠한 모바일 기기에서든 시간과 장소의 제약 없이 자유롭게 사용할 수 있으며, 계산, 코딩 및 타이핑 과정에서 절약된 시간을 수학 개념을 더 깊이 이해하는데 사용할 수 있다. 코드를 포함한 대화형 실습실 및 동영상 강의를 탑재한 최초의 수학 디지털 교과서로 평가되는 본 연구의 결과물은 차세대 디지털 교과서의 주요 모델 중 하나가 될 것으로 판단된다.

• 정보통신설비학회논문지
• /
• 제10권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.

• 한국군사과학기술학회지
• /
• 제21권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)
• /
• 제15권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
• /
• 제26권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.

• 대한수학회논문집
• /
• 제10권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.

• 대한수학회지
• /
• 제54권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제25권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
• /
• 제18권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.