Beginning with Winograd's work on the arithmetic complexity of signal processing algorithms such as convolution, digital filtering, and the discrete Fourier transform, there has been much work devoted to the application of algebraic methods in the design and implementation of signal processing algorithms. More recently a theory of fast generalized signal transforms has been developed where techniques from computational group theory play a significant role. Various computer algebra systems have been utilized to implement these and other ideas. This session is devoted to exploring areas in signal processing for which algebra and algebraic computation may be beneficial.