CN115544438A - Twiddle factor generation method and device in digital communication system and computer equipment - Google Patents

Twiddle factor generation method and device in digital communication system and computer equipment Download PDF

Info

Publication number
CN115544438A
CN115544438A CN202211496163.4A CN202211496163A CN115544438A CN 115544438 A CN115544438 A CN 115544438A CN 202211496163 A CN202211496163 A CN 202211496163A CN 115544438 A CN115544438 A CN 115544438A
Authority
CN
China
Prior art keywords
twiddle factor
twiddle
memory
transformation
factor reference
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
Application number
CN202211496163.4A
Other languages
Chinese (zh)
Other versions
CN115544438B (en
Inventor
贾有朋
檀甲甲
倪海峰
丁克忠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Chuangxin Huilian Technology Co ltd
Original Assignee
Nanjing Chuangxin Huilian Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing Chuangxin Huilian Technology Co ltd filed Critical Nanjing Chuangxin Huilian Technology Co ltd
Priority to CN202211496163.4A priority Critical patent/CN115544438B/en
Publication of CN115544438A publication Critical patent/CN115544438A/en
Application granted granted Critical
Publication of CN115544438B publication Critical patent/CN115544438B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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
    • 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
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Complex Calculations (AREA)

Abstract

The application relates to a twiddle factor generation method, a twiddle factor generation device and computer equipment in a digital communication system. The method is based on the small amount of memory
Figure 939167DEST_PATH_IMAGE002
The individual twiddle factor reference values are used by interpolation algorithms to generate twiddle factors for use by the DFT, IDFT, FFT, and IFFT transforms in performing the various stages of the butterfly. The data volume of the twiddle factors stored in the memory of the method is less, the twiddle factors do not need to be respectively stored aiming at DFT/IDFT transformation and FFT/IFFT transformation, the multiplexing of twiddle factor reference values and the sharing of hardware resources can be realized, and the storage space and the hardware resources occupied by the twiddle factors are reduced.

Description

Twiddle factor generation method and device in digital communication system and computer equipment
Technical Field
The present application relates to the field of digital communication technologies, and in particular, to a twiddle factor generation method and apparatus in a digital communication system, and a computer device.
Background
For digital communication systems such as LTE (Long Term Evolution), NR (New Radio, new air interface) and the like that involve Orthogonal Frequency Division Multiplexing (OFDM), uplink of such digital communication systems generally adopts single carrier transmission based on DFT spread OFDM (DFTs _ OFDM) to reduce power loss, and DFT (Discrete Fourier Transform) and IFFT (Inverse Fast Fourier Transform) are sequentially implemented on uplink transmission links for data to be transmitted. On the uplink, FFT (Fast Fourier Transform) and IDFT (Inverse Discrete Fourier Transform) are sequentially performed on the received data.
The DFT transformation/IDFT transformation and the IFFT transformation/FFT transformation are both realized by adopting a butterfly operation unit for calculation, and twiddle factors are required to be used in the transformation process. The IDFT transform works similarly to the DFT transform, which is exemplified by the DFT transform
Figure 710034DEST_PATH_IMAGE001
The DFT of the point needs to be decomposed by using a 2/3/4/5 butterfly basis and execute multi-stage butterfly operation, and the expression of a twiddle factor used by each stage of butterfly operation is
Figure 892753DEST_PATH_IMAGE002
Wherein
Figure 141332DEST_PATH_IMAGE003
is the number of DFT points for the current stage butterfly,
Figure 739804DEST_PATH_IMAGE004
，
Figure 23017DEST_PATH_IMAGE005
，
Figure 314321DEST_PATH_IMAGE006
is the butterfly radix employed by the current stage of butterfly operations,
Figure 846934DEST_PATH_IMAGE007
one of 2, 3, 4 and 5 is taken. Similarly, the IFFT/FFT transformation also needs to use the rotation factor
Figure 514676DEST_PATH_IMAGE008
。
Because the calculation of the twiddle factors required by each level of butterfly operation according to the expression in real time affects the operation speed and is difficult to meet the requirement of rapidity of a digital communication system, the common method generally stores the twiddle factors under various points in advance and correspondingly searches and uses the twiddle factors when in use. Therefore, the DFT/IDFT and IFFT/FFT require a respective set of hardware resources to implement the storage and search operations, but the number of twiddle factors is large, which occupies a large amount of storage space and hardware resources.
Disclosure of Invention
In view of the above, it is necessary to provide a twiddle factor generation method, apparatus, computer device, computer readable storage medium, and computer program product in a digital communication system capable of generating twiddle factors required for DFT transform/IDFT transform and IFFT transform/FFT transform with less memory space and hardware resources.
In a first aspect, the present application provides a twiddle factor generation method in a digital communication system. The twiddle factor generation method comprises the following steps:
based on storage in memory
Figure 386817DEST_PATH_IMAGE009
Each twiddle factor reference value, twiddle factors used for executing butterfly operation at each level in the process of generating time-frequency transformation by utilizing interpolation algorithm
Figure 645760DEST_PATH_IMAGE010
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 868931DEST_PATH_IMAGE009
The twiddle factor reference values include: base (C)In that
Figure 307740DEST_PATH_IMAGE011
To be circumferentially arranged with
Figure 299967DEST_PATH_IMAGE012
Obtained by dividing by unit angle
Figure 995390DEST_PATH_IMAGE013
According to the parameter
Figure 705857DEST_PATH_IMAGE014
In a monotonic order of values
Figure 449822DEST_PATH_IMAGE009
The value of each of the plurality of values,
Figure 296556DEST_PATH_IMAGE013
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 897301DEST_PATH_IMAGE015
and does not exceed a predetermined threshold.
In one embodiment, the twiddle factor required in the time-frequency transformation process is generated
Figure 829485DEST_PATH_IMAGE016
The method comprises the following steps:
determining parameters when performing a current level butterfly of the time-frequency transform
Figure 377141DEST_PATH_IMAGE017
，
Figure 140698DEST_PATH_IMAGE018
And
Figure 115607DEST_PATH_IMAGE019
point number of current-stage butterfly operation based on time-frequency transformation
Figure 33622DEST_PATH_IMAGE020
And the determination of the butterfly basis used,
Figure 181707DEST_PATH_IMAGE021
is a twiddle factor used by time-frequency transformation
Figure 3032DEST_PATH_IMAGE016
Unit angle of
Figure 148843DEST_PATH_IMAGE022
The unit angle between two adjacent twiddle factor reference values
Figure 55619DEST_PATH_IMAGE023
The multiple relationship between them;
based on parameters
Figure 945078DEST_PATH_IMAGE024
Integer part of
Figure 683227DEST_PATH_IMAGE025
Determining two consecutive twiddle factor reference values stored in a memory as target twiddle factor reference values;
interpolation operation is carried out on the two target twiddle factor reference values by utilizing an interpolation algorithm to obtain twiddle factors required by the current-stage butterfly operation for executing time-frequency transformation
Figure 265518DEST_PATH_IMAGE026
。
In one embodiment, stored in memory
Figure 394011DEST_PATH_IMAGE027
The individual twiddle factor reference values are unsigned numbers,
Figure 87160DEST_PATH_IMAGE028
and stored in a memory
Figure 116034DEST_PATH_IMAGE027
A rotation reasonThe sub-reference value is based on
Figure 665964DEST_PATH_IMAGE029
To be circumferentially arranged with
Figure 281753DEST_PATH_IMAGE030
Obtained by dividing by unit angle
Figure 778593DEST_PATH_IMAGE031
N of the individual values being smallest
Figure 225755DEST_PATH_IMAGE032
And (4) taking values.
In one embodiment, the method of determining two target twiddle factor reference values comprises:
when in use
Figure 884270DEST_PATH_IMAGE033
Determining a corresponding target twiddle factor reference value
Figure 987355DEST_PATH_IMAGE034
；
When in use
Figure 22307DEST_PATH_IMAGE035
Determining a corresponding target twiddle factor reference value
Figure 792817DEST_PATH_IMAGE037
；
When in use
Figure 418970DEST_PATH_IMAGE038
Determining a corresponding target twiddle factor reference value
Figure 274931DEST_PATH_IMAGE040
；
When the temperature is higher than the set temperature
Figure 612109DEST_PATH_IMAGE042
Determining a corresponding target twiddle factor reference value
Figure 971546DEST_PATH_IMAGE044
；
When in use
Figure 237442DEST_PATH_IMAGE045
Determining a corresponding target twiddle factor reference value
Figure 315120DEST_PATH_IMAGE047
；
When in use
Figure 691875DEST_PATH_IMAGE049
Determining a corresponding target twiddle factor reference value
Figure 171397DEST_PATH_IMAGE051
；
When in use
Figure 608195DEST_PATH_IMAGE052
Determining a corresponding target twiddle factor reference value
Figure 969906DEST_PATH_IMAGE054
；
When in use
Figure 150352DEST_PATH_IMAGE055
Determining a corresponding target twiddle factor reference value
Figure 982916DEST_PATH_IMAGE057
；
Wherein the function
Figure 325036DEST_PATH_IMAGE058
Representing storage in a memory
Figure 377306DEST_PATH_IMAGE059
A first one of the twiddle factor reference values
Figure 892601DEST_PATH_IMAGE060
Rotary wrenchThe value of the conversion factor is referred to as the reference value,
Figure 346716DEST_PATH_IMAGE061
to indicate the second in the memory
Figure 859737DEST_PATH_IMAGE060
The real part of the reference value of the individual twiddle factors,
Figure 196040DEST_PATH_IMAGE062
to indicate the second in the memory
Figure 452709DEST_PATH_IMAGE060
An imaginary part of each twiddle factor reference value;
determining
Figure 761331DEST_PATH_IMAGE063
Corresponding target twiddle factor reference value
Figure 710832DEST_PATH_IMAGE064
Obtaining two target twiddle factor reference values
Figure 268852DEST_PATH_IMAGE065
And
Figure 93327DEST_PATH_IMAGE064
。
in one embodiment, the interpolation algorithm is used for interpolating the reference values of the two target twiddle factors to obtain the twiddle factors
Figure 990875DEST_PATH_IMAGE066
The method comprises the following steps:
performing linear average interpolation on the reference values of the two target rotation factors by using an average interpolation method to determine
Figure 908016DEST_PATH_IMAGE067
Wherein
Figure 422174DEST_PATH_IMAGE065
is based on
Figure 20645DEST_PATH_IMAGE068
Determining the obtained reference value of the target twiddle factor,
Figure 38280DEST_PATH_IMAGE064
is based on
Figure 391901DEST_PATH_IMAGE069
Determining the obtained reference value of the target twiddle factor,
Figure 862197DEST_PATH_IMAGE070
pair of representations
Figure 529938DEST_PATH_IMAGE071
Shifting right by one position;
or, according to the parameters
Figure 198817DEST_PATH_IMAGE072
Fractional part of
Figure 661022DEST_PATH_IMAGE073
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 406166DEST_PATH_IMAGE066
。
In one embodiment, the parameters are based on
Figure 408757DEST_PATH_IMAGE074
Fractional part of
Figure 135405DEST_PATH_IMAGE073
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 34090DEST_PATH_IMAGE066
The method comprises the following steps:
determining
Figure 275716DEST_PATH_IMAGE075
Wherein
Figure 19681DEST_PATH_IMAGE076
is a parameter
Figure 928731DEST_PATH_IMAGE074
Fractional part of
Figure 467160DEST_PATH_IMAGE077
The bit-width of (a) is,
Figure 664923DEST_PATH_IMAGE078
presentation pair
Figure 9317DEST_PATH_IMAGE079
Move to the right
Figure 710556DEST_PATH_IMAGE080
The number of bits is,
Figure 685466DEST_PATH_IMAGE081
represents moving left to 1
Figure 167263DEST_PATH_IMAGE082
A bit.
In one embodiment, the parameters are based on
Figure 17145DEST_PATH_IMAGE083
Fractional part of
Figure 572891DEST_PATH_IMAGE084
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 984281DEST_PATH_IMAGE085
The method comprises the following steps:
is determined when
Figure 891057DEST_PATH_IMAGE086
When the utility model is used, the water is discharged,
Figure 577253DEST_PATH_IMAGE087
otherwise
Figure 518664DEST_PATH_IMAGE088
(ii) a Wherein,
Figure 569797DEST_PATH_IMAGE089
represents moving left to 1
Figure 963869DEST_PATH_IMAGE090
The bits, wherein,
Figure 453756DEST_PATH_IMAGE091
is a parameter
Figure 249674DEST_PATH_IMAGE092
Fractional part of
Figure 235822DEST_PATH_IMAGE084
Is determined.
In one embodiment, different points are stored in the memory
Figure 913928DEST_PATH_IMAGE093
Corresponding multiple relation
Figure 879610DEST_PATH_IMAGE094
Multiple relation
Figure 530034DEST_PATH_IMAGE094
Including integer parts and fractional parts, and multiple relation
Figure 250866DEST_PATH_IMAGE094
Is an unsigned number;
determining parameters when performing a time-frequency transform for a current stage butterfly operation
Figure 619530DEST_PATH_IMAGE095
The method comprises the following steps:
reading the number of points of butterfly operation of the current stage from the memory
Figure 388903DEST_PATH_IMAGE096
Corresponding multiple relation
Figure 893834DEST_PATH_IMAGE094
And calculating to obtain parameters
Figure 988829DEST_PATH_IMAGE097
。
In a second aspect, the present application further provides a twiddle factor generation apparatus in a digital communication system. The twiddle factor generating device is used for generating twiddle factors based on the data stored in the memory
Figure 641527DEST_PATH_IMAGE098
The twiddle factor reference value is generated by interpolation algorithm, and the twiddle factor used in executing butterfly operation of each stage in time-frequency transformation process
Figure 949012DEST_PATH_IMAGE099
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 72563DEST_PATH_IMAGE098
The twiddle factor reference values include: based on
Figure 135197DEST_PATH_IMAGE100
To be circumferentially arranged with
Figure 947295DEST_PATH_IMAGE101
Obtained by division at a unit angle
Figure 386367DEST_PATH_IMAGE102
According to the parameters
Figure 865890DEST_PATH_IMAGE103
In a monotonically ordered arrangement of values
Figure 302687DEST_PATH_IMAGE098
The value of each of the plurality of the values,
Figure 602082DEST_PATH_IMAGE102
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 313686DEST_PATH_IMAGE104
and does not exceed a predetermined threshold.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory and a processor, the memory stores computer programs, characterized in that the memory also stores computer programs
Figure 647715DEST_PATH_IMAGE098
A twiddle factor reference value, stored in memory
Figure 52152DEST_PATH_IMAGE098
The twiddle factor reference values include: based on
Figure 104421DEST_PATH_IMAGE105
Make a circle in
Figure 557399DEST_PATH_IMAGE106
Obtained by division at a unit angle
Figure 808252DEST_PATH_IMAGE102
According to the parameter
Figure 85387DEST_PATH_IMAGE103
In a monotonic order of values
Figure 359374DEST_PATH_IMAGE098
The value of each of the plurality of the values,
Figure 678360DEST_PATH_IMAGE102
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 721402DEST_PATH_IMAGE107
and does not exceed a predetermined threshold;
based on memory storage when the processor executes the computer program
Figure 670904DEST_PATH_IMAGE098
The individual twiddle factor reference values implement the steps in the twiddle factor generation method in the digital communication system of the first aspect.
The twiddle factor generating method, the device and the computer equipment in the digital communication system store the values of partial twiddle factors in a memory as
Figure 228924DEST_PATH_IMAGE098
The twiddle factor reference values are stored, and the twiddle factors used by DFT transformation, IDFT transformation, FFT transformation and IFFT transformation in executing butterfly operation of each stage can be generated by utilizing an interpolation operation method based on the stored twiddle factor reference values
Figure 289284DEST_PATH_IMAGE108
. The data volume of the twiddle factors stored in the memory is less, the storage space occupied by the twiddle factors is reduced, the twiddle factors do not need to be respectively stored aiming at DFT/IDFT transformation and FFT/IFFT transformation, the multiplexing of twiddle factor reference values and the sharing of hardware resources can be realized, and the storage space and the hardware resources occupied by the twiddle factors are further reduced.
The method utilizes an interpolation operation method to quickly and conveniently generate the twiddle factor, does not have more complicated addition and multiplication operations, has lower operation complexity, does not need to be realized by using a complicated logic circuit, occupies less hardware resources, can finish the calculation of the twiddle factor in one cycle of hardware, and meets the time sequence requirement.
Drawings
Fig. 1 is a communication link transmission diagram of a digital communication system to which a twiddle factor generation method is applied in one embodiment.
FIG. 2 is a flow diagram illustrating a twiddle factor generation method according to one embodiment.
Fig. 3 is a block diagram showing a structure of a twiddle factor generating apparatus according to an embodiment.
FIG. 4 is a diagram illustrating an internal structure of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
The method for generating the twiddle factors in the digital communication system provided by the embodiment of the application can be applied to digital communication systems such as LTE and NR which adopt orthogonal frequency division multiplexing technology, the digital communication systems are used for realizing digital communication between a base station and user terminal equipment (UE), the UE can be but not limited to various personal computers, notebook computers, smart phones, tablet computers, internet of things equipment and portable wearable equipment, and the internet of things equipment can be smart speakers, smart televisions, smart air conditioners, smart car-mounted equipment and the like. The portable wearable device can be a smart watch, a smart bracelet, a head-mounted device, and the like. In LTE systems, the base station is called eNodeB, and in NR systems, the base station is called gdnodeb.
Referring to fig. 1, in an uplink transmission link of the digital communication system, after pre-processing operations such as bit level processing, scrambling modulation, layer mapping, etc., data to be transmitted is converted into subcarrier data in a frequency domain by DFT through a fast fourier transform core, then subjected to subcarrier mapping, converted into time domain data by IFFT through the fast fourier transform core, and transmitted by radio frequency after post-processing operations such as CP (Cyclic Prefix) addition and subcarrier offset. The uplink receiving link and the uplink sending link of the digital communication system are dual, received data are subjected to pretreatment operations such as cyclic prefix CP removal, FFT (fast Fourier transform) is realized by a fast Fourier transform core, then subcarrier mapping is removed, IDFT (inverse discrete Fourier transform) is realized by the fast Fourier transform core and converted into time domain signals, and then the receiving is completed through corresponding post-treatment operations.
In one embodiment, as shown in fig. 2, a twiddle factor generation method is provided, which is illustrated by way of example in the application of the method to the link structure of the digital communication system in fig. 1. The DFT transformation and the IDFT transformation are inverse transformation, and the transformation principle is the same. The FFT transform and the IFFT transform are inverse transforms to each other, and the transform principle is the same. The transform processes of DFT transform and FFT transform are also substantially the same, so as shown in fig. 1, it can be considered that DFT transform, IDFT transform, FFT transform and IFFT transform are all implemented by a fast fourier transform core through computation by a butterfly operation unit, and only the butterfly bases used by the fast fourier transform core to implement DFT transform and IDFT transform are different from the butterfly bases used to implement FFT transform and IFFT transform, for example, the butterfly bases used to implement DFT transform and IDFT transform include radix-2 butterfly base, radix-3 butterfly base, radix-4 butterfly base and radix-5 butterfly base, and the butterfly bases used to implement FFT transform and IFFT transform include radix-2 butterfly base and radix-5 butterfly base. Therefore, the twiddle factor generation method provided by the present application can be considered as a method executed by the fast fourier transform kernel, and the method is based on the twiddle factor generation method stored in the memory
Figure 452412DEST_PATH_IMAGE109
A twiddle factor reference value, which
Figure 369552DEST_PATH_IMAGE109
The values of the reference values of the rotation factors are as follows:
based on
Figure 618131DEST_PATH_IMAGE110
In the form of a circle
Figure 482182DEST_PATH_IMAGE111
Is obtained by dividing by a unit angle
Figure 998352DEST_PATH_IMAGE112
According to the parameter
Figure 351972DEST_PATH_IMAGE113
Also the values of the monotonic order ofI.e. such as to take in sequence
Figure 822268DEST_PATH_IMAGE114
That is, all parameters per unit can be obtained
Figure 21168DEST_PATH_IMAGE113
Arranged in monotonically increasing order
Figure 158889DEST_PATH_IMAGE112
And (4) taking values.
Figure 621094DEST_PATH_IMAGE112
For the maximum value of the number of points for implementing the FFT and IFFT in the digital communication system, the number of points for implementing the FFT and IFFT in the LTE system may be 128, 256, 1024, 1536, and 2048, and then the maximum value of the number of points for implementing the FFT and IFFT in the LTE system. The number of points for implementing FFT and IFFT in the NR system may be 128, 256, 1024, 1536, 2048, 4096, and the maximum value of the number of points for implementing FFT and IFFT in the NR system
Figure 375423DEST_PATH_IMAGE115
。
This is taken in the present application
Figure 846856DEST_PATH_IMAGE112
Continuity in individual values
Figure 573503DEST_PATH_IMAGE109
Each value is taken as
Figure 3348DEST_PATH_IMAGE109
The individual twiddle factor reference values are stored in a memory,
Figure 448236DEST_PATH_IMAGE116
and does not exceed a predetermined threshold. In one embodiment, direct fetching is performed to reduce data storage to the extent that the scheme can be implemented
Figure 254518DEST_PATH_IMAGE117
I.e. only storing all of the obtained
Figure 101251DEST_PATH_IMAGE112
In each value
Figure 403794DEST_PATH_IMAGE118
Then 256 twiddle factor reference values are saved for the LTE system and 512 twiddle factor reference values are saved for the NR system.
This is achieved by
Figure 335978DEST_PATH_IMAGE109
The twiddle factor reference value may be all
Figure 945951DEST_PATH_IMAGE112
The succession of the beginning of any one of the values
Figure 647191DEST_PATH_IMAGE109
A value, but in order to facilitate subsequent operations and calculations, in one embodiment, all are taken
Figure 418837DEST_PATH_IMAGE112
Parameters in individual values
Figure 838317DEST_PATH_IMAGE119
Minimum size
Figure 189664DEST_PATH_IMAGE109
Each value is taken as
Figure 807728DEST_PATH_IMAGE109
Storing, i.e. retrieving, a twiddle factor reference value
Figure 687959DEST_PATH_IMAGE120
Before time corresponds to
Figure 594735DEST_PATH_IMAGE109
And (4) taking values.
Due to the fact that
Figure 546510DEST_PATH_IMAGE109
The twiddle factor reference values are all positive numbers, and thus in one embodiment,
Figure 956763DEST_PATH_IMAGE109
the individual twiddle factor reference values are unsigned numbers, i.e. are stored only
Figure 335792DEST_PATH_IMAGE109
The data valid bit of each twiddle factor reference value reduces the storage space occupied by the sign bit.
Has stored in the memory
Figure 962820DEST_PATH_IMAGE109
In the case of a twiddle factor reference value, the method is based on the values stored in the memory
Figure 452707DEST_PATH_IMAGE109
The twiddle factor reference value is used for generating twiddle factors used for executing butterfly operations of all levels in the time-frequency transformation process by utilizing an interpolation algorithm
Figure 983046DEST_PATH_IMAGE121
Here, the time-frequency transform includes DFT transform, IDFT transform, FFT transform, and IFFT transform.
This includes two meanings: for the uplink transmission link, based on storage in memory
Figure 736238DEST_PATH_IMAGE109
Generating twiddle factors needed by DFT conversion from twiddle factor reference value
Figure 352027DEST_PATH_IMAGE121
And generating the twiddle factors required for the IFFT transform
Figure 645605DEST_PATH_IMAGE121
. For the uplink receiving link, based on storage in memory
Figure 30450DEST_PATH_IMAGE109
The twiddle factor reference value generates the twiddle factor needed by FFT transformation
Figure 751282DEST_PATH_IMAGE121
And generating twiddle factors required for IDFT transform
Figure 854367DEST_PATH_IMAGE121
。
Unlike the conventional method, two sets of hardware resources are required to be arranged for storing twiddle factors of DFT (discrete Fourier transform) and IDFT (inverse discrete Fourier transform) and for storing twiddle factors of FFT (fast Fourier transform) and IFFT (inverse fast Fourier transform), and the twiddle factors required by DFT and IDFT are generated and used in the memory when the twiddle factors required by FFT and IFFT are generated
Figure 686057DEST_PATH_IMAGE109
The twiddle factor reference value realizes the multiplexing of data and the sharing of hardware resources, and reduces the occupation of storage resources and hardware resources. In addition, the method of the application is stored in a memory
Figure 190987DEST_PATH_IMAGE109
The data size of each twiddle factor reference value is very limited, and the occupied storage space is small.
In the above method, twiddle factors required in the DFT transform, IDFT transform, FFT transform, and IFFT transform are generated
Figure 20403DEST_PATH_IMAGE122
The methods are all the same, and the twiddle factors required by any one of the time-frequency transformation are generated
Figure 407522DEST_PATH_IMAGE122
The method of (2) comprises the following steps, please refer to the embodiment shown in fig. 2:
step 220, determining the parameters for performing the time-frequency transformation of the butterfly operation of the current stage
Figure 479121DEST_PATH_IMAGE123
。
Twiddle factor of time-frequency transformation
Figure 104137DEST_PATH_IMAGE122
Is expressed as
Figure 166771DEST_PATH_IMAGE124
Wherein
Figure 244449DEST_PATH_IMAGE125
representing the number of points for the butterfly operation of the current stage,
Figure 355624DEST_PATH_IMAGE126
the number of stages representing the butterfly operation of the current stage is a parameter starting from 0. The butterfly radix adopted by the current stage of butterfly operation is
Figure 631885DEST_PATH_IMAGE127
For example, common butterfly bases for DFT transforms include radix-2 butterfly bases, radix-3 butterfly bases, radix-4 butterfly bases, and radix-5 butterfly bases, and thus
Figure 68682DEST_PATH_IMAGE127
One of 2, 3, 4 and 5 is taken.
Number of points of level 0 butterfly
Figure 368077DEST_PATH_IMAGE128
Namely, the number of realized time-frequency transformation points is 34 for DFT transformation/IDFT transformation in the LTE system, and 53 for DFT transformation/IDFT transformation in the NR system. The number of points of FFT/IFFT in the LTE system is 5, 128, 256, 1024, 1536, and 2048, and 4096, i.e., 4096, can be adopted in the NR system. From
Figure 345260DEST_PATH_IMAGE129
Starting, the number of butterfly operations in the current stage
Figure 679289DEST_PATH_IMAGE130
。
Figure 286988DEST_PATH_IMAGE131
And
Figure 870416DEST_PATH_IMAGE132
number of points based on current level butterfly operation
Figure 87509DEST_PATH_IMAGE133
And the butterfly base used
Figure 338361DEST_PATH_IMAGE134
Determining, for the butterfly operation of the current stage
Figure 116962DEST_PATH_IMAGE135
In common with
Figure 125369DEST_PATH_IMAGE136
A seed value is respectively
Figure 444355DEST_PATH_IMAGE137
. Of butterfly operation in the current stage
Figure 752976DEST_PATH_IMAGE132
In common with
Figure 436899DEST_PATH_IMAGE134
A seed value is respectively
Figure 260498DEST_PATH_IMAGE138
。
Figure 320858DEST_PATH_IMAGE139
Is a twiddle factor used for time-frequency transformation
Figure 483986DEST_PATH_IMAGE140
Unit angle of
Figure 401127DEST_PATH_IMAGE141
The unit angle between two adjacent twiddle factor reference values
Figure 649705DEST_PATH_IMAGE142
Multiple relationship between them, i.e.
Figure 12291DEST_PATH_IMAGE143
。
In one embodiment, the current stage butterfly operation is obtained by calculation when the current stage butterfly operation of time-frequency transformation is performed
Figure 295505DEST_PATH_IMAGE144
And number of points based on current level butterfly operations
Figure 321230DEST_PATH_IMAGE145
Calculating to obtain multiple relation
Figure 57105DEST_PATH_IMAGE139
Then according to
Figure 521584DEST_PATH_IMAGE146
Calculating to obtain parameters
Figure 393725DEST_PATH_IMAGE147
。
In another embodiment, the multiple relationship is calculated
Figure 652668DEST_PATH_IMAGE139
The method involves division, consumes more computing resources, and therefore different points are counted in advance when hardware is implemented
Figure 875839DEST_PATH_IMAGE145
Corresponding multiple relation
Figure 81692DEST_PATH_IMAGE139
Stored in the memory relation, and then read from the memory when performing the butterfly operation of the current stageNumber of points of butterfly operation with current stage
Figure 870657DEST_PATH_IMAGE145
Corresponding multiple relation
Figure 238184DEST_PATH_IMAGE139
Then according to
Figure 745389DEST_PATH_IMAGE148
Calculating to obtain parameters
Figure 253469DEST_PATH_IMAGE149
。
Due to multiple relation
Figure 834623DEST_PATH_IMAGE150
Thus multiple relation
Figure 700947DEST_PATH_IMAGE139
Including integer and fractional parts, but in multiples
Figure 367552DEST_PATH_IMAGE139
Is positive number, and thus stores multiple relation
Figure 977525DEST_PATH_IMAGE139
Time, multiple relation
Figure 678765DEST_PATH_IMAGE139
For unsigned numbers, i.e. storing only multiples
Figure 653674DEST_PATH_IMAGE139
The data valid bit of (a). Assuming a multiple relationship
Figure 869892DEST_PATH_IMAGE139
Has a total bit width of
Figure 955659DEST_PATH_IMAGE151
Multiple relation
Figure 776985DEST_PATH_IMAGE139
Has a bit width of an integer part of
Figure 985112DEST_PATH_IMAGE152
Multiple relation of
Figure 891888DEST_PATH_IMAGE139
Is bit wide of
Figure 279882DEST_PATH_IMAGE153
The multiple relation
Figure 752452DEST_PATH_IMAGE139
Is scaled as
Figure 69164DEST_PATH_IMAGE154
Last identification bit
Figure 463236DEST_PATH_IMAGE155
Express the multiple relation
Figure 156385DEST_PATH_IMAGE139
Are unsigned numbers.
Figure 749041DEST_PATH_IMAGE156
And
Figure 236654DEST_PATH_IMAGE157
are all integers, therefore
Figure 852443DEST_PATH_IMAGE158
Is also an integer, provided that
Figure 349283DEST_PATH_IMAGE158
Has a total bit width of
Figure 796445DEST_PATH_IMAGE159
Then, then
Figure 454960DEST_PATH_IMAGE158
Is also bit wide
Figure 354783DEST_PATH_IMAGE159
Can be prepared by
Figure 622691DEST_PATH_IMAGE158
Is scaled as
Figure 189938DEST_PATH_IMAGE160
Last identification bit
Figure 284933DEST_PATH_IMAGE155
To represent
Figure 609735DEST_PATH_IMAGE158
Are unsigned numbers.
Thus obtained parameters
Figure 448378DEST_PATH_IMAGE161
Or both integer and fractional parts, and the parameters
Figure 870132DEST_PATH_IMAGE161
Integer part of
Figure 870449DEST_PATH_IMAGE162
Is bit wide as
Figure 744865DEST_PATH_IMAGE163
Parameter of
Figure 856040DEST_PATH_IMAGE164
Fractional part of
Figure 335563DEST_PATH_IMAGE165
Is bit wide as
Figure 569098DEST_PATH_IMAGE166
. Thus can be to the parameter
Figure 868492DEST_PATH_IMAGE164
Integer part of
Figure 845676DEST_PATH_IMAGE167
Is scaled as
Figure 678240DEST_PATH_IMAGE168
Denotes the integer part
Figure 285939DEST_PATH_IMAGE167
Is both the total bit width and the integer part bit width
Figure 72630DEST_PATH_IMAGE169
And the last identification bit
Figure 853504DEST_PATH_IMAGE155
Represent
Figure 776460DEST_PATH_IMAGE167
Are unsigned numbers. Can be used for the parameters
Figure 351798DEST_PATH_IMAGE164
Fractional part of
Figure 891364DEST_PATH_IMAGE165
Is scaled as
Figure 148033DEST_PATH_IMAGE170
Denotes the fractional part
Figure 456654DEST_PATH_IMAGE165
Both the total bit width and the fractional bit width of
Figure 202894DEST_PATH_IMAGE171
And the last identification bit
Figure 964176DEST_PATH_IMAGE155
To represent
Figure 821274DEST_PATH_IMAGE165
Are unsigned numbers.
Such as for example in an LTE system,
Figure 217358DEST_PATH_IMAGE172
assuming that the point number of the DFT transform is 1152, the DFT transform is decomposed into 4 × 3 × 2, that is, 3 levels of radix-4 butterflies, 2 levels of radix-3 butterflies, and 1 level of radix-2 butterflies are required, and there are 6 levels of butterflies:
number of points of level 0 butterfly
Figure 603340DEST_PATH_IMAGE173
The butterfly base used is the base-4 butterfly base, thus
Figure 648656DEST_PATH_IMAGE174
。
Figure 512707DEST_PATH_IMAGE175
，
Figure 795921DEST_PATH_IMAGE176
，
Figure 821646DEST_PATH_IMAGE177
,
Figure 557520DEST_PATH_IMAGE178
Multiple relation
Figure 22000DEST_PATH_IMAGE179
。
Number of points of level 1 butterfly
Figure 159720DEST_PATH_IMAGE180
The butterfly base used is the base-4 butterfly base, therefore
Figure 356346DEST_PATH_IMAGE181
。
Figure 101490DEST_PATH_IMAGE182
，
Figure 104081DEST_PATH_IMAGE183
Multiple relation
Figure 830728DEST_PATH_IMAGE184
。
Number of points of level 2 butterfly
Figure 526152DEST_PATH_IMAGE185
The butterfly base used is the base-4 butterfly base, thus
Figure 236619DEST_PATH_IMAGE186
。
Figure 715005DEST_PATH_IMAGE187
，
Figure 624055DEST_PATH_IMAGE188
Multiple relation
Figure 428063DEST_PATH_IMAGE189
。
Number of points of butterfly operation of level 3
Figure 360247DEST_PATH_IMAGE190
The butterfly base used is the base-3 butterfly base, thus
Figure 907903DEST_PATH_IMAGE191
。
Figure 671460DEST_PATH_IMAGE192
，
Figure 646369DEST_PATH_IMAGE193
Multiple relation
Figure 564384DEST_PATH_IMAGE194
。
Number of points of level 4 butterfly
Figure 915731DEST_PATH_IMAGE195
The butterfly base used is the base-3 butterfly base,thus, it is possible to provide
Figure 533794DEST_PATH_IMAGE196
。
Figure 945184DEST_PATH_IMAGE197
，
Figure 851960DEST_PATH_IMAGE198
Multiple relation
Figure 475839DEST_PATH_IMAGE199
。
Number of points of level 5 butterfly
Figure 417251DEST_PATH_IMAGE200
The butterfly base used is a base-2 butterfly base, thus
Figure 999542DEST_PATH_IMAGE201
。
Figure 190352DEST_PATH_IMAGE202
，
Figure 883501DEST_PATH_IMAGE203
Multiple relation
Figure 646795DEST_PATH_IMAGE204
。
As can be seen from the above example, even if the multiples are related
Figure 196725DEST_PATH_IMAGE205
Pre-stored, also only requiring a per point count
Figure 78094DEST_PATH_IMAGE206
Storing a multiple relationship
Figure 309355DEST_PATH_IMAGE205
The occupied storage space is also very limited.
Step 240, based on the parameters
Figure 756517DEST_PATH_IMAGE207
Integral part of (2)
Figure 149452DEST_PATH_IMAGE208
Determining two consecutive twiddle factor reference values stored in a memory as target twiddle factor reference values
Figure 314854DEST_PATH_IMAGE209
And
Figure 84227DEST_PATH_IMAGE210
。
determining two obtained target twiddle factor reference values
Figure 854737DEST_PATH_IMAGE209
And
Figure 684153DEST_PATH_IMAGE210
is that
Figure 336851DEST_PATH_IMAGE211
The nearest integer part of the twiddle factor reference value
Figure 175494DEST_PATH_IMAGE212
Two values of (a). Based on parameters
Figure 33466DEST_PATH_IMAGE207
Integer part of
Figure 33783DEST_PATH_IMAGE212
Determining two target twiddle factor reference values
Figure 908198DEST_PATH_IMAGE209
And
Figure 284953DEST_PATH_IMAGE210
the method comprises the following steps: based on
Figure 561214DEST_PATH_IMAGE212
Determining the obtained target twiddle factor reference value
Figure 732432DEST_PATH_IMAGE209
Based on
Figure 94143DEST_PATH_IMAGE213
And determining the obtained target twiddle factor reference value.
To be provided with
Figure 274589DEST_PATH_IMAGE214
For example, one embodiment provides
Figure 343039DEST_PATH_IMAGE215
Determining a target twiddle factor reference value
Figure 950738DEST_PATH_IMAGE209
The method comprises the following steps:
when in use
Figure 799745DEST_PATH_IMAGE216
Determining a corresponding target twiddle factor reference value
Figure 518302DEST_PATH_IMAGE217
。
When in use
Figure 205373DEST_PATH_IMAGE218
Determining a corresponding target twiddle factor reference value
Figure 780711DEST_PATH_IMAGE219
。
When in use
Figure 320277DEST_PATH_IMAGE220
Determining a corresponding target twiddle factor reference value
Figure 576946DEST_PATH_IMAGE221
。
When in use
Figure 682305DEST_PATH_IMAGE222
Determining a corresponding target twiddle factor reference value
Figure 366228DEST_PATH_IMAGE223
。
When in use
Figure 127510DEST_PATH_IMAGE224
Determining a corresponding target twiddle factor reference value
Figure 250187DEST_PATH_IMAGE225
。
When in use
Figure 413315DEST_PATH_IMAGE226
Determining a corresponding target twiddle factor reference value
Figure 268139DEST_PATH_IMAGE227
。
When in use
Figure 579034DEST_PATH_IMAGE228
Determining a corresponding target twiddle factor reference value
Figure 177506DEST_PATH_IMAGE229
。
When in use
Figure 991878DEST_PATH_IMAGE230
Determining a corresponding target twiddle factor reference value
Figure 47296DEST_PATH_IMAGE231
。
Based on the above method, the integer part
Figure 517592DEST_PATH_IMAGE232
Determining one of the target twiddle factor reference values
Figure 185334DEST_PATH_IMAGE233
. In each of the above cases, the function
Figure 854212DEST_PATH_IMAGE234
Representing storage in a memory
Figure 581997DEST_PATH_IMAGE235
A first one of the twiddle factor reference values
Figure 539589DEST_PATH_IMAGE236
The reference value of the rotation factor is used,
Figure 542180DEST_PATH_IMAGE237
to indicate the second in the memory
Figure 268827DEST_PATH_IMAGE236
The real part of the reference value of the individual twiddle factors,
Figure 964251DEST_PATH_IMAGE238
represents the first in the memory
Figure 409139DEST_PATH_IMAGE236
The imaginary part of the individual twiddle factor reference values.
Can be determined to obtain by the same way
Figure 153104DEST_PATH_IMAGE239
Corresponding target twiddle factor reference value
Figure 62154DEST_PATH_IMAGE240
One method is, can be based on the same method as above
Figure 99118DEST_PATH_IMAGE241
The corresponding target rotation factor reference value is determined in the range
Figure 296881DEST_PATH_IMAGE240
. Or alternatively, in determining the targetReference value of twiddle factor
Figure 641275DEST_PATH_IMAGE233
Then, directly determine
Figure 342514DEST_PATH_IMAGE235
According to parameters in a reference value of a rotation factor
Figure 114161DEST_PATH_IMAGE242
Arranged in monotonically increasing order
Figure 533641DEST_PATH_IMAGE233
One twiddle factor reference value is then another target twiddle factor reference value
Figure 681726DEST_PATH_IMAGE240
。
Step 260, using interpolation algorithm to reference two target twiddle factors
Figure 237472DEST_PATH_IMAGE233
And
Figure 648862DEST_PATH_IMAGE240
interpolation operation is carried out to obtain the twiddle factors required by the butterfly operation of the current stage for executing time-frequency transformation
Figure 352376DEST_PATH_IMAGE243
。
In one embodiment, the mean interpolation method is directly used to perform linear mean interpolation, i.e. to determine the reference value of the two target twiddle factors
Figure 976255DEST_PATH_IMAGE244
Wherein
Figure 714404DEST_PATH_IMAGE245
presentation pair
Figure 765537DEST_PATH_IMAGE246
And shifting right by one bit. In the field ofAs will be appreciated by those skilled in the art, in the field of bit manipulation, data is shifted to the right
Figure 658144DEST_PATH_IMAGE247
Bit representation divides data by
Figure 148031DEST_PATH_IMAGE248
Shift data to the left
Figure 943949DEST_PATH_IMAGE247
Bit representation data multiplication
Figure 431562DEST_PATH_IMAGE248
。
In another embodiment, the two target twiddle factor reference values are not directly referenced to
Figure 312930DEST_PATH_IMAGE233
And
Figure 340929DEST_PATH_IMAGE240
performing linear average interpolation, but further based on the parameters
Figure 725774DEST_PATH_IMAGE249
Fractional part of
Figure 446606DEST_PATH_IMAGE250
For two target twiddle factor reference values
Figure 549691DEST_PATH_IMAGE233
And
Figure 381381DEST_PATH_IMAGE240
interpolation operation is carried out to obtain a twiddle factor
Figure 620732DEST_PATH_IMAGE243
. The method for this embodiment provides two implementations as follows:
(1) Combining fractional parts by linear interpolation
Figure 512465DEST_PATH_IMAGE250
For two target twiddle factor reference values
Figure 102846DEST_PATH_IMAGE233
And
Figure 174445DEST_PATH_IMAGE240
performing interpolation operation to determine
Figure 596199DEST_PATH_IMAGE251
. Wherein,
Figure 862095DEST_PATH_IMAGE252
presentation pair
Figure 674193DEST_PATH_IMAGE253
Move to the right
Figure 316527DEST_PATH_IMAGE254
The number of bits is set to be,
Figure 796050DEST_PATH_IMAGE255
represents moving left to 1
Figure 232848DEST_PATH_IMAGE256
A bit.
Figure 797821DEST_PATH_IMAGE257
Is a parameter
Figure 712688DEST_PATH_IMAGE258
Fractional part of
Figure 109034DEST_PATH_IMAGE259
Is, as described above, the fractional part
Figure 949689DEST_PATH_IMAGE260
Bit wide of
Figure 1958DEST_PATH_IMAGE261
And therefore also have
Figure 517253DEST_PATH_IMAGE262
。
(2) Combining fractional parts by nearest neighbor difference method
Figure 971368DEST_PATH_IMAGE263
For two target twiddle factor reference values
Figure 749969DEST_PATH_IMAGE264
And
Figure 23955DEST_PATH_IMAGE265
performing interpolation operation to determine when
Figure 546203DEST_PATH_IMAGE266
When the utility model is used, the water is discharged,
Figure 651563DEST_PATH_IMAGE267
otherwise
Figure 335485DEST_PATH_IMAGE268
. Wherein,
Figure 96767DEST_PATH_IMAGE269
represents moving left to 1
Figure 219444DEST_PATH_IMAGE270
A bit. In the same way as above, the first and second,
Figure 881108DEST_PATH_IMAGE271
is a parameter
Figure 1510DEST_PATH_IMAGE258
Fractional part of
Figure 250089DEST_PATH_IMAGE263
Is therefore also the bit width of
Figure 910877DEST_PATH_IMAGE272
。
Compared with the traditional scheme of generating the twiddle factors based on the table look-up method: the traditional scheme of generating the twiddle factor based on the table look-up method needs to store each point
Figure 928512DEST_PATH_IMAGE273
Lower part
Figure 485395DEST_PATH_IMAGE274
Value of time
Figure 955691DEST_PATH_IMAGE275
Then based on
Figure 357853DEST_PATH_IMAGE276
The general formula (II) generates arbitrary values
Figure 292311DEST_PATH_IMAGE277
The rotation factor of time. However, as described above for the twiddle factor expression, the number of points is
Figure 20096DEST_PATH_IMAGE278
The rotation factor required by the butterfly operation of the current stage is selected from
Figure 476223DEST_PATH_IMAGE279
Determine based on
Figure 947655DEST_PATH_IMAGE280
And
Figure 674303DEST_PATH_IMAGE281
the value of each of them is selected,
Figure 307410DEST_PATH_IMAGE282
in common with
Figure 814614DEST_PATH_IMAGE283
Form a combined way
Figure 558579DEST_PATH_IMAGE284
A rotation factor of
Figure 202050DEST_PATH_IMAGE285
On the basis of the need for
Figure 271638DEST_PATH_IMAGE286
Are combined separately even at
Figure 938242DEST_PATH_IMAGE287
Fixed twiddle factor of
Figure 751477DEST_PATH_IMAGE288
On a non-storage basis, it is also necessary to count each point
Figure 515034DEST_PATH_IMAGE289
Store correspondences
Figure 988479DEST_PATH_IMAGE290
An
Figure 407959DEST_PATH_IMAGE291
The value in the case. Although this method can reduce the amount of data stored to some extent compared with the method of storing all twiddle factors, the number of points in the LTE system is limited
Figure 556043DEST_PATH_IMAGE292
There are 61 values, the number of points in the NR system
Figure 111789DEST_PATH_IMAGE292
There are 89 values, and different combinations
Figure 54338DEST_PATH_IMAGE293
The occupied storage space is still very large compared to the present application. And due to the fact that
Figure 961114DEST_PATH_IMAGE294
Therefore, in order to reduce the influence of the accumulated error, only the memory is not actually stored
Figure 850572DEST_PATH_IMAGE295
Value under circumstances
Figure 526404DEST_PATH_IMAGE296
The number of stored twiddle factors is further increased, and the higher the precision requirement is, the more twiddle factors need to be stored, and the larger the occupied storage space is. According to the method, a large number of twiddle factors do not need to be stored, and multiplexing can be realized on a small number of stored twiddle factor reference values, so that excessive storage area and hardware area do not need to be occupied, and the problem of accumulated errors does not exist.
Compared with the conventional cordic scheme for determining the twiddle factor: if the cordic scheme adopts an iteration method, although the resource consumption is low, the requirement on the number of cycles of the hardware is high, and if one iteration consumes one cycle of the hardware, 10 cycles are needed for calculating one twiddle factor, so that the cordic scheme is difficult to be applied to the situation of time sequence tension. If the cordic scheme adopts the pipeline scheme, although one twiddle factor can be calculated in one cycle of hardware to meet the timing requirement, the cordic scheme needs to be realized by adopting 30 adders and 20 shifters, and a large hardware area is occupied. The method has the advantages of low difficulty, high accuracy, no complex multiplication and addition operation, no need of using too many logic operation devices to occupy too much hardware area, and capability of completing calculation of a rotation factor in one cycle of hardware to meet the time sequence requirement.
It should be understood that, although the steps in the flowcharts related to the embodiments as described above are sequentially displayed as indicated by arrows, the steps are not necessarily performed sequentially as indicated by the arrows. The steps are not limited to being performed in the exact order illustrated and, unless explicitly stated herein, may be performed in other orders. Moreover, at least a part of the steps in the flowcharts related to the embodiments described above may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the execution order of the steps or stages is not necessarily sequential, but may be rotated or alternated with other steps or at least a part of the steps or stages in other steps.
Based on the same inventive concept, the embodiment of the present application further provides a twiddle factor generation device in a digital communication system for implementing the twiddle factor generation method in the digital communication system. The implementation scheme for solving the problem provided by the apparatus is similar to the implementation scheme described in the above method, so specific limitations in one or more embodiments of the twiddle factor generation apparatus in the digital communication system provided below may refer to the above limitations on the twiddle factor generation method in the digital communication system, and are not described herein again.
In an embodiment, referring to fig. 3, a twiddle factor generating apparatus 300 in a digital communication system is provided, where the twiddle factor generating apparatus 300 is configured to generate twiddle factors used in performing butterfly operations at each stage in a time-frequency transformation process by using an interpolation algorithm based on twiddle factor reference values stored in a memory 400, and the implemented time-frequency transformation includes DFT transformation, IDFT transformation, FFT transformation, and IFFT transformation.
Wherein stored in the memory 400
Figure 108695DEST_PATH_IMAGE297
The twiddle factor reference values include: based on
Figure 299505DEST_PATH_IMAGE298
To be circumferentially arranged with
Figure 727076DEST_PATH_IMAGE299
Obtained by dividing by unit angle
Figure 319731DEST_PATH_IMAGE300
According to the parameters
Figure 571458DEST_PATH_IMAGE301
In a monotonic order of values
Figure 921668DEST_PATH_IMAGE297
The value of each of the plurality of the values,
Figure 215246DEST_PATH_IMAGE300
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 600091DEST_PATH_IMAGE302
and does not exceed a predetermined threshold.
The modules in the twiddle factor generating device can be implemented in whole or in part by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operating system and the computer program to run on the non-volatile storage medium. The database of the computer device is used for storing
Figure 524185DEST_PATH_IMAGE303
A twiddle factor reference value, and also for storing different number of points
Figure 892850DEST_PATH_IMAGE304
Corresponding multiple relation
Figure 724539DEST_PATH_IMAGE305
. The network interface of the computer equipment is used for connecting and communicating with an external terminal through a networkThe interfaces include I/O interfaces and communication interfaces. The computer program is executed by a processor to implement a twiddle factor generation method in a digital communication system.
Those skilled in the art will appreciate that the architecture shown in fig. 4 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided that includes a memory having a computer program stored therein and a processor, the memory also having stored therein a computer program
Figure 229470DEST_PATH_IMAGE303
A twiddle factor reference value, stored in memory
Figure 58886DEST_PATH_IMAGE303
The twiddle factor reference values include: based on
Figure 446005DEST_PATH_IMAGE306
To be circumferentially arranged with
Figure 284648DEST_PATH_IMAGE307
Obtained by division at a unit angle
Figure 142620DEST_PATH_IMAGE308
According to the parameter
Figure 205254DEST_PATH_IMAGE309
In a monotonic order of values
Figure 282931DEST_PATH_IMAGE303
The value of each of the plurality of the values,
Figure 394107DEST_PATH_IMAGE308
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 670367DEST_PATH_IMAGE310
and does not exceed a predetermined threshold.
The processor, when executing the computer program, implements the steps of: based on storage in a memory
Figure 841586DEST_PATH_IMAGE303
The twiddle factor reference value is generated by interpolation algorithm, and the twiddle factor used in executing butterfly operation of each stage in time-frequency transformation process
Figure 203297DEST_PATH_IMAGE311
The implemented time-frequency transformation includes DFT transformation, IDFT transformation, FFT transformation and IFFT transformation.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
based on storage in a memory
Figure 118163DEST_PATH_IMAGE303
The twiddle factor reference value is generated by interpolation algorithm, and the twiddle factor used in executing butterfly operation of each stage in time-frequency transformation process
Figure 514510DEST_PATH_IMAGE311
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 856629DEST_PATH_IMAGE303
The twiddle factor reference values include: based on
Figure 643320DEST_PATH_IMAGE312
To be circumferentially arranged with
Figure 424194DEST_PATH_IMAGE313
Obtained by dividing by unit angle
Figure 612730DEST_PATH_IMAGE308
According to the parameter
Figure 188068DEST_PATH_IMAGE314
In a monotonic order of values
Figure 960589DEST_PATH_IMAGE303
The value of each of the plurality of the values,
Figure 217258DEST_PATH_IMAGE308
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 322617DEST_PATH_IMAGE315
and does not exceed a predetermined threshold.
In one embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, performs the steps of:
based on storage in a memory
Figure 6540DEST_PATH_IMAGE303
The twiddle factor reference value is generated by interpolation algorithm, and the twiddle factor used in executing butterfly operation of each stage in time-frequency transformation process
Figure 33402DEST_PATH_IMAGE316
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 890499DEST_PATH_IMAGE303
The twiddle factor reference values include: based on
Figure 53627DEST_PATH_IMAGE317
To be circumferentially arranged with
Figure 174030DEST_PATH_IMAGE318
Is a unit angleObtained by degree division
Figure 219346DEST_PATH_IMAGE319
According to the parameter
Figure 83397DEST_PATH_IMAGE320
In a monotonic order of values
Figure 101032DEST_PATH_IMAGE303
The value of each of the plurality of the values,
Figure 189073DEST_PATH_IMAGE319
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure 446921DEST_PATH_IMAGE321
and does not exceed a predetermined threshold.
It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high-density embedded nonvolatile Memory, resistive Random Access Memory (ReRAM), magnetic Random Access Memory (MRAM), ferroelectric Random Access Memory (FRAM), phase Change Memory (PCM), graphene Memory, and the like. Volatile Memory can include Random Access Memory (RAM), external cache Memory, and the like. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others. The databases referred to in various embodiments provided herein may include at least one of relational and non-relational databases. The non-relational database may include, but is not limited to, a block chain based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, quantum computing based data processing logic devices, etc., without limitation.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present application shall be subject to the appended claims.

Claims (10)

1. A twiddle factor generation method in a digital communication system, the twiddle factor generation method comprising:
based on storage in a memory
Figure 905826DEST_PATH_IMAGE002
A twiddle factor referenceValue, twiddle factor generated by interpolation algorithm and used for executing butterfly operation of each stage in time-frequency transformation process
Figure 28765DEST_PATH_IMAGE003
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 383916DEST_PATH_IMAGE002
The twiddle factor reference values include: based on
Figure 714535DEST_PATH_IMAGE004
To be circumferentially arranged with
Figure 737328DEST_PATH_IMAGE005
Obtained by division at a unit angle
Figure 913226DEST_PATH_IMAGE007
According to the parameter
Figure 326146DEST_PATH_IMAGE008
In a monotonic order of values
Figure 250502DEST_PATH_IMAGE002
N is the maximum value of the point number when the FFT transformation and the IFFT transformation are realized in the digital communication system,
Figure 512987DEST_PATH_IMAGE009
and does not exceed a predetermined threshold.
2. The method of claim 1, wherein the twiddle factors required in the time-frequency transformation are generated
Figure 716742DEST_PATH_IMAGE010
Method bagComprises the following steps:
determining parameters when performing a current level butterfly of the time-frequency transform,
Figure 545021DEST_PATH_IMAGE011
and
Figure 718907DEST_PATH_IMAGE012
points of butterfly operation at current stage based on time-frequency transformation
Figure 501311DEST_PATH_IMAGE013
And the determination of the butterfly basis used,
Figure 409225DEST_PATH_IMAGE014
is a twiddle factor used for time-frequency transformation
Figure 793014DEST_PATH_IMAGE015
Unit angle of
Figure 433074DEST_PATH_IMAGE016
The unit angle between two adjacent twiddle factor reference values
Figure 906037DEST_PATH_IMAGE017
The multiple relationship between them;
based on parameters
Figure 961848DEST_PATH_IMAGE018
Integer part of
Figure 469447DEST_PATH_IMAGE019
Determining two consecutive twiddle factor reference values stored in the memory as target twiddle factor reference values;
performing interpolation operation on the two target twiddle factor reference values by using an interpolation algorithm to obtain twiddle factors required by the current-stage butterfly operation for executing the time-frequency transformation
Figure 218091DEST_PATH_IMAGE020
。
3. The twiddle factor generation method of claim 2, wherein the twiddle factors are stored in the memory
Figure 88003DEST_PATH_IMAGE002
The twiddle factor reference values are all unsigned numbers,
Figure 714550DEST_PATH_IMAGE021
and stored in the memory
Figure 309610DEST_PATH_IMAGE002
The twiddle factor reference value is based on
Figure 996200DEST_PATH_IMAGE022
To be circumferentially arranged with
Figure 676711DEST_PATH_IMAGE023
Obtained by division at a unit angle
Figure 853088DEST_PATH_IMAGE024
N of the individual values being smallest
Figure 568234DEST_PATH_IMAGE002
And (4) taking values.
4. The twiddle factor generation method of claim 3, wherein the method of determining two target twiddle factor reference values comprises:
when in use
Figure 347097DEST_PATH_IMAGE025
Determining a corresponding target twiddle factor reference value
Figure 78686DEST_PATH_IMAGE026
；
When in use
Figure 35316DEST_PATH_IMAGE027
Determining a corresponding target twiddle factor reference value
Figure 401707DEST_PATH_IMAGE028
；
When in use
Figure 430099DEST_PATH_IMAGE029
Determining a corresponding target twiddle factor reference value
Figure 85203DEST_PATH_IMAGE030
；
When the temperature is higher than the set temperature
Figure 857243DEST_PATH_IMAGE031
Determining a corresponding target twiddle factor reference value
Figure 669082DEST_PATH_IMAGE032
；
When the temperature is higher than the set temperature
Figure 993009DEST_PATH_IMAGE033
Determining a corresponding target twiddle factor reference value
Figure 433611DEST_PATH_IMAGE034
；
When in use
Figure 242299DEST_PATH_IMAGE035
Determining a corresponding target twiddle factor reference value
Figure 84746DEST_PATH_IMAGE036
；
When in use
Figure 207337DEST_PATH_IMAGE037
Determining a corresponding target twiddle factor reference value
Figure 931972DEST_PATH_IMAGE038
；
When in use
Figure 45815DEST_PATH_IMAGE039
Determining a corresponding target twiddle factor reference value
Figure 506884DEST_PATH_IMAGE040
；
Wherein the function
Figure 782400DEST_PATH_IMAGE041
Representing storage in said memory
Figure 911111DEST_PATH_IMAGE002
A first one of the twiddle factor reference values
Figure 563066DEST_PATH_IMAGE042
The reference value of the rotation factor is used,
Figure 816323DEST_PATH_IMAGE043
represents the second in the memory
Figure 715272DEST_PATH_IMAGE042
The real part of the reference value of the individual twiddle factors,
Figure 289866DEST_PATH_IMAGE044
represents the second in the memory
Figure 497907DEST_PATH_IMAGE042
An imaginary part of the individual twiddle factor reference values;
determining
Figure 107136DEST_PATH_IMAGE046
Corresponding target twiddle factor reference value
Figure 488570DEST_PATH_IMAGE048
Obtaining two target twiddle factor reference values
Figure 816040DEST_PATH_IMAGE050
And
Figure 934431DEST_PATH_IMAGE048
。
5. the twiddle factor generation method according to claim 2, wherein the twiddle factor is obtained by interpolating two target twiddle factor reference values using an interpolation algorithm
Figure 95691DEST_PATH_IMAGE052
The method comprises the following steps:
performing linear average interpolation on the reference values of the two target twiddle factors by using an average interpolation method to determine
Figure 946229DEST_PATH_IMAGE054
Wherein
Figure 495416DEST_PATH_IMAGE050
is based on
Figure 119295DEST_PATH_IMAGE056
Determining the obtained reference value of the target twiddle factor,
Figure 437537DEST_PATH_IMAGE048
is based on
Figure 414634DEST_PATH_IMAGE058
Determining the obtained reference value of the target twiddle factor,
Figure 638067DEST_PATH_IMAGE060
presentation pair
Figure 973627DEST_PATH_IMAGE062
Shifting right by one position;
or, according to the parameters
Figure 176069DEST_PATH_IMAGE064
Fractional part of
Figure 571672DEST_PATH_IMAGE066
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 605705DEST_PATH_IMAGE052
。
6. The twiddle factor generation method of claim 5, wherein the function-based parameter is
Figure 744955DEST_PATH_IMAGE064
Fractional part of
Figure 801904DEST_PATH_IMAGE068
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 555359DEST_PATH_IMAGE020
The method comprises the following steps:
determining
Figure 566433DEST_PATH_IMAGE070
Wherein
Figure 996192DEST_PATH_IMAGE072
is a parameter
Figure 143532DEST_PATH_IMAGE074
Fractional part of
Figure 645052DEST_PATH_IMAGE076
The bit-width of (c) is,
Figure 940161DEST_PATH_IMAGE078
presentation pair
Figure 545848DEST_PATH_IMAGE080
Move to the right
Figure 542232DEST_PATH_IMAGE082
The number of bits is,
Figure 512856DEST_PATH_IMAGE084
represents moving left to 1
Figure 232944DEST_PATH_IMAGE086
A bit.
7. The twiddle factor generation method of claim 5, wherein the function-based parameter is
Figure 78540DEST_PATH_IMAGE088
Fractional part of
Figure 200473DEST_PATH_IMAGE090
Carrying out interpolation operation on two target twiddle factor reference values to obtain twiddle factors
Figure 32076DEST_PATH_IMAGE092
The method comprises the following steps:
is determined as
Figure 426411DEST_PATH_IMAGE094
When the temperature of the water is higher than the set temperature,
Figure 249267DEST_PATH_IMAGE096
whether or notThen the
Figure 819182DEST_PATH_IMAGE098
(ii) a Wherein,
Figure 630143DEST_PATH_IMAGE100
represents moving left to 1
Figure 70962DEST_PATH_IMAGE102
The bits, wherein,
Figure 25405DEST_PATH_IMAGE104
is a parameter
Figure 745100DEST_PATH_IMAGE106
Fractional part of
Figure 431689DEST_PATH_IMAGE108
Is determined.
8. The twiddle factor generation method according to claim 2, wherein different points are stored in the memory
Figure 846621DEST_PATH_IMAGE110
Corresponding multiple relation
Figure 124195DEST_PATH_IMAGE112
Multiple relation
Figure 340806DEST_PATH_IMAGE114
Including integer parts and fractional parts, and multiple relation
Figure 431253DEST_PATH_IMAGE116
Is an unsigned number;
the determining of the parameters for executing the time-frequency transformation in the butterfly operation of the current stage
Figure 366104DEST_PATH_IMAGE118
The method comprises the following steps:
reading the number of points of butterfly operation of the current stage from the memory
Figure 314419DEST_PATH_IMAGE120
Corresponding multiple relation
Figure 884072DEST_PATH_IMAGE116
And calculating to obtain parameters
Figure 912464DEST_PATH_IMAGE088
。
9. Twiddle factor generating apparatus in digital communication system, wherein the twiddle factor generating apparatus is configured to generate twiddle factors based on data stored in a memory
Figure DEST_PATH_IMAGE121
The twiddle factor reference value is generated by interpolation algorithm, and the twiddle factor used in executing butterfly operation of each stage in time-frequency transformation process
Figure DEST_PATH_IMAGE123
The realized time-frequency transformation comprises DFT transformation, IDFT transformation, FFT transformation and IFFT transformation;
wherein stored in the memory
Figure 288606DEST_PATH_IMAGE002
The twiddle factor reference values include: based on
Figure DEST_PATH_IMAGE125
To be circumferentially arranged with
Figure DEST_PATH_IMAGE127
Obtained by dividing by unit angle
Figure DEST_PATH_IMAGE129
According to the parameters
Figure DEST_PATH_IMAGE131
In a monotonic order of values
Figure DEST_PATH_IMAGE132
The value of each of the plurality of the values,
Figure 191139DEST_PATH_IMAGE129
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure DEST_PATH_IMAGE134
and does not exceed a predetermined threshold.
10. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the memory further stores
Figure 54447DEST_PATH_IMAGE132
A twiddle factor reference value, stored in said memory
Figure DEST_PATH_IMAGE135
The twiddle factor reference values include: based on
Figure DEST_PATH_IMAGE137
To be circumferentially arranged with
Figure DEST_PATH_IMAGE139
Obtained by division at a unit angle
Figure DEST_PATH_IMAGE140
According to the parameter
Figure 11995DEST_PATH_IMAGE131
In a monotonically ordered arrangement of values
Figure DEST_PATH_IMAGE141
The value of each of the plurality of the values,
Figure 390280DEST_PATH_IMAGE129
for the maximum value of the number of points when the FFT transform and the IFFT transform are implemented in the digital communication system,
Figure DEST_PATH_IMAGE143
and does not exceed a predetermined threshold;
based on memory storage when the processor executes the computer program
Figure 166741DEST_PATH_IMAGE135
The individual twiddle factor reference values implement the steps of the method of any one of claims 1 to 8.
CN202211496163.4A 2022-11-28 2022-11-28 Twiddle factor generation method and device in digital communication system and computer equipment Active CN115544438B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211496163.4A CN115544438B (en) 2022-11-28 2022-11-28 Twiddle factor generation method and device in digital communication system and computer equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211496163.4A CN115544438B (en) 2022-11-28 2022-11-28 Twiddle factor generation method and device in digital communication system and computer equipment

Publications (2)

Publication Number Publication Date
CN115544438A true CN115544438A (en) 2022-12-30
CN115544438B CN115544438B (en) 2023-04-18

Family

ID=84722698

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211496163.4A Active CN115544438B (en) 2022-11-28 2022-11-28 Twiddle factor generation method and device in digital communication system and computer equipment

Country Status (1)

Country Link
CN (1) CN115544438B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117591784A (en) * 2024-01-19 2024-02-23 武汉格蓝若智能技术股份有限公司 FPGA-based twiddle factor calculation method and FPGA chip

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004013811A (en) * 2002-06-11 2004-01-15 Sharp Corp Twiddle factor table for fast fourier transform, and fast fourier transformation system using the same
US20070266070A1 (en) * 2006-05-12 2007-11-15 Chung Hua University Split-radix FFT/IFFT processor
CN102045279A (en) * 2009-10-21 2011-05-04 中兴通讯股份有限公司 Generation method and device of rotation factor
CN102111365A (en) * 2009-12-28 2011-06-29 重庆重邮信科通信技术有限公司 Discrete Fourier transform (DFT)/inverse discrete Fourier transform (IDFT) rotation factor control method, device and DFT/IDFT arithmetic device for long term evolution (LTE) system
CN112835073A (en) * 2021-02-05 2021-05-25 重庆九洲星熠导航设备有限公司 FFT (fast Fourier transform) processor for satellite signal acquisition
CN114090948A (en) * 2021-10-12 2022-02-25 哲库科技(北京)有限公司 Twiddle factor determination method and device, electronic equipment and storage medium
CN114814815A (en) * 2022-03-16 2022-07-29 华域汽车系统股份有限公司 Method for solving signal processing crossing loss based on interpolation and single-point DFT filtering

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004013811A (en) * 2002-06-11 2004-01-15 Sharp Corp Twiddle factor table for fast fourier transform, and fast fourier transformation system using the same
US20070266070A1 (en) * 2006-05-12 2007-11-15 Chung Hua University Split-radix FFT/IFFT processor
CN102045279A (en) * 2009-10-21 2011-05-04 中兴通讯股份有限公司 Generation method and device of rotation factor
CN102111365A (en) * 2009-12-28 2011-06-29 重庆重邮信科通信技术有限公司 Discrete Fourier transform (DFT)/inverse discrete Fourier transform (IDFT) rotation factor control method, device and DFT/IDFT arithmetic device for long term evolution (LTE) system
CN112835073A (en) * 2021-02-05 2021-05-25 重庆九洲星熠导航设备有限公司 FFT (fast Fourier transform) processor for satellite signal acquisition
CN114090948A (en) * 2021-10-12 2022-02-25 哲库科技(北京)有限公司 Twiddle factor determination method and device, electronic equipment and storage medium
CN114814815A (en) * 2022-03-16 2022-07-29 华域汽车系统股份有限公司 Method for solving signal processing crossing loss based on interpolation and single-point DFT filtering

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
王非非等: "一种旋转因子访存优化的FFT算法", 《信息与电子工程》 *
高振斌等: "超长点数FFT处理器的旋转因子生成方法", 《电讯技术》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117591784A (en) * 2024-01-19 2024-02-23 武汉格蓝若智能技术股份有限公司 FPGA-based twiddle factor calculation method and FPGA chip
CN117591784B (en) * 2024-01-19 2024-05-03 武汉格蓝若智能技术股份有限公司 FPGA-based twiddle factor calculation method and FPGA chip

Also Published As

Publication number Publication date
CN115544438B (en) 2023-04-18

Similar Documents

Publication Publication Date Title
US8271569B2 (en) Techniques for performing discrete fourier transforms on radix-2 platforms
CN102043760B (en) Data processing method and system
US8917588B2 (en) Fast Fourier transform and inverse fast Fourier transform (FFT/IFFT) operating core
CN112800386B (en) Fourier transform processing method, processor, terminal, chip and storage medium
US20230254115A1 (en) Protection of transformations by intermediate randomization in cryptographic operations
Liu et al. Pipelined architecture for a radix-2 fast Walsh–Hadamard–Fourier transform algorithm
Oruklu et al. Reduced memory and low power architectures for CORDIC-based FFT processors
Alkım et al. Compact and simple RLWE based key encapsulation mechanism
CN115544438A (en) Twiddle factor generation method and device in digital communication system and computer equipment
US20120143936A1 (en) RADIX-8 FIXED-POINT FFT LOGIC CIRCUIT CHARACTERIZED BY PRESERVATION OF SQUARE ROOT-i OPERATION
CN116488788A (en) Hardware accelerator of full homomorphic encryption algorithm, homomorphic encryption method and electronic equipment
US20100179978A1 (en) Fft-based parallel system with memory reuse scheme
CN110750249B (en) Method and device for generating fast Fourier transform code
WO2022252876A1 (en) A hardware architecture for memory organization for fully homomorphic encryption
CN114706557B (en) ASIC chip and implementation method and device of Montgomery modular multiplication
WO2011102291A1 (en) Fast fourier transform circuit
CN115577221A (en) Signal processing method and device, twiddle factor optimization method and terminal equipment
CN111291315A (en) Data processing method, device and equipment
Ma et al. Simplified addressing scheme for mixed radix FFT algorithms
Malashri et al. Low power and memory efficient FFT architecture using modified CORDIC algorithm
Yu et al. Low-complexity twiddle factor generator for FFT processors
US20180373676A1 (en) Apparatus and Methods of Providing an Efficient Radix-R Fast Fourier Transform
US9805000B1 (en) Method and apparatus for reordering mixed radix fast Fourier transform outputs
Du Pont et al. Hardware Acceleration of the Prime-Factor and Rader NTT for BGV Fully Homomorphic Encryption
CN103870437A (en) Digital signal processing device and processing method thereof

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