TY - GEN
T1 - A low-power VLSI architecture for a shared-memory FFT processor with a mixed-radix algorithm and a simple memory control scheme
AU - Lee, Shuenn Yuh
AU - Chen, Chia Chyang
AU - Lee, Chyh Chyang
AU - Cheng, Chih Jen
N1 - Funding Information:
We gratefully acknowledge the encouragement of BP and Statoil to publish this paper, and especially appreciate the support of Nick Milton, BP (Norway).
PY - 2006
Y1 - 2006
N2 - A simple addressing scheme for pipeline MDC shared-memory architecture with mixed-radix algorithm is proposed. It can provide a simple control circuit for memory addressing generation, and the mixed-radix butterfly sequence can be automatically generated by way of simple counter. In addition, for the N-point FFT processor, only N/8 coefficients should be stored in the VLSI implementation, therefore, the ROM size and the FFT processor area are reduced. According to the simple control scheme and small memory size, the lowpower VLSI architecture can be achieved. Furthermore, the architecture with the mixed-radix algorithm also enhances the speed in performing large-point FFT computations compared with the existing shared-memory architectures. Based on this architecture, not only radix-23 butterfly is adopted to achieve the requirement of high throughput, but also radix-22 or radix-2 butterfly is utilized to allow all of FFT calculation for N=2n. An VLSI architecture of 8192-point FFT processor with only power consumption of 890μW is also implemented to demonstrate the proposed method.
AB - A simple addressing scheme for pipeline MDC shared-memory architecture with mixed-radix algorithm is proposed. It can provide a simple control circuit for memory addressing generation, and the mixed-radix butterfly sequence can be automatically generated by way of simple counter. In addition, for the N-point FFT processor, only N/8 coefficients should be stored in the VLSI implementation, therefore, the ROM size and the FFT processor area are reduced. According to the simple control scheme and small memory size, the lowpower VLSI architecture can be achieved. Furthermore, the architecture with the mixed-radix algorithm also enhances the speed in performing large-point FFT computations compared with the existing shared-memory architectures. Based on this architecture, not only radix-23 butterfly is adopted to achieve the requirement of high throughput, but also radix-22 or radix-2 butterfly is utilized to allow all of FFT calculation for N=2n. An VLSI architecture of 8192-point FFT processor with only power consumption of 890μW is also implemented to demonstrate the proposed method.
UR - http://www.scopus.com/inward/record.url?scp=34547288359&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547288359&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:34547288359
SN - 0780393902
SN - 9780780393905
T3 - Proceedings - IEEE International Symposium on Circuits and Systems
SP - 157
EP - 160
BT - ISCAS 2006
T2 - ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
Y2 - 21 May 2006 through 24 May 2006
ER -