Results 1  10
of
72
Integer Fast Modified Cosine Transform
 in Multimedia and Expo. ICME
, 2003
"... In this paper, an efficient implementation of the forward and inverse MDCT is proposed for evenlength MDCT. The algorithm uses discrete cosine transform of type II (DCTII) to compute the forward MDCT and their inverse DCTIII to compute the inverse MDCT. The lifting scheme is used to approximate ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, an efficient implementation of the forward and inverse MDCT is proposed for evenlength MDCT. The algorithm uses discrete cosine transform of type II (DCTII) to compute the forward MDCT and their inverse DCTIII to compute the inverse MDCT. The lifting scheme is used to approximate
Development of integer cosine transforms by the principle of dyadic symmetry
"... Abstract: The paper shows how to convert the order8 cosine transforms into a family of integer cosine transforms (ICTs) using the theory of dyadic symmetry. The new transforms can be implemented using simple integer arithmetic. It was found that performance close to that of the DCT can be achieved ..."
Abstract
 Add to MetaCart
Abstract: The paper shows how to convert the order8 cosine transforms into a family of integer cosine transforms (ICTs) using the theory of dyadic symmetry. The new transforms can be implemented using simple integer arithmetic. It was found that performance close to that of the DCT can be achieved
Improved Reversible Integer Transform
"... AbstractInteger transform are the discrete transforms whose transform and the number ofpoints ofthe original transform entries are summations of 2k. If for an integer transform, we is no longer constrained to be a power of two. It is a great can perfectly recover the input from the output, we call ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
discuss the problem of bit constraint the inverse transform B1 are binaryvalued matrices. and how to reduce the number oftime cycle in implementation. (Goal II, reversibility): The integer transform is perfectly recoverable, i.e., B,.B = I (B1 = B1). (Goal III, easy to design). I. INTRODUCTION (Goal IV
An Efficient Architecture for the in Place Fast Cosine Transform
 in IEEE Conf on ApplicationSpecific System, Architectures and Processors (ASAP'97
, 1999
"... . The twodimensional discrete cosine transform (2DDCT) is at the core of image encoding and compression applications. We present a new architecture for the 2DDCT which is based on rowcolumn decomposition. An efficient architecture to compute the onedimensional fast direct (1DDCT) and inverse co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
,2D)DCT that significantly reduces the area required for VLSI implementation. Keywords: Discrete Cosine Transform, bit reversal and shuffle permutations, constant geometry architecture. 1. Introduction The twodimensional Discrete Cosine Transform (2DDCT) is considered the most efficient
Complexity Analysis of Two Permutations Used by Fast Cosine Transform Algorithms
, 1995
"... The fast cosine transform algorithms introduced in [ST91, Ste92] require fewer operations than any other known general algorithm. Similar to related fast transform algorithms (e.g., the FFT), these algorithms permute the data before, during, or after the computation of the transform. The choice of t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
into combinational circuits. Moreover, we show that the permutation used in [Ste92] not only allows efficient implementation, but is also selfinvertible, i.e., we can use the same circuit to generate the permutation mapping for both the fast cosine transform and its inverse, like the bitreversal permutation used
LOSSY TO LOSSLESS IMAGE COMPRESSION BASED ON REVERSIBLE INTEGER DCT
"... A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec. And lossl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec
An Arbitrarylength and Multiplierless DCT Algorithm and Systolic Implementation
"... Abstract—Discrete Cosine transform (DCT) is an important tool in digital signal processing. In this paper, a novel algorithm to perform DCT multiplierlessly is proposed. First, by modular mapping and truncating Taylor series expansion, the DCT is expressed in the form of the product of the constants ..."
Abstract
 Add to MetaCart
additions. An efficient and regular systolic array is designed to implement the proposed algorithm, and the complexity analysis is also given. Different to other fast Cosine transforms, our algorithm can deal with arbitrary length signals and get high precision. The approach is also applicable to multi
InfinityNorm Rotation Transforms
"... Abstract—A new general paradigm of dynamicrangepreserving onetoone mapping—infinitynorm rotations, analogous to the general 2norm rotations, are proposed in this paper. Analogous to the wellknown discrete cosine transforms, the linear 2norm rotation transforms which preserve the 2norm of th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
performance in lossy and lossless image compression, compared with other integer reversible transforms, is demonstrated in the experiments. Index Terms—Discrete cosine transform, dynamic range, infinitynorm rotation, integer reversible transform, transform coding.
Energy Tradeoffs for DSPbased implementation of IntDCT
"... AbslraefThe growing interest in video coding has fostered many research activities towards efficient transform architectures. In the past, several works have been proposed concerning the Discrete Cosine Transform (DCT). However, it has been recently shown how'DCT can be computed through succes ..."
Abstract
 Add to MetaCart
successive simple operations, called lifting steps. Besides the reduced complexity, these approaches are very promising since they allow the use of integer arithmetic. In this work we present the design tradeoffs behind the implementation of the lntDCT on two different DSP cores.,Particular emphasis bas been
Efficient VLSI Implementations of Fast Multiplierless Approximated DCT Using Parametrized Hardware Modules for Silicon Intellectual Property Design
 IEEE Trans. Circuits Syst
, 2005
"... Abstract—An efficient implementation of discrete cosine transform (DCT) computations are presented based on the socalled shifted discrete Fourier transform (SDFT), a generalization of the conventional DFT (DFT). Due to the simple form of the factorized matrices, the derived architecture can be easi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
extension of transform length), and flexibility (approximated DCT with various accuracies). Index Terms—Discrete cosine transform (DCT), shifted discrete Fourier transform (SDFT), integer DCT (IDCT), binDCT, CORDIC, very largescale integration (VLSI) design. I.
Results 1  10
of
72