mirage

Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications

Show simple item record

dc.contributor.author Meher, Pramod Kumar
dc.contributor.author Patra, Jagdish Chandra
dc.contributor.author Vinod, Achutavarrier Prasad
dc.date.accessioned 2011-09-21T03:36:33Z
dc.date.available 2011-09-21T03:36:33Z
dc.date.copyright 2010
dc.date.issued 2011-09-21
dc.identifier.citation Meher, P. K., Patra, J. C., & Vinod, A. P. (2010). Efficient Systolic Designs for 1- and 2-Dimensional DFT of General Transform-Lengths for High-Speed Wireless Communication Applications. Journal of Signal Processing Systems, 60(1), 1-14.
dc.identifier.issn 1939-8018
dc.identifier.uri http://hdl.handle.net/10220/7086
dc.description.abstract In wireless communication, multiple receive-antennas are used with orthogonal frequency division multiplexing (OFDM) to improve the system capacity and performance. The discrete Fourier transform (DFT) plays an important part in such a system since the DFTs are required to be performed for the output of all those antennas separately. This paper presents area-time efficient systolic structures for one-dimensional (1-D) and two-dimensional (2-D) DFTs of general lengths. A low-complexity recursive algorithm based on Clenshaw’s recurrence relation is formulated for the computation of 1-D DFT. The proposed algorithm is used further to derive a linear systolic array for the DFT. The concurrency of computation has been enhanced and complexity is minimized by the proposed algorithm where an N −point DFT is computed via four inner-products of real-valued data of length ≈ (N/2). The proposed 1-D structure offers significantly lower latency, twice the throughput, and involves nearly the same area-time complexity of the corresponding existing structures. The proposed algorithm for 1-D DFT is extended further to obtain a 2-D systolic structure for the 2-D DFT without involving any transposition operation.
dc.format.extent 14 p.
dc.language.iso en
dc.relation.ispartofseries Journal of signal processing systems
dc.rights © 2010 Springer. This is the author created version of a work that has been peer reviewed and accepted for publication by Journal of Signal Processing Systems, Springer.  It incorporates referee's comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [DOI: http://dx.doi.org/10.1007/s11265-008-0328-x].
dc.subject DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems.
dc.title Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications
dc.type Journal Article
dc.contributor.school School of Computer Engineering
dc.identifier.doi http://dx.doi.org/10.1007/s11265-008-0328-x
dc.description.version Accepted version
dc.identifier.rims 140342

Files in this item

Files Size Format View
70.Efficient Systolic Designs for 1.pdf 1.791Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications 379

Total downloads

All Bitstreams Views
70.Efficient Systolic Designs for 1.pdf 113
2010_JSPS_Meher_DFT.pdf 11

Top country downloads

Country Code Views
United States of America 64
India 16
Singapore 7
Japan 4
Unknown Country 3

Top city downloads

city Views
Mountain View 52
Singapore 6
Bangalore 2
Mumbai 2
New Delhi 2