Perception resource configuration method and device, equipment, storage medium and product

Abstract

The invention discloses a perception resource configuration method and device, equipment, a storage medium and a product, and the method comprises the steps: determining a bit initial value of each symbol according to the parameter configuration of symbols and subcarriers in a time-frequency grid indicated in received configuration information; therefore, the first sequence of the symbols and the second sequence of the subcarrier corresponding to each symbol are determined by using the bit initial value, and the position of the sensing resource in the time-frequency grid is configured according to the first sequence and the second sequence, so that the sensing resource can be sparsely and non-uniformly configured on the two-dimensional time-frequency resource grid, the sensing overhead is reduced, and the sensing efficiency is improved. And the situation that the communication function is completely lost in the scene of the high-speed moving target is avoided.

Description

Technical Field

[0001] The present invention relates to the field of communications, and in particular to a perception resource configuration method, device, equipment, storage medium and product. Background Art

[0002] ISAC (Integrated Sensing And Communication) technology aims to fuse communication signals with perception signals, and transmit interawareness fusion signals with the help of existing or future communication systems, so as to simultaneously realize communication functions and perception of information such as channels, environments, and targets within given time-frequency resources. Under the current OFDM (Orthogonal Frequency Division Multiplexing) system, perception signals need to occupy certain time-frequency resources to meet the performance requirements of ranging and speed measurement resolution, signal-to-noise ratio, etc. Therefore, the consumption of time-frequency resources by perception signals will directly affect the information carrying capacity of the communication system.

[0003] In the prior art, various reference signals (RS) can be regarded as a generalized sensing signal for sensing channel information, and resources are configured in the form of periodic patterns on a two-dimensional time-frequency resource grid, and single channel information acquisition or delay information acquisition is completed within a few symbols at most by using frequency domain comb teeth, time domain comb teeth or a combination of the two. Considering the accuracy requirements for target motion speed measurement in ISAC application scenarios, a single measurement usually requires the sensing signal to occupy dozens or hundreds of OFDM symbols. At this time, if a form similar to the RS configuration method in the prior art is adopted to set a time-frequency domain comb tooth period that meets the requirements of no speed ambiguity and no distance ambiguity according to a given speed measurement and distance measurement interval, the device will suffer a large communication performance loss when performing perception measurement, and the perception overhead is large, and may even cause the complete loss of communication function during the perception measurement in some scenarios with high-speed moving targets. Summary of the invention

[0004] The purpose of the embodiments of the present invention is to provide a perception resource configuration method, apparatus, device, storage medium and product, which sparsely and unevenly configure perception resources on a two-dimensional time-frequency resource grid, reduce perception overhead, and avoid complete loss of communication function in scenarios with high-speed moving targets.

[0005] To achieve the above object, an embodiment of the present invention provides a method for configuring sensing resources, including:

[0006] receiving configuration information, where the configuration information is used to indicate parameter configuration of symbols and subcarriers;

[0007] Determine an initial bit value of each symbol according to the configuration information;

[0008] Determine, according to the configuration information and the bit initial value, a first sequence and a second sequence of the subcarriers corresponding to each symbol;

[0009] A time-frequency position of a sensing resource is determined according to the first sequence and the second sequence.

[0010] As an improvement of the above solution, the configuration information includes at least one of the following information:

[0011] First information;

[0012] Second information:

[0013] The total number of first symbols in each time slot;

[0014] The number of time slots in each radio frame.

[0015] As an improvement of the above solution, the first information includes relevant information of a first number for indicating a time slot where a start symbol is located, and relevant information of a second number for indicating the start symbol in the time slot; and determining the initial bit value of each symbol according to the configuration information includes:

[0016] An initial bit value of each symbol is determined using the first number, the second number and the first total number of symbols.

[0017] As an improvement of the above solution, the second information includes relevant information for indicating the total number of the second symbols and relevant information for indicating the minimum number of symbols; and determining the first sequence of symbols according to the configuration information and the bit initial value includes:

[0018] Determine a first number of iterations according to the second total number of symbols and the minimum number of symbols;

[0019] Determine a first bit initial value of a first m-sequence according to the second total number of symbols and the bit initial value, so as to obtain a first m-sequence according to the first bit initial value;

[0020] Using the first m-sequence to update the first intermediate sequence until the first iteration number is 0, and then filling the updated first intermediate sequence into the first sequence;

[0021] The remaining filling positions of the first sequence are filled to obtain a first sequence.

[0022] As an improvement of the above solution, determining the first bit initial value of the first m-sequence according to the second total number of symbols and the bit initial value includes:

[0023] Obtaining a first polynomial order according to the second total number of symbols;

[0024] When the order of the first polynomial is equal to a first fixed value, performing a remainder calculation on the initial bit value to obtain the first initial bit value;

[0025] When the order of the first polynomial is greater than a first fixed value, a primitive polynomial corresponding to the bit initial value is obtained, and a bit hash value is determined using the primitive polynomial according to a cyclic redundancy check method to obtain the first bit initial value according to the bit hash value.

[0026] As an improvement of the above solution, filling the remaining filling positions of the first sequence includes:

[0027] determining a remaining length of the first sequence according to the length of the first intermediate sequence;

[0028] When the remaining length is greater than 0, a first intermediate sequence is regenerated, and the regenerated first intermediate sequence is updated by using the first m-sequence until the corresponding first iteration number is 0, and the updated first intermediate sequence is continuously filled into the first sequence until the remaining length is 0;

[0029] When the remaining length is 0, a specified value is padded at the end of the first sequence.

[0030] As an improvement of the above solution, determining the second sequence of the subcarrier corresponding to each symbol according to the configuration information and the bit initial value includes:

[0031] Determine a second iteration number according to the total number of subcarriers and the minimum number of subcarriers;

[0032] Determine a second initial bit value of a second m-sequence according to the total number of subcarriers and the initial bit value, so as to obtain a second m-sequence according to the second initial bit value;

[0033] Using the second m-sequence to update the second intermediate sequence until the second iteration number is 0, and then filling the updated second intermediate sequence into the second sequence;

[0034] The remaining filling positions of the second sequence are filled to obtain a second sequence.

[0035] As an improvement of the above solution, the second information includes relevant information for indicating the total number of subcarriers and relevant information for indicating the minimum number of subcarriers; and determining the second initial bit value of the second m-sequence according to the total number of subcarriers and the initial bit value includes:

[0036] Obtaining a second polynomial order according to the total number of subcarriers;

[0037] When the second polynomial order is equal to a second fixed value, performing a remainder calculation on the bit initial value to obtain the second bit initial value;

[0038] When the order of the second polynomial is greater than a second fixed value, a primitive polynomial corresponding to the bit initial value is obtained, and a bit hash value is determined using the primitive polynomial according to a cyclic redundancy check method to obtain the second bit initial value according to the bit hash value.

[0039] As an improvement of the above solution, filling the remaining filling positions of the second sequence includes:

[0040] determining a remaining length of the second sequence according to the length of the second intermediate sequence;

[0041] When the remaining length is greater than 0, a second intermediate sequence is regenerated, and the regenerated second intermediate sequence is updated by using the second m-sequence, until the corresponding second iteration number is 0, and the updated second intermediate sequence is continuously filled into the second sequence until the remaining length is 0;

[0042] When the remaining length is 0, a specified value is padded at the end of the second sequence.

[0043] As an improvement of the above solution, determining the time-frequency position of the sensing resource according to the first sequence and the second sequence includes:

[0044] constructing a two-dimensional coordinate set associated with the symbol and the subcarrier;

[0045] For each coordinate in the two-dimensional coordinate set, construct a Boolean function using the first sequence and the second sequence;

[0046] The target coordinates when the Boolean function is true are obtained, and the resources corresponding to the target coordinates are added to the perception resource set.

[0047] To achieve the above purpose, an embodiment of the present invention further provides a sensing resource configuration device, including:

[0048] A configuration information receiving module, used to receive configuration information, where the configuration information is used to indicate parameter configuration of symbols and subcarriers;

[0049] A bit initial value determination module, used to determine the bit initial value of each symbol according to the configuration information;

[0050] A first sequence determination module, configured to determine a first sequence according to the configuration information and the bit initial value;

[0051] A second sequence determination module, configured to determine a second sequence of the subcarrier corresponding to each symbol according to the configuration information and the bit initial value;

[0052] A perception resource configuration module is used to determine the time-frequency position of the perception resource according to the first sequence and the second sequence.

[0053] To achieve the above objectives, an embodiment of the present invention also provides a perception resource configuration device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, it implements the perception resource configuration method as described in any of the above embodiments.

[0054] To achieve the above objectives, an embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium includes a stored computer program, wherein when the computer program is running, the device where the computer-readable storage medium is located is controlled to execute the perception resource configuration method as described in any of the above embodiments.

[0055] To achieve the above objectives, an embodiment of the present invention further provides a computer program product, including computer instructions, which, when executed by a processor, implement the perception resource configuration method as described in any of the above embodiments.

[0056] Compared with the prior art, the perception resource configuration method, device, equipment, storage medium and product disclosed in the present invention configure perception resources sparsely and non-uniformly on a two-dimensional time-frequency resource grid, reduce perception overhead, and avoid the situation where communication function is completely lost in the scenario of high-speed moving targets. In addition, the present invention, on the one hand, utilizes sparsity to greatly reduce perception resource consumption and reduce the loss of communication capability during perception measurement, and on the other hand, utilizes the suppression effect of non-uniform sampling on fuzzy peaks that exceed the Nyquist sampling frequency, thereby increasing the unambiguous range of speed or distance measurement and improving perception accuracy. BRIEF DESCRIPTION OF THE DRAWINGS

[0057] Figure 1 is a schematic diagram of a two-dimensional time-frequency grid provided by an embodiment of the present invention;

[0058] Figure 2 is a flow chart of a method for configuring sensing resources provided by an embodiment of the present invention;

[0059] Figure 3 is a flowchart of generating a first sequence provided by an embodiment of the present invention;

[0060] Figure 4 is a flowchart of generating a second sequence provided by an embodiment of the present invention;

[0061] Figure 5is an example diagram of a two-dimensional time-frequency grid provided by an embodiment of the present invention;

[0062] Figure 6 is a schematic diagram of performing the first filling of the first sequence provided by an embodiment of the present invention;

[0063] Figure 7 is a schematic diagram of performing a second filling on a first sequence provided by an embodiment of the present invention;

[0064] Figure 8 is a schematic diagram of performing the first filling of the second sequence provided by an embodiment of the present invention;

[0065] Fig. 9 is a schematic diagram of performing a second filling on a second sequence provided by an embodiment of the present invention;

[0066] Fig.10 This is a first visualization schematic diagram of resource configuration results provided by an embodiment of the present invention;

[0067] Fig.11 is a second visualization schematic diagram of the resource configuration result provided by an embodiment of the present invention;

[0068] Fig.12 is a structural block diagram of a sensing resource configuration device provided by an embodiment of the present invention;

[0069] Fig.13 It is a structural block diagram of a perception resource configuration device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0070] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0071] In order to solve the problem of large perception overhead caused by periodic configuration of perception signals under the requirements of unambiguous distance and unambiguous speed, the present invention discloses a perception resource configuration method, in which a mapping mode of perception symbols to RE (Resource Element) grids that meet the minimum sparsity requirements is generated according to the configured minimum sparsity within the configured subcarrier-symbol grid (RE grid), so that within the configured available subcarrier interval or OFDM symbol interval, the number of subcarriers or symbols occupied by the perception signal is fixed. Figure 1 As shown, the sensing resource configuration method of the present invention determines the resources (RE) occupied by the sensing signal on a two-dimensional time-frequency grid with N subcarriers and M OFDM symbols.

[0072] It is worth noting that the resource configuration method described in the embodiment of the present invention generates a binary pseudo-random sequence based on an m-sequence, and the m-sequence satisfies the following three Golomb pseudo-random postulates:

[0073] 1. In one cycle of the sequence, the number of 0s and 1s differs by at most 1;

[0074] 2. In a cycle of the sequence, the number of runs with length i accounts for the total number of runs. And in runs of equal length, the number of runs of 0 is equal to the number of runs of 1;

[0075] 3. The out-of-phase autocorrelation function is a constant.

[0076] Based on the above three constraints, the resource configuration method described in the embodiment of the present invention ensures that the sensing resource configuration generated based on the m-sequence has pseudo-randomness, a controllable number of REs and a controllable signal-to-noise ratio.

[0077] It is worth noting that the embodiment of the present invention includes 6 sensing modes:

[0078] 1) The base station sends and receives independently, that is, base station A sends and base station A receives;

[0079] 2) Base station A sends and base station B receives;

[0080] 3) Base station sends and terminal receives;

[0081] 4) The terminal sends and the base station receives;

[0082] 5) The terminal sends and receives data by itself;

[0083] 6) Terminal A sends and terminal B receives.

[0084] See also Figure 2 , Figure 2 : is a flow chart of a method for configuring a sensing resource provided by an embodiment of the present invention, the method for configuring a sensing resource comprising:

[0085] S1. Receive configuration information, where the configuration information is used to indicate information related to parameter configuration of symbols and subcarriers;

[0086] S2. Determine the initial bit value of each symbol according to the configuration information;

[0087] S3. Determine a first sequence and a second sequence of the subcarriers corresponding to each symbol according to the configuration information and the bit initial value;

[0088] S4. Determine a time-frequency position of a perception resource according to the first sequence and the second sequence.

[0089] It is worth noting that the sensing resource configuration method described in the embodiment of the present invention is implemented by a second device, the second device is used to receive the configuration information sent by the first device, and the second device determines the RE position occupied by the sensing signal in the time-frequency grid according to the configuration information and its default value (such as the base station ID). The first device and the second device can be one of a network, a base station, and a terminal.

