摘要
介绍了一种用1DDCT线性组合计算2DDCT的快速算法,并对该算法作了改进和补充.在原始数据预分组时改模N为模2N,实现了一次性正确分组,使算法原理简明直观并减少了附加工作量.推导出计算线性组合的具体公式并讨论了它的快速计算。
A fast algorithm,which computes the 2 D DCT by liner combination of 1 D DCT,is introduced,improved and complemeted. The original datas is transformed from Mode N into Mode 2N while they are pre divided,and realize proper once division. Thus it makes principle of algorithm concisely and reduces number of added works. The concrete formula which computo liner combination is inquired into and its fast computation is studied and thus the feasibility of this algorithm is improved.
出处
《西南师范大学学报(自然科学版)》
CAS
CSCD
北大核心
1997年第3期271-277,共7页
Journal of Southwest China Normal University(Natural Science Edition)