Information bit transmission method and multiplicative repetitive sequence determination method

Abstract

The invention provides an information bit transmission method and a multiplicative repetitive sequence determination method, which are applied to the technical field of communication, and the information bit transmission method comprises the following steps: obtaining a first symbol sequence which is obtained by coding a first information bit; multiplying the first symbol sequence by each multiplicative repetition factor in the target multiplicative repetition sequence to obtain a plurality of second symbol sequences; and modulating the plurality of second symbol sequences, and transmitting the obtained plurality of first modulation sequences, the plurality of first modulation sequences being used for enabling the opposite end to determine the first information bit. After the first symbol sequence corresponding to the first information bit is obtained, the first symbol sequence is multiplied by the target multiplicative repetitive sequence, so that the purpose of performing multiplicative repetitive transmission on the first symbol sequence for multiple times can be achieved. Compared with a direct repeated transmission mode in the prior art, the multiplicative repeated transmission mode can improve the transmission performance.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method for transmitting information bits and a method for determining a multiplicative repetitive sequence. Background Art

[0002] In wireless communication systems, errors may occur during information transmission due to factors such as channel noise and interference. In order to improve the reliability of information transmission, repeated transmission technology can be used. By transmitting the same information multiple times, the receiving end can use the multiple received signals for joint processing, thereby improving the accuracy of information recovery. Among them, the direct repetition scheme is generally used for transmission in the prior art, but the performance of the direct repetition scheme for transmission is low. Summary of the invention

[0003] The purpose of the embodiments of the present application is to provide a method for transmitting information bits and a method for determining a multiplicative repetition sequence, so as to solve the technical problem of low performance of transmission using a direct repetition scheme in the prior art.

[0004] In a first aspect, an embodiment of the present application provides a method for transmitting information bits, comprising: obtaining a first symbol sequence, wherein the first symbol sequence is obtained by encoding a first information bit; multiplying the first symbol sequence with each multiplicative repetition factor in a target multiplicative repetitive sequence, respectively, to obtain multiple second symbol sequences; modulating the multiple second symbol sequences, and transmitting the obtained multiple first modulation sequences, wherein the multiple first modulation sequences are used to enable the opposite end to determine the first information bit.

[0005] In the above scheme, after obtaining the first symbol sequence corresponding to the first information bit, the first symbol sequence can be multiplied by the target multiplicative repetitive sequence to achieve the purpose of performing multiple multiplicative repetitive transmissions on the first symbol sequence. Compared with the direct repetitive transmission method in the prior art, the multiplicative repetitive transmission method in the embodiment of the present application can improve the transmission performance.

[0006] In an optional implementation, the obtaining of the first symbol sequence includes: obtaining the first information bit; performing CRC encoding on the first information bit to obtain a corresponding bit sequence; performing binary or multi-element Polar code encoding on the bit sequence to obtain the corresponding first symbol sequence. In the above scheme, after obtaining the first information bit, the first information bit can first be CRC encoded to improve the reliability of data transmission; then the bit sequence can be binary or multi-element Polar code encoded to further improve the reliability of data transmission and improve the performance of data transmission.

[0007] In an optional embodiment, the target multiplicative repetitive sequence is obtained according to the following steps: obtaining multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding the second information bit; for each group of candidate multiplicative repetitive sequences, multiplying the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculating the candidate scores corresponding to the candidate multiplicative repetitive sequence based on the multiple fourth symbol sequences; determining the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence. In the above scheme, before performing multiplicative repetitive transmission, the candidate multiplicative repetitive sequences for multiplicative repetitive transmission can be calculated first, and the optimal multiplicative repetitive sequence can be determined by calculating the candidate scores of each candidate multiplicative repetitive sequence to improve transmission performance.

[0008] In a second aspect, an embodiment of the present application provides a method for determining a multiplicative repetitive sequence, comprising: obtaining multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequences include multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding a second information bit; for each group of candidate multiplicative repetitive sequences, multiplying the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence, respectively, to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculating the candidate score corresponding to the candidate multiplicative repetitive sequence based on the multiple fourth symbol sequences; and determining the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence.

[0009] In the above scheme, before performing multiplicative repeated transmission, candidate multiplicative repeated sequences for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate scores of the candidate multiplicative repeated sequences to improve transmission performance.

[0010] In an optional implementation, the calculating the candidate score corresponding to the candidate multiplicative repeating sequence according to the plurality of fourth symbol sequences includes: modulating the plurality of fourth symbol sequences respectively to obtain corresponding second modulation sequences; calculating the similarity between any two second modulation sequences; and determining the maximum value among the plurality of similarities as the candidate score corresponding to the candidate multiplicative repeating sequence. In the above scheme, the optimal multiplicative repeating sequence can be determined by calculating the similarity to improve the transmission performance.

[0011] In an optional implementation, the calculating the similarity between any two second modulation sequences includes: calculating the squared Euclidean distance between any two second modulation sequences. In the above solution, the optimal multiplicative repeating sequence can be determined by calculating the squared Euclidean distance to improve transmission performance.

[0012] In an optional implementation, the obtaining of multiple groups of candidate multiplicative repeating sequences includes: constructing the candidate multiplicative repeating sequences based on a finite field and a generator polynomial.

[0013] In a third aspect, an embodiment of the present application provides a device for transmitting information bits, comprising: a first acquisition module, used to acquire a first symbol sequence, wherein the first symbol sequence is obtained by encoding a first information bit; a first multiplication module, used to multiply the first symbol sequence with each multiplicative repetition factor in a target multiplicative repetitive sequence, respectively, to obtain a plurality of second symbol sequences; a modulation module, used to modulate the plurality of second symbol sequences and transmit the obtained plurality of first modulation sequences, wherein the plurality of first modulation sequences are used to enable the opposite end to determine the first information bit.

[0014] In the above scheme, after obtaining the first symbol sequence corresponding to the first information bit, the first symbol sequence can be multiplied by the target multiplicative repetitive sequence to achieve the purpose of performing multiple multiplicative repetitive transmissions on the first symbol sequence. Compared with the direct repetitive transmission method in the prior art, the multiplicative repetitive transmission method in the embodiment of the present application can improve the transmission performance.

[0015] In an optional implementation, the first acquisition module is specifically used to: acquire the first information bit; perform CRC encoding on the first information bit to obtain a corresponding bit sequence; perform binary or multi-element Polar code encoding on the bit sequence to obtain the corresponding first symbol sequence. In the above scheme, after acquiring the first information bit, the first information bit can first be CRC encoded to improve the reliability of data transmission; then the bit sequence can be binary or multi-element Polar code encoded to further improve the reliability of data transmission and improve the performance of data transmission.

[0016] In an optional embodiment, the information bit transmission device further includes: a third acquisition module, used to acquire multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding the second information bit; a third multiplication module, used to multiply the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence for each group of candidate multiplicative repetitive sequences, to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculate the candidate score corresponding to the candidate multiplicative repetitive sequence based on the multiple fourth symbol sequences; a second determination module, used to determine the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence. In the above scheme, before performing multiplicative repetitive transmission, the multiplicative repetitive sequence used for multiplicative repetitive transmission can be calculated first, and the optimal multiplicative repetitive sequence can be determined by calculating the candidate scores of each candidate multiplicative repetitive sequence to improve transmission performance.

[0017] In a fourth aspect, an embodiment of the present application provides a device for determining a multiplicative repetitive sequence, comprising: a second acquisition module, used to obtain multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequences include multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding a second information bit; a second multiplication module, used to multiply the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence for each group of candidate multiplicative repetitive sequences, to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculate the candidate score corresponding to the candidate multiplicative repetitive sequence based on the multiple fourth symbol sequences; a first determination module, used to determine the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence.

[0018] In the above scheme, before performing multiplicative repeated transmission, a multiplicative repeated sequence for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate score of each candidate multiplicative repeated sequence to improve transmission performance.

[0019] In an optional embodiment, the second multiplication module is specifically used to: modulate the multiple fourth symbol sequences respectively to obtain corresponding second modulation sequences; calculate the similarity between any two second modulation sequences; and determine the maximum value of the multiple similarities as the candidate score corresponding to the candidate multiplicative repetitive sequence. In the above scheme, the optimal multiplicative repetitive sequence can be determined by calculating the similarity to improve the transmission performance.

[0020] In an optional implementation manner, the second multiplication module is specifically used to: calculate the square Euclidean distance between any two second modulation sequences. In the above solution, the optimal multiplicative repetitive sequence can be determined by calculating the square Euclidean distance to improve transmission performance.

[0021] In an optional implementation, the second acquisition module is specifically configured to construct the candidate multiplicative repeating sequence based on a finite field and a generator polynomial.

[0022] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising computer program instructions, which, when read and executed by a processor, execute the method for transmitting information bits as described in the first aspect or the method for determining a multiplicative repetitive sequence as described in the second aspect.

[0023] In a sixth aspect, an embodiment of the present application provides an electronic device, comprising: a processor, a memory and a bus; the processor and the memory communicate with each other through the bus; the memory stores computer program instructions that can be executed by the processor, and the processor calls the computer program instructions to execute the information bit transmission method as described in the first aspect or the multiplicative repetitive sequence determination method as described in the second aspect.

[0024] In the seventh aspect, an embodiment of the present application provides a computer-readable storage medium, which stores computer program instructions. When the computer program instructions are executed by a computer, the computer executes the method for transmitting information bits as described in the first aspect or the method for determining a multiplicative repetitive sequence as described in the second aspect.

[0025] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the following specifically cites the embodiments of the present application and describes them in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0027] Figure 1 It is a flowchart of direct repetition transmission based on binary Polar code in the prior art;

[0028] Figure 2 A flowchart of a method for transmitting information bits provided in an embodiment of the present application;

[0029] Figure 3 This is a flowchart of multiplicative repetitive transmission based on multivariate Polar codes in an embodiment of the present application;

[0030] Figure 4 A flowchart of a method for determining a multiplicative repeating sequence provided in an embodiment of the present application;

[0031] Figure 5 A schematic diagram showing the performance comparison between the (128, 32) multivariate Polar code 16QAM modulation multiplicative repetition scheme and the direct repetition scheme provided in the embodiment of the present application;

[0032] Figure 6 A schematic diagram showing the performance comparison between the (128, 32) multivariate Polar code BPSK modulation multiplicative repetition scheme and the direct repetition scheme provided in the embodiment of the present application;

[0033] Figure 7 A schematic diagram showing the performance comparison between the (512, 128) multivariate Polar code 16QAM modulation multiplicative repetition scheme and the direct repetition scheme provided in the embodiment of the present application;

[0034] Figure 8 A schematic diagram showing the performance comparison between multiplicative repetition and direct repetition of (512, 128) multivariate Polar code BPSK modulation provided in an embodiment of the present application;

[0035] Fig. 9 A schematic diagram showing the performance comparison between the (512, 32) multivariate Polar code QPSK modulation multiplicative repetition scheme and the direct repetition scheme provided in the embodiment of the present application;

[0036] Fig.10 A structural block diagram of an information bit transmission device provided in an embodiment of the present application;

[0037] Fig.11 A structural block diagram of a device for determining a multiplicative repeating sequence provided in an embodiment of the present application;

[0038] Fig.12 A structural block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0039] In the prior art, the current 5G Physical Broadcast Channel (PBCH) bit-level transmission is: first, cyclic redundancy check (CRC) encoding is performed, followed by binary Polar code encoding, and then several direct repeated transmissions are performed, wherein the repetition includes a rate matching process of a single synchronization signal / physical broadcast channel block (SSB) and different SSB repetitions for the same master information block (MIB) information.

[0040] The current 5G physical downlink control channel (PDCCH) bit-level transmission is: first CRC encoding, then binary Polar code encoding, and then several direct repeated transmissions, where the repetition includes rate matching process and PDCCH transmission with aggregation level greater than 1.

[0041] It can be seen that the solutions in the prior art are all based on binary Polar codes for direct repeated transmission. Figure 1 , Figure 1 The flowchart of the direct repetition transmission based on binary Polar code in the prior art is shown in FIG. The inventors have found that the prior art generally adopts the direct repetition scheme for transmission, but the performance of the direct repetition scheme for transmission is low.

[0042] Based on the above analysis, the embodiment of the present application provides a method for transmitting information bits and a method for determining a multiplicative repetitive sequence, wherein the above information bit transmission method is used for transmission using a multiplicative repetitive scheme, and the above multiplicative repetitive sequence determination method is used for determining the multiplicative repetitive sequence used in the multiplicative repetitive scheme. The technical solution in the embodiment of the present application will be described below in conjunction with the accompanying drawings in the embodiment of the present application.

[0043] Please refer to Figure 2 , Figure 2 A flowchart of a method for transmitting information bits provided in an embodiment of the present application, the method for transmitting information bits may specifically include the following steps:

[0044] Step S201: Acquire a first symbol sequence, wherein the first symbol sequence is obtained by encoding first information bits.

[0045] Step S202: multiplying the first symbol sequence by each multiplicative repetition factor in the target multiplicative repetition sequence respectively to obtain a plurality of second symbol sequences.

[0046] Step S203: modulate the multiple second symbol sequences, and transmit the obtained multiple first modulation sequences, wherein the multiple first modulation sequences are used to enable the opposite end to determine the first information bit.

[0047] Specifically, in the above step S201, the first information bit refers to data in the data transmission process, which is different in different data transmission processes. The embodiment of the present application does not specifically limit the specific implementation of the first information bit. For example, in the data transmission process of 5GPBCH, the first information bit can be MIB; or, in the data transmission process of 5G PDCCH, the first information bit can be DCI, etc.

[0048] The first symbol sequence is obtained by encoding the first information bit, wherein the first information bit is a bit sequence, and the first symbol sequence is a symbol sequence. It should be noted that the embodiment of the present application does not specifically limit the specific implementation method for encoding the first information bit, and those skilled in the art can make appropriate choices according to actual conditions. For example, the first information bit can be CRC encoded; or, the first information bit can be binary Polar code encoded; or, the first information bit can be multi-polar code encoded, etc.

[0049] In addition, the embodiments of the present application do not specifically limit the specific implementation method for obtaining the first symbol sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, the first symbol sequence sent by an external device can be received; or the first symbol sequence pre-stored in the cloud or locally can be read; or the first symbol sequence can be obtained by encoding the first information bit.

[0050] In the above step S202, the target multiplicative repetition sequence includes multiple multiplicative repetition factors, wherein the above multiple multiplicative repetition factors may be all the same, partially the same, or all different, and this embodiment of the present application does not make any specific limitation on this.

[0051] It should be noted that the embodiments of the present application do not specifically limit the specific implementation methods for determining the target multiplicative repeating sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, the target multiplicative repeating sequence can be determined by the user based on experience; or, multiple groups of candidate multiplicative repeating sequences can be constructed in advance, and the target multiplicative repeating sequence can be determined from the candidate multiplicative repeating sequences; or, the target multiplicative repeating sequence can be determined using a machine learning model, etc.

[0052] By multiplying the first symbol sequence with each multiplicative repetition factor in the target multiplicative repetition sequence, a plurality of second symbol sequences can be obtained, and each second symbol sequence corresponds to a multiplicative repetition factor.

[0053] In the above-mentioned step S203, the above-mentioned multiple second symbol sequences can be modulated respectively to obtain the first modulation sequence corresponding to each second symbol sequence; then, the above-mentioned multiple first modulation sequences can be transmitted; in this way, after receiving the above-mentioned multiple first modulation sequences, the other end can restore the first information bit based on the above-mentioned multiple first modulation sequences.

[0054] In the above scheme, after obtaining the first symbol sequence corresponding to the first information bit, the first symbol sequence can be multiplied by the target multiplicative repetitive sequence to achieve the purpose of performing multiple multiplicative repetitive transmissions on the first symbol sequence. Compared with the direct repetitive transmission method in the prior art, the multiplicative repetitive transmission method in the embodiment of the present application can improve the transmission performance.

[0055] Further, based on the above embodiment, the above step S201 may specifically include the following steps:

[0056] Step 1), obtain the first information bit.

[0057] Step 2), perform CRC encoding on the first information bit to obtain a corresponding bit sequence.

[0058] Step 3), perform binary or multi-element Polar code encoding on the bit sequence to obtain a corresponding first symbol sequence.

[0059] Specifically, in the above step 1), the specific implementation method of obtaining the first information bit is not limited in the present embodiment, and those skilled in the art can make appropriate choices according to actual conditions. For example, the first information bit sent by an external device can be received; or the first information bit stored in the cloud or locally in advance can be read.

[0060] In step 2) above, CRC encoding is a method used to detect errors that may occur after data transmission or storage. CRC encoding uses the principle of division and remainder to process data through a specific polynomial to generate a check code (CRC value), which is then transmitted together with the data. After receiving the data, the receiving end will recalculate the CRC value and compare it with the received CRC value to detect whether an error occurred during the data transmission process.

[0061] For example, CRC encoding of the first information bit may include the following steps: step 1), setting the CRC register and presetting the initial value (such as all 1s); step 2), performing an XOR operation on each byte of data and the lower 8 bits of the CRC register, and storing the result in the CRC register; step 3), shifting the CRC register to the right, filling the highest bit with zero, and if the lowest bit shifted out is 1, the CRC register is XORed with a predefined polynomial code; if it is 0, no XOR is performed; step 4), repeating the above steps until all data bytes are processed, at which time the value in the CRC register is the final CRC check code.