[0090] Specifically, in step S1, the configuration information includes at least one of the following information:

[0091] ① First information; wherein the first information includes a first number for indicating the time slot where the time-frequency grid starts , and related information for indicating a second number l0 of the start symbol in the time slot;

[0092] Exemplarily, the symbol may be an OFDM symbol;

[0093] ② Second information; wherein the second information includes relevant information for indicating the total number of subcarriers N and the second total number of symbols M in the time-frequency grid, and the minimum number of symbols K for indicating the symbols occupied by the perception signal sym and the minimum number of subcarriers K sc relevant information;

[0094] ③The total number of first symbols in each time slot

[0095] ④Number of time slots in each wireless frame

[0096] Specifically, in step S2, determining the bit initial value of each symbol according to the configuration information includes: using the first number The second number l0 and the total number of the first symbols Determine the initial bit value c of each symbol ini_i .

[0097] Exemplarily, the bit initial value c ini_i is a 31-bit initial value, and the calculation process satisfies the following formula:

[0098]

[0099] in, and l i are the number of the i-th symbol in the grid in the time slot and the number of the time slot in the wireless frame, which can be obtained by And l0 to get; n id is the base station ID. Finally, we get M initial values ​​{c ini_i},i=0,1,2,…M-1.

[0100] Specifically, in step S3, see Figure 3 , Figure 3 is a flowchart of generating a first sequence provided by an embodiment of the present invention, wherein determining the first sequence according to the configuration information and the bit initial value includes:

[0101] S11, determining a first number of iterations according to the second total number of symbols and the minimum number of symbols;

[0102] S12, determining a first bit initial value of a first m-sequence according to the second total number of symbols and the bit initial value, so as to obtain a first m-sequence according to the first bit initial value;

[0103] S13, using the first m-sequence to update the first intermediate sequence until the first iteration number is 0, and then filling the updated first intermediate sequence into the first sequence;

[0104] S14. Fill the remaining filling positions of the first sequence to obtain a first sequence.

[0105] Specifically, in step S11, the first iteration number N is determined according to the second total number of symbols and the minimum number of symbols. itr1 , satisfying the following formula:

[0106]

[0107] in, Indicates rounding up.

[0108] Specifically, in step S12, the determining of the first bit initial value of the first m-sequence according to the second total number of symbols and the bit initial value includes: obtaining a first polynomial order according to the second total number of symbols; when the first polynomial order is equal to a first fixed value, performing a remainder calculation on the bit initial value to obtain the first bit initial value; when the first polynomial order is greater than the first fixed value, obtaining a primitive polynomial corresponding to the bit initial value, and using the primitive polynomial to determine a bit hash value according to a cyclic redundancy check method, so as to obtain the first bit initial value according to the bit hash value.

[0109] Exemplarily, first construct a symbol selection sequence containing only one 1, that is, the first sequence SEQ sym Then, based on the total number of second symbols M configured in step S1, the initial length L1 of the first sequence is determined to be M-2, and the symbol index k is determined to be 1. The minimum sparsity S of the symbol is determined according to the following formula: symMin :

[0110]

[0111] If L1≠0, the order n1 of the first polynomial is determined according to the following formula:

[0112]

[0113] in, Indicates rounding down.

[0114] If n1<2, to the first sequence SEQ sym Fill L1 zeros inside, set L1 = 0;

[0115] If n1=2, according to the bit initial value c ini_k (Here the subscript k is the symbol index), the first bit initial value m of the first m sequence is determined by combining the following formula ini_1 , where the first bit initial value is m ini_1 is the n-bit initial value, where n should be equal to n1, n1 is the order of the primitive polynomial corresponding to the first m-sequence, and the order n1-1 of the primitive polynomial used to generate the initial value can be determined. The first bit initial value m ini_1 Satisfies the following formula:

[0116] m ini_1 =2mod(c ini_k ,2)+1 (5)

[0117] If n1>2, the initial value of the bit c ini_k As input, select the n1-1 order primitive polynomial in the table, and determine the n1-1 bit hash value hash according to the cyclic redundancy check (CRC) method crc_1 ;

[0118] Table 1 Commonly used primitive polynomials

[0119]

[0120] After getting the n1-1 bit hash value hash crc_1 After that, in hash crc_1 Add 1 bit to the low bit to get the initial value of the first bit m ini_1 , such as using the following formula to determine the first bit initial value m of the first m sequence ini_1 :

[0121] m ini_1 =2hash crc_1 +1 (6).

[0122] It should be noted that, in each filling process (steps S13 to S14 below), two primitive polynomials with an order difference of 1 in Table 1 need to be selected, which are used for the first m-sequence generation and CRC check process respectively. The CRC check result is supplemented with 1 bit and is also used for the generation of the first m-sequence. Therefore, the polynomial order in each filling process is different, and the number of bits of the initial value is also different.

[0123] Specifically, in step S13, the first intermediate sequence is updated by using the first m-sequence until the first iteration number is 0, and then the updated first intermediate sequence is filled into the first sequence.

[0124] Exemplarily, according to the first bit initial value m given in step S12 ini_1 The primitive polynomial in Table 1 can determine the linear feedback shift register and its initial value, thereby generating a length of L n1 =2 n1 -1's first m sequence SEQ m1 It should be noted that the m-sequence is called the longest linear feedback shift register sequence. The linear feedback shift register structure can be determined according to the primitive polynomial coefficients. Here, the initial state of each register can be filled with a given n-bit initial value. Finally, the structure is run to output the required sequence. In the specific implementation process, the m-sequence can be generated by hardware or an equivalent algorithm.

[0125] Construct the first intermediate sequence SEQ Ln1 , such as the initialization length is L n1 The all-1 sequence SEQ Ln1 ;

[0126] Update the first intermediate sequence SEQ using the following formula Ln1 and the first m sequence SEQ m1 :

[0127] SEQ Ln1 =SEQ Ln1 AND SEQ m1 (7);

[0128] SEQ m1 =CircShife(SEQ m1 ) (8);

[0129] Among them, AND represents the bitwise AND operation; CircShift(·) represents circularly shifting the input sequence left by 1 bit.

[0130] Update the first iteration number N according to the following formula itr1 :

[0131] N itr1 =N itr1 -1 (9);

[0132] If N itr1 >0, then continue to update the first intermediate sequence SEQ Ln1 and the first m sequence SEQ m1 ; if N itr1 = 0, the first intermediate sequence SEQ is updated Ln1 Fill to the first sequence SEQ sym middle.

[0133] Specifically, in step S14, the filling of the remaining filling position of the first sequence includes: determining the remaining length of the first sequence according to the length of the first intermediate sequence; when the remaining length is greater than 0, regenerating a first intermediate sequence, and updating the regenerated first intermediate sequence by using the first m-sequence until the corresponding first iteration number is 0, and continuing to fill the updated first intermediate sequence into the first sequence until the remaining length is 0; when the remaining length is 0, filling a specified value at the end of the first sequence.

[0134] Exemplarily, the remaining length L of the sequence to be filled is updated using the following formula: 11 :

[0135] L 11 =L1-L n1 (10);

[0136] Use the formula k=k+L n1 Update the starting position k of the sequence to be filled, that is, update the symbol index value, and continue to update the symbol of the sequence to be filled;

[0137] If L 11 >0, then a first intermediate sequence SEQ is regenerated Ln1 , and use the new first iteration number N itr1 , then re-execute step S12; if L 11 =0, to the first sequence SEQ sym Fill in a 1, thus completing the first sequence SEQ sym Symbol fill.

[0138] Specifically, in step S3, see Figure 4 , Figure 4 is a flowchart of generating a second sequence provided by an embodiment of the present invention, wherein determining the second sequence of the subcarrier corresponding to each symbol according to the configuration information and the bit initial value includes:

[0139] S21. Determine a second iteration number according to the total number of subcarriers and the minimum number of subcarriers;

[0140] S22, determining a second initial bit value of a second m-sequence according to the total number of subcarriers and the initial bit value, so as to obtain a second m-sequence according to the second initial bit value;

[0141] S23, using the second m-sequence to update the second intermediate sequence until the second iteration number is 0, and then filling the updated second intermediate sequence into the second sequence;

[0142] S24. Fill the remaining filling positions of the second sequence to obtain a second sequence.

[0143] Specifically, in step S21, the total number of subcarriers N and the minimum number of subcarriers K sc Determine the second iteration number N itr2 , satisfying the following formula:

[0144]

[0145] Specifically, in step S22, the determining of the second bit initial value of the second m-sequence according to the total number of subcarriers and the bit initial value includes: obtaining a second polynomial order according to the total number of subcarriers; when the second polynomial order is equal to a second fixed value, performing a remainder calculation on the bit initial value to obtain the second bit initial value; when the second polynomial order is greater than the second fixed value, obtaining a primitive polynomial corresponding to the bit initial value, and using the primitive polynomial to determine a bit hash value according to a cyclic redundancy check method, so as to obtain the second bit initial value according to the bit hash value.

[0146] Exemplarily, let i=0; construct a subcarrier gating sequence containing only one 1, that is, the second sequence SEQ i , i=0,1,2,…,M-1, and determining the initial length L2=N-2 of the sequence to be filled based on the total number N of subcarriers;

[0147] If L2≠0, the second polynomial order n2 is determined according to the following formula:

[0148]

[0149] If n2<2, to the second sequence SEQ i Fill L2 zeros inside, set L2 = 0;

[0150] If n2=2, according to the bit initial value c ini_k , use the following formula to determine the second bit initial value of the second m sequence, where the second bit initial value m ini_2The same is true for the n-bit initial value, where n should be equal to n2, n2 is the order of the primitive polynomial corresponding to the second m-sequence, and the order of the primitive polynomial used to generate the initial value can be determined. n2-1, the second bit initial value m ini_2 Satisfies the following formula:

[0151] m ini_2 =2mod(c ini_i ,2)+1 (13);

[0152] If n2>2, the initial value of bit c ini_k As input, select the n2-1 order primitive polynomial in Table 1, and determine the n2-1 bit hash value hash according to the cyclic redundancy check (CRC) method crc_2 ;

[0153] After getting the n2-1 bit hash value hash crc_2 After that, in hash crc_2 Add 1 bit to the lower bit to get the initial value of the second bit m ini_2 , such as using the following formula to determine the second bit initial value m of the second m sequence ini_2 :

[0154] m ini_2 =2hash crc_2 +1 (14).

[0155] It should be noted that, in each filling process (steps S23 to S24 below), two primitive polynomials with an order difference of 1 in Table 1 need to be selected, which are used for the second m-sequence generation and CRC check process respectively. The CRC check result is supplemented with 1 bit and is also used for the generation of the second m-sequence. Therefore, the polynomial order in each filling process is different, and the number of bits of the initial value is also different.

[0156] Specifically, in step S23, the second intermediate sequence is updated by using the second m-sequence until the second iteration number is 0, and then the updated second intermediate sequence is filled into the second sequence.

[0157] Exemplarily, according to the second bit initial value m given in step S22 ini_2 The primitive polynomial in Table 1 can determine the linear feedback shift register and its initial value, thereby generating a length of L n2 =2 n2 -1 second m sequence SEQ m2 It should be noted that the m-sequence is called the longest linear feedback shift register sequence. The linear feedback shift register structure can be determined according to the primitive polynomial coefficients. Here, the initial state of each register can be filled with a given n-bit initial value. Finally, the structure is run to output the required sequence. In the specific implementation process, the m-sequence can be generated by hardware or an equivalent algorithm.

[0158] Construct the second intermediate sequence SEQ Ln2 , such as the initialization length is L n2 The all-1 sequence SEQ Ln2 ;

[0159] Update the second intermediate sequence SEQ using the following formula Ln2 and the second m sequence SEQ m2 :

[0160] SEQ Ln2 =SEQ Ln2 AND SEQ m2 (15);

[0161] SEQ m2 =CircShift(SEQ m2 ) (16);

[0162] Update the second iteration number N using the following formula itr2 :

[0163] N itr2 =N itr2 -1 (17);

[0164] If N itr2 >0, then continue to update the second intermediate sequence SEQ Ln2 and the second m sequence SEQ m2 ; if N itr2 = 0, the second intermediate sequence SEQ is updated Ln2 Fill to the second sequence SEQ i middle.

[0165] Specifically, in step S24, the filling of the remaining filling position of the second sequence includes: determining the remaining length of the second sequence according to the length of the second intermediate sequence; when the remaining length is greater than 0, regenerating a second intermediate sequence, and updating the regenerated second intermediate sequence by using the second m-sequence until the corresponding second iteration number is 0, and continuing to fill the updated second intermediate sequence into the second sequence until the remaining length is 0; when the remaining length is 0, filling a specified value at the end of the second sequence.

[0166] Exemplarily, the remaining length L of the sequence to be filled is updated using the following formula: 21 ;

[0167] L 21 =L2-L n2 (18);

[0168] Use the formula formula i=i+1 to update the symbol index i, that is, update the symbol index value, and continue to update the symbol of the sequence to be filled;

[0169] If L 21 >0, then a second intermediate sequence SEQ is regenerated Ln2 , and use the new second iteration number N itr2 , then re-execute step S22; if L 21 =0, to the second sequence SEQ i Fill in a 1, and the entire second sequence SEQ is completed. i Filling.

[0170] Specifically, in step S5, determining the time-frequency position of the perception resource according to the first sequence and the second sequence includes: constructing a two-dimensional coordinate set related to the symbol and the subcarrier; for each coordinate in the two-dimensional coordinate set, constructing a Boolean function using the first sequence and the second sequence; obtaining the target coordinate when the Boolean function is true, and adding the resource corresponding to the target coordinate to the perception resource set.

