Wordlength Optimization of a Pipelined FFT Processor

Summary, in English

This paper describes the optimization of the word lengths in an 8 k-points pipelined FFT processor. The word lengths can be freely chosen since the FFT is implemented as a full custom ASIC. According to the specification, input and output word lengths are 12 bits but improved performance on be achieved by using a longer wordlength internally. Increased wordlength means increased size, both for memory and arithmetic operations. Since the FFT processor uses large memories, especially in the early stages, it is especially important to keep wordlength short in the beginning of the pipeline. Finding a good trade-off between precision and size is a difficult problem and it is not reasonable to solve analytically. Simulations using a C-model are therefore used to find an acceptable solution. The simulations show that a good solution is obtained by starting with 12 bits and gradually increasing the wordlength up to 16 bits. The final result is rounded back to 12 bits. This is a good trade-off between precision and complexity

• Författare: Stefan Johansson; Shousheng He; Peter Nilsson
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 1999
• Språk: Engelska
• Sidor: 501-503
• Publikation/Tidskrift/Serie: 42nd Midwest Symposium on Circuits and Systems, 1999.
• Volym: 1
• Länkar: http://dx.doi.org/10.1109/MWSCAS.1999.867314
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: 1999 IEEE International Midwest Symposium on Circuits and Systems (MWSCAS’99)
• Conference date: 1999-08-08 - 1999-08-11
• Conference place: Las Cruces, New Mexico, United States
• Status: Published
• Forskningsgrupp: Elektronikkonstruktion
• ISBN/ISSN/Övrigt: ISBN: 0-7803-5491-5