DocumentCode :
2520560
Title :
Data reordering in Discrete Trigonometric Transforms (DTT) using scalable interconnect networks implemented for FFT and DCT
Author :
Hussein, Adel ; Hirzallah, Nael
Author_Institution :
R&D, Infinite Solutions, Austin, TX, USA
fYear :
2012
fDate :
2-5 Oct. 2012
Firstpage :
524
Lastpage :
528
Abstract :
Scalable interconnect network for both global and local for data reordering and its implementation are presented in this paper. These networks were implemented for Fast Fourier Transform (FFT) and Discrete Cosine Transform (DCT). The number of processing elements (PE) can be reduced significantly using partial column structure to compute the transforms. This makes it suitable for usage in handheld devices. Data reordering is required between stages (columns). The structure will reorder data on the fly without the need for storage elements. Scalability of the network is based on the transform size and the number of processing elements (PE) in each processing column. The structure can be used as a tool to evaluate throughput vs. complexity (cost and area) of the overall system prior to design commit. A first order of hardware cost analysis is also presented.
Keywords :
discrete cosine transforms; fast Fourier transforms; mobile handsets; multiprocessor interconnection networks; parallel architectures; DCT; FFT; data reordering; discrete trigonometric transform; fast Fourier transform; handheld device; partial column structure; scalable interconnect network; Algorithm design and analysis; Computer architecture; Delay; Discrete cosine transforms; Pipelines; Signal processing algorithms; DCT; DTT; FFT; Scalable; architecture; permutation; transform coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Information Technologies (ISCIT), 2012 International Symposium on
Conference_Location :
Gold Coast, QLD
Print_ISBN :
978-1-4673-1156-4
Electronic_ISBN :
978-1-4673-1155-7
Type :
conf
DOI :
10.1109/ISCIT.2012.6380955
Filename :
6380955
Link To Document :
بازگشت