CN112511480A - Secondary FFT and IFFT transformation method and related product - Google Patents
Secondary FFT and IFFT transformation method and related product Download PDFInfo
- Publication number
- CN112511480A CN112511480A CN202011250024.4A CN202011250024A CN112511480A CN 112511480 A CN112511480 A CN 112511480A CN 202011250024 A CN202011250024 A CN 202011250024A CN 112511480 A CN112511480 A CN 112511480A
- Authority
- CN
- China
- Prior art keywords
- fft
- stage
- num
- determining
- fftgroup
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2626—Arrangements specific to the transmitter only
- H04L27/2627—Modulators
- H04L27/2628—Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2647—Arrangements specific to the receiver only
- H04L27/2649—Demodulators
- H04L27/265—Fourier transform demodulators, e.g. fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Discrete Mathematics (AREA)
- Mathematical Analysis (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Algebra (AREA)
- Complex Calculations (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the application provides a secondary FFT and IFFT transformation method and a related product, wherein the method comprises the following steps: acquiring data subjected to secondary FFT and IFFT transformation, and determining the order stage of the first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number; determining a stage access address according to the address mapping, performing first conversion on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing second conversion operation with the same address on the output operation result to obtain a second FFT and IFFT conversion result. The technical scheme provided by the application has the advantage of low time delay.
Description
Technical Field
The present application relates to the field of communications processing technologies, and in particular, to a second FFT and IFFT transformation method and a related product.
Background
FFT (fast fourier transform) and IFFT (inverse fast fourier transform) need to be performed in many signal processing scenarios. In a signal processing scene, secondary FFT and IFFT transformation are needed, the requirement on time delay is extremely high, the time delay of the existing secondary FFT and IFFT transformation is high, and the resource consumption is large.
Disclosure of Invention
The embodiment of the application discloses a secondary FFT and IFFT transformation method and a related product, which can reduce the time delay of the secondary FFT and IFFT transformation, effectively reduce the resource consumption and improve the user experience.
In a first aspect, a method for OFDM transform in a 5G system is provided, the method comprising the steps of:
acquiring data subjected to secondary FFT and IFFT transformation, and determining the order stage of the first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number;
determining a stage access address according to the address mapping, performing first conversion on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing second conversion operation on the same address of the output operation result to obtain a second FFT and IFFT conversion result;
if the first transformation is: fast Fourier Transform (FFT), second FFT;
if the first transformation is: IFFT, second transform to FFT.
In a second aspect, a user equipment is provided, the user equipment comprising:
the acquisition unit is used for acquiring data of secondary FFT and IFFT;
a processing unit for determining an order stage of a first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number; determining a stage access address according to the address mapping, performing first conversion on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing second conversion with the same address on the output operation result to obtain a secondary FFT and IFFT conversion result;
if the first transformation is: fast Fourier Transform (FFT), second FFT;
if the first transformation is: IFFT, second transform to FFT.
In a third aspect, there is provided an electronic device comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps of the method of the first aspect.
In a fourth aspect, a computer-readable storage medium is provided, storing a computer program for electronic data exchange, wherein the computer program causes a computer to perform the method of the first aspect.
In a fifth aspect, there is provided a computer program product, wherein the computer program product comprises a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps as described in the first aspect of an embodiment of the present application. The computer program product may be a software installation package.
In a sixth aspect, a chip system is provided, the chip system comprising at least one processor, a memory and an interface circuit, the memory, the transceiver and the at least one processor being interconnected by wires, the at least one memory having a computer program stored therein; the computer program, when executed by the processor, implements the method of the first aspect.
The technical scheme provided by the application obtains data of sub-FFT and IFFT, if the data is smaller than a preset transformation size, zero padding processing is carried out on the data to obtain processed data, and the order stage of Fast Fourier Transform (FFT) of the processed data is determined; determining corresponding address mapping according to the stage and the number of the decomposed factors; determining a stage access address according to the address mapping, performing operation on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing the IFFT operation with the same address on the output operation result to obtain a secondary FFT and IFFT conversion result. The scheme of this application adopts the structure of same address to carry out reading and writing in of data, the effectual time delay that has reduced, and in actual test, it only can delay several clock beat, therefore it has the effect that reduces the time delay, in addition, according to the above-mentioned improvement address utilization that the number can be very big of mapping, improves the operating speed, reduces the operation resource, improves user experience degree.
Drawings
The drawings used in the embodiments of the present application are described below.
FIG. 1 is a system architecture diagram of an exemplary communication system;
fig. 2 is a schematic flow chart of a second FFT and IFFT transformation method provided in the present application;
FIG. 3 is a diagram of a hardware architecture of an FFT processor;
FIG. 4 is a schematic diagram of a method of quadratic transformation;
fig. 5 is a schematic structural diagram of a user equipment according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The embodiments of the present application will be described below with reference to the drawings.
The term "and/or" in this application is only one kind of association relationship describing the associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in this document indicates that the former and latter related objects are in an "or" relationship.
The "plurality" appearing in the embodiments of the present application means two or more. The descriptions of the first, second, etc. appearing in the embodiments of the present application are only for illustrating and differentiating the objects, and do not represent the order or the particular limitation of the number of the devices in the embodiments of the present application, and do not constitute any limitation to the embodiments of the present application. The term "connect" in the embodiments of the present application refers to various connection manners, such as direct connection or indirect connection, to implement communication between devices, which is not limited in this embodiment of the present application.
The technical solution of the embodiment of the present application may be applied to the example communication system 100 shown in fig. 1, where the example communication system 100 includes a terminal 110 and a network device 120, and the terminal 110 is communicatively connected to the network device 120.
In baseband signal processing, it is often necessary to transform a signal in a time domain to a frequency domain, and then transform the signal to the time domain after the frequency domain processing is completed.
The FFT processor calculates the stages (orders) related to the decomposition factors thereof, the number of the decomposed factors determines the operation orders thereof, and the FFT _ size is the number of points to be transformed, fftidx _ max and fftgroup _ max which are the maximum value of the fixed count decomposed under a certain point number and each operation stage (operation order), and the value of the maximum value meets the requirement that the FFT _ size is fftidx _ max and fftgroup _ max 8.
Wherein, FFT _ size represents the size of FFT, fftidx _ max represents the index maximum value of FFT, ffgroup _ max represents the maximum value of FFT group.
Referring to fig. 2, fig. 2 provides a second FFT and IFFT transformation method, which is implemented in the communication system shown in fig. 1, and specifically, the method may be executed by a terminal in the communication system shown in fig. 1, but may also be executed by a network device in the communication system shown in fig. 1 in an alternative scheme, where the method includes the following steps:
step S201, acquiring data of secondary FFT and IFFT transformation;
one-time FFT (IFFT) operation flow:
the data is firstly input into 8 pieces of RAM, linear addresses are mapped to RAM BANK numbers and BANK addresses, after the data is input, operation is carried out under external operation enabling and configuration parameters (FFT _ size, IFFT or FFT operation identification), the linear addresses of the data required by the operation are converted into the RAM BANK numbers and the BANK addresses under the mapping by the above, 8 numbers are taken for carrying out 8-base operation, the operation result is multiplied by the rotation factor under the non-last stage, and the operation intermediate result is written back to the memory. When the operation is carried out to the last stage, the operation is carried out on the basis 2, the basis 4 or the basis 8 (according to the specific decomposition condition of each point), no twiddle factor function is existed when the operation is carried out to the last stage, and the result is written back to the cache. The RAM adopts a dual-port memory for simultaneous data input and output. The ROM table is used to store the 7-way spin factors required for the base 8 operation.
The secondary FFT conversion implementation process:
after the data is input, the first fft (ifft) operation is performed as described above;
reading data in a transform domain, processing and writing back the data in the same address, wherein the reading support first address is integral multiple of 8 and is continuous with 8 numbers, and the access address is subjected to address mapping once according to a formula 3;
performing an IFFT (FFT) operation on the written data at the same address;
reading the final result in 8 RAM, wherein the read support first address is integral multiple of 8, continuous 8 numbers, and the access address carries out continuous secondary address mapping, which is as follows: and y is f (x)), and mapping is carried out on y, and the linear address is mapped to the RAM BANK number and the BANK address, so as to obtain the final physical RAM number and address mapping.
Step S202, determining the order stage of the first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number;
step S203, determining the stage access address according to the address mapping, performing a first transformation on the data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing a second transformation with the same address on the output operation result to obtain a second FFT and IFFT transformation result.
If the first transformation is: fast Fourier Transform (FFT), second FFT;
if the first transformation is: IFFT, second transform to FFT.
The technical scheme provided by the application obtains data of sub-FFT and IFFT, if the data is smaller than a preset transformation size, zero padding processing is carried out on the data to obtain processed data, and the order stage of Fast Fourier Transform (FFT) of the processed data is determined; determining corresponding address mapping according to the stage and the number of the decomposed factors; determining a stage access address according to the address mapping, performing operation on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing the IFFT operation with the same address on the output operation result to obtain a secondary FFT and IFFT conversion result. The scheme of this application adopts the structure of same address to carry out reading and writing in of data, the effectual time delay that has reduced, and in actual test, it only can delay several clock beat, therefore it has the effect that reduces the time delay, in addition, according to the above-mentioned improvement address utilization that the number can be very big of mapping, improves the operating speed, reduces the operation resource, improves user experience degree.
In an optional scheme, the determining a corresponding address mapping according to the stage and the number of factors of the processed data decomposition; determining the stage access address according to the address mapping specifically comprises:
determining a fast Fourier transform group value fftgroup _ num, a fast Fourier transform index value fftedx _ num and a log2_ num according to the stage and the decomposed factor number;
if the stage is not the last stage, determining the stage access address according to fftgroup _ num, fftidx _ max and log2_ num.
fftgroup _ num may be specifically an fft group number, and fftidx _ num may be specifically an fft index number. The points are valued at each stage as follows:
2048 points:
1024 points:
512 points:
256 points:
128 points:
64 points are as follows:
32 points:
16 points are as follows:
the above points are decomposed as follows:
decomposition of 16 points
n＝2n1+n0 n1＝0,1,...,7,n0＝0,1,
k＝k1+8k0 k1＝0,1,...,7,k0＝0,1,
Decomposition of 32 points
n＝4n1+n0 n1＝0,1,...,7,n0＝0,1,2，3，
k＝k1+8k0 n1＝0,1,...,7,k0＝0,1,2,3
Decomposition of 64 points
n＝8n1+n0 n1＝0,1,...,7,n0＝0,1,...,7,
k＝k1+8k0 k1＝0,1,...,7,k0＝0,1,...,7,
Decomposition of 128 points
n＝16n2+2n1+n0 n2,n1＝0,1,...,7,n0＝0,1,
k＝k2+8k1+64k0 k2,k1＝0,1,...,7,k0＝0,1,
Decomposition of 256 points
n＝32n2+4n1+n0 n2,n1＝0,1,...,7,n0＝0,1,...,3,
k＝k2+8k1+64k0 k2,k1＝0,1,...,7,k0＝0,1,...,3,
Decomposition of 512 points
n＝64n2+8n1+n0 n2,n1,n0＝0,1,...,7,
k＝k2+8k1+64k0 k2,k1,k0＝0,1,...,7,
Decomposition of 1024 points
n＝128n3+16n2+2n1+n0 n3,n2,n1＝0,1,...,7,n0＝0,1,
k＝k3+8k2+64k1+512k0 k3,k2,k1＝0,1,...,7,k0＝0,1,
Decomposition of 2048 points
n＝256n3+32n2+4n1+n0 n3,n2,n1＝0,1,...,7,n0＝0,1,...,3,
k＝k3+8k2+64k1+512k0 k3,k2,k1＝0,1,...,7,k0＝0,1,...,3,
In an optional scheme, the determining the stage access address according to fftgroup _ max, fftidx _ num, and log2_ num specifically includes:
fft_addr0＝fftidx_num+fftgroup_base；
fft_addrx＝fft_addr(x-1)+fftidx_max*x；
wherein, the value of x is an integer of [ 1,7 ];
fftgroup_base＝fftgroup_num<<log2_num；
the fft _ addr0 indicates the first address to take the value of fft, addr indicates the address, and 0 indicates that the address number to take the value is 0 (initial value). fft _ addrx represents the number of addresses and can take any integer between [ 1,7 ].
The non-last stage address is generated as follows:
fftgroup_base＝fftgroup_num<<log2_num
fft_addr0＝fftidx_num+fftgroup_base；
fft_addr1＝fft_addr0+fftidx_max；
fft_addr2＝fft_addr1+fftidx_max*2；
fft_addr3＝fft_addr2+fftidx_max*3；
fft_addr4＝fft_addr3+fftidx_max*4；
fft_addr5＝fft_addr4+fftidx_max*5；
fft_addr6＝fft_addr5+fftidx_max*6；
fft_addr7＝fft_addr6+fftidx_max*7；
twiddle factor address: twf _ rom _ addr is fftidx _ num.
Where < < denotes a left shift.
The counters fftidx _ num and fftgroup _ num are cleared at the beginning of each stage,
at each stage, a counter fftidx _ num is counted in each clock cycle, and when fftidx _ max-1 is counted, the fftgroup _ num counter is incremented by 1, and when fftidx _ num and fftgroup _ num are counted to fftidx _ max-1 respectively.
In an optional scheme, the corresponding address mapping is determined according to the stage and the number of decomposed factors; determining the stage access address according to the address mapping specifically comprises:
determining fftgroup _ num according to the stage and the decomposed factor number, and if the stage is the last stage, determining fft _ addr0 according to the specific bit of the fftgroup _ num and the decomposed factor number; and determining the subsequent fft _ addr according to the fft _ addr0, wherein the value of x is an integer of [ 1,7 ].
In an optional scheme, the fft _ addr0 is determined according to the specific bit of the fftgroup _ num and the number of decomposed factors; determining the subsequent fft _ addr according to fft _ addr0 specifically includes:
if the number of factors decomposed is: 64. at least one of the first and second optical fibers 512,
fft_addrx＝fft_addr0+x。
in an alternative scheme, if the number of factors to be decomposed is 64, fft _ addr0 is fftgroup _ num [2:0] < < 3; wherein fftgroup _ num [2:0] represents the value of 3 bits selected from 0, 1 and 2 of fftgroup _ num; < represents a left shift, and 3 represents the number of shifted bits, that is, the value of 3 bits of fftgroup _ num, 0, 1, and 2, is shifted left by 3 bits.
If the number of factors to be decomposed is 512, fft _ addr0 is fftgroup _ num [5:0] < < 3; wherein fftgroup _ num [5:0] represents 5 bits of fftgroup _ num 1, 2, 3, 4, 5, < < represents left shift.
The method for realizing FFT secondary process at high speed same address, address mapping of first conversion operation, access address mapping of conversion domain, address mapping of second conversion operation and data access address mapping after second conversion (8 access addresses can be taken each time to realize high speed operation processing under (8/4/2 butterfly) same address, and the addresses have no conflict in 8 RAM), thus realizing that
Referring to fig. 3, fig. 3 is a schematic diagram of a hardware structure of a processor for FFT and IFFT in the quadratic transform in the present application, as shown in fig. 4, and fig. 4 is a schematic diagram of a method of quadratic transform in the present application.
It will be appreciated that the user equipment, in order to carry out the above-described functions, comprises corresponding hardware and/or software modules for performing the respective functions. The present application is capable of being implemented in hardware or a combination of hardware and computer software in conjunction with the exemplary algorithm steps described in connection with the embodiments disclosed herein. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, with the embodiment described in connection with the particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In this embodiment, the electronic device may be divided into functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module may be implemented in the form of hardware. It should be noted that the division of the modules in this embodiment is schematic, and is only a logical function division, and in actual implementation, there may be another division manner.
In the case of dividing the functional modules according to the respective functions, fig. 5 shows a schematic diagram of a user equipment, and as shown in fig. 5, the UE500 may include: an acquisition unit 501 and a processing unit 502.
Among other things, the processing unit 502 may be used to support the user equipment in performing the above-described steps S202, S203, etc., and/or other processes for the techniques described herein.
The acquisition unit 501 may be used to support the user equipment to perform the above-described steps S201, etc., and/or other processes for the techniques described herein.
It should be noted that all relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
The network device provided by the embodiment is configured to execute step S201 in the method shown in fig. 2, so that the same effect as that of the implementation method can be achieved.
In case of an integrated unit, the user equipment may comprise a processing module, a storage module and a communication module. The processing module may be configured to control and manage actions of the user equipment, and for example, may be configured to support the electronic equipment to perform the steps performed by the obtaining unit 501 and the processing unit 502. The memory module may be used to support the electronic device in executing stored program codes and data, etc. The communication module can be used for supporting the communication between the electronic equipment and other equipment.
The processing module may be a processor or a controller. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure herein. A processor may also be a combination of computing functions, e.g., a combination of one or more microprocessors, Digital Signal Processing (DSP) and a microprocessor, or the like. The storage module may be a memory. The communication module may specifically be a radio frequency circuit, a bluetooth chip, a Wi-Fi chip, or other devices that interact with other electronic devices.
It should be understood that the interface connection relationship between the modules illustrated in the embodiment of the present application is only an exemplary illustration, and does not form a structural limitation on the user equipment. In other embodiments of the present application, the user equipment may also adopt different interface connection manners or a combination of multiple interface connection manners in the above embodiments.
Referring to fig. 6, fig. 6 is an electronic device 60 provided in an embodiment of the present application, where the electronic device 60 includes a processor 601, a memory 602, and a communication interface 603, and the processor 601, the memory 602, and the communication interface 603 are connected to each other through a bus.
The memory 602 includes, but is not limited to, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a portable read-only memory (CD-ROM), and the memory 602 is used for related computer programs and data. The communication interface 603 is used for receiving and transmitting data.
The processor 601 may be one or more Central Processing Units (CPUs), and in the case that the processor 601 is one CPU, the CPU may be a single-core CPU or a multi-core CPU.
In some embodiments, processor 601 may include one or more interfaces. The interface may include an inter-integrated circuit (I2C) interface, an inter-integrated circuit audio (I2S) interface, a Pulse Code Modulation (PCM) interface, a universal asynchronous receiver/transmitter (UART) interface, a Mobile Industry Processor Interface (MIPI), a general-purpose input/output (GPIO) interface, a SIM card interface, a USB interface, and/or the like. The USB interface is an interface conforming to the USB standard specification, and may specifically be a Mini USB interface, a Micro USB interface, a USB Type C interface, or the like. The USB interface can be used for connecting a charger to charge the user equipment, and can also be used for transmitting data between the user equipment and peripheral equipment. The USB interface can also be used for connecting an earphone and playing audio through the earphone.
If the electronic device 60 is a terminal side device, such as a user device, the processor 601 in the electronic device 60 is configured to read the computer program code stored in the memory 602, and perform the following operations:
acquiring data of sub-FFT and IFFT, if the data is smaller than a preset transformation size, performing zero padding processing on the data to obtain processed data, and determining the order stage of the Fast Fourier Transform (FFT) of the processed data; determining corresponding address mapping according to the stage and the decomposed factor number;
determining a stage access address according to the address mapping, performing operation on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing the IFFT operation with the same address on the output operation result to obtain a secondary FFT and IFFT conversion result.
All relevant contents of each scene related to the method embodiment may be referred to the function description of the corresponding function module, and are not described herein again.
If the electronic device 60 is a network device, such as a base station.
The embodiment of the present application further provides a chip system, where the chip system includes at least one processor, a memory and an interface circuit, where the memory, the transceiver and the at least one processor are interconnected by a line, and the at least one memory stores a computer program; the method flow shown in fig. 2 is implemented when the computer program is executed by the processor.
An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed on a network device, the method flow shown in fig. 2 is implemented.
An embodiment of the present application further provides a computer program product, and when the computer program product runs on a terminal, the method flow shown in fig. 2 is implemented.
Embodiments of the present application also provide a terminal including a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps in the method of the embodiment shown in fig. 2.
The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It will be appreciated that the electronic device, in order to carry out the functions described above, may comprise corresponding hardware structures and/or software templates for performing the respective functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software means for performing the steps of the various illustrated elements and algorithms described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware or a form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are presently preferred and that no acts or templates referred to are necessarily required by the application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other ways. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of units is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit may be stored in a computer readable memory if it is implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a memory and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer readable memory, which may include: flash Memory disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
Claims (10)
1. A method of quadratic FFT and IFFT transformation, the method comprising the steps of:
acquiring data subjected to secondary FFT and IFFT transformation, and determining the order stage of the first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number;
determining a stage access address according to the address mapping, performing first conversion on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing second conversion operation with the same address on the output operation result to obtain a second FFT and IFFT conversion result;
if the first transformation is: fast Fourier Transform (FFT), second FFT;
if the first transformation is: IFFT, second transform to FFT.
2. The method of claim 1 wherein the corresponding address mapping is determined according to the stage and the number of factors decomposed; determining the stage access address according to the address mapping specifically comprises:
determining a fast Fourier transform group value fftgroup _ num, a fast Fourier transform index value fftedx _ num and a log2_ num according to the stage and the decomposed factor number;
if the stage is not the last stage, determining the stage access address according to fftgroup _ num, fftidx _ max and log2_ num.
3. The method of claim 1, wherein determining the stage access address according to fftgroup _ max, fftidx _ num, fftidx _ max, and log2_ num specifically comprises:
fft_addr0＝fftidx_num+fftgroup_base；
fft_addrx＝fft_addr(x-1)+fftidx_max*x；
wherein, the value of x is an integer of [ 1,7 ];
fftgroup_base＝fftgroup_num<<log2_num。
4. the method of claim 1, wherein determining the corresponding address mapping according to the stage and the number of factors of decomposition; determining the stage access address according to the address mapping specifically comprises:
determining fftgroup _ num according to the stage and the decomposed factor number, and if the stage is the last stage, determining fft _ addr0 according to the specific bit of the fftgroup _ num and the decomposed factor number; and determining the subsequent fft _ addr according to the fft _ addr0, wherein the value of x is an integer of [ 1,7 ].
5. The method of claim 4, wherein the fft _ addr0 is determined according to the specific bits of the fftgroup _ num and the decomposed factor number; determining the subsequent fft _ addr according to fft _ addr0 specifically includes:
if the number of factors decomposed is: 64. at least one of the first and second optical fibers 512,
fft_addrx＝fft_addr0+x。
6. a User Equipment (UE), the UE comprising:
the acquisition unit is used for acquiring data of secondary FFT and IFFT;
a processing unit for determining an order stage of a first transformation of the data; determining corresponding address mapping according to the stage and the decomposed factor number; determining a stage access address according to the address mapping, performing first conversion on data of the access address to obtain an output operation result, writing the output operation result into the access address, and performing second conversion with the same address on the output operation result to obtain a secondary FFT and IFFT conversion result;
if the first transformation is: fast Fourier Transform (FFT), second FFT;
if the first transformation is: IFFT, second transform to FFT.
7. The user equipment of claim 6,
the processing unit is specifically configured to determine a fft group value fftgroup _ num, a fft index value fftidx _ max, and a log2_ num according to the stage and the decomposed factor number; if the stage is not the last stage, determining the stage access address according to fftgroup _ num, fftidx _ max and log2_ num.
8. An electronic device comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps of the method of any of claims 1-5.
9. A chip system, the chip system comprising at least one processor, a memory and an interface circuit, the memory, the transceiver and the at least one processor being interconnected by a line, the at least one memory having a computer program stored therein; the computer program, when executed by the processor, implements the method of any one of claims 1-5.
10. A computer-readable storage medium, in which a computer program is stored which, when run on a user equipment, performs the method of any one of claims 1-5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011250024.4A CN112511480B (en) | 2020-11-10 | 2020-11-10 | Secondary FFT or IFFT transformation method and related product |
| PCT/CN2021/129626 WO2022100584A1 (en) | 2020-11-10 | 2021-11-09 | Twice fft and ifft method, and related product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011250024.4A CN112511480B (en) | 2020-11-10 | 2020-11-10 | Secondary FFT or IFFT transformation method and related product |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112511480A true CN112511480A (en) | 2021-03-16 |
| CN112511480B CN112511480B (en) | 2022-11-01 |
Family
ID=74957657
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011250024.4A Active CN112511480B (en) | 2020-11-10 | 2020-11-10 | Secondary FFT or IFFT transformation method and related product |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112511480B (en) |
| WO (1) | WO2022100584A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022100584A1 (en) * | 2020-11-10 | 2022-05-19 | 展讯半导体(成都)有限公司 | Twice fft and ifft method, and related product |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6122703A (en) * | 1997-08-15 | 2000-09-19 | Amati Communications Corporation | Generalized fourier transform processing system |
| CN101184079A (en) * | 2007-12-24 | 2008-05-21 | 北京创毅视讯科技有限公司 | Frequency domain carrier channel estimation method and device |
| CN101339546A (en) * | 2008-08-07 | 2009-01-07 | 那微微电子科技（上海）有限公司 | Address mappings method and operand parallel FFT processing system |
| EP2013772A2 (en) * | 2006-04-28 | 2009-01-14 | Qualcomm Incorporated | Multi-port mixed-radix fft |
| US20100174769A1 (en) * | 2009-01-08 | 2010-07-08 | Cory Modlin | In-Place Fast Fourier Transform Processor |
| CN101887406A (en) * | 2010-06-10 | 2010-11-17 | 北京创毅视通科技有限公司 | FFT/IFFT processing method and FFT/IFFT processor |
| CN102043761A (en) * | 2011-01-04 | 2011-05-04 | 东南大学 | Fourier transform implementation method based on reconfigurable technology |
| US20140089366A1 (en) * | 2012-09-21 | 2014-03-27 | International Business Machines Corporation | Techniques for Improving the Efficiency of Mixed Radix Fast Fourier Transform |
| CN103699515A (en) * | 2013-12-27 | 2014-04-02 | 中国科学院计算技术研究所 | FFT (fast Fourier transform) parallel processing device and FFT parallel processing method |
| CN103970718A (en) * | 2014-05-26 | 2014-08-06 | 苏州威士达信息科技有限公司 | Quick Fourier transformation implementation device and method |
| CN104657335A (en) * | 2015-02-04 | 2015-05-27 | 航天科工深圳（集团）有限公司 | FFT (fast Fourier transform)-based data sampling method and FFT-based data sampling device |
| CN105718424A (en) * | 2016-01-26 | 2016-06-29 | 北京空间飞行器总体设计部 | Parallel and rapid Fourier conversion processing method |
| CN106339353A (en) * | 2015-07-13 | 2017-01-18 | 无锡华润矽科微电子有限公司 | Method supporting 4375-point and 3780-point FFT/IFFT and processor thereof |
| CN111597934A (en) * | 2020-04-30 | 2020-08-28 | 重庆科技学院 | System and method for processing training data for statistical applications |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6917955B1 (en) * | 2002-04-25 | 2005-07-12 | Analog Devices, Inc. | FFT processor suited for a DMT engine for multichannel CO ADSL application |
| CN103259758B (en) * | 2013-05-27 | 2016-04-06 | 重庆邮电大学 | A kind of ofdm communication system based on companding and method |
| CN112511480B (en) * | 2020-11-10 | 2022-11-01 | 展讯半导体(成都)有限公司 | Secondary FFT or IFFT transformation method and related product |
-
2020
- 2020-11-10 CN CN202011250024.4A patent/CN112511480B/en active Active
-
2021
- 2021-11-09 WO PCT/CN2021/129626 patent/WO2022100584A1/en active Application Filing
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6122703A (en) * | 1997-08-15 | 2000-09-19 | Amati Communications Corporation | Generalized fourier transform processing system |
| EP2013772A2 (en) * | 2006-04-28 | 2009-01-14 | Qualcomm Incorporated | Multi-port mixed-radix fft |
| CN101184079A (en) * | 2007-12-24 | 2008-05-21 | 北京创毅视讯科技有限公司 | Frequency domain carrier channel estimation method and device |
| CN101339546A (en) * | 2008-08-07 | 2009-01-07 | 那微微电子科技（上海）有限公司 | Address mappings method and operand parallel FFT processing system |
| US20100174769A1 (en) * | 2009-01-08 | 2010-07-08 | Cory Modlin | In-Place Fast Fourier Transform Processor |
| CN101887406A (en) * | 2010-06-10 | 2010-11-17 | 北京创毅视通科技有限公司 | FFT/IFFT processing method and FFT/IFFT processor |
| CN102043761A (en) * | 2011-01-04 | 2011-05-04 | 东南大学 | Fourier transform implementation method based on reconfigurable technology |
| US20140089366A1 (en) * | 2012-09-21 | 2014-03-27 | International Business Machines Corporation | Techniques for Improving the Efficiency of Mixed Radix Fast Fourier Transform |
| CN103699515A (en) * | 2013-12-27 | 2014-04-02 | 中国科学院计算技术研究所 | FFT (fast Fourier transform) parallel processing device and FFT parallel processing method |
| CN103970718A (en) * | 2014-05-26 | 2014-08-06 | 苏州威士达信息科技有限公司 | Quick Fourier transformation implementation device and method |
| CN104657335A (en) * | 2015-02-04 | 2015-05-27 | 航天科工深圳（集团）有限公司 | FFT (fast Fourier transform)-based data sampling method and FFT-based data sampling device |
| CN106339353A (en) * | 2015-07-13 | 2017-01-18 | 无锡华润矽科微电子有限公司 | Method supporting 4375-point and 3780-point FFT/IFFT and processor thereof |
| CN105718424A (en) * | 2016-01-26 | 2016-06-29 | 北京空间飞行器总体设计部 | Parallel and rapid Fourier conversion processing method |
| CN111597934A (en) * | 2020-04-30 | 2020-08-28 | 重庆科技学院 | System and method for processing training data for statistical applications |
Non-Patent Citations (3)
| Title |
|---|
| LAN-XIANG JIANG等: ""A novel overall in-place in-order prime factor FFT algorithm"", 《IEEE》 * |
| 王亚彬: ""实时高分辨率SAR成像的FPGA实现"", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
| 王冬格: ""TDS-OFDM系统中快速傅里叶变换（FFT）处理器的研究与实现"", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022100584A1 (en) * | 2020-11-10 | 2022-05-19 | 展讯半导体(成都)有限公司 | Twice fft and ifft method, and related product |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022100584A1 (en) | 2022-05-19 |
| CN112511480B (en) | 2022-11-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108363737B (en) | Data format conversion method, device and equipment | |
| CN112383497B (en) | OFDM conversion method in 5G system and related product | |
| CN112511480B (en) | Secondary FFT or IFFT transformation method and related product | |
| CN111814957B (en) | Neural network operation method and related equipment | |
| CN111210004B (en) | Convolution calculation method, convolution calculation device and terminal equipment | |
| CN111026697A (en) | Inter-core communication method, inter-core communication system, electronic device and electronic equipment | |
| CN109933595B (en) | Internet of things equipment information sharing system and device and terminal equipment | |
| US8788558B2 (en) | Method and device for transform computation | |
| CN113286174A (en) | Video frame extraction method and device, electronic equipment and computer readable storage medium | |
| CN110991088A (en) | Cable model construction method and system, terminal device and storage medium | |
| CN115878949A (en) | Signal processing method and related equipment | |
| CN114218175A (en) | Resource cross-platform sharing method and device, terminal equipment and storage medium | |
| CN112349277A (en) | Feature domain voice enhancement method combined with AI model and related product | |
| CN111193648B (en) | Data transmission method for reducing CAN bus load, terminal equipment and storage medium | |
| CN112558885B (en) | Memory using method of functional mobile phone and related product | |
| CN113420860A (en) | Memory smart card, device, network, method and computer storage medium | |
| CN111125715A (en) | TCG data processing acceleration method and device based on solid state disk, computer equipment and storage medium | |
| CN113487033B (en) | Reasoning method and device using graphic processor as execution core | |
| CN111124974B (en) | Interface expanding device and method | |
| CN111161135B (en) | Picture conversion method and related product | |
| CN112199226B (en) | Problem determination method and related product | |
| CN112579040B (en) | Recording method of embedded equipment and related product | |
| CN111815749A (en) | Particle calculation method, particle calculation device, electronic equipment and computer-readable storage medium | |
| CN114679254A (en) | Plaintext processing method and device and terminal equipment | |
| Kocak et al. | Exploiting the power of gpus for multi-gigabit wireless baseband processing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |