| 基于子集划分的素长度二维DCT快速算法 |
| |
| 引用本文： | 孙吉利, 田茂. 基于子集划分的素长度二维DCT快速算法[J]. 电子与信息学报, 2011, 33(7): 1606-1610. doi: 10.3724/SP.J.1146.2010.01220 |
| |
| 作者姓名： | 孙吉利 田茂 |
| |
| 作者单位： | 中国科学院电子学研究所 北京100190 |
| |
| 摘 要： | 该文针对素长度类型的2维离散余弦变换(DCT)变换，提出一种子集划分准则，并根据该准则将2维DCT变换输出的频域数据集合划分为若干个互不相交子集；将对频域的计算转换为对2(N－1)个N点1维素数尺寸DCT的奇系数或偶系数的计算；最后给出了该算法的乘法复杂度和加法运算复杂度。相对于行列分解法，该算法节省了约一半的乘法次数，省略了数据的转置存储过程，而加法的运算复杂度基本维持不变。
|
| 关 键 词： | 信号处理 2维离散余弦变换 素长度 子集划分 行列分解法 |
| 收稿时间： | 2010-11-08 |
| 修稿时间： | 2011-03-07 |
A New Fast Prime-length 2-D DCT Algorithm Based on Subset Partition |
| |
| Sun Ji-Li, Tian Mao. A New Fast Prime-length 2-D DCT Algorithm Based on Subset Partition[J]. Journal of Electronics & Information Technology, 2011, 33(7): 1606-1610. doi: 10.3724/SP.J.1146.2010.01220 |
| |
| Authors: | Sun Ji-li Tian Mao |
| |
| Affiliation: | Sun Ji-li Tian Mao(Institute of Electronics,Chinese Academy of Sciences,Beijing 100190,China) |
| |
| Abstract: | A new fast algorithm based on subset partition for prime-length 2D Discrete Cosine Transform(DCT) is proposed.The rule of subset partition is put forward,and the frequency data of DCT output are separated into several irrelevant subsets according it.The calculation of frequency data is converted to 2(N-1) calculations of even-or odd-indexed N-length 1D-DCT coefficient.The computational complexity of the algorithm is presented.Compared to Roll and Column Method(RCM),this new fast algorithm reduces half of mu... |
| |
| Keywords: | Signal processing 2-D Discrete Cosine Transform(DCT) Prime-length Subset partition Roll and Column Method(RCM) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
