Fast Algorithms for One- and Two-Dimensional Discrete Cosine Transforms

International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale d’Analyse Numérique - Multivariate Approximation and Interpolation ◽

10.1007/978-3-0348-5685-0_22 ◽

1990 ◽

pp. 285-298

Author(s):

G. Steidl ◽

M. Tasche

Keyword(s):

Fast Algorithms ◽

Two Dimensional ◽

Discrete Cosine Transforms

Download Full-text

Fast algorithms for computing one and two dimensional convolution in integer polynomial rings

1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings ◽

10.1109/icassp.1996.545852 ◽

2002 ◽

Author(s):

H.K. Garg ◽

C. Chung Ko

Keyword(s):

Fast Algorithms ◽

Polynomial Rings ◽

Two Dimensional ◽

Integer Polynomial

Download Full-text

Fast Algorithms on Center Location of Two Dimensional Gaussian Distribution Spot

Acta Optica Sinica ◽

10.3788/aos201232.0512002 ◽

2012 ◽

Vol 32 (5) ◽

pp. 0512002 ◽

Cited By ~ 2

Author(s):

冯新星 Feng Xinxing ◽

张丽艳 Zhang Liyan ◽

叶南 Ye Nan ◽

杨博文 Yang Bowen

Keyword(s):

Gaussian Distribution ◽

Fast Algorithms ◽

Two Dimensional ◽

Center Location

Download Full-text

Fast algorithms for bispectral reconstruction of two-dimensional signals

10.1109/icassp.1990.116060 ◽

2002 ◽

Cited By ~ 1

Author(s):

S.A. Dianat ◽

M.R. Raghuveer

Keyword(s):

Fast Algorithms ◽

Two Dimensional

Download Full-text

An efficient algorithm for computing two-dimensional discrete cosine transforms

1991., IEEE International Sympoisum on Circuits and Systems ◽

10.1109/iscas.1991.176357 ◽

2002 ◽

Cited By ~ 1

Author(s):

N. Ta ◽

Y. Attikiouzel ◽

G. Crebbin

Keyword(s):

Efficient Algorithm ◽

Two Dimensional ◽

Discrete Cosine Transforms

Download Full-text

Discrete fast algorithms for two-dimensional linear prediction on a polar raster

IEEE Transactions on Signal Processing ◽

10.1109/78.139250 ◽

1992 ◽

Vol 40 (6) ◽

pp. 1480-1489 ◽

Cited By ~ 2

Author(s):

W.-H. Fang ◽

A.E. Yagle

Keyword(s):

Linear Prediction ◽

Fast Algorithms ◽

Two Dimensional

Download Full-text

Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

Circuits Systems and Signal Processing ◽

10.1007/bf01183180 ◽

1997 ◽

Vol 16 (1) ◽

pp. 121-139

Author(s):

H. Krishna Garg ◽

C. C. Ko

Keyword(s):

Fast Algorithms ◽

Polynomial Rings ◽

Two Dimensional ◽

Integer Polynomial

Download Full-text

Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

Electronics Letters ◽

10.1049/el:19910053 ◽

1991 ◽

Vol 27 (1) ◽

pp. 82-84 ◽

Cited By ~ 2

Author(s):

N. Ta ◽

Y. Attikiouzel ◽

G. Crebbin

Keyword(s):

Radon Transform ◽

Two Dimensional ◽

Fast Computation ◽

Discrete Cosine Transforms ◽

Discrete Radon Transform

Download Full-text

Ground States of Two-Dimensional Ising Spin Glasses: Fast Algorithms, Recent Developments and a Ferromagnet-Spin Glass Mixture

Journal of Statistical Physics ◽

10.1007/s10955-011-0272-1 ◽

2011 ◽

Vol 144 (3) ◽

pp. 519-540 ◽

Cited By ~ 13

Author(s):

Alexander K. Hartmann

Keyword(s):

Spin Glass ◽

Spin Glasses ◽

Ground States ◽

Fast Algorithms ◽

Two Dimensional ◽

Ising Spin ◽

Recent Developments ◽

Glass Mixture

Download Full-text

A Fast Algorithm Based on Discrete Cosine Transform(DCT)

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.1488 ◽

2014 ◽

Vol 644-650 ◽

pp. 1488-1493

Author(s):

Xiao Hui Huang ◽

Wei Zhi Huang ◽

Ke Yuan ◽

Kun He

Keyword(s):

Discrete Cosine Transform ◽

Fast Algorithm ◽

Fast Algorithms ◽

Two Dimensional ◽

Cosine Transform ◽

One Dimensional

Traditional fast algorithms for DCT are aimed at sequences with 2N length and it is math-intensive for sequences which contain odd numbers of elements. This paper analyzes the redundant calculation of cosine transform of non-2N-point sequences and put forward a fast algorithm for one-dimensional DCT with odd length. Also, according to the separability of two-dimensional DCT, we can generalize the fast algorithm for one-dimensional DCT to two-dimensional DCT to implement and complete the fast algorithm. The simulation suggests that this algorithm improves the speed of calculation.

Download Full-text

One- and two-dimensional algorithms for length 15 and 30 discrete cosine transforms

IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing ◽

10.1109/82.486464 ◽

1996 ◽

Vol 43 (2) ◽

pp. 149-153 ◽

Cited By ~ 2

Author(s):

Zhongde Wang ◽

G.A. Jullien ◽

W.C. Miller

Keyword(s):

Two Dimensional ◽

Discrete Cosine Transforms

Download Full-text