Selective multiplicative repetition-based rate-compatible tail-biting convolutional code coding method and device

Abstract

The invention relates to the field of digital communication and digital storage, in particular to a rate-compatible tail-biting convolutional code encoding method and device based on selective multiplicative repetition. The method comprises the following steps: acquiring an information sequence to be coded; performing CRC coding on the information sequence by using a cyclic redundancy polynomial to obtain a redundant sequence, the redundant sequence comprising an information sequence and a CRC redundant information sequence; periodically inserting the CRC redundant information sequence into the information sequence by taking a symbol formed by a preset number of bits as a unit to obtain a new redundant sequence; performing tail biting convolutional coding according to the new redundant sequence to obtain a coded sequence; and performing selective multiplicative repetition coding according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetition coding sequence. The coding method provided by the invention has a lower block error rate under various code rates.

Description

Technical Field

[0001] The present invention relates to the fields of digital communication and digital storage, and in particular to a rate-compatible tail-biting convolutional code encoding method and device based on selective multiplicative repetition. Background Art

[0002] The fifth generation of communication technology meets the specific needs of autonomous machines and devices by providing two novel wireless modes: ultra-reliable communication (URC) within a short code range and massive machine-to-machine communication (MM2M). In the future 6G communication technology, virtual reality and the Internet of Everything will rely heavily on these two wireless modes, so they will still be the main driving factors of 6G. In order to meet the requirements of ultra-high reliability and ultra-low latency of the communication system, it is necessary to further improve the encoding and decoding capabilities of the communication system. Channel coding technology is a key technology to achieve ultra-high reliability and ultra-low latency communication.

[0003] In order to construct a short code close to the performance bound, in 2015, Alexander Vardy published a cyclic redundancy check (CRC) polar code decoded by a continuous elimination list decoder in his paper "List decoding of polar codes" (IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, 2015), demonstrating its competitiveness in short code communication. In 2019, Erdal Ar1kan published a polarization-adjusted convolutional code in his paper "From sequential decoding to channel polarization and back again" (arXiv preprint arXiv: 1908.09594, 2019), whose performance is close to the finite length bound. In 2023, Yulin Shao published an attention code constructed using deep learning in his paper "Attention code: Ultra-reliable feedback codes for short-packet communications" (IEEE Transactions on Communications, vol. 71, no. 8, pp. 4437–4452, 2023), demonstrating its potential in short code communications. In 2022, Hengjie Yang published a CRC-assisted tail-biting convolutional code in his paper "CRC-aided list decoding of convolutional codes in the short block length regime" (IEEE Trans. Inf. Theory, vol. 68, no. 6, pp. 3744–3766, 2022), showing performance close to the RCU boundary. In 2022, Jacob King publicly demonstrated in his paper "CRC-aided list decoding of convolutional and polar codes for short messages in 5G" (ICC 2022-IEEE International Conference on Communications, 2022, pp. 92–97) that CRC-assisted tail-biting convolutional codes have greater potential than polar codes in the short code range.

[0004] However, the above short codes are not suitable for scenarios where channel quality changes rapidly, that is, there is no rate compatibility. There are generally two technologies for designing rate-compatible codes: puncturing and expansion. In 2022, Seokju Han disclosed a rate-compatible polar code constructed with puncturing technology in his paper "Rate-compatible punctured polar codes" (IEEE Commun. Lett., vol. 26, no. 4, pp. 753–757, 2022). In 2023, Xianwen Zhang disclosed a rate-compatible polarization adjustment convolutional code in his paper "Rate-compatible puncturing and shortening of short PAC codes for 6GURLLC" (2023IEEE 24th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2023, pp. 301–305). In 2024, XinyuanmengYao published a polar code encoding scheme with flexible length in his paper "A balanced tree approach to construction of length flexible polar codes" (IEEE Transactions on Communications, vol.72, no.2, pp.665–674, 2024), and the performance of the code is comparable to that of 5G polar code. Multiplicative repetition technology is a commonly used technology for constructing rate-compatible short codes. In 2016, Xijin Mu published a superposition transmission scheme based on multiplicative repetition in his paper "Multiplicative repetition based superposition transmission of nonbinary codes" (2016IEEE International Symposium on Information Theory (ISIT), 2016, pp.3023–3027), and the performance of the constructed code is better than that of the code constructed by Markov superposition transmission.Based on this scheme, in 2018, Xue Tan published a superposition transmission scheme based on partial multiplicative repetition in his paper "Multiplicative repetition based partialsuperposition transmission with nonbinary codes" (2018IEEE 10th International Symposium on Turbo Codes&Iterative Information Processing (ISTC), 2018, pp.1–5), which further reduced the decoding complexity and delay of the multiplicative repetition superposition transmission scheme. In 2022, Fariba Abbasi published different schemes for constructing polar codes using multiplicative repetition technology in his papers "Hybrid non-binaryrepeated polar codes" (IEEE Trans. Wireless Commun., vol.21, no.9, pp.75827594, 2022) and "Polar coded repetition" (IEEE Transactions on Communications, vol.70, no.10, pp.6399–6409, 2022). However, the performance of the code constructed by the above scheme is still somewhat behind the finite length boundary within the short code range, and further research on new coding schemes is needed to reduce this gap. Summary of the invention

[0005] In order to improve the performance and rate compatibility of tail-biting convolutional codes within a short code range, the present invention provides a rate-compatible tail-biting convolutional code encoding method and device based on selective multiplicative repetition, and uses selective multiplicative repetition coding technology to construct rate-compatible tail-biting convolutional codes. When the decoding capability and delay are equivalent, the encoding method proposed by the present invention has a lower block error rate at various code rates.

[0006] To achieve the above object, the present invention provides the following technical solutions:

[0007] In a first aspect, the present invention provides a rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition, comprising the steps of:

[0008] Obtaining the information sequence to be encoded;

[0009] Performing CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence;

[0010] The CRC redundant information sequence is periodically inserted into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence;

[0011] Perform tail-biting convolution coding according to the new redundant sequence to obtain a coding sequence;

[0012] Selective multiplicative repetitive coding is performed according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetitive coding sequence.

[0013] In a second aspect, the present invention provides a rate-compatible tail-biting convolutional code encoding device based on selective multiplicative repetition, comprising:

[0014] An information sequence acquisition module, which is used to obtain the information sequence to be encoded;

[0015] A CRC encoder, which is used to perform CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence;

[0016] A block-type conventional multiplexer, which is used to periodically insert the CRC redundant information sequence into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence;

[0017] A tail-biting convolutional encoder, which is used to perform tail-biting convolutional coding according to the new redundant sequence to obtain a coded sequence;

[0018] A selective multiplicative repeater is used to perform selective multiplicative repetitive coding according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetitive coding sequence.

[0019] In a third aspect, an embodiment of the present invention further provides an electronic device, including a processor and a memory;

[0020] The memory is used to store programs;

[0021] The processor executes the program to implement the method described above.

[0022] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, wherein the storage medium stores a program, and the program is executed by a processor to implement the method described above.

[0023] In a fifth aspect, an embodiment of the present invention further provides a computer program product or a computer program, the computer program product or the computer program including computer instructions, the computer instructions being stored in a computer-readable storage medium. A processor of a computer device can read the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the above method.

[0024] Compared with the prior art, the present invention has the following beneficial effects:

[0025] 1. The present invention has the advantages of simple coding, flexible structure, easy implementation, strong applicability, etc.

[0026] 2. Compared with the existing coding scheme, the present invention can obtain a lower block error rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0028] Figure 1 A flow chart of a rate-compatible tail-biting convolutional code encoding method according to an embodiment of the present invention;

[0029] Figure 2 This is a block diagram of rate-compatible tail-biting convolutional code encoding according to an embodiment of the present invention.

[0030] Figure 3 It is a detailed encoding block diagram of the block regular multiplexer module in the encoding block diagram of an embodiment of the present invention.

[0031] Figure 4 It is a detailed encoding block diagram of the selective multiplicative repetition module in the encoding block diagram of an embodiment of the present invention.

[0032] Figure 5 This is a performance diagram of Example 1-1 of the present invention.

[0033] Figure 6 1-2 is a performance diagram of embodiments 1-2 of the present invention.

[0034] Figure 7 1 is a performance diagram of embodiments 1-3 of the present invention. DETAILED DESCRIPTION

