Abstract

Computationally, composite matched filters (CMF) require logarithmically fewer operations than conventional matched filters.¹ In cases where the conventional matched filter is optimal, however, the corresponding CMF is not. The performance of the CMF can be enhanced by the addition of redundant computation for error correction purposes. We accomplish this with the use of linear error correcting block codes. The performance of these augmented CMFs is compared with that of the conventional matched filter both analytically and by simulation.

© 1986 Optical Society of America