• Title/Summary/Keyword: Zeros

Search Result 368, Processing Time 0.032 seconds

Mutual Detectability and System Enlargement of Detection Filters: An Invariant Zero Approach

  • Kim, Yong-Min;Park, Jae-Hong
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.6
    • /
    • pp.769-774
    • /
    • 2006
  • In this paper, we discuss the problem of non-mutual detectability using the invariant zero. We propose a representation method for excess spaces by linear equation based on the Rosenbrock system matrix. As an alternative to the system enlargement method proposed by White[1], we propose an appropriate form of an enlarged system to make a set of faults mutually detectable by assigning sufficient geometric multiplicity of invariant zeros. We show the equivalence between the two methods and a necessary condition for the system enlargement in terms of the geometric and algebraic multiplicities of invariant zeros.

A Neural Network Based on Stochastic Computation using the Ratio of the Number of Ones and Zeros in the Pulse Stream (펄스열에서 1인 펄스수와 0인 펄스수의 비를 이용하여 확률연산을 하는 신경회로망)

  • 민승재;채수익
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.211-218
    • /
    • 1994
  • Stochastic computation employs random pulse streams to represent numbers. In this paper, we study a new method to implement the number system which uses the ratio of the numbers of ones and zeros in the pulse streams. In this number system. if P is the probability that a pulse is one in a pulse stream then the number X represented by the pulse stream is defined as P/(1-P). We propose circuits to implement the basic operations such as addition multiplication and sigmoid function with this number system and examine the error characteristics of such operations in stochastic computation. We also propose a neuron model and derive a learning algorithm based on backpropagation for the 3-layered feedforward neural networks. We apply this learning algorithm to a digit recognition problem. To analyze the results, we discuss the errors due to the variance of the random pulse streams and the quantization noise of finite length register.

  • PDF

A Design of Miniaturized LTCC Bandpass Filter with Two-Transmission Zeros Based on Network Analysis (Network 해석에 기반을 둔 두 개의 전송 영점을 갖는 소형화된 LTCC 대역 통과 필터 설계)

  • Kim, Yu-Seon;Lim, Yeong-Seog
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2005.11a
    • /
    • pp.17-22
    • /
    • 2005
  • This paper presents a improvement equivalent circuit model for Miniaturized LTCC bandpass filter with two transmission zeros using feed-back capacitor. The bandpass filter equivalent circuit is evaluated by parallel network analysis. Besides, the filter is modeled by proposed passive element modeling algorithm in previous work. Compared to the equivalent circuit of established paper that is configured by excepted capacitance between ground plate and signal plate, this model can include that. The result, the LTCC bandpass filter reduce layers and the size is more smaller.

  • PDF

Low Power Transmission Technique for Single-Carrier Modulation with Frequency Domain Equalization (주파수 영역 등화기를 사용하는 단일 반송파 전송 시스템을 위한 저 전력 전송 기법)

  • Jung, Hyeok Koo
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.4
    • /
    • pp.247-251
    • /
    • 2017
  • This paper proposes a low power transmission technique for single-carrier modulation with frequency domain equalization. As time domain signals and frequency domain signals have unique corresponding functions, inserting zeros after each symbol causes a repetition in other domain, so maximal ratio combining technique using repetitive transmission can be applied in the frequency domain. In this paper, we configure transmit signals to insert zeros after each symbols for single-carrier modulation with frequency domain equalization and maximal ratio receive combining block in the receiver structures, propose a structure for transmitter and receiver and show that its performance is better than the traditional algorithm by simulations.

SOME GEOMERTIC SOLVABILITY THEOREMS IN TOPOLOGICAL VECTOR SPACES

  • Ben-El-Mechaiekh, H.;Isac, G.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.273-285
    • /
    • 1997
  • The aim of this paper is to present theorems on the exitence of zeros for mappings defined on convex subsets of topological vector spaces with values in a vector space. In addition to natural assumptions of continuity, convexity, and compactness, the mappings are subject to some geometric conditions. In the first theorem, the mapping satisfies a "Darboux-type" property expressed in terms of an auxiliary numerical function. Typically, this functions is, in this case, related to an order structure on the target space. We derive an existence theorem for "obtuse" quasiconvex mappings with values in an ordered vector space. In the second theorem, we prove the existence of a "common zero" for an arbitrary (not necessarily countable) family of mappings satisfying a general "inwardness" condition againg expressed in terms of numerical functions (these numerical functions could be duality pairings (more generally, bilinear forms)). Our inwardness condition encompasses classical inwardness conditions of Leray-Schauder, Altman, or Bergman-Halpern types.

  • PDF

ZERO-DENSITY ESTIMATES FOR EPSTEIN ZETA FUNCTIONS OF CLASS NUMBERS 2 OR 3

  • Lee, Yoonbok
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.479-491
    • /
    • 2017
  • We investigate the zeros of Epstein zeta functions associated with positive definite quadratic forms with rational coefficients in the vertical strip ${\sigma}_1$ < ${\Re}s$ < ${\sigma}_2$, where 1/2 < ${\sigma}_1$ < ${\sigma}_2$ < 1. When the class number h of the quadratic form is bigger than 1, Voronin gave a lower bound and Lee gave an asymptotic formula for the number of zeros. Recently Gonek and Lee improved their results by providing a new upper bound for the error term when h > 3. In this paper, we consider the cases h = 2, 3 and provide an upper bound for the error term, smaller than the one for the case h > 3.

STABILITY OF ZEROS OF POWER SERIES EQUATIONS

  • Wang, Zhihua;Dong, Xiuming;Rassias, Themistocles M.;Jung, Soon-Mo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.1
    • /
    • pp.77-82
    • /
    • 2014
  • We prove that if ${\mid}a_1{\mid}$ is large and ${\mid}a_0{\mid}$ is small enough, then every approximate zero of power series equation ${\sum}^{\infty}_{n=0}a_nx^n$=0 can be approximated by a true zero within a good error bound. Further, we obtain Hyers-Ulam stability of zeros of the polynomial equation of degree n, $a_nz^n$ + $a_{n-1}z^{n-1}$ + ${\cdots}$ + $a_1z$ + $a_0$ = 0 for a given integer n > 1.