# US 2020/0394251 A1 · Fast fourier transform device for analyzing specific frequency components of input signal > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2020/0394251 A1 - Document ID: US20200394251A1 - Status: Published application - Kind: A1 - Application number: 16/897,774 - Filed: 2020-06-10 - Published: 2020-12-17 - Earliest claimed: 2019-06-14 - Assignees: Electronics and Telecommunications Research Institute - Applicants: Electronics and Telecommunications Research Institute - Inventors: Youngseok BAEK; Ik Soo EO; Bon Tae KOO - Web page: https://patentgrep.com/patent/US20200394251A1 ## CPC - G06F 17/141: {Discrete Fourier transforms} - G06F 17/142: {Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Provided is a fast Fourier transform device for analyzing specific frequency components of an input signal. The fast Fourier transform device includes an address generator that generates an address, based on a first frequency index corresponding to a first frequency, an FFT coefficient table that outputs a first Fourier transform coefficient corresponding to the generated address among Fourier transform coefficients of the first frequency index, and an operator that calculates a frequency characteristic of an input signal associated with the first frequency, based on the input signal and the first Fourier transform coefficient. ## Claims ### Claim 1 A fast Fourier transform device comprising: an address generator configured to generate an address, based on a first frequency index corresponding to a first frequency; an FFT coefficient table configured to output a first Fourier transform coefficient corresponding to the generated address among Fourier transform coefficients of the first frequency index; and an operator configured to calculate a frequency characteristic of an input signal associated with the first frequency, based on the input signal and the first Fourier transform coefficient. ### Claim 2 (depends on 1) The fast Fourier transform device of claim 1, wherein the address generator sequentially increases a value of the generated address, based on a value of the first frequency index. ### Claim 3 (depends on 2) The fast Fourier transform device of claim 2, wherein the number of the generated address is the same as the number of the input signal. ### Claim 4 (depends on 1) The fast Fourier transform device of claim 1, wherein the number of the Fourier transform coefficients stored in the FFT coefficient table is the same as the number of the input signal. ### Claim 5 (depends on 4) The fast Fourier transform device of claim 4, wherein each of the Fourier transform coefficients includes a real part coefficient and an imaginary part coefficient. ### Claim 6 (depends on 1) The fast Fourier transform device of claim 1, wherein, when the input signal includes a plurality of signals, the operator calculates the frequency characteristic, based on a multiplication result of a first signal corresponding to the first Fourier transform coefficient among the plurality of signals and the first Fourier transform coefficient. ### Claim 7 A fast Fourier transform device comprising: an address generator configured to generate an address, based on a first frequency index corresponding to a first frequency, and to generate a transform address corresponding to the generated address; an FFT coefficient table configured to output a first candidate coefficient corresponding to the generated transform address among Fourier transform coefficients of the first frequency index; coefficient selection logic configured to output a first Fourier transform coefficient, based on the first candidate coefficient or a preset coefficient depending on bit information of the generated address; and an operator configured to calculate a frequency characteristic of an input signal associated with the first frequency, based on the input signal and the first Fourier transform coefficient. ### Claim 8 (depends on 7) The fast Fourier transform device of claim 7, wherein the address generator sequentially increases a value of the generated address, based on a value of the first frequency index. ### Claim 9 (depends on 8) The fast Fourier transform device of claim 8, wherein the number of the generated address is the same as the number of the input signal. ### Claim 10 (depends on 7) The fast Fourier transform device of claim 7, wherein the number of the Fourier transform coefficients stored in the FFT coefficient table is less than the number of the input signal. ### Claim 11 (depends on 7) The fast Fourier transform device of claim 7, wherein the address generator generates the transform address by using remaining bits except for an upper 2-bit of the generated address, based on the upper 2-bit of the generated address. ### Claim 12 (depends on 7) The fast Fourier transform device of claim 7, wherein the bit information of the generated address includes upper 2-bit information of the generated address and zero bit information indicating whether all of remaining bits except for the upper 2-bit are 0. ### Claim 13 (depends on 12) The fast Fourier transform device of claim 12, wherein the coefficient selection logic outputs the first Fourier transform coefficient, based on the first candidate coefficient when at least one of the remaining bits is not 0, and outputs the first Fourier transform coefficient, based on the preset coefficient when all of the remaining bits are 0. ### Claim 14 (depends on 7) The fast Fourier transform device of claim 7, wherein, when the input signal includes a plurality of signals, the operator calculates the frequency characteristic, based on a multiplication result of a first signal corresponding to the first Fourier transform coefficient among the plurality of signals and the first Fourier transform coefficient.