• DocumentCode
    1573226
  • Title

    Converting a set into a minimum-phase sequence

  • Author

    Rusu, Corneliu ; Astola, Jaakko

  • Author_Institution
    Fac. of Electron., Telecomm. & Inf. Tech., Tech. Univ. of Cluj-Napoca, Cluj-Napoca, Romania
  • fYear
    2009
  • Firstpage
    870
  • Lastpage
    873
  • Abstract
    In this paper we discuss whether a given finite set of real or complex numbers can be ordered such that the derived sequence is minimum-phase. We characterize several types of sets that can be ordered in minimum-phase sequences. These sets do not span the sets of all real or complex sequences of finite length. To find the minimum-phase sequence from a given set may be computational expensive and we propose an alternative to reduce the number of operations using a list of appropriate permutations.
  • Keywords
    sequences; set theory; complex sequences; minimum-phase sequence; minimum-phase sequences; real sequences; sets; Clocks; Fourier transforms; Frequency domain analysis; Information retrieval; Iterative algorithms; Polynomials; Reconstruction algorithms; Signal processing; Telecommunications;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuit Theory and Design, 2009. ECCTD 2009. European Conference on
  • Conference_Location
    Antalya
  • Print_ISBN
    978-1-4244-3896-9
  • Electronic_ISBN
    978-1-4244-3896-9
  • Type

    conf

  • DOI
    10.1109/ECCTD.2009.5275119
  • Filename
    5275119