A ZC-DFT sequence generation method based on CORDIC algorithm
By converting the DFT operation of the ZC-DFT sequence into a form suitable for the CORDIC algorithm and using angle encoding to avoid residual angle calculations, the problem of high complexity in the generation of ZC-DFT sequences in 5G systems is solved, and an efficient hardware implementation is achieved.
Patent Information
- Application Number
- CN202111400667.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-11-19
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2041-11-19
AI Technical Summary
In 5G systems, the complexity of directly implementing the ZC-DFT sequence through formulas is high, consuming a large number of multipliers or dividers, and the iteration and angle calculation of the CORDIC algorithm lead to a large delay in hardware implementation.
The DFT operation of the ZC sequence is converted into a form suitable for the CORDIC algorithm, and the calculation is performed using an adder, shift operation and a multiplier, and the calculation of the remaining angles is avoided through angle encoding, optimizing the iteration process.
It reduces the computational complexity of ZC-DFT sequence generation, reduces logical resource consumption and delay, and improves the efficiency of hardware implementation.
Smart Images

Figure CN114089952B_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of computers and relates to a ZC-DFT sequence generation method based on a CORDIC algorithm. Background Art
[0002] In the 5G system, the main purpose of the random access channel (PRACH) design is to allow the user equipment (UE) to obtain uplink time synchronization. The random access baseband signal is mainly generated by a cyclic shift Zadoff-Chu (ZC) sequence with a length of NZC (a prime number length).
[0003] In each random access process, a group of preamble sequences generated by cyclic shift of the ZC sequence is randomly selected to perform NZC point discrete Fourier transform (DFT) and convert it into frequency domain data, namely the ZC-DFT sequence, and then mapped to the corresponding physical resource block (PRB). The mapped signal is subjected to inverse discrete Fourier transform (IFFT), and the time domain sequence is repeated a corresponding number of times for different preamble formats. Finally, a cyclic prefix (CP) and a guard period (GP) are inserted respectively.
[0004] Since the complexity of directly implementing the ZC-DFT sequence through the formula is relatively large, its related properties are not fully utilized, and it involves exponential operations, which will inevitably consume a large number of multipliers or dividers for hardware implementation. "Low-latency and high-frequency unidirectional rotation CORDI algorithm device algorithm" proposes to use the CORDIC algorithm to calculate exponential operations. Through the method of iterative addition and successive approximation, high-precision exponential function calculation results can be calculated through simple shift and addition operations. However, the disadvantage of the CORDIC algorithm is that it requires continuous iteration in the process of continuously approaching the target angle, and each iteration requires calculation and judgment of the remaining angle, which introduces a lot of delay for hardware implementation. Summary of the invention
[0005] In view of this, an object of the present invention is to provide a ZC-DFT sequence generation method based on the CORDIC algorithm.
[0006] In order to achieve the above object, the present invention provides the following technical solutions:
[0007] A ZC-DFT sequence generation method based on a CORDIC algorithm, the method comprising the following steps:
[0008] S1: ZC sequence has root number u and length N ZC ; The ZC sequence DFT operation is expressed as:
[0009]
[0010]
[0011] Where k = 0, 1, 2…N ZC ,u -1 is the modular multiplication inverse element of u, k represents the sequence number of the ZC sequence represented in the frequency domain, and we have:
[0012] uu -1 =1+nN zc ,n∈Ν (3)
[0013] S2: Combining (1), (2), and (3), we get a new expression for the ZC-DFT sequence:
[0014]
[0015] in, is a constant factor, Multiply it with the constant factor and store it in a lookup table;
[0016] S3: Factors in formula (4) Expanded into trigonometric form:
[0017]
[0018] S4: Solve formula (5) using the CORDIC algorithm, and the CORDIC algorithm must satisfy the following formula:
[0019]
[0020]
[0021] Among them, x i+1 and i+1 Respectively represent the current iteration accumulated value of the corresponding coordinates at each iteration, z i+1 Represents the remaining angle after each iteration, d i Indicates the direction of rotation, +1 indicates counterclockwise rotation, -1 indicates clockwise rotation, and m represents the number of iterations. If the initial input is set to x 0 =1 / A 0 ,y 0 =0, Z n =0, iterate to Z n =0, then:
[0022]
[0023] Substituting the output results of equations (7) and (8) into equation (4), we can get Y u '(k) sequence.
[0024] Optionally, in S2, the solution process of formula (4) is:
[0025] S21: Expand formula (1) and substitute formula (3) into it:
[0026]
[0027] S22: In formula (9), k(k+1) is always an even number, and when m is an even number, 1-u -1 is an even number, and when is an odd number, m-1 is an even number. Simplifying formula (9), we get:
[0028]
[0029] Optionally, in S4, when the CORDIC algorithm is used to solve formula (6), the direction of each angle superposition is optimized by angle encoding to avoid calculation of the remaining angles, by binary encoding the angles in the input angle range [0, π / 4), and converting the angles outside the range into corresponding angles in [0, π / 4) after transformation using trigonometric formulas; the specific encoding method is as follows:
[0030]
[0031] In formula (11), b k When the value is 1, it needs to be rotated counterclockwise 2 -k radians; when b k When the value of is 1, no angle rotation is required; after angle encoding, there is no need to calculate the remaining angle in each iteration, avoiding additional addition and shift operations, reducing the consumption of logic resources and the corresponding calculation delay.
[0032] The beneficial effects of the present invention are as follows: in the generation of the ZC-DFT sequence of the present invention, the original formula is converted into a form suitable for CORDIC algorithm operation, and the calculation of the frequency domain representation of the ZC sequence can be completed by using only an adder, a shift operation and a multiplier during the operation process. When the CORDIC algorithm is used for operation, the calculation of the remaining angles is avoided by angle coding, which further reduces the complexity of the operation and is conducive to hardware implementation.
[0033] Other advantages, objectives and features of the present invention will be described in the following description to some extent, and to some extent, will be obvious to those skilled in the art based on the following examination and study, or can be taught from the practice of the present invention. The objectives and other advantages of the present invention can be realized and obtained through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention will be described in detail below in conjunction with the accompanying drawings, wherein:
[0035] Figure 1 This is a flowchart of a ZC-DFT sequence generation method based on the CORDIC algorithm in a random access channel of a 5G system according to an embodiment of the present invention. DETAILED DESCRIPTION
[0036] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and features in the embodiments can be combined with each other without conflict.
[0037] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on the present invention. In order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of actual products. For those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.
[0038] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "front", "rear", etc. indicate the orientation or position relationship, they are based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operate in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as limiting the present invention. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.
[0039] See also Figure 1 In the present invention, a given ZC sequence has a root number u and a length of N ZC , the ZC sequence is defined as:
[0040]
[0041] Where i is the imaginary unit, n = 0, 1, 2…N ZC -1 indicates ZC sequence index;
[0042] The DFT operation of the ZC sequence is defined as:
[0043]
[0044] Therefore, a ZC-DFT sequence generation method based on the CORDIC algorithm in a 5G system of the present invention is as follows:
[0045] S21: According to the paper "Efficient computation of DFT of Zadoff-Chu sequences", the DFT operation of ZC sequence is expressed as:
[0046]
[0047]
[0048] Where k = 0, 1, 2…N ZC ,u -1 is the modular inverse element of u, k represents the sequence number of the ZC sequence represented in the frequency domain, so:
[0049] uu -1 =1+nN zc ,n∈Ν (5)
[0050] S22: Directly calculating the ZC-DFT sequence using formula (3) is difficult to implement in hardware and occupies more resources. Therefore, the present invention transforms formula (3) and combines (3)(4)(5) to obtain a new expression of the ZC-DFT sequence:
[0051]
[0052] in, is a constant factor, and With only one variation factor k, With the central symmetry property, Then we have:
[0053] Y u '(k)=Y u '(N ZC -k),k=0,…,N ZC -1 (7)
[0054] By using this symmetric property, half of the computational effort will be saved, so only part.
[0055] S23: The factors in formula (6) Expanded into trigonometric form:
[0056]
[0057] S24: Solve formula (8) using the CORDIC algorithm, and the CORDIC algorithm must satisfy the following formula:
[0058]
[0059]
[0060] Among them, x i+1 and i+1 Respectively represent the current iteration accumulated value of the corresponding coordinates at each iteration, z i+1 Represents the remaining angle after each iteration, d i Indicates the direction of rotation, +1 indicates counterclockwise rotation, -1 indicates clockwise rotation, and m represents the number of iterations. If the initial input is set to x 0 =1 / A 0 ,y 0 =0, Z n =0, iterate to Z n =0, then:
[0061]
[0062] S25: Substitute the calculation results in formulas (8) and (11) into formula (6) to obtain the final ZC-DFT sequence.
[0063] in, The index k is stored in the lookup table, and the output is solved by the CORDIC algorithm, and then multiplied to obtain the corresponding ZC-DFT sequence. During the operation, only adders, shift operations, and a multiplier are used to complete the calculation of the frequency domain representation of the ZC sequence. When the CORDIC algorithm is used, the calculation of the remaining angles is avoided through angle encoding, which further reduces the complexity of the operation and is conducive to hardware implementation.
[0064] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solution, which should be included in the scope of the claims of the present invention.
Claims
1. A ZC-DFT sequence generation method based on the CORDIC algorithm, Features: The method comprises the following steps: S1: ZC sequence has root number u and length N ZC ; The ZC sequence DFT operation is expressed as: Where k = 0, 1, 2…N ZC ,u -1 is the modular multiplication inverse element of u, k represents the sequence number of the ZC sequence represented in the frequency domain, and we have: new -1 =1+nN zc ,n∈Ν (3) S2: Combining (1), (2), and (3), we get a new expression for the ZC-DFT sequence: in, is a constant factor, Multiply it with the constant factor and store it in a lookup table; S3: Factors in formula (4) Expanded into trigonometric form: S4: Solve formula (5) using the CORDIC algorithm, and the CORDIC algorithm must satisfy the following formula: Among them, x i+1 and i+1 Respectively represent the current iteration accumulated value of the corresponding coordinates at each iteration, z i+1 Represents the remaining angle after each iteration, d i Indicates the direction of rotation, +1 indicates counterclockwise rotation, -1 indicates clockwise rotation, and m represents the number of iterations. If the initial input is set to x 0 =1 / A 0 ,y 0 =0, Z n =0, iterate to Z n =0, then: Substituting the output results of equations (7) and (8) into equation (4), we can get Y u '(k) sequence.
2. The method for generating a ZC-DFT sequence based on a CORDIC algorithm according to claim 1, Features: In S2, the solution process of formula (4) is: S21: Expand formula (1) and substitute formula (3) into it: S22: In formula (9), k(k+1) is always an even number, and when m is an even number, 1-u -1 is an even number, and when is an odd number, m-1 is an even number. Simplifying formula (9), we get:
3. The ZC-DFT sequence generation method based on the CORDIC algorithm according to claim 2, Features: In S4, when the CORDIC algorithm is used to solve formula (6), the direction of each angle superposition is optimized by angle encoding to avoid the calculation of the remaining angles. The angles in the input angle range [0, π / 4) are binary encoded, and the angles outside this range are converted into corresponding angles in [0, π / 4) by using trigonometric function formulas. The specific encoding method is as follows: In formula (11), b k When the value is 1, it needs to be rotated counterclockwise 2 -k radians; when b k When the value of is 1, no angle rotation is required; after angle encoding, there is no need to calculate the remaining angle in each iteration, avoiding additional addition and shift operations, reducing the consumption of logic resources and the corresponding calculation delay.