[0035] 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 application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0036] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations of the embodiments of the present invention are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0037] Example:

[0038] See also Figures 1 to 7 The embodiment of the present invention provides a rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition, which may specifically include the following steps:

[0039] Step 100: Obtain the information sequence to be encoded.

[0040] In this step, set the information sequence in Represents a binary finite field, and the length of the information sequence is k.

[0041] Step 200: Perform CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence.

[0042] In this step, the cyclic redundancy polynomial is set Performing CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain an intermediate redundant sequence p with a length of m;

[0043] After adding an intermediate redundant sequence p of length m to the end of the information sequence u, the length is k'=k+ The redundant sequence includes the information sequence and the CRC redundant information sequence, where l i Indicates the length of information selected as a complete symbol, Indicates the number of symbols. i The length of the information is used as a complete information symbol.

[0044] Step 300: Periodically insert the CRC redundant information sequence into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence.

[0045] In this step, information symbols involving CRC redundant information are periodically inserted into the information sequence u in units of symbols consisting of a preset number (l) of bits, to obtain a new redundant sequence Each symbol w i The length of i .

[0046] Step 400: Perform tail-biting convolutional coding on the new redundant sequence to obtain a coded sequence. In this step, the new redundant sequence w is subjected to tail-biting convolutional coding to obtain a length of The coding sequence Among them, the symbol c i Indicates w i go through The length of the coded symbol obtained after tail-biting convolutional coding is is the representation of the convolutional code, 1 represents the input length of the convolutional code, w represents the output length after convolution, and v represents the number of registers of the convolutional code generator minus 1. That is, after 1 bit of information is input into the convolutional code encoder with v+1 registers, the output convolutional code length is

[0047] Step 500: Perform selective multiplicative repetition coding according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetition coding sequence.

[0048] In this step, the step of obtaining the selectively repeated coding sequence may specifically include:

[0049] The preset target bit rate is Represents the number of symbols output after selective multiplicative repetition coding, represents the number of symbols before the selective multiplicative repetition coding, k is the length of the information sequence, n is the length of the selective repetition coding sequence; calculate the number of symbols that need to be multiplicatively repeated Set h to represent the number of symbols involved in CRC redundant information, the sequence of position indexes of symbols involved in CRC redundant information in w is represented by I, and the sequence of remaining position indexes is represented by Indicates; Set the number of times c can be completely repeated [x] means rounding x down.

[0050] All symbols of the coded sequence c are multiplicatively re-encoded H times. In order to achieve the preset target code rate R', additional repetitions are required. symbol, when , then randomly select from the coding sequence c The symbols whose position indexes are in I are selectively multiplicatively repeated; when In addition to selecting all symbols with position indexes in I from the coding sequence c, it is also necessary to randomly select all symbols with position indexes in P from the coding sequence c. symbols are multiplicatively repeated; a selectively repeated coding sequence is obtained Among them, the symbol c′ of the selectively repeated coding sequence c′ i It is based on In the random selection of independent multiplicative coefficients ρ, the symbol c of the encoding sequence c i conduct The multiplication operation on .

[0051] Through the method provided in this embodiment, for a k-length information sequence, after generating m-bit CRC redundancy, the selected The symbol composed of bit information is used as a unit, CRC related symbols are periodically inserted, CRC related symbols are selected to be periodically inserted into the original sequence, and element blocks related to CRC are selected in subsequent operations for selective multiplicative repetition coding.

[0052] For a k-input n-output Group code Where l is the length of the bit information that needs to be combined, for The output length of the convolutional code. The input is length The output is a block of elements c of length n, c' = ρc, where ρ is The use of such multiplication operations on finite multivariate fields can improve the anti-interference ability of the code.

[0053] The selected l size is any size, the number of l is any number, and the block code is an arbitrary block code, and the symbol composed of each l-length bit information is Any symbol in, after the encoder After each The symbol consisting of the long bit information is Any symbol in The multiplicative coefficient ρ selected in is any element except {0}.

[0054] Example 1-1:

[0055] Set the information sequence u length k = 41, the CRC encoder is 10th order, and the generating polynomial is 5D9. The selected segment length l i =3 target bit rate

[0056] The encoding method of the present invention comprises the following steps:

[0057] Step 1: Given an information sequence of length k Cyclic redundancy polynomial after CRC encoder Then an intermediate redundant sequence p of length m is generated. Among them (p0, p1, p2, ... p 10 ) is (10111101001), which is expressed in hexadecimal as 5D9.

[0058] Step 2: After adding CRC redundancy to the end of the information sequence u, the length is k'=l1+l2+…+l 17 =51 sequence, each l i =3 information as a complete information symbol to obtain l = {3, 3, ..., 3}. It is passed through a block conventional multiplexer, and the information symbols involving CRC redundant information are periodically inserted into the information sequence to obtain a new redundant sequence w = (W1, W2, ..., w 17 ), each symbol w i The length of i =3.

[0059] Step 3: Pass the new redundant sequence w through the (2, 1, 6) tail-biting convolutional encoder to obtain a length of n= The coding sequence c=(c1,c2,…,c 17 ).

[0060] Step 4: Determine the target code rate R' and input the coded sequence c into the selective multiplicative repeater. ( represents the number of symbols output after the selective multiplicative repeater), calculates the number of symbols that need to be multiplicatively repeated The sequence of position indices in w is I = {3, 7, 11, 16}, and the sequence of remaining position indices is P = {0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15}; That is, the coding sequence c can be completely repeated;

[0061] Step 5: First, randomly select 17 independent multiplicative coefficients ρ are randomly selected from the 17 symbols in c and are compared with each other. In order to achieve the target bit rate R', it is necessary to select additional repetitions symbol. First, select all symbols in c whose position index is within I, and then randomly select 3 symbols in c whose position index is within P for multiplicative repetition. In the random selection of independent multiplicative coefficients ρ, and the alternative symbol c′ i conduct The multiplication operation on gives c′ i =ρc i Finally, the selectively repeated coding sequence c′ is obtained after selective multiplicative repetition. i =(c′1,c′2,…c′ 41 ) to complete the encoding.

[0062] Figure 5 The performance graph of the rate-compatible tail-biting convolutional code based on selective multiplicative repetition in this example is given. To compare the performance, Figure 5 The performance of CA-Polar code and LET-Turbo code under the same code length and code rate under the same channel is also given. It can be seen from the figure that the rate-compatible tail-biting convolutional code based on selective multiplicative repetition proposed in this embodiment has a lower block error rate, and its performance is much better than LET-Turbo code, and about 0.5dB better than CA-Polar code.

[0063] Embodiment 1-2:

[0064] Set the information sequence u length k = 42, the CRC encoder to 10th order, and the generating polynomial to 71F. The selected segment length l i =4 target bit rate

[0065] The encoding method of the present invention comprises the following steps:

[0066] Step 1: Given an information sequence of length k Cyclic redundancy polynomial after CRC encoder Then an intermediate redundant sequence p of length m is generated. The generated sequence composed of (p0, p1, p2, ... p10) is (11100011111), which is 71F in hexadecimal.

[0067] Step 2: After adding CRC redundancy at the end of the information sequence u, the length is k'=l1+l2+…+l 13 =52 sequence, each l i= 4 information as a complete information symbol to obtain l = {4, 4, ..., 4}. It is passed through a block conventional multiplexer, and the information symbols involving CRC redundant information are periodically inserted into the information sequence to obtain a new redundant sequence w = (w1, w2, ..., w 13 ), each symbol w i The length of i =4.

[0068] Step 3: Pass the new redundant sequence w through the (2, 1, 6) tail-biting convolutional encoder to obtain a length of The coding sequence c=(c1,c2,…,c 13 ).

[0069] Step 4: Determine the target bit rate R' and input the coded sequence c into the selective multiplicative repeater. ( represents the number of symbols output after the selective multiplicative repeater), calculates the number of symbols that need to be multiplicatively repeated The sequence of position indices in w is I = {3, 7, 12}, and the sequence of remaining position indices is P = {0, 1, 2, 4, 5, 7, 8, 9, 10, 11}; That is, the coding sequence c can be completely repeated;

