Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

In the envelope-constrained filtering problem, one attempts to optimize a filter's impulse response subject to the constraint that its response to a specified input lies within a prescribed envelope. This constrained optimization problem is reduced to an unconstrained dual problem with a nondifferentiable cost and then solved using a steepest ascent algorithm based on directional differentials. The resulting technique provides a versatile alternative to the least-squares methods that are commonly applied to such problems. Applications to a wide variety of signal processing problems in areas such as communication channel equalization, television transmission, radar and sonar detection, filter and antenna design, seismology, and ultrasonic imaging are discussed, and some numerical results are presented. © 1977, IEEE. All rights reserved.

Original publication

DOI

10.1109/TIT.1977.1055752

Type

Journal article

Journal

IEEE Transactions on Information Theory

Publication Date

01/01/1977

Volume

23

Pages

421 - 434