Fast address generation scheme for FFT processor

Tao Lu; Pei Kun He; He Chen; Yue Qiu Han

Fast address generation scheme for FFT processor

Tao Lu^*, Pei Kun He, He Chen, Yue Qiu Han

^*此作品的通讯作者

信息与电子学院

Beijing Institute of Technology

科研成果: 期刊稿件 › 文章 › 同行评审

2 引用（Scopus）

摘要

A fast address generation scheme of radix r (r = 2, 4, 8, ⋯) Cooley-Tukey fast Fourier transform (FFT) algorithm for fixed point and variable point is proposed. The scheme is based on the r number system and its calculating rule. The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factor storage volume in variable point FFT processor.

源语言	英语
页（从-至）	68-71
页数	4
期刊	Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
卷	26
期	1
出版状态	已出版 - 1月 2006

其它文件与链接

链接到 Scopus 的出版物

引用此

Lu, T., He, P. K., Chen, H., & Han, Y. Q. (2006). Fast address generation scheme for FFT processor. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 26(1), 68-71.

@article{f788c2c4982f43c489680f91a8a8f6f5,

title = "Fast address generation scheme for FFT processor",

abstract = "A fast address generation scheme of radix r (r = 2, 4, 8, ⋯) Cooley-Tukey fast Fourier transform (FFT) algorithm for fixed point and variable point is proposed. The scheme is based on the r number system and its calculating rule. The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factor storage volume in variable point FFT processor.",

keywords = "Butterfly calculation, Fast Fourier transform, Twiddle factor, Variable size fast Fourier transform",

author = "Tao Lu and He, {Pei Kun} and He Chen and Han, {Yue Qiu}",

year = "2006",

month = jan,

language = "English",

volume = "26",

pages = "68--71",

journal = "Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology",

issn = "1001-0645",

publisher = "Beijing Institute of Technology",

number = "1",

}

TY - JOUR

T1 - Fast address generation scheme for FFT processor

AU - Lu, Tao

AU - He, Pei Kun

AU - Chen, He

AU - Han, Yue Qiu

PY - 2006/1

Y1 - 2006/1

N2 - A fast address generation scheme of radix r (r = 2, 4, 8, ⋯) Cooley-Tukey fast Fourier transform (FFT) algorithm for fixed point and variable point is proposed. The scheme is based on the r number system and its calculating rule. The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factor storage volume in variable point FFT processor.

AB - A fast address generation scheme of radix r (r = 2, 4, 8, ⋯) Cooley-Tukey fast Fourier transform (FFT) algorithm for fixed point and variable point is proposed. The scheme is based on the r number system and its calculating rule. The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factor storage volume in variable point FFT processor.

KW - Butterfly calculation

KW - Fast Fourier transform

KW - Twiddle factor

KW - Variable size fast Fourier transform

UR - http://www.scopus.com/inward/record.url?scp=33645641175&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33645641175

SN - 1001-0645

VL - 26

SP - 68

EP - 71

JO - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology

JF - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology

IS - 1

ER -

Fast address generation scheme for FFT processor

摘要

其它文件与链接

指纹

引用此