• Title/Summary/Keyword: Forward-Backward Algorithm

Search Result 143, Processing Time 0.025 seconds

A Study on ECG Oata Compression Algorithm Using Neural Network (신경회로망을 이용한 심전도 데이터 압축 알고리즘에 관한 연구)

  • 김태국;이명호
    • Journal of Biomedical Engineering Research
    • /
    • v.12 no.3
    • /
    • pp.191-202
    • /
    • 1991
  • This paper describes ECG data compression algorithm using neural network. As a learning method, we use back error propagation algorithm. ECG data compression is performed using learning ability of neural network. CSE database, which is sampled 12bit digitized at 500samp1e/sec, is selected as a input signal. In order to reduce unit number of input layer, we modify sampling ratio 250samples/sec in QRS complex, 125samples/sec in P & T wave respectively. hs a input pattern of neural network, from 35 points backward to 45 points forward sample Points of R peak are used.

  • PDF

An Error Control Algorithm for Wireless Video Transmission based on Feedback Channel (무선 비디오 통신을 위한 피드백 채널 기반의 에러복구 알고리즘의 개발)

  • 노경택
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.2
    • /
    • pp.95-100
    • /
    • 2002
  • By feedback channel, the decoder reports the addresses of corrupted macroblocks induced by transmission errors back to the encoder With these negative acknowledgements, the encoder can make the next frame having propagated errors by using forward dependency based on GOBs and MBs of the frame happening transmission errors. The encoder can precisely calculate and track the propagated errors by examining the backward motion dependency for each of four comer pixels in the current encoding frame until before-mentioned the next frame. The error-propagation effects can be terminated completely by INTRA refreshing the affected macroblocks. Such a fast algorithm further reduce the computation and memory requirements. The advantages of the low computation complexity and the low memory requirement are Particularly suitable for real-time implementation.

  • PDF

An Efficient Apeliodic Static Walking Algorithm for Quadrupecl Walking Machine (4족 보행 로봇의 효율적인 비주기 정적 보행 알고리즘)

  • 정경민;박윤창
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.42-42
    • /
    • 2000
  • This paper concerns an efficient aperiodic static crab walking algorithm for quadruped walking machine in rough terrain. In this algorithm, the requirements for forward stability margin and backward stability margin could be given differently in order to consider the slope of terrain and disturbances resulting from moving velocity. To restrict the searing regions for motion variables, such as moving distances until a leg is lifted or is placed, the standard leg transferring sequence is decided to be that of wave gaits. standard support pattern is also proposed that enables the quadruped to continue forward motion using the standard leg transferring sequence without falling into deadlock.

  • PDF

Bin Packing-Exchange Algorithm for 3-Partition Problem (3-분할 문제의 상자 채우기-교환 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.4
    • /
    • pp.95-102
    • /
    • 2022
  • This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

Iterative Phase estimation based on Turbo code (터보부호를 이용한 반복 위상 추정기법)

  • Ryu, Joong-Gon;Heo, Jun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.1-8
    • /
    • 2006
  • In this paper, we propose carrier phase synchronization algorithm which are base on turbo coded system for DVB-RCS. There have been two categories of phase estimator, single estimator outside turbo code decoder and multiple estimators inside turbo code decoder. In single estimator, we use the estimation algorithm that ML(Maximum Likelihood) and LMS(Least Mean Square), also three different soft decision methods are proposed. Multiple estimator apply PSP(Per Survivor Processing) algorithm additionally. We compared performance between single estimator and Multiple estimator in AWGN channel. We presented the two methods of PSP algorithm for performance elevation. First is the Bi-directional channel estimation and second is binding method.

Flux Optimization Using Genetic Algorithms in Membrane Bioreactor

  • Kim Jung-Mo;Park Chul-Hwan;Kim Seung-Wook;Kim Sang-Yong
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.6
    • /
    • pp.863-869
    • /
    • 2006
  • The behavior of submerged membrane bioreactor (SMBR) filtration systems utilizing rapid air backpulsing as a cleaning technique to remove reversible foulants was investigated using a genetic algorithm (GA). A customized genetic algorithm with suitable genetic operators was used to generate optimal time profiles. From experiments utilizing short and long periods of forward and reverse filtration, various experimental process parameters were determined. The GA indicated that the optimal values for the net flux fell between 263-270 LMH when the forward filtration time ($t_f$) was 30-37 s and the backward filtration time ($t_b$) was 0.19-0.27 s. The experimental data confirmed the optimal backpulse duration and frequency that maximized the net flux, which represented a four-fold improvement in 24-h backpulsing experiments compared with the absence of backpulsing. Consequently, the identification of a region of feasible parameters and nonlinear flux optimization were both successfully performed by the genetic algorithm, meaning the genetic algorithm-based optimization proved to be useful for solving SMBR flux optimization problems.

Matrix-Based Intelligent Inference Algorithm Based On the Extended AND-OR Graph

  • Lee, Kun-Chang;Cho, Hyung-Rae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.10a
    • /
    • pp.121-130
    • /
    • 1999
  • The objective of this paper is to apply Extended AND-OR Graph (EAOG)-related techniques to extract knowledge from a specific problem-domain and perform analysis in complicated decision making area. Expert systems use expertise about a specific domain as their primary source of solving problems belonging to that domain. However, such expertise is complicated as well as uncertain, because most knowledge is expressed in causal relationships between concepts or variables. Therefore, if expert systems can be used effectively to provide more intelligent support for decision making in complicated specific problems, it should be equipped with real-time inference mechanism. We develop two kinds of EAOG-driven inference mechanisms(1) EAOG-based forward chaining and (2) EAOG-based backward chaining. and The EAOG method processes the following three characteristics. 1. Real-time inference : The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation : All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference : Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.

  • PDF

Self-Tuning Control of SRM for Maximum Torque with Current and Shaft Position Feedback

  • Seo Jong-yun;Yang Hyong-yeol;Kim Kwang-Heon;Lim Young-Cheol;Cha Hyun-Rok;Jang Do-Hyun
    • Proceedings of the KIPE Conference
    • /
    • 2001.10a
    • /
    • pp.351-354
    • /
    • 2001
  • In this paper, we present self-tuning control of switched reluctance motor for maximum torque with phase current and shaft position sensor. Determination method of turn-on/off angle is realized by using self-tuning control method. During the sampling time, micro-controller checks the number of pulse from encoder and compare with the number of pre-checked pulse. After micro-controller calculates between two data, it moves forward or backward turn-off angle. When the turn-off angle is fixed optimal turn-off angle, the turn-on angle automatically moves forward or backward by a step using self-tuning control method. And then, optimal turn-off angle is searched once again. As such a repeating process, turn-on/off angle is moved automatically to obtain the maximum torque. The experimental results are presented to validate the self-tuning algorithm.

  • PDF

Design of Viterbi Decoder for IMT-2000 (IMT-2000용 비터비 복호기의 효율적인 설계)

  • 정인택;송상섭
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.1
    • /
    • pp.67-72
    • /
    • 2001
  • Convolutional code and turbo code are used in the forward and backward link of IMT-2000. In this research, we will be in consideration of Viterbi algorithm In this paper, we design Viterbi decoder with 3-bits soft decision and SMT for the convolutional code in the forward link and backward link of IMT-2000 system. The major parameters of 3-bits Viterbi decoder is determined by simulation to have identical performance with the 4-bit soft decision Viterbi decoder.

  • PDF