Design of application specific processors for the cached FFT algorithm
buir.contributor.orcid | Atalar, Abdullah|0000-0002-1903-1240 | |
dc.citation.epage | III 1031 | en_US |
dc.citation.spage | III 1028 | en_US |
dc.contributor.author | Atak, Oğuzhan | en_US |
dc.contributor.author | Atalar, Abdullah | en_US |
dc.contributor.author | Arıkan, Erdal | en_US |
dc.contributor.author | Ishebabi, H. | en_US |
dc.contributor.author | Kammler, D. | en_US |
dc.contributor.author | Ascheid, G. | en_US |
dc.contributor.author | Meyr, H. | en_US |
dc.contributor.author | Nicola, M. | en_US |
dc.contributor.author | Masera, G. | en_US |
dc.coverage.spatial | Toulouse, France | |
dc.date.accessioned | 2019-03-28T08:34:57Z | |
dc.date.available | 2019-03-28T08:34:57Z | |
dc.date.issued | 2006-05 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 14-19 May 2006 | |
dc.description | Conference name: 2006 IEEE International Conference on Acoustics Speech and Signal Processing | |
dc.description.abstract | Orthogonal frequency division multiplexing (OFDM) is a data transmission technique which is used in wired and wireless digital communication systems. In this technique, fast Fourier transformation (FFT) and inverse FFT (IFFT) are kernel processing blocks in an OFDM system, and are used for data (de)modulation. OFDM systems are increasingly required to be flexible to accommodate different standards and operation modes, in addition to being energy-efficient. A trade-off between these two conflicting requirements can be achieved by employing application-specific instruction-set processors (ASIPs). In this paper, two ASIP design concepts for the cached FFT algorithm (CFFT) are presented. A reduction in energy dissipation of up to 25% is achieved compared to an ASIP for the widely used Cooley-Tukey FFT algorithm, which was designed by using the same design methodology and technology. Further, a modified CFFT algorithm which enables a better cache utilization is presented. This modification reduces the energy dissipation by up to 10% compared to the original CFFT implementation. | en_US |
dc.description.provenance | Submitted by Taner Korkmaz (tanerkorkmaz@bilkent.edu.tr) on 2019-03-28T08:34:56Z No. of bitstreams: 1 Design_of_Application_Specific_Processors_for_the_Cached_FFT_Algorithm.pdf: 533049 bytes, checksum: 0d01bad146a33c8be28f782056a3ee4f (MD5) | en |
dc.description.provenance | Made available in DSpace on 2019-03-28T08:34:57Z (GMT). No. of bitstreams: 1 Design_of_Application_Specific_Processors_for_the_Cached_FFT_Algorithm.pdf: 533049 bytes, checksum: 0d01bad146a33c8be28f782056a3ee4f (MD5) Previous issue date: 2006-05 | en |
dc.identifier.doi | 10.1109/ICASSP.2006.1660832 | en_US |
dc.identifier.eissn | 2379-190X | |
dc.identifier.issn | 1520-6149 | |
dc.identifier.uri | http://hdl.handle.net/11693/50791 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/ICASSP.2006.1660832 | en_US |
dc.source.title | 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings | en_US |
dc.subject | Algorithm design and analysis | en_US |
dc.subject | Application specific processors | en_US |
dc.subject | OFDM | en_US |
dc.subject | Energy dissipation | en_US |
dc.subject | Data communication | en_US |
dc.subject | Wireless communication | en_US |
dc.subject | Digital communication | en_US |
dc.subject | Kernel | en_US |
dc.subject | Energy efficiency | en_US |
dc.subject | Design methodology | en_US |
dc.title | Design of application specific processors for the cached FFT algorithm | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Design_of_Application_Specific_Processors_for_the_Cached_FFT_Algorithm.pdf
- Size:
- 520.56 KB
- Format:
- Adobe Portable Document Format
- Description:
- View / Download
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: