• DocumentCode
    3006461
  • Title

    Moving average separation

  • Author

    Feyh, German ; Mullis, Clifford T.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
  • fYear
    1988
  • fDate
    11-14 Apr 1988
  • Firstpage
    2280
  • Abstract
    A real symmetric polynomial Q(z) can be factored into the product A(z)A(z-1) if Q( z) is nonnegative on the unit circle. The authors pose a constrained minimization problem that results in the correct factorization in this case and gives an approximation to Q(z) if Q(z) does not satisfy the nonnegativity condition
  • Keywords
    convex programming; minimisation; polynomials; constrained minimization problem; convex programming; factorization; moving average separation; nonnegativity condition; optimisation; real symmetric polynomial; Autocorrelation; Contracts; Digital signal processing; Polynomials; Signal processing algorithms; Student members; Symmetric matrices; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
  • Conference_Location
    New York, NY
  • ISSN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.1988.197092
  • Filename
    197092
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3006461