Multiple Window Decomposition of Time-Frequency Kernels Using A Penalty Function for Suppressed Sidelobes

This paper presents multiple windows with suppressed sidelobes that approximate a time-frequency kernel. The multiple windows are given from the eigenvalue decomposition of the time-lag kernel. By using a penalty matrix both in time- and frequency domain and solving a generalized eigenvalue problem, the multiple windows are achieved. Examples are given and the resulting sidelobe suppression and the number of windows needed are analysed