• Title/Summary/Keyword: Conventional Algorithm

Search Result 6,275, Processing Time 0.03 seconds

An Enhanced Affine Projection Sign Algorithm in Impulsive Noise Environment (충격성 잡음 환경에서 개선된 인접 투사 부호 알고리즘)

  • Lee, Eun Jong;Chung, Ik Joo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.6
    • /
    • pp.420-426
    • /
    • 2014
  • In this paper, we propose a new affine projection sign algorithm (APSA) to improve the convergence speed of the conventional APSA which has been proposed to enable the affine projection algorithm (APA) to operate robustly in impulsive noise environment. The conventional APSA has two advantages; it operates robustly against impulsive noise and does not need calculation for the inverse matrix. The proposed algorithm also has the conventional algorithm's advantages and furthermore, better convergence speed than the conventional algorithm. In the conventional algorithm, each input signal is normalized by $l_2$-norm of all input signals, but the proposed algorithm uses input signals normalized by their corresponding $l_2$-norm. We carried out a performance comparison of the proposed algorithm with the conventional algorithm using a system identification model. It is shown that the proposed algorithm has the faster convergence speed than the conventional algorithm.

Fast Anti-collision Algorithm for Improving Tag Identification Speed in EPC Class 1 RFID System (EPC Class 1 RFID 시스템에서 태그 인식 속도 향상을 위한 고속 태그 충돌 방지 알고리즘)

  • Lee, Choong-Hee;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6B
    • /
    • pp.450-455
    • /
    • 2008
  • We analyze the tag identification procedure of conventional EPC Class 1 RFID system and propose the fast anti-collision algorithm for the performance improvement of the system. In the proposed algorithm, the reader uses information of tag collisions and reduces unnecessary procedures of the conventional algorithm. We evaluate the performance of the proposed anti-collision algorithm and the conventional algorithm using mathematical analysis and simulation. According to the results, the fast anti-collision algorithm shows greatly better performance than conventional algorithm.

A Modified Error Back Propagation Algorithm Adding Neurons to Hidden Layer (은닉층 뉴우런 추가에 의한 역전파 학습 알고리즘)

  • 백준호;김유신;손경식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.4
    • /
    • pp.58-65
    • /
    • 1992
  • In this paper new back propagation algorithm which adds neurons to hidden layer is proposed. this proposed algorithm is applied to the pattern recognition of written number coupled with back propagation algorithm through omitting redundant learning. Learning rate and recognition rate of the proposed algorithm are compared with those of the conventional back propagation algorithm and the back propagation through omitting redundant learning. The learning rate of proposed algorithm is 4 times as fast as the conventional back propagation algorithm and 2 times as fast as the back propagation through omitting redundant learning. The recognition rate is 96.2% in case of the conventional back propagation algorithm, 96.5% in case of the back propagation through omitting redundant learning and 97.4% in the proposed algorithm.

  • PDF

LDPC Decoding by Failed Check Nodes for Serial Concatenated Code

  • Yu, Seog Kun;Joo, Eon Kyeong
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.54-60
    • /
    • 2015
  • The use of serial concatenated codes is an effective technique for alleviating the error floor phenomenon of low-density parity-check (LDPC) codes. An enhanced sum-product algorithm (SPA) for LDPC codes, which is suitable for serial concatenated codes, is proposed in this paper. The proposed algorithm minimizes the number of errors by using the failed check nodes (FCNs) in LDPC decoding. Hence, the error-correcting capability of the serial concatenated code can be improved. The number of FCNs is simply obtained by the syndrome test, which is performed during the SPA. Hence, the decoding procedure of the proposed algorithm is similar to that of the conventional algorithm. The error performance of the proposed algorithm is analyzed and compared with that of the conventional algorithm. As a result, a gain of 1.4 dB can be obtained by the proposed algorithm at a bit error rate of $10^{-8}$. In addition, the error performance of the proposed algorithm with just 30 iterations is shown to be superior to that of the conventional algorithm with 100 iterations.

Analysis and Design of a Separate Sampling Adaptive PID Algorithm for Digital DC-DC Converters

  • Chang, Changyuan;Zhao, Xin;Xu, Chunxue;Li, Yuanye;Wu, Cheng'en
    • Journal of Power Electronics
    • /
    • v.16 no.6
    • /
    • pp.2212-2220
    • /
    • 2016
  • Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

Two-Stage Fast Block Matching Algorithm Using Integral Projections (가산 투영을 이용한 2단계 고속 블록정합 알고리즘)

  • 김준식;박래홍;이병욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.1
    • /
    • pp.45-55
    • /
    • 1993
  • In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.

  • PDF

An FPGA Design of High-Speed Turbo Decoder

  • Jung Ji-Won;Jung Jin-Hee;Choi Duk-Gun;Lee In-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6C
    • /
    • pp.450-456
    • /
    • 2005
  • In this paper, we propose a high-speed turbo decoding algorithm and present results of its implementation. The latency caused by (de)interleaving and iterative decoding in conventional MAP turbo decoder can be dramatically reduced with the proposed scheme. The main cause of the time reduction is to use radix-4, center to top, and parallel decoding algorithm. The reduced latency makes it possible to use turbo decoder as a FEC scheme in the real-time wireless communication services. However the proposed scheme costs slight degradation in BER performance because the effective interleaver size in radix-4 is reduced to an half of that in conventional method. To ensure the time reduction, we implemented the proposed scheme on a FPGA chip and compared with conventional one in terms of decoding speed. The decoding speed of the proposed scheme is faster than conventional one at least by 5 times for a single iteration of turbo decoding.

Efficient Method to Implement Max-Log-MAP Algorithm: Parallel SOVA

  • Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.438-443
    • /
    • 2008
  • The efficient method to implement the Max-Log-MAP algorithm is proposed by modifying the conventional algorithm. It is called a parallel soft output Viterbi algorithm (SOVA) and the rigorous proof is given for the equivalence between the Max-Log-MAP algorithm and the parallel SOVA. The parallel SOVA is compared with the conventional algorithms and we show that it is an efficient algorithm implementing the modified SOVA in parallel.

Implementation of Fuzzy Control Algorithm For Nuclear Power Plant Steam Generator Level Control At Field Controller (원자력발전소 증기발생기 수위제어를 위한 퍼지제어기법의 현장 제어기계에의 적용)

  • 박기용;허우성;성풍현
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.1
    • /
    • pp.111-121
    • /
    • 1995
  • A fuzzy control algorithm of bell-type membership functions and 9 rules is constructed for narrow range level control of steam generators in nuclear power plants. It is implemented at a field digital distributed controller, a Westinghouse-made controller called Westinghouse Distributed Processing Family(WDPF). Performance for level control of the developed fuzzy controller is compared with that of conventional controller, both at the field controller. For these comparisons, both the fuzzy control algorithm and the conventional PI control algorithm were carefully tuned. Also the sampling time for optimal performance was investigated. The results show that the fuzzy control algorithm is not only better in performance than the conventional algorithm but also much easier to be tuned by operators in the field.

The Enhancement of Learning Time in Fuzzy c-means algorithm (학습시간을 개선한 Fuzzy c-means 알고리즘)

  • 김형철;조제황
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.113-116
    • /
    • 2001
  • The conventional K-means algorithm is widely used in vector quantizer design and clustering analysis. Recently modified K-means algorithm has been proposed where the codevector updating step is as fallows: new codevector = current codevector + scale factor (new centroid - current codevector). This algorithm uses a fixed value for the scale factor. In this paper, we propose a new algorithm for the enhancement of learning time in fuzzy c-means a1gorithm. Experimental results show that the proposed method produces codebooks about 5 to 6 times faster than the conventional K-means algorithm with almost the same Performance.

  • PDF