• Title/Summary/Keyword: 행렬

Search Result 4,083, Processing Time 0.036 seconds

A Mathematical Implementation of OFDM System with Orthogonal Basis Matrix (직교 기저행렬을 이용하는 직교 주파수분할다중화의 수학적 구현)

  • Kang, Seog-Geun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2731-2736
    • /
    • 2009
  • In this paper, a new implementation method of OFDM (orthogonal frequency division multiplexing) system with an orthogonal basis matrix is developed mathematically. The basis matrix is based on the Haar basis but has an appropriate form for modulation of multiple subchannel signals of OFDM. It is verified that the new basis matrix can be expanded with a simple recursive algorithm. The order of synthesis matrix in the transmitter is increased by the factor of two with every expansion. Demodulation in the receiver is carried out by its inverse matrix, which can be generated recursively with the orthogonal basis matrix. It is shown that perfect reconstruction of original signals is possibly achieved in the proposed OFDMsystem.

A Study for Spectral Properties of Preconditioner of Symmetric Toeplitz Systems (대칭 토플리츠 시스템의 선행조건에 대한 특정성질 연구)

  • Baik, Ran
    • Journal of Digital Contents Society
    • /
    • v.10 no.4
    • /
    • pp.579-585
    • /
    • 2009
  • In [9], Tyrtshnikov proposed a preconditioned approach to derive a general solution from a Toeplitz linear system. Furthermore, the process of selecting a preconditioner matrix from symmetric Toeplitz matrix, which has been used in previous studies, is introduced. This research introduces a new method for finding the preconditioner in a Toeplitz system. Also, through analyzing these preconditioners, it is derived that eigenvalues of a symmetric Toeplitz are very close to eigenvalues of a new preconditioner for T. It is shown that if the spectrum of the preconditioned system $C_0^{-1}T$ is clustered around 1, then the convergence rate of the preconditioned system is superlinear. From these results, it is determined to get the superliner at the convergence rate by our good preconditioner $C_0$. Moreover, an advantage is driven by increasing various applications i. e. image processing, signal processing, etc. in this study from the proposed preconditioners for Toeplitz matrices. Another characteristic, which this research holds, is that the preconditioner retains the properties of the Toeplitz matrix.

  • PDF

Speech Basis Matrix Using Noise Data and NMF-Based Speech Enhancement Scheme (잡음 데이터를 활용한 음성 기저 행렬과 NMF 기반 음성 향상 기법)

  • Kwon, Kisoo;Kim, Hyung Young;Kim, Nam Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.619-627
    • /
    • 2015
  • This paper presents a speech enhancement method using non-negative matrix factorization (NMF). In the training phase, each basis matrix of source signal is obtained from a proper database, and these basis matrices are utilized for the source separation. In this case, the performance of speech enhancement relies heavily on the basis matrix. The proposed method for which speech basis matrix is made a high reconstruction error for noise signal shows a better performance than the standard NMF which basis matrix is trained independently. For comparison, we propose another method, and evaluate one of previous method. In the experiment result, the performance is evaluated by perceptual evaluation speech quality and signal to distortion ratio, and the proposed method outperformed the other methods.

A VLSI Architecture for the Binary Jacket Sequence (이진 자켓 비트열의 VLSI 구조)

  • 박주용;이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.2A
    • /
    • pp.116-123
    • /
    • 2002
  • The jacket matrix is based on the Walsh-Hadamard matrix and an extension of it. While elements of the Walsh-Hadamard matrix are +1, or -1, those of the Jacket matrix are ${\pm}$1 and ${\pm}$$\omega$, which is $\omega$, which is ${\pm}$j and ${\pm}$2$\sub$n/. This matrix has weights in the center part of the matrix and its size is 1/4 of Hadamard matrix, and it has also two parts, sigh and weight. In this paper, instead of the conventional Jacket matrix where the weight is imposed by force, a simple Jacket sequence generation method is proposed. The Jacket sequence is generated by AND and Exclusive-OR operations between the binary indices bits of row and those of column. The weight is imposed on the element by when the product of each Exclusive-OR operations of significant upper two binary index bits of a row and column is 1. Each part of the Jacket matrix can be represented by jacket sequence using row and column binary index bits. Using Distributed Arithmetic (DA), we present a VLSI architecture of the Fast Jacket transform is presented. The Jacket matrix is able to be applied to cryptography, the information theory and complex spreading jacket QPSK modulation for WCDMA.

Design of a Discrete-Time $H_{\infty}$ Controller with Preview Action (예견 기능을 가진 이산시간 $H_{\infty}$ 제어기의 설계)

  • Choi, Jin-Tae;Kim, Jong-Shik
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.2
    • /
    • pp.115-123
    • /
    • 1997
  • 이산기간 H/sub .inf./ 제어에 의한 최적 예견제어기를 제안한다. 기존의 H/sub .inf./ 제어기는 미지의 외란만 고려한 것이고, LQ 에 의한 예견제어기는 예견 가능한 외란과 미지의 외란이 동시에 가해지는 동적 시스템의 전달함수 행렬의 infinity 놈의 최소화하는 피드백제어기가 동시에 설계된다. 제어기의 설계는 full-information H/sub .inf./ 제어 이론을 따르나, 그 유도 과정은 LQ 에 기초한 예견제어기와 유사하게 이루어진다. 설계된 H/sub .inf./ 예견 게인 행렬은 LQ 예견 게인 행렬과 유사한 구조를 갖는다. 전달함수 행렬의 infinity 놈이 .inf.로 갈수록 H/sub .inf./ 예견 게인 행렬은 LQ에 의한 것에 접근한다. LQ 예견 게인 행렬은 H/sub .inf./ 예견 게인 행렬의 부분 집합임이 입증한다.

  • PDF

A Study on Multiplying an n × n Boolean Matrix by All n × n Boolean Matrices Successively (하나의 n 차 정사각 불리언 행렬과 모든 n 차 정사각 불리언 행렬 사이의 연속곱셈에 관한 연구)

  • Han, Jae-Il
    • 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.

  • PDF

The New Block Circulant Hadamard Matrices (새로운 블록순환 Hadamard 행렬)

  • Park, Ju Yong;Lee, Moon Ho;Duan, Wei
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.3-10
    • /
    • 2014
  • In this paper we review the typical Toeplitz matrices and block circulant matrices, and propose the a circulant Hadamard matrix which is consisted of +1 and -1, but its structure is different from typical Hadamard matrix. The proposed circulant Hadamard matrix decreases computational complexities to $Nlog_2N$ additions through high speed algorithm compare to original one. This matrix is able to be applied to Massive MIMO channel estimation, FIR filter design, amd signal processing.

Performance Optimization of Sparse Matrix Operation (희소 행렬 연산의 성능 최적화에 관한 연구)

  • 김경훈;김병수;임은진
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.130-132
    • /
    • 2003
  • 계산 과학을 사용하는 응용 분야는 공학, 물리, 화학, 생명 과학에서 경제학까지 다양하다. 계산 과학에 사용되는 많은 알고리즘들은 행렬 연산을 포함하고 있으며 이 행렬은 크기가 크고 대부분의 원소가 0값을 갖는 희소 행렬일 경우가 많다. 본 논문에서는 희소 행렬의 연산 중, 희소 행렬 A와 밀집 벡터 x, y에 대하여 ylongleftarrowy+Ax와 ylongleftarrowy+$A^{T}$ Ax 의 두 가지 연산에 대한 계산 속도 개선 방법으로서 레지스터 재사용을 높이는 레지스터 블록화와 캐쉬 미스를 줄이기 위한 캐쉬 최적화 방법을 제안하며 또한 희소 행렬의 특성과 target 컴퓨터의 구조에 따라 정해지는 레지스터 블록 크기를 결정하는 방법을 설명한다. Preliminary결과로 이 방법을 Pentium III system상에서 실험한 결과를 보이는데 ylongleftarrowy+Ax 의 연산에 대하여는 2.5 배, ylongleftarrowy+$A^{T}$ Ax 의 연산에 대하여는 3.5 배까지의 성능 개선을 이룰 수 있다.

  • PDF

