arrow
返回

A throughput maximised parallel architecture for 2D fast Discrete Pascal Transform

delete2010-05-01
delete0
PRE
AI
M
Ming Ming Wong
W
Wong, M. L. D. *
I
Ismat Hijazin
DOI:10.1016/j.compeleceng.2009.12.014delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we present a fully pipelined parallel implementation of a two dimensional (2D) Discrete Pascal Transform (DPT). Our approach first makes use of the properties of the Kronecker product and the vec operation on matrices to form an alternate 2D DPT representation suitable for column parallel computation. Next, we lend ourselves to the results from Skodras' work in 1D DPT to achieve the final architecture for fast 2D DPT. With a fully pipelined implementation, the architecture possesses an initial latency of 2(N - 1) clock cycles and a maximum throughput of one complete two dimensional transform every clock cycle, given any input matrix of size N x N. To evaluate our work, our results obtained from actual FPGA implementation were benchmarked against results from other previous works. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Polynomial transform
Pascal matrix
Parallel architecture
Fast transform
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Electrical Engineering
IF:
4.9
论文数:
6.7K
被引数:
1.3W

机构

S
Swinburne University of Technology
学者数:
9.3K
论文数: 1.2W
被引数: 2.0W
引用论文

引用论文

err分享
err收藏