• Title/Summary/Keyword: coefficient multiplication operators

Search Result 3, Processing Time 0.016 seconds

SPECTRAL PROPERTIES OF VOLTERRA-TYPE INTEGRAL OPERATORS ON FOCK-SOBOLEV SPACES

  • Mengestie, Tesfa
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.1801-1816
    • /
    • 2017
  • We study some spectral properties of Volterra-type integral operators $V_g$ and $I_g$ with holomorphic symbol g on the Fock-Sobolev spaces ${\mathcal{F}}^p_{{\psi}m}$. We showed that $V_g$ is bounded on ${\mathcal{F}}^p_{{\psi}m}$ if and only if g is a complex polynomial of degree not exceeding two, while compactness of $V_g$ is described by degree of g being not bigger than one. We also identified all those positive numbers p for which the operator $V_g$ belongs to the Schatten $S_p$ classes. Finally, we characterize the spectrum of $V_g$ in terms of a closed disk of radius twice the coefficient of the highest degree term in a polynomial expansion of g.

An Improved Non-CSD 2-Bit Recursive Common Subexpression Elimination Method to Implement FIR Filter

  • Kamal, Hassan;Lee, Joo-Hyun;Koo, Bon-Tae
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.695-703
    • /
    • 2011
  • The number of adders and critical paths in a multiplier block of a multiple constant multiplication based implementation of a finite impulse response (FIR) filter can be minimized through common subexpression elimination (CSE) techniques. A two-bit common subexpression (CS) can be located recursively in a noncanonic sign digit (CSD) representation of the filter coefficients. An efficient algorithm is presented in this paper to improve the elimination of a CS from the multiplier block of an FIR filter so that it can be realized with fewer adders and low logical depth as compared to the existing CSE methods in the literature. Vinod and others claimed the highest reduction in the number of logical operators (LOs) without increasing the logic depth (LD) requirement. Using the design examples given by Vinod and others, we compare the average reduction in LOs and LDs achieved by our algorithm. Our algorithm shows average LO improvements of 30.8%, 5.5%, and 22.5% with a comparative LD requirement over that of Vinod and others for three design examples. Improvement increases as the filter order increases, and for the highest filter order and lowest coefficient width, the LO improvements are 70.3%, 75.3%, and 72.2% for the three design examples.