This paper treats the problem of realizing high speed 2-D denominator separable digital filters. Partitioning a 2-D data plane into square blocks, filtering proceeds block by block sequentially. A fast intra-block parallel processing method was developed using block state space realization, which allows simultaneous computation of all the next block states and the outputs of one block. As the block state matrix of the filter has high sparsity, the rows and columns are interchanged respectively to reduce the matrix size. The filter is implemented by a multiprocessor system, where for each matrix's row one processor is assigned to perform the row-column vector multiplication. All processors wirk in synchronized fashion. Number of processors of this implementation are equal to the number of rows of the reduced state matrix and throughput is raised with block lengths.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tsuyosi TAKEBE, Masatoshi MURAKAMI, Koji HATANAKA, Shinya KOBAYASHI, "Multiprocessor Implementation of 2-D Denominator-Separable Digital Filters Using Block Processing" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 7, pp. 846-851, July 1992, doi: .
Abstract: This paper treats the problem of realizing high speed 2-D denominator separable digital filters. Partitioning a 2-D data plane into square blocks, filtering proceeds block by block sequentially. A fast intra-block parallel processing method was developed using block state space realization, which allows simultaneous computation of all the next block states and the outputs of one block. As the block state matrix of the filter has high sparsity, the rows and columns are interchanged respectively to reduce the matrix size. The filter is implemented by a multiprocessor system, where for each matrix's row one processor is assigned to perform the row-column vector multiplication. All processors wirk in synchronized fashion. Number of processors of this implementation are equal to the number of rows of the reduced state matrix and throughput is raised with block lengths.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_7_846/_p
Copy
@ARTICLE{e75-a_7_846,
author={Tsuyosi TAKEBE, Masatoshi MURAKAMI, Koji HATANAKA, Shinya KOBAYASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multiprocessor Implementation of 2-D Denominator-Separable Digital Filters Using Block Processing},
year={1992},
volume={E75-A},
number={7},
pages={846-851},
abstract={This paper treats the problem of realizing high speed 2-D denominator separable digital filters. Partitioning a 2-D data plane into square blocks, filtering proceeds block by block sequentially. A fast intra-block parallel processing method was developed using block state space realization, which allows simultaneous computation of all the next block states and the outputs of one block. As the block state matrix of the filter has high sparsity, the rows and columns are interchanged respectively to reduce the matrix size. The filter is implemented by a multiprocessor system, where for each matrix's row one processor is assigned to perform the row-column vector multiplication. All processors wirk in synchronized fashion. Number of processors of this implementation are equal to the number of rows of the reduced state matrix and throughput is raised with block lengths.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Multiprocessor Implementation of 2-D Denominator-Separable Digital Filters Using Block Processing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 846
EP - 851
AU - Tsuyosi TAKEBE
AU - Masatoshi MURAKAMI
AU - Koji HATANAKA
AU - Shinya KOBAYASHI
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 1992
AB - This paper treats the problem of realizing high speed 2-D denominator separable digital filters. Partitioning a 2-D data plane into square blocks, filtering proceeds block by block sequentially. A fast intra-block parallel processing method was developed using block state space realization, which allows simultaneous computation of all the next block states and the outputs of one block. As the block state matrix of the filter has high sparsity, the rows and columns are interchanged respectively to reduce the matrix size. The filter is implemented by a multiprocessor system, where for each matrix's row one processor is assigned to perform the row-column vector multiplication. All processors wirk in synchronized fashion. Number of processors of this implementation are equal to the number of rows of the reduced state matrix and throughput is raised with block lengths.
ER -