• 제목/요약/키워드: Linear Matrix Algebra

검색결과 50건 처리시간 0.027초

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

  • Liu, Qian;Zhang, Hao;Yu, Peidong;Wang, Gang;Qiu, Zhaoyang
    • 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.

대화형 수학 디지털교과서 개발과 활용 사례 연구 - 선형대수학을 중심으로- (Development and Usage of Interactive Digital Linear Algebra Textbook)

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

STRONG COMMUTATIVITY PRESERVING MAPS OF UPPER TRIANGULAR MATRIX LIE ALGEBRAS OVER A COMMUTATIVE RING

  • Chen, Zhengxin;Zhao, Yu'e
    • 대한수학회보
    • /
    • 제58권4호
    • /
    • pp.973-981
    • /
    • 2021
  • Let R be a commutative ring with identity 1, n ≥ 3, and let 𝒯n(R) be the linear Lie algebra of all upper triangular n × n matrices over R. A linear map 𝜑 on 𝒯n(R) is called to be strong commutativity preserving if [𝜑(x), 𝜑(y)] = [x, y] for any x, y ∈ 𝒯n(R). We show that an invertible linear map 𝜑 preserves strong commutativity on 𝒯n(R) if and only if it is a composition of an idempotent scalar multiplication, an extremal inner automorphism and a linear map induced by a linear function on 𝒯n(R).

$m{\times}n$ 크기의 일반적인 흑백 게임의 최적해와 타일링 (Analysis of optimal solutions and its tiling in $m{\times}n$ size Black-Out Game)

  • 김덕선;이상구
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제21권4호
    • /
    • pp.597-612
    • /
    • 2007
  • For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

  • PDF

A Novel Algebraic Framework for Analyzing Finite Population DS/SS Slotted ALOHA Wireless Network Systems with Delay Capture

  • Kyeong, Mun-Geon
    • ETRI Journal
    • /
    • 제18권3호
    • /
    • pp.127-145
    • /
    • 1996
  • A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

  • PDF

Column ranks and their preservers of general boolean matrices

  • Song, Seok-Zun;Lee, Sang-Gu
    • 대한수학회지
    • /
    • 제32권3호
    • /
    • pp.531-540
    • /
    • 1995
  • There is much literature on the study of matrices over a finite Boolean algebra. But many results in Boolean matrix theory are stated only for binary Boolean matrices. This is due in part to a semiring isomorphism between the matrices over the Boolean algebra of subsets of a k element set and the k tuples of binary Boolean matrices. This isomorphism allows many questions concerning matrices over an arbitrary finite Boolean algebra to be answered using the binary Boolean case. However there are interesting results about the general (i.e. nonbinary) Boolean matrices that have not been mentioned and they differ somwhat from the binary case.

  • PDF

A Hybrid Approach on Matrix Multiplication

  • Tolentino Maribel;Kim Myung-Kyu;Chae Soo-Hoan
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
    • /
    • pp.400-402
    • /
    • 2006
  • Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

  • PDF

ONE NEW TYPE OF INTERLEAVED ITERATIVE ALGORITHM FOR H-MATRICES

  • Tuo, Qing;Liu, Jianzhou
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.37-48
    • /
    • 2009
  • In the theory and the applications of Numerical Linear Algebra, the class of H-matrices is very important. In recent years, many appeared works have proposed iterative criterion for H-matrices. In this paper, we provide a new type of interleaved iterative algorithm, which is always convergent in finite steps for H-matrices and needs fewer iterations than those proposed in the related works, and a corresponding algorithm for general matrix, which eliminates the redundant computations when the given matrix is not an H-matrix. Finally, several numerical examples are presented to show the effectiveness of the proposed algorithms.

  • PDF

Linear operators that preserve spanning column ranks of nonnegative matrices

  • Hwang, Suk-Geun;Kim, Si-Ju;Song, Seok-Zun
    • 대한수학회지
    • /
    • 제31권4호
    • /
    • pp.645-657
    • /
    • 1994
  • If S is a semiring of nonnegative reals, which linear operators T on the space of $m \times n$ matrices over S preserve the column rank of each matrix\ulcorner Evidently if P and Q are invertible matrices whose inverses have entries in S, then $T : X \longrightarrow PXQ$ is a column rank preserving, linear operator. Beasley and Song obtained some characterizations of column rank preserving linear operators on the space of $m \times n$ matrices over $Z_+$, the semiring of nonnegative integers in [1] and over the binary Boolean algebra in [7] and [8]. In [4], Beasley, Gregory and Pullman obtained characterizations of semiring rank-1 matrices and semiring rank preserving operators over certain semirings of the nonnegative reals. We considers over certain semirings of the nonnegative reals. We consider some results in [4] in view of a certain column rank instead of semiring rank.

  • PDF

전동차용 견인전동기의 열유동 특성에 관한 전산해석 (Numerical Analysis on Heat Transfer and Fluid Flow Characteristics of Traction Motor for Electric Car)

  • 남성원;김영남;채준희
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 1998년도 추계학술대회 논문집
    • /
    • pp.137-143
    • /
    • 1998
  • Numerical simulation is conducted to clarify the heat transfer and fluid flow characteristics of traction motor for electric car SIMPLE algorithm based on finite volume method is used to make linear algebra equation. The governing equations are solved by TDMA(TriDiagonal Matrix Algorithm) with line-by-line method and block correction. From the results of simulation, the characteristics of cooling pattern is strongly affected by the size of hole in stator core. In the case of high rotational speed of rotor, temperature difference along the axial direction is more decreased than that of low rotational speed.

  • PDF