Share Email Print
cover

Proceedings Paper

Kernel synthesis for generalized time-frequency distributions using the method of projections onto convex sets
Author(s): Seho Oh; Robert Jackson Marks; Les E. Atlas; James W. Pitton
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The kernel in Cohen's generalized time frequency representation (GTFR) requires is chosen in accordance to certain desired performance attributes. Properties of the kernel are typically expressed as constraints. We establish that many commonly used constraints are convex in the sense that all allowable kernels satisfying a given constraint form a convex set. Thus, for a given set of constraints, the kernel can be designed by alternately projecting among these sets. If there exists a nonempty intersection among the constraint sets, then the theory of projeciion onto convex seis ( POCS) guarantees convergence to a point in the intersection. If the constraints can be partitioned into two sets, each with a nonempty intersection, then POCS guarantees convergence to a kernel that satisfies the inconsistent constraints with minimum mean square error.

Paper Details

Date Published: 1 November 1990
PDF: 11 pages
Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); doi: 10.1117/12.23477
Show Author Affiliations
Seho Oh, Univ. of Washington (United States)
Robert Jackson Marks, Univ. of Washington (United States)
Les E. Atlas, Univ. of Washington (United States)
James W. Pitton, Univ. of Washington (United States)


Published in SPIE Proceedings Vol. 1348:
Advanced Signal Processing Algorithms, Architectures, and Implementations
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top