On computing and implementing the running bispectra

The paper extends recursion to bispectrum estimation problems and presents the systolic array implementation of the recursive higher order spectrum in which the bispectrum estimate is updated every data sample. Forward and reverse sequence running Fourier transforms are first systolically realized. The results are then used to drive a second systolic array, whose outputs represent the FT of the data third-order moment. The proposed systolic arrays have no global communications with a number of processing elements independent of the size of the employed 2D lag window.<
>