[0062] In the above step 3), Polar code is a linear block code based on channel polarization phenomenon. The core idea is to "polarize" a set of channels into a new set of virtual channels through a specific transformation. Some of these virtual channels will have very good channel characteristics (close to noise-free), while others will have very poor channel characteristics (close to pure noise). Through this polarization effect, good channels can be selected to transmit information bits, while poor channels can be used to transmit fixed redundant bits (such as zero bits), thereby achieving efficient coding.

[0063] In the embodiment of the present application, the bit sequence can be encoded by binary or multi-element Polar code to obtain the corresponding first symbol sequence. Figure 3 , Figure 3 This is a flowchart of multiplicative repeated transmission based on multivariate Polar codes in an embodiment of the present application.

[0064] In the above scheme, after obtaining the first information bit, the first information bit can be CRC encoded first, so as to improve the reliability of data transmission; then the bit sequence can be binary or multi-element Polar code encoded, so as to further improve the reliability of data transmission and improve the performance of data transmission.

[0065] Further, based on the above embodiment, the target multiplicative repeating sequence can be obtained according to the following steps:

[0066] Step 1) obtains multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetition factors, and the third symbol sequence is obtained by encoding the second information bit.

[0067] Step 2), for each group of candidate multiplicative repeating sequences, multiply the third symbol sequence with each multiplicative repeating factor in the candidate multiplicative repeating sequence to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repeating sequence, and calculate the candidate score corresponding to the candidate multiplicative repeating sequence based on the multiple fourth symbol sequences.

[0068] Step 3), determining the candidate multiplicative repeating sequence with the highest candidate score as the target multiplicative repeating sequence.

[0069] Specifically, in the above step 1), each group of candidate multiplicative repetitive sequences includes multiple multiplicative repetitive factors, wherein the above multiple multiplicative repetitive factors may be all the same, partially the same, or all different, and this embodiment of the present application does not make any specific limitation on this.

[0070] It should be noted that the embodiments of the present application do not specifically limit the specific implementation methods for determining the candidate multiplicative repeating sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, the candidate multiplicative repeating sequence can be determined by the user based on experience; or, the candidate multiplicative repeating sequence can be constructed based on a finite field and a generator polynomial; or, the candidate multiplicative repeating sequence can be determined using a machine learning model, etc.

[0071] Taking the above candidate multiplicative repeating sequence constructed based on a finite field and a generator polynomial as an example, the finite field is GF(q) and q=2 p , then the candidate multiplicative repeating sequence is (1, γ1, γ2, ..., γ p-1 ), γ i ∈GF(q),γ i ≠0,i∈{1,2,…,p-1}.

[0072] The third symbol sequence is obtained by encoding the second information bit. Among them, the second information bit is a bit sequence, and the third symbol sequence is a symbol sequence. It should be noted that the embodiment of the present application does not specifically limit the specific implementation method for encoding the second information bit, and those skilled in the art can make appropriate choices according to actual conditions. For example, the second information bit can be CRC encoded; or, the second information bit can be binary Polar code encoded; or, the second information bit can be multi-polar code encoded, etc.

[0073] In addition, the embodiments of the present application do not limit the specific implementation methods for obtaining multiple sets of candidate multiplicative repeating sequences and the third symbol sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, multiple sets of candidate multiplicative repeating sequences and the third symbol sequence sent by an external device can be received; or multiple sets of candidate multiplicative repeating sequences and the third symbol sequence pre-stored in the cloud or locally can be read; or multiple sets of candidate multiplicative repeating sequences can be constructed based on a finite field and a generating polynomial, and the third symbol sequence can be obtained by encoding the second information bit, etc.

[0074] In the above step 2), for each group of candidate multiplicative repetitive sequences, the third symbol sequence can be multiplied by each multiplicative repetitive factor in the candidate multiplicative repetitive sequence to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and each fourth symbol sequence corresponds to a multiplicative repetitive factor in the candidate multiplicative repetitive sequence.

[0075] The embodiment of the present application does not limit the specific implementation method of calculating the candidate score corresponding to the candidate multiplicative repeating sequence according to multiple fourth symbol sequences, and those skilled in the art can make appropriate choices according to actual conditions. For example, the candidate score corresponding to the candidate multiplicative repeating sequence can be determined by calculating the squared Euclidean distance; or, the candidate score corresponding to the candidate multiplicative repeating sequence can be determined using a machine learning model, etc.

[0076] In the above step 3), the candidate multiplicative repetitive sequence has the highest candidate score, indicating that the candidate multiplicative repetitive sequence can achieve higher performance when used for multiplicative repetitive transmission. Therefore, the candidate multiplicative repetitive sequence with the highest candidate score can be determined as the target multiplicative repetitive sequence.

[0077] In the above scheme, before performing multiplicative repeated transmission, a multiplicative repeated sequence for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate score of each candidate multiplicative repeated sequence to improve transmission performance.

[0078] Please refer to Figure 4 , Figure 4 A flowchart of a method for determining a multiplicative repeating sequence provided in an embodiment of the present application, the method for determining a multiplicative repeating sequence may specifically include the following steps:

[0079] Step S401: Acquire multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetition factors, and the third symbol sequence is obtained by encoding the second information bit.

[0080] Step S402: for each group of candidate multiplicative repeating sequences, multiply the third symbol sequence by each multiplicative repeating factor in the candidate multiplicative repeating sequence to obtain a plurality of fourth symbol sequences corresponding to the candidate multiplicative repeating sequence, and calculate the candidate score corresponding to the candidate multiplicative repeating sequence according to the plurality of fourth symbol sequences.

[0081] Step S403: Determine the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence.

