• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.17-22
• /
• 2016

For the self-adaptive equalization of higher-order QAM systems, this paper proposes a new soft decision-directed (SDD) algorithm that opens the eye patterns quickly as well as significantly reducing the error level in the steady-state when it is applied to the initial equalization stage with completely closed eye patterns. The proposed method for M-QAM application minimized the computational complexity of the existing SDD by the symbol estimated based on the two symbols closest to the observation, and greatly simplified the soft decision independently of the QAM order. Furthermore, in the symbol estimating it increased the reliability of the estimates by applying the superior properties of the sigmoid function and avoiding the erroneous estimation of the threshold function. In addition, the initialization performance was improved when an error is generated to update the equalizer, weighting the symbol decision by the threshold function to the error, resulting in an extension of the range of error fluctuations. As a result, the proposed method improves remarkably the computational complexity and the properties of initialization and convergence of the traditional SDD. Through simulations for 64-QAM and 256-QAM under multipath channel conditions with additive noise, the usefulness of the proposed methods was confirmed by comparing the performance of the proposed 2-SDD and two forms of weighted 2-SDD with CMA.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.761-767
• /
• 2011

In this paper, to improve performance of spectrum sensing, we propose the method which can find optimal threshold based on power of PU(Primary User) signal. To find optimal threshold value, we will use mathematical method, and find threshold which can has lowest error probability. Each SU(Secondary User) use this threshold and All Su makes local decision. All Su Send local decision to FC(Fusion Center). In this paper we consider K-out-of-n rule to combining local decision. To make global decision value, FC find optimal n. In the FC. FC received local decision which has lowest error probability and using optimal n and these vaule. FC make global decision value. In this paper, to analysis performance proposed scheme, we simulate proposed scheme using matlab and compare with traditional OR Rule. As a result of simulation, we can know that preposed scheme can get a better performance than traditional OR rule.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.4
• /
• pp.346-360
• /
• 1992

This paper proposed a method of identity decision of moving object by the fuzzy inference. Moving object is extracted by the difference picture method and identity decision parameters of moving object are chosen area, perimeter. A/p ratio and vertex. In the brightness variation of 600 Lux-1600Lux, we determined the maximum error often parameters and then generated a fuzzified data. Fuzzified data are generated from the reference image and then decided the identity of extracted parameter by the fuzzy inference using fuzzy production rule. In order to verify validity of proposed method, experiment are performed with a toy car. As a result, it was shown that decision error was less than 4%

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.634-640
• /
• 2000

This paper proposes a new extended decision directed-decision estimated phase recovery algorithm based on maximum likelihood parameter estimation for OQPSK. In this scheme, comparing conventional one, the data dependent noise of phase recovery loop is reduced by inserting filter with 2 taps to in-phase and quadrature-phase channel respectively before phase detector. The proposed scheme is compared to conventionalscheme and OQPSK in aspect to BER(Bit Error Rate) and phase error according to the roll-off factor of baseband filter, the output back-offs of nonlinear satellite channel, and loop bandwidth.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.10
• /
• pp.15-23
• /
• 2016

To support the telematics and infotainment services, vehicle-to-everything (V2X) communication requires a robust and reliable network. To do this, the 3rd Generation Partnership Project (3GPP) has recently developed V2X communication. For reliable communication, accurate channel estimation should be done. However, because vehicle speed is very fast, radio channel is rapidly changed with time. Therefore, it is difficult to accurately estimate the channel. In this paper, we propose the new linear minimum mean square error (LMMSE) channel interpolation scheme based on the Long Term Evolution (LTE) sidelink system in vehicle-to-vehicle (V2V) environments. In our proposed reduced decision error (RDE) channel estimation scheme, LMMSE channel estimation is applied in the pilot symbol, and then in the data symbol, smoothing and LMMSE channel interpolation scheme is applied. After that, time and frequency domain averaging are applied to obtain the whole channel frequency response. In addition, the LMMSE equalizer of the receiver side can reduce the error propagation due to the decision error. Therefore, it is possible to detect the reliable data. Analysis and simulation results demonstrate that the proposed scheme outperforms currently conventional schemes in normalized mean square error (NMSE) and bit error rate (BER).

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.123-126
• /
• 2000

In this paper, we propose new watermarking technique using weighting factor decision method in the watermark embedding step and adaptive threshold decision method in the watermark extracting step. In our method, we are determined weighting factor in simple by calculating distance between pixel coefficient and neighborhood pixel coefficients and threshold is adaptively determined by searching the minimized extract error value using histogram of difference value.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.527-529
• /
• 2007

In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

• Proceedings of the Safety Management and Science Conference
• /
• 2006.11a
• /
• pp.427-435
• /
• 2006

We study on the consistency of AHP. It is research that extend of SAW methods by [1]. For tools that measure judgment of inconsistency eigenvector methods, we research consistency that introduced consistency ratio by Saaty. in general, the higher consistence of compare matrix the bigger error within matrix. In this paper, we use the AHP for the optimal decision making. By this method, we have optimal decision making numenical example which three models of any domestic motors companies.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.218-223
• /
• 1995

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature or feature subset among all the available features is selected based on fitness function in genetic algorithm which is inversely proportional to classification error, balance between cluster, number of feature used. The proposed design scheme is applied to the handwtitten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.27-32
• /
• 2003

An efficient soft-decision decoding algorithm for binary block codes it proposed. The proposed soft-decision decoding algorithm is implemented by a series of hard-decision decoding process. By the hard-decision decoding result, the candidate codewords are efficiently searched for A new decoding method, which prevents the missing of the candidate codeword, is proposed. Also, the method fir reducing complexity is developed. This method removes the practical complexity increase caused by the improved algorithm. There facts are confirmed by the simulation results for binary (63, 36) BCH code.