CN115412939A - Method, apparatus, device, medium and program product for generating ZC sequence - Google Patents

Method, apparatus, device, medium and program product for generating ZC sequence Download PDF

Info

Publication number
CN115412939A
CN115412939A CN202211038080.0A CN202211038080A CN115412939A CN 115412939 A CN115412939 A CN 115412939A CN 202211038080 A CN202211038080 A CN 202211038080A CN 115412939 A CN115412939 A CN 115412939A
Authority
CN
China
Prior art keywords
sequence
discrete
value
exponent
determining
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211038080.0A
Other languages
Chinese (zh)
Inventor
李炎钊
张磊
胡厚攀
蒋颖波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bicocq Microelectronics Hangzhou Co ltd
Original Assignee
Bicocq Microelectronics Hangzhou Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bicocq Microelectronics Hangzhou Co ltd filed Critical Bicocq Microelectronics Hangzhou Co ltd
Priority to CN202211038080.0A priority Critical patent/CN115412939A/en
Publication of CN115412939A publication Critical patent/CN115412939A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present disclosure provides a method for generating a ZC sequence, which can be applied to the technical field of wireless communication. The method comprises the following steps: according to the number of user sub-carriers
Figure DDA0003814603670000011
Determining ZC sequence parameters; according to ZC sequence length
Figure DDA0003814603670000012
Structural modeling
Figure DDA0003814603670000013
A multiplicative group of (1); according to any selected generator of the multiplicative group and the length of the ZC sequence
Figure DDA0003814603670000014
Generating a discrete logarithm table and a discrete exponent table in advance; determining, from the any selected generator and the discrete logarithm table, a value for the any selected generator based on a q-value and an n-valueTarget discrete index of generator { i g ,i n1 ,i n2 }; determining a phase value corresponding to each element in a ZC sequence according to any selected generator, the target discrete exponent and the discrete exponent table; and generating the ZC sequence according to the phase value corresponding to each element in the ZC sequence. The present disclosure also provides a device, an apparatus, a storage medium, and a program product for generating a ZC sequence.

Description

