An Area Efficient Real-Time PFFT Architecture Using Parallel Distributed Arithmetic
Lists
Only you see this
Abstract
In this letter, an area-efficient architecture for the hardware implementation of the real-time prime factor Fourier transform (PFFT) is presented. In the proposed architecture, a prime length DFT module with the one-point-per-cycle (OPPC) property is implemented by the parallel distributed arithmetic (DA), and a cyclic convolution feature is exploited to simplify the structure of the DA cells. Based on the proposed architecture, a real-time 65-point PFFT processor is designed, and the synthesis results show that it saves over 8% gates compared to the existing real-time 64-point DFT designs.
BibTeX
@inproceedings{ling2012area,
author = {Xiaofeng Ling and Xinbao Gong and Xiaogang Zang and Ronghong Jin},
title = {{An Area Efficient Real-Time PFFT Architecture Using Parallel Distributed Arithmetic}},
booktitle = {IEICE},
year = {2012},
doi = {10.1587/transfun.e95.a.600},
}Loading related content...