16th International Conference on VLSI Design, 2003. Proceedings.
DOI: 10.1109/icvd.2003.1183133
|View full text |Cite
|
Sign up to set email alerts
|

Design of a 2D DCT/IDCT application specific VLIW processor supporting scaled and sub-sampled blocks

Abstract: We present an innovative design of an accurate, 2D DCT IDCT processor, which handles scaled and sub-sampled input

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0
1

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 10 publications
0
4
0
1
Order By: Relevance
“…Therefore, a DCT coprocessor can use the same data path for the implementation of inverse and forward DCT. Moreover, implementing dedicated multipliers with fixed constants provides high throughput at minimal hardware cost [86] [133]. The internal state of this coprocessor is void after processing a DCT block.…”
Section: Discrete Cosine Transform (Dct)mentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, a DCT coprocessor can use the same data path for the implementation of inverse and forward DCT. Moreover, implementing dedicated multipliers with fixed constants provides high throughput at minimal hardware cost [86] [133]. The internal state of this coprocessor is void after processing a DCT block.…”
Section: Discrete Cosine Transform (Dct)mentioning
confidence: 99%
“…A previous hardware implementation shows a full 8x8 two-dimensional DCT takes 64 cycles, or 32 cycles if the horizontal and vertical DCT are pipelined. Krishnan [86] gives more detailed performance figures for a DCT with embedded block compression. Assuming a best-case latency of 4 cycles to read a DCT row via the shell, reading a full DCT block takes 32 cycles (8 rows * 4 cycles/row).…”
Section: Coprocessor Performancementioning
confidence: 99%
See 1 more Smart Citation
“…It was selected due the minimum required number of additions and multiplications (11 Mul and 29 add). This algorithm is obtained by a slight modification of the original Loeffler algorithm [9], which provides one of the most computationally efficient 1-D DCT/IDCT calculations [20]. The modified Loeffler algorithm for calculating 8-point 1-D DCT is illustrated in Figure 3.…”
Section: Loeffler Algorithm For the 1d-dctmentioning
confidence: 99%
“…) αλά δεπηεξφιεπην. Ζ πινπνίεζε γίλεηαη βάζε ηνπ αιγνξίζκνπ ηνπ Loeffler[53], φπσο παξνπζηάδεηαη ζην ρ. 3.43, ελψ γηα ηνλ αληίζηξνθν κεηαζρεκαηηζκφ παξαιείπνληαη νη γξακκέο πνπ πεξηέρνπλ κφλν κεδεληθά.Οη O. Cadenas, M. Brandt, G. Megson θαη N. Goswami[12] παξνπζηάδνπλ κηα δνκή πινπνίεζεο ηνπ 8x8 2-D DCT / 2-D ΗDCT ζε FPGA πνπ έρεη σο ζηφρν ηελ ρακειή θαηαλάισζε ηζρχνο.…”
unclassified