论文信息 - A penalty approach to iterative algorithms for envelope constrained filter design

A penalty approach to iterative algorithms for envelope constrained filter design

The discrete-time envelope-constrained (EC) filtering problem can be formulated as a quadratic programming (QP) problem with affine inequality constraints. This QP problem is approximated by an unconstrained minimization problem with two parameters. Descent direction-based algorithms are applied to solve the unconstrained problem iteratively. It is shown that these algorithms converge.

[1] M. Reha Civanlar,et al. Optimal pulse shape design for digital communication systems by projections onto convex sets , 1995, IEEE Transactions on Communications.

[2] Wei Xing Zheng,et al. Recursive procedures for constrained optimisation problems and its application in signal processing , 1995 .

[3] Robin J. Evans,et al. An adaptive array processor with robustness and broad-band capabilities , 1984 .

[4] Robin J. Evans,et al. Envelope-constrained filters-I: Theory and applications , 1977, IEEE Trans. Inf. Theory.

[5] Robin J. Evans,et al. Envelope-constrained filters-II: Adaptive structures , 1977, IEEE Trans. Inf. Theory.

[6] Philip E. Gill,et al. Practical optimization , 1981 .

[7] Graham C. Goodwin,et al. Adaptive filtering prediction and control , 1984 .

[8] L. C. Wood,et al. Seismic signal processing , 1975, Proceedings of the IEEE.

[9] R W Lucky,et al. Principles of data communication , 1968 .

[10] J. R. Johnson,et al. Optimal mismatched filter design for radar ranging, detection, and resolution , 1971, IEEE Trans. Inf. Theory.