Signal Selection for Robust Matched Filtering

The optimum signal selection problem under a power constraint for minimax robust discrete-time finite-length matched filtering is studied. The classical solution, which is to choose the signal as a minimum-eigenvalue eigenvector of the noise covariance matrix, is generalized to cases in which the transmitted signal is subject to channel distortion modeled by mean-square, maximum-absolute, and mean-absolute distortion uncertainty classes.

[1]  Uzi Padan,et al.  Adaptive digital matched filters , 1982, IEEE Trans. Inf. Theory.

[2]  Thomas L. Grettenberg,et al.  Signal selection in communication and radar systems , 1963, IEEE Trans. Inf. Theory.

[3]  G.L. Turin,et al.  An introduction to digitial matched filters , 1976, Proceedings of the IEEE.

[4]  H. Vincent Poor,et al.  Robust matched filters , 1983, IEEE Trans. Inf. Theory.

[5]  H. J. Scudder,et al.  Probability of error of some adaptive pattern-recognition machines , 1965, IEEE Trans. Inf. Theory.

[6]  George L. Turin,et al.  An introduction to digital matched filters , 1976 .

[7]  Sergio Verdu,et al.  Minimax Robust Discrete-Time Matched Filters , 1983, IEEE Trans. Commun..