[0070] Step 5: First, randomly select 13 independent multiplicative coefficients ρ are randomly selected from the 13 symbols in c and are combined with the 13 symbols in c. Repeat the above steps three times. Then, in order to achieve the target bit rate R', you need to select additional repeat symbol. First, select all symbols in c whose position index is within I, and then randomly select 8 symbols in c whose position index is within P for multiplication repetition. In the random selection of independent multiplicative coefficients ρ, and the alternative symbol c i conduct The multiplication operation on gives c′ i =ρc i Finally, the selectively repeated coding sequence c'=(c'1, c'2, ... c') after selective multiplicative repetition is obtained. 63 ) to complete the encoding.

[0071] Figure 6 The performance graph of the rate-compatible tail-biting convolutional code based on selective multiplicative repetition in this example is given. In order to analyze the performance impact of selecting different segment lengths l, Figure 6 It also gives the choice of different l iThe performance comparison chart of the 4-bit time code is shown in Figure 1. As can be seen from the figure, the performance of the time code with l = 4 is about 0.5 dB better than that of the time code with l = 1. At the same time, it can also be known that choosing a suitable l can appropriately increase the performance, but when l increases to a certain extent, its performance gain is no longer significant.

[0072] Embodiment 1-3:

[0073] Set the information sequence u length k = 40, the CRC encoder to 10th order, and the generating polynomial to 48F. The selected segment length l i =2 target bit rate

[0074] The encoding method of the present invention comprises the following steps:

[0075] Step 1: Given an information sequence of length k Cyclic redundancy polynomial after CRC encoder Then an intermediate redundant sequence p of length m is generated. Among them (p0, p1, p2, ... p 10 ) is (10010001111), which is 48F in hexadecimal.

[0076] Step 2: After adding CRC redundancy to the end of the information sequence u, the length is k'=l1+l2+…+l 25 =50 sequence, each l i =2 information as a complete information symbol to obtain l = {2, 2, ..., 2}. It is passed through a block conventional multiplexer, and the information symbols involving CRC redundant information are periodically inserted into the information sequence to obtain a new redundant sequence w = (w1, w2, ..., w 25 ), each symbol w i The length of i =2.

[0077] Step 3: Pass the new redundant sequence w through the (2, 1, 6) tail-biting convolutional encoder to obtain a length of The coding sequence c=(c1,c2,…,c 25 ).

[0078] Step 4: Determine the target code rate R' and input the coded sequence c into the selective multiplicative repeater. ( represents the number of symbols output after the selective multiplicative repeater), calculates the number of symbols that need to be multiplicatively repeated The position index sequence in w is I = {9, 19, 29, 39, 49}, and the remaining position index sequence is P = {0, 1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48}; That is, the coding sequence c can be completely repeated;

[0079] Step 5: First, randomly select Randomly select 25 independent multiplicative coefficients ρ from the 25 symbols in c and perform Repeat the above steps once. Then, in order to achieve the target bit rate R', you need to select additional repeat symbol. First, select all symbols in c whose position index is within I, and then randomly select 5 symbols in c whose position index is within P for multiplicative repetition. In the random selection of independent multiplicative coefficients ρ, and the alternative symbol c i conduct The multiplication operation on gives c′ i =ρc i Finally, the selectively repeated coding sequence c'=(c'1, c'2, ... c') after selective multiplicative repetition is obtained. 60 ) to complete the encoding.

[0080] Figure 7 The performance graph of the rate-compatible tail-biting convolutional code based on selective multiplicative repetition in this example is given. In order to analyze the impact of selective multiplicative repetition, direct multiplicative repetition and bit repetition on performance, Figure 7 The performance of these three schemes is compared. As can be seen from the figure, the performance of selective multiplicative repetition is better than direct random multiplicative repetition and random bit repetition, and random multiplicative repetition is better than random bit repetition.

[0081] Example 2

[0082] Based on the same inventive concept, an embodiment of the present invention further provides a rate-compatible tail-biting convolutional code encoding device based on selective multiplicative repetition, comprising:

[0083] An information sequence acquisition module, which is used to acquire the information sequence to be encoded;

[0084] A CRC encoder, which is used to perform CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence;

[0085] A block-type conventional multiplexer, which is used to periodically insert the CRC redundant information sequence into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence;

[0086] A tail-biting convolutional encoder, which is used to perform tail-biting convolutional coding according to the new redundant sequence to obtain a coded sequence;

[0087] A selective multiplicative repeater is used to perform selective multiplicative repetitive coding according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetitive coding sequence.

[0088] Since the device is a device corresponding to the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition in an embodiment of the present invention, and the principle of solving the problem by the device is similar to that of the method, the implementation of the device can refer to the implementation process of the above-mentioned method embodiment, and the repeated parts will not be repeated.

[0089] Example 3

[0090] Based on the same inventive concept, an embodiment of the present invention also provides an electronic device, comprising a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set or an instruction set, and the at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by the processor to implement the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition as described above.

[0091] It is understood that the memory may include a random access memory (RAM) or a read-only memory (ROM). Optionally, the memory includes a non-transitory computer-readable storage medium. The memory may be used to store instructions, programs, codes, code sets, or instruction sets. The memory may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function, instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data created according to the use of the server, etc.

[0092] The processor may include one or more processing cores. The processor uses various interfaces and lines to connect the various parts of the entire server, and executes various functions of the server and processes data by running or executing instructions, programs, code sets or instruction sets stored in the memory, and calling data stored in the memory. Optionally, the processor can be implemented in at least one hardware form of digital signal processing (DSP), field programmable gate array (FPGA), and programmable logic array (PLA). The processor can integrate one or a combination of a central processing unit (CPU) and a modem. Among them, the CPU mainly processes the operating system and application programs; the modem is used to process wireless communications. It can be understood that the above-mentioned modem may not be integrated into the processor, but implemented separately through a chip.

[0093] Since the electronic device is an electronic device corresponding to the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition in an embodiment of the present invention, and the principle of solving the problem by the electronic device is similar to that of the method, the implementation of the electronic device can refer to the implementation process of the above-mentioned method embodiment, and the repeated parts will not be repeated.

[0094] Example 4

[0095] Based on the same inventive concept, an embodiment of the present invention also provides a computer-readable storage medium, in which at least one instruction, at least one program, a code set or an instruction set is stored. The at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by a processor to implement the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition as described above.

[0096] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, the storage medium including a read-only memory (ROM), a random access memory (RAM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), a one-time programmable read-only memory (OTPROM), an electronically erasable programmable read-only memory (EEPROM), a compact disc (CD-ROM) or other optical disc storage, magnetic disk storage, magnetic tape storage, or any other computer-readable medium that can be used to carry or store data.

[0097] Since the storage medium is the storage medium corresponding to the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition in an embodiment of the present invention, and the principle of solving the problem by the storage medium is similar to that of the method, the implementation of the storage medium can refer to the implementation process of the above-mentioned method embodiment, and the repeated parts will not be repeated.

[0098] Example 5

[0099] In some possible implementations, various aspects of the method of the embodiment of the present invention may also be implemented in the form of a program product, which includes a program code. When the program product is run on a computer device, the program code is used to enable the computer device to perform the steps of the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition according to various exemplary embodiments of the present application described above in this specification. Among them, the executable computer program code or "code" for executing various embodiments can be written in a high-level programming language such as C, C++, C#, Smalltalk, Java, JavaScript, Visual Basic, structured query language (e.g., Transact-SQL), Perl, or in various other programming languages.

[0100] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0101] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0102] The above embodiments are only for illustrating the technical concept and features of the present invention, and their purpose is to enable ordinary technicians in the field to understand the content of the present invention and implement it accordingly, and they cannot be used to limit the protection scope of the present invention. Any equivalent changes or modifications made based on the essence of the content of the present invention should be included in the protection scope of the present invention.

Claims

1. A rate-compatible tail-biting convolutional coding method based on selective multiplicative repetition, characterized in that: Includes steps: Obtaining the information sequence to be encoded; Performing CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence; The CRC redundant information sequence is periodically inserted into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence; Perform tail-biting convolution coding according to the new redundant sequence to obtain a coding sequence; Selective multiplicative repetitive coding is performed according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetitive coding sequence.

2. The selective multiplicative repetition-based rate-compatible tail-biting convolutional code encoding method according to claim 1, characterized in that: The selective multiplicative repetitive coding is performed according to the preset target bit rate, the coding sequence and the randomly determined multiplicative coefficient to obtain the selective repetitive coding sequence, specifically comprising the steps of: The preset target bit rate is Represents the number of symbols output after selective multiplicative repetition coding, represents the number of symbols before selective multiplicative repetition coding, k is the length of the information sequence, and n is the length of the coding sequence; Calculate the number of symbols that need to be repeated multiplicatively Set h to represent the number of symbols involved in CRC redundant information, the sequence of position indexes of symbols involved in CRC redundant information in w is represented by I, and the sequence of remaining position indexes is represented by Indicates; Set the number of times the coding sequence c can be completely repeated The symbol [] means rounding down the parameter within the symbol; All symbols of the coding sequence c are multiplicatively re-encoded H times. In order to achieve the preset target code rate R′, additional repetitions are required. symbols, when , then randomly select from the coding sequence c The symbols whose position indexes are in I are selectively multiplicatively repeated; when In addition to selecting all symbols with position indexes in I from the coding sequence c, it is also necessary to randomly select all symbols with position indexes in P from the coding sequence c. The symbols are multiplicatively repeated; Selectively repeat coding sequences Among them, the symbol c′ of the selectively repeated coding sequence c′ i It is based on In the random selection of independent multiplicative coefficients ρ, the symbol c of the encoding sequence c i conduct The multiplication operation on .

3. A rate-compatible tail-biting convolutional code encoding device based on selective multiplicative repetition, characterized in that: include: An information sequence acquirer, which is used to acquire an information sequence to be encoded; A CRC encoder, which is used to perform CRC encoding on the information sequence using a cyclic redundancy polynomial to obtain a redundant sequence, wherein the redundant sequence includes an information sequence and a CRC redundant information sequence; A block-type conventional multiplexer, which is used to periodically insert the CRC redundant information sequence into the information sequence in units of symbols consisting of a preset number of bits to obtain a new redundant sequence; A tail-biting convolutional encoder, which is used to perform tail-biting convolutional coding according to the new redundant sequence to obtain a coded sequence; A selective multiplicative repeater is used to perform selective multiplicative repetitive coding according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetitive coding sequence.

4. The rate-compatible tail-biting convolutional code encoding device based on selective multiplicative repetition according to claim 3, characterized in that: In the selective multiplicative repeater, the selective multiplicative repetition coding is performed according to a preset target code rate, the coding sequence and a randomly determined multiplicative coefficient to obtain a selective repetition coding sequence, specifically including: The preset target bit rate is Represents the number of symbols output after selective multiplicative repetition coding, represents the number of symbols before the selective multiplicative repetition coding, k is the length of the information sequence, and n is the length of the selective repetition coding sequence; Calculate the number of symbols that need to be repeated multiplicatively Set h to represent the number of symbols involved in CRC redundant information, the sequence of position indexes of symbols involved in CRC redundant information in w is represented by I, and the sequence of remaining position indexes is represented by Indicates; Set the number of times c can be completely repeated [x] means rounding down x; All symbols of the coding sequence c are multiplicatively re-encoded H times. In order to achieve the preset target code rate R′, additional repetitions are required. symbols, when , then randomly select from the coding sequence c The symbols whose position indexes are in I are selectively multiplicatively repeated; when In addition to selecting all symbols with position indexes in I from the coding sequence c, it is also necessary to randomly select all symbols with position indexes in P from the coding sequence c. The symbols are multiplicatively repeated; Selectively repeat coding sequences Among them, the symbol c′ of the selectively repeated coding sequence c′ i It is based on In the random selection of independent multiplicative coefficients ρ, the symbol c of the encoding sequence c i conduct The multiplication operation on .

5. An electronic device, characterized in that: including a processor and a memory; The memory is used to store programs; The processor executes the program to implement the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition as described in claim 1 or 2.

6. A computer-readable storage medium, characterized in that: The storage medium stores a program, and the program is executed by a processor to implement the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition as claimed in claim 1 or 2.

7. A computer program product, characterized in that The computer program product includes computer instructions, which are stored in a computer-readable storage medium. A processor of a computer device can read the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the rate-compatible tail-biting convolutional code encoding method based on selective multiplicative repetition as described in claim 1 or 2.

Images