• Journal of Electrical Engineering and information Science
• /
• 제3권1호
• /
• pp.8-13
• /
• 1998

Often ESOP(Exclusive Sum of Products) expressions provide more compact representations of logic functions and implemented circuits are known to be highly testable. Motivated by the merits of using XOR(Exclusive-OR) gates in circuit design, ESOP(Exclusive Sum of Products) expressions are considered s the input to the logic synthesis for random pattern testability. The problem of interest in this paper is whether ESOP expressions provide better random testability than corresponding SOP expressions of the given function. Since XOR gates are used to collect product terms of ESOP expression, fault propagation is not affected by any other product terms in the ESOP expression. Therefore the test set for a fault in ESOP expressions becomes larger than that of SOP expressions, thereby providing better random testability. Experimental results show that in many cases, ESOP expressions require much less random patterns compared to SOP expressions.

• Korean Journal of Mathematics
• /
• 제26권2호
• /
• pp.215-269
• /
• 2018

Orders and types of entire functions have been actively investigated by many authors. In this paper, we investigate some basic properties in connection with sum and product of relative (p, q, t) L-th order, relative (p, q, t) L-th type, and relative (p, q, t) L-th weak type of entire functions with respect to another entire function where $p,q{\in}{\mathbb{N}}$ and $t{\in}{\mathbb{N}}{\cup}\{-1,0\}$.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1998년도 가을 학술발표회 논문집
• /
• pp.61-68
• /
• 1998

It has become important to evaluate the qualitive reliability and condition assessment of existing structural systems in order to establish a rational program for repair and maintenance. Since most of if existing structural system may suffer from defect corrosion and damage, it is necessary to account for their effects in fuzzy reliability analysis, In this paper, an attempt is made to develope a reliability analysis for damaged structural systems using failure possibility theory. Damage state is specified in terms of linguistic valiables using natural language information and numerical information, which are defined by fuzzy sets. Using a subjective condition index of failure possibility and information of the damage state is introduced into the calculation of failure probability. The subjective condition index of quantitative and qualitative analysis method is newly proposed based on the fuzzy set operations, namely logical product, drastic product, logical sum and drastic sum

• 한국지능시스템학회논문지
• /
• 제5권4호
• /
• pp.67-76
• /
• 1995

퍼지 제어기에 관한 최근 연구에서, 연산의 간략성을 위해 퍼지 제어 규칙의 후건부에 대하여 퍼지 집합 대신에 크리스프 값을 사용하는 크리스프 타입 퍼지 제어기 모델이 다양한 분양의 응용에 널리 이용괴고 있다. 이 논문에서는 max-min 추론법 및 product-sum 추론법에 기초한 크리스프 타입 퍼지 제어기의 동특성을 해석하였다. 해석결과, 크리스프 타입 퍼지 제어기는 근사적으로 PD 제어기와 같이 동작함을 보였다.

• 통합자연과학논문집
• /
• 제12권3호
• /
• pp.78-84
• /
• 2019

In many cases, the quality of a product is determined by several correlated quality variables. Control charts have been used for a long time widely to control the production process and to quickly detect the assignable causes that may produce any deterioration in the quality of a product. Numerical switching performances of multivariate cumulative sum control chart for simultaneous monitoring all components in the dispersion matrix ${\Sigma}$ under multivariate normal process $N_p({\underline{\mu}},{\Sigma})$ are considered. Numerical performances were evaluated for various shifts of the values of variances and/or correlation coefficients in ${\Sigma}$. Our computational results show that if one wants to quick detect the small shifts in a process, CUSUM control chart with small reference value k is more efficient than large k in terms of average run length (ARL), average time to signal (ATS), average number of switches (ANSW).

• 정보보호학회논문지
• /
• 제9권2호
• /
• pp.3-12
• /
• 1999

본 논문에서는 선형 귀환 쉬프트 레지스터(LFSR)에 의하여 생성되는 수열의 복잡도를 고찰한 후, 이들의 비선형적 결합이 갖는 특성에 대하여 살펴본다. 이 비선형 결합의 구성 단위인 LFSR의 합과 곱을 중심으로 이들이 갖는 이론적인 면을 복잡도 측면에서 고찰한다. We introduce feedback registers and definitions of complexity of a register or a sequence generated by it. In the view point of cryptography the linear complexity of an ultimately periodic sequence is important because large one gives an enemy infeasible jobs. We state some results about the linear complexity of sum and product of two LFSRs.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제28권2호
• /
• pp.155-185
• /
• 2021