Exploration of Optimization Environment for CUDA-based Cholesky Decomposition (CUDA 기반 숄레스키 분해 성능 최적화 환경 탐색)

  • Junbeom Kang;Myungho Lee;Neungsoo Park
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.15-17
    • /
    • 2024
  • 최근 다양한 연구 분야에서는 CUDA 프레임워크를 이용하여 병렬 처리를 통해 연산 시간을 단축하는데 성공하고 있다. 이 중 숄레스키 분해는 양의 정부호 행렬을 하삼각행렬로 분해하는 과정에서 많은 행렬 곱셈이 요구되어 GPU 의 구조적 특징을 활용하면 상당한 가속화가 가능하다. 따라서 이 논문에서는 CUDA 코어에 연산을 할당할 때, 핵심 요소인 블록의 개수와 블록 당 쓰레드 개수를 조절할 수 있는 병렬 숄레스키 분해 연산 프로그램을 구현하였다. 서로 다른 세 종류의 행렬 크기에 대해 다양한 블록 수-쓰레드 수 환경을 설정하여 가속화 정도를 측정한 결과, 각 행렬 별 최적 환경에서 동일 그룹 내 최장 시간 대비, 1000x1000 행렬에서는 약 1.80 배, 2000x2000 행렬에서는 약 2.94 배의 추가적인 가속화를 달성하였다.

Korea's Street Processions and Traditional Performing Arts (한국의 가두행렬(街頭行列)과 전통연희)

  • Jeon, KyungWook
    • (The) Research of the performance art and culture
    • /
    • no.18
    • /
    • pp.513-557
    • /
    • 2009
  • The procession depicted in Goguryeo's ancient tomb mural consists of guards, honor guards, music band, and performing artists. Since this coincides with the royal processions of Goryeo and Joseon Dynasties, the relationship of its impact can be examined. The performing arts appearing in such street procession were mostly sanakbaekhui. During the Goryeo Dynasty, the king visited Bongeunsa templ when the lotus lantern festival was celebrated. At such time, on the left and right sides of the road travelled by the king were installed mountains made of lanterns and trees made of lanterns. The procession was quite large in scale and was accompanied by colorful music and performances. In the narye ceremony of the Goryeo Dynasty, as in China, street procession and performing arts took place. The jisinbarbgi performed by a peasant band in early January is a custom of narye. A new character appears in the royal narye during the first half of the Joseon period. Therefore the features of narye transforming according to the changes of the times can be examined. In the Joseon Dynasty's procession of a king returning to the palace, the royal band in front and behind the carriage of the king played marching music, and led by a sanbung this street procession headed toward the palace. Various performances also took place during this time. The samilyuga and munhuiyeon were festivals of the yangban class(nobility). Those who passed the state examination hired musicians and performers and paraded around town in Seoul for three days to celebrate the auspicious outcome for their family and to show off their family's power. In the Joseon's dongje and eupchijeui ceremonies, street processions were carried out with a shrine deity image or symbolic flag at the head. The dongje in a Korean village, combined with jisinbarbgi, incorporated a procession with the flags ymbolizing the guardian deity of the village at the head, and this went from house to house. The procession of suyeongyaru had the publicity impact of a mask play performance, and by creating a sense of unity among the participants, heightened the celebratory atmosphere. At the core of the bukcheonggun toseongri gwanweonnori was as treet procession imitating the traveling of high government officials. The toseong gwanweonnori has the folk religion function of praying for safe human living and abundance of grains for the village, the entertainment function of having fun and joy through street processions and various performances, and the social function of creating unity and harmony among the residents. In all the aforementioned events, the street procession had a large role in creating a celebratory atmosphere, and the performance of traditional performing arts in the middle of the procession or after the procession enabled the participants to feel united. The participants of the street procession felt cultural pride and self-confidence through the various events and they were able to have the opportunity to show off and proudly display their abilities.