阅读说明：本技术 一种基于5g伪随机序列的模块化实现方法 (Modular implementation method based on 5G pseudo-random sequence ) 是由 邓炳光 闵小芳 张治中 何林 杨拯 于 2021-07-28 设计创作，主要内容包括：本发明提供了本发明采用了如下的技术方案：一种基于5G伪随机序列的模块化实现方法,包括以下步骤,S1：根据不同应用所需参考序列长度进行分解；S2：引入12的整数倍的伪随机序列模块；S3：对重新划分后的序列进行伪随机序列模块选择；S4：根据3GPP38.211协议,获取不同应用环境下的m序列；S5：m序列根据对应模块所需序列的长度进行迭代处理,最终得到伪随机序列。本发明基于伪随机序列生成所用到的状态偏移量,重新引入12的整数倍的状态偏移模块,对所需序列进行重新分组,通过确定初始位置RB的伪随机序列,从而获得最终的伪随机序列；保证系统性能。(The invention provides the following technical scheme: a modular implementation method based on 5G pseudo-random sequences comprises the following steps, S1: decomposing according to the length of the reference sequence required by different applications; s2: introducing a pseudo-random sequence module of an integral multiple of 12; s3: performing pseudo-random sequence module selection on the re-divided sequences; s4: acquiring m sequences under different application environments according to a 3GPP38.211 protocol; s5: and the m sequence is subjected to iterative processing according to the length of the sequence required by the corresponding module, and finally the pseudorandom sequence is obtained. The method comprises the steps of generating the used state offset based on a pseudo-random sequence, reintroducing a state offset module of an integral multiple of 12, regrouping the required sequence, and obtaining a final pseudo-random sequence by determining the pseudo-random sequence of an initial position RB; and the system performance is ensured.)

1. A modular implementation method based on 5G pseudo-random sequences is characterized in that: comprises the following steps of (a) carrying out,

s1: introducing a pseudo-random sequence module of an integral multiple of 12;

s2: decomposing according to the length of the reference sequence required by different applications;

s3: performing pseudo-random sequence module selection on the re-divided sequences;

s4: acquiring m sequences under different application environments according to a 3GPP38.211 protocol;

s5: and the m sequence is subjected to iterative processing according to the length of the sequence required by the corresponding module, and finally the pseudorandom sequence is obtained.

2. The modular implementation method based on 5G pseudo-random sequences as claimed in claim 1, wherein: the pseudo-random sequence c (n) in step S1 is composed of the sequence x₁(n) and x₂(n) and rearranging the number of shift iterations.

3. The modular implementation method based on 5G pseudo-random sequences as claimed in claim 1, wherein: in step S2, the sequence length required by different applications is re-divided into a plurality of short sequences.

4. The modular implementation method based on 5G pseudo-random sequences as claimed in claim 1, wherein: after the required sequence lengths are regrouped in step S3, the required modules are determined according to the different sequence modules newly introduced as to the integer multiple of 12, and the most appropriate module is selected for the different sequences and processed.

5. The modular implementation method based on 5G pseudo-random sequences as claimed in claim 1, wherein: in step S4, the Gold pseudo-random sequence is composed of two m-sequences x according to the 3GPP38.211 protocol₁(n) and x₂(n) the corresponding bit addition modulo 2, the two m-sequences are respectively shifted by 31 linear shift registers with feedback; first m-sequence x₁(n) should initialize x₁(0)＝1，x₁(n) ═ 0, n ═ 1,2, 30. Initialization x of the second m-sequence₂(n) is represented byThe value of which depends on the application of the sequence.

6. The modular implementation method based on 5G pseudo-random sequences as claimed in claim 1, wherein: in step S5;

s51: according to the re-division of the required sequence length, after a state offset module required to be used is determined, calculating a pseudo-random sequence of an initial position RB;

s52: after a pseudo-random sequence of a starting position RB is obtained, a state offset module required to be used is judged according to grouping, and then an obtained m sequence x is obtained₁(n) and x₂And (n) carrying out shift iteration of corresponding times, namely stepping by 1RB length in sequence to obtain the pseudorandom sequence generated by each module, thereby obtaining the pseudorandom sequence with the finally required sequence length.

Technical Field

The invention relates to the field of wireless communication, in particular to a modular implementation method based on a 5G pseudo-random sequence.

Background

The pseudo-random sequence is widely applied to the aspects of channel estimation, signal scrambling, frequency hopping and the like in a communication system, the pseudo-random sequence is a determined sequence with certain random characteristics, and an M sequence and a Gold sequence are mainly used in the field of wireless communication; in the 3GPP protocol, the generation of a 5G new air interface pseudo-random sequence is standardized according to different sequence lengths required by different application scenes; in a conventional algorithm, a Gold sequence generation formula has a large state offset, 1600 times of shift iteration are required each time, so that the time consumption for generating a sequence is large, and the overall performance of a system is directly influenced by the time consumption for generating the sequence.

Disclosure of Invention

The invention aims to solve the problem of providing a modular implementation method based on a 5G pseudo-random sequence to ensure the system performance aiming at the defects in the prior art.

In order to achieve the purpose, the invention adopts the following technical scheme: a modular implementation method based on 5G pseudo-random sequences comprises the following steps,

s1: introducing a pseudo-random sequence module of an integral multiple of 12;

s2: decomposing according to the length of the reference sequence required by different applications;

s3: performing pseudo-random sequence module selection on the re-divided sequences;

s4: acquiring m sequences under different application environments according to a 3GPP38.211 protocol;

s5: and the m sequence is subjected to iterative processing according to the length of the sequence required by the corresponding module, and finally the pseudorandom sequence is obtained.

Further, in step S2, the sequence length required by different applications is re-divided into a plurality of short sequences.

Further, the pseudo-random sequence c (n) in step S1 is composed of the sequence x₁(n) and x₂(n) and rearranging the number of shift iterations.

Further, after the required sequence lengths are regrouped in step S3, the required modules are determined according to the newly introduced different sequence modules that are integer multiples of 12, and the most appropriate module is selected for the different sequences and processed.

Further, in step S4, according to the 3GPP38.211 protocol, the Gold pseudo-random sequence consists of two m-sequences x₁(n) and x₂(n) the corresponding bit addition modulo 2, the two m-sequences are respectively shifted by 31 linear shift registers with feedback; first m-sequence x₁(n) should initialize x₁(0)＝1，x₁(n) ═ 0, n ═ 1,2, 30. Initialization x of the second m-sequence₂(n) is represented byThe value of which depends on the application of the sequence.

Further, in step S5;

s51: according to the re-division of the required sequence length, after a state offset module required to be used is determined, calculating a pseudo-random sequence of an initial position RB;

s52: after a pseudo-random sequence of a starting position RB is obtained, a state offset module required to be used is judged according to grouping, and then an obtained m sequence x is obtained₁(n) and x₂And (n) carrying out shift iteration of corresponding times, namely stepping by 1RB length in sequence to obtain the pseudorandom sequence generated by each module, thereby obtaining the pseudorandom sequence with the finally required sequence length.

Compared with the prior art, the invention has the following beneficial effects: the invention generates the used state offset based on the pseudo-random sequence, reintroduces the state offset modules of the integral multiple of 12, including 10 modules of (256/128/64/32/16/8/4/2/1) × 12 and 1600, regroups the required sequences, and obtains the final pseudo-random sequence by determining the pseudo-random sequence of the initial position RB;

1) regrouping and module matching are carried out according to the sequence length of the required reference signal, so that the time for generating the pseudo-random sequence is reduced;

2) the waste of system resources caused by that the iteration 1600 must be shifted each time when the sequence is generated by the conventional algorithm is effectively solved; 3) the sequence generation process is more flexible and easy to implement, and is particularly suitable for different application scenarios.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention.

Drawings

FIG. 1 is a flow chart of a 5G pseudo-random sequence-based modular implementation method of the present invention;

FIG. 2 is a Gold sequence generated using two m-sequences of period 31 in a parallel configuration;

fig. 3 is a specific process of acquiring a pseudo random sequence of the initial position RB.

Detailed Description

In order to make the technical means, the creation characteristics, the achievement purposes and the functions of the invention clearer and easier to understand, the invention is further explained by combining the drawings and the detailed implementation mode:

the invention provides a modular implementation method based on a 5G pseudo-random sequence, which comprises the following steps,

s1: introducing a pseudo-random sequence module of an integral multiple of 12; introducing state offset modules of integral multiple of 12, and supporting 10 modules of (1/2/4/8/16/32/64/128/256) × 12 and 1600;

s2: decomposing according to the length of the reference sequence required by different applications;

s3: performing pseudo-random sequence module selection on the re-divided sequences;

s4: acquiring m sequences under different application environments according to a 3GPP38.211 protocol;

s5: and the m sequence is subjected to iterative processing according to the length of the sequence required by the corresponding module, and finally the pseudorandom sequence is obtained.

The pseudo-random sequence c (n) in step S1 is composed of the sequence x₁(n) and x₂(n) forming, and rearranging the times of the shift iteration, if the sequence is generated according to the traditional algorithm, 1600 times of shift iteration are needed each time, if the sequence is generated according to the traditional algorithm, if the shift iteration is repeated for every timeUnder the condition of needing longer or shorter sequences, the time for generating the sequences is increased, and hardware resources are wasted, so in order to reduce the time for generating the sequences, the times of the shift iteration are rearranged;

generally, the number of bits required by an RB is different, but 12 bits are required by an RB, which can be set according to different adjustment reference multiples of the situation, so under this condition, new state offset modules of integral multiples of 12 are introduced, including (256/128/64/32/16/8/4/2/1) × 12 and 1600, to ensure effective processing of the required sequence length.

In step S2, the sequences are subdivided according to the sequence lengths required by different applications, and are divided into a plurality of short sequences;

when the pseudo-random sequence is used as a reference sequence for different applications, the required length is different, so the number of shift iterations is also different, the maximum number of RBs in the 5G NR is configured to be 275 RBs, and the number of subcarriers of each RB in the frequency domain is 12, so the maximum number of subcarriers which can be processed is 3300, but the RB configuration under different subcarrier intervals is different, and the number of bits required in one RB also differs. For reference signal DMRSs, in DMRS type 1, DMRSs are 6 in 1RB, and each DMRS requires two random sequences, so that one RB requires 12(2 × 6) bits in DMRS type 1;