Method, apparatus, device, medium and program product for generating ZC sequence
Technical Field
The present disclosure relates to the field of wireless communication technologies, and in particular, to a method, an apparatus, a device, a medium, and a program product for generating a ZC sequence.
Background
PUSCH DMRS/PRACH/SRS signal generation for LTE/5GNR all involve the generation of a ZARDOFF-CHU (ZC) sequence. The generation of ZC sequences is a challenge both at the receiver and at the transmitter, due to the computation involved with the second order complex sinusoidal sequence and the need to retain high accuracy. In the existing method, an iteration method is mostly adopted to reduce the computational complexity. One drawback of the iterative approach is that the error is accumulated as the number of iterations increases, which is a significant cost for performance degradation of the key signals, DMRS/PRACH/SRS signals, which have a significant impact on receiver performance.
It is noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure and therefore may include information that does not constitute prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
In view of the above, the present disclosure provides a method, an apparatus, a device, a medium, and a program product for generating a ZC sequence with low computational complexity and high accuracy.
According to a first aspect of the present disclosure, there is provided a method of generating a ZC sequence, including: according to the number of user sub-carriers
Figure BDA0003814603650000011
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure BDA0003814603650000012
And q value;
according to the length of the ZC sequence
Figure BDA0003814603650000013
Structural modeling
Figure BDA0003814603650000014
Multiplicative group of
Figure BDA0003814603650000015
According to any selected generator of the multiplicative group and the length of the ZC sequence
Figure BDA0003814603650000016
Generating a discrete logarithm table and a discrete exponent table in advance;
determining a target discrete exponent { i } for the any selected generator based on the q-value and the n-value from the any selected generator and the discrete logarithm table q ,i n1 ,i n2 };
Determining a phase value corresponding to each element in a ZC sequence according to any selected generating element, the target discrete exponent and the discrete exponent table; and
generating a ZC sequence according to the phase value corresponding to each element in the ZC sequence,
wherein the discrete logarithm table is used for representing the corresponding relation of any selected generator, q value, n value and discrete logarithm, the discrete exponent table is used for representing the corresponding relation of any selected generator and discrete exponent, n is the serial number of ZC sequence,
Figure BDA0003814603650000021
according to the embodiment of the disclosure, the number of the sub-carriers is determined according to the number of the users
Figure BDA0003814603650000022
Determining ZC sequence parameters comprises:
according to the number of user sub-carriers
Figure BDA0003814603650000023
Determining ZC sequence length
Figure BDA0003814603650000024
And
according to the length of the ZC sequence
Figure BDA0003814603650000025
And calculating a q value by the group number u of the base sequence and the sequence number v of the base sequence in the group.
According to an embodiment of the present disclosure, according to the any selected generator and the ZC sequence length
Figure BDA0003814603650000026
The pre-generating of the discrete logarithm table and the discrete exponent table includes:
randomly selecting any generator of the multiplicative group;
according to the arbitrary generator and the ZC sequence length
Figure BDA0003814603650000027
And calculating the discrete logarithm of the q value and the n value corresponding to any generator to generate a discrete logarithm table and a discrete exponent table.
According to an embodiment of the present disclosure, a target discrete exponent { i ] for the any selected generator based on a q-value and an n-value is determined according to the any selected generator and the discrete logarithm table q ,i n1 ,i n2 The method comprises the following steps:
randomly selecting one generator as a target generator; and
determining n corresponding to all n values according to the parity of the n values 1 And n2; and
determining a plurality of sets { q, n by looking up said discrete logarithm table 1 ,n 2 Discrete exponent for the target generator i q ,i n1 ,i n2 }。
According to an embodiment of the present disclosure, the determining n according to the parity of the n value 1 And n 2 The method comprises the following steps:
when it is determined that n is an even number,
Figure BDA0003814603650000028
n 2 =n+1;
when n is determined to be odd, n 1 =n,
Figure BDA0003814603650000029
According to an embodiment of the present disclosure, the determining a phase value corresponding to each element in a ZC sequence according to any one of the selected generator, the target discrete exponent and the discrete exponent table includes:
traversing target discrete indexes corresponding to elements of the ZC sequence;
and searching the discrete index table according to any selected generator and the target discrete index corresponding to each element to determine the phase value corresponding to each element in the ZC sequence.
A second aspect of the present disclosure provides a generation apparatus of a ZC sequence, including: a first determining module for determining the number of user sub-carriers
Figure BDA0003814603650000031
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure BDA0003814603650000032
And a q value;
a second determining module for determining the number of user sub-carriers
Figure BDA0003814603650000033
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure BDA0003814603650000034
And a q value;
a multiplicative group constructing module for constructing a length of the ZC sequence according to the length of the ZC sequence
Figure BDA0003814603650000035
Construction of
Figure BDA0003814603650000036
Multiplication ofGroup(s)
Figure BDA0003814603650000037
A first generating module for generating a length of the ZC sequence according to any selected generator of the multiplicative group
Figure BDA0003814603650000038
Generating a discrete logarithm table and a discrete exponent table in advance;
a first determining module for determining a target discrete exponent (i) for any selected generator based on q-value and n-value according to the selected generator and the discrete logarithm table q ,i n1 ,i n2 };
A second determining module, configured to determine, according to the any selected generator, the target discrete exponent and the discrete exponent table, a phase value corresponding to each element in the ZC sequence; and
a second generating module, configured to generate a ZC sequence according to the phase value corresponding to each element in the ZC sequence,
wherein the discrete logarithm table is used for representing the corresponding relation of any selected generator, q value, n value and discrete logarithm, the discrete exponent table is used for representing the corresponding relation of any selected generator and discrete exponent, n is the serial number of ZC sequence,
Figure BDA0003814603650000039
a third aspect of the present disclosure provides an electronic device, comprising: one or more processors; memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above-described method of generating a ZC sequence.
A fourth aspect of the present disclosure also provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-described method of generating a ZC sequence.
The fifth aspect of the present disclosure also provides a computer program product including a computer program that, when executed by a processor, implements the above-described method of generating a ZC sequence.
According to the method for generating the ZC sequence, provided by the embodiment of the disclosure, a ZC sequence formula is deformed and simplified, the sequence is split into an odd subsequence and an even subsequence for processing, and a modeling is constructed according to the length of the ZC sequence
Figure BDA0003814603650000041
In addition, a table look-up method is used for solving discrete logarithm and discrete exponent, compared with the prior art, the method provided by the embodiment of the disclosure is beneficial to improving the performance of a receiver at the receiver end because no error accumulation is introduced by iterative operation, and the EVM of the receiver is reduced at the transmitter end.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, taken in conjunction with the accompanying drawings of which:
fig. 1 schematically illustrates an application scenario diagram of a method, apparatus, device, medium, and program product for generating a ZC sequence according to embodiments of the present disclosure;
fig. 2 schematically shows a flowchart of a method of generating a ZC sequence according to an embodiment of the present disclosure;
FIG. 3 schematically shows a flow chart of another method for generating a ZC sequence according to an embodiment of the disclosure;
fig. 4 schematically shows a block diagram of a configuration of a generating apparatus of a ZC sequence according to an embodiment of the present disclosure;
fig. 5 schematically shows a block diagram of an electronic device adapted to implement a method of generating a ZC sequence according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "A, B and at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include, but not be limited to, systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
An embodiment of the present disclosure provides a method for generating a ZC sequence, the method including: according to the number of user sub-carriers
Figure BDA0003814603650000051
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure BDA0003814603650000052
And a q value; according to theZC sequence length
Figure BDA0003814603650000053
Structural modeling
Figure BDA0003814603650000054
Of multiplicative group
Figure BDA0003814603650000055
According to any selected generator of the multiplicative group and the ZC sequence length
Figure BDA0003814603650000056
Generating a discrete logarithm table and a discrete exponent table in advance; determining a target discrete exponent { i } for the any selected generator based on the q-value and the n-value from the any selected generator and the discrete logarithm table q ,i n1 ,i n2 }; determining a phase value corresponding to each element in a ZC sequence according to any selected generating element, the target discrete exponent and the discrete exponent table; and generating a ZC sequence according to the phase values corresponding to the elements in the ZC sequence, wherein the discrete logarithm table is used for representing the corresponding relation of any selected generator, a q value, an n value and a discrete logarithm, the discrete exponent table is used for representing the corresponding relation of any selected generator and a discrete exponent, n is the serial number of the ZC sequence,
Figure BDA0003814603650000057
fig. 1 schematically shows an application scenario diagram of a method, an apparatus, a device, a medium, and a program product for generating a ZC sequence according to embodiments of the present disclosure. As shown in fig. 1, an application scenario 100 according to this embodiment may include a generation scenario of a ZC sequence. Network 104 is the medium used to provide communication links between terminal devices 101, 102, 103 and server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server providing various services, such as a background server (for example only) that supports users with ZC sequence generation instructions issued by the terminal devices 101, 102, 103. The background server can process the received data such as the user instruction and the like, and feed back the processing result (for example, generating the ZC sequence according to the user ZC sequence generation instruction) to the terminal equipment.
It should be noted that the method for generating a ZC sequence provided by the embodiments of the present disclosure may be generally performed by the server 105. Accordingly, the generation apparatus of ZC sequence provided by the embodiments of the present disclosure may be generally disposed in the server 105. The method for generating a ZC sequence according to the embodiments of the present disclosure may also be performed by a server or a server cluster different from the server 105 and capable of communicating with the terminal apparatuses 101, 102, and 103 and/or the server 105. Accordingly, the generating device of the ZC sequence provided in the embodiment of the present disclosure may also be provided in a server or a server cluster different from the server 105 and capable of communicating with the terminal apparatuses 101, 102, 103 and/or the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
A method for generating a ZC sequence according to the disclosed embodiment will be described in detail with reference to fig. 2 to 4 based on the scenario described in fig. 1.
Fig. 2 schematically shows a flowchart of a method for generating a ZC sequence according to an embodiment of the present disclosure.
As shown in fig. 2, the method of generating a ZC sequence of this embodiment includes operations S210 to S260, and may be performed by a server or other computing device.
First, a ZC sequence generation formula according to an embodiment of the present disclosure is described, where a ZC sequence used for an LTE PUSCH DMRS is taken as an example, and formula (1) is a generation formula of the ZC sequence:
Figure BDA0003814603650000071
Where,
Figure BDA0003814603650000072
wherein the content of the first and second substances,
Figure BDA0003814603650000073
the number of sub-carriers occupied by a user, taking the maximum supportable bandwidth of LTE-20MHz as an example,
Figure BDA0003814603650000074
is 1200;
Figure BDA0003814603650000075
is not more than
Figure BDA0003814603650000076
Is the largest prime number (prime number). n is the ZC sequence number. u and v are fixed parameters configured by a high layer, wherein u is a base sequence group number, and v is a base sequence number in the group.
In order to better reduce the complexity of the ZC sequence operation while maintaining high accuracy, in the embodiment of the present disclosure, the periodicity of the ZC sequence is used to simplify the generation formula of the ZC sequence to formula (2):
Figure BDA0003814603650000077
further derivation using the periodicity of the complex exponential sequence yields equation (3)
Figure BDA0003814603650000078
When n is an even number or an odd number, the formula (3) is transformed into the formula (4):
Figure BDA0003814603650000079
to generate a ZC sequence, phase values corresponding to different numbers are substantially obtained, and as can be seen from equation (4), the generation equation of the ZC sequence and the parity of the ZC sequence number are related to each other and are expressed as equation (5):
Figure BDA0003814603650000081
Figure BDA0003814603650000082
as can be seen from equation (4), there are 3 special cases, i.e., when n =0 or
Figure BDA0003814603650000083
Or
Figure BDA0003814603650000084
Then the sequence value is 1+0j, i.e. r u,v (0)=1+0j,
Figure BDA0003814603650000085
Figure BDA0003814603650000086
In operation S210, according to the number of user subcarriers
Figure BDA0003814603650000087
ZC sequence parameters are determined.
According to an embodiment of the present disclosure, the ZC sequence parameters compriseZC sequence length
Figure BDA0003814603650000088
And a q value.
In one example, first, the number of user subcarriers is determined
Figure BDA0003814603650000089
Determining ZC sequence length
Figure BDA00038146036500000810
And a q value. For example when
Figure BDA00038146036500000811
At 1200, determine
Figure BDA00038146036500000812
1193.
Determining a q value according to the formula (6), specifically:
Figure BDA00038146036500000813
Figure BDA00038146036500000814
the u and v parameters are different for different users, so the q value is also different.
Scalable, for ZC sequence applications in LTE/NR PUSCH DMRS and SRS, q is determined by u, v, for PRACH q = u.
In operation S220, according to the ZC sequence length
Figure BDA00038146036500000815
Structural modeling
Figure BDA00038146036500000816
Multiplicative group of
Figure BDA00038146036500000817
In operation S230, any selected generator of the multiplicative group and the ZC sequence length
Figure BDA00038146036500000818
A discrete logarithm table and a discrete exponent table are generated in advance.
In operation S240, a target discrete exponent { i ] for the any selected generator based on the q-value and the n-value is determined from the any selected generator and the discrete logarithm table q ,i n1 ,i n2 }。
According to an embodiment of the present disclosure, the discrete logarithm table is used to characterize a correspondence of the any selected generator, q value, n value, and discrete logarithm, the discrete exponent table is used to characterize a correspondence of the any selected generator and discrete exponent, n is a serial number of the ZC sequence,
Figure BDA0003814603650000091
in one example, in the disclosed embodiment, the generation formula of the ZC sequence is simplified to the form of formula (4) because
Figure BDA0003814603650000092
For prime numbers, a multiplication group is constructed based on a modular multiplication method of prime numbers
Figure BDA0003814603650000093
The modular multiplication in the multiplicative group in equation (4) may be mapped as modular addition of the multiplicative group, i.e.
Figure BDA0003814603650000094
Wherein i q 、i n1 And i n2 Are q and n respectively 1 And n 2 Based on the discrete exponent of the generator g, the property of the modular operation of the multiplicative group is utilized to convert the modular multiplication method with high bit width into the modular addition operation with low bit width, thereby reducing the bit width of the operation node, saving operation resources while keeping high precision, and being particularly suitable for hardware realization.
The typical method for solving discrete logarithm in real time is BSGS algorithm, and the operation complexity is
Figure BDA0003814603650000095
However, in engineering practice, the value ranges of the q value and the n value are limited, and the maximum value does not exceed 1201 by taking LTE as an example. In order to save calculation time and reduce the complexity of the calculation method, the discrete index can be determined by a table look-up method, so that the length of the generator g and the ZC sequence can be selected according to any selected generator in advance
Figure BDA0003814603650000096
A discrete logarithm table and a discrete exponent table are generated. Determining, by a table lookup, a target discrete index { i } for any selected generator g based on the q-value and the n-value q ,i n1 ,i n2 }. According to target discrete index i q ,i n1 ,i n2 Looking up a discrete index table to determine
Figure BDA0003814603650000097
In operation S250, a phase value corresponding to each element in the ZC sequence is determined according to any one of the selected generator, the target discrete exponent and the discrete exponent table.
In operation S260, a ZC sequence is generated according to phase values corresponding to elements in the ZC sequence.
In one example, the phase value Q corresponding to each element (serial number) in the ZC sequence can be calculated by substituting the target discrete index determined in operation S240 into equation (4),
Figure BDA0003814603650000098
further calculate the sequence value r corresponding to the element u,v (n)=e j2πQ
According to the method for generating the multi-ZC sequence, a ZC sequence formula is deformed and simplified, a multiplication group is constructed according to the length of the ZC sequence, the multiplication group property of multiplication of a modulus prime number is utilized, multiplication mode operation is mapped into addition mode operation, word length and complexity of calculation are greatly reduced, in addition, a table lookup method is used for obtaining discrete logarithm and discrete exponent, compared with the prior art, the method provided by the embodiment of the disclosure is beneficial to improving the performance of a receiver at the receiver end due to the fact that error accumulation caused by iterative operation does not exist, EVM of the receiver is reduced at the transmitter end, the word length of the method is small, the operation complexity is low, and the method is particularly suitable for hardware implementation and can obviously reduce power consumption and area.
Fig. 3 schematically shows a flowchart of another ZC sequence generation method according to an embodiment of the present disclosure. As shown in fig. 3, operations S310 to S380 are included.
In operation S310, according to the number of user subcarriers
Figure BDA0003814603650000101
Determining ZC sequence length
Figure BDA0003814603650000102
In operation S320, according to the ZC sequence length
Figure BDA0003814603650000103
And calculating a q value by the group number u of the base sequence and the sequence number v of the base sequence in the group.
In operation S330, according to the ZC sequence length
Figure BDA0003814603650000104
Structural modeling
Figure BDA0003814603650000105
Multiplicative group of
Figure BDA0003814603650000106
The schemes and principles of operations S310 to S330 can be seen in operations 210 and S220 shown in fig. 2, and are not described herein again.
In operation S340, the ZC sequence length and any selected generator of the multiplicative group
Figure BDA0003814603650000107
Pre-generationA discrete logarithm table and a discrete exponent table.
According to an embodiment of the present disclosure, randomly selecting any generator of the multiplicative group;
according to the any generator and the ZC sequence length
Figure BDA0003814603650000108
And calculating the discrete logarithm of the q value and the n value corresponding to any generator to generate a discrete logarithm table and a discrete exponent table.
In one example, a plurality of generator g are arranged in a constructed multiplication group, all the generators in the constructed multiplication group are firstly determined, one generator is randomly selected from the generators, discrete logarithm tables corresponding to different q values and n values are generated in advance, discrete exponent tables based on the generator g are generated, and different discrete logarithm tables and discrete exponent tables correspond to different generator g.
In operation S350, a target discrete exponent { i ] for the any selected generator based on the q-value and the n-value is determined according to the any selected generator and the discrete logarithm table q ,i n1 ,i n2 }。
According to the embodiment of the disclosure, one generation element is randomly selected as a target generation element; determining n corresponding to all n values according to the parity of the n values 1 And n 2 (ii) a Determining a plurality of sets { q, n by looking up said discrete logarithm table 1 ,n 2 Discrete exponent for the target generator i q ,i n1 ,i n2 }。
In operation S360, a target discrete exponent corresponding to each element of the ZC sequence is determined through traversal.
In one example, according to equation (5), let n be an even number when n is 1 =n/2,n 2 = n +1; when n is an odd number, let n 1 =n,n 2 = n + 1/2. To be provided with
Figure BDA0003814603650000111
For example, 1191, 1195, 1197, 1199 is addressed to even numbered 2,. 1190, 1194, 1196, 1198 and odd numbered 1,3. According to the value of n in generating ZC sequencesParity, to obtain the corresponding n 1 And n 2 According to the multiple groups n 1 And n 2 Looking up corresponding discrete index { i) in a pre-generated discrete logarithm table q ,i n1 ,i n2 }。
In operation S370, the discrete exponent table is looked up according to the any selected generator and the target discrete exponent corresponding to each element to determine a phase value corresponding to each element in the ZC sequence.
In operation S380, a ZC sequence is generated according to phase values corresponding to elements in the ZC sequence.
In one example, the discrete index table is looked up according to the plurality of sets of target discrete indexes obtained by the traversal of operation S350 to determine the P value,
Figure BDA0003814603650000112
the normalized phase Q is calculated from the P value,
Figure BDA0003814603650000113
further calculate the sequence value r corresponding to the element u,v (n)=e j2πQ
Based on the method for generating the ZC sequence, the disclosure also provides a device for generating the ZC sequence. The apparatus will be described in detail below with reference to fig. 4.
Fig. 4 schematically shows a block diagram of a configuration of a generating apparatus of a ZC sequence according to an embodiment of the present disclosure.
As shown in fig. 4, the generating apparatus 400 of a ZC sequence of this embodiment includes a first determining module 410, a multiplicative group constructing module 420, a first generating module 430, a second determining module 440, a third determining module 450, and a second generating module 460.
The first determining module 410 is used for determining the number of user sub-carriers
Figure BDA0003814603650000114
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure BDA0003814603650000115
And a q value.In an embodiment, the first determining module 410 may be configured to perform the operation S210 described above, which is not described herein again.
A multiplicative group construction module 420 for constructing a length according to the ZC sequence
Figure BDA0003814603650000121
Structural modeling
Figure BDA0003814603650000122
Of multiplicative group
Figure BDA0003814603650000123
In an embodiment, the multiplicative group constructing module 420 may be configured to perform the operation S220 described above, which is not described herein again.
A first generating module 430 for generating a ZC sequence according to any selected generator and the length of ZC sequence
Figure BDA0003814603650000124
A discrete logarithm table and a discrete exponent table are generated in advance. In an embodiment, the first generating module 430 may be configured to perform the operation S230 described above, which is not described herein again.
The second determining module 440 is used for determining a target discrete exponent { i ] for the any selected generator based on the q-value and the n-value according to the any selected generator and the discrete logarithm table q ,i n1 ,i n2 }. In an embodiment, the second determining module 440 may be configured to perform the operation S240 described above, which is not described herein again.
The third determining module 450 is configured to determine a phase value corresponding to each element in the ZC sequence according to any one of the selected generator, the target discrete exponent and the discrete exponent table. In an embodiment, the third determining module 450 may be configured to perform the operation S250 described above, and is not described herein again.
The second generating module 460 is configured to generate a ZC sequence according to phase values corresponding to elements in the ZC sequence, where the discrete logarithm table is used to represent a corresponding relationship between any selected generator, q value, n value, and discrete logarithmThe discrete exponent table is used for representing the corresponding relation between any selected generator and the discrete exponent, n is the serial number of the ZC sequence,
Figure BDA0003814603650000125
Figure BDA0003814603650000126
in an embodiment, the second generating module 460 may be configured to perform the operation S260 described above, which is not described herein again.
According to an embodiment of the present disclosure, any plurality of the first determining module 410, the multiplicative group constructing module 420, the first generating module 430, the second determining module 440, the third determining module 450 and the second generating module 460 may be combined into one module to be implemented, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first determining module 410, the multiplicative group constructing module 420, the first generating module 430, the second determining module 440, the third determining module 450 and the second generating module 460 may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware and firmware, or in any suitable combination of any of them. Alternatively, at least one of the first determining module 410, the multiplicative group constructing module 420, the first generating module 430, the second determining module 440, the third determining module 450 and the second generating module 460 may be implemented at least in part as a computer program module that, when executed, may perform a corresponding function.
Fig. 5 schematically shows a block diagram of an electronic device adapted to implement a method of generating a ZC sequence according to an embodiment of the present disclosure.
As shown in fig. 5, an electronic device 500 according to an embodiment of the present disclosure includes a processor 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are stored. The processor 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the program may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, electronic device 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The electronic device 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
The present disclosure also provides a computer-readable storage medium, which may be embodied in the device/apparatus/system described in the above embodiments; or may exist alone without being assembled into the device/apparatus/system. The above-mentioned computer-readable storage medium carries one or more programs which, when executed, implement a method of generating a ZC sequence according to an embodiment of the present disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 502 and/or RAM 503 and/or one or more memories other than ROM 502 and RAM 503 described above.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated by the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the generation method of the ZC sequence provided by the embodiments of the present disclosure.
The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 501. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, and the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, downloaded and installed through the communication section 509, and/or installed from the removable medium 511. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user's computing device, partly on the user's device, partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments of the present disclosure and/or the claims may be made without departing from the spirit and teachings of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure are described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (10)

1. A method of generating a ZC sequence, the method comprising:
according to the number of user sub-carriers
Figure FDA0003814603640000011
Determining ZC sequence parameters, wherein theThe ZC sequence parameters comprise the length of the ZC sequence
Figure FDA0003814603640000012
And a q value;
according to the length of the ZC sequence
Figure FDA0003814603640000013
Structural modeling
Figure FDA0003814603640000014
Of multiplicative group
Figure FDA0003814603640000015
According to any selected generator of the multiplicative group and the length of the ZC sequence
Figure FDA0003814603640000016
Generating a discrete logarithm table and a discrete exponent table in advance;
determining a target discrete exponent { i } for the any selected generator based on the q-value and the n-value from the any selected generator and the discrete logarithm table q ,i n1 ,i n2 };
Determining a phase value corresponding to each element in a ZC sequence according to any selected generator, the target discrete exponent and the discrete exponent table; and
generating a ZC sequence according to the phase value corresponding to each element in the ZC sequence,
wherein the discrete logarithm table is used for representing the corresponding relation of any selected generator, q value, n value and discrete logarithm, the discrete exponent table is used for representing the corresponding relation of any selected generator and discrete exponent, n is the serial number of ZC sequence,
Figure FDA0003814603640000017
2. the method of claim 1, wherein the method is performed in a batch processAccording to the number of user sub-carriers
Figure FDA0003814603640000018
Determining ZC sequence parameters comprises:
according to the number of user sub-carriers
Figure FDA0003814603640000019
Determining ZC sequence length
Figure FDA00038146036400000110
And
according to the length of the ZC sequence
Figure FDA00038146036400000111
And calculating a q value by the group number u of the base sequence and the sequence number v of the base sequence in the group.
3. The method of claim 1, wherein the ZC sequence length is determined based on any selected generator and the ZC sequence length
Figure FDA00038146036400000112
The pre-generating of the discrete logarithm table and the discrete exponent table includes:
randomly selecting any generator of the multiplicative group;
according to the arbitrary generator and the ZC sequence length
Figure FDA00038146036400000113
And calculating the discrete logarithm of the q value and the n value corresponding to any generator to generate a discrete logarithm table and a discrete exponent table.
4. The method of claim 1, wherein a target discrete exponent { i ] for any selected generator based on a q-value and an n-value is determined from the any selected generator and the discrete logarithm table q ,i n1 ,i n2 The method comprises the following steps:
randomly selecting one generation element as a target generation element; and
determining n corresponding to all n values according to the parity of the n values 1 And n 2 (ii) a And
determining a plurality of sets { q, n by looking up said discrete logarithm table 1 ,n 2 Discrete exponent for the target generator i q ,i n1 ,i n2 }。
5. The method of claim 4, wherein n is determined based on parity of the n value 1 And n 2 The method comprises the following steps:
when it is determined that n is an even number,
Figure FDA0003814603640000021
n 2 =n+1;
when n is determined to be odd, n 1 =n,
Figure FDA0003814603640000022
6. The method of claim 5, wherein said determining a phase value corresponding to each element in a ZC sequence according to any one of the selected generator, the target discrete exponent and the table of discrete exponents comprises:
traversing and determining a target discrete index corresponding to each element of the ZC sequence;
and searching the discrete index table according to any selected generator and the target discrete index corresponding to each element to determine the phase value corresponding to each element in the ZC sequence.
7. An apparatus for generating a ZC sequence, comprising:
a first determining module for determining the number of user sub-carriers
Figure FDA0003814603640000023
Determining ZC sequence parameters, wherein the ZC sequence parameters comprise a ZC sequence length
Figure FDA0003814603640000024
And a q value;
a multiplicative group constructing module for constructing a length of the ZC sequence according to the length of the ZC sequence
Figure FDA0003814603640000025
Structural modeling
Figure FDA0003814603640000026
Of multiplicative group
Figure FDA0003814603640000027
A first generating module for generating a length of the ZC sequence according to any selected generator of the multiplicative group
Figure FDA0003814603640000028
Generating a discrete logarithm table and a discrete exponent table in advance;
a second determining module for determining a target discrete exponent { i ] for any selected generator based on the q-value and the n-value according to the selected generator and the discrete logarithm table q ,i n1 ,i n2 };
A third determining module, configured to determine, according to the any selected generator, the target discrete exponent and the discrete exponent table, a phase value corresponding to each element in the ZC sequence; and
a second generating module, configured to generate a ZC sequence according to the phase value corresponding to each element in the ZC sequence,
wherein the discrete logarithm table is used for representing the corresponding relation of any selected generator, q value, n value and discrete logarithm, the discrete exponent table is used for representing the corresponding relation of any selected generator and discrete exponent, n is the serial number of ZC sequence,
Figure FDA0003814603640000031
8. an electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
9. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method according to any one of claims 1 to 6.
10. A computer program product comprising a computer program which, when executed by a processor, carries out the method according to any one of claims 1 to 6.
CN202211038080.0A 2022-08-25 2022-08-25 Method, apparatus, device, medium and program product for generating ZC sequence Pending CN115412939A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211038080.0A CN115412939A (en) 2022-08-25 2022-08-25 Method, apparatus, device, medium and program product for generating ZC sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211038080.0A CN115412939A (en) 2022-08-25 2022-08-25 Method, apparatus, device, medium and program product for generating ZC sequence

Publications (1)

Publication Number Publication Date
CN115412939A true CN115412939A (en) 2022-11-29

Family

ID=84162647

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211038080.0A Pending CN115412939A (en) 2022-08-25 2022-08-25 Method, apparatus, device, medium and program product for generating ZC sequence

Country Status (1)

Country Link
CN (1) CN115412939A (en)

Similar Documents

Publication Publication Date Title
US11442779B2 (en) Method, device and computer program product for determining resource amount for dedicated processing resources
CN108933695B (en) Method and apparatus for processing information
CN110909527B (en) Text processing model running method and device, electronic equipment and storage medium
US11188828B2 (en) Set-centric semantic embedding
US20180308057A1 (en) Joint optimization and assignment of member profiles
US20200028669A1 (en) Method and system for rateless and pollution-attack-resilient network coding
CN110852720A (en) Document processing method, device, equipment and storage medium
CN115412939A (en) Method, apparatus, device, medium and program product for generating ZC sequence
CN115333583B (en) Signal detection method and device for multi-transmission multi-reception communication system
CN110019531B (en) Method and device for acquiring similar object set
CN107256244B (en) Data processing method and system
CN112100211B (en) Data storage method, apparatus, electronic device, and computer readable medium
CN114859935A (en) Path planning method, device, product and medium applied to multi-node networking
US10832466B2 (en) View-dependent stochastic volume rendering with Monte Carlo ray exploration
CN116113962A (en) Tensor comparison across a distributed machine learning environment
CN112258386A (en) Image deformation acceleration processing method and device, electronic equipment and readable storage medium
US11080360B2 (en) Transformation from general max sat to MAX 2SAT
CN115037507B (en) User access management method, device and system
CN107203578B (en) Method and device for establishing association of user identifiers
CN116132049B (en) Data encryption method, device, equipment and storage medium
US9690827B2 (en) Performing graph operations using historic inverse probability estimators
CN115391689B (en) Short link generation method, device, equipment and storage medium
CN114268558B (en) Method, device, equipment and medium for generating monitoring graph
US20240205015A1 (en) Secure computation of shared data intersections
CN109240878B (en) Data processing method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination