• 대한전자공학회논문지
• /
• 제20권3호
• /
• pp.52-60
• /
• 1983

본 논문에서는 부분 대역 전파 방해와 열잡음하에서 바이내리 FSK 변조와 noncoherent 수신을 이용한 주파수 급도약 스프레드 스펙트럼 통신 시스템을 쌨을 때의 오율 도출에 대한 해석을 보였다. 가장 효과적인 전파방해의 경우 오율성능을 수치 해법으로 구하였으며 고 결과를 비트급 도약수(L)을 파라미터로 하여 신호 비트에너지 대 전파 방해 밀도의 비(E /N )의 함수로 도시하였다.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2001년도 하계 학술대회 논문집(KISPS SUMMER CONFERENCE 2001
• /
• pp.9-12
• /
• 2001

DS/CDMA 시스템에서는 여러 채널의 신호를 더하여 전송하는 경우 신호의 레벨 수가 증가하여 높은 선형성의 전력증폭기의 사용이 요구된다. 펄스폭변조(Pulse Width: PW)/CDMA 시스템은 여러 채널의 데이터가 더해져서 만들어진 멀티레벨 신호를 펄스폭 변조를 하여 전송하는 방식으로, 신호의 레벨이 binary 형태로 유지되어 전력증폭기의 변복조 회로가 단순해지는 장점이 있다. 본 논문에서는 AWGN 잡음환경 하에서 PW/CDMA 시스템의 비트오율 특성을 해석적으로 유도하여 DS/CDMA 시스템과 비교하였으며, 유도한 결과를 시뮬레이션을 통하여 확인하였다.

• 융합신호처리학회논문지
• /
• 제11권3호
• /
• pp.250-254
• /
• 2010

As the number of input and fuzzy set of a fuzzy system increase, the size of the rule base increases exponentially and becomes unmanageable (curse of dimensionality). In this paper, tree architectures of fuzzy controller (TAFC) is proposed to overcome the curse of dimensionality problem occurring in the design of fuzzy controller. TAFC is constructed with the aid of AND and OR fuzzy neurons. TAFC can guarantee reduced size of rule base with reasonable performance. For the development of TAFC, genetic algorithm constructs the binary tree structure by optimally selecting the nodes and leaves, and then random signal-based learning further refines the binary connections (two-step optimization). An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation.

• 한국통신학회논문지
• /
• 제14권1호
• /
• pp.65-74
• /
• 1989

본 논문에서는 2원 BCH부호의 복호에 있어서 오류위치다항식을 구하지 않고 오증으로부터 직접 오류위치를 찾아 오류를 정정할 수 있는 2원 BCH부호의 직접복호법을 연구 분석하고 이 복호법을 이용하여 3중오류정정 및 4중오류정정 BCH부호의 복호기를 설계하였다. 또한 실예로써 3중오류정정(63.45) BCH부호를 택하여 이 복호기를 TTL IC로 직접 장치화함으로써 이 복호법의 효율성과 타당성을 입증하고 이 복호기가 매우 간단한 Hardware로 장치화 될 수 있음을 보았다.

• 대한전자공학회논문지
• /
• 제27권2호
• /
• pp.9-15
• /
• 1990

本 論文에서는 線刑 2元 블럭 符號에 대한 軟判定 復號 알고리듬을 제안하였다. 이 알고리듬은 블록 誤謬 確率을 最小化하기 위한 것이다. 提案된 알고리듬을 기存의 다른 復號法과 비교하기 위하여(7,4) Hamming 符號와(23,12)Golay 符號에 대한 컴퓨터 시뮬레이션을 수행하였다. 그 결과, 提案된 알고리듬의 乎均 硬判定 復號 回數는 항상 2以下이며 信號對 雜音比가 충분히 클때 1에 접근하였다. 즉, 기存 다른 復號法에 비하여 復號의 複雜度가 減少되었음을 확인하였다.

• ETRI Journal
• /
• 제33권6호
• /
• pp.949-952
• /
• 2011

In this letter, a simplified suboptimum receiver based on soft-limiting for the detection of binary antipodal signals in non-Gaussian noise modeled as a generalized normal-Laplace (GNL) distribution combined with Gaussian noise is presented. The suboptimum receiver has low computational complexity. Furthermore, when the number of diversity branches is small, its performance is very close to that of the Neyman-Pearson optimum receiver based on the probability density function obtained by the Fourier inversion of the characteristic function of the GNL-plus-Gaussian distribution.

• 전자공학회논문지A
• /
• 제29A권3호
• /
• pp.96-105
• /
• 1992

The use of fixed-point digital signal processors, such as the TMS 320C25, requires scaling of data at each arithmetic step to prevent overflows while keeping the accuracy. A software which automatizes this process is developed for TMS 320C25. The programmers use a model of a hypothetical floating-point digital signal processor and a floating-point format for data representation. However, the program and data are automatically translated to a fixed-point version by this software. Thus, the execution speed is not sacrificed. A fixed-point variable has a unique binary-point location, which is dependent on the range of the variable. The range is estimated from the floating-point simulation. The number of shifts needed for arithmetic or data transfer step is determined by the binary-points of the variables associated with the operation. A fixed-point code generator is also developed by using the proposed automatic scaling software. This code generator produces floating-point assembly programs from the specifiations of FIR, IIR, and adaptive transversal filters, then floating-point programs are transformed to fixed-point versions by the automatic scaling software.

• 전기의세계
• /
• 제28권6호
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• Communications for Statistical Applications and Methods
• /
• 제12권2호
• /
• pp.313-322
• /
• 2005

In this paper, we discuss suppression for logistic regression model. Suppression for linear regression model was defined as the relationship among sums of squared for regression as well as correlation coefficients of. variables. Since it is not common to obtain simple correlation coefficient for binary response variable of logistic model, we consider cumulative logistic models with multinomial and ordinal response variables rather than usual logistic model. As number of category of a response variable for the cumulative logistic model gets collapsed into binary, it is found that suppressions for these logistic models are changed. These suppression results for cumulative logistic models are discussed and compared with those of linear model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.374-388
• /
• 2011

Biometric discretization is a process of transforming continuous biometric features of an identity into a binary bit string. This paper mainly focuses on improving the global discretization method - a discretization method that does not base on information specific to each user in bitstring extraction, which appears to be important in applications that prioritize strong security provision and strong privacy protection. In particular, we demonstrate how the actual performance of a global discretization could further be improved by embedding a global discriminative feature selection method and a Linearly Separable Subcode-based encoding technique. In addition, we examine a number of discriminative feature selection measures that can reliably be used for such discretization. Lastly, encouraging empirical results vindicate the feasibility of our approach.