Fast Fourier transform twiddle factor calculation system and method

A Fourier transform and twiddle factor technology, applied in the field of communication systems, can solve problems such as read and write conflicts, achieve the effects of avoiding conflicts, meeting the needs of parallel algorithms, and saving storage space

Pending Publication Date: 2021-10-29
星思连接上海半导体有限公司
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to overcome the deficiencies in the prior art, provide a fast Fourier transform twiddle factor calculation system and method, and solve the technical problem that the same memory is prone to read and write conflicts in the same clk under different fftSize

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fast Fourier transform twiddle factor calculation system and method
  • Fast Fourier transform twiddle factor calculation system and method
  • Fast Fourier transform twiddle factor calculation system and method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0033] A fast Fourier transform twiddle factor calculation method, which divides the memory into multiple blocks through the memory segmentation method, allocates different datablocks in different memory blocks, and calculates the overlapping of the datablock through the twiddle factor parallel construction method The rotation factor required for shape calculation, the memory segmentation method includes: according to the read and write data rules determined by the scheduling algorithm, write a computer search program to search for the memory segmentation scheme, and divide the memory into multiple blocks according to the memory segmentation scheme. The blocks are used to provide allocation space for different datablocks; the parallel construction method of the twiddle factors includes: saving the twiddle factors to form a large table, and introducing another auxiliary small table, and calculating multiple data through the cooperation of the large table and the small table twid...

Embodiment 2

[0038] A fast Fourier transform twiddle factor calculation system, the device comprising:

[0039] Datablock allocation module: used to divide the memory into multiple blocks through the memory segmentation module, and allocate different datablocks in different memory blocks;

[0040] Twiddle factor calculation module: it is used to calculate the twiddle factor required for the stacking operation on the datablock through the twiddle factor parallel construction module.

[0041] It should be noted that the memory segmentation module is used to write a computer search program to search for the memory segmentation scheme according to the read and write data rules determined by the scheduling algorithm, and divide the memory into multiple blocks according to the memory segmentation scheme, and the multiple blocks are used for Provide allocation space for different datablocks; the twiddle factor parallel construction module is used to save the twiddle factors to form a large table,...

Embodiment 3

[0043] The embodiment of the present invention also provides a fast Fourier transform twiddle factor calculation device, including a processor and a storage medium;

[0044] The storage medium is used to store instructions;

[0045] The processor is configured to operate according to the instructions to execute the steps of the method for calculating the fast Fourier transform twiddle factor according to the first embodiment.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a fast Fourier transform twiddle factor calculation system and method in the field of communication systems, and aims to solve the technical problem that under different fftSizes, the same memory is in the same clk, and read-write conflicts easily exist. The invention relates to a fast Fourier transform twiddle factor calculation method, which comprises the following steps: segmenting a memory into a plurality of blocks through a memory segmentation method, distributing different datablocks into different memory blocks, and calculating a twiddle factor required for carrying out stack operation on the datablocks through a twiddle factor parallel construction method, wherein the memory is a device for temporarily storing each level of data, and the datablock is a data block. Segmentation modes of FFT scenes of various fftSize of an NR system can be met, a corresponding read-write method is provided, verification is carried out in various scenes, and the conflict of read-write memory can be completely avoided. Besides, only one group of twiddle factors is stored, and a plurality of twiddle factors can be constructed in parallel through another auxiliary small table, so that the storage space can be saved, and the requirements of a parallel algorithm can be met.

Description

technical field [0001] The invention relates to a fast Fourier transform twiddle factor calculation system and method, belonging to the technical field of communication systems. Background technique [0002] FFT is an efficient algorithm of DFT, called fast Fourier transform (fast Fouriertransform), which is widely used in various digital signal processing systems, such as analyzing signal spectrum characteristics, transformprecoding in 5G wireless communication systems, OFDMmudulation, PRACH waveform generation, and used by the receiver. It inputs N numbers each time, and transforms and outputs N numbers. N here is called the number of FFT points, and it is also recorded as FFTSize. For example, the 5G system needs to support all FFTs of N=12*RBnum, where 0<RB<=273, and FFTs up to N=48*4096 may even be used in the PRACH module. [0003] The 5G system needs to support a high data throughput rate, so the throughput rate of the FFT module is an important design indicat...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/14
CPCG06F17/142
Inventor 黄勇富
Owner 星思连接上海半导体有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap