一种低复杂度的剪枝8点DCT图像编码算法
Low-complexity Pruned 8-point DCT Approximations for Image Encoding
摘要：
提出了两种无乘法器的8点离散余弦变换（DCT）近似。这两种变换都比现有技术的方法具有更低的算术复杂度。这些新方法的性能进行了评估，在图像压缩的上下文中。一个JPEG类的模拟进行，证明了所介绍的方法的充分性和竞争力。还考虑了CMOS技术的数字VLSI实现。这两种方法都在Berkeley仿真引擎（BEE3）中实现。
英文摘要：
Two multiplierless pruned 8-point discrete cosine transform (DCT) approximation are presented. Both transforms present lower arithmetic complexity than state-of-the-art methods. The performance of such new methods was assessed in the image compression context. A JPEG-like simulation was performed, demonstrating the adequateness and competitiveness of the introduced methods. Digital VLSI implementation in CMOS technology was also considered. Both presented methods were realized in Berkeley Emulation Engine (BEE3).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