[0171] Exemplarily, a two-dimensional coordinate set (x, y) on the time-frequency grid is constructed according to the subcarrier number and the symbol number, and the coordinates and each RE (resource) in the time-frequency grid satisfy a one-to-one mapping relationship, as shown in the following mapping relationship:

[0172] x=0,1,2,…,M-1;

[0173] y=0,1,2,…,N-1;

[0174] For each coordinate on the time-frequency grid, the discrete binary Boolean function f(x,y) is determined according to the following formula:

[0175] f(x,y)=SEQ sym (x)AND SEQ i (y) (19);

[0176] Among them, SEQ sym (x) indicates selecting the first sequence SEQ sym The xth position of SEQ i (y) indicates selecting the second sequence SEQ i The resource RE corresponding to the coordinate (x, y) when f(x, y) takes the value of true is added to the sensing resource set A to obtain the final two-dimensional non-uniform resource configuration result of the sensing signal.

[0177] With respect to the above steps S1 to S5, in order to better illustrate the working principle of the present invention, the following embodiment is provided, including steps 1 to 5:

[0178] See also Figure 5 , Figure 5 is an example diagram of a two-dimensional time-frequency grid provided by an embodiment of the present invention. Consider a Figure 5 The resources (RE) occupied by the perception signal are determined on the two-dimensional time-frequency grid G ​​with 12 subcarriers and 14 symbols (OFDM symbols) as shown in FIG. 1 , and the minimum number of subcarriers K is configured on the time-frequency grid. sc = 5 and the minimum number of symbols K that meets the minimum symbol sparsity requirement sym =5 perception signal.

[0179] Step 1: The second device receives configuration information sent by the first device; the configuration information includes at least one of the following information:

[0180] The first number of the time slot where the first OFDM symbol of the configurable grid G ​​is located

[0181] The second number l0 of the first OFDM symbol of the configurable grid G ​​in the time slot is 0;

[0182] The total number of second symbols of OFDM symbols included in the configurable grid G ​​is M=14;

[0183] The total number of subcarriers included in the configurable grid G ​​is N=12;

[0184] The minimum number of OFDM symbols occupied by the perceived signal K sym =5;

[0185] The minimum number of subcarriers K occupied by the sensing signal sc =5;

[0186] The total number of first symbols in each time slot

[0187] The number of time slots in each radio frame

[0188] The second device determines the remaining parameters according to the default values.

[0189] Step 2: The second device determines the initial bit value, and substitutes the parameters in step 1 into the above formula (1) to obtain the following formula:

[0190]

[0191] Finally, M=14 bit initial values ​​are obtained as shown in Table 2;

[0192] Table 2 Bit initial value example

[0193] Symbol index i <![CDATA[Initial value c imi_i > Symbol index i <![CDATA[Initial value c ini_i > 0 2157592 7 2508824 1 2207768 8 2559000 2 2257944 9 2609176 3 2308120 10 2659352 4 2358296 11 2709528 5 2408472 12 2759704 6 2458648 13 2809880

[0194] Step 3: The second device determines the symbol selection sequence, i.e., the first sequence SEQ sym ; At this time, the above steps S11 to S14 specifically include:

[0195] Step 301: Construct a symbol selection sequence SEQ containing only one 1 sym1 = [1], and based on the number of symbols M determined in step 1, determine the initial length of the sequence to be filled L1 = M-2 = 12, the symbol index k = 1, and determine the minimum symbol sparsity according to the following formula:

[0196]

[0197] Step 302: If L1=0, jump to the subsequent step 309; if L1≠0, generate the first polynomial order n1 according to the above formula (4). Taking the first execution of this step as an example, the formula (4) after inputting the data is as follows:

[0198]

[0199] Step 303: If n1<2, send the first sequence SEQ sym Fill L1 zeros inside, set L1=0 and jump to the subsequent step 309;

[0200] If n1=2, the initial bit value c given in step 2 ini_k , combined with the above formula (5), determine the initial value m of the first bit of the first m sequence ini_1 ;

[0201] If n1>2, the bit initial value c given in step 2 will be used ini_k As input, select the n1-1 order primitive polynomial in Table 1, and determine the n1-1 bit hash value hash according to the cyclic redundancy check (CRC) method crc_1 ; Use the above formula (6) to determine the first bit initial value m of the first m sequence ini_1 ;

[0202] Taking the first execution of this step as an example, the above formula (22) calculates n1=3, which satisfies n1>2, k=1, and c ini_1 =2207768 as input, select the 2nd order primitive polynomial in Table 1, and determine the 2-bit hash value hash according to the cyclic redundancy check (CRC) method crc_1 =0x3, at this time the initial value of the first bit is m ini_1 satisfy:

[0203] m ini_1 =2hash crc_1 +1=0x7 (23);

[0204] Step 304: Based on the first bit initial value m given in step 303 ini_1 and the n1-order primitive polynomial in Table 1, generating a length of L n1 =2 n1 -1's first m sequence SEQ m1 ; Take the first execution of this step as an example, at this time L n1 =7, the first m sequence SEQ m1 =[1,1,1,0,1,0,0];

[0205] Step 305: Based on K determined in step 1 sym and M, determine the first iteration number N according to the above formula (2) itr1 , the initialization length is L b1 The all-1 sequence SEQ Ln1 As the first intermediate sequence; taking the first execution of this step as an example, the formula (2) after inputting the data is as follows:

[0206]

[0207] The corresponding first intermediate sequence SEQ Ln1 =[1,1,1,1,1,1,1];

[0208] Step 306: Update the first intermediate sequence SEQ using the above formulas (7) and (8) Ln1 and the first m sequence SEQ m1 :And update the first iteration number N according to the above formula (9) itr1 , taking the first execution of this step as an example, at this time the first intermediate sequence SEQ Ln1 , the first m sequence SEQ m1 and the first iteration number N itr1 satisfy:

[0209] SEQ Ln1 =[1,1,1,0,1,0,0] (25);

[0210] SEQ m1 =CircShiftLeft([1,1,1,0,1,0,0])=[1,1,0,1,0,0,1] (26);

[0211] N itr1 =2-1=1 (27);

[0212] Step 307: If N itr1 >0, then a first intermediate sequence SEQ of all 1s is regenerated Ln1 , and use the new first iteration number N itr1 , then re-execute step 306; if Nitr1 = 0, the resulting sequence SEQ Ln1 Fill to the first sequence SEQ sym And update the remaining length L of the sequence to be filled according to the above formula (10) 11 ; Take the first execution of this step as an example:

[0213] L 11 =12-7=5 (28);

[0214] After the first execution of filling, the sequence is as follows Figure 6 As shown, Figure 6 It is a schematic diagram of the first filling of the first sequence provided by an embodiment of the present invention; the first digit "1" is obtained by initially constructing the sequence in step 301, and the last 7 digits are obtained through the above steps 302 to 307. At this time, there are still 5 positions left in the first sequence that are not filled.

[0215] Step 308: Use the formula k=k+L n1 Update the starting position k of the sequence to be filled; take the first execution of this step as an example;

[0216] k = 1 + 7 = 8 (29);

[0217] Step 309: If L 11 >0, then return to step 302; if L 11 =0, to the first sequence SEQ sym Fill a 1; take the last time this step is executed as an example, the complete first sequence SEQ is obtained sym as follows:

[0218] SEQ sym =[1,1,1,0,0,0,0,0,0,0,1,0,0,1] (30);

[0219] Exemplarily, the first sequence SEQ sym The second filling process is as follows Figure 7 As shown, Figure 7 It is a schematic diagram of performing a second filling on a first sequence provided by an embodiment of the present invention.

[0220] Step 4: The second device determines a subcarrier gating sequence, namely, a second sequence SEQ i , i = 0, 1, 2, ..., M-1; at this time, the above steps S21 to S24 specifically include:

[0221] Step 401: let i=0;

[0222] Step 402: Construct a subcarrier gating sequence containing only one 1, namely, the second sequence SEQ i, and determine the initial length of the sequence to be filled L2=N-2 based on the total number of subcarriers N determined in step 1; taking the first execution of this step when i=0 as an example, at this time, SEQ0=[1], L2=12-2=10;

[0223] Step 403: If L2=0, jump to step 409; if L2≠0, determine the second polynomial order n2 according to the above formula (12). Take the first execution of this step when i=0 as an example. At this time, the formula (12) after inputting the data satisfies:

[0224]

[0225] Step 404: If n2<2, send the first sequence SEQ i Fill L2 zeros inside, set L2=0 and jump to step 409;

[0226] If n2=2, the second initial bit value m of the second m-sequence is determined using the above formula (13): ini_2 ;

[0227] If n2>2, the initial value of bit c ini_i As input, select the n1-1 order primitive polynomial in Table 1, and determine the n1-1 bit hash value according to the cyclic redundancy check (CRC) method; use the above formula (14) to determine the second bit initial value m of the second m sequence ini_2 ;

[0228] Take the first execution of this step when i=0 as an example, n2>2, and c ini_0 =2157592 as input, select the 2nd order primitive polynomial in Table 1, and determine the 2-bit hash value hash according to the cyclic redundancy check (CRC) method crc_2 =0x0, at this time the initial value of the second bit is m ini_2 satisfy:

[0229] m ini_2 =2hash crc_2 +1=0x1 (32);

[0230] Step 405: Use the second bit initial value m ini_2 and the n2-order primitive polynomial in Table 1, generating a length of L n2 =2 n2 -1 second m sequence SEQ m2 , taking the first execution of this step when i=0 as an example, the second m sequence SEQ m2 =[1,0,0,1,1,1,0], L n2 =2 n2 -1=7;

[0231] Step 406: Parameter J determined in step 1 sc and N, and generate the second iteration number N according to the above formula (11) itr2 , the initialization length is L n2 The all-1 sequence SEQ Ln2 As the second intermediate sequence, taking the first execution of this step when i=0 as an example, it satisfies:

[0232]

[0233] SEQ Ln2 =[1,1,1,1,1,1,1] (34);

[0234] Step 407: Update the second intermediate sequence SEQ using the above formula (15) and formula (26) Ln2 and the second m sequence SEQ m2 , and update the second iteration number N using the above formula (17) itr2 ; Taking the first execution of this step when i=0 as an example, it satisfies:

[0235] SEQ Ln2 =[1,0,0,1,1,1,0] (35);

[0236] SEQ m2 =CircShiftLeft([1,0,0,1,1,1,0])=[0,0,1,1,1,0,1] (36);

[0237] N itr2 =2-1=1 (37);

[0238] Step 408: If N itr2 >0, then a second intermediate sequence SEQ with all 1s is regenerated Ln2 , and use the new second iteration number N itr2 , and then re-execute 407; if N itr2 = 0, the second intermediate sequence SEQ is updated Ln2 Fill to the first sequence SEQ i And use the above formula (18) to update the remaining sequence length L to be filled 21 , taking the first execution of this step when i=0 as an example, it satisfies:

[0239] L 21 =10-7=3 (38);

[0240] After the first execution of filling, the sequence is as follows Figure 8 As shown, Figure 8 is a schematic diagram of performing the first filling of the second sequence provided by an embodiment of the present invention;

[0241] Step 409: If L 21 > 0, return to Step 403; if L 21 = 0, fill a 1 into the first sequence SEQ i ; taking the last execution of this step when i = 0 as an example, at this time, it satisfies:

[0242] SEQ0 = [1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1] (39);

[0243] The filling process of the sequence SEQ0 is as Fig. 9 shown, Fig. 9 which is a schematic diagram of the second filling of the second sequence provided by the embodiment of the present invention;

[0244] Step 410: Update the symbol index i using the formula i = i + 1;

[0245] If i < M, return to Step 402;

[0246] If i = M, continue to execute the subsequent steps.

[0247] Step 5: The second device uses the obtained symbol gating sequence SEQ sym and the sub - carrier gating sequence SEQ i corresponding to each symbol to determine the sensing resource positions on the time - frequency grid G, specifically including:

[0248] Step 501: Construct a two - dimensional coordinate set (x, y) on the time - frequency grid G according to the sub - carrier number and symbol number, and the coordinates have a one - to - one mapping relationship with each RE in the grid G, where

[0249] x = 0, 1, 2, …, M - 1

[0250] y = 0, 1, 2, …, N - 1

[0251] Step 502: For each coordinate on the grid G, determine the discrete binary Boolean function f(x, y) according to the above formula (19);

[0252] Step 503: Add the RE corresponding to the coordinate (x, y) when f(x, y) takes the value of true to the sensing resource set A to obtain the final two - dimensional non - uniform resource allocation result of the sensing signal output by the method of this case. The visualization form (i.e., f(x, y)) of the obtained resource allocation result is as Fig.10 shown (white is the RE within the sensing resource set); within each gated symbol, the number of gated sub - carriers is 8 ≥ K sc (the value in Step 1 is 5), and the number of sensing symbols is 5 ≥ K sym (the value in Step 1 is 5).

[0253] Furthermore, if other parameters remain unchanged, let N=120, M=140, K sym =25,K sc =20, then Fig.11 The visualization configuration results shown (white represents RE in the perception resource set) show that the final number of perception subcarriers in each perception symbol is 32>20, and the final number of selected perception symbols is 37>25. It can be concluded that, after ensuring a given available perception OFDM symbol interval and a minimum number of symbols, the number of OFDM symbols occupied by the perception signal is fixed and meets the minimum number of symbols requirement.

[0254] Compared with the prior art, the sensing resource configuration method disclosed in the embodiment of the present invention has the following beneficial effects:

[0255] 1. Compared with the perception signal resource allocation method based on periodic sampling, the present invention can sparsely and non-uniformly configure perception resources on a two-dimensional time-frequency resource grid, greatly reducing resource consumption.

[0256] 2. Compared with the random resource configuration method based on preset pattern tables, the present invention does not require the perception signal receiving end to store a large number of preset pattern tables, and has good adaptability to the number of OFDM symbols and subcarriers occupied by a single perception signal resource set.

[0257] 3. Compared with the possible method of generating a two-dimensional non-uniform resource configuration pattern using a certain distribution of random numbers, the present invention can strictly maintain that each OFDM symbol containing a perception signal contains a fixed number of perception subcarriers, and the number of perception subcarriers meets the given minimum subcarrier number requirement. At the same time, it ensures that after a given available perception OFDM symbol interval and a minimum symbol number requirement, the number of OFDM symbols occupied by the perception signal is fixed and meets the minimum symbol number requirement.

[0258] 4. Benefiting from the randomness and sparsity of the sampling sequence, the present invention has the ability to achieve sparse reconstruction based on algorithms such as compressed sensing.

[0259] 5. The present invention can be implemented based on the CRC check function and m-sequence generation function in the existing communication system.

[0260] See also Fig.12 , Fig.12 is a structural block diagram of a sensing resource configuration device 100 provided in an embodiment of the present invention, wherein the sensing resource configuration device 100 comprises:

[0261] A configuration information receiving module 11, used to receive configuration information, where the configuration information is used to indicate parameter configuration of symbols and subcarriers;

[0262] A bit initial value determination module 12, configured to determine the bit initial value of each symbol according to the configuration information;

[0263] A first sequence determination module 13, configured to determine a first sequence according to the configuration information and the bit initial value;

[0264] A second sequence determination module 14, configured to determine a second sequence of the subcarrier corresponding to each symbol according to the configuration information and the bit initial value;

[0265] The sensing resource configuration module 15 is configured to determine a time-frequency position of sensing resources according to the first sequence and the second sequence.

[0266] Specifically, the configuration information includes at least one of the following information:

[0267] First information;

[0268] Second information:

[0269] The total number of first symbols in each time slot;

[0270] The number of time slots in each radio frame.

[0271] Specifically, the first information includes relevant information of a first number for indicating the time slot where the starting symbol is located, and relevant information of a second number for indicating the starting symbol in the time slot; the bit initial value determination module 12 is used to: determine the bit initial value of each symbol using the first number, the second number and the first total number of symbols.

[0272] Specifically, the second information includes relevant information for indicating the total number of the second symbols and relevant information for indicating the minimum number of symbols; the first sequence determination module 13 includes:

[0273] A first iteration number determining unit, configured to determine a first iteration number according to the second total number of symbols and the minimum number of symbols;

[0274] a first m-sequence determining unit, configured to determine a first bit initial value of a first m-sequence according to the second total number of symbols and the bit initial value, so as to obtain a first m-sequence according to the first bit initial value;

[0275] The first sequence filling unit is used to update the first intermediate sequence by using the first m-sequence until the first iteration number is 0, fill the updated first intermediate sequence into the first sequence; and fill the remaining filling positions of the first sequence to obtain the first sequence.

[0276] Specifically, the first m-sequence determination unit is used to: obtain a first polynomial order according to the second total number of symbols; when the first polynomial order is equal to a first fixed value, perform a remainder calculation on the bit initial value to obtain the first bit initial value; when the first polynomial order is greater than the first fixed value, obtain a primitive polynomial corresponding to the bit initial value, and use the primitive polynomial to determine a bit hash value according to a cyclic redundancy check method, so as to obtain the first bit initial value according to the bit hash value.

[0277] Specifically, the first sequence filling unit is used to: determine the remaining length of the first sequence according to the length of the first intermediate sequence; when the remaining length is greater than 0, regenerate a first intermediate sequence, and use the first m-sequence to update the regenerated first intermediate sequence until the corresponding first iteration number is 0, and continue to fill the updated first intermediate sequence into the first sequence until the remaining length is 0; when the remaining length is 0, fill a specified value at the end of the first sequence.

[0278] Specifically, the second information includes relevant information for indicating the total number of subcarriers and relevant information for indicating the minimum number of subcarriers; the second sequence determination module 14 includes:

[0279] A second iteration number determining unit, configured to determine a second iteration number according to the total number of subcarriers and the minimum number of subcarriers;

[0280] A second m-sequence determining unit, configured to determine a second initial bit value of a second m-sequence according to the total number of subcarriers and the initial bit value, so as to obtain a second m-sequence according to the second initial bit value;

[0281] The second sequence filling unit is used to update the second intermediate sequence by using the second m-sequence until the second iteration number is 0, fill the updated second intermediate sequence into the second sequence; and fill the remaining filling positions of the second sequence to obtain a second sequence.

[0282] Specifically, the second m-sequence determination unit is used to: obtain a second polynomial order according to the total number of subcarriers; when the second polynomial order is equal to a second fixed value, perform a remainder calculation on the bit initial value to obtain the second bit initial value; when the second polynomial order is greater than the second fixed value, obtain a primitive polynomial corresponding to the bit initial value, and use the primitive polynomial to determine a bit hash value according to a cyclic redundancy check method, so as to obtain the second bit initial value according to the bit hash value.

[0283] Specifically, the second sequence filling unit is used to: determine the remaining length of the second sequence according to the length of the second intermediate sequence; when the remaining length is greater than 0, regenerate a second intermediate sequence, and use the second m-sequence to update the regenerated second intermediate sequence until the corresponding second iteration number is 0, and continue to fill the updated second intermediate sequence into the second sequence until the remaining length is 0; when the remaining length is 0, fill a specified value at the end of the second sequence.

[0284] Specifically, the perception resource configuration module 15 is used to: construct a two-dimensional coordinate set related to the symbol and the subcarrier; for each coordinate in the two-dimensional coordinate set, construct a Boolean function using the first sequence and the second sequence; obtain the target coordinate when the Boolean function is true, and add the resources corresponding to the target coordinate to the perception resource set.

[0285] It is worth noting that the working process of each module in the sensing resource configuration device 100 described in the embodiment of the present invention can refer to the working process of the sensing resource configuration method described in the above embodiment, and will not be repeated here.

[0286] See also Fig.13 , Fig.13 2 is a structural block diagram of a sensing resource configuration device 200 provided in an embodiment of the present invention, wherein the sensing resource configuration device 200 includes a processor 21, a memory 22, and a computer program stored in the memory 22 and executable on the processor 21. When the processor 21 executes the computer program, the steps in each of the above-mentioned sensing resource configuration method embodiments are implemented.

[0287] Exemplarily, the computer program may be divided into one or more modules / units, which are stored in the memory 22 and executed by the processor 21 to implement the present invention. The one or more modules / units may be a series of computer program instruction segments capable of implementing specific functions, which are used to describe the execution process of the computer program in the perception resource configuration device 200.

[0288] The sensing resource configuration device 200 may include, but is not limited to, a processor 21 and a memory 22. Those skilled in the art may understand that the schematic diagram is merely an example of the sensing resource configuration device 200 and does not constitute a limitation on the sensing resource configuration device 200. The sensing resource configuration device 200 may include more or fewer components than shown in the figure, or may combine certain components, or different components. For example, the sensing resource configuration device 200 may also include input and output devices, network access devices, buses, etc.

[0289] The processor 21 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor 21 is the control center of the perception resource configuration device 200, and uses various interfaces and lines to connect various parts of the entire perception resource configuration device 200.

[0290] The memory 22 can be used to store the computer program and / or module. The processor 21 implements various functions of the sensing resource configuration device 200 by running or executing the computer program and / or module stored in the memory 22 and calling the data stored in the memory 22. The memory 22 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area can store data created according to the use of the mobile phone (such as audio data, a phone book, etc.), etc. In addition, the memory 22 can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0291] Wherein, if the module / unit integrated in the sensing resource configuration device 200 is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor 21, the steps of the above-mentioned method embodiments can be implemented. Wherein, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium, etc.

[0292] An embodiment of the present invention further provides a computer program product, including computer instructions, which, when executed by a processor, implement the perception resource configuration method as described in the above embodiment.

[0293] The above is a preferred embodiment of the present invention. It should be pointed out that a person skilled in the art can make several improvements and modifications without departing from the principle of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A method for configuring perception resources, characterized in that: include: receiving configuration information, where the configuration information is used to indicate parameter configuration of symbols and subcarriers; Determine an initial bit value of each symbol according to the configuration information; Determine, according to the configuration information and the bit initial value, a first sequence and a second sequence of the subcarriers corresponding to each symbol; A time-frequency position of a sensing resource is determined according to the first sequence and the second sequence.

2. The method for configuring sensing resources according to claim 1, characterized in that: The configuration information includes at least one of the following information: First information; Second information: The total number of first symbols in each time slot; The number of time slots in each radio frame.

3. The method for configuring sensing resources according to claim 2, characterized in that: The first information includes relevant information of a first number for indicating a time slot where a start symbol is located, and relevant information of a second number for indicating the start symbol in the time slot; and determining the initial bit value of each symbol according to the configuration information includes: An initial bit value of each symbol is determined using the first number, the second number and the first total number of symbols.

4. The method for configuring sensing resources according to claim 2, characterized in that: The second information includes relevant information for indicating the total number of the second symbols and relevant information for indicating the minimum number of symbols; The determining the first sequence according to the configuration information and the bit initial value includes: Determine a first number of iterations according to the second total number of symbols and the minimum number of symbols; Determine a first bit initial value of a first m-sequence according to the second total number of symbols and the bit initial value, so as to obtain a first m-sequence according to the first bit initial value; Using the first m-sequence to update the first intermediate sequence until the first iteration number is 0, and then filling the updated first intermediate sequence into the first sequence; The remaining filling positions of the first sequence are filled to obtain a first sequence.

5. The method for configuring sensing resources according to claim 4, characterized in that: The determining the first bit initial value of the first m-sequence according to the second total number of symbols and the bit initial value comprises: Obtaining a first polynomial order according to the second total number of symbols; When the order of the first polynomial is equal to a first fixed value, performing a remainder calculation on the initial bit value to obtain the first initial bit value; When the order of the first polynomial is greater than a first fixed value, a primitive polynomial corresponding to the bit initial value is obtained, and a bit hash value is determined using the primitive polynomial according to a cyclic redundancy check method to obtain the first bit initial value according to the bit hash value.

6. The method for configuring sensing resources according to claim 4, characterized in that: The filling of the remaining filling positions of the first sequence includes: determining a remaining length of the first sequence according to the length of the first intermediate sequence; When the remaining length is greater than 0, a first intermediate sequence is regenerated, and the regenerated first intermediate sequence is updated by using the first m-sequence until the corresponding first iteration number is 0, and the updated first intermediate sequence is continuously filled into the first sequence until the remaining length is 0; When the remaining length is 0, a specified value is padded at the end of the first sequence.

7. The method for configuring sensing resources according to claim 2, characterized in that: The second information includes relevant information for indicating the total number of subcarriers and relevant information for indicating the minimum number of subcarriers; The determining, according to the configuration information and the bit initial value, the second sequence of the subcarrier corresponding to each symbol comprises: Determine a second iteration number according to the total number of subcarriers and the minimum number of subcarriers; Determine a second initial bit value of a second m-sequence according to the total number of subcarriers and the initial bit value, so as to obtain a second m-sequence according to the second initial bit value; Using the second m-sequence to update the second intermediate sequence until the second iteration number is 0, and then filling the updated second intermediate sequence into the second sequence; The remaining filling positions of the second sequence are filled to obtain a second sequence.

8. The method for configuring sensing resources according to claim 7, characterized in that: The determining the second bit initial value of the second m-sequence according to the total number of subcarriers and the bit initial value comprises: Obtaining a second polynomial order according to the total number of subcarriers; When the second polynomial order is equal to a second fixed value, performing a remainder calculation on the bit initial value to obtain the second bit initial value; When the order of the second polynomial is greater than a second fixed value, a primitive polynomial corresponding to the bit initial value is obtained, and a bit hash value is determined using the primitive polynomial according to a cyclic redundancy check method to obtain the second bit initial value according to the bit hash value.

9. The method for configuring sensing resources according to claim 7, characterized in that: The filling of the remaining filling positions of the second sequence includes: determining a remaining length of the second sequence according to the length of the second intermediate sequence; When the remaining length is greater than 0, a second intermediate sequence is regenerated, and the regenerated second intermediate sequence is updated by using the second m-sequence, until the corresponding second iteration number is 0, and the updated second intermediate sequence is continuously filled into the second sequence until the remaining length is 0; When the remaining length is 0, a specified value is padded at the end of the second sequence.

10. The method for configuring sensing resources according to claim 1, characterized in that: The determining the time-frequency position of the sensing resource according to the first sequence and the second sequence includes: constructing a two-dimensional coordinate set associated with the symbol and the subcarrier; For each coordinate in the two-dimensional coordinate set, construct a Boolean function using the first sequence and the second sequence; The target coordinates when the Boolean function is true are obtained, and the resources corresponding to the target coordinates are added to the perception resource set.

11. A sensing resource configuration device, characterized in that: include: A configuration information receiving module, used to receive configuration information, where the configuration information is used to indicate parameter configuration of symbols and subcarriers; A bit initial value determination module, used to determine the bit initial value of each symbol according to the configuration information; A first sequence determination module, configured to determine a first sequence according to the configuration information and the bit initial value; A second sequence determination module, configured to determine a second sequence of the subcarrier corresponding to each symbol according to the configuration information and the bit initial value; A perception resource configuration module is used to determine the time-frequency position of the perception resource according to the first sequence and the second sequence.

12. A sensing resource configuration device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the perception resource configuration method as claimed in any one of claims 1 to 10 when executing the computer program.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored computer program, wherein when the computer program is executed, the device where the computer-readable storage medium is located is controlled to execute the perception resource configuration method according to any one of claims 1 to 10.

14. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the perception resource configuration method as claimed in any one of claims 1 to 10.

Images