CN115567183B - M sequence generation method and device - Google Patents
M sequence generation method and device Download PDFInfo
- Publication number
- CN115567183B CN115567183B CN202211198131.6A CN202211198131A CN115567183B CN 115567183 B CN115567183 B CN 115567183B CN 202211198131 A CN202211198131 A CN 202211198131A CN 115567183 B CN115567183 B CN 115567183B
- Authority
- CN
- China
- Prior art keywords
- sequence
- matrix
- target
- generating
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0958—Management thereof based on metrics or performance parameters
- H04W28/0967—Quality of Service [QoS] parameters
- H04W28/0975—Quality of Service [QoS] parameters for reducing delays
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides an M sequence generation method and device, which are applied to the technical field of communication, wherein the M sequence generation method comprises the following steps: determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence; determining a first target M sequence corresponding to a target matrix according to a first initial M sequence corresponding to the resource data and the target matrix; a first M-sequence is generated from the first target M-sequence. In the process of generating the first M sequence, the iteration times from the first initial M sequence to the first target M sequence can be skipped according to the target matrix determined from the plurality of conversion matrices, so that the iteration times from the first initial M sequence to the first M sequence are reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for generating an M sequence.
Background
After the terminal device accesses the base station, when transmitting a signal to the base station based on a cyclic prefix-orthogonal frequency division multiplexing (Cyclic Prefix Orthogonal Frequency Division Multiplexing, CP-OFDM) waveform in an uplink physical shared channel (Physical Uplink Shared Channel, PUSCH) or based on an uplink control channel (Physical Uplink Control Channel, PUCCH) Format 2, a demodulation reference signal (Demodulation Reference Signal, DMRS) sequence needs to be generated. The DMRS sequence is a Gold sequence, which is generated from two M sequences.
In the prior art, no matter how resources are allocated, the process of generating one M sequence needs to go through thousands of iterations, and thousands of iterations need a long time, so that the process of generating the M sequence has high time delay.
Disclosure of Invention
An object of an embodiment of the present application is to provide a method and an apparatus for generating an M sequence, which are used for solving a technical problem in the prior art that delay of generating the M sequence is high.
In a first aspect, an embodiment of the present application provides an M-sequence generating method, including: determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence; determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix; and generating a first M sequence according to the first target M sequence. In the above scheme, in generating the first M-sequence based on the first initial M-sequence, the target matrix may be determined from a plurality of transformation matrices based on the resource data. The matrix number corresponding to the target matrix represents the number of iterations that can be skipped in the process of generating the first M sequence, so that the number of iterations from the first initial M sequence to the first target M sequence can be skipped according to the target matrix, and the number of iterations from the first initial M sequence to the first M sequence is reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an optional embodiment, the first target M sequence is configured to generate a demodulation reference signal, where the resource data includes a number of resource units and a bandwidth segment start position corresponding to a currently activated bandwidth segment, where the number of resource units is a number of resource units occupied by the demodulation reference signal in one resource block. In the above scheme, after the terminal device accesses the cell, the base station may allocate the number of resource units and the bandwidth segment start position corresponding to the currently activated bandwidth segment to the terminal device according to the actual situation, so that based on different numbers of resource units and bandwidth segment start positions, different conversion matrices may be determined, so that the number of iterations from the first initial M sequence to the first target M sequence may be skipped according to the conversion matrices, and further the number of iterations from the first initial M sequence to the first M sequence may be reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an optional implementation manner, the determining the target matrix according to the resource data sent by the base station from a plurality of pre-stored conversion matrices includes: calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment; and determining the target matrix from the plurality of conversion matrices according to the iteration times and the matrix numbers corresponding to the conversion matrices. In the above scheme, based on different numbers of resource units and bandwidth segment starting positions, different iteration times can be determined, and based on the iteration times, the most suitable target matrix can be determined from a plurality of conversion matrices, so that the iteration times in the generated M sequence are reduced as much as possible. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an alternative embodiment, the generating a first M sequence according to the first target M sequence includes: determining the number of the residual resource blocks according to the initial position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks; and iterating the residual iteration times on the first target M sequence to obtain a first M sequence corresponding to the bandwidth segment starting position, wherein the first M sequence is used for generating the demodulation reference signal. In the above scheme, after the first initial M-sequence is changed to the first target M-sequence according to the target matrix, the first target M-sequence needs to be changed to the first M-sequence through iteration. The remaining iteration number may be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix, and the number of resource units. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
In an optional embodiment, the determining the number of remaining resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units includes: calculating the number of iterated resource blocks according to the matrix number corresponding to the target matrix and the number of resource units; and determining the difference value between the starting position of the bandwidth segment and the iterated resource block number as the residual resource block number. In the above scheme, the number of remaining resource blocks can be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix and the number of resource units, so as to determine the number of remaining iterations. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
In an optional embodiment, after determining the number of remaining resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units, and determining the number of remaining iterations according to the number of resource blocks, the method further includes: acquiring a second target M sequence corresponding to a pre-stored matrix number corresponding to the target matrix; and iterating the residual iteration times on the second target M sequence to obtain a second M sequence corresponding to the bandwidth segment starting position, wherein the second M sequence is used for generating the demodulation reference signal. In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. The process of generating the second M sequence is similar to the process of generating the first M sequence, the second target M sequence may be determined first, and then the number of iterations may be reduced by iterating from the second target M sequence to the second M sequence.
In an optional embodiment, after determining the number of remaining resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units, and determining the number of remaining iterations according to the number of resource blocks, the method further includes: and acquiring a second M sequence which is stored in advance and corresponds to the initial position of the bandwidth segment, wherein the second M sequence is used for generating a demodulation reference signal. In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. Since the initial sequence corresponding to the second M sequence is fixed, the second M sequence corresponding to the start position of the bandwidth segment can be directly acquired, thereby reducing the iteration number.
In a second aspect, an embodiment of the present application provides an M-sequence generating apparatus, including: the first determining module is used for determining a target matrix from a plurality of conversion matrices stored in advance according to the resource data sent by the base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence; the second determining module is used for determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix; and the generation module is used for generating a first M sequence according to the first target M sequence. In the above scheme, in generating the first M-sequence based on the first initial M-sequence, the target matrix may be determined from a plurality of transformation matrices based on the resource data. The matrix number corresponding to the target matrix represents the number of iterations that can be skipped in the process of generating the first M sequence, so that the number of iterations from the first initial M sequence to the first target M sequence can be skipped according to the target matrix, and the number of iterations from the first initial M sequence to the first M sequence is reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an optional embodiment, the first target M sequence is configured to generate a demodulation reference signal, where the resource data includes a number of resource units and a bandwidth segment start position corresponding to a currently activated bandwidth segment, where the number of resource units is a number of resource units occupied by the demodulation reference signal in one resource block. In the above scheme, after the terminal device accesses the cell, the base station may allocate the number of resource units and the bandwidth segment start position corresponding to the currently activated bandwidth segment to the terminal device according to the actual situation, so that based on different numbers of resource units and bandwidth segment start positions, different conversion matrices may be determined, so that the number of iterations from the first initial M sequence to the first target M sequence may be skipped according to the conversion matrices, and further the number of iterations from the first initial M sequence to the first M sequence may be reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an alternative embodiment, the first determining module is specifically configured to: calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment; and determining the target matrix from the plurality of conversion matrices according to the iteration times and the matrix numbers corresponding to the conversion matrices. In the above scheme, based on different numbers of resource units and bandwidth segment starting positions, different iteration times can be determined, and based on the iteration times, the most suitable target matrix can be determined from a plurality of conversion matrices, so that the iteration times in the generated M sequence are reduced as much as possible. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
In an alternative embodiment, the generating module is specifically configured to: determining the number of the residual resource blocks according to the initial position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks; and iterating the residual iteration times on the first target M sequence to obtain a first M sequence corresponding to the bandwidth segment starting position, wherein the first M sequence is used for generating the demodulation reference signal. In the above scheme, after the first initial M-sequence is changed to the first target M-sequence according to the target matrix, the first target M-sequence needs to be changed to the first M-sequence through iteration. The remaining iteration number may be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix, and the number of resource units. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
In an alternative embodiment, the generating module is further configured to: calculating the number of iterated resource blocks according to the matrix number corresponding to the target matrix and the number of resource units; and determining the difference value between the starting position of the bandwidth segment and the iterated resource block number as the residual resource block number. In the above scheme, the number of remaining resource blocks can be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix and the number of resource units, so as to determine the number of remaining iterations. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
In an alternative embodiment, the M-sequence generating device further includes: the first acquisition module is used for acquiring a second target M sequence corresponding to a pre-stored matrix number corresponding to the target matrix; and the iteration module is used for iterating the residual iteration times to the second target M sequence to obtain a second M sequence corresponding to the bandwidth segment starting position, and the second M sequence is used for generating the demodulation reference signal. In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. The process of generating the second M sequence is similar to the process of generating the first M sequence, the second target M sequence may be determined first, and then the number of iterations may be reduced by iterating from the second target M sequence to the second M sequence.
In an alternative embodiment, the M-sequence generating device further includes: and the second acquisition module is used for acquiring a second M sequence which is stored in advance and corresponds to the bandwidth segment starting position, and the second M sequence is used for generating a demodulation reference signal. In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. Since the initial sequence corresponding to the second M sequence is fixed, the second M sequence corresponding to the start position of the bandwidth segment can be directly acquired, thereby reducing the iteration number.
In a third aspect, embodiments of the present application provide a computer program product comprising computer program instructions which, when read and executed by a processor, perform the M-sequence generating method according to the first aspect.
In a fourth aspect, embodiments of the present application provide an electronic device, including: a processor, a memory, and a bus; the processor and the memory complete communication with each other through the bus; the memory stores computer program instructions executable by the processor, the processor invoking the computer program instructions to perform the M-sequence generation method according to the first aspect.
In a fifth aspect, embodiments of the present application provide a computer-readable storage medium storing computer program instructions that, when executed by a computer, cause the computer to perform the M-sequence generation method according to the first aspect.
In order to make the above objects, features and advantages of the present application more comprehensible, embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of an M-sequence generating method provided in an embodiment of the present application;
fig. 2 is a block diagram of an M-sequence generating device according to an embodiment of the present application;
fig. 3 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
After the terminal equipment is accessed to the base station, the terminal equipment sends signals to the base station through a channel, wherein the terminal equipment can send signals to the base station through a PUSCH and a PUCCH. For a channel PUSCH, the transmitted waveform is divided into a multi-carrier (CP-OFDM waveform) and a single carrier, and under the scene of transmitting the multi-carrier, the terminal equipment needs to generate a DMRS sequence; for the channel PUCCH, when transmitting a signal in Format 2, the terminal device also needs to generate the DMRS sequence.
The DMRS sequence is a Gold sequence, and the Gold sequence is a pseudo-random sequence with good characteristics, which is proposed and analyzed on the basis of an M sequence, and is formed by adding two M sequences with equal code length and same code clock rate preferably through modulo 2. That is, the DMRS sequence is generated from two M sequences of equal code length.
In the embodiment of the present application, the lengths of two M sequences in the DMRS sequence may be calculated by the following formula:
seqLen＝(maxPRBIdx+bwpStartCRB+1)*numDMRSREPerPRB*2+1600；
Where seqLen is the length of two M sequences, maxPRBIdx is the maximum index of the allocated physical Resource blocks (Physical Resource Block, PRB) (bwpStartCRB is the starting index of BWP relative to pointea relative to the Bandwidth segment start position corresponding to the currently active Bandwidth segment (BWP)), and numdmrspeerprb is the number of Resource Elements (REs) occupied by DMRS in one Resource Block (RB).
In the prior art, when a terminal device wants to send signals to a base station in the two scenarios, firstly, the terminal device can query the parameters and calculate the length of an M sequence based on the parameters obtained by the query; then, the terminal device can query a formula for calculating the M sequences, and calculate two M sequences respectively based on the formula obtained by query; finally, the terminal device may determine the DMRS sequence based on the calculated two M sequences.
As an implementation manner, after the terminal device calculates the DMRS sequence, the DMRS sequence may be mapped onto a resource grid, and after the resource grid changes the DMRS sequence into a waveform, the waveform is sent to the base station; after receiving the waveform, the base station can demodulate the DMRS sequence to obtain other data.
In the process of calculating the M sequence, the prior art iteratively calculates the final M sequence from the initial M sequence in an iterative manner. In the above iterative process, since the number of iterations is large, a large time delay is generated, thereby affecting normal signal transmission between the terminal device and the base station.
Based on the above-mentioned problems existing in the prior art, the embodiment of the present application provides an M-sequence generating method, in which the number of iterations is reduced to achieve the purpose of reducing the time delay. The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
Referring to fig. 1, fig. 1 is a flowchart of an M-sequence generating method according to an embodiment of the present application, where the M-sequence generating method may include the following steps:
step S101: determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of times of skipped iterations in the process of generating the M sequence.
Step S102: determining a first target M sequence corresponding to a target matrix according to a first initial M sequence corresponding to the resource data and the target matrix;
Step S103: a first M-sequence is generated from the first target M-sequence.
Specifically, in the cell initially accessed by the terminal device, the base station allocates corresponding resources to the terminal device and sends corresponding resource data to the terminal device. The specific embodiment of the resource data in step S101 is not specifically limited, and those skilled in the art may perform appropriate adjustment according to actual situations. For example, the resource data may include the number of REs occupied by the DMRS in one RB, the BWP start position corresponding to the currently activated BWP, the maximum index of the allocated physical resource block PRB, and so on.
In the embodiment of the application, the DMRS sequence is generated according to the first M sequence and the second M sequence. The first M sequence is an M sequence obtained by performing multiple iterations on the first initial M sequence, and the second M sequence is an M sequence obtained by performing multiple iterations on the second initial M sequence, that is, the first M sequence and the second M sequence are both used for generating the DMRS sequence. However, the first M-sequence is different from the second M-sequence in that the first initial M-sequence is different for different terminal devices and the second initial M-sequence is the same for different terminal devices, and thus the process of determining the first M-sequence and the process of determining the second M-sequence may be different.
First, a procedure for determining the first M sequence is described.
In the prior art, the process of generating the first M-sequence corresponds to a continuous iterative process. For example, assume that an M sequence [ x (0), x (1), …, x (30) of a fixed length (in the embodiment of the present application, the length may be 31) is predetermined] T Then x (31) can be iterated from the M sequences and new M sequences [ x (1), x (2), …, x (31)] T The method comprises the steps of carrying out a first treatment on the surface of the Then, from the new M sequence, x (32) can be iterated, and new M sequences [ x (2), x (3), …, x (32)] T The method comprises the steps of carrying out a first treatment on the surface of the … …; and so on, through continuous iteration, the target can be finally obtainedM sequence.
Based on the above procedure for generating sequences, the inventors found that the following principle exists: given a length 31M sequence [ x (0), x (1), …, x (30)] T It was found that there is a transformation matrix a such that the above M-sequence satisfies the following formula:
[x(1),x(2),…,x(31)] T ＝A[x(0),x(1),…,x(30)] T 。
more generally, for any integer N and M, the following formula is found to exist:
[x(N+M),x(N+M+1),…,x(N+M+30)] T ＝A N [x(M),x(M+1),…,x(M+30)] T 。
thus, based on the above analysis, if a certain M-sequence needs to be calculated quickly, some transformation matrices may be stored in advance:
wherein N is 1 ,N 2 ,…,N K Is the number of iterations that can be skipped. That is, in the M sequence [ x (0), x (1), …, x (30) ] T Is multiplied byCan indicate that N is skipped 1 Iterating for several times to obtain new M sequence [ x (N) 1 ),x(N 1 +1),…,x(N 1 +30)] T 。
Thus, when a corresponding number of iterations need to be skipped quickly, a pre-stored transformation matrix may be used without requiring repeated iterations.
In the step S101, the conversion matrix is a set of fixed matrices stored in the terminal device in advance, and used for skipping to generate part or all of the iteration times in the first M-sequence. Each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of times of skipped iterations in the process of generating the M sequence.
Before the M-sequence generating method provided by the embodiment of the present application is executed, a plurality of conversion matrices and matrix numbers corresponding to each conversion matrix may be determined first, and then the determined plurality of conversion matrices are stored in the terminal device. The specific embodiment of the numerical value of the matrix number in the embodiment of the present application is not specifically limited, and those skilled in the art may perform appropriate adjustment according to actual situations.
For example, assuming that the BWP starting position is 2199RB at maximum and that at most 6 REs in each RB can be occupied by DMRS, the maximum number of iterations is:
2×(2199+1)×6+1600＝28000；
Where 2 represents generating one RE every two sequence values, (2199+1) represents the maximum number of RBs, 6 represents that up to 6 REs in each RB can be occupied by DMRS, and 1600 represents the number of iterations required when the BWP starting position is 0 RB.
Thus, the matrix number can be determined as follows:
1600,4000,6400,8800,11200,13600,16000,18400,20800,23200,25600,28000。
that is, the transformation matrix corresponding to matrix number 1600 may cause the first initial M-sequence to skip 1600 iterations; the transformation matrix corresponding to the matrix number 4000 can enable the first initial M sequence to skip 4000 iterations; … …; by analogy, the conversion matrix corresponding to matrix number 28000 may cause the first initial M sequence to skip 28000 iterations.
It will be appreciated that there are two situations: in the first case, when the iteration number between the first M sequence and the first initial M sequence is exactly equal to any one of the matrix numbers, the first M sequence can be directly obtained based on the conversion matrix corresponding to the matrix number and the first initial M sequence; in the second case, when the number of iterations between the first M-sequence and the first initial M-sequence is not equal to any one of the matrix numbers, the first M-sequence cannot be directly obtained based on the conversion matrix and the first initial M-sequence.
For the first case, the target matrix may be determined from the multiple conversion matrices according to the resource data sent by the base station, and the first M sequence may be determined according to the first initial M sequence sent by the base station and the target matrix. For example, assuming that the determined target matrix is a transformation matrix with a matrix number of 1600, the first M-sequence may be directly determined according to the first initial M-sequence and the target matrix; wherein, in the prior art, the first M sequence may be obtained by iterating 1600 times through the first initial M sequence.
In the above process, the process from the first initial M-sequence to the first M-sequence is changed from a plurality of iterations in the prior art to one matrix multiplication, thus reducing the time for generating the first M-sequence.
For the second case, a target matrix may be determined from the multiple conversion matrices according to the resource data sent by the base station, and a first target M sequence corresponding to the target matrix may be determined according to the first initial M sequence sent by the base station and the target matrix; and then, iteratively determining a first M sequence according to the first target M sequence.
For example, assuming that the determined target matrix is a transformation matrix with a matrix number of 1600, a first target M-sequence may be determined according to the first initial M-sequence and the target matrix, and then iterated 200 times on the basis of the first target M-sequence, so as to obtain a first M-sequence; wherein, in the prior art, the first M sequence can be obtained by iterating 1800 times through the first initial M sequence.
It can be seen that the first target M sequence is an intermediate sequence in the process of calculating the first M sequence based on the first initial M sequence, which is also used for generating the DMRS sequence. In the above process, the process from the first initial M-sequence to the first M-sequence is changed from multiple iterations in the prior art to one matrix multiplication and a small number of iterations, thus also reducing the time for generating the first M-sequence.
In the step S103, after the first target M sequence is obtained, a first M sequence may be generated according to the first target M sequence.
In the above scheme, in generating the first M-sequence based on the first initial M-sequence, the target matrix may be determined from a plurality of transformation matrices based on the resource data. The matrix number corresponding to the target matrix represents the number of iterations that can be skipped in the process of generating the first M sequence, so that the number of iterations from the first initial M sequence to the first target M sequence can be skipped according to the target matrix, and the number of iterations from the first initial M sequence to the first M sequence is reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, based on the above embodiment, the resource data includes the number of resource units and the start position of the bandwidth segment corresponding to the currently activated bandwidth segment, where the number of resource units is the number of resource units occupied by the demodulation reference signal sequence in one resource block.
In the above scheme, after the terminal device accesses the cell, the base station may allocate the number of resource units and the bandwidth segment start position corresponding to the currently activated bandwidth segment to the terminal device according to the actual situation, so that based on different numbers of resource units and bandwidth segment start positions, different conversion matrices may be determined, so that the number of iterations from the first initial M sequence to the first target M sequence may be skipped according to the conversion matrices, and further the number of iterations from the first initial M sequence to the first M sequence may be reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, on the basis of the above embodiment, there are various embodiments of the step S101, and one embodiment of the present application will be described in detail, where in this embodiment, the step S101 may include the following steps:
and 1) calculating the iteration times according to the number of the resource units and the starting position of the bandwidth segment.
And 2) determining a target matrix from the plurality of conversion matrixes according to the iteration times and matrix numbers corresponding to the conversion matrixes.
Specifically, as an embodiment, the number of iterations calculated in step 1) may be the total number of iterations in the process of generating the first M sequence. The total number of iterations can be calculated according to the following formula:
P＝2*L*numDMRSREPerPRB+1600；
Wherein, P is the total number of iterations, 2 represents that one RE is generated for every two sequence values, L is the BWP starting position (i.e. the total number of RBs), and numdmrsrperbb is the number of REs occupied by the DMRS sequence in one RB.
And comparing the total iteration times with matrix numbers corresponding to the plurality of conversion matrixes, and determining the conversion matrix corresponding to the maximum value of the total iteration times in the plurality of matrix numbers as a target matrix. For example, assume that matrix numbers corresponding to a plurality of conversion matrices include: 1600,4000,6400,8800,11200,13600,16000,18400,20800,23200,25600,28000, if the calculated total number of iterations is 14000, the maximum value of the total number of iterations in the plurality of matrix numbers is 13600, and the conversion matrix corresponding to the matrix number 13600 is the target matrix.
As another embodiment, the number of iterations calculated in step 1) above may be a partial number of iterations in the process of generating the first M-sequence. The partial iteration number can be calculated according to the following formula:
P＝2*L*numDMRSREPerPRB；
wherein, P is the total number of iterations, 2 represents that one RE is generated for every two sequence values, L is the BWP starting position (i.e. the total number of RBs), and numdmrsrperbb is the number of REs occupied by the DMRS sequence in one RB.
And comparing the partial iteration times with matrix numbers corresponding to the plurality of conversion matrixes, and determining the conversion matrix corresponding to the minimum value of the partial iteration times in the plurality of matrix numbers as a target matrix, wherein the maximum value of the difference between the matrix numbers corresponding to two adjacent conversion matrixes is 1600.
Similar to the above embodiment, for example, it is assumed that matrix numbers corresponding to a plurality of conversion matrices include: 0,1600,3200,4800,6400,8000,9600,11200,12800,14400,16000,17600,19200,20800,22400,24000,25600,27200,28000, if the calculated number of partial iterations is 14000, the minimum value of the number of partial iterations equal to or greater than the number of partial iterations in the plurality of matrix numbers is 14400, and the conversion matrix corresponding to the matrix number 14400 is the target matrix.
After determining the target matrix based on one of the two embodiments, the first initial M-sequence [ x 2 (0),x 2 (1),…,x 2 (30)] T Target matrix a M The following matrix and vector multiplication may be performed to obtain a first target M-sequence:
[x 2 (M),x 2 (M+1),…,x 2 (M+30)] T ＝A M [x 2 (0),x 2 (1),…,x 2 (30)] T 。
in the above scheme, based on different numbers of resource units and bandwidth segment starting positions, different iteration times can be determined, and based on the iteration times, the most suitable target matrix can be determined from a plurality of conversion matrices, so that the iteration times in the generated M sequence are reduced as much as possible. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, on the basis of the above embodiment, the step S103 may specifically include the following steps:
and 1) determining the number of the residual resource blocks according to the starting position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the number of the residual iterations according to the number of the residual resource blocks.
And 2) iterating the residual iteration times of the first target M sequence to obtain a first M sequence corresponding to the initial position of the bandwidth segment, wherein the first M sequence is used for generating a demodulation reference signal.
Specifically, the remaining RB number may be calculated according to the following formula:
deltaRB＝L-(M-1600)/(2*numDMRSEPerPRB)；
wherein deltaRB is the number of remaining RBs, and M is the matrix number corresponding to the target matrix.
Then, according to the above-mentioned remaining RB number, the remaining iteration number may be calculated according to the following formula:
P′＝2*deltaRB*numDMRSREPerPRB；
wherein P' is the number of remaining iterations.
Then based on the first objectM sequence of the tag [ x ] 2 (M),x 2 (M+1),…,x 2 (M+30)] T The iteration residual iteration times P' can obtain a first M sequence [ x ] 2 (M+P′),x 2 (M+P′+1),…,x 2 (M+P′+30)] T 。
In the above scheme, after the first initial M-sequence is changed to the first target M-sequence according to the target matrix, the first target M-sequence needs to be changed to the first M-sequence through iteration. The remaining iteration number may be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix, and the number of resource units. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
Further, on the basis of the foregoing embodiment, the step of determining the number of remaining resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units may specifically include the following steps:
and 1) calculating the number of the iterated resource blocks according to the matrix number corresponding to the target matrix and the number of the resource units.
And 2) determining the difference value between the starting position of the bandwidth segment and the number of the iterated resource blocks as the number of the residual resource blocks.
In the above scheme, the number of remaining resource blocks can be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix and the number of resource units, so as to determine the number of remaining iterations. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
Further, on the basis of the above embodiment, a procedure for determining the second M sequence is described below. As an implementation manner, the M-sequence generating method provided in the embodiment of the present application further includes the following steps:
step 1), a second target M sequence corresponding to a pre-stored matrix number corresponding to a target matrix is obtained.
And 2) iterating the residual iteration times of the second target M sequence to obtain a second M sequence corresponding to the initial position of the bandwidth segment.
Specifically, since the second initial M sequence is the same for different terminal devices, a plurality of M sequences corresponding to a plurality of matrix numbers, respectively, may be calculated and stored in advance.
Similar to determining the first M sequence, there are two cases: in the first case, when the number of iterations between the second M-sequence and the second initial M-sequence is exactly equal to any one of the matrix numbers, the second M-sequence can be directly obtained based on the matrix number and a plurality of M-sequences stored in advance; in the second case, when the number of iterations between the second M-sequence and the second initial M-sequence is not equal to any one of the matrix numbers, the second M-sequence cannot be directly obtained based on the matrix number and the M-sequences stored in advance.
For the first case, the target matrix may be determined from the multiple conversion matrices according to the resource data sent by the base station, and the second M sequence may be directly determined according to the matrix number corresponding to the target matrix and the multiple M sequences stored in advance. For example, assuming that the determined target matrix is a transformation matrix with a matrix number of 1600, the second M-sequence may be directly determined according to the matrix number and the M-sequences stored in advance; wherein, in the prior art, the second M sequence may be obtained by iterating 1600 times through the second initial M sequence.
For the second case, a target matrix may be determined from a plurality of conversion matrices according to the resource data sent by the base station, and a second target M sequence may be determined according to a matrix number corresponding to the target matrix and a plurality of M sequences stored in advance; and then, iteratively determining a second M sequence according to the second target M sequence.
For example, assuming that the determined target matrix is a transformation matrix with a matrix number of 1600, a second target M-sequence may be determined according to the matrix number and a plurality of M-sequences stored in advance, and then iterated 200 times on the basis of the second target M-sequence, so as to obtain a second M-sequence; wherein, in the prior art, the second M sequence can be obtained by iterating 1800 times through the second initial M sequence.
In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. The process of generating the second M sequence is similar to the process of generating the first M sequence, the second target M sequence may be determined first, and then the number of iterations may be reduced by iterating from the second target M sequence to the second M sequence.
Further, based on the above examples, another implementation of the procedure for determining the second M-sequence is described below. In this embodiment, the M-sequence generating method further includes the steps of:
And acquiring a second M sequence which is stored in advance and corresponds to the starting position of the bandwidth segment.
Specifically, since the second initial M sequence is the same for different terminal devices, a plurality of M sequences corresponding to different bandwidth segment start positions may be calculated and stored in advance, so that the corresponding second M sequence may be determined directly based on the bandwidth segment start positions.
In the above scheme, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. Since the initial sequence corresponding to the second M sequence is fixed, the second M sequence corresponding to the start position of the bandwidth segment can be directly acquired, thereby reducing the iteration number.
The following describes a DMRS sequence generating method provided in the embodiments of the present application, where the DMRS sequence generating method may include the following steps:
step 1), determining a plurality of conversion matrixes, and determining a matrix number corresponding to each conversion matrix.
And 2) calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment of the currently activated bandwidth segment, and determining a target matrix from a plurality of conversion matrices according to the iteration times and matrix numbers corresponding to the conversion matrices.
And 3) determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix, and acquiring a second target M sequence corresponding to a pre-stored matrix number corresponding to the target matrix.
And 4) determining the number of the residual resource blocks according to the starting position of the bandwidth segment of the currently activated bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks.
And 5) obtaining a first M sequence corresponding to the initial position of the bandwidth segment from the iteration residual iteration times of the first target M sequence, and obtaining a second M sequence corresponding to the initial position of the bandwidth segment from the iteration residual iteration times of the second target M sequence.
And 6) generating a corresponding DMRS sequence according to the first M sequence and the second M sequence.
Referring to fig. 2, fig. 2 is a block diagram of an M-sequence generating device according to an embodiment of the present application, where the M-sequence generating device 200 may include: a first determining module 201, configured to determine a target matrix from a plurality of conversion matrices stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence; a second determining module 202, configured to determine a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix; the generating module 203 is configured to generate a first M sequence according to the first target M sequence.
In the embodiment of the application, in the process of generating the first M sequence based on the first initial M sequence, the target matrix may be determined from a plurality of conversion matrices based on the resource data. The matrix number corresponding to the target matrix represents the number of iterations that can be skipped in the process of generating the first M sequence, so that the number of iterations from the first initial M sequence to the first target M sequence can be skipped according to the target matrix, and the number of iterations from the first initial M sequence to the first M sequence is reduced. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, the first target M sequence is configured to generate a demodulation reference signal, where the resource data includes a number of resource units and a bandwidth segment start position corresponding to a currently activated bandwidth segment, where the number of resource units is a number of resource units occupied by the demodulation reference signal in one resource block.
In this embodiment of the present application, after a terminal device accesses a cell, a base station may allocate, according to an actual situation, the number of resource units and a bandwidth segment start position corresponding to a currently activated bandwidth segment to the terminal device, so that, based on different numbers of resource units and bandwidth segment start positions, different multiple conversion matrices may be determined, so that the number of iterations from a first initial M sequence to a first target M sequence may be skipped according to the conversion matrices, thereby reducing the number of iterations from the first initial M sequence to the first M sequence. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, the first determining module 201 is specifically configured to: calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment; and determining the target matrix from the plurality of conversion matrices according to the iteration times and the matrix numbers corresponding to the conversion matrices.
In the embodiment of the present application, different iteration times may be determined based on different numbers of resource units and starting positions of bandwidth segments, and the most suitable target matrix may be determined from multiple conversion matrices based on the iteration times, so that the number of iterations in generating the M sequence is reduced as much as possible. Since the iteration times in the process of generating the M sequence are reduced, the time delay for generating the M sequence can be reduced.
Further, the generating module 203 is specifically configured to: determining the number of the residual resource blocks according to the initial position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks; and iterating the residual iteration times on the first target M sequence to obtain a first M sequence corresponding to the bandwidth segment starting position, wherein the first M sequence is used for generating the demodulation reference signal.
In this embodiment, after going from the first initial M-sequence to the first target M-sequence according to the target matrix, the first target M-sequence needs to be iterated to the first M-sequence. The remaining iteration number may be determined according to the bandwidth segment starting position, the matrix number corresponding to the target matrix, and the number of resource units. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
Further, the method comprises the steps of, the generating module 203 is further configured to: calculating the number of iterated resource blocks according to the matrix number corresponding to the target matrix and the number of resource units; and determining the difference value between the starting position of the bandwidth segment and the iterated resource block number as the residual resource block number.
In the embodiment of the present application, the number of remaining resource blocks may be determined according to the starting position of the bandwidth segment, the matrix number corresponding to the target matrix, and the number of resource units, so as to determine the number of remaining iterations. Since the iteration number in the process of generating the M sequence is reduced to the remaining iteration number, the time delay for generating the M sequence can be reduced.
Further, the M-sequence generating device 200 further includes: the first acquisition module is used for acquiring a second target M sequence corresponding to a pre-stored matrix number corresponding to the target matrix; and the iteration module is used for iterating the residual iteration times to the second target M sequence to obtain a second M sequence corresponding to the bandwidth segment starting position, and the second M sequence is used for generating the demodulation reference signal.
In the embodiment of the present application, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. The process of generating the second M sequence is similar to the process of generating the first M sequence, the second target M sequence may be determined first, and then the number of iterations may be reduced by iterating from the second target M sequence to the second M sequence.
Further, the M-sequence generating device 200 further includes: and the second acquisition module is used for acquiring a second M sequence which is stored in advance and corresponds to the bandwidth segment starting position, and the second M sequence is used for generating a demodulation reference signal.
In the embodiment of the present application, in order to generate the DMRS sequence, a second M sequence needs to be generated in addition to the first M sequence. Since the initial sequence corresponding to the second M sequence is fixed, the second M sequence corresponding to the start position of the bandwidth segment can be directly acquired, thereby reducing the iteration number.
Referring to fig. 3, fig. 3 is a block diagram of an electronic device according to an embodiment of the present application, where the electronic device 300 includes: at least one processor 301, at least one communication interface 302, at least one memory 303, and at least one communication bus 304. Wherein the communication bus 304 is used for direct connection communication of these components, the communication interface 302 is used for signaling or data communication with other node devices, and the memory 303 stores machine readable instructions executable by the processor 301. When the electronic device 300 is in operation, the processor 301 and the memory 303 communicate via the communication bus 304, and the machine readable instructions when invoked by the processor 301 perform the M-sequence generating method described above.
For example, the processor 301 of the embodiment of the present application may implement the following method by reading a computer program from the memory 303 through the communication bus 304 and executing the computer program: step S101: determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of times of skipped iterations in the process of generating the M sequence. Step S102: and determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix. Step S103: a first M-sequence is generated from the first target M-sequence.
The processor 301 includes one or more, which may be an integrated circuit chip, having signal processing capabilities. The processor 301 may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a micro control unit (Micro Controller Unit, MCU), a network processor (Network Processor, NP), or other conventional processor; but may also be a special purpose processor including a Neural Network Processor (NPU), a graphics processor (Graphics Processing Unit GPU), a digital signal processor (Digital Signal Processor DSP), an application specific integrated circuit (Application Specific Integrated Circuits ASIC), a field programmable gate array (Field Programmable Gate Array FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. Also, when the processor 301 is plural, some of them may be general-purpose processors, and another may be special-purpose processors.
The Memory 303 includes one or more, which may be, but is not limited to, random access Memory (Random Access Memory, RAM), read Only Memory (ROM), programmable Read Only Memory (Programmable Read-Only Memory, PROM), erasable programmable Read Only Memory (Erasable Programmable Read-Only Memory, EPROM), electrically erasable programmable Read Only Memory (Electric Erasable Programmable Read-Only Memory, EEPROM), and the like.
It is to be understood that the configuration shown in fig. 3 is merely illustrative, and that electronic device 300 may also include more or fewer components than those shown in fig. 3, or have a different configuration than that shown in fig. 3. The components shown in fig. 3 may be implemented in hardware, software, or a combination thereof. In this embodiment of the present application, the electronic device 300 may be, but is not limited to, a physical device such as a desktop, a notebook, a smart phone, an intelligent wearable device, a vehicle-mounted device, or a virtual device such as a virtual machine. In addition, the electronic device 300 is not necessarily a single device, and may be a combination of a plurality of devices, for example, a server cluster, or the like.
The present application further provides a computer program product, including a computer program stored on a computer readable storage medium, where the computer program includes computer program instructions, when the computer program instructions are executed by a computer, the computer is capable of executing the steps of the M-sequence generating method in the foregoing embodiment, for example, including: determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence; determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix; and generating a first M sequence according to the first target M sequence.
The present application also provides a computer readable storage medium, where the computer readable storage medium stores computer program instructions, where the computer program instructions, when executed by a computer, cause the computer to perform the M-sequence generating method according to the foregoing method embodiment.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
Further, the units described as separate units may or may not be physically separate, and units displayed as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
Furthermore, functional modules in various embodiments of the present application may be integrated together to form a single portion, or each module may exist alone, or two or more modules may be integrated to form a single portion.
It should be noted that the functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM) random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
The foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application, and various modifications and variations may be suggested to one skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.
Claims (6)
1. An M-sequence generation method, comprising:
determining a target matrix from a plurality of conversion matrixes stored in advance according to resource data sent by a base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence;
determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix;
generating a first M sequence according to the first target M sequence;
the resource data comprises the number of resource units and the initial position of the bandwidth segment corresponding to the currently activated bandwidth segment, wherein the number of the resource units is the number of resource units occupied by demodulation reference signals in one resource block;
the determining a target matrix from a plurality of pre-stored conversion matrices according to the resource data sent by the base station comprises the following steps:
Calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment;
determining the target matrix from the plurality of conversion matrices according to the iteration times and matrix numbers corresponding to the conversion matrices;
the generating a first M sequence according to the first target M sequence includes:
determining the number of the residual resource blocks according to the initial position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks;
and iterating the residual iteration times on the first target M sequence to obtain a first M sequence corresponding to the bandwidth segment starting position, wherein the first M sequence is used for generating the demodulation reference signal.
2. The M-sequence generating method according to claim 1, wherein the determining the remaining number of resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units comprises:
calculating the number of iterated resource blocks according to the matrix number corresponding to the target matrix and the number of resource units;
and determining the difference value between the starting position of the bandwidth segment and the iterated resource block number as the residual resource block number.
3. The M-sequence generating method according to claim 1, wherein after the determining the remaining number of resource blocks according to the bandwidth segment start position, the matrix number corresponding to the target matrix, and the number of resource units, and determining the remaining number of iterations according to the number of resource blocks, the method further comprises:
acquiring a second target M sequence corresponding to a pre-stored matrix number corresponding to the target matrix;
iterating the residual iteration times on the second target M sequence to obtain a second M sequence corresponding to the bandwidth segment starting position, wherein the second M sequence is used for generating the demodulation reference signal;
or alternatively, the first and second heat exchangers may be,
and acquiring a second M sequence which is stored in advance and corresponds to the initial position of the bandwidth segment, wherein the second M sequence is used for generating a demodulation reference signal.
4. An M-sequence generating apparatus, comprising:
the first determining module is used for determining a target matrix from a plurality of conversion matrices stored in advance according to the resource data sent by the base station; each conversion matrix corresponds to a matrix number, and each matrix number corresponds to the number of skipped iterations in the process of generating the M sequence;
the second determining module is used for determining a first target M sequence corresponding to the target matrix according to the first initial M sequence corresponding to the resource data and the target matrix;
The generation module is used for generating a first M sequence according to the first target M sequence;
the resource data comprises the number of resource units and the initial position of the bandwidth segment corresponding to the currently activated bandwidth segment, wherein the number of the resource units is the number of resource units occupied by demodulation reference signals in one resource block;
the first determining module is specifically configured to: calculating iteration times according to the number of the resource units and the initial position of the bandwidth segment; determining the target matrix from the plurality of conversion matrices according to the iteration times and matrix numbers corresponding to the conversion matrices;
the generating module is specifically configured to: determining the number of the residual resource blocks according to the initial position of the bandwidth segment, the matrix number corresponding to the target matrix and the number of the resource units, and determining the residual iteration times according to the number of the residual resource blocks; and iterating the residual iteration times on the first target M sequence to obtain a first M sequence corresponding to the bandwidth segment starting position, wherein the first M sequence is used for generating the demodulation reference signal.
5. An electronic device, comprising: a processor, a memory, and a bus;
The processor and the memory complete communication with each other through the bus;
the memory stores computer program instructions executable by the processor, the processor invoking the computer program instructions to perform the method of any of claims 1-3.
6. A computer readable storage medium storing computer program instructions which, when executed by a computer, cause the computer to perform the method of any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211198131.6A CN115567183B (en) | 2022-09-29 | 2022-09-29 | M sequence generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211198131.6A CN115567183B (en) | 2022-09-29 | 2022-09-29 | M sequence generation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115567183A CN115567183A (en) | 2023-01-03 |
| CN115567183B true CN115567183B (en) | 2023-07-28 |
Family
ID=84743698
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211198131.6A Active CN115567183B (en) | 2022-09-29 | 2022-09-29 | M sequence generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115567183B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111082889A (en) * | 2019-12-03 | 2020-04-28 | 武汉梦芯科技有限公司 | Gold sequence generation method and system |
| CN113595672A (en) * | 2021-07-28 | 2021-11-02 | 重庆重邮汇测电子技术研究院有限公司 | Modular implementation method based on 5G pseudo-random sequence |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103636151B (en) * | 2011-06-30 | 2017-02-15 | Lg电子株式会社 | Method and apparatus for allocating a downlink control channel in a wireless communication system |
| FR3025322B1 (en) * | 2014-08-29 | 2016-09-30 | Commissariat Energie Atomique | METHOD FOR ACQUIRING A GOLD SEQUENCE BY DOUBLE ITERATIVE DECODING |
| CN112306458B (en) * | 2020-11-13 | 2024-03-19 | Oppo广东移动通信有限公司 | Sequence generation method and device, signal receiving/transmitting device and storage medium |
| CN112286494B (en) * | 2020-11-17 | 2024-05-24 | Oppo广东移动通信有限公司 | Pseudo random sequence generation method, generation device and computer readable storage medium |
| CN112579045B (en) * | 2020-12-22 | 2024-08-06 | Oppo广东移动通信有限公司 | Pseudo-random sequence generation method, pseudo-random sequence generation device and storage medium |
| CN114553386B (en) * | 2022-04-24 | 2023-03-10 | 哲库科技(北京)有限公司 | Sequence generation method and device and computer readable storage medium |
-
2022
- 2022-09-29 CN CN202211198131.6A patent/CN115567183B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111082889A (en) * | 2019-12-03 | 2020-04-28 | 武汉梦芯科技有限公司 | Gold sequence generation method and system |
| CN113595672A (en) * | 2021-07-28 | 2021-11-02 | 重庆重邮汇测电子技术研究院有限公司 | Modular implementation method based on 5G pseudo-random sequence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115567183A (en) | 2023-01-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10020913B2 (en) | Polar code encoding method and device | |
| TWI618435B (en) | Uplink detection method and device in non-orthogonal multiple access system | |
| CN110661601B (en) | Positioning reference signal configuration method, network side equipment and terminal equipment | |
| CN108733802B (en) | Identification code generation and analysis method and device, storage medium and electronic equipment | |
| CN109963335A (en) | Communication means and device | |
| JP2023139035A (en) | Signal processing method and device | |
| CN110535613A (en) | Signal processing method, device, equipment and storage medium | |
| CN110351843B (en) | Resource allocation indicating method, resource allocation obtaining method, base station and user terminal | |
| WO2020143907A1 (en) | Client device and network access node for transmitting and receiving a random access preamble | |
| CN108347323B (en) | RS generating and receiving method, terminal and base station | |
| CN108207028B (en) | Data generation method, device and equipment | |
| CN109561041B (en) | Communication sequence construction method, system, equipment and computer storage medium | |
| CN106788861B (en) | Base station and multiple access method | |
| CN111416692A (en) | Configuration method and equipment | |
| CN110536441A (en) | Data scrambling method, apparatus and user equipment | |
| CN110034879B (en) | Method for determining number of transmission resources of channel state information and terminal equipment | |
| CN115567183B (en) | M sequence generation method and device | |
| WO2018006759A1 (en) | Channel access method, apparatus and system, and storage medium | |
| TWI698144B (en) | Resource allocation method, terminal and network side equipment | |
| WO2019096268A1 (en) | Sequence-based signal processing method and signal processing apparatus | |
| CN109511170B (en) | Method for indicating PRB bundling size and user terminal | |
| CN109547149B (en) | Data transmission method, synchronization sequence construction method and device | |
| CN109951275A (en) | Key generation method, device, computer equipment and storage medium | |
| CN110489231B (en) | Transaction information recording method, apparatus and computer readable storage medium | |
| CN112822786A (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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |