近似DTT的低复杂度设计与实现任务书
2020-04-28 20:30:52
1. 毕业设计(论文)主要内容:
1、学习discrete tchebichef transoform(dtt)的来源
2、学习离散tchebichef迭代公式与dtt矩阵的形成
3、设计近似但低复杂度的dtt算法
2. 毕业设计(论文)主要任务及要求
1.查阅相关文献资料15篇以上(其中近5年的英文文献不少于3篇);
2.完成开题报告;
3.研究离散变换近似计算的一般流程;
3. 毕业设计(论文)完成任务的计划与安排
第1周—第3周 搜集资料,撰写开题报告;
第4周—第5周 论文开题;
第6周—第12周 撰写论文初稿;
4. 主要参考文献
- Paulo A. M. Oliveira, etc., “Low-Complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform”, IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 27, NO. 5, MAY 2017, 1066-1076
- P. A. M. Oliveira, R. J. Cintra, F. M. Bayer, S. Kulasekera, and A. Madanayake, “A discrete Tchebichef transform approximation for image and video coding,” IEEE Signal Process. Lett., vol. 22, no. 8, pp. 1137–1141, Aug. 2015.
-
R. J. Cintra, F. M. Bayer, and C. J. Tablada, “Low-complexity 8-point DCT approximations based on integer functions,” Signal Process., vol. 99, pp. 201–214, Jun. 2014.
-
F. M. Bayer, R. J. Cintra, A. Madanayake, and U. S. Potluri, “Multiplierless
approximate 4-point DCT VLSI architectures for transform block
coding,” Electron. Lett., vol. 49, no. 24, pp. 1532–1534, Nov. 2013.