ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

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

หน่วยงาน Nanyang Technological University, Singapore

รายละเอียด

ชื่อเรื่อง : Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications
นักวิจัย : Meher, Pramod Kumar , Patra, Jagdish Chandra , Vinod, Achutavarrier Prasad
คำค้น : DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems.
หน่วยงาน : Nanyang Technological University, Singapore
ผู้ร่วมงาน : -
ปีพิมพ์ : 2553
อ้างอิง : 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. , 1939-8018 , http://hdl.handle.net/10220/7086 , http://dx.doi.org/10.1007/s11265-008-0328-x , 140342
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : Journal of signal processing systems
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

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.

บรรณานุกรม :
Meher, Pramod Kumar , Patra, Jagdish Chandra , Vinod, Achutavarrier Prasad . (2553). Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications.
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Meher, Pramod Kumar , Patra, Jagdish Chandra , Vinod, Achutavarrier Prasad . 2553. "Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications".
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Meher, Pramod Kumar , Patra, Jagdish Chandra , Vinod, Achutavarrier Prasad . "Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications."
    กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2553. Print.
Meher, Pramod Kumar , Patra, Jagdish Chandra , Vinod, Achutavarrier Prasad . Efficient systolic designs for 1- and 2-dimensional DFT of general transform-lengths for high-speed wireless communication applications. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2553.