from the IFFT implementation consideration, the actual number of subcarriers must be less than 2ⁿ＝2¹²4096; considering hardware resources, the processing of the number of subcarriers is less than 275 × 12 to 3300 by default at the time of design; (3) considering from guard bands on two sides of the carrier, 5G requires that the guard band resources are utilized as much as possible, and the size of the guard band is reduced;

so the default maximum number of RBs in the final 5G NR is configured to be 273 and the maximum number of subcarriers that can be handled is 3276; and carrying out repartitioning according to the sequence length required by different applications, and partitioning the sequence into a plurality of short sequences. Assuming that the required sequence length is 50 bits, the data can be decomposed into 32 bits +16 bits +2 bits after being divided again by the added state offset module.

After the required sequence lengths are regrouped in step S3, the required modules are determined according to the reintroduced different sequence modules of the integral multiple of 12, and the most appropriate module is selected for the different sequences for processing;

after the required sequence lengths are regrouped, the matching of the modules is performed according to the reintroduced different sequence modules about the integer multiple of 12, and the most appropriate module is selected for the different sequences to process, according to the assumption of step S2, and the modules used at this time are 32,16 and 2.

In step S4, the Gold pseudo-random sequence is composed of two m-sequences x according to the 3GPP38.211 protocol₁(n) and x₂(n) corresponding bit addition modulo 2, i.e. bitwise exclusive or; two m-sequences are generated by shifting 31 linear shift registers with feedback, and the order of the shift register is 5, as shown in fig. 3, the specific formula is as follows:

x₁(n+31)＝(x₁(n+3)+x₁(n))mod2

x₂(n+31)＝(x₂(n+3)+x₂(n+2)+x₁(n+1)+x₁(n)) mod 2; first m-sequence x₁(n) should initialize x₁(0)＝1，x₁0, (n) 1, 2.., 30, initialization x of the second m-sequence₂(n) is represented byThe value of which depends on the application of the sequence;

for example, for a 5G NR uplink shared channel, if the demodulation reference signal is used, according to the 3GPP38.211 protocol, the sequence generation is obtained according to the following equation:

the pseudo-random sequence is:

c(n)＝(x₁(n+N_C)+x₂(n+N_C))mod2

wherein there is a state offset N in the Gold sequence generation formula_C1600, meaning that each time the pseudorandom sequence is generated, both m-sequences are iterated first1600 times.

In addition, the pseudo-random sequence generator should be initialized to:

where l is the number of OFDM symbols in a slot,is the number of slots in a frame, and in the DRMS-UplinkConfig IE, if the high layer parameters scramblingID0 and scramblingID1 are provided, the PUSCH is scheduled by DCI format 0_ 1;scheduling PUSCH by DCI format 0_0 if higher layer parameter scramblingID0 in DMRS-uplinkcnfig IE is provided, where CRC is scrambled by C-RNTI;except for the exception.

In step S5;

s51: according to the re-division of the required sequence length, after a state offset module required to be used is determined, calculating a pseudo-random sequence of an initial position RB; through the introduction of a state offset module, the sequence generation does not need to be carried out for fixed 1600 iterations, and only the required module needs to be directly called;

s52: after a pseudo-random sequence of a starting position RB is obtained, a state offset module required to be used is judged according to grouping, and then an obtained m sequence x is obtained₁(n) and x₂(n) performing shift iteration for corresponding times, namely stepping for 1RB length in sequence to obtain a pseudo-random sequence generated by each module, thereby obtaining the pseudo-random sequence with the final required sequence lengthA random sequence; when the required length is 50 bits, the called modules 32,16 and 2 respectively complete the iteration with corresponding sizes to obtain corresponding pseudo-random sequences, and the process consumes a period of time, but the time is far less than 1600 times of iteration, so that the sequence generation time is reduced;

at this time, assuming that the initial position is the 10 th RB, the use range of the RB is 10-59 according to the required length of 50 bits. Firstly, determining a pseudo-random sequence of an initial position RB, wherein the specific flow is as shown in FIG. 3, and the steps are as follows:

step 1: storing [256,128,64,32,16,8,4,2,1] in a specified matrix iteration _ group for comparing with a sequence with a required length to judge a required module;

step 2: then constructing a binary matrix result (i) with the length of 9, wherein 1< ═ i < ═ 9, the matrix corresponds to a module required in the specified matrix, and when the corresponding position is 1, the module is used, and when the corresponding position is 0, the module is not used;

and step 3: comparing the position of the initial RB with the values in iteration _ group in turn, thereby determining the value of result (i); then the obtained m-sequence x₁(n) and x₂And (n) carrying out 1600 times of shift iteration to obtain a pseudo-random sequence of the initial position RB.

And finally, stepping according to the length of 1RB to sequentially obtain the sequences of the matching modules 32,16 and 2 so as to obtain a final pseudorandom sequence.

Finally, the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all of them should be covered in the claims of the present invention.