Treffer: On the regular structure for the fast 2-D DCT algorithm
Title:
On the regular structure for the fast 2-D DCT algorithm
Authors:
Source:
IEEE transactions on circuits and systems. 2, Analog and digital signal processing. 40(4):259-266
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 1993.
Publication Year:
1993
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Electronics, Electronique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Méthodes mathématiques, Mathematical methods, Algorithme rapide, Fast algorithm, Algoritmo rápido, Complexité calcul, Computing complexity, Complejidad cálculo, Transformation cosinus, Cosine transform, Transformación coseno, Transformation discrète, Discrete transformation, Transformación discreta
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Seoul national univ., dep. control instrumentation eng., signal processing lab., Seoul 151-742, Korea, Republic of
ISSN:
1057-7130
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.4851304
Database:
PASCAL Archive
Weitere Informationen
Recently, a new fast algorithm for 2-D N×N DCT, where N=2m, has been proposed [1]. It requires only half number or multiplications compared to the conventional row-column approach. However, the signal flow graph for the post-addition stage seems very complicated and the order or the output index is seemingly irregular, because the post-addition stage was not based on the mathematical expressions. Consequently, derivation of the signal flow graph becomes complicated as the transform size increases. Hence, in this paper, we present a systematic expressions for the post-addition stage in the 2-D DCT algorithm [1], which enable us to implement any N×N DCT in a straighforward manner.