Methods, apparatus, storage media and computer equipment for signal generation
By generating a preparation signal and using a twisting factor table for IFFT and dot product processing, the high hardware complexity of the Cordic algorithm is replaced, thus reducing computational complexity and chip area, and lowering costs.
Patent Information
- Application Number
- CN202311125911.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2023-08-28
- Filing Date
- 2023-09-01
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-09-01
AI Technical Summary
The hardware implementation of the Cordic algorithm in the existing technology is highly complex, resulting in a large chip computing area.
By generating a preparation signal, performing an inverse fast four-factor transform (IFFT) using a rotation factor table to generate an IFFT signal, and then generating a dot product signal based on the dot product parameters using the rotation factor table, the final result signal is generated, replacing the complex Cordic operation.
This reduces computational complexity, lowers hardware implementation complexity and chip processing area, while also reducing costs and ensuring the accuracy of calculation results.
Smart Images

Figure CN117176535B_ABST
Abstract
Description
[Technical Field]
[0001] The present invention relates to the field of communication technology, specifically to a signal generation method, apparatus, storage medium, and computer device. [Background Technology]
[0002] In the era of 5G mobile communication technology, with the coordinated development of 4G and 5G, the Long Term Evolution (LTE) of general mobile communication technology will play an increasingly important role, making optimizations for LTE particularly crucial. In LTE, the generation of uplink baseband signals involves the application of the Cordic algorithm. The Cordic algorithm is primarily based on multiple iterations, resulting in high hardware complexity for its implementation and a large computational area for this part of the chip. [Summary of the Invention]
[0003] In view of this, embodiments of the present invention provide a signal generation method, apparatus, storage medium, and computer device to solve the problem that the hardware implementation of the Cordic algorithm in the prior art is highly complex, resulting in a large computing area of the chip in this part.
[0004] In a first aspect, embodiments of the present invention provide a method for generating a signal, comprising:
[0005] Generate a preparation signal based on the acquired signal to be processed;
[0006] The prepared signal is processed by inverse fast Fourier transform (IFFT) using a rotation factor table to generate an IFFT signal.
[0007] The dot product signal is generated based on the obtained dot product parameters using the rotated factor table;
[0008] The result signal is generated based on the dot product signal and the IFFT signal.
[0009] In one possible implementation, the signal to be processed includes a first signal to be processed based on a first channel, and the preparation signal includes a first mapped signal; the step of generating the preparation signal based on the acquired signal to be processed includes:
[0010] Based on the first channel, the first signal to be processed is subjected to a first preset processing to generate a first modulated signal;
[0011] The first modulated signal is precoded to generate a precoded signal;
[0012] An RS signal is generated based on the acquired RS parameters;
[0013] The precoded signal and the RS signal are subjected to resource mapping processing to generate the first mapped signal.
[0014] In one possible implementation, the RS parameters include DMRS parameters and SRS parameters, and the RS signal includes a demodulation reference signal DMRS and a channel sounding reference signal SRS; generating the RS signal based on the acquired RS parameters includes:
[0015] The DMRS is generated based on the DMRS parameters;
[0016] The SRS is generated based on the obtained SRS parameters.
[0017] In one possible implementation, the DMRS parameters include a first DMRS parameter and a second DMRS parameter; generating the DMRS based on the DMRS parameters includes:
[0018] A first base sequence is generated based on the first DMRS parameters and the obtained first preset threshold.
[0019] A first cyclic shift sequence is generated based on the first base sequence, and a first acquisition sequence is generated based on the first acquisition parameters;
[0020] The DMRS is generated based on the first cyclic shift sequence, the first acquisition sequence, and the second DMRS parameters.
[0021] In one possible implementation, the signal to be processed includes a second signal to be processed based on a second channel, and the preparation signal includes a second mapped signal; the step of generating the preparation signal based on the acquired signal to be processed includes:
[0022] Based on the second channel, the second signal to be processed is subjected to a second preset processing to generate a second modulated signal;
[0023] The second modulated signal is cyclically shifted to generate a cyclically shifted signal;
[0024] The cyclic shift signal is spread spectrum processed to generate a spread spectrum signal;
[0025] The first reference signal is generated based on the obtained first reference signal parameters using the rotation factor table;
[0026] The spread spectrum signal and the first reference signal are subjected to resource mapping processing to generate the second mapped signal.
[0027] In one possible implementation, the signal to be processed includes a third signal to be processed based on a third channel, and the preparation signal includes a second reference signal; the step of generating the preparation signal based on the acquired signal to be processed includes:
[0028] Based on the third channel, the third signal to be processed is cyclically shifted using a rotation factor table to generate the second reference signal.
[0029] In one possible implementation, generating the result signal based on the dot product signal and the IFFT signal includes:
[0030] A combined signal is generated based on the dot product signal and the IFFT signal;
[0031] The merged signal is filtered to generate the result signal.
[0032] Secondly, embodiments of the present invention provide a signal generation apparatus, comprising:
[0033] The first generation module is used to generate a preparation signal based on the acquired signal to be processed;
[0034] The second generation module is used to perform Inverse Fast Fourier Transform (IFFT) processing on the prepared signal using a rotation factor table to generate an IFFT signal.
[0035] The third generation module is used to generate a dot product signal based on the obtained dot product parameters using a rotation factor table.
[0036] The fourth generation module is used to generate a result signal based on the dot product signal and the IFFT signal.
[0037] Thirdly, embodiments of the present invention provide a storage medium comprising a stored program, wherein, when the program is executed, the device on which the storage medium is located executes the signal generation method described in the first aspect or any possible implementation thereof.
[0038] Fourthly, embodiments of the present invention provide a computer device, including a memory and a processor. The memory is used to store information including program instructions, and the processor is used to control the execution of the program instructions. When the program instructions are loaded and executed by the processor, they implement the steps of the signal generation method in the first aspect or any possible implementation of the first aspect.
[0039] The present invention provides a method, apparatus, storage medium, and computer device for signal generation. A preparation signal is generated based on the acquired signal to be processed. An IFFT (Inverse Fast Fourier Transform) is performed on the preparation signal using a rotation factor table to generate an IFFT signal. A dot product signal is generated based on the acquired dot product parameters using the rotation factor table. A result signal is generated based on the dot product signal and the IFFT signal. This allows the computer device to replace complex Cordic operations with the stored rotation factor table, reducing computational complexity and the hardware implementation complexity of the Cordic algorithm, thus reducing the computational area of the chip and lowering chip costs. By reusing the rotation factor table, result signals from different channels are generated, reducing the utilization of the device's storage resources, minimizing resource waste, and ensuring the accuracy of the calculation results. [Attached Image Description]
[0040] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0041] Figure 1 A flowchart illustrating a signal generation method provided in an embodiment of the present invention;
[0042] Figure 2 A flowchart for generating a first mapping signal is provided in an embodiment of the present invention;
[0043] Figure 3 A flowchart for generating a first modulation signal is provided as an embodiment of the present invention;
[0044] Figure 4 A schematic diagram of a PUSCH-based signal processing procedure provided in an embodiment of the present invention;
[0045] Figure 5 A schematic diagram illustrating a bit-level processing procedure provided in an embodiment of the present invention;
[0046] Figure 6 A flowchart for generating an RS signal is provided as an embodiment of the present invention;
[0047] Figure 7 A flowchart for generating DMRS is provided as an embodiment of the present invention;
[0048] Figure 8 A flowchart for generating a second mapping signal is provided in an embodiment of the present invention;
[0049] Figure 9 A flowchart for generating a second modulation signal is provided as an embodiment of the present invention;
[0050] Figure 10 A schematic diagram of a signal processing procedure based on PUCCH provided in an embodiment of the present invention;
[0051] Figure 11 A schematic diagram of a PRACH-based signal processing procedure provided in an embodiment of the present invention;
[0052] Figure 12 An error diagram provided for an embodiment of the present invention;
[0053] Figure 13 This is a schematic diagram of a signal generation device provided in an embodiment of the present invention;
[0054] Figure 14 This is a schematic diagram of a computer device provided in an embodiment of the present invention.
Detailed Implementation Methods
[0055] To better understand the technical solution of the present invention, the embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
[0056] It should be understood that the described embodiments are merely some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.
[0057] The terminology used in the embodiments of this invention is for the purpose of describing particular embodiments only and is not intended to limit the invention. The singular forms “a,” “the,” and “the” as used in the embodiments of this invention and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.
[0058] It should be understood that the term "and / or" used in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this article generally indicates that the preceding and following related objects have an "or" relationship.
[0059] It should be understood that although terms such as first, second, third, etc., may be used to describe numbers in embodiments of the present invention, these numbers should not be limited to these terms. These terms are only used to distinguish numbers from each other. For example, without departing from the scope of embodiments of the present invention, a first number may also be referred to as a second number, and similarly, a second number may also be referred to as a first number.
[0060] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."
[0061] Figure 1 A flowchart of a signal generation method provided in an embodiment of the present invention is shown below. Figure 1 As shown, it includes:
[0062] Step 10: The computer device generates a preparation signal based on the acquired signal to be processed.
[0063] In this embodiment of the invention, the computer equipment includes, but is not limited to, mobile phones, tablets, portable PCs, desktop computers, wearable devices, vehicle terminals, chips, etc.
[0064] Computer equipment can process signals to be processed based on the Physical Uplink Shared Channel (PUSCH), Physical Uplink Control Channel (PUCCH), or Physical Random Access Channel (PRACH) to generate preparation signals. The preparation signals generated by the computer equipment differ depending on the channel used.
[0065] Step 20: The computer equipment performs Inverse Fast Fourier Transform (IFFT) processing on the prepared signal using a rotation factor table to generate an IFFT signal.
[0066] In this embodiment of the invention, the computer device can perform IFFT processing on the preparation signal based on PUSCH, PUCCH or PRACH to generate an IFFT signal.
[0067] The Coridic algorithm is involved when performing Inverse Fast Fourier Transform (IFFT) on the prepared signal. The Coridic algorithm involves processing e jz Perform the calculation. Research has shown that e jz Due to its periodicity, computer equipment can utilize storage and lookup tables to replace the Coridic algorithm for e. jz The calculation is implemented in a way that reduces the logical operations of computer equipment, and the accuracy of the calculation results is guaranteed by approximating the calculation based on Coridic precision and the length of the rotation factor table. The rotation factor table includes a ROM table, which contains multiple e jzThe computer device can query the result of the operation from the ROM. jz The result of the operation replaces e jz This operation enables IFFT processing of the prepared signal, generating an IFFT signal, while reducing the computational load on the computer.
[0068] Step 30: The computer device generates a dot product signal based on the obtained dot product parameters using the rotation factor table.
[0069] In this embodiment of the invention, the computer device can generate a dot product signal based on PUSCH, PUCCH, or PRACH, using a rotation factor table and the acquired dot product parameters. The computer device can reuse the same preset table to generate IFFT signals and dot product signals for different channels. During the generation of the resulting signal, the computer device needs to reuse the rotation factor table for lookup in both IFFT and dot product processing. The computer device can create a rotation factor table based on the maximum length, and the maximum length of the dot product module used for dot product processing is 8192. Therefore, the rotation factor table can store 1024 points corresponding to pi / 4, thereby greatly reducing storage resources and iterative calculations. Furthermore, the approximate calculation based on Cordic precision and the ROM table ensures the accuracy of the calculation results, further reducing chip area, optimizing the chip, and lowering hardware implementation costs and complexity.
[0070] Step 40: The computer device generates the result signal based on the dot product signal and the IFFT signal.
[0071] In this embodiment of the invention, the result signal includes a baseband signal, a PUCCH result signal, or a PRACH result signal. For example, a computer device generates a baseband signal based on PUSCH, using an IFFT signal and a dot product signal; a computer device generates a PUCCH result signal based on PUCCH, using an IFFT signal and a dot product signal; or a computer device generates a PRACH result signal based on PRACH, using an IFFT signal and a dot product signal.
[0072] This invention provides a signal generation method. A computer device generates a preparation signal based on an acquired signal to be processed. The preparation signal is then processed using an inverse fast Fourier transform (IFFT) through a rotation factor table to generate an IFFT signal. A dot product signal is generated based on the acquired dot product parameters using the rotation factor table. Finally, a result signal is generated based on the dot product signal and the IFFT signal. This allows the computer device to replace complex Cordic operations with a stored rotation factor table, reducing computational complexity and the hardware implementation complexity of the Cordic algorithm, thus reducing the computational area of the chip and lowering chip costs. Furthermore, by reusing the rotation factor table, result signals based on different channels are generated, reducing the utilization of the device's storage resources, minimizing resource waste, and ensuring the accuracy of the calculation results.
[0073] In one possible implementation, the signal to be processed includes a first signal to be processed based on a first channel, and the preparation signal includes a first mapping signal; Figure 2 A flowchart for generating a first mapping signal is provided as an embodiment of the present invention, such as... Figure 2 As shown, step 10 may specifically include:
[0074] Step 101: The computer device performs a first preset processing on the first signal to be processed based on the first channel to generate a first modulated signal.
[0075] In this embodiment of the invention, the first preset processing includes first bit-level processing and first modulation processing. The first channel includes PUSCH. Figure 3 A flowchart for generating a first modulation signal is provided as an embodiment of the present invention, such as... Figure 3 As shown, step 101 may specifically include:
[0076] Step 1011: The computer device performs first bit-level processing on the first signal to be processed based on the first channel to generate a first bit signal.
[0077] In this embodiment of the invention, the first signal to be processed includes a first input bit sequence a k1 The first bit signal includes the first output bit sequence b. k1 The computer device uses PUSCH to process the first input bit sequence a. k1 Perform the first bit-level processing to generate the first output bit sequence b. k1The first bit-level processing includes at least one of the following: Cyclic Redundancy Check (CRC) encoding, channel encoding, rate matching, control channel, data channel multiplexing, channel interleaving, and scrambling. The PUSCH-based first bit-level processing can be implemented according to 3GPP protocol 36.212. For example, the first bit-level processing includes CRC encoding, channel encoding, rate matching, control channel, data channel multiplexing, channel interleaving, and scrambling. The first signal to be processed may include PUSCH information and control information. The first signal to be processed in the communication system can be transmitted in the form of codewords, consisting of multiple bits; it can also be the most basic transport block. This embodiment of the invention does not limit the form or content of the first signal to be processed.
[0078] Figure 4 A schematic diagram of a PUSCH-based signal processing procedure provided in an embodiment of the present invention is shown below. Figure 4 As shown, the computer device can perform CRC encoding, channel coding and rate matching, UCI encoding, multiplexing, channel interleaving, scrambling, modulation, precoding, resource mapping with SRS and DMRS, IFFT, dot multiplication and filtering on the first signal to be processed based on PUSCH to generate a baseband signal. Among them, UCI encoding may include Channel Quality Indicator (CQI) encoding and Acknowledgement (ACK) encoding. The computer device can perform ACK encoding on the first signal to be processed based on the RI / HARQ_ACK codebook; or, it can perform CQI encoding on the first signal to be processed based on CQI / PMI.
[0079] Figure 5 This is a schematic diagram of a bit-level processing procedure provided in an embodiment of the present invention, as shown below. Figure 5 As shown, the computer device performs bit-level processing on concurrent PUSCH and control information to generate the first output bit sequence b. k1 Channel coding includes Turbo coding; computer equipment can implement data control multiplexing through multiplexing techniques; PUSCH information includes PUSCH sequences a0, a1, a2, a3, ..., a A-1 The control information includes a first control information sequence o0, o1, o2, ..., o o-1 With the second control information sequence First input bit sequence a k1 This includes the PUSCH sequence, the first control information sequence, and the second control information sequence. The computer device interprets the PUSCH sequence a0, a1, a2, a3, ..., a... A-1Perform CRC encoding, Turbo encoding, and rate matching processing to generate the first subsequence; for the first control information sequence i0, o1, o2, ..., o o-1 CQI encoding and cyclic copying are performed to generate a second subsequence; data control multiplexing is performed on the first and second subsequences to generate a third subsequence; the second control information sequence is then processed. ACK encoding, cyclic copying, and row / column transformation are performed to generate the fourth subsequence; channel interleaving of the third and fourth subsequences is performed to generate the fifth subsequence; the fifth subsequence is scrambled to generate the first output bit sequence b. k1 The computer equipment can perform CRC encoding through transport block CRC and channel interleaving through a channel interleaver.
[0080] Step 1012: The computer device performs a first modulation process on the first bit signal to generate a first modulated signal.
[0081] In this embodiment of the invention, the first modulation process includes quadrature phase shift keying (QPSK) or quadrature amplitude modulation (QAM), for example, the modulation process includes 16QAM.
[0082] The first modulation signal includes a first output symbol sequence d. k1 .like Figure 4 As shown, the computer device is based on PUSCH and modulates the first output bit sequence b through a modulator. k1 Modulation processing is performed to generate the first output symbol sequence d. k1 This achieves the conversion of the first output bit sequence b k1 The bit mapping is a complex symbol, that is, a modulated signal represented by real part data and imaginary part data. The complex symbol corresponding to the bit is different under different modulation methods.
[0083] Step 102: The computer device performs precoding processing on the first modulation signal to generate a precoded signal.
[0084] In this embodiment of the invention, before step 1012, the method further includes: a computer device performing layer mapping processing on the first modulation signal to generate a layer mapping signal. The layer mapping signal includes a layer mapping sequence x. (λ) Layer mapping processing will output the first symbol sequence d. k1 Mapping to layers means mapping the complex-valued symbols output from each codeword after modulation to multiple layers. The computer device processes the first output symbol sequence d... k1Perform layer mapping processing to generate a layer mapping sequence x. (λ) .
[0085] The precoded signal includes a precoded sequence. Step 1012 may specifically include: a computer device mapping the layer mapping sequence x. (λ) Precoding is performed to generate a precoded sequence.
[0086] Computer devices, through precoding principles, determine the layer mapping sequence x. (λ) Generate a precoding sequence y using the obtained precoding parameters. (λ) The precoding parameters include the number of complex-valued symbols for each layer after layer mapping processing. Number of subcarriers included in PUSCH Number of Physical Resource Blocks (PRBs) allocated to PUSCH Number of subcarriers included in a resource block (RB) Configure bandwidth At least one of them.
[0087] When the precoding parameters include the number of complex-valued symbols for each layer after layer mapping processing The number of subcarriers included in PUSCH Computer equipment uses a precoding principle to determine the number of subcarriers included in the PUSCH. Perform an exponential operation to determine the number of subcarriers included in the resulting PUSCH. Number of complex value symbols per layer With layer mapping sequence x (λ) The product is between 0 and The ranges are accumulated to obtain the precoded sequence. The precoding principle is as follows:
[0088]
[0089]
[0090]
[0091] The computer device maps the layer sequence x. (λ) Divided into There are several groups. The output sequence is... λ is used to represent the number of layers.
[0092] When the precoding parameters do not include the number of complex-valued symbols for each layer after layer mapping processing At that time, the computer device can determine the number of PRBs allocated to PUSCH based on the acquired number. The number of subcarriers included in a resource block (RB) Calculate the number of subcarriers included in PUSCH. For example, the computer device calculates the number of subcarriers based on the formula for calculating the number of PRBs allocated to the PUSCH. The number of subcarriers included in a resource block (RB) Calculate the number of subcarriers included in PUSCH. The formula for calculating the number of subcarriers is: Among them, the number of subcarriers included in a resource block RB For fixed values, The fixed value is 12. The number of PRBs allocated to PUSCH. The number of PRBs allocated to PUSCH should be satisfied. The value is less than or equal to the configured bandwidth. And the number of PRBs allocated to PUSCH The value of is the product of the first exponent, the second exponent, and the third exponent, which can be expressed by the formula: The first index quantity is The second index is The third index quantity is a2, a3, and a5 are all non-negative integers; Configure bandwidth The value can be 6, 15, 25, 50, 75 or 100.
[0093] Step 103: The computer device generates an RS signal based on the acquired RS parameters.
[0094] In this embodiment of the invention, the RS parameters include DMRS parameters and SRS parameters, and the RS signal includes a demodulation reference signal DMRS and a channel sounding reference signal SRS; Figure 6 A flowchart for generating an RS signal is provided as an embodiment of the present invention, such as... Figure 6 As shown, step 103 may specifically include:
[0095] Step 1031: The computer device generates DMRS based on the DMRS parameters.
[0096] In this embodiment of the invention, the DMRS parameters include the number of subcarriers included in the PUSCH. Reference signal length At least one of the first parameter m1 and the second parameter n1, wherein the reference signal length This indicates the signal length of the DMRS. The DMRS consists of a DMRS sequence, which can be referenced by the signal length. First parameter m1, second parameter n1, and the first sequence w obtained. (λ) (m1) and the first cyclic shift sequence Calculated.
[0097] Computer equipment can use the DMRS calculation formula to obtain the first acquired sequence w (λ) (m1) and the first cyclic shift sequence Multiplication is performed to calculate the DMRS sequence. The formula for calculating DMRS is:
[0098]
[0099]
[0100] The computer equipment is based on the number of subcarriers included in the PUSCH. Reference signal length that can be generated Reference signal length The value of is related to the number of subcarriers included in PUSCH. The values are in a multiple relationship; for example, the length of the reference signal. The value is related to the number of subcarriers included in PUSCH. The values are equal, or the reference signal length The value is the number of subcarriers included in the PUSCH. Half of the value of can be expressed by the formula: or Computer equipment can determine the length of the reference signal according to relevant protocols. The value is related to the number of subcarriers included in PUSCH. The multiple relationship. 'a' is the cyclic shift value.
[0101] As can be seen from the above, the DMRS parameters include the first DMRS parameter and the second DMRS parameter. Figure 7 A flowchart for generating DMRS is provided as an embodiment of the present invention, such as Figure 7 As shown, step 1031 may specifically include:
[0102] Step 1031a: The computer device generates a first base sequence based on the first DMRS parameters and the obtained first preset threshold.
[0103] In this embodiment of the invention, the first DMRS parameter includes the reference signal length. Computer equipment will reference signal length The value is compared with a first preset threshold, for example, the first preset threshold is 36. First base sequence May include For the first base sequence Solving the problem can involve two cases:
[0104] When the reference signal length When the length is less than a first preset threshold, the computer device bases its response on the reference signal length. If the value is less than a first preset threshold, a first determination identifier is generated by looking up parameters in a first reference table based on the first base sequence, and a first base sequence is generated based on the first determination identifier.
[0105] The first base sequence lookup table parameter includes the group number u. The first reference table includes multiple group numbers u and a first identifying identifier corresponding to each group number u. Computer equipment based on reference signal length Less than the first preset threshold and the reference signal length The number of subcarriers included in a resource block (RB) A multiple relationship is established; the first definitive identifier is obtained by querying the first reference table using the group number u. Based on the first base sequence formula and the first determined identifier Generate the first base sequence with the first base sequence parameters For example, the first identification identifier The value can be -3, -1, 1, or 3. The computer device can determine the first identifier through the first base sequence formula. The result of the exponentiation operation is the first base sequence parameter. The first basis sequence parameters include the first reference parameter j, and the formula for the first basis sequence is: Reference signal length The number of subcarriers included in a resource block (RB) The multiple relationship includes: reference signal length The number of subcarriers included in a resource block (RB) Equal, or reference signal length It is the number of subcarriers included in a resource block (RB). Twice, which can be expressed mathematically as: or
[0106] When the reference signal length When the value is greater than or equal to the first preset threshold, the computer device bases its decision on the reference signal length. If the second acquisition sequence is greater than or equal to the first preset threshold, a first lookup table parameter is generated based on the acquired second acquisition sequence; a first base sequence is generated based on the first lookup table parameter and the rotation factor table.
[0107] The computer device can obtain the length of the parameter sequence. Group number u and the sequence number v within the group are used to obtain the second sequence x. q (m2) is defined; the second sequence x is obtained after the definition. q(m2) and the second acquisition sequence x q (m2) Obtaining the parameter sequence length Perform a modulo operation to generate the second basis sequence formula. The second basis sequence formula is: The second sequence x is obtained. q The definition of (m2) is:
[0108]
[0109]
[0110] Parameter sequence length Less than the reference signal length For example, parameter sequence length Less than the reference signal length The maximum number of protons. Second, obtain sequence x. q (m2) is q th Zadoff-Chu sequence. Parameters: sequence length. For q th The length of the Zadoff-Chu sequence.
[0111] The computer device generates a first lookup table parameter based on the first formula parameter q and the second formula parameter m2 using the first lookup table parameter calculation formula. The computer device then performs arithmetic operations on the first formula parameter q and the second formula parameter m2 using the first lookup table parameter calculation formula, and uses the result of these operations as the first lookup table parameter INDEX1. The first lookup table parameter calculation formula is: INDEX1 = qm2(m2 + 1). The computer device then performs the floor() function operation on the first lookup table parameter using the first lookup table parameter calculation formula to generate the first lookup table parameter Index1. The first lookup table parameter calculation formula is: Index1 = floor(INDEX1 * ((1024 * 8) / M1) + 0.5); where M1 represents the first achievable length of INDEX1, for example, the maximum value of M1 is 1193.
[0112] The twiddle factor table can correspond to multiple lookup parameter threshold ranges, each of which corresponds to a lookup formula. After obtaining the first lookup parameter Index1, the computer device determines the lookup formula corresponding to the first lookup parameter Index1 based on the lookup formula corresponding to the threshold range and the lookup parameter index1; then, it retrieves the first base sequence from the twiddle factor table using the lookup formula corresponding to the first lookup parameter Index1. The lookup parameter threshold range is composed of lookup parameter thresholds. For example, the rotation factor table includes a ROM table Wtb, the length of which is 1024 points. The lookup parameter threshold is a multiple of 1024, and includes at least one of 1024, 2*1024, ..., 8*1024. The lookup parameter threshold range is Index1 < 1024, 1024 ≤ Index1 < 2*1024, ..., 7*1024 ≤ Index1 < 8*1024. Table 1 below shows the correspondence between the lookup parameter threshold range and the lookup formula.
[0113] Table 1
[0114]
[0115]
[0116] As shown in Table 1 above, X represents the parameters used by the computer device for table lookup; in this case, X represents the first lookup parameter, Index1. First base sequence. May include The lookup formula indicates that the computer device performs a formula calculation on the first lookup parameter Index1, retrieves the corresponding value from the ROM table, and then generates the first base sequence based on the retrieved value. For example, when the first lookup parameter Index1 is less than 1024, the computer device looks up the corresponding Value value of the first lookup parameter Index1 from the rotation factor table based on the value of the first lookup parameter Index1; when the first lookup parameter Index1 is less than 2*1024 but greater than or equal to 1024, the computer device performs a calculation of 2*1024-Index1 on the first lookup parameter Index1, and looks up the corresponding Value1 value of the first lookup parameter Index1 from the rotation factor table based on the calculation result. The values of the imaginary part Imag(Value) and the real part Real(Value) are then determined based on the Value1 value, thereby determining the first basis sequence.
[0117] Step 1031b: The computer device generates a first cyclic shift sequence based on the first base sequence and generates a first acquisition sequence based on the first acquisition parameters.
[0118] In this embodiment of the invention, based on the reference signal length in step 1031a... Based on the comparison with the first preset threshold, the solution for the first cyclic shift sequence can be divided into two cases.
[0119] When the reference signal length When the length is less than a first preset threshold, the computer device bases its response on the reference signal length. Less than the first preset threshold, according to the first base sequence Generate a first cyclic shift sequence with the first cyclic shift parameter. First Circular Shift Sequence For the first base sequence The product of the first circular shift parameter after the exponential operation. The first circular shift parameter includes the third parameter. The third parameter is selected from at least one of the following: the fourth parameter δ, the first reference parameter j, the cyclic shift value a, and the cyclic shift field in the uplink-related DCI format. For example, the first cyclic shift parameter includes the fourth parameter δ, the first reference parameter j, the cyclic shift value a, and the cyclic shift field in the uplink-related DCI format. The computer device obtains the third parameter from the cyclic shift field in the uplink-related DCI format. Computer equipment will use the third parameter Add it to the first cyclic shift parameter.
[0120] The computer equipment determines the length of the reference signal. Once the value falls below the first preset threshold, the computer device can generate a third parameter based on the cyclic shift field in the acquired uplink-related DCI format. Meanwhile, the first acquisition parameters include the cyclic shift field and the layer number λ in the uplink-related DCI format. Step 1031b further includes: the computer device generating a first acquisition sequence w based on the cyclic shift field and the layer number λ in the uplink-related DCI format. (λ) (m1). The computer device can retrieve the third parameter from the second reference table based on the cyclic shift field in the uplink-related DCI format. And based on the cyclic shift field in the uplink-related DCI format and the layer number λ, the first sequence w is obtained. (λ) (m1); as shown in Table 2 below, Table 2 shows a second reference table.
[0121] Table 2
[0122]
[0123]
[0124] As shown in Table 2 above, the second parameter The value can be 0 or 1. The computer device can use the cyclic shift field in the uplink-related DCI format and the second parameter The correspondence is found by looking up the second parameter in Table 2. The cyclic shift field, layer number λ, and first acquisition sequence w are obtained from the uplink-related DCI format. (λ) The correspondence of (m1) is found by looking up the first acquisition sequence w in Table 2. (λ)(m1). For example, when the cyclic shift field in the uplink-related DCI format is 000, the second parameter... The second parameter is 1; when the cyclic shift field in the uplink-related DCI format is 011, the second parameter is 1. The value is 0. When the cyclic shift field in the uplink-related DCI format is 000, the layer number λ is 2, and m1 is 0, the first acquisition sequence w... (λ) (m1) is 1; the cyclic shift field in the uplink-related DCI format is 000, the layer number λ is 2, and when m1 is 1, the first acquisition sequence w (λ) (m1) is -1.
[0125] The computer device calculates the first base sequence Then, the computer device uses the first cyclic shift sequence formula to adjust the third parameter. Perform a modulo operation; perform arithmetic operations on the result of the modulo operation with the fourth parameter δ, the second parameter n1, the first reference parameter j, and the cyclic shift value a; perform an exponential operation on the result of the arithmetic operations; and perform an exponential operation on the result of the exponential operation with the first base sequence. Perform the product operation and use the product result as the first circular shift sequence. The computer equipment determines the value of the fourth parameter δ according to relevant protocols. The value of the fourth parameter δ is usually 0 or 1. The formula for the first cyclic shift sequence is:
[0126]
[0127] When the reference signal length When the value is greater than or equal to the first preset threshold obtained, the process before step 1031b further includes: the computer device based on the reference signal length. If the value is greater than or equal to the first preset threshold, generate a second lookup table parameter based on the third acquisition parameter; generate a third acquisition sequence based on the second lookup table parameter and the rotation factor table; generate a first cyclic shift sequence based on the third acquisition sequence and the first base sequence.
[0128] The third set of parameters includes n1 and the cyclic shift value a, and the third set of parameters is: Computer equipment can obtain the first base sequence Next, the computer device generates a second preliminary lookup table parameter based on n1 and the circular shift value a using the second preliminary lookup table parameter calculation formula; then, it generates a second lookup table parameter based on the second preliminary lookup table parameter calculation formula. The computer device multiplies n1 and the circular shift value a using the second preliminary lookup table parameter calculation formula, and uses the result of the product operation as the second preliminary lookup table parameter INDEX2. The second preliminary lookup table parameter calculation formula is INDEX2 = n1 * a. The computer device then performs a floor() function operation on the second preliminary lookup table parameter INDEX2 using the second lookup table parameter calculation formula, generating the second lookup table parameter Index2. The second lookup table parameter calculation formula is: Index2 = floor(INDEX2 * ((1024 * 8) / M2) + 0.5); where M2 represents the second achievable nominal length of INDEX2, for example, the maximum value of M2 is 12.
[0129] After calculating the second lookup parameter Index2, the computer device determines the lookup formula corresponding to the second lookup parameter Index2 based on the lookup formula corresponding to the threshold range of the lookup parameter. Then, it searches for the third acquisition sequence from the rotation factor table using the lookup formula corresponding to the second lookup parameter Index2. As shown in Table 1 above, X represents the second lookup parameter Index2. For the specific lookup process, please refer to step 1031a above. The computer device uses the first cyclic shift sequence formula described above to obtain the third sequence. With the first base sequence Perform the product operation and use the product result as the first circular shift sequence.
[0130] The first parameters to be acquired include the cyclic shift field and the layer number λ in the uplink-related DCI format, when the reference signal length... When the threshold value is greater than or equal to the first preset threshold value, step 1031b further includes: the computer device can generate a first acquisition sequence w based on the cyclic shift field and the layer number λ in the uplink-related DCI format. (λ) (m1). The computer device can obtain the sequence w first by using the second reference table, based on the cyclic shift field in the uplink-related DCI format and the layer number λ. (λ) (m1), please refer to the above reference signal length for the specific generation process. When the value is less than the first preset threshold, the first acquisition sequence w is generated. (λ) The process of (m1).
[0131] Step 1031c: The computer device generates DMRS based on the first cyclic shift sequence, the first acquisition sequence and the second DMRS parameters.
[0132] In this embodiment of the invention, the second DMRS parameter includes the first parameter m1 and the second parameter n1.
[0133] The computer device uses the above DMRS calculation formula to obtain the first acquired sequence w. (λ) (m1), First Acquisition Sequence w (λ) (m1) and the first cyclic shift sequence Generate DMRS.
[0134] Step 1032: The computer device generates SRS based on the acquired SRS parameters.
[0135] In this embodiment of the invention, the SRS parameter includes the number of ports N. ap With the first value parameter SRS includes SRS sequences. SRS sequence It can be achieved through the second cyclic shift sequence Calculated.
[0136] Computer equipment can use the SRS calculation formula, based on the second cyclic shift sequence. Calculate the SRS sequence The formula for calculating SRS is:
[0137]
[0138]
[0139]
[0140]
[0141]
[0142] in, The value can be an integer, for example, According to the relevant protocol, the value can be 8 or 12. Referring to step 1031 above, the computer device obtains the second cyclic shift sequence through the first reference table. Using the SRS calculation formula described above, the second cyclic shift sequence As an SRS sequence
[0143] Step 104: The computer device performs resource mapping processing on the precoded signal and the RS signal to generate the first mapped signal.
[0144] In this embodiment of the invention, the resource mapping process based on PUSCH can include frequency hopping or non-frequency hopping methods. For example... Figure 4As shown, the computer device performs resource mapping processing on the precoded signal, DMRS and SRS to generate the first mapped signal.
[0145] When the mapping method is non-frequency hopping, the computer device performs resource mapping processing on the precoded signal and the RS signal based on the non-frequency hopping method to generate the first non-frequency hopping mapping signal. The transmitted resource block group is obtained through direct mapping from virtual resource block (VRB) to physical resource block (PRB), where the number of VRBs is obtained from the resource indicator field (RIV) of DCI format 0.
[0146] When the frequency hopping flag field in DCI format 0 is set to 1, the frequency hopping method includes Type 1 or Type 2 according to the relevant 3GPP protocols. The computer equipment performs resource mapping processing on the precoded signal and the RS signal based on the frequency hopping method to generate a first frequency hopping mapping signal. The first frequency hopping mapping signal includes a first Type 1 mapping signal based on Type 1 or a first Type 2 mapping signal based on Type 2.
[0147] In one possible implementation, the preparation signal includes a first mapped signal, and the IFFT signal includes a first IFFT signal; step 20 includes: step 201, the computer device performs inverse fast Fourier transform (IFFT) processing on the first mapped signal through a rotation factor table to generate the first IFFT signal.
[0148] In this embodiment of the invention, a computer device generates a first IFFT signal formula using a first mapped signal and acquired first IFFT parameters; and generates an IFFT signal according to the first IFFT signal formula using a rotation factor table. The first mapped signal includes a first mapped sequence.
[0149] The first IFFT parameters include port p, symbol l, first reference parameter j, and mapping start position k. (-) First frequency Δf, cyclic prefix length N cp,l First time T s First IFFT parameter N, configured bandwidth Number of subcarriers included in a resource block (RB) At least one of the second IFFT parameters t. Where, the first time T... s The possible values include The first frequency Δf has a value of 15kHz; the first IFFT parameter N has a value of 2048.
[0150] Computer equipment to Within the range of the first reference parameter j, the first frequency Δf, the second IFFT parameter t, and the cyclic prefix length N, cp,l With the first time Ts Perform exponentiation, and then map the result of the exponentiation to the first mapping sequence. Multiply by these to generate the first IFFT signal formula. The first IFFT signal formula is:
[0151]
[0152] according to The mapping starting position k can be generated with k. (-) ;express k and k (-) The relationship is as follows: in, The value is 12; It can also represent the value that port p maps to resource element (k, l). Table 3 below shows one example of a cyclic prefix length N. CP,l The value table for .
[0153] Table 3
[0154]
[0155] As shown in Table 3 above, the corresponding cyclic prefix length N varies for different configurations and different symbol values. CP,l The values differ. For example, when the cyclic prefix is configured as a normal cyclic prefix and the symbol l is 0, the cyclic prefix length N is... CP,l The value is 160; when the cyclic prefix is configured as an extended cyclic prefix and the symbol l is 1, 2, ..., 5, the cyclic prefix length N is... CP,l The value is 512.
[0156] Based on the values of the above parameters, the above first IFFT signal formula can be equivalent to: Where n takes the values n = 0, 1, ..., N-1, The value of N is defined as subcarrier , Represents the first reference mapping sequence, the first mapping sequence Equivalent to the first reference mapping sequence This is equivalent to B k Represents the second reference mapping sequence, the first reference mapping sequence This is equivalent to the second reference mapping sequence. Since the maximum number of IFFT points is N1 = 2048 or 4096 when implementing IFFT processing, before step 201, the process also includes: the computer device applying the rotation factor e... j2πk / NA ROM table Wtb with a length that is a multiple of 1024 is stored, allowing the corresponding rotation factor value to be obtained by looking up the table. For example, the length of the ROM table Wtb is 1024. When the computer device executes step 201, it can determine e by querying the ROM table Wtb. j2πk / N The value of e is chosen so that computer equipment does not need to calculate it. j2πk / N The choice of values reduces the computational load on computer equipment, while also reducing the computing area of this part of the chip, lowering the chip cost, reducing resource waste, and ensuring the accuracy of the calculation results.
[0157] In one possible implementation, the dot product signal includes a first dot product signal; step 30 includes: step 301, the computer device generates a third lookup table parameter based on the first channel and the acquired first dot product parameter; and generates the first dot product signal based on the third lookup table parameter through a rotating factor table.
[0158] In this embodiment of the invention, the computer device generates a first dot product formula based on the acquired first dot product parameters; generates a third dot product parameter INDEX3 based on the first dot product formula using a third pre-lookup parameter calculation formula; calculates a third lookup parameter Index3 based on the third pre-lookup parameter using the third lookup parameter calculation formula; and generates a first dot product signal based on the third lookup parameter using a rotation factor table.
[0159] The first dot product parameters include the first reference parameter j and the number of symbols N. subcarry , cyclic prefix length N CP,l First point N2, configured bandwidth Number of subcarriers included in a resource block (RB) At least one of them; the computer device uses the first reference parameter j and the number of symbols N to... subcarry With the length of the cyclic prefix N CP,l Perform exponentiation to generate the first dot product formula; the first dot product formula is:
[0160] According to the relevant agreement, N2 and N subcarry The values of N are all integers. subcarry It depends on the configured bandwidth. The number of subcarriers included in a resource block (RB) Calculated bandwidth; The number of subcarriers included in a resource block (RB) The product of and can be expressed by the formula as . For example, N2 is 2048 or 4096; N subcarry The value is 12. The first dot product signal includes the first dot product sequence, and the above first dot product formula can also be called the calculation formula for the first dot product sequence.
[0161] The third step is to calculate the table lookup parameter using the formula INDEX3 = (1-N). subcarry (m3-N) cp,l The computer device uses the floor() function to calculate the third lookup parameter INDEX3, generating the third lookup parameter Index3. The third lookup formula is Index3 = floor(INDEX3 * ((1024 * 8) / M3) + 0.5), where M3 corresponds to different bandwidth values, such as 128, 256, 512, 1024, or 4096.
[0162] The computer device retrieves the first dot product signal from the rotation factor table based on the third lookup table parameter. For the specific lookup process, please refer to step 1031a above. This allows the computer device to perform dot product processing without relying on Cordic, reducing the computational load on the computer device, while also reducing the computing area of this part of the chip, lowering chip costs, reducing resource waste, and ensuring the accuracy of the calculation results.
[0163] In one possible implementation, step 40 includes: step 401, the computer device generates a merged signal based on the dot product signal and the IFFT signal; step 402, the merged signal is filtered to generate a result signal.
[0164] In embodiments of the present invention, such as Figure 4 As shown, when the computer device performs filtering based on PUSCH, the IFFT signal includes a first IFFT signal, the dot product signal includes a first dot product signal, and the combined signal includes a first combined signal; step 401 includes: step 4011, the computer device generates a first combined signal based on the first IFFT signal and the first dot product signal; step 402 includes: step 4021, the computer device performs filtering processing on the first combined signal to generate a baseband signal.
[0165] The computer device multiplies the first IFFT signal with the first dot product signal and uses the result of the multiplication as the first combined signal; the first combined signal is upsampled to obtain a baseband signal with a uniform sampling rate.
[0166] In one possible implementation, the signal to be processed includes a second signal to be processed based on a second channel, and the preparation signal includes a second mapped signal; Figure 8 A flowchart for generating a second mapping signal is provided as an embodiment of the present invention, such as... Figure 8 As shown, step 10 may specifically include:
[0167] Step 111: The computer device performs a second preset processing on the second signal to be processed based on the second channel to generate a second modulated signal.
[0168] In this embodiment of the invention, the second preset processing includes second bit-level processing and second modulation processing. The second channel includes PUCCH. Figure 9 A flowchart for generating a second modulation signal is provided as an embodiment of the present invention, such as... Figure 9 As shown, step 111 may specifically include:
[0169] Step 1111: The computer device performs second-bit-level processing on the second signal to be processed based on the second channel to generate a second-bit signal.
[0170] In this embodiment of the invention, the second signal to be processed includes a second input bit sequence a k3 The second bit signal includes the second output bit sequence b. k3 The computer device uses PUCCH to process the second input bit sequence a. k3 Perform a second bit-level processing to generate a second output bit sequence b. k3 The second-level bit processing includes UCI encoding and scrambling. The second-level bit processing based on PUCCH can be implemented according to 3GPP protocol 36.212; for example, the second-level bit processing includes UCI encoding and scrambling.
[0171] Figure 10 A schematic diagram of a PUCCH-based signal processing procedure provided in an embodiment of the present invention is shown below. Figure 10 As shown, the computer device can perform UCI encoding, scrambling, modulation, cyclic shifting, spreading, resource mapping with DMRS, IFFT, dot multiplication and filtering on the second signal to be processed based on PUCCH to generate the PUCCH result signal.
[0172] Step 1112: The computer device performs a second modulation process on the second bit signal to generate a second modulated signal.
[0173] In this embodiment of the invention, the second modulation process includes QPSK or Binary Phase Shift Keying (BPSK).
[0174] The second modulation signal includes the second output symbol sequence d. k3 .like Figure 10 As shown, the computer device can, based on PUSCH, modulate the second output bit sequence b through a modulator. k3 Perform a second modulation process to generate a second output symbol sequence d. k3 This implements the conversion of the second output bit sequence b. k3 The bit mapping is a complex symbol, that is, a modulated signal represented by real part data and imaginary part data. The complex symbol corresponding to the bit is different under different modulation methods.
[0175] Step 112: The computer device performs cyclic shifting processing on the second modulation signal to generate a cyclic shifted signal.
[0176] In this embodiment of the invention, the cyclic shift signal includes a third cyclic shift sequence. A computer device generates the third cyclic shift sequence based on the acquired second cyclic shift parameters and a second modulation signal. The second cyclic shift parameters include a second reference parameter P and a third reference parameter. Reference cyclic shift signal length The fourth parameter δ, group number u, and intra-group sequence number v must be at least one of the following:
[0177] Step 112 may specifically include: Step 1121, the computer device generates a second base sequence based on the acquired second base sequence parameters; Step 1122, the computer device generates a fourth cyclic shift sequence based on the second base sequence using a rotation factor table. Step 1123: The computer device uses the fourth cyclic shift sequence. The second modulation signal and the second cyclic shift parameters generate a third cyclic shift sequence. Specifically, step 1122 may include: a computer device generating a fourth lookup table parameter based on the second base sequence; and generating a fourth cyclic shift sequence based on the fourth lookup table parameter using a rotation factor table.
[0178] The second cyclic shift parameter includes the second reference parameter P. The computer device calculates the second base sequence. When referring to step 1031a above, when the reference cyclic shift signal length is... When the value is less than a first preset threshold, the computer device processes the first base sequence. The calculation process. Computer equipment can calculate the second basis sequence. Then, the computer device generates the fourth lookup table parameter based on the fourth obtained parameter according to the calculation formula of the fourth lookup table parameter. The fourth obtained parameter includes n3 and the circular shift value a. The calculation formula of the fourth lookup table parameter is INDEX4 = n3 * a. The computer device generates the fourth lookup table parameter according to the fourth lookup table parameter calculation formula and the fourth obtained parameter. The fourth lookup table parameter is calculated using the floor() function according to the fourth lookup table parameter calculation formula. The calculation formula of the fourth lookup table parameter is Index4 = floor(INDEX4 * ((1024 * 8) / M4) + 0.5), where the value of M4 is 12. After calculating the fourth lookup table parameter, the computer device can look up the fourth obtained sequence in the rotation factor table according to the fourth lookup table parameter. The fourth obtained sequence and the second base sequence are then compared. Generate the fourth cyclic shift sequence For the specific table lookup process, please refer to step 1031a above.
[0179] Computer devices can use the third cyclic shift sequence formula to calculate n3 when n3 is greater than or equal to 0 and less than or equal to 0. Within the range, based on the obtained fourth cyclic shift sequence The third cyclic shift sequence is calculated using the second reference parameter P and the second modulation signal. The formula for the third cyclic shift sequence is:
[0180]
[0181] in, The fourth parameter δ takes the value of 0, and d(0) represents the second output symbol sequence d. k3 The first value.
[0182] This allows computer devices to perform cyclic shift processing without relying on Cordic, reducing the computational load on the computer, while also reducing the computing area of this part of the chip, lowering the chip cost, reducing resource waste, and ensuring the accuracy of the calculation results.
[0183] Step 113: The computer equipment performs spread spectrum processing on the cyclic shift signal to generate a spread spectrum signal.
[0184] In this embodiment of the invention, the computer device performs expansion processing on the cyclic shift signal and the acquired orthogonal sequence to generate a spread spectrum signal. For example, based on 3GPP protocol 211, the computer device multiplies the third cyclic shift sequence and the orthogonal sequence to perform expansion, and uses the product of the third cyclic shift sequence and the orthogonal sequence as the spread spectrum signal.
[0185] Step 114: The computer device generates a first reference signal based on the acquired first reference signal parameters using the rotation factor table.
[0186] In this embodiment of the invention, the first reference signal parameter includes the first reference signal length of the first reference signal. First reference signal length Less than a second preset threshold, for example, the length of the first reference signal. The first preset threshold is 12, and the second preset threshold is 36.
[0187] The computer device obtains the third base sequence, referring to step 1031a where the computer device generates the first base sequence. The steps are as follows: The computer device generates the fifth lookup table parameter based on the fifth acquisition parameter according to the fifth lookup table parameter calculation formula. The fifth acquisition parameter includes n4 and the cyclic shift value a. The calculation formula for the fifth lookup table parameter is INDEX5 = n4 * a. The computer device generates the fifth lookup table parameter based on the fifth lookup table parameter calculation formula. The fifth lookup table parameter is calculated by using the floor() function on the fifth lookup table parameter. The calculation formula for the fifth lookup table parameter is Index5 = floor(INDEX5 * ((1024 * 8) / M5) + 0.5), where M5 is 12. After calculating the fifth lookup table parameter, the computer device can look up the fifth acquisition sequence in the rotation factor table based on the fifth lookup table parameter. The first reference signal is generated based on the fifth acquisition sequence and the third base sequence. For the specific lookup process, please refer to step 1031a above. Step 114 can refer to the DMRS generation process in step 1031 above. This allows computer devices to perform cyclic shift processing without relying on Cordic, reducing the computational load on the computer, while also reducing the computing area of this part of the chip, lowering the chip cost, reducing resource waste, and ensuring the accuracy of the calculation results.
[0188] Step 115: The computer equipment performs resource mapping processing on the spread spectrum signal and the first reference signal to generate a second mapped signal.
[0189] In this embodiment of the invention, the format of PUCCH may include 1, 1a, 1b, 2, 2a, or 2b. For example... Figure 10 As shown, prior to step 115, the process further includes: the computer device scrambling the spread spectrum signal to generate a scrambled signal. In time slot n... s Internally, the computer device performs resource mapping processing on the first reference signal and the scrambled signal based on the second mapping signal formula to generate the second mapping signal. The computer device calculates the second mapping signal formula based on resource blocks. The second mapping signal formula is as follows:
[0190]
[0191] When the PUCCH format is 1, 1a, or 1b:
[0192]
[0193]
[0194] in, This indicates a resource indicator with PUCCH format 1, 1a, or 1b. Indicates the first relevant parameter; Indicates the second relevant parameter; This represents the third relevant parameter.
[0195] When the PUCCH format is 2, 2a, or 2b:
[0196]
[0197] in, This indicates a resource specification with PUCCH format 2, 2a, or 2b. The number of subcarriers included in the resource block RB. For fixed values, The fixed value is 12.
[0198] In one possible implementation, the preparation signal includes a second mapped signal, and the IFFT signal includes a second IFFT signal; step 20 includes: step 202, the computer device performs inverse fast Fourier transform (IFFT) processing on the second mapped signal through a rotation factor table to generate the second IFFT signal.
[0199] In this embodiment of the invention, step 202 may refer to step 201 described above.
[0200] In one possible implementation, the dot product signal includes a second dot product signal; step 30 includes: step 302, the computer device generates a sixth lookup table parameter based on the second channel and the acquired second dot product parameter; and generates the second dot product signal based on the sixth lookup table parameter through a rotating factor table.
[0201] In this embodiment of the invention, step 302 can refer to step 301 described above.
[0202] In one possible implementation, the IFFT signal includes a second IFFT signal, the dot product signal includes a second dot product signal, and the merged signal includes a second merged signal; step 401 includes: step 4012, the computer device generates a second merged signal based on the second IFFT signal and the second dot product signal; step 402 includes: step 4022, the computer device performs filtering processing on the second merged signal to generate a PUCCH result signal.
[0203] In embodiments of the present invention, such as Figure 10 As shown, when the computer device performs filtering based on the second channel, the computer device first multiplies the second IFFT signal with the second dot product signal, and uses the result of the multiplication as the second combined signal; the second combined signal is upsampled to obtain the PUCCH result signal with a uniform sampling rate.
[0204] In one possible implementation, the signal to be processed includes a third signal to be processed based on a third channel, and the preparation signal includes a second reference signal; step 10 may specifically include: step 121, the computer device performs cyclic shift processing on the third signal to be processed based on the third channel and through a rotation factor table to generate the second reference signal.
[0205] In this embodiment of the invention, the third channel includes PRACH. The third signal to be processed includes a third input bit sequence; the third input bit sequence includes a Zadoff-Chu (ZC) sequence. The computer device can represent the ZC sequence x using ZC parameters. u (n4), ZC parameters include the ZC sequence length N ZC The ZC sequence is related to the physical root sequence index value u. The computer generates the ZC formula by performing exponential operations on the ZC parameters, and the ZC sequence is represented by the ZC formula. The ZC formula is:
[0206]
[0207] Where, N ZC The value can be 139 or 839.
[0208] Figure 11 A schematic diagram of a PRACH-based signal processing procedure provided in an embodiment of the present invention is shown below. Figure 11 As shown, a computer device can acquire a ZC sequence based on PRACH, and perform IFFT, filtering, dot multiplication, and filtering on the ZC sequence to generate a PRACH result signal.
[0209] The second reference signal includes the ZC cyclic sequence x. u,v (n4). The computer device, based on PRACH, performs cyclic shifting on the ZC sequence using a rotation factor table to generate a ZC cyclic sequence x. u,v (n4). The second reference signal includes the ZC cyclic sequence x. u,v (n4).
[0210] The computer device generates a ZC cyclic sequence formula from the acquired ZC sequence; it generates a seventh pre-lookup table parameter INDEX7 based on the ZC cyclic sequence formula and the ZC parameters using the seventh pre-lookup table parameter calculation formula; it calculates the seventh lookup table parameter Index7 based on the seventh pre-lookup table parameter using the seventh lookup table parameter calculation formula; and it generates a ZC cyclic sequence based on the seventh lookup table parameter using the rotation factor table.
[0211] ZC cyclic sequence x u,v (n4) can be expressed using the ZC cyclic sequence formula, where the computer device is in a state where n4 is greater than or equal to 0 and less than or equal to N. ZC Within the range of -1, for ZC sequence length N ZCPerform a modulo operation, and generate a ZC cyclic sequence by multiplying the result of the modulo operation with the ZC sequence. The formula for the ZC cyclic sequence is x. u,v (n4)=x u ((n4+C v )modN ZC ); where C v This represents the cyclic shift value. The computer device calculates the cyclic shift value C using the seventh lookup table parameter calculation formula. v With ZC sequence length N ZC Perform a modulo operation, and multiply the result of the modulo operation with the index value u of the physical root sequence to generate the seventh parameter for table lookup. The formula for calculating the seventh parameter is INDEX7 = u * ((n4 + C v )modN ZC )*(((n4+C v )modN ZC +1); The formula for calculating the seventh lookup parameter is Index7 = floor(INDEX7 * ((1024 * 8) / M7) + 0.5), where M7 = N ZC The computer device can retrieve the ZC cycle sequence from the rotation factor table using the seventh lookup parameter Index7. Please refer to step 1031a above for the lookup process.
[0212] In one possible implementation, the preparation signal includes a second reference signal, and the IFFT signal includes a third IFFT signal; step 20 includes: step 203, the computer device performs IFFT processing on the second reference signal through a rotation factor table to generate the third IFFT signal.
[0213] In this embodiment of the invention, the computer device generates a third IFFT signal formula using a second reference signal and acquired third IFFT parameters; and generates an IFFT signal according to the third IFFT signal formula using a rotation factor table. The second reference signal includes a ZC cyclic sequence x. u,v (n4). The third IFFT parameter includes the power adjustment factor β. PRACH Fifth parameter Sixth parameter K, seventh parameter k0, second frequency Δf RA Cp length tT CP First reference parameter j, ZC sequence length N ZC Configure bandwidth Number of subcarriers included in a resource block (RB) Resources allocated to PRACH At least one of the third frequencies Δf.
[0214] The computer device uses the third IFFT signal formula to calculate n4 from 0 to N. ZCFor ZC cyclic sequences x within the range of -1 u,v (n4) is subjected to exponential, multiplicative, and summative operations with the obtained third IFFT parameters to generate the third IFFT signal s(t). The formula for the third IFFT signal is:
[0215] The computer equipment can calculate the third frequency Δf and the second frequency Δf. RA The sixth parameter K can be expressed by the formula: K = Δf / Δf RA The sixth parameter K is the sum of the third frequency Δf and the second frequency Δf. RA The ratio. Computer devices can be configured based on the resources allocated to PRACH. Number of subcarriers included in a resource block (RB) With configured bandwidth The seventh parameter k0 is calculated; it can be expressed by the formula: The computer device can determine the second frequency Δf based on the preamble format. RA Or the fifth parameter The values of Δf are shown in Table 4 below. Table 4 shows one possible value for the second frequency Δf. RA The value table for .
[0216] Table 4
[0217]
[0218] As shown in Table 4 above, when the leading pattern is any one of 0-3, the second frequency Δf RA The value is 1250Hz, the fifth parameter. The value of is 7; when the leading pattern is 4, the second frequency Δf RA The value is 7500Hz, the fifth parameter. The value of is 2.
[0219] In this embodiment of the invention, the IFFT points are 1024. For the specific calculation process, please refer to step 201 above.
[0220] In one possible implementation, the dot product signal includes a third dot product signal; step 30 includes: step 303, the computer device generates a third lookup table parameter based on the third channel and the acquired third dot product parameter; and generates the third dot product signal based on the third lookup table parameter through a rotating factor table.
[0221] In this embodiment of the invention, the computer device generates the eighth lookup table parameter INDEX8 based on the obtained third dot product parameter using the eighth lookup table parameter calculation formula; calculates the eighth lookup table parameter Index8 based on the eighth lookup table parameter using the eighth lookup table parameter calculation formula; and generates the third dot product signal based on the eighth lookup table parameter using the rotation factor table.
[0222] Computer devices can also generate the third dot product formula based on the acquired third dot product parameters; the third dot product parameters include the first reference parameter j and the fifth parameter. Sixth parameter K, seventh parameter k0, eighth parameter T CP,l ZC sequence length N ZC The computer device performs an exponential operation on the third dot product parameter, N3, to generate the third dot product formula, which is:
[0223] The maximum value of N3 is 8192.
[0224] The formula for calculating the eighth parameter in the table lookup is: INDEX8 = (m - (T) CP,l -TA)), where TA represents the lead time. The computer device uses the eighth lookup table parameter calculation formula to perform the floor() function operation on the eighth lookup table parameter INDEX8 to generate the eighth lookup table parameter Index8. The calculation formula for the eighth lookup table parameter is Index8 = floor(INDEX8 * ((1024 * 8) / M8) + 0.5); where M8 can be selected according to the relevant protocol, and M8 is 8192 or 4096. The computer device can find the third dot product signal from the rotation factor table according to the eighth lookup table parameter Index8. For the specific lookup process, please refer to step 1031a above. This allows the computer device to perform dot product processing without relying on Cordic, reducing the computational load of the computer device, reducing the computing area of this part of the chip, reducing chip cost, reducing resource waste, and ensuring the accuracy of the calculation results.
[0225] In one possible implementation, the IFFT signal includes a third IFFT signal, the dot product signal includes a third dot product signal, and the merged signal includes a third merged signal; step 401 includes: step 4013, the computer device filters the third IFFT signal to generate a filtered signal; and generates a third merged signal based on the filtered signal and the third dot product signal; step 402 includes: step 4023, the computer device filters the third merged signal to generate a PRACH result signal.
[0226] In embodiments of the present invention, such as Figure 11As shown, in step 4013, the number of points in the third IFFT signal before filtering is 1024. The computer device changes the sampling rate of the third IFFT signal through filtering, so that the number of points in the filtered third IFFT signal is 1536. The computer device multiplies the filtered signal with the third point-multiplied signal and uses the result of the multiplication as the third combined signal; the third combined signal is upsampled to obtain a PRACH result signal with a uniform sampling rate.
[0227] In one possible implementation, the computer device acquires multiple uplink signals calculated using a purely computational method based on the Cordic algorithm; and generates an error based on the multiple uplink signals and the result signal corresponding to the uplink signal calculated by the method described in this invention. Figure 12 An error diagram provided for an embodiment of the present invention, such as... Figure 12 As shown, the computer device calculates the error between multiple result signals and the corresponding uplink signal. The horizontal axis represents the signal length of the uplink or result signal, and the vertical axis represents the absolute error value. The error between the uplink signal and the result signal is within 1%, which is small. This eliminates the need for the computer device to store multiple ROM tables; it can perform Cordic calculations simply by reusing the rotation factor table, reducing the waste of both computational and storage resources.
[0228] This invention provides a signal generation method. A computer device generates a preparation signal based on an acquired signal to be processed. The preparation signal is then processed using an inverse fast Fourier transform (IFFT) through a rotation factor table to generate an IFFT signal. A dot product signal is generated based on the acquired dot product parameters using the rotation factor table. Finally, a result signal is generated based on the dot product signal and the IFFT signal. This allows the computer device to replace complex Cordic operations with a stored rotation factor table, reducing computational complexity and the hardware implementation complexity of the Cordic algorithm, thus reducing the computational area of the chip and lowering chip costs. By reusing the rotation factor table, result signals from different channels are generated, reducing the utilization of the device's storage resources, minimizing resource waste, and ensuring the accuracy of the calculation results.
[0229] Figure 13 This is a schematic diagram of a signal generation device provided in an embodiment of the present invention, as shown below. Figure 13 As shown, the device includes: a first generation module 11, a second generation module 12, a third generation module 13, and a fourth generation module 14. The first generation module 11 is connected to the second generation module 12, the second generation module 12 is connected to the third generation module 13, and the third generation module 13 is connected to the fourth generation module 14.
[0230] The first generation module 11 is used to generate a preparation signal based on the acquired signal to be processed; the second generation module 12 is used to perform Inverse Fast Fourier Transform (IFFT) processing on the preparation signal using a rotation factor table to generate an IFFT signal; the third generation module 13 is used to generate a dot product signal based on the acquired dot product parameters using a rotation factor table; and the fourth generation module 14 is used to generate a result signal based on the dot product signal and the IFFT signal.
[0231] In one possible implementation, the signal to be processed includes a first signal to be processed based on a first channel, and the preparation signal includes a first mapped signal; the first generation module 11 is specifically used to perform a first preset processing on the first signal to be processed based on the first channel to generate a first modulated signal; perform precoding processing on the first modulated signal to generate a precoded signal; generate an RS signal according to the acquired RS parameters; and perform resource mapping processing on the precoded signal and the RS signal to generate a first mapped signal.
[0232] In one possible implementation, the RS parameters include DMRS parameters and SRS parameters, and the RS signal includes a demodulation reference signal DMRS and a channel sounding reference signal SRS; the first generation module 11 is specifically used to generate DMRS based on the DMRS parameters and generate SRS based on the acquired SRS parameters.
[0233] In one possible implementation, the DMRS parameters include a first DMRS parameter and a second DMRS parameter; the first generation module 11 is specifically used to generate a first base sequence based on the first DMRS parameter and the first preset threshold obtained; generate a first cyclic shift sequence based on the first base sequence, and generate a first acquisition sequence based on the first acquisition parameter; and generate DMRS based on the first cyclic shift sequence, the first acquisition sequence and the second DMRS parameter.
[0234] In one possible implementation, the signal to be processed includes a second signal to be processed based on a second channel, and the preparation signal includes a second mapped signal; the first generation module 11 is specifically used to perform a second preset processing on the second signal to be processed based on the second channel to generate a second modulated signal; perform cyclic shift processing on the second modulated signal to generate a cyclic shift signal; perform spread spectrum processing on the cyclic shift signal to generate a spread spectrum signal; generate a first reference signal based on the obtained first reference signal parameters through a rotation factor table; and perform resource mapping processing on the spread spectrum signal and the first reference signal to generate a second mapped signal.
[0235] In one possible implementation, the signal to be processed includes a third signal to be processed based on a third channel, and the preparation signal includes a second reference signal; the first generation module 11 is specifically used to perform cyclic shifting processing on the third signal to be processed based on the third channel and through a rotation factor table to generate the second reference signal.
[0236] In one possible implementation, the fourth generation module 14 is specifically used to generate a combined signal based on the dot product signal and the IFFT signal; and to filter the combined signal to generate the result signal.
[0237] This invention provides a signal generation apparatus. A computer device generates a preparation signal based on an acquired signal to be processed. Using a rotation factor table, the preparation signal undergoes an inverse fast Fourier transform (IFFT) to generate an IFFT signal. Then, using the rotation factor table and the acquired dot product parameters, a dot product signal is generated. Finally, a result signal is generated based on the dot product signal and the IFFT signal. This allows the computer device to replace complex Cordic operations with a stored rotation factor table, reducing computational complexity and the hardware implementation complexity of the Cordic algorithm, thus reducing the computational area of the chip and lowering chip costs. By reusing the rotation factor table, result signals from different channels are generated, reducing the utilization of the device's storage resources, minimizing resource waste, and ensuring the accuracy of the calculation results.
[0238] This invention provides a storage medium that includes a stored program. When the program runs, it controls the device where the storage medium is located to execute the steps of the above-described signal generation method. For a detailed description, please refer to the embodiments of the above-described signal generation method.
[0239] This invention provides a computer device, including a memory and a processor. The memory is used to store information including program instructions, and the processor is used to control the execution of the program instructions. When the program instructions are loaded and executed by the processor, they implement the steps of the above-described signal generation method. For a detailed description, please refer to the embodiments of the above-described signal generation method.
[0240] Figure 14 This is a schematic diagram of a computer device provided in an embodiment of the present invention. Figure 14 As shown, the computer device 30 of this embodiment includes a processor 31, a memory 32, and a computer program 33 stored in the memory 32 and executable on the processor 31. When the processor 31 executes the computer program 33, it implements the signal generation method described in the embodiment. To avoid repetition, these details are not elaborated here. Alternatively, when the processor 31 executes the computer program, it implements the functions of each model / unit in the signal generation device described in the embodiment. To avoid repetition, these details are not elaborated here.
[0241] Computer device 30 includes, but is not limited to, processor 31 and memory 32. Those skilled in the art will understand that... Figure 14This is merely an example of computer device 30 and does not constitute a limitation on computer device 30. It may include more or fewer components than shown, or combine certain components, or different components. For example, computer device 30 may also include input / output devices, network access devices, buses, etc.
[0242] The processor 31 may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor.
[0243] The memory 32 can be an internal storage unit of the computer device 30, such as a hard disk or RAM of the computer device 30. The memory 32 can also be an external storage device of the computer device 30, such as a plug-in hard disk, Smart Media Card (SMC), Secure Digital (SD) card, or Flash Card equipped on the computer device 30. Furthermore, the memory 32 can include both internal and external storage units of the computer device 30. The memory 32 is used to store computer programs and other programs and data required by the computer device 30. The memory 32 can also be used to temporarily store data that has been output or will be output.
[0244] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0245] In the embodiments provided by this invention, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection between devices or units through some interfaces, and may be electrical, mechanical, or other forms.
[0246] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0247] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or in the form of hardware plus software functional units.
[0248] The integrated units implemented as software functional units described above can be stored in a computer-readable storage medium. These software functional units, stored in a storage medium, include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute some steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0249] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A method for generating a signal, characterized in that, include: Generate a preparation signal based on the acquired signal to be processed; The prepared signal is processed by inverse fast Fourier transform (IFFT) using a rotation factor table to generate an IFFT signal. The dot product signal is generated based on the obtained dot product parameters using the rotation factor table; A result signal is generated based on the dot product signal and the IFFT signal; The rotation factor table includes a ROM table, which contains multiple e jz The calculation result is obtained by querying e from the ROM table. jz The result of the operation replaces e jz The operation involves performing an IFFT on the prepared signal to generate an IFFT signal. The IFFT processing of the prepared signal involves the Coridic algorithm, which involves processing e... jz Perform calculations; The dot product signal includes a first dot product signal, the dot product parameters include a first dot product parameter, and the step of generating the dot product signal based on the obtained dot product parameters through a rotation factor table includes: A first dot product formula is generated based on the first dot product parameters, wherein the first dot product parameters include a first reference parameter j and the number of symbols. , length of cyclic prefix First point Configure bandwidth The number of subcarriers included in a resource block (RB) At least one of them; the first dot product formula is: Twiddle_Factor ( )= m3 = 0, 1, ... +N2-1, and The values of are all integers. It depends on the configured bandwidth. The number of subcarriers included in a resource block (RB) Calculated bandwidth; The number of subcarriers included in a resource block (RB) The product of and can be expressed by the formula as . = ; The third lookup parameter INDEX3 is generated based on the first dot product formula, where the calculation formula for the third lookup parameter is INDEX3 = ; The floor() function is used to calculate the third lookup parameter to generate the third lookup parameter Index3; The first dot product signal is retrieved from the rotation factor table according to the third lookup parameter.
2. The method according to claim 1, characterized in that, The signal to be processed includes a first signal to be processed based on a first channel, and the preparation signal includes a first mapped signal; the step of generating the preparation signal based on the acquired signal to be processed includes: Based on the first channel, the first signal to be processed is subjected to a first preset processing to generate a first modulated signal; The first modulated signal is precoded to generate a precoded signal; An RS signal is generated based on the acquired RS parameters; The precoded signal and the RS signal are subjected to resource mapping processing to generate the first mapped signal.
3. The method according to claim 2, characterized in that, The RS parameters include DMRS parameters and SRS parameters, and the RS signals include demodulation reference signal DMRS and channel sounding reference signal SRS; The step of generating an RS signal based on the acquired RS parameters includes: The DMRS is generated based on the DMRS parameters; The SRS is generated based on the obtained SRS parameters.
4. The method according to claim 3, characterized in that, The DMRS parameters include a first DMRS parameter and a second DMRS parameter; generating the DMRS based on the DMRS parameters includes: A first base sequence is generated based on the first DMRS parameters and the obtained first preset threshold. A first cyclic shift sequence is generated based on the first base sequence, and a first acquisition sequence is generated based on the first acquisition parameters; The DMRS is generated based on the first cyclic shift sequence, the first acquisition sequence, and the second DMRS parameters.
5. The method according to claim 1, characterized in that, The signal to be processed includes a second signal to be processed based on a second channel, and the preparation signal includes a second mapped signal; the step of generating the preparation signal based on the acquired signal to be processed includes: Based on the second channel, the second signal to be processed is subjected to a second preset processing to generate a second modulated signal; The second modulated signal is cyclically shifted to generate a cyclically shifted signal; The cyclic shift signal is spread spectrum processed to generate a spread spectrum signal; The first reference signal is generated based on the obtained first reference signal parameters using the rotation factor table; The spread spectrum signal and the first reference signal are subjected to resource mapping processing to generate the second mapped signal.
6. The method according to claim 1, characterized in that, The signal to be processed includes a third signal to be processed based on a third channel, and the preparation signal includes a second reference signal; the step of generating the preparation signal based on the acquired signal to be processed includes: Based on the third channel, the third signal to be processed is cyclically shifted using a rotation factor table to generate the second reference signal.
7. The method according to claim 1, characterized in that, The step of generating a result signal based on the dot product signal and the IFFT signal includes: A combined signal is generated based on the dot product signal and the IFFT signal; The merged signal is filtered to generate the result signal.
8. A signal generation apparatus, characterized in that, include: The first generation module is used to generate a preparation signal based on the acquired signal to be processed; The second generation module is used to perform Inverse Fast Fourier Transform (IFFT) processing on the prepared signal using a rotation factor table to generate an IFFT signal. The third generation module is used to generate a dot product signal based on the obtained dot product parameters using a rotation factor table. The fourth generation module is used to generate a result signal based on the dot product signal and the IFFT signal; The rotation factor table includes a ROM table, which contains multiple e jz The calculation result is obtained by querying e from the ROM table. jz The result of the operation replaces e jz The operation involves performing an IFFT on the prepared signal to generate an IFFT signal. The IFFT processing of the prepared signal involves the Coridic algorithm, which involves processing e... jz Perform calculations; The dot product signal includes a first dot product signal, and the dot product parameters include first dot product parameters. Specifically, the third generation module generates a first dot product formula based on the first dot product parameters, wherein the first dot product parameters include a first reference parameter j and the number of symbols. , length of cyclic prefix First point Configure bandwidth The number of subcarriers included in a resource block (RB) At least one of them; the first dot product formula is: Twiddle_Factor ( )= m3 = 0, 1, ... +N2-1, and The values of are all integers. It depends on the configured bandwidth. The number of subcarriers included in a resource block (RB) Calculated bandwidth; The number of subcarriers included in a resource block (RB) The product of and can be expressed by the formula as . = The third pre-lookup parameter INDEX3 is generated based on the first dot product formula, wherein the calculation formula for the third pre-lookup parameter is INDEX3 = The floor() function is used to calculate the third lookup parameter to generate the third lookup parameter Index3; the first dot product signal is found from the rotation factor table according to the third lookup parameter.
9. A storage medium, characterized in that, The storage medium includes a stored program, wherein, when the program is executed, it controls the device containing the storage medium to perform the signal generation method according to any one of claims 1 to 7.
10. A computer device comprising a memory and a processor, the memory for storing information including program instructions, and the processor for controlling the execution of the program instructions, characterized in that, When the program instructions are loaded and executed by the processor, they implement the signal generation method steps of any one of claims 1 to 7.
Citation Information
Patent Citations
Reconstructable digital signal processor
CN1900927A
