| 反重叠变换的快速算法及其FPGA实现 |
| |
| 引用本文： | 吕斌,王世练,张炜,王宝顺. 反重叠变换的快速算法及其FPGA实现[J]. 重庆邮电大学学报(自然科学版), 2006, 18(5): 605-608 |
| |
| 作者姓名： | 吕斌 王世练 张炜 王宝顺 |
| |
| 作者单位： | 国防科技大学,电子科学与工程学院,湖南,长沙,410073;兰州,69046部队,甘肃,兰州,830002 |
| |
| 摘 要： | 常用的反重叠变换算法运算复杂度较大，难以在FPGA中应用。根据DCT_IV的正交性和对称性，提出了基于M/2点FFT蝶形运算的反重叠变换快速算法。进一步分析了算法的复杂度，采用并行处理和流水线技术完成了反重叠变换快速算法的硬件设计和FGPA实时实现。
|
| 关 键 词： | 反重叠变换 M/2点FFT 窄带干扰 |
| 文章编号： | 1004-5694(2006)05-0605-04 |
| 收稿时间： | 2006-01-17 |
| 修稿时间： | 2006-01-17 |
Fast algorithm for IMLT and its implementation in FPGA |
| |
| LU Bin,WANG Shi-lian,ZHANG Wei,WANG Bao-shun. Fast algorithm for IMLT and its implementation in FPGA[J]. Journal of Chongqing University of Posts and Telecommunications, 2006, 18(5): 605-608 |
| |
| Authors: | LU Bin WANG Shi-lian ZHANG Wei WANG Bao-shun |
| |
| Affiliation: | College of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073 |
| |
| Abstract: | The computational complexity of common algorithm for IMLT is so high that it is hard to use IMLT via FPGA. Since DCT_IV is symmetrical and orthogonal, this paper presents the fast algorithm for IMLT computation via the length M/2 fast Fourier transform (FFT) and the butterfly structures. Furthermore, the computational complexity is analysed. Using parallel process and pipelining technology, the design and real time implementation in FPGA of this fast algorithm is presented. |
| |
| Keywords: | |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆邮电大学学报(自然科学版)》下载全文 |
|
