Answers are grounded in this paper and cite their sources.
An algorithm is described which finds optimum transmitter and receiver weights to maximize clutter suppression in a predetermined clutter region when using burst waveforms. It is assumed that the transmitter weights can only take on values from a finite set. This optimization problem is solved using a branch and bound algorithm. An example is given which shows the improvement in clutter suppression when this new design procedure is used as compared to a simpler nonoptimal procedure.
No takes yet. Share an insight, caveat, or question.
Arthur Cohen (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: