作者: Ying-Jui Chen , Soontorn Oraintara , Trac. D. Tran , Kevin Amaratunga , Truong Q. Nguyen
DOI: 10.1109/ICASSP.2002.5745314
关键词: Approximations of π 、 Mathematics 、 Discrete mathematics 、 Discrete cosine transform 、 Constraint (information theory) 、 Lifting scheme 、 Binary number 、 Adder 、 Algorithm 、 Coordinate descent
摘要: This paper describes an algorithm for systematically finding a multiplierless approximation of transforms where VLSI-friendly binary coefficients the form k/2n are employed in approximation. Assuming cost shifters is negligible hardware, total number adders required to approximate transform used as complexity constraint. The proposed systematic and fast. It eliminates need trial-and-error approximations coefficients. Specifically, two types discrete cosine (DCT) presented illustrate algorithm.