This paper presents an efficient serial-parallel multiplier algorithm that realizes the input data bit-serially, for implementation of the discrete cosine transform (DCT), which realizes the input data bit-serially. First, the DCT equation is split into a few groups of equations by using some mathem
β¦ LIBER β¦
On the realization of discrete cosine transform using the distributed arithmetic
β Scribed by Chan, Y.-H.; Siu, W.-C.
- Book ID
- 121383007
- Publisher
- IEEE
- Year
- 1992
- Tongue
- English
- Weight
- 699 KB
- Volume
- 39
- Category
- Article
- ISSN
- 1057-7122
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Efficient multiplier structure for reali
β
Lap-Pui Chau; Wan-Chi Siu
π
Article
π
2003
π
Elsevier Science
π
English
β 234 KB
On the discrete cosine transform computa
β
VladimΓr BritaΕΓ‘k
π
Article
π
1994
π
Elsevier Science
π
English
β 485 KB
On Computing the Discrete Cosine Transfo
β
Tseng, B.D.; Miller, W.C.
π
Article
π
1978
π
IEEE
π
English
β 517 KB
Numerical image compression using the di
β
Atilla Baskurt
π
Article
π
1990
π
Elsevier Science
π
English
β 62 KB
Lossless Image Compression Using the Dis
β
Giridhar Mandyam; Nasir Ahmed; Neeraj Magotra
π
Article
π
1997
π
Elsevier Science
π
English
β 461 KB
The DCT has long been used as a method for image two-dimensional images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high-energy coding and has now become the standard for video coding DCT coefficients in each block, finds an inverse DCT from [2]. Its energy co
On computing the 2-D discrete cosine tra
β
Haralambos C. Karathanasis
π
Article
π
1993
π
Elsevier Science
β 466 KB