This paper deals with a high-speed digital circuit for discrete cosine transform (DCT). We propose a new algorithm that reduces the number of calculations for partial sum-of-products in the DCT and synthesize the small gate depth circuit of DCT by using carry-propagation-free adders based on redundant binary {
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Motonobu TONOMURA, "High-Speed Digital Circuit for Discrete Cosine Transform" in IEICE TRANSACTIONS on Fundamentals,
vol. E78-A, no. 8, pp. 957-962, August 1995, doi: .
Abstract: This paper deals with a high-speed digital circuit for discrete cosine transform (DCT). We propose a new algorithm that reduces the number of calculations for partial sum-of-products in the DCT and synthesize the small gate depth circuit of DCT by using carry-propagation-free adders based on redundant binary {
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e78-a_8_957/_p
Copy
@ARTICLE{e78-a_8_957,
author={Motonobu TONOMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={High-Speed Digital Circuit for Discrete Cosine Transform},
year={1995},
volume={E78-A},
number={8},
pages={957-962},
abstract={This paper deals with a high-speed digital circuit for discrete cosine transform (DCT). We propose a new algorithm that reduces the number of calculations for partial sum-of-products in the DCT and synthesize the small gate depth circuit of DCT by using carry-propagation-free adders based on redundant binary {
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - High-Speed Digital Circuit for Discrete Cosine Transform
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 957
EP - 962
AU - Motonobu TONOMURA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E78-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 1995
AB - This paper deals with a high-speed digital circuit for discrete cosine transform (DCT). We propose a new algorithm that reduces the number of calculations for partial sum-of-products in the DCT and synthesize the small gate depth circuit of DCT by using carry-propagation-free adders based on redundant binary {
ER -