EFFICIENT TRANSFORMS FOR MULTIDIMENSIONAL CONVOLUTIONS

被引：19

作者：

ARAMBEPOLA, B

RAYNER, PJW

机构：

[1] Department of Engineering, Cambridge University, Cambridge CB2 1PZ, Trumpington Street

来源：

ELECTRONICS LETTERS | 1979年 / 15卷 / 06期

关键词：

Picture processing; Transforms;

D O I：

10.1049/el:19790132

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A discrete transform is described for the computation of multidimensional convolutions often encountered in image-and array-processing applications. The transform is free of multiplications in all dimensions but one, and has all advantages claimed by the d.f.t. methods. © 1979, The Institution of Electrical Engineers. All rights reserved.

引用

页码：189 / 190

页数：2

共 5 条

[1] FAST CONVOLUTION USING FERMAT NUMBER TRANSFORMS WITH APPLICATIONS TO DIGITAL FILTERING [J].

AGARWAL, RC ;

BURRUS, CS .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1974, SP22 (02) :87-97

[2]

ARAMBEPOLA B, UNPUBLISHED

[3]

BIRKOFF G, 1969, SURVEY MODERN ALGEBR

[4]

Lang S., 1965, Algebra

[5] COMPUTATION OF CONVOLUTIONS AND DISCRETE FOURIER-TRANSFORMS BY POLYNOMIAL TRANSFORMS [J].

NUSSBAUMER, HJ ;

QUANDALLE, P .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1978, 22 (02) :134-144

← 1 →