Some results in nonnegativity constrained spectral factorization

Document Type

Article

Publication Date

10-15-1988

Abstract

This paper addresses the nonnegativity constrained spectral factorization problem. In the special case when the unknown object polynomial is symmetric, a recursive scheme is delineated for solving the problem. © 1988.

Identifier

0024091492 (Scopus)

Publication Title

Optics Communications

External Full Text Location

https://doi.org/10.1016/0030-4018(88)90394-X

ISSN

00304018

First Page

251

Last Page

256

Issue

4

Volume

68

Grant

ECS 86-96113

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS