A bit-serial architecture for a multiplierless DCT
This paper describes the implementation of a multiplierless 1-D DCT which is also applicable to a 2-D computation. The key idea is based on the binary DCT of which multipliers are replaced by lifting parameters that essentially are shifts and adds. For low power applications and smaller hardware siz...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia
2003
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/1019/1/S._Choomchuay.pdf |
| Summary: | This paper describes the implementation of a multiplierless 1-D DCT which is also applicable to a 2-D computation. The key idea is based on the binary DCT of which multipliers are replaced by lifting parameters that essentially are shifts and adds. For low power applications and smaller hardware size, a bit-serial architecture was invoked in the implementation of such an algorithm. Varying data word length, MSE obtained form our approach and some similar algorithms are also investigated and reported. |
|---|