• Title/Summary/Keyword: sum-product algorithm

Search Result 61, Processing Time 0.022 seconds

Design of Fuzzy PD+I Controller Based on PID Controller

  • Oh, Sea-June;Yoo, Heui-Han;Lee, Yun-Hyung;So, Myung-Ok
    • Journal of Navigation and Port Research
    • /
    • v.34 no.2
    • /
    • pp.117-122
    • /
    • 2010
  • Since fuzzy controllers are nonlinear, it is more difficult to set the controller gains and to analyse the stability compared to conventional PID controllers. This paper proposes a fuzzy PD+I controller for tracking control which uses a linear fuzzy inference(product-sum-gravity) method based on a conventional linear PID controller. In this scheme the fuzzy PD+I controller works similar to the control performance as the linear PD plus I(PD+I) controller. Thus it is possible to analyse and design an fuzzy PD+I controller for given systems based on a linear fuzzy PD controller. The scaling factors tuning scheme, another topic of fuzzy controller design procedure, is also introduced in order to fine performance of the fuzzy PD+I controller. The scaling factors are adjusted by a real-coded genetic algorithm(RCGA) in off-line. The simulation results show the effectiveness of the proposed fuzzy PD+I controller for tracking control problems by comparing with the conventional PID controllers.

Design Optimization of Axial Flow Fan Using Genetic Algorithm (유전자 알고리즘을 이용한 축류 송풍기 설계최적화)

  • Lee, Sang-Hwan;Ahn, Cheol-O
    • The KSFM Journal of Fluid Machinery
    • /
    • v.7 no.2 s.23
    • /
    • pp.7-13
    • /
    • 2004
  • In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution agree well to the designer's weighting values, we proposed new multiobjective function which was the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach is effective for the case that the quality of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.

Design Optimization of Axial Flow Fan Using Genetic Algorithm (유전자 알고리즘을 이용한 축류 송풍기 설계최적화)

  • Yoo, In-Tae;Ahn, Cheol-O;Lee, Sang-Hwan
    • 유체기계공업학회:학술대회논문집
    • /
    • 2003.12a
    • /
    • pp.397-403
    • /
    • 2003
  • In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution well agree to the designer's weighting values, we proposed new multiobjective function which is the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach will be effective for the case that the qualify of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.

  • PDF

Fast Matching Pursuit based on Vector Length Comparison (벡터길이 비교를 이용한 고속 Matching Pursuit)

  • O, Seok-Byeong;Jeon, Byeong-U
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.129-137
    • /
    • 2001
  • Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

  • PDF

Optimal Synthesis of Binary Neural Network using NETLA (NETLA를 이용한 이진 신경회로망의 최적합성)

  • 정종원;성상규;지석준;최우진;이준탁
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2002.05a
    • /
    • pp.273-277
    • /
    • 2002
  • This paper describes an optimal synthesis method of binary neural network(BNN) for an approximation problem of a circular region and synthetic image having four class using a newly proposed learning algorithm. Our object is to minimize the number of connections and neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm(NETLA) based on the multilayer BNN. The synthesis method in the NETLA is based on the extension principle of Expanded and Truncated Learning (ETL) learning algorithm using the multilayer perceptron and is based on Expanded Sum of Product (ESP) as one of the boolean expression techniques. The number of the required neurons in hidden layer can be reduced and fasted for learning pattern recognition.. The superiority of this NETLA to other algorithms was proved by simulation.

  • PDF

Vehicular Cooperative Navigation Based on H-SPAWN Using GNSS, Vision, and Radar Sensors (GNSS, 비전 및 레이더를 이용한 H-SPAWN 알고리즘 기반 자동차 협력 항법시스템)

  • Ko, Hyunwoo;Kong, Seung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.11
    • /
    • pp.2252-2260
    • /
    • 2015
  • In this paper, we propose a vehicular cooperative navigation system using GNSS, vision sensor and radar sensor that are frequently used in mass-produced cars. The proposed cooperative vehicular navigation system is a variant of the Hybrid-Sum Product Algorithm over Wireless Network (H-SPAWN), where we use vision and radar sensors instead of radio ranging(i.e.,UWB). The performance is compared and analyzed with respect to the sensors, especially the position estimation error decreased about fifty percent when using radar compared to vision and radio ranging. In conclusion, the proposed system with these popular sensors can improve position accuracy compared to conventional cooperative navigation system(i.e.,H-SPAWN) and decrease implementation costs.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Introduction and Performance Analysis of Approximate Message Passing (AMP) for Compressed Sensing Signal Recovery (압축 센싱 신호 복구를 위한 AMP(Approximate Message Passing) 알고리즘 소개 및 성능 분석)

  • Baek, Hyeong-Ho;Kang, Jae-Wook;Kim, Ki-Sun;Lee, Heung-No
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.11
    • /
    • pp.1029-1043
    • /
    • 2013
  • We introduce Approximate Message Passing (AMP) algorithm which is one of the efficient recovery algorithms in Compressive Sensing (CS) area. Recently, AMP algorithm has gained a lot of attention due to its good performance and yet simple structure. This paper provides not only a understanding of the AMP algorithm but its relationship with a classical (Sum-Product) Message Passing (MP) algorithm. Numerical experiments show that the AMP algorithm outperforms the classical MP algorithms in terms of time and phase transition.

STUDY ON THE ELECTRON GENERATION BY A MICRO-CHANNEL PLATE BASED ON EGS4 CALCULATIONS AND THE UNIVERSAL YIELD CURVE

  • Moon, B.S.;Han, S.H.;Kim, Y.K.;Chung, C.E.
    • Journal of Radiation Protection and Research
    • /
    • v.26 no.3
    • /
    • pp.177-181
    • /
    • 2001
  • The conversion efficiency of a cesium iodine coated micro-channel plate is studied. We use the EGS4 code to transport photons and generated electrons until their energies become less than 1keV and 10keV respectively. Among the generated electrons, the emission from the secondary electrons located within the escape depth of 56nm from the photo-converter boundary is estimated by integrating the product of the secondary electrons with a probability depending only on their geometric locations. The secondary electron emission from the generated electrons of energy higher than 100eV is estimated by the 'universal yield curve'. The sum of these provides an estimate for the secondary electron yield and we show that results of applying this algorithm agree with known experimental results. Using this algorithm, we computed secondary electron emissions from a micro-channel plate used in a gas electron multiplier detector that is currently being developed at Korea Atomic Energy Research Institute.

  • PDF

A Study on the Detection of Surface Defect Using Image Modeling (영상모델링을 이용한 표면결함검출에 관한 연구)

  • 목종수;사승윤;김광래;유봉환
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.444-449
    • /
    • 1996
  • The semiconductor, which is precision product, requires many inspection processes. The surface conditions of the semiconductor chip affect on the functions of the semiconductors. The defects of the chip surface are cracks or voids. As general inspection method requires many inspection procedure, the inspection system which searches immediately and precisely the defects of the semiconductor chip surface is required. We suggest the detection algorithm for inspecting the surface defects of the semiconductor surface. The proposed algorithm first regards the semiconductor surface as random texture and point spread function, and secondly presents the character of texture by linear estimation theorem. This paper assumes that the gray level of each pixel of an image is estimated from a weighted sum of gray levels of its neighbor pixels by linear estimation theorem. The weight coefficients are determined so that the mean square error is minimized. The obtained estimation window(two-dimensional estimation window) characterizes the surface texture of semiconductor and is used to discriminate the defects of semiconductor surface.

  • PDF