Block Implementation of Digital Filters

  • Robert King
  • Majid Ahmadi
  • Raouf Gorgui-Naguib
  • Alan Kwabwe
  • Mahmood Azimi-Sadjadi


A crucial problem occurs when attempting to filter an image of large size, caused by computational limitations in processing time and storage capacity. In particular, it is possible to obtain computational gain when operating on a large image by an FIR filter whose impulse response size is much smaller than the region of support of the input image. (The region of support is the set of values on which the image is defined.) To achieve this, a technique known as sectioning may be used, whereby the image is broken up into overlapping sections of size of the same order as the impulse response of the filter, and the filtering operation performed on the sections in turn. Breaking the image into blocks in this manner facilitates the implementation of the algorithm on a parallel processor. There are two sectioning procedures, known as the “select-save” and “overlap-add” methods,(1–3) that may be used to eliminate any wrap-around error caused by the circular convolution inherent in the use of FFT algorithms.


Impulse Response Block Size Digital Filter Block Processing Circular Convolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. R. Hunt, Minimization of the computation time by using the technique of sectioning for digital filtering of pictures, IEEE Trans. Comput. C-21, 1219–1222 (1972).CrossRefGoogle Scholar
  2. 2.
    R. E. Twogood, M. P. Ekstrom, and S. K. Mitra, Optimal sectioning procedure for the implementation of 2-D digital filters, IEEE Trans. Circuits Syst. CAS-25, 260–269 (1978).CrossRefGoogle Scholar
  3. 3.
    M. R. Azimi-Sadjadi, R. A. King, and S. K. Pal, Optimisation technique for the implementation of two-dimensional recursive digital filters by sectioning, IEE Proc. 129, Part F, No. 5, 373–380 (1982).Google Scholar
  4. 4.
    M. R. Azimi-Sadjadi and R. A. King, Two-dimensional block processors—Structures and implementations, IEEE Trans. Circuits Syst. CAS-33, 42–50 (1986).CrossRefGoogle Scholar
  5. 5.
    S. K. Mitra and R. Gnanasekaran, Block implementation of two-dimensional digital filters, J. Franklin Inst. 316, 299–316 (1983).zbMATHCrossRefGoogle Scholar
  6. 6.
    D. E. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ (1984).zbMATHGoogle Scholar
  7. 7.
    C. S. Burrus, Block implementation of digital filters, IEEE Trans. Circuit Theory CT-18, 697–701 (1971).CrossRefGoogle Scholar
  8. 8.
    C. S. Burrus, Block realization of digital filters, IEEE Trans. Audio Electroacoust. AU-20, 230–235 (1972).MathSciNetCrossRefGoogle Scholar
  9. 9.
    C. W. Barnes and S. Shinnaka, Block shift invariance and block implementation of discrete-time filters, IEEE Trans. Circuits Syst. CAS-27, 667–672 (1980).MathSciNetCrossRefGoogle Scholar
  10. 10.
    M. R. Azimi-Sadjadi, Block Implementation of Two-Dimensional Digital Filters, PhD Thesis, University of London (1981).Google Scholar
  11. 11.
    H. H. Lu, E. A. Lee, and D. G. Messerschmitt, Fast recursive filtering with multiple slow processing elements, IEEE Trans. Circuits Syst. CAS-32, 1119–1129 (1985).Google Scholar
  12. 12.
    M. R. Azimi-Sadjadi and P. W. Wong, Two-dimensional block Kaiman filtering for image restoration, IEEE Trans. Acoust., Speech, Signal Process. ASSP-35, 1736–1749 (1987).CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1989

Authors and Affiliations

  • Robert King
    • 1
  • Majid Ahmadi
    • 2
  • Raouf Gorgui-Naguib
    • 3
  • Alan Kwabwe
    • 4
  • Mahmood Azimi-Sadjadi
    • 5
  1. 1.Imperial CollegeLondonEngland
  2. 2.University of WindsorWindsorCanada
  3. 3.University of Newcastle upon TyneNewcastle upon TyneEngland
  4. 4.Imperial College and Bankers Trust CompanyLondonEngland
  5. 5.Colorado State UniversityFort CollinsUSA

Personalised recommendations