[0082] Specifically, in the above step S401, each group of candidate multiplicative repetition sequences includes multiple multiplicative repetition factors, wherein the above multiple multiplicative repetition factors may be all the same, partially the same, or all different, and this embodiment of the present application does not make any specific limitation on this.

[0083] It should be noted that the embodiments of the present application do not specifically limit the specific implementation methods for determining the candidate multiplicative repeating sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, the candidate multiplicative repeating sequence can be determined by the user based on experience; or, the candidate multiplicative repeating sequence can be constructed based on a finite field and a generator polynomial; or, the candidate multiplicative repeating sequence can be determined using a machine learning model, etc.

[0084] Taking the above candidate multiplicative repeating sequence constructed based on a finite field and a generator polynomial as an example, the finite field is GF(q) and q=2 p , then the candidate multiplicative repeating sequence is (1, γ1, γ2, ..., γ p-1 ), γ i ∈GF(q),γ i ≠0,i∈{1,2,…,p-1}.

[0085] The third symbol sequence is obtained by encoding the second information bit. Among them, the second information bit is a bit sequence, and the third symbol sequence is a symbol sequence. It should be noted that the embodiment of the present application does not specifically limit the specific implementation method for encoding the second information bit, and those skilled in the art can make appropriate choices according to actual conditions. For example, the second information bit can be CRC encoded; or, the second information bit can be binary Polar code encoded; or, the second information bit can be multi-polar code encoded, etc.

[0086] In addition, the embodiments of the present application do not limit the specific implementation methods for obtaining multiple sets of candidate multiplicative repeating sequences and the third symbol sequence, and those skilled in the art can make appropriate choices according to actual conditions. For example, multiple sets of candidate multiplicative repeating sequences and the third symbol sequence sent by an external device can be received; or multiple sets of candidate multiplicative repeating sequences and the third symbol sequence pre-stored in the cloud or locally can be read; or multiple sets of candidate multiplicative repeating sequences can be constructed based on a finite field and a generating polynomial, and the third symbol sequence can be obtained by encoding the second information bit, etc.

[0087] In the above step S402, for each group of candidate multiplicative repetitive sequences, the third symbol sequence can be multiplied by each multiplicative repetitive factor in the candidate multiplicative repetitive sequence to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and each fourth symbol sequence corresponds to a multiplicative repetitive factor in the candidate multiplicative repetitive sequence.

[0088] The embodiment of the present application does not limit the specific implementation method of calculating the candidate score corresponding to the candidate multiplicative repeating sequence according to multiple fourth symbol sequences, and those skilled in the art can make appropriate choices according to actual conditions. For example, the candidate score corresponding to the candidate multiplicative repeating sequence can be determined by calculating the squared Euclidean distance; or, the candidate score corresponding to the candidate multiplicative repeating sequence can be determined using a machine learning model, etc.

[0089] In the above step S403, the candidate multiplicative repetitive sequence has the highest candidate score, indicating that the candidate multiplicative repetitive sequence can achieve higher performance when used for multiplicative repetitive transmission. Therefore, the candidate multiplicative repetitive sequence with the highest candidate score can be determined as the target multiplicative repetitive sequence.

[0090] In the above scheme, before performing multiplicative repeated transmission, a multiplicative repeated sequence for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate score of each candidate multiplicative repeated sequence to improve transmission performance.

[0091] Further, based on the above embodiment, the above step S402 may specifically include the following steps:

[0092] Step 1), modulate multiple fourth symbol sequences respectively to obtain corresponding second modulation sequences.

[0093] Step 2), calculating the similarity between any two second modulation sequences.

[0094] Step 3), determining the maximum value among the multiple similarities as the candidate score corresponding to the candidate multiplicative repeating sequence.

[0095] Specifically, in the above step 1), multiple fourth symbol sequences can be modulated respectively to obtain corresponding second modulation sequences. The embodiment of the present application does not specifically limit the specific modulation method, for example, 16QAM modulation, BPSK modulation, QPSK modulation, etc. can be used for modulation.

[0096] In the above step 2), the similarity between any two second modulation sequences can be calculated. It should be noted that the embodiment of the present application does not specifically limit the specific implementation method of calculating the similarity between two second modulation sequences, and those skilled in the art can make appropriate adjustments according to actual conditions. For example, the squared Euclidean distance between the two second modulation sequences can be calculated; or the cosine similarity between the two second modulation sequences can be calculated; or the similarity between the two second modulation sequences can be evaluated by performing Fourier transform on the two second modulation sequences.

[0097] Taking the calculation of the squared Euclidean distance between two second modulation sequences as an example, for two finite fields GF(q) and q=2 p The elements α and β (where α≠β) on the α ={c α，1 , c α，2 , .., c α，q} and c β ={c β，1 , c β，2 , .., c β，q}(where c α,i ,c β，i ∈GF(q)), the corresponding bit sequence is c α b ={c α，1 b , c α，2 b , .., c α，q b} and c β b ={c β，1 b , c β，2 b , ..., c β，q b}(where c α，i b , c β，i b ∈{0,1}).

[0098] When the modulation order matches the finite field, the modulation sequence obtained after modulation is X α ={x α，1 , x α，2 , .., x α，q} and X β ={x β，1 , x β，2 , ..., x β，q}, at this time, the squared Euclidean distance d between the corresponding sequences of α and β 2 (X α, X β )for:

[0099]

[0100] It should be noted that when the modulation order does not match the finite field, the method of calculating the squared Euclidean distance between the two sequences is the same as that in the above embodiment, the only difference is that the number of parameters in the modulation sequence obtained after modulation may be greater than q.

[0101] In addition, when the modulation mode is BPSK, x i =1-2c i b , therefore, the squared Euclidean distance d between the corresponding sequences of α and β 2 (X α , X β )for:

[0102]

[0103] Among them, d Hamming (c α , c β ) represents the Hamming distance between the corresponding sequences of α and β.

