Abstract-For two-dimensional (2-D) digital filters implemented by a block recursive equation, explicit relations between their frequency characteristics and those of scalar filter are obtained. Specifically, these include the relation between the discrete-time Fourier transform (DTFT) of the block recursive equation and that of the scalar 2-D difference equation, and the relation between the block matrix transfer function of the block processor and the scalar transfer function. These relations that are independent of the type of realization of the block processor have been obtained using the eigenvalue properties of a special type of circulant matrix introduced in this correspondence.
I. INTRODUCTIONThe idea of processing sequences in blocks arose in connection with the desire to accomplish recursive filtering operations using fast transform techniques [l]. Later, it was found that the block processing also exhibits several other prominent benefits such as reduced quantization effects and increased data throughput rate when implemented using array processors. Mitra and Gnanasekaran In this correspondence, new explicit relationships between the frequency characteristics of the 2-D block implemented system and those of the original scalar system are derived. Specifically, these include the relation between the DTFT of the block recursive equation and that of the 2-D difference equation; and the relation between the block matrix transfer function and the original transfer function. For a 2-D block implemented nonrecursive digital filter, these relations reduce to the DFT operations. The proposed method exploits the eigenvalue properties of a special type of block circulant matrix introduced here and their correspondence with the DFT of a finite sequence defined on the primitive roots of a number other than unity.