Orders and types of entire functions have been actively investigated by many authors. In this paper, we investigate some basic properties in connection with sum and product of generalized relative order (𝛼, 𝛽), generalized relative type (𝛼, 𝛽) and generalized relative weak type (𝛼, 𝛽) of entire functions with respect to another entire function where 𝛼, 𝛽 are continuous non-negative functions on (-∞, +∞).

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1262-1270
• /
• 2017

Among various decoding algorithms of low-density parity-check (LDPC) codes, the min-sum (MS) algorithm and its modified algorithms are widely adopted because of their computational simplicity compared to the sum-product (SP) algorithm with slight loss of decoding performance. In the MS algorithm, the magnitude of the output message from a check node (CN) processing unit is decided by either the smallest or the next smallest input message which are denoted as min1 and min2, respectively. It has been shown that multiplying a scaling factor to the output of CN message will improve the decoding performance. Further, Zhong et al. have shown that multiplying different scaling factors (called a 2-dimensional scaling) to min1 and min2 much increases the performance of the LDPC decoder. In this paper, the simplified 2-dimensional scaled (S2DS) MS algorithm is proposed. In the proposed algorithm, we figure out a pair of the most efficient scaling factors which multiplications can be replaced with combinations of addition and shift operations. Furthermore, one scaling operation is approximated by the difference between min1 and min2. The simulation results show that S2DS achieves the error correcting performance which is close to or outperforms the SP algorithm regardless of coding rates, and its computational complexity is the lowest comparing to modified versions of MS algorithms.

• 대한전자공학회논문지TE
• /
• 제42권3호
• /
• pp.51-56
• /
• 2005

본 논문에서는 페이딩 채널 환경하에서 OFDM의 BER성능을 개선시키기 위해서 LDPC 부호화된 OFDM 시스템을 제안한다. LDPC 부호는 Sum-Product 알고리즘이나 Belief Propagation 알고리즘으로 알려진 확률적인 전파(Propagation) 알고리즘에 의해서 복호된다. LDPC 부호가 OFDM 시스템에 적용될 때 복호 알고리즘을 수행함에 있어서 복호 횟수를 거듭할수록 성능이 개선된다. 이동통신 시스템에서는, 높은 대역 효율을 요구하므로 다중레벨 변조가 사용된다. 그러나 다중레벨 변조를 갖는 OFDM에 LDPC 부호를 어떠한 방식으로 적용할 것인지에 대해서 명료하지 못하다. 따라서 본 논문에서는 MPSK를 사용한 LDPE Coded OFDM 시스템에 대한 복호 알고리즘에 대해서 언급한다. AWGN 채널 환경과 레일리 페이딩 채널 환경에서의 시뮬레이션 결과는 작은 반복 횟수에 대해서 좋은 BER 성능을 나타낸다.

• 한국통신학회논문지
• /
• 제34권5C호
• /
• pp.498-504
• /
• 2009

Low-density parity-check (LDPC) 부호의 복호에는 성능이 좋은 합곱 알고리즘(sum-product algorithm; SPA)과 하드웨어가 간단한 비트 반전(bit-flipping; BF) 알고리즘이 많이 쓰이고 있다. 본 논문은 이들 두 가지 방법의 장점을 가지는 저복잡도 고성능 복호 알고리즘을 제안한다. 본 제안된 유연 비트 반전(soft bit-flipping) 알고리즘은 비트와 체크 노드 사이에 전달되는 메시지를 계산하는 데 단순한 비교와 덧셈 연산만을 필요로 하며 연산량이 적다는 장점이 있다. 또한 연산이 완료된 메시지의 활용률을 높이고 비균등 양자화(non-uniform quantization)를 채용하여 1000 내외의 부호 길이에서 SPA 에 0.4dB 근접하는 신호대 잡음비(signal-to-noise ratio)를 달성하였다. 본 논문에서 제안된 알고리즘을 이용하면, 행 무게(row weight)와 열 무게(column weight)가 높아서 종래의 SPA로 구현하기 어려웠던 부호를 비교적 좋은 오율 성능을 유지하면서 실용적으로 구현할 수 있다.