• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.5
• /
• pp.51-60
• /
• 1998

There have been several recent studies concerning the stability of fuzzy control system and the synthesis of stabilizing fuzzy controllers. This paper reports on a related study nf the TS (Takagi-Sugeno) fuzzy systems, and it is shown that the controller synthesis problems for the nonlinear systems described by the TS fuzzy model can be reduced to convex problems involving LMIs (linear matrix ineclualities). After classifying the TS fuzzy systems into three families based on how diverse their input matrices are, different controller synthesis procedure is given for each of these families. A numerical example is presented to illustrate the synthesis procedures developed in this paper.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.5
• /
• pp.522-533
• /
• 2019

The compressive sensing model for range-Doppler estimation can be expressed as an under-determined linear system y = Ax. To find the solution of the linear system with the compressive sensing method, matrix A should be sufficiently incoherent and x to be sparse. In this paper, we propose a transmission waveform design method that maintains the bandwidth required by the sonar system while lowering the mutual coherence of the matrix A so that the matrix A is incoherent. The proposed method combines two methods of optimizing the sensing matrix with the alternating projection and suppressing unwanted frequency bands using the DFT (Discrete Fourier Transform) matrix. We compare range-Doppler estimation performance of existing waveform LFM(Linear Frequency Modulated) and designed waveform using the matched filter and the compressive sensing method. Simulation shows that the designed transmission waveform has better detection performance than the existing waveform LFM.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.8 s.338
• /
• pp.1-10
• /
• 2005

In this paper, the explicit low density codes construction from the generalized permutation matrices related to algebra theory is investigated, and we design several Jacket inverse block matrices on the recursive formula and permutation matrices. The results show that the proposed scheme is a simple and fast way to obtain the low density codes, and we also Proved that the structured low density parity check (LDPC) codes, such as the $\pi-rotation$ LDPC codes are the low density Jacket inverse block matrices too.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.123-129
• /
• 2006

In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.508-513
• /
• 2010

본 논문에서는 정칙 이진 행렬을 이용하여 유전 알고리즘의 성능을 개선할 수 있는 메타 유전 알고리즘을 설계한다. 정칙 이진 행렬은 유전 알고리즘에서 사용되는 이진 인코딩에서의 기저 변환에 중요하게 쓰일 수 있다. 이 논문에서는 정칙 이진 행렬의 기저 변화를 위한 아이디어와 더불어 정칙 이진 행렬의 표현과 재조합 연산에 대한 아이디어를 제시했던 연구들을 소개하고, 메타 유전 알고리즘을 위한 변이와 초기 해집단 생성, 평가에 대한 방법론을 제시한다.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.404-413
• /
• 1995

2수준계 요인실험법에서 Kim(1992) 에 의해 균형배열을 이용하여 설계된 resolution V 포화균형부분실시법에서 추정량들의 공분산행렬을 계산하여 통계적 특성을 연구하였다. 이러한 부분실시법은 최소의 처리조합수를 가지고 주효과와 2인자 교호작용까지 분석할 수 있는 특징이 있다. 특히 본 논문에서는 인자의 수에 따라 설계가능한 8개의 부분실시법들간의 유사성과 통계적 효율성, 그리고 index number들의 변화에 따른 공분산행렬의 특성을 살펴보았다.

• ICROS
• /
• v.17 no.4
• /
• pp.46-50
• /
• 2011

다변수 입출력 제어시스템에서 제어기를 설계하기 위해서는 단일 입출력 시스템에서와 마찬가지로 저주파수영역에서는 루프전달행렬의 크기가 작은 것이 요구되고, 측정잡음 및 플랜트의 불확실성이 존재하는 고주파수 영역에서는 루프전달행렬의 크기가 작게 되도록하여, 잡음의 영향이 출력에 적게 나타나고, 제어기가 포화되지 않도록 하며, 설계된 제어기가 플랜트 모델의 불확실성을 극복할 수 있게 하는 것이 필요하다. 본 원고에서는 각 전달 행렬들의 특이치의 최대 및 최소값들을 이용하여 다변수 제어기가 갖추어야 할 조건들을 정리하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.412-416
• /
• 2000

Hadamard matrices are known to be important in designing of the orthogonal codes. in this paper we propose generalized Sylvester construction for Hadamard matrices. We prove it and give an example for the case of Hadamard matrices of order16.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.849-852
• /
• 2005

일반 행렬이나 불리언 행렬의 연산에 대한 많은 연구가 있다. 대부분의 연구는 두 행렬의 효율적 곱셈을 다루고 있으며 하드웨어나 소프트웨어적 응용에 적합한 다양한 알고리즘을 제시하였다. 모든 행렬 쌍의 곱셈에 대한 연구는 NP-완전 계산 복잡도와 이러한 곱셈을 요구하는 응용의 희소성으로 인해 관심밖에 있었으며 최근에야 원소가 불리언 값을 가지는 n 차 정사각 불리언 행렬을 대상으로 기초적인 연구 결과를 보이고 있다. 본 논문은 모든 n 차 정사각 불리언 행렬 사이의 곱셈을 보다 효율적으로 할 수 있는 벡터 기반 불리언 행렬 곱셈 이론과 이를 바탕으로 설계한 알고리즘 그리고 실행 결과에 대하여 논한다.