• Title/Summary/Keyword: 결합 알고리즘

Search Result 1,717, Processing Time 0.026 seconds

LLR Based Generalization of Soft Decision Iterative Decoding Algorithms for Block Turbo Codes (LLR 기반 블록 터보 부호의 연판정 복호 알고리즘 일반화)

  • Im, Hyun-Ho;Kwon, Kyung-Hoon;Heo, Jun
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.1026-1035
    • /
    • 2011
  • This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

An Empirical Comparison of Bagging, Boosting and Support Vector Machine Classifiers in Data Mining (데이터 마이닝에서 배깅, 부스팅, SVM 분류 알고리즘 비교 분석)

  • Lee Yung-Seop;Oh Hyun-Joung;Kim Mee-Kyung
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.2
    • /
    • pp.343-354
    • /
    • 2005
  • The goal of this paper is to compare classification performances and to find a better classifier based on the characteristics of data. The compared methods are CART with two ensemble algorithms, bagging or boosting and SVM. In the empirical study of twenty-eight data sets, we found that SVM has smaller error rate than the other methods in most of data sets. When comparing bagging, boosting and SVM based on the characteristics of data, SVM algorithm is suitable to the data with small numbers of observation and no missing values. On the other hand, boosting algorithm is suitable to the data with number of observation and bagging algorithm is suitable to the data with missing values.

A Study on the Ultrasonic Inspection Method in High Attenuation Welds using Minimization-Polarity Threshold Algorithm (최소극 문턱치 알고리즘을 이용한 고감쇠 용접부에서 초음파 검사방법에 관한 연구)

  • Koo, Kil-Mo;Park, Chi-Seung;Choi, Jong-Ho;Ko, Duck-Young
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.3
    • /
    • pp.30-36
    • /
    • 2000
  • In this paper, an ultrasonic testing method for inspection of high attenuation welding area using the minimum Polarity threshold algorithm which combines the minimum amplitude selection algorithm and polarity threshold algorithm is suggested to increase the signal to noise ratio of the flow signal. In order to confirm the usefulness of the suggested algorithm, experiments were performed using four probes and standard specimens following the ASME Xl Code. As a result, scattering signals were observed from the SE(safe end) and CCSS (centrifugal casting stainless steel) materials due to the microstructural characteristical, and the detectability was reduced due to the highly attenuated signal from the weldment area, but it was conformed that using the suggested algorithm, the signal to noise ratio increased about 2.6.

  • PDF

A Combined Random Scalar Multiplication Algorithm Resistant to Power Analysis on Elliptic Curves (전력분석 공격에 대응하는 타원곡선 상의 결합 난수 스칼라 곱셈 알고리즘)

  • Jung, Seok Won
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.2
    • /
    • pp.25-29
    • /
    • 2020
  • The elliptic curve crypto-algorithm is widely used in authentication for IoT environment, since it has small key size and low communication overhead compare to the RSA public key algorithm. If the scalar multiplication, a core operation of the elliptic curve crypto-algorithm, is not implemented securely, attackers can find the secret key to use simple power analysis or differential power analysis. In this paper, an elliptic curve scalar multiplication algorithm using a randomized scalar and an elliptic curve point blinding is suggested. It is resistant to power analysis but does not significantly reduce efficiency. Given a random r and an elliptic curve random point R, the elliptic scalar multiplication kP = u(P+R)-vR is calculated by using the regular variant Shamir's double ladder algorithm, where l+20-bit u≡rn+k(modn) and v≡rn-k(modn) using 2lP=∓cP for the case of the order n=2l±c.

Performance Analysis of Vision-based Positioning Assistance Algorithm (비전 기반 측위 보조 알고리즘의 성능 분석)

  • Park, Jong Soo;Lee, Yong;Kwon, Jay Hyoun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.3
    • /
    • pp.101-108
    • /
    • 2019
  • Due to recent improvements in computer processing speed and image processing technology, researches are being actively carried out to combine information from camera with existing GNSS (Global Navigation Satellite System) and dead reckoning. In this study, developed a vision-based positioning assistant algorithm to estimate the distance to the object from stereo images. In addition, GNSS/on-board vehicle sensor/vision based positioning algorithm is developed by combining vision based positioning algorithm with existing positioning algorithm. For the performance analysis, the velocity calculated from the actual driving test was used for the navigation solution correction, simulation tests were performed to analyse the effects of velocity precision. As a result of analysis, it is confirmed that about 4% of position accuracy is improved when vision information is added compared to existing GNSS/on-board based positioning algorithm.

To Constrain Korean Compound Nouns using Semantic Information for Korean Grammar Checker (한국어 문법검사기에서 의미정보를 이용한 복합명사의 분석제약)

  • Won, Sang-Yun;Kim, Su-Nam;Kim, Kwang-Young;Nam, Hyun-Suk;Kwon, Hyuk-Chul
    • Annual Conference on Human and Language Technology
    • /
    • 1999.10e
    • /
    • pp.288-293
    • /
    • 1999
  • 일반적으로 두 개의 명사가 결합하여 하나의 명사 기능을 하는 어구를 복합명사라고 한다. 한국어는 복합명사 내의 명사를 붙여볼 수도 있고 띄어쓸 수도 있으므로 복합명사의 형태적 분석에 많은 어려움이 있다. 이 연구에서는 각 명사의 복합명사 결합을 최대한 제약하여 문법검사기에서 복합명사와 관련된 오류의 발생을 최소화할 수 있는 방범을 개발했다. 이 논문에서 복합명사 분석 기능을 제약하는 방법으로 형태적 제약 방법과 의미정보에 따라 복합명사의 결합관계를 제약하는 방법을 이용했다. 어휘 정보만으로 복합명사를 분석하면 의미관계에 의한 오류는 찾기 어려우므로 복합명사의 구조적 결합관계와 의미 결합관계를 밝혀 복합명사를 잘못 분석하는 문제점을 극복한다. 복합명사의 결합제약은 명사의 왼쪽과 오른쪽에 올 수 있거나 올 수 없는 명사를 의미, 형태적 특성과 명사가 나타나는 분포(distribution)에 따라 분류하여 규칙베이스화하였다. 의미정보를 이용한 복합명사 결합제약 알고리즘도 구현하였다.

  • PDF

The Development of Predictive Multiclass Dynamic Traffic Assignment Model and Algorithm (예측적 다중계층 동적배분모형의 구축 및 알고리즘 개발)

  • Kang, Jin-Gu;Park, Jin-Hee;Lee, Young-Ihn;Won, Jai-Mu;Ryu, Si-Kyun
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.123-137
    • /
    • 2004
  • The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

Crosstalk Analysis accrording to Characteristics of Pulse Signal on the Multi Microstriplines unsing the SPICE (SPICE를 이용한 마이크로스트립 다중 전송선로에서 펄스 특성에 따른 선로의 누화특성 해석)

  • 김기래;이영철
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.1
    • /
    • pp.79-85
    • /
    • 1999
  • The propagation properties of the high speed pulse signal in time domain using the equivalent circuits for the analysis by SPICE on the coupled microstrip lines are investigated. In this paper, the SPICE program is used for the crosstalk analysis on the coupled microstrip lines. The results of crosstalk of coupled microstrip lines compared to one by Branin and FDTD method. And the near-end and far-end crosstalk on coupled lines are analyzed for the square pulse and trapezoidal pulse. The results of this paper are apply To the determination for the geometric structure and the frequency of signal pulse in design of MIC and MMIC by the CAD program.

  • PDF

Estimation Techniques for Three-Dimensional Target Location Based on Linear Least Squared Error Algorithm (선형 최소제곱오차 알고리즘을 응용한 3차원 표적 위치 추정 기법)

  • Han, Jeong Jae;Jung, Yoonhwan;Noh, Sanguk;Park, So Ryoung;Kang, Dokeun;Choi, Wonkyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.7
    • /
    • pp.715-722
    • /
    • 2016
  • In this paper, by applying the linear least squared error algorithm, we derive an estimation technique for three dimensional target location when a number of radars are used in detecting a target. The proposed technique is then enhanced by combining GPS information and by assigning variable weights to information sources. The enhanced performance of proposed techniques is confirmed via simulation. It is also observed from simulation results that the performance is robust to the uncertainty of information.

Joint Estimation Methods of Carrier Offset and Low-rank LMMSE Channel Estimation for MB-OFDM System (MB-OFDM 시스템을 위한 Low-rank LMMSE 채널 추정 및 주파수 옵셋 추정 결합 기법)

  • Shin, Sun-Kyung;Nam, Sang-Kyun;Sung, Tae-Kyung;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1296-1302
    • /
    • 2007
  • In this paper, we propose joint estimation methods of carrier offset and channel estimation for MB-OFDM system with low complexity. The proposed methods estimate the channel by using low-rank LMMSE channel estimation which reduces the system complexity by applying the optimal number of rank to evaluate the frequency offset and additionally using the simple algorithm using the auto-correlation property of the estimated channel. We simulate the proposed algorithms under the IEEE 802.15 TG3a UWB channel model.