The multiplicative complexity of discrete cosine transforms (original) (raw)

On the multiplicative complexity of discrete cosine transforms

Ephraim Feig

IEEE Transactions on Information Theory, 1992

View PDFchevron_right

The multiplicative complexity of the Discrete Fourier Transform

Ephraim Feig

Advances in Applied Mathematics, 1984

View PDFchevron_right

On Algebras Related to the Discrete Cosine Transform

Ephraim Feig

Linear Algebra and its Applications, 1997

View PDFchevron_right

On relating discrete Fourier, sine, and symmetric cosine transforms

Okan Ersoy

Acoustics, Speech and Signal Processing, IEEE …, 1985

View PDFchevron_right

Comments on "Canonical transformations of the discrete cosine transform

Vadim Kudryavtsev

Signal Processing, 2008

View PDFchevron_right

Small-Size Algorithms for the Type-I Discrete Cosine Transform with Reduced Complexity

Aleksandr Cariow

Electronics

View PDFchevron_right

Small-Size Algorithms for Type-IV Discrete Cosine Transform with Reduced Multiplicative Complexity

Aleksandr Cariow

Radioelectronics and Communications Systems, 2020

View PDFchevron_right

The Discrete Cosine Transform over Finite Prime Fields

h.m. de oliveira

Lecture Notes in Computer Science, LNCS 3124, 2004

View PDFchevron_right

Fast computing of discrete cosine and sine transforms of types VI and VII

Yuriy Reznik

Applications of Digital Image Processing XXXIV, 2011

View PDFchevron_right

On compatibility of order-8 integer cosine transforms and the discrete cosine transform

wk cham

View PDFchevron_right

Canonical transformations of the discrete cosine transform

Mohamed Mansour

Signal Processing, 2007

View PDFchevron_right

The Discrete Cosine Transform over Prime Finite Fields

Ricardo Campello

Lecture Notes in Computer Science, 2004

View PDFchevron_right

Split-Radix Algorithms for Discrete Trigonometric Transforms

Gerlind Plonka-hoch

View PDFchevron_right

Complexity of the Fourier transform on the Johnson graph

Rodrigo Iglesias

arXiv: Combinatorics, 2017

View PDFchevron_right

Fast computing of discrete cosine and sine transforms of types VI and VII

Yuriy Reznik

2011

View PDFchevron_right

A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

H Ganesh

IEEE Transactions on Computers, 1980

View PDFchevron_right

Faible complexité et haute performance de la transformée de Fourier

Marwan Jaber

2013

View PDFchevron_right

The fractional discrete cosine transform

Tomaso Erseghe

IEEE Transactions on Signal Processing, 2002

View PDFchevron_right

An order-16 integer cosine transform

wk cham

IEEE Transactions on Signal Processing, 1991

View PDFchevron_right

Discrete cosine transforms on quantum computers

Martin Roetteler

Image and Signal Processing …, 2001

View PDFchevron_right

Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

Pierre Duhamel

IEEE Transactions on Acoustics, Speech, and Signal Processing

View PDFchevron_right

The discrete fractional cosine and sine transforms

Min-Hung Yeh

IEEE Transactions on Signal Processing, 2001

View PDFchevron_right

On fast algorithms for computing the inverse modified discrete cosine transform

vijay madisetti

IEEE Signal Processing Letters, 1999

View PDFchevron_right

Two-dimensional discrete Fourier transform with small multiplicative complexity using number theoretic transforms

Oliver Hinton

IEE Proceedings G (Electronic Circuits and Systems)

View PDFchevron_right

Discrete cosine and sine transforms—regular algorithms and pipeline architectures

Jarmo Takala

Signal Processing, 2006

View PDFchevron_right

A new multiplierless discrete cosine transform based on the Ramanujan ordered numbers for image coding

Geetha Komandur

View PDFchevron_right

Improvement of the Discrete Cosine Transform calculation by means of a recursive method

Higinio Mora-Mora

Mathematical and Computer Modelling, 2009

View PDFchevron_right

Complexity Theoretic Aspects of Some Cryptographic Functions

Hans-ulrich Simon

Lecture Notes in Computer Science, 2003

View PDFchevron_right

On the abstracted dataflow complexity of Fast Fourier Transforms

Robert Hiromoto

OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information), 1992

View PDFchevron_right

New Algorithms for Computing a Single Component of the Discrete Fourier Transform

h.m. de oliveira

10th International Symposium on Communication Theory and Applications , 2009

View PDFchevron_right

Arithmetic complexity of certain linear transformations

Sergey Gashkov

Mathematical Notes, 2015

View PDFchevron_right

Approximation of calculations for forward discrete cosine transform

Ming-ting Sun

IEEE Transactions on Circuits and Systems for Video Technology, 1998

View PDFchevron_right

Fractional cosine and sine transforms over finite fields

R M Campello de Souza

Linear Algebra and its Applications, 2013

View PDFchevron_right

Fast algorithms for the discrete Fourier preprocessing transforms

Okan Ersoy

IEEE Transactions on Signal Processing, 1992

View PDFchevron_right

On the Fourier Transform of the Greatest Common Divisor

Peter Van Der Kamp

Annual Volume 2013, 2014

View PDFchevron_right