2007 IEEE International Conf. On Application-Specific Systems, Architectures and Processors (ASAP) 2007
DOI: 10.1109/asap.2007.4429965
|View full text |Cite
|
Sign up to set email alerts
|

The 1D Discrete Cosine Transform For Large Point Sizes Implemented On Reconfigurable Hardware

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…In this section we discuss how the 1D DCT presented in [23] is extended to 2D. The DCT, similar to the FFT, is separable.…”
Section: Fpga Implementationmentioning
confidence: 99%
“…In this section we discuss how the 1D DCT presented in [23] is extended to 2D. The DCT, similar to the FFT, is separable.…”
Section: Fpga Implementationmentioning
confidence: 99%
“…Swapping the real and imaginary parts of input and output data of DFT gives the IDFT operation. The authors in [18] used the similarity property between DFT and DCT equations to implement a real DCT from the DFT. For 2D modes, the 1D mode is performed two times: one time in all rows of input frame then another time on the columns of the result.…”
Section: Basic Asip Reconfigurable Enginesmentioning
confidence: 99%
“…For an NxN matrix, this results in an operation that has O(N 2 log 2 N ) complexity since each 1-D DCT transform is O (N log 2 N ). The 1-D DCT itself was performed using an FFT and the method described in [3] and the FPGA implementation has been previously discussed in [4]. Sequential 1-D DCTs are pipelined so that while one is being calculated, another one is being loaded into memory.…”
Section: Samplementioning
confidence: 99%