![]() |
CiteULike | ![]() |
dcastro's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Efficient algorithms of FFT butterfly for OFDM systemsEmerging Technologies: Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on In Emerging Technologies: Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on, Vol. 2 (2004), pp. 461-464 Vol.2.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn this article, the FPGA realization of FFT processor in OFDM systems is considered. After the analysis of conventional FFT architectures, parallel butterfly algorithm is proposed. And then, based on it, dual butterfly algorithm is put forward. The FFT architecture with these algorithms has higher throughput and requires relatively small areas.
BibTeX record
RIS record