[0104] In the above step 3), the minimum value among the multiple squared Euclidean distances may be determined as the candidate score corresponding to the candidate multiplicative repeating sequence:

[0105] d min 2 =mind 2 (X α ,X β ).

[0106] That is to say, the final target multiplicative repeating sequence is:

[0107]

[0108] In the above scheme, the optimal multiplicative repetitive sequence can be determined by calculating the squared Euclidean distance to improve the transmission performance.

[0109] Further, based on the above embodiment, the step of calculating the similarity between any two second modulation sequences may specifically include the following steps:

[0110] Calculate the squared Euclidean distance between any two second modulation sequences.

[0111] In the above scheme, the optimal multiplicative repetitive sequence can be determined by calculating the squared Euclidean distance to improve the transmission performance.

[0112] Further, based on the above embodiment, the above step S401 may specifically include the following steps:

[0113] Construct candidate multiplicative repeating sequences based on a finite field and a generator polynomial.

[0114] The following is an explanation of the information bit transmission method and the method for determining the multiplicative repeating sequence provided in the embodiments of the present application. Assume that GF(16) multivariate Polar code is used, and based on the generating polynomial 1+x+x 4 The multiplicative repetition factor is designed. For different modulation modes, the multiplicative repetition sequence with the highest candidate score among the candidate multiplicative repetition sequences that minimize the squared Euclidean distance is selected as the target multiplicative repetition sequence corresponding to a modulation mode; among them, the target multiplicative repetition sequence for 16QAM modulation is (1,2,11,5), the target multiplicative repetition sequence for BPSK modulation is (1,8,11,14), and the target multiplicative repetition sequence for QPSK modulation is (1,11,13,14) (the number of repetitions is 4 times).

[0115] Please refer to Figure 5 , Figure 5 A schematic diagram of the performance comparison between the multiplicative repetition scheme and the direct repetition scheme of the (128, 32) multivariate Polar code 16QAM modulation provided in the embodiment of the present application. When the modulation mode is 16QAM modulation, the code length is 128 bits, the information bit is 32 bits, and the CRC length is 24, the multivariate Polar code direct repetition scheme is 0.1dB better than the binary Polar code direct repetition scheme, and the multivariate Polar code multiplicative repetition scheme is 2dB better than the direct repetition scheme.

[0116] Please refer to Figure 6 , Figure 6 A schematic diagram showing the performance comparison between the multivariate repetition scheme and the direct repetition scheme of the (128, 32) multivariate Polar code BPSK modulation provided in the embodiment of the present application. When the modulation mode is BPSK, the code length is 128 bits, the information bit is 32 bits, and the CRC length is 24, the performance of the multivariate Polar code direct repetition scheme is basically the same as that of the binary Polar code direct repetition scheme, and the multivariate Polar code multiplicative repetition scheme is 0.5dB better than the direct repetition scheme.

[0117] Please refer to Figure 7 , Figure 7 A schematic diagram of the performance comparison between the multiplicative repetition scheme and the direct repetition scheme of the (512, 128) multivariate Polar code 16QAM modulation provided in the embodiment of the present application. When the code length is 512 bits, the information bit is 128 bits, the CRC length is 8, the list size is 8, and the modulation mode is 16QAM, the multivariate Polar code multiplicative repetition scheme is 1.8dB better than the binary Polar code direct repetition scheme.

[0118] Please refer to Figure 8 , Figure 8 A schematic diagram of the performance comparison between multiplicative repetition and direct repetition of (512, 128) multivariate Polar code BPSK modulation provided in the embodiment of the present application. When the code length is 512 bits, the information bit is 128 bits, the CRC length is 8, the list size is 8, and the modulation mode is BPSK, the multivariate Polar code direct repetition scheme is 0.2dB better than the binary Polar code direct repetition scheme, and the multivariate Polar code multiplicative repetition scheme is 0.5dB better than the binary Polar code direct repetition scheme.

[0119] Please refer to Fig. 9 , Fig. 9 A schematic diagram of the performance comparison between the multivariate repetition scheme and the direct repetition scheme of the (512, 32) multivariate Polar code QPSK modulation provided in the embodiment of the present application. When the code length is 512 bits, the information bit is 128 bits, the CRC length is 8, the list size is 8, and the modulation mode is QPSK, the multivariate Polar code multiplicative repetition scheme is 0.5dB better than the binary Polar code direct repetition scheme, and 0.1dB better than the multivariate Polar code direct repetition scheme.

[0120] Please refer to Fig.10 , Fig.10 A structural block diagram of an information bit transmission device provided in an embodiment of the present application, the information bit transmission device 1000 includes: a first acquisition module 1001, used to obtain a first symbol sequence, wherein the first symbol sequence is obtained by encoding the first information bit; a first multiplication module 1002, used to multiply the first symbol sequence with each multiplicative repetition factor in a target multiplicative repetitive sequence, respectively, to obtain a plurality of second symbol sequences; a modulation module 1003, used to modulate the plurality of second symbol sequences, and transmit the obtained plurality of first modulation sequences, wherein the plurality of first modulation sequences are used to enable the opposite end to determine the first information bit.

[0121] In the above scheme, after obtaining the first symbol sequence corresponding to the first information bit, the first symbol sequence can be multiplied by the target multiplicative repetitive sequence to achieve the purpose of performing multiple multiplicative repetitive transmissions on the first symbol sequence. Compared with the direct repetitive transmission method in the prior art, the multiplicative repetitive transmission method in the embodiment of the present application can improve the transmission performance.

[0122] In an optional implementation, the first acquisition module 1001 is specifically used to: acquire the first information bit; perform CRC encoding on the first information bit to obtain a corresponding bit sequence; perform binary or multi-element Polar code encoding on the bit sequence to obtain the corresponding first symbol sequence.

[0123] In the above scheme, after obtaining the first information bit, the first information bit can be CRC encoded first, so as to improve the reliability of data transmission; then the bit sequence can be binary or multi-element Polar code encoded, so as to further improve the reliability of data transmission and improve the performance of data transmission.

[0124] In an optional embodiment, the information bit transmission device 1000 also includes: a third acquisition module, used to obtain multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding the second information bit; a third multiplication module, used to multiply the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence for each group of candidate multiplicative repetitive sequences, to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculate the candidate score corresponding to the candidate multiplicative repetitive sequence based on the multiple fourth symbol sequences; a second determination module, used to determine the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence.

[0125] In the above scheme, before performing multiplicative repeated transmission, a multiplicative repeated sequence for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate score of each candidate multiplicative repeated sequence to improve transmission performance.

[0126] Please refer to Fig.11 , Fig.11 A structural block diagram of a device for determining a multiplicative repetitive sequence provided in an embodiment of the present application, the device 1100 for determining a multiplicative repetitive sequence includes: a second acquisition module 1101, used to obtain multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes multiple multiplicative repetitive factors, and the third symbol sequence is obtained by encoding the second information bit; a second multiplication module 1102, used to multiply the third symbol sequence with each multiplicative repetitive factor in the candidate multiplicative repetitive sequence for each group of candidate multiplicative repetitive sequences, respectively, to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetitive sequence, and calculate the candidate score corresponding to the candidate multiplicative repetitive sequence according to the multiple fourth symbol sequences; a first determination module 1103, used to determine the candidate multiplicative repetitive sequence with the highest candidate score as the target multiplicative repetitive sequence.

[0127] In the above scheme, before performing multiplicative repeated transmission, a multiplicative repeated sequence for multiplicative repeated transmission may be calculated first, and the optimal multiplicative repeated sequence may be determined by calculating the candidate score of each candidate multiplicative repeated sequence to improve transmission performance.

[0128] In an optional embodiment, the second multiplication module 1102 is specifically used to: modulate the multiple fourth symbol sequences respectively to obtain corresponding second modulation sequences; calculate the square Euclidean distance between any two second modulation sequences; and determine the minimum value of the multiple square Euclidean distances as the candidate score corresponding to the candidate multiplicative repeating sequence.

[0129] In the above scheme, the optimal multiplicative repetitive sequence can be determined by calculating the squared Euclidean distance to improve the transmission performance.

[0130] Please refer to Fig.12 , Fig.12 The structural block diagram of an electronic device provided in an embodiment of the present application, the electronic device 1200 includes: at least one processor 1201, at least one communication interface 1202, at least one memory 1203 and at least one communication bus 1204. Among them, the communication bus 1204 is used to realize the direct connection and communication of these components, the communication interface 1202 is used to communicate signaling or data with other node devices, and the memory 1203 stores machine-readable instructions executable by the processor 1201. When the electronic device 1200 is running, the processor 1201 communicates with the memory 1203 through the communication bus 1204, and the machine-readable instructions are called by the processor 1201 to execute the above-mentioned information bit transmission method or the method for determining the multiplicative repetitive sequence.

[0131] For example, the processor 1201 of the embodiment of the present application reads a computer program from the memory 1203 through the communication bus 1204 and executes the computer program to implement the following method: obtain a first symbol sequence, wherein the first symbol sequence is obtained by encoding the first information bit; multiply the first symbol sequence with each multiplicative repetition factor in the target multiplicative repetition sequence respectively to obtain multiple second symbol sequences; modulate the multiple second symbol sequences and transmit the obtained multiple first modulation sequences, wherein the multiple first modulation sequences are used to enable the opposite end to determine the first information bit. Alternatively, the following method can be implemented: obtain multiple groups of candidate multiplicative repetition sequences and a third symbol sequence, wherein the candidate multiplicative repetition sequence includes multiple multiplicative repetition factors, and the third symbol sequence is obtained by encoding the second information bit; for each group of candidate multiplicative repetition sequences, multiply the third symbol sequence with each multiplicative repetition factor in the candidate multiplicative repetition sequence respectively to obtain multiple fourth symbol sequences corresponding to the candidate multiplicative repetition sequence; calculate the candidate score corresponding to the candidate multiplicative repetition sequence according to the multiple fourth symbol sequences; determine the candidate multiplicative repetition sequence with the highest candidate score as the target multiplicative repetition sequence.

[0132] Among them, the processor 1201 includes one or more, which can be an integrated circuit chip with signal processing capabilities. The above-mentioned processor 1201 can be a general-purpose processor, including a central processing unit (CPU), a micro control unit (MCU), a network processor (NP) or other conventional processors; it can also be a dedicated processor, including a neural network processor (NPU), a graphics processor (GPU), a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. In addition, when there are multiple processors 1201, some of them can be general-purpose processors and the other part can be dedicated processors.

[0133] The memory 1203 includes one or more, which may be, but not limited to, a random access memory (RAM), a read only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), etc.

[0134] Understandably, Fig.12 The structure shown is for illustration only. The electronic device 1200 may also include Fig.12 More or fewer components as shown, or with Fig.12 Different configurations are shown. Fig.12 Each component shown in can be implemented by hardware, software or a combination thereof. In the embodiment of the present application, the electronic device 1200 can be, but not limited to, a physical device such as a desktop computer, a laptop computer, a smart phone, a smart wearable device, a vehicle-mounted device, etc., and can also be a virtual device such as a virtual machine. In addition, the electronic device 1200 is not necessarily a single device, but can also be a combination of multiple devices, such as a server cluster, etc.

