Block digital filtering has been suggested to reduce the computational complexity and to increase the parallelism of computation in digital filtering systems. In this letter, a fast algorithm for optimal design of block digital filters (BDFs) is developed. This algorithm, based on circulant, Toeplitz and shift cyclic matrices, not only reduces the computational complexity of the design process but also decreases the memory requirements.