Rank-deficient spectral factorization and wavelets completion problem

L. Ephremidze, I. Spitkovsky, E. Lagvilava

Research output: Contribution to journalArticlepeer-review


A simple constructive proof of polynomial matrix spectral factorization theorem is presented in the rank-deficient case. It is then used to provide an elementary solution to the wavelets completion problem.

Original languageEnglish (US)
Article number1550013
JournalInternational Journal of Wavelets, Multiresolution and Information Processing
Issue number3
StatePublished - May 27 2015


  • Fejér-Riesz lemma
  • Matrix spectral factorization
  • paraunitary matrix polynomials
  • wavelets completion problem

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Applied Mathematics


Dive into the research topics of 'Rank-deficient spectral factorization and wavelets completion problem'. Together they form a unique fingerprint.

Cite this