[0135] The embodiment of the present application also provides a computer program product, including a computer program stored on a computer-readable storage medium, the computer program including computer program instructions, when the computer program instructions are executed by a computer, the computer can execute the steps of the information bit transmission method or the multiplicative repetitive sequence determination method in the above-mentioned embodiment, for example including: Step S201: Obtain a first symbol sequence, wherein the first symbol sequence is obtained by encoding the first information bit. Step S202: Multiply the first symbol sequence with each multiplicative repetitive factor in the target multiplicative repetitive sequence respectively to obtain a plurality of second symbol sequences. Step S203: Modulate the plurality of second symbol sequences, and transmit the obtained plurality of first modulation sequences, wherein the plurality of first modulation sequences are used to enable the opposite end to determine the first information bit. Alternatively, it includes: Step S401: Obtain a plurality of groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequence includes a plurality of multiplicative repetitive factors, and the third symbol sequence is obtained by encoding the second information bit. Step S402: for each group of candidate multiplicative repeating sequences, multiply the third symbol sequence by each multiplicative repeating factor in the candidate multiplicative repeating sequence to obtain a plurality of fourth symbol sequences corresponding to the candidate multiplicative repeating sequence, and calculate the candidate score corresponding to the candidate multiplicative repeating sequence according to the plurality of fourth symbol sequences. Step S403: determine the candidate multiplicative repeating sequence with the highest candidate score as the target multiplicative repeating sequence.

[0136] An embodiment of the present application further provides a computer-readable storage medium, which stores computer program instructions. When the computer program instructions are executed by a computer, the computer executes the information bit transmission method or the multiplicative repetitive sequence determination method described in the aforementioned method embodiment.

[0137] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0138] In addition, the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0139] Furthermore, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0140] It should be noted that if the function is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can essentially be embodied in the form of a software product, or the part that contributes to the prior art or the part of the technical solution. The computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM) random access memory (RAM), disk or optical disk, and other media that can store program codes.

[0141] In this document, relational terms such as first and second, etc. are used merely to distinguish one entity or operation from another entity or operation, but do not necessarily require or imply any such actual relationship or order between these entities or operations.

[0142] The above description is only an embodiment of the present application and is not intended to limit the protection scope of the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A method for transmitting information bits, characterized in that: include: Acquire a first symbol sequence, wherein the first symbol sequence is obtained by encoding a first information bit; Multiplying the first symbol sequence by each multiplicative repetition factor in the target multiplicative repetition sequence respectively to obtain a plurality of second symbol sequences; The multiple second symbol sequences are modulated and the obtained multiple first modulation sequences are transmitted, wherein the multiple first modulation sequences are used to enable the opposite end to determine the first information bit.

2. The method for transmitting information bits according to claim 1, characterized in that: The obtaining of the first symbol sequence comprises: Acquire the first information bit; Performing CRC encoding on the first information bits to obtain a corresponding bit sequence; Perform binary or multi-element Polar code encoding on the bit sequence to obtain the corresponding first symbol sequence.

3. The information bit transmission method according to claim 1 or 2, characterized in that: The target multiplicative repetitive sequence is obtained according to the following steps: Acquire multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequences include multiple multiplicative repetition factors, and the third symbol sequence is obtained by encoding the second information bit; For each group of candidate multiplicative repeating sequences, multiply the third symbol sequence by each multiplicative repeating factor in the candidate multiplicative repeating sequence to obtain a plurality of fourth symbol sequences corresponding to the candidate multiplicative repeating sequence, and calculate a candidate score corresponding to the candidate multiplicative repeating sequence according to the plurality of fourth symbol sequences; The candidate multiplicative repeating sequence with the highest candidate score is determined as the target multiplicative repeating sequence.

4. A method for determining a multiplicative repeating sequence, characterized in that: include: Acquire multiple groups of candidate multiplicative repetitive sequences and a third symbol sequence, wherein the candidate multiplicative repetitive sequences include multiple multiplicative repetition factors, and the third symbol sequence is obtained by encoding the second information bit; For each group of candidate multiplicative repeating sequences, multiply the third symbol sequence by each multiplicative repeating factor in the candidate multiplicative repeating sequence to obtain a plurality of fourth symbol sequences corresponding to the candidate multiplicative repeating sequence, and calculate a candidate score corresponding to the candidate multiplicative repeating sequence according to the plurality of fourth symbol sequences; The candidate multiplicative repeating sequence with the highest candidate score is determined as the target multiplicative repeating sequence.

5. The method for determining a multiplicative repeating sequence according to claim 4, characterized in that: The calculating, according to the plurality of fourth symbol sequences, a candidate score corresponding to the candidate multiplicative repeated sequence comprises: modulating the plurality of fourth symbol sequences respectively to obtain corresponding second modulation sequences; Calculating the similarity between any two second modulation sequences; The maximum value among the multiple similarities is determined as the candidate score corresponding to the candidate multiplicative repeating sequence.

6. The method for determining a multiplicative repeating sequence according to claim 5, characterized in that: The calculating the similarity between any two second modulation sequences comprises: Calculate the squared Euclidean distance between any two second modulation sequences.

7. The method for determining a multiplicative repeating sequence according to any one of claims 4 to 6, characterized in that: The step of obtaining multiple groups of candidate multiplicative repeating sequences comprises: The candidate multiplicative repeating sequence is constructed based on a finite field and a generator polynomial.

8. A computer program product, characterized in that The method comprises computer program instructions, which, when read and executed by a processor, executes the information bit transmission method as described in any one of claims 1 to 3 or the multiplicative repetitive sequence determination method as described in any one of claims 4 to 7.

9. An electronic device, characterized in that: include: processor, memory, and bus; The processor and the memory communicate with each other via the bus; The memory stores computer program instructions that can be executed by the processor, and the processor calls the computer program instructions to execute the information bit transmission method as described in any one of claims 1-3 or the multiplicative repetitive sequence determination method as described in any one of claims 4-7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer program instructions, and when the computer program instructions are executed by a computer, the computer executes the information bit transmission method as described in any one of claims 1 to 3 or the multiplicative repetitive sequence determination method as described in any one of claims 4 to 7.

Images