• Title/Summary/Keyword: Matrix based decision

Search Result 132, Processing Time 0.03 seconds

Efficient Decoder Model of FTN Signal for (1+7) PSK Modulation based on DVB-S3 (DVB-S3기반 (1+7)PSK 변조방식에서 FTN 신호의 효율적인 복호 모델)

  • Baek, Chang-Uk;Jung, Ji-Won
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.55-61
    • /
    • 2017
  • In DVB-S3 standard of satellite broadcasting systems, FTN technique is applied to LDPC codes with (1+7) PSK modulation. In standard, BICM-ID and BCJR decoding method are considered to alleviate performance degradation due to FTN processing. BICM-ID method improves performance by calculating a new LLR from hard-decision value of decoder output. BCJR also improves performance by calculating forward and backward matrix each other. However these two methods require high computational complexity. Therefore this paper proposed modified decoding method in order to reduce computational complexity without performance degradation.

An Improved Reconstruction Algorithm of Convolutional Codes Based on Channel Error Rate Estimation (채널 오류율 추정에 기반을 둔 길쌈부호의 개선된 재구성 알고리즘)

  • Seong, Jinwoo;Chung, Habong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.951-958
    • /
    • 2017
  • In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.

Developing an Intelligent System for the Analysis of Signs Of Disaster (인적재난사고사례기반의 새로운 재난전조정보 등급판정 연구)

  • Lee, Young Jai
    • Journal of Korean Society of societal Security
    • /
    • v.4 no.2
    • /
    • pp.29-40
    • /
    • 2011
  • The objective of this paper is to develop an intelligent decision support system that is able to advise disaster countermeasures and degree of incidents on the basis of the collected and analyzed signs of disasters. The concepts derived from ontology, text mining and case-based reasoning are adapted to design the system. The functions of this system include term-document matrix, frequency normalization, confidency, association rules, and criteria for judgment. The collected qualitative data from signs of new incidents are processed by those functions and are finally compared and reasoned to past similar disaster cases. The system provides the varying degrees of how dangerous the new signs of disasters are and the few countermeasures to the disaster for the manager of disaster management. The system will be helpful for the decision-maker to make a judgment about how much dangerous the signs of disaster are and to carry out specific kinds of countermeasures on the disaster in advance. As a result, the disaster will be prevented.

  • PDF

Synthesis of Multi-level Reed Muller Circuits using BDDs (BDD를 이용한 다단계 리드뮬러회로의 합성)

  • Jang, Jun-Yeong;Lee, Gwi-Sang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.640-654
    • /
    • 1996
  • This paper presents a synthesis method for multi-level Reed-Muller circuits using BDDs(Binary Decision Diagrams). The existing synthesis tool for Reed circuits, FACTOR, is not appropriate to the synthesis of large circuits because it uses matrix (map-type) to represent given logic functions, resulting in the exponential time and space in number of imput to the circuits. For solving this problems, a syntheisis method based on BDD is presented. Using BDDs, logic functions are represented compactly. Therefor storage spaces and computing time for synthesizing logic functions were greatly decreased, and this technique can be easily applied to large circuits. Using BDD representations, the proposed method extract best patterns to minimize multi-level Reed Muller circuits with good performance in area optimization and testability. Experimental results using the proposed method show better performance than those using previous methods〔2〕. For large circuits of considering the best input partition, synthesis results have been improved.

  • PDF

Comparative Analysis of the Binary Classification Model for Improving PM10 Prediction Performance (PM10 예측 성능 향상을 위한 이진 분류 모델 비교 분석)

  • Jung, Yong-Jin;Lee, Jong-Sung;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.1
    • /
    • pp.56-62
    • /
    • 2021
  • High forecast accuracy is required as social issues on particulate matter increase. Therefore, many attempts are being made using machine learning to increase the accuracy of particulate matter prediction. However, due to problems with the distribution of imbalance in the concentration and various characteristics of particulate matter, the learning of prediction models is not well done. In this paper, to solve these problems, a binary classification model was proposed to predict the concentration of particulate matter needed for prediction by dividing it into two classes based on the value of 80㎍/㎥. Four classification algorithms were utilized for the binary classification of PM10. Classification algorithms used logistic regression, decision tree, SVM, and MLP. As a result of performance evaluation through confusion matrix, the MLP model showed the highest binary classification performance with 89.98% accuracy among the four models.

Prediction of Safety Grade of Bridges Using the Classification Models of Decision Tree and Random Forest (의사결정나무 및 랜덤포레스트 분류 모델을 이용한 교량 안전등급 예측)

  • Hong, Jisu;Jeon, Se-Jin
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.43 no.3
    • /
    • pp.397-411
    • /
    • 2023
  • The number of deteriorated bridges with a service period of more than 30 years has been rapidly increasing in Korea. Accordingly, the importance of advanced maintenance technologies through the predictions of age-induced deterioration degree, condition, and performance of bridges is more and more noticed. The prediction method of the safety grade of bridges was proposed in this study using the classification models of the Decision Tree and the Random Forest based on machine learning. As a result of analyzing these models for the 8,850 bridges located in national roads with various evaluation indexes such as confusion matrix, balanced accuracy, recall, ROC curve, and AUC, the Random Forest largely showed better predictive performance than that of the Decision Tree. In particular, random under-sampling in the Random Forest showed higher predictive performance than that of other sampling techniques for the C and D grade bridges, with the recall of 83.4%, which need more attention to maintenance because of the significant deterioration degree. The proposed model can be usefully applied to rapidly identify the safety grade and to establish an efficient and economical maintenance plan of bridges that have not recently been inspected.

A Study on the Development of Analysis Model for Maritime Security Management (해상보안관리 분석모델 개발에 관한 연구)

  • Jeong, Woo-Lee
    • Journal of Navigation and Port Research
    • /
    • v.36 no.1
    • /
    • pp.9-14
    • /
    • 2012
  • Maritime security incidents by pirates and by terrorists increase, but maritime incidents investigation models are limited to figure out the maritime security incidents. This paper provides the analysis model for maritime security incidents. To develop this analysis model, this categorizes five threat factors, the ship, the cargo type, port system, human factor, information flow system, makes the risk assessment matrix to quantify the risk related to threat factors and classifies four priority categories of risk assessment matrix. Also, this model makes from the frameworks which include a variety of security initiatives implementing in stakeholder levels like international organizations, individual governments, shipping companies, and the ship. Therefore, this paper develops the Analysis for Maritime Security Management model based on various security initiatives responding to the stakeholder levels of maritime security management and top-bottom/bottom-up decision trees, and shows the validity through verifying the real maritime security incident of M/V Petro Ranger.

Analysis of Feature Importance of Ship's Berthing Velocity Using Classification Algorithms of Machine Learning (머신러닝 분류 알고리즘을 활용한 선박 접안속도 영향요소의 중요도 분석)

  • Lee, Hyeong-Tak;Lee, Sang-Won;Cho, Jang-Won;Cho, Ik-Soon
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.26 no.2
    • /
    • pp.139-148
    • /
    • 2020
  • The most important factor affecting the berthing energy generated when a ship berths is the berthing velocity. Thus, an accident may occur if the berthing velocity is extremely high. Several ship features influence the determination of the berthing velocity. However, previous studies have mostly focused on the size of the vessel. Therefore, the aim of this study is to analyze various features that influence berthing velocity and determine their respective importance. The data used in the analysis was based on the berthing velocity of a ship on a jetty in Korea. Using the collected data, machine learning classification algorithms were compared and analyzed, such as decision tree, random forest, logistic regression, and perceptron. As an algorithm evaluation method, indexes according to the confusion matrix were used. Consequently, perceptron demonstrated the best performance, and the feature importance was in the following order: DWT, jetty number, and state. Hence, when berthing a ship, the berthing velocity should be determined in consideration of various features, such as the size of the ship, position of the jetty, and loading condition of the cargo.

Robust Spectrum Sensing for Blind Multiband Detection in Cognitive Radio Systems: A Gerschgorin Likelihood Approach

  • Qing, Haobo;Liu, Yuanan;Xie, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1131-1145
    • /
    • 2013
  • Energy detection is a widely used method for spectrum sensing in cognitive radios due to its simplicity and accuracy. However, it is severely affected by the noise uncertainty. To solve this problem, a blind multiband spectrum sensing scheme which is robust to noise uncertainty is proposed in this paper. The proposed scheme performs spectrum sensing over the total frequency channels simultaneously rather than a single channel each time. To improve the detection performance, the proposal jointly utilizes the likelihood function combined with Gerschgorin radii of unitary transformed covariance matrix. Unlike the conventional sensing methods, our scheme does not need any prior knowledge of noise power or PU signals, and thus is suitable for blind spectrum sensing. In addition, no subjective decision threshold setting is required in our scheme, making it robust to noise uncertainty. Finally, numerical results based on the probability of detection and false alarm versus SNR or the number of samples are presented to validate the performance of the proposed scheme.

Sparse Signal Recovery via Tree Search Matching Pursuit

  • Lee, Jaeseok;Choi, Jun Won;Shim, Byonghyo
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.699-712
    • /
    • 2016
  • Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin.