Encoding / decoding method, communication apparatus, and storage medium
By using T component code generator polynomials for convolutional coding, the problem of high coding complexity in short packet channels is solved, achieving low-complexity and highly robust data communication.
Patent Information
- Application Number
- PCT/CN2024/076003
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-22
- Filing Date
- 2024-02-05
- Publication Date
- 2024-11-28
AI Technical Summary
Existing technologies have high complexity in short packet channel coding, making it difficult to meet the communication requirements of ultra-low latency and ultra-high reliability.
The information bit sequence is convolutionally encoded using T component code generator polynomials to reduce encoding complexity. The encoding process is simplified by reducing the number of XOR gates and the weight of the component codes.
It effectively reduces the complexity of convolutional coding, improves the robustness of data communication, and meets the communication requirements of ultra-low latency and ultra-high reliability.
Smart Images

Figure CN2024076003_28112024_PF_FP_ABST
Abstract
Description
Coding and decoding method, communication device and storage medium
[0001] This disclosure claims priority to Chinese patent application No. 202310583794.8, filed on May 22, 2023, the entire contents of which are incorporated herein by reference. Technical Field
[0002] The present application relates to the field of communication technology, and in particular to a coding and decoding method, a communication device, and a storage medium. Background Art
[0003] With the rapid development of technologies such as big data, cloud computing, and latency-sensitive networks, the number of user devices in wireless communication networks has exploded. Wireless communication networks will carry diverse applications and massive amounts of data, placing high demands on data transmission rates, throughput, reliability, and latency. Currently, with the development of intelligent transportation, intelligent industrial control, and smart logistics, the demand for ultra-low latency and ultra-high reliability communications is becoming increasingly urgent, requiring the successful transmission and reception of short data packets in extremely short periods of time.
[0004] However, the channel coding of short packets is relatively complex at present. How to further reduce the complexity of channel coding and decoding of short packets is an urgent problem to be solved in the industry.
[0005] Summary of the Invention
[0006] The present application provides a coding and decoding method, a communication device, and a storage medium for reducing the complexity of convolutional coding.
[0007] In order to achieve the above objectives, this application adopts the following technical solutions:
[0008] In a first aspect, a coding method is provided, the method specifically comprising:
[0009] obtaining an information bit sequence;
[0010] Performing convolution encoding on the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence, where T is an integer greater than 1;
[0011] All or part of the bits in the coded bit sequence are sent.
[0012] In a second aspect, a decoding method is provided, the method comprising:
[0013] receiving all or part of the bits in the coded bit sequence;
[0014] All or part of the bits in the coded bit sequence are convolutionally decoded according to the T component code generating polynomials to obtain an information bit sequence.
[0015] According to a third aspect, an encoding device is provided, comprising:
[0016] An acquisition module, used for acquiring an information bit sequence;
[0017] a processing module, configured to perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence, where T is an integer greater than 1;
[0018] The sending module is configured to send all or part of the bits in the coded bit sequence.
[0019] In a fourth aspect, a decoding device is provided, located at a second node, including:
[0020] A receiving module, configured to receive all or part of the bits in the coded bit sequence;
[0021] The processing module is used to perform convolution decoding on all or part of the bits in the coded bit sequence according to the T component code generating polynomials to obtain an information bit sequence.
[0022] In a fifth aspect, a communication device is provided, comprising: a processor and a memory; the memory stores instructions executable by the processor; when the processor is configured to execute the instructions, the communication device implements any one of the methods provided in the first or second aspect above.
[0023] In a sixth aspect, a computer-readable storage medium is provided, which stores computer instructions. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first or second aspect above.
[0024] In a seventh aspect, a computer program product comprising computer instructions is provided, which, when executed on a computer, enables the computer to execute any one of the methods provided in the first or second aspect.
[0025] Based on the above embodiment, the method can perform convolution encoding on an information bit sequence based on a preset component code generating polynomial, thereby obtaining a bit sequence to be transmitted. The present application also provides multiple possible implementations of the preset component code generating polynomial under different convolutional coding constraint lengths. Furthermore, since the number of non-zero coefficients in the component code generating polynomial provided by the present application is relatively small, by using the component code generating polynomial provided in the embodiment of the present application for convolution encoding, the weight of the component code is reduced, and the number of XOR gates is also reduced, which can reduce the complexity of the convolutional coding and increase the robustness of data communication. BRIEF DESCRIPTION OF THE DRAWINGS
[0026] The accompanying drawings are used to provide a further understanding of the technical solution of the present invention and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present invention and do not constitute a limitation on the technical solution of the present invention.
[0027] FIG1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;
[0028] FIG2 is a schematic diagram of a flow chart of an encoding method provided in an embodiment of the present application;
[0029] FIG3 is a schematic diagram of a convolutional coding process provided by an embodiment of the present application;
[0030] FIG4 is a schematic diagram of another convolutional encoding process provided in an embodiment of the present application;
[0031] FIG5 is a schematic diagram of a flow chart of a decoding method provided in an embodiment of the present application;
[0032] FIG6 is a schematic diagram of the composition of an encoding device provided in an embodiment of the present application;
[0033] FIG7 is a schematic diagram of the composition of a decoding device provided in an embodiment of the present application;
[0034] FIG8 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0035] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.
[0036] In the description of this application, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "a plurality" means two or more. Words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not limit them to be necessarily different.
[0037] It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this application as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.
[0038] In wireless communication systems, the transmitter performs channel coding on the data to be transmitted to obtain a coded bit sequence. The coded bit sequence is then mapped into constellation modulation symbols and transmitted to the receiver. Data transmission errors may occur in the data transmission channel due to factors such as multipath, noise, and interference. The transmitter uses channel coding to add redundant information to the data to be transmitted. The receiver can use this redundant information to recover the original data, thereby eliminating the distortion introduced during transmission. The receiver then needs to perform channel decoding on the received constellation modulation symbols to recover the transmitted data.
[0039] Currently, the more commonly used channel coding methods include low-density parity-check coding, polarization coding, and convolutional coding. Low-density parity-check coding is defined by a sparse (or low-density) parity-check matrix. Decoding performance can be improved through iterative decoding, such as using belief transfer decoding. The encoding end needs to store the parity check matrix and perform a large number of XOR operations, which is relatively complex. Polarization coding is a linear block code proposed based on channel polarization theory. Theoretical proof shows that it can reach the Shannon limit when the code length is infinite. The serial cancellation list (SCL) decoding algorithm is generally used. The encoding end still needs to perform a large number of XOR operations and rate matching operations, which is slightly more complex. Convolutional coding groups input information bits into information packets consisting of one or more bits. The coded output bits of each information packet are related not only to the information bits of the current packet, but also to the information bits of other packets at the previous time.
[0040] Therefore, to further reduce the complexity of channel coding and decoding, an embodiment of the present application provides a coding method, which specifically includes: first obtaining an information bit sequence, then performing convolution coding on the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence, where T is an integer greater than 1, and then transmitting all or part of the bits in the coded bit sequence. In this way, the complexity of convolution coding can be reduced.
[0041] The method provided in the embodiment of the present application can be applied to various communication systems. For example, the communication system can be a long term evolution (LTE) system, a fifth generation (5G) communication system, a Wi-Fi system, a communication system related to the third generation partnership project (3GPP), a future evolutionary communication system (such as a sixth generation (6G) communication system, etc.), or a system that integrates multiple systems, etc., without limitation. The following describes the method provided in the embodiment of the present application by taking the communication system 100 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided in this application.
[0042] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application. As shown in Figure 1 , communication system 100 may include one or more network devices and one or more terminal devices. As shown in Figure 1 , communication system 100 may include network device 110, terminal device 120, terminal device 130, terminal device 140, and core network 150.
[0043] The network device 110 may provide communication services for the terminal device 120 , the terminal device 130 , and the terminal device 140 , and the network device 110 may also communicate with the core network 150 .
[0044] In some embodiments, the core network may provide access authorization, user authentication, Internet Protocol (IP) connectivity, tracking, and other access, routing, or mobility management functions. The core network may be an access and mobility management function (AMF) entity, having functions such as access control, mobility management, attachment and detachment, and gateway selection. Alternatively, the core network device may be a user plane function (UPF) entity, having functions such as data routing / forwarding and Quality of Service (QoS) flow processing. It should be noted that the core network device may also be other core network devices, and this application does not specifically limit this.
[0045] In some embodiments, network devices can be used to implement functions such as resource scheduling, wireless resource management, and wireless access control for terminal devices. Specifically, the network device can be any of a base transceiver, a wireless base station, a wireless transceiver, a small base station, a wireless access point, a transmission receive point (TRP), a transmission point (TP), an evolved Node B (eNB), a Home Node B, a Home evolved Node B, a reader, and some other access node. In some embodiments, the communication system 100 may also include different types of base stations, such as macrocell base stations and / or small cell base stations.
[0046] Terminal devices may also be referred to as terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices may be Internet of Things (IoT) devices, used to collect various information and then perform forward error correction coding on the data before sending it to a base station. Terminal devices may also be mobile devices such as mobile phones, tablet computers, computers with wireless transceiver capabilities, cars, and trams. Furthermore, terminal devices may be fixed or mobile. Various types of terminal devices may also include or be referred to by those skilled in the art as mobile stations, user stations, mobile units, user units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile user stations, access terminals, mobile terminals, wireless terminals, remote terminals, handheld devices, user agents, mobile clients, clients, passive tags, or some other possible devices. Furthermore, various types of UEs may also be cellular phones, personal digital assistants (PDAs), wireless modems, wireless communication devices, handheld devices, tablet computers, laptop computers, cordless phones, wireless local loop (WLL) stations, etc. Various types of UEs can communicate with various types of base stations and network devices (including macro eNBs, small cell eNBs, relay base stations, etc.) The wireless communication system 100 may also include an IoT system or be part of an IoT system.
[0047] It should be noted that FIG1 is only an exemplary framework diagram, and the number of nodes and the names of the devices included in FIG1 are not limited. In addition to the functional nodes shown in FIG1 , the communication system may also include other nodes.
[0048] It should be noted that the communication system shown in Figure 1 is only for the purpose of more clearly illustrating the technical solution of the present application and does not constitute a limitation of the present application. A person skilled in the art will know that with the evolution of network architecture and the emergence of new business scenarios, the technical solution provided by the present application is also applicable to similar technical problems.
[0049] The embodiments provided in this application are described in detail below with reference to the accompanying drawings.
[0050] As shown in FIG2 , an embodiment of the present application provides an encoding method, which includes the following steps:
[0051] S101. Obtain an information bit sequence.
[0052] The information bit sequence can be a sequence of information bits to be sent by the transmitter, that is, a sequence of bits to be encoded by the transmitter, and the information bit refers to a bit used to carry information. For example, the information bit sequence can be represented as b0, b1, b2, b3, ..., b K-1 , K is the length of the information bit sequence, and K is an integer greater than 0.
[0053] Taking the communication system 100 shown in FIG1 as an example, a transmitting end can be a terminal device or a network device in the communication system 100. During communication, if a network device sends data to a terminal device and the terminal device receives the data sent by the network device, the network device can be called a transmitting end. Correspondingly, the terminal device can be called a receiving end.
[0054] S102. Perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence.
[0055] Wherein, T is an integer greater than 1. Exemplarily, the value of T includes 2, 3, 4, 6, 8, 10 or 12.
[0056] In some embodiments, convolutional coding is implemented by a plurality of shift registers and a plurality of XOR gates, wherein every two adjacent shift registers in the plurality of shift registers are connected in series. Further, any component code output bit sequence is obtained by performing XOR operation on the input bits and bits of a portion of the shift registers.
[0057] Exemplarily, the convolution encoding process based on multiple shift registers and multiple XOR gates is described below:
[0058] During convolutional coding, at clock tick 0, the transmitter encodes the T component code generator polynomials, the data stored in the shift register, and the 0th bit of the information bit sequence (i.e., the current input bit) to generate T bits. Each shift register stores only one bit.
[0059] During the first clock tick, the bit data of the 0th shift register is stored in the 1st shift register, the bit data of the 1st shift register is stored in the 2nd shift register, and so on, the bit data of the m-2th shift register is stored in the m-1th shift register, and the 0th bit of the information bit sequence is stored in the 0th shift register. Furthermore, the transmitter can perform encoding based on the adjusted stored data in the shift register, the T component code generating polynomials, and the first bit of the information bit sequence to obtain T bits, and can also use the T bits as the output result of the first clock tick.
[0060] Taking the encoding operation of the first clock beat as an example, the encoding operation is performed in the second, third, fourth, ... clock beats in sequence until the K-1th clock beat. Here, K is the length of the information bit sequence, and a coded bit sequence of length K*T is obtained.
[0061] In some embodiments, the number of shift registers is determined based on the highest power of the T component code generator polynomials. For example, if the highest power of the component code generator polynomial is equal to 6, the number of shift registers is equal to 6.
[0062] In some embodiments, the number of XOR gates is determined based on the number of coefficients of the T component code generator polynomials. It should be understood that the greater the number of coefficients of the T component code generator polynomials, the greater the number of XOR gates, thereby increasing the complexity of the convolutional encoder. Correspondingly, the fewer the number of coefficients of the T component code generator polynomials, the fewer the number of XOR gates, thereby decreasing the complexity of the convolutional encoder.
[0063] In some embodiments, the weight of a component code is determined based on the number of "1"s in the component code generator vector, i.e., the number of non-zero coefficients in the T component code generator polynomials. Furthermore, the greater the weight of the component code, the higher the complexity of the convolutional encoder. The smaller the weight of the component code, the lower the complexity of the convolutional encoder.
[0064] In some embodiments, the convolutional coding constraint length is determined based on the highest power of the polynomial in the T component code generator polynomials. For example, the convolutional coding constraint length can be the sum of the highest power of the polynomial in the T component code generator polynomials and 1.
[0065] In some embodiments, the convolutional coding constraint length may be at least one of the following: 5, 6, 7, 8, 9, 10, and 11. In one example, the convolutional coding constraint length is 7 and 9. In another example, the convolutional coding constraint length is 5 and 9. In yet another example, the convolutional coding constraint length is 7 and 11. In yet another example, the convolutional coding constraint length is 7, 9, and 11.
[0066] In one possible implementation, the transmitter may perform convolution encoding on the information bit sequence based on the T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials. Furthermore, all or part of the T component code bit sequences may be interleaved to obtain a coded bit sequence.
[0067] In another possible implementation, the transmitter may perform convolution encoding on the information bit sequence based on T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials. Sub-block interleaving is then performed on the i-th component code bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T. The coded bit sequence is determined based on the sub-block interleaved output sequence and the other component code bit sequences in the T component code bit sequences except the i-th component code bit sequence. In some embodiments, the value of i is determined based on one or more of the following: the number of component codes, the code rate, the total number of transmitted bits, the number of resources, the modulation order, and the length of the information bit sequence.
[0068] Exemplarily, this implementation can be specifically implemented as the following steps S1-S4:
[0069] S1. Perform convolution encoding on the input information bit sequence according to T component code generating polynomials to obtain T component code output bit sequences.
[0070] The length of each component code output bit sequence is equal to K. And the information bit sequence can be expressed as b0, b1, b2, b3, ..., b K-1 , where K is the length of the information bit sequence.
[0071] S2. Perform sub-block interleaving on the i-th component code bit sequence to obtain a sub-block interleaved output sequence.
[0072] Wherein, i is a non-negative integer less than T. The value of i is determined according to one or more of the following: the number of component codes, the length of the component code output bit sequence, the code rate, the total number of transmitted bits, the number of resources, the modulation order, and the length of the information bit sequence. Exemplarily, the i is determined by the following parameters: the number of component codes and the code rate. Specifically, the i can be equal to mod(floor(1 / R),T), where R is the code rate, R is a real number greater than 0, T is the number of component codes, and T is a positive integer. Exemplarily, the i is determined by the following parameters: the number of component codes, the length of the component code output bit sequence, and the total number of transmitted bits. Specifically, the i can be equal to mod(floor(E / M),T), where E is the total number of transmitted bits, E is a positive integer, M is the length of the component code output bit sequence, M is a positive integer, T is the number of component codes, and T is a positive integer.
[0073] In one example, the ith component code output bit sequence is subjected to sub-block interleaving. Assume that the ith component code output bit sequence input to the sub-block interleaving is The length is K. In some embodiments, the sub-block interleaving is implemented using a matrix interleaver, where the number of columns of the matrix block is equal to C=32, and the number of rows of the matrix block is determined by a parameter K. In some embodiments, the number of rows R of the matrix block is determined as follows: the minimum integer that satisfies the following inequality is the number of rows (R×C)≥K.
[0074] For example, if (R×C)≥K, then the required filling quantity is L F =(R×C)-K NULL bits. After filling the NULL bits, the sequence y can be obtained, where the head of y is the filled NULL bits and the tail is the output sequence of the i-th component code, which is expressed as y k = <null>for k=0,1,…,L F -1, and Where k = 0, 1,…, K-1.
[0075] Then, the sequence y is written into the sub-block interleaved matrix block in row order. The sub-block interleaved matrix block is permuted according to the column permutation pattern P = [1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31, 0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30]. The jth column of the permuted matrix block corresponds to the P(j)th column of the original matrix block, where j is 0, 1, 2, ..., 31. The permuted matrix, which has R rows and C columns, is read sequentially starting from column 0. Any NULL bits are skipped to obtain the sub-block interleaved output sequence corresponding to the i-th component code, whose length is K.
[0076] S3. Combine the component code output bit sequences of the 0th, 1st, …, (i-1), (i+1), …, (T-1)th and the sub-block interleaved output sequence of the i-th component code into a total bit sequence (i.e., a coded bit sequence), where the length of the total bit sequence is equal to T*K.
[0077] Exemplarily, the component code output bit sequences of 0, 1, ..., (i-1), (i+1), ..., (T-1) and the sub-block interleaved output sequence of the i-th component code are combined into a total bit sequence, and the length of the total bit sequence is equal to T*K. The t*Kth bit to the (t+1)*K-1th bit in the total bit sequence are composed of the t-th component code output bit sequence, where t is a non-negative integer less than T and t is not equal to i; and if t is equal to i, the t*Kth bit to the (t+1)*K-1th bit in the total bit sequence are composed of the sub-block interleaved output sequence of the i-th component code.
[0078] It should be noted that in this step, sub-block interleaving is not required for the t-th component code output bit sequence, which can also reduce the interleaving of convolutional coding and reduce the complexity of coding.
[0079] S4. Perform bit selection on the coded bit sequence to obtain a to-be-sent bit sequence, and send the to-be-sent bit sequence.
[0080] The bit sequence to be sent includes all or part of the bits in the coded bit sequence.
[0081] Exemplarily, bit selection is performed on the coded bit sequence to obtain the bit sequence to be sent, wherein cyclic selection is performed starting from the 0th bit in the total bit sequence. If the last bit is selected, selection continues from the first bit. If the required number of bits is obtained, selection stops.
[0082] In some embodiments, the T component code generating polynomials can be determined from a preset component code generating polynomial group. Furthermore, in some embodiments, all of the T component code generating polynomials can form another preset component code generating polynomial group, i.e., all of the T component code generating polynomials in the preset component code generating polynomial group are used for convolution encoding. Several possible implementations of the preset component code generating polynomial group are shown below:
[0083] Implementation method 1: The constraint length of the convolutional coding is 7. In this case, the number of shift registers required can be 7-1=6, and the highest power of the preset component code generating polynomial group is 6. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 ; g2(D)=1+D 1 +D 2 +D 4 +D 6 ; g3(D)=1+D 2 +D 5 +D 6 .
[0084] The octal numbers corresponding to the above four component code generating polynomials are 133, 171, 165 and 123 respectively. When binary representation is adopted, the four component code generating vectors are: {1,0,1,1,0,1,1}, {1,1,1,1,0,0,1}, {1,1,1,0,1,0,1} and {1,0,1,0,0,1,1}. It should be noted that in the binary representation of the component code generating vector, the last digit of each generating vector corresponds to the high-order power of the component code generating polynomial, and the first digit corresponds to the low-order power of the component code generating polynomial. Therefore, the corresponding binary representation of the component code generating vector can be determined based on the corresponding coefficients in the component code generating polynomial. It's important to note that the three representations used in this article for convolutional coding—component code generator polynomials, binary representation of component code generator vectors, and octal representation of component code generator polynomials—are completely equivalent. Any component code generator polynomial has a corresponding binary representation of component code generator vectors and an octal representation of component code generator polynomials. Therefore, when describing convolutional coding, you can use just one of these representations. For example, you can use just the octal representation of the component code generator polynomial, just the component code generator polynomial, or just the binary representation of the component code generator vectors.
[0085] In some embodiments, the weight of the four component codes derived based on the component code generator polynomials is equal to 19. The component code weight refers to the number of "1"s in the four component code generator vectors. Generally speaking, the number of "1"s in the generator vector is proportional to the number of required XOR gates. That is, a greater number of "1"s requires more XOR gates and increases complexity. For the same performance, a fewer "1"s in the generator vector leads to a more favorable hardware implementation, i.e., a simpler one.
[0086] If the information bit sequence is b0,b1,b2,b3,…,b K-1 The convolutional coding process is shown in Figure 3. The number of shift registers passed, that is, the number of delayed clock beats, can be determined based on the power of "D" in the component code generator polynomial. For example, g0(D)=1+D 2 +D 3 +D 5 +D 6 The output bits of the component code corresponding to the generator polynomial are the result of XORing the undelayed bit (1 information bit), the output of the second shift register (after two delays, corresponding to shift register S1), the output of the third shift register (after three delays, corresponding to shift register S2), the output of the fifth shift register (after five delays, corresponding to shift register S4), and the output of the sixth shift register (after six delays, corresponding to shift register S5). Similarly, g1(D) = 1 + D 1 +D 2 +D 3 +D 6 The output bits of the component code corresponding to the generating polynomial are the result of exclusive-ORing the no-delay bit (1 information bit), the output of the first shift register (after 1 delay, corresponding to shift register S0), the output of the second shift register (after 2 delays, corresponding to shift register S1), the output of the third shift register (after 3 delays, corresponding to shift register S2), and the output of the sixth shift register (after 6 delays, corresponding to shift register S5).
[0087] In one example, the preset component code generating polynomial group includes the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 ; g2(D)=1+D 1 +D 2 +D 4 +D 6 ; g3(D)=1+D 2 +D 5 +D 6 ; The corresponding octal code generating polynomials are: 133, 171, 165, 123. Furthermore, the component code output bit sequences corresponding to the above four component code generating polynomials are: C (0) 、C (1) 、C (2) and C (3) Among them, based on octal numbers, the component code output bit sequence C (0) The octal number of the component code generator polynomial is g0=133, and the component code output bit sequence C (1) The octal number of the component code generator polynomial is g1=171, and the component code output bit sequence C (2) The octal number corresponding to the component code generator polynomial is g2=165, and the component code output bit sequence C (3) The octal number corresponding to the component code generator polynomial is g3=123.
[0088] In some embodiments, the convolutional coding method may be tail-biting convolutional code (TBCC). Thus, the initial values of the six shift registers in FIG3 may be equal to the values of the last six bits of the information bit sequence to ensure that the first and last states of the convolutional coding are the same.
[0089] For example, the shift register includes S0, S1, S2, S3, S4 and S5, and its initial value is set to s i =b( K-1-i ), i = 0, 1, ..., 5. The output corresponding to the i-th component code is C (i) , where i = 0, 1, ..., T-1, that is, the output bit sequence corresponding to the input k bit is expressed as Where k = 0, 1, ..., K-1. For example, when the code rate used for convolutional coding is 1 / 2, encoding using the component code generating polynomials g0(D) and g1(D) can generate an output bit sequence of two component codes, in which case T = 2. When the code rate used is 1 / 4, encoding using the component code generating polynomials g0(D), g1(D), g2(D), and g3(D) can generate an output bit sequence of four component codes, in which case T = 4.
[0090] Furthermore, as shown in FIG4 , the obtained component code output bit sequence can be converted into a parallel-serial sequence to obtain the output bit sequence corresponding to the kth bit in the information bit sequence. The length is T bits. For example, the coded bit sequence obtained after convolution coding the entire information bit sequence can be expressed as d j , j = 0, 1, ..., T × K-1. In one example, it can be implemented according to the following pseudo code:
[0091] Implementation method 2: The constraint length of the convolutional coding is 7. In this case, the number of shift registers required can be 7-1=6. The highest power of the preset component code generating polynomial group is 6. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 2 +D 3 +D 4 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ; g6(D)=1+D 2 +D 3 +D 4 +D 6 ; g7(D)=1+D 1 +D 4 +D 6 ; g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ; g9(D)=1+D 2 +D 3 +D 4 +D 6 ; g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ; g 11 (D)=1+D 2 +D 3 +D 4 +D 6 。
[0092] The octal numbers corresponding to the above component code generating polynomials are 155, 117, 127, 171, 135, 173, 135, 145, 157, 135, 117, and 135 respectively. When binary representation is used, the component code generation vectors are: {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1}, {1,0,1,0,1,1,1}, {1,1,1,1,0,0,1}, {1,0,1,1,1,0,1,1}, {1,1,1,1,0,1,1}, {1,0,1,1,1,0,1}, {1,1,0,0,1,0,1}, {1,1,0,1,1,1,1}, {1,0,1,1,1,0,1}, {1,0,1,1,1,0,1}, {1,0,0,1,1,1,1} and {1,0,1,1,1,0,1}.
[0093] Furthermore, the transmitting end may determine T component code generator polynomials for convolutional coding from the above component code generator polynomial group, where T may be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0094] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials of the aforementioned 12 generator polynomials. The value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0095] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 and g1(D)=1+D 3 +D 4 +D 5 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0096] In another example, convolution coding uses at least three of the above 12 generating polynomials to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 g1(D)=1+D 3 +D 4 +D 5 +D 6 And g2(D)=1+D 2 +D 4 +D 5 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0097] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 g1(D)=1+D 3 +D 4 +D 5 +D 6 g2(D)=1+D 2 +D 4 +D 5 +D 6 And g3(D)=1+D 1 +D 2 +D 3 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0098] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 g1(D)=1+D 3 +D 4 +D 5 +D 6 g2(D)=1+D 2 +D 4 +D 5 +D 6 g3(D)=1+D 1 +D 2 +D 3 +D 6 g4(D)=1+D 2 +D 3 +D 4 +D 6 And g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0099] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 g1(D)=1+D 3 +D 4 +D 5 +D 6 g2(D)=1+D 2 +D 4 +D 5 +D 6 g3(D)=1+D 1 +D 2 +D 3 +D 6 g4(D)=1+D 2 +D 3 +D 4 +D 6 g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 g6(D)=1+D 2 +D 3 +D 4 +D 6 And g7(D)=1+D 1 +D 4 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0100] In some embodiments, the T component code generating polynomials used in the convolutional coding further include at least one of the following: 1+D 1 +D 3 +D 4 +D 6 、 1+D 2 +D 4 +D 5 +D 6 and 1+D 1 +D 4 +D 6 The octal numbers corresponding to the component code generator polynomials are 155, 127, and 145. When expressed in binary, the component code generator vectors are {1,1,0,1,1,0,1}, {1,0,1,0,1,1,1}, and {1,1,0,0,1,0,1}.
[0101] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0102] Implementation 3: The constraint length of the convolutional coding is 7. In this case, the number of shift registers required is 7-1=6. The highest power of the preset component code generating polynomial group is 6. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ; g1(D)=1+D 2 +D 3 +D 5 +D 6 ; g2(D)=1+D 1 +D 4 +D 6 ; g3(D)=1+D 3 +D 4 +D 5 +D 6 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 ; g5(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 ; g7(D)=1+D 1 +D 3 +D 6 ; g8(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ; g9(D)=1+D 1 +D 3 +D 4 +D 6 ; g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ; g 11 (D)=1+D 2 +D 4 +D 5 +D 6 .
[0103] The octal numbers corresponding to the above component code generating polynomials are 175, 133, 145, 117, 127, 157, 165, 151, 137, 155, 117 and 127 respectively. When binary representation is used, the component code generation vectors are: {1,1,1,1,1,0,1}, {1,0,1,1,0,1,1}, {1,1,0,0,1,0,1}, {1,0,0,1,1,1,1}, {1,0,1,0,1,1,1}, {1,1,0,1,1,1,1}, {1,1,1,0,1,0,1}, {1,1,0,1,0,0,1}, {1,0,1,1,1,1,1}, {1,1,0,1,1,0,1}, {1,0,1,1,1,1}, {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1}, and {1,0,1,0,1,1,1}.
[0104] Furthermore, the transmitting end may determine T component code generator polynomials for convolutional coding from the above component code generator polynomial group, where T may be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0105] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0106] Exemplarily, the transmitting end may use 2, 3, 4, 5, 6, 8, 10 or 12 of the above 12 component code generating polynomials to perform convolution coding to obtain a coded bit sequence. For example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 2 +D 3 +D 4 +D 6 and g1(D)=1+D 2 +D 3 +D 5 +D 6 Convolutional coding is performed to obtain a coded bit sequence, which will not be listed one by one.
[0107] In some embodiments, the T component code generating polynomials used in the convolutional coding further include at least one of the following: 1+D 1 +D 2 +D 3 +D 4 +D 6 , 1+D 1 +D 4 +D 6 , 1+D 2 +D 4 +D 5 +D 6 , 1+D 1 +D 3 +D 6 , 1+D 2 +D 3 +D 4 +D 5 +D 6 , 1+D 1 +D 3 +D 4 +D 6 and 1+D 2 +D 4 +D 5 +D 6 The octal numbers corresponding to the component code generator polynomials are 175, 145, 127, 151, 137, 155, and 127, respectively. When expressed in binary, the component code generator vectors are {1,1,1,1,1,0,1}, {1,1,0,0,1,0,1}, {1,0,1,0,1,1,1}, {1,1,0,1,0,0,1}, {1,0,1,1,1,1,1}, {1,1,0,1,1,0,1}, and {1,0,1,0,1, 1,1}.
[0108] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0109] Implementation 4: The constraint length of the convolutional coding is 7. In this case, the number of shift registers required is 7-1=6. The highest power of the preset component code generating polynomial group is 6. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 ; g7(D)=1+D 3 +D 5 +D 6 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ; g9(D)=1+D 1 +D 3 +D 4 +D 6 ; g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ; g 11 (D)=1+D 2 +D 4 +D 5 +D 6 。
[0110] The octal numbers corresponding to the above component code generating polynomials are 155, 137, 123, 171, 127, 173, 165, 113, 175, 155, 117 and 127 respectively. When binary representation is used, the component code generation vectors are: {1,1,0,1,1,0,1}, {1,0,1,1,1,1,1}, {1,0,1,0,0,1,1}, {1,1,1,1,0,0,1}, {1,0,1,0,1,1,1}, {1,1,1,1,0,1,1}, {1,1,1,0,1,0,1}, {1,0,0,1,0,1,1}, {1,1,1,1,1,0,1}, {1,1,0,1,1,0,1}, {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1} and {1,0,1,0,1,1,1}.
[0111] Furthermore, the transmitting end may determine T component code generating polynomials for convolutional coding from the above component code generating polynomial group. Wherein, T may be equal to 2, 3, 4, 5, 6, 8, 10, or 12. In one example, T is equal to 6, J is equal to 6, and the preset component code generating polynomial group includes the component code generating polynomial: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 1 +D 2 +D 3 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 .
[0112] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0113] Exemplarily, the transmitting end may use 2, 3, 4, 5, 6, 8, 10 or 12 of the above 12 component code generating polynomials to perform convolution coding to obtain a coded bit sequence. For example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 4 +D 6 and g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 Convolutional coding is performed to obtain a coded bit sequence, which will not be listed one by one.
[0114] In some embodiments, the T component code generating polynomials used in the convolutional coding further include at least one of the following: 1+D 1 +D 3 +D 4 +D 6 , 1+D 2 +D 3 +D 4 +D 5 +D 6 , 1+D 2 +D 4 +D 5 +D 6 , 1+D 3 +D 5 +D 6 and 1+D 1 +D 2 +D 3 +D 4 +D 6 The octal numbers corresponding to the component code generator polynomials are 155, 137, 127, 113, and 175, respectively. When expressed in binary, the component code generator vectors are {{1,1,0,1,1,0,1}, {1,0,1,1,1,1,1}, {1,0,1,0,1,1,1}, {1,0,0,1,0,1,1}, and {1,1,1,1,1,0,1}.
[0115] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0116] Implementation 5: The constraint length of the convolutional coding is 7. In this case, the number of shift registers required is 7-1=6. The highest power of the preset component code generating polynomial group is 6. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 2 +D 3 +D 6 ; g1(D)=1+D 1 +D 3 +D 4 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 3 +D 4 +D 5 +D 6 .
[0117] The octal numbers corresponding to the component code generator polynomials are 171, 155, 127, and 117. When expressed in binary, the component code generator vectors are {1,1,1,1,0,0,1}, {1,1,0,1,1,0,1}, {1,0,1,0,1,1,1}, and {1,0,0,1,1,1,1}.
[0118] Furthermore, the transmitting end can determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. Wherein, T can be equal to 2, 3 or 4. For example, if the encoding rate of the convolution coding is 1 / 4, T can be equal to 4, that is, the preset component code generating polynomial group includes: g0(D)=1+D 1 +D 2 +D 3 +D 6 ; g1(D)=1+D 1 +D 3 +D 4 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 3 +D 4 +D 5 +D 6 .
[0119] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0120] Implementation 6: The constraint length of the convolutional coding is 9. In this case, the number of shift registers required can be 9-1=8. The highest power of the preset component code generating polynomial group is 8. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 4 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ; g3(D)=1+D 2 +D 4 +D 7 +D 8 ; g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ; g5(D)=1+D 3 +D 5 +D 6 +D 8 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g 11 (D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0121] The octal numbers corresponding to the component code generating polynomials are 561, 753, 715, 523, 737, 455, 753, 745, 657, 671, 745 and 657. When expressed in binary, the component code generating vectors are: {1,0,1,1,1,0,0,0,1}, {1,1,1,1,0,1,0,1, 1}, {1,1,1,0,0,1,1,0,1}, {1,0,1,0,1,0,0,1,1}, {1,1,1,0,1,1,1,1,1}, {1,0,0,1,0,1,0,1}, {1,1,1,1,0,1,0,1}, {1,1,0,1,0,1,1,1}, {1,1,0,1,0,1,1,1}, {1,1,0,1,1,1,0,0,1}, {1,1,0,1,1,1,0,0,1}, {1,1,1,1,0,0,1,0,1}, and {1,1,0,1,0,1,1,1,1}.
[0122] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[0123] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 4, 5, 6, 7, 8, 9, or 10, and J is an integer less than or equal to T.
[0124] In one example, convolution coding uses at least 4 of the 12 generating polynomials to obtain a coded bit sequence, for example, at least the generating polynomial g0(D)=1+D is used. 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 2 +D 4 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0125] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 g3(D)=1+D 2 +D 4 +D 7 +D 8 g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 And g5(D)=1+D 3 +D 5 +D 6 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0126] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 g3(D)=1+D 2 +D 4 +D 7 +D 8 g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 g5(D)=1+D 3 +D 5 +D 6 +D 8 g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 And g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0127] In some embodiments, the T component code generating polynomials used in the convolutional coding further include at least one of the following: 1+D 1 +D 2 +D 5 +D 6 +D 8 , 1+D 2 +D 4 +D 7 +D 8 , 1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 , 1+D 3 +D 5 +D 6 +D 8 , 1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 , 1+D 1 +D 2 +D 3 +D 6 +D 8 , 1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 , 1+D 1 +D 3 +D 4 +D 5 +D 8 , 1+D 1 +D 2 +D 3 +D 6 +D 8 and 1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 The octal numbers corresponding to the component code generating polynomials are 715, 523, 737, 455, 753, 745, 657, 671, 745, and 657, respectively. When binary representation is used, the component code generation vectors are {1,1,1,0,0,1,1,0,1}, {1,0,1,0,1,0,0,1,1}, {1,1,1,0,1,1,1,1,1}, {1,0,0,1,0,1,1,0,1}, {1,1,1,1,0,1,0,1}, {1,1,0,1,0,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,1,0,1,1,1,0,0,1}, {1,1,1,1,0,0,1,0,1}, {1,1,0,1,0,1,1,1,1}. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0128] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0129] Implementation 7: The constraint length of the convolutional coding is 9. In this case, the number of shift registers required can be 9-1=8. The highest power of the preset component code generating polynomial group is 8. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 ; g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 8 ; g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ; g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ; g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g 10 (D)=1+D 2 +D 3 +D 5 +D 8 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 .
[0130] The octal numbers corresponding to the component code generating polynomials are 557, 663, 711, 765, 535, 517, 657, 473, 745, 657, 551, and 753. When expressed in binary, the component code generating vectors are: {1,0,1,1,0,1,1,1,1}, {1,1,0,1,1,0,0,1,1}, {1,1,1,0,0,1,0,0,1}, {1,1,1,1,0,1,0,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,1,0,1,1,1,0,1} ,1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,0,0,1,1,1,0,1,1}, {1,1,1,1,0,0,1,0,1}, {1,1,0,1,0,1,1,1,1}, {1,0,1,1,0,1,0,0,1}, and {1,1,1,1,0,1,0,1,1}.
[0131] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials of the above 12 generator polynomials. J may be 4, 5, 6, 7, 8, 9, or 10, and is an integer less than or equal to T. T may be 2, 3, 4, 5, 6, 8, 10, or 12.
[0132] In one example, convolution coding uses at least 4 of the 12 generating polynomials to obtain a coded bit sequence, for example, at least the generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 8 And g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0133] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 8 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 And g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0134] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 8 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 And g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0135] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 8 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 And g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0136] In some embodiments, the T component code generating polynomials used in the convolutional coding further include at least one of the following: 1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 , 1+D 2 +D 4 +D 5 +D 6 +D 8 , 1+D 2 +D 5 +D 6 +D 7 +D 8 , 1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 、 1+D 3 +D 4 +D 5 +D 7 +D 8 , 1+D 1 +D 2 +D 3 +D 6 +D 8 , 1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 , 1+D 2 +D 3 +D 5 +D 8 and 1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 The octal numbers corresponding to the component code generator polynomials are 765, 535, 517, 657, 473, 745, 657, 551, and 753, respectively. When expressed in binary, the component code generator vectors are {1,1,1,1,1,0,1,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,1,0,0,1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,0,0,1,1,1,0,1,1}, {1,1,1,1,0,0,1,0,1}, {1,1,0,1,0,1,1,1,1}, {1,0,1,1,0,1,0,0,1}, and {1,1,1,1,0,1,0,1,1}. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials of the above 12 generator polynomials. The value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0137] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0138] Implementation 8: The constraint length of the convolutional coding is 9. In this case, the number of shift registers required can be 9-1=8. The highest power of the preset component code generating polynomial group is 8. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 4 +D 6 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 ; g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ; g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ; g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ; g8(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g9(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g 10 (D)=1+D 3 +D 5 +D 6 +D 8 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 。
[0139] The octal numbers corresponding to the component code generating polynomials are 465, 771, 673, 547, 535, 517, 657, 473, 517, 753, 455 and 753. When expressed in binary, the component code generating vectors are: {1,0,0,1,1,0,1,0,1}, {1,1,1,1,1,1,0,0,1}, {1,1,0,1,1,1,0,1,1}, {1,0,1,1,0,0,1,1,1}, {1,0,1,0,1,1,1,0,1}, {1,0,1,0,0,1,1,1,0,1} ,1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,0,0,1,1,1,0,1,1}, {1,0,1,0,0,1,1,1,1}, {1,1,1,1,0,1,0,1,1}, {1,0,0,1,0,1,1,0,1}, and {1,1,1,1,0,1,0,1,1}.
[0140] Furthermore, the transmitting end may determine T component code generator polynomials for convolutional coding from the above component code generator polynomial group, where T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0141] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0142] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 and g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0143] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 And g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +Perform convolutional encoding to obtain a coded bit sequence.
[0144] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 And g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0145] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 And g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0146] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 And g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0147] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 And g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0148] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 +D 8 ; g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 8 ; g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ; g3(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ; g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 8 ; g5(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ; g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g 10 (D)=1+D 2 +D 3 +D 5 +D 8 ; g 11 (D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 。
[0149] The octal numbers corresponding to the component code generator polynomials are 531, 477, 673, 715, 565, 745, 753, 671, 745, 657, 551, and 657. When expressed in binary, the component code generator vectors are {1,0,1,0,1,1,0,0,1}, {1,0,0,1,1, Furthermore, the transmitter can determine T component code generator polynomials for convolutional coding from the above group of component code generator polynomials. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials of the above 12 generator polynomials. The value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0150] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0151] Implementation 9: The constraint length of the convolutional coding is 9. In this case, the number of shift registers required can be 9-1=8. The highest power of the preset component code generating polynomial group is 8. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 4 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ; g3(D)=1+D 2 +D 4 +D 7 +D 8 .
[0152] In some embodiments, if the 0th component code generator polynomial is g0(D)=1+D 2 +D 3 +D 4 +D 8 , the corresponding binary representation component code generation vector is {1,0,1,1,1,0,0,0,1}, and the corresponding octal number is 561. The first component code generating polynomial is g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 , the corresponding binary representation component code generation vector is {1,1,1,1,0,1,0,1,1}, and the corresponding octal number is 753. The second component code generating polynomial is g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 , the corresponding binary representation component code generator vector is {1,1,1,0,0,1,1,0,1}, and the corresponding octal number is 715. The third component code generator polynomial is at least one of the following: 1+D2+D5+D6+D7+D8, 1+D2+D4+D5+D6+D7+D8, 1+D3+D4+D5+D6+D8, 1+D2+D4+D5+D6+D8, 1+D2+D3+D6+D7+D8, 1+D2+D4+D7+D8, or 1+D1+D4+D6+D8. That is, the component code generator vector corresponding to the third component code is at least one of the following: {1,0,1,0,0,1,1,1,1}, {1,0,1,0,1,1,1,1,1}, {1,0,0,1,1,1,1,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,1,1,0,0,1,1,1}, {1,0,1,0,1,0,0,1,1}, {1,1,0,0,1,0,1,0,1}. Correspondingly, the component code generator polynomial corresponding to the third component code is at least one of the following octal numbers: 517, 537, 475, 535, 547, 523, and 625.
[0153] Furthermore, the transmitter can determine T component code generator polynomials for convolution coding from the above component code generator polynomial group. For example, if the convolution code rate is 1 / 2, the value of T can be 2; if the convolution code rate is 1 / 4, the value of T can be 4.
[0154] In one example, convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 2 +D 4 +D 7 +D 8 Convolutional coding is performed to obtain a coded bit sequence, wherein the component code generating polynomials correspond to octal numbers 561, 753, 715, and 523 respectively.
[0155] In another example, convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 1 +D 4 +D 6 +D 8 Convolutional coding is performed to obtain a coded bit sequence, wherein the component code generating polynomials correspond to octal numbers 561, 753, 715, and 625 respectively.
[0156] In another example, the convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 2 +D 4 +D 5 +D 6 +D 7 +D 8 Convolutional coding is performed to obtain a coded bit sequence, wherein the component code generating polynomials correspond to octal numbers 561, 753, 715, and 537 respectively.
[0157] In another example, the convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 8 And g3(D)=1+D 1 +D 3 +D 6 +D 8 Convolutional coding is performed to obtain a coded bit sequence, wherein the component code generating polynomials correspond to octal numbers 561, 753, 637, and 645 respectively.
[0158] Implementation 10: The constraint length of the convolutional coding is 9. In this case, the number of shift registers required is 9-1=8. The highest power of the preset component code generator polynomial group is 8. If the 0th component code generator polynomial in the preset component code generator polynomial is g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 , the corresponding binary representation component code generation vector is {1,0,1,1,0,1,1,1,1}, and the corresponding octal number is 557. The first component code generating polynomial is g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 , the corresponding binary representation component code generation vector is {1,1,0,1,1,0,0,1,1}, and the corresponding octal number is 663. The second component code generation polynomial is g2(D)=1+D 1 +D 2 +D 5 +D 8 , the corresponding binary component code generator vector is {1,1,1,0,0,1,0,0,1}, and the corresponding octal number is 711. The third component code generator polynomial is at least one of the following: 1+D1+D2+D3+D4+D6+D8; 1+D1+D2+D4+D6+D8; 1+D2+D4+D5+D6+D8; 1+D3+D4+D5+D6+D8; 1+D2+D3+D4+D5+D6+D8; 1+D4+D5+D6+D8. Accordingly, the component code generator vector corresponding to the third component code is at least one of the following: {1,1,1,1,1,0,1,0,1}, {1,1,1,0,1,0,1,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,0,1,1,1,1,0,1}, {1,0,1,1,1,1,1,0,1}, and {1,0,0,0,1,1,1,0,1}. Furthermore, the component code generator polynomial corresponding to the third component code is at least one of the following octal numbers: 765, 725, 535, 475, 575, and 435.
[0159] Furthermore, the transmitter can determine T component code generator polynomials for convolution coding from the above component code generator polynomial group. For example, if the convolution code rate is 1 / 2, the value of T can be 2; if the convolution code rate is 1 / 4, the value of T can be 4.
[0160] In one example, convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 8 And g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 Convolutional coding is performed to obtain a coded bit sequence, wherein the component code generating polynomials correspond to octal numbers 557, 663, 711, and 765 respectively.
[0161] Implementation 11: The constraint length of the convolutional coding is 5. In this case, the number of shift registers required is 5-1=4. The highest power of the preset component code generating polynomial group is 4. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 4 ; g1(D)=1+D 1 +D 2 +D 4 ; g2(D)=1+D 2 +D 3 +D 4 ; g3(D)=1+D 1 +D 3 +D 4 ; g4(D)=1+D 1 +D 2 +D 4 ; g5(D)=1+D 2 +D 3 +D 4 ; g6(D)=1+D 1 +D 2 +D 4 ; g7(D)=1+D 2 +D 3 +D 4 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 ; g9(D)=1+D 2 +D 3 +D 4 ; g 10 (D)=1+D 1 +D 2 +D 4 ; g 11 (D)=1+D 2 +D 3 +D 4 .
[0162] The octal numbers corresponding to the component code generating polynomials are 23, 35, 27, 33, 35, 27, 35, 27, 37, 27, 35, and 27. When represented in binary, the component code generating vectors are: {1,0,0,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,0,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,1,1}, {1,0,1,1,1}, {1,1,1,0,1}, and {1,0,1,1,1}.
[0163] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[0164] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0165] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 and g1(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0166] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 And g2(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0167] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 And g3(D)=1+D 1 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0168] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D 4 And g4(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0169] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 And g5(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0170] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +D 3 +D 4 g6(D)=1+D 1 +D 2 +D 4 And g7(D)=1+D 2 +D 3 +D 4 ; Perform convolution coding to obtain a coded bit sequence.
[0171] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 4 ; g1(D)=1+D 2 +D 3 +D 4 ; g2(D)=1+D 1 +D 2 +D 4 ; g3(D)=1+D 1 +D 3 +D 4 ; g4(D)=1+D 1 +D 2 +D 4 ; g5(D)=1+D 2 +D 3 +D 4 ; g6(D)=1+D 1 +D 2 +D 4 ; g7(D)=1+D 2 +D 3 +D 4 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 ; g9(D)=1+D 2 +D 3 +D 4 ; g 10 (D)=1+D 1 +D 2 +D 4 ; g 11 (D)=1+D 2 +D 3 +D 4 .
[0172] The octal numbers corresponding to the component code generator polynomials are 31, 27, 35, 33, 35, 27, 35, 27, 37, 27, 35, and 27, respectively. When expressed in binary, the component code generator vectors are {1,1,0,0,1}, {1,0,1,1,1}, {1,1,1,0,1}, {1,1,0,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,1,1}, {1,0,1,1,1}, {1,1,1,0,1}, and {1,0,1,1,1}. Furthermore, the transmitter can determine T component code generator polynomials for convolutional coding from the above group of component code generator polynomials. In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0173] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 And g1(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0174] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 And g2(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0175] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 And g3(D)=1+D 1 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0176] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 And g4(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0177] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 And g5(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0178] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +D 3 +D 4 g6(D)=1+D 1 +D 2 +D 4 And g7(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain a coded bit sequence.
[0179] Implementation 12: The constraint length of the convolutional coding is 6. In this case, the number of shift registers required is 6-1=5. The highest power of the preset component code generating polynomial group is 5. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 ; g2(D)=1+D 3 +D 4 +D 5 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 ; g4(D)=1+D 2 +D 3 +D 4 +D 5 ; g5(D)=1+D 1 +D 3 +D 5 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 ; g7(D)=1+D 1 +D 2 +D 5 ; g8(D)=1+D 2 +D 4 +D 5 ; g9(D)=1+D 2 +D 3 +D 4 +D 5 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 5 ; g 11 (D)=1+D 1 +D 3 +D 4 +D 5 .
[0180] The octal numbers corresponding to the component code generating polynomials are 53, 75, 47, 67, 57, 65, 75, 71, 53, 57, 75, and 67. When represented in binary, the component code generating vectors are: {1,0,1,0,1,1}, {1,1,1,1,0,1}, {1,0,0,1,1,1}, {1,1,0,1,1,1}, {1,0,1,1,1,1}, {1,1,0,1,0,1}, {1,1,1,1,0,1}, {1,1,1,0,0,1}, {1,0,1,0,1,1}, {1,0,1,1,1,1}, {1,1,1,1,0,1}, and {1,1,0,1,1,1}.
[0181] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0182] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0183] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 and g1(D)=1+D 1 +D 2 +D 3 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0184] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 g1(D)=1+D 1 +D 2 +D 3 +D 5 And g2(D)=1+D 3 +D 4 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0185] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 g1(D)=1+D 1 +D 2 +D 3 +D 5 g2(D)=1+D 3 +D 4 +D 5 And g3(D)=1+D 1 +D 3 +D 4 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0186] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 g1(D)=1+D 1 +D 2 +D 3 +D 5 g2(D)=1+D 3 +D 4 +D 5 g3(D)=1+D 1 +D 3 +D 4 +D 5 And g4(D)=1+D 2 +D 3 +D 4 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0187] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 g1(D)=1+D 1 +D 2 +D 3 +D 5 g2(D)=1+D 3 +D 4 +D 5 g3(D)=1+D 1 +D 3 +D 4 +D 5 g4(D)=1+D 2 +D 3 +D 4 +D 5 And g5(D)=1+D 1 +D 3 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0188] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 g1(D)=1+D 1 +D 2 +D 3 +D 5 g2(D)=1+D 3 +D 4 +D 5 g3(D)=1+D 1 +D 3 +D 4 +D 5 g4(D)=1+D 2 +D 3 +D 4 +D 5 g5(D)=1+D 1 +D 3 +D 5 g6(D)=1+D 1 +D 2 +D 3 +D 5 And g7(D)=1+D 1 +D 2 +D 5 Convolutional encoding is performed to obtain a coded bit sequence.
[0189] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and then convolution coding is performed based on the component code generating polynomial determined in the above example. The specific process can refer to the specific description of the convolution coding process in the above implementation method 1, which will not be repeated here.
[0190] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 5 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 ; g2(D)=1+D 1 +D 2 +D 5 ; g3(D)=1+D 1 +D 2 +D 4 +D 5 ; g4(D)=1+D 1 +D 2 +D 3 +D 5 ; g5(D)=1+D 2 +D 4 +D 5 ; g6(D)=1+D 2 +D 3 +D 4 +D 5 ; g7(D)=1+D 3 +D 4 +D 5 ; g8(D)=1+D 1 +D 3 +D 5 ; g9(D)=1+D 2 +D 3 +D 4 +D 5 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 5 ; g 11 (D)=1+D 1 +D 2 +D 4 +D 5 .
[0191] The octal numbers corresponding to the above component code generator polynomials are 65, 57, 71, 73, 75, 53, 57, 47, 65, 57, 75, and 73. When expressed in binary, the component code generator vectors are {1,1,0,1,0,1}, {1,0,1,1,1,1}, {1,1,1,0,0,1}, {1,1,1,0,1,1}, {1,1,1,1,0,1}, {1,0,1,0,1,1}, {1,0,1,1,1,1}, {1,0,0,1,1,1}, {1,1,0,1,0,1}, {1,0,1,1,1,1}, {1,1,1,1,0,1}, and {1,1,1,0,1,1}. Furthermore, the transmitting end can determine T component code generator polynomials for convolutional coding from the above-mentioned group of component code generator polynomials. In some embodiments, the T component code generator polynomials used in convolutional coding include at least the first J component code generator polynomials among the above-mentioned 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0192] Implementation 13: The constraint length of the convolutional coding is 8. In this case, the number of shift registers required is 8-1=7. The highest power of the preset component code generator polynomial group is 7. The preset component code generator polynomial group includes at least one of the following component code generator polynomials: g0(D)=1+D 2 +D 4 +D 5 +D 7 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ; g2(D)=1+D 3 +D 5 +D 6 +D 7 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ; g4(D)=1+D 1 +D 2 +D 4 +D 7 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ; g9(D)=1+D 1 +D 2 +D 5 +D 7 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ; g 11 (D)=1+D 2 +D 5 +D 6 +D 7 。
[0193] The octal numbers corresponding to the above component code generating polynomials are 255, 363, 227, 337, 351, 275, 353, 247, 327, 345, 373 and 247 respectively. When binary representation is used, the component code generation vectors are: {1,0,1,0,1,1,0,1}, {1,1,1,1,0,0,1,1}, {1,0,0,1,0,1,1,1}, {1,1,0,1,1,1,1,1}, {1,1,1,0,1,0,0,1}, {1,0,1,1,1,1,0,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,1,0,1,0,1,1,1}, {1,1,1,0,0,1,0,1}, {1,1,1,0,0,1,0,1}, {1,1,1,1,1,0,1,1} and {1,0,1,0,0,1,1,1}.
[0194] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0195] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0196] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 and g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0197] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 And g2(D)=1+D 3 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0198] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 And g2(D)=1+D 3 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0199] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 g2(D)=1+D 3 +D 5 +D 6 +D 7 g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 And g4(D)=1+D 1 +D 2 +D 4 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0200] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 g2(D)=1+D 3 +D 5 +D 6 +D 7 g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 g4(D)=1+D 1 +D 2 +D 4 +D 7 And g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0201] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 g2(D)=1+D 3 +D 5 +D 6 +D 7 g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 g4(D)=1+D 1 +D 2 +D 4 +D 7 g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 And g7(D)=1+D 2 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0202] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and the specific process of performing convolution encoding based on the component code generating polynomial determined in the above example can refer to the specific description of the convolution encoding process in the above implementation method 1, which will not be repeated here.
[0203] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 7 ; g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 ; g2(D)=1+D 1 +D 2 +D 4 +D 7 ; g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ; g4(D)=1+D 3 +D 5 +D 6 +D 7 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ; g7(D)=1+D 1 +D 2 +D 5 +D 7 ; g8(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ; g9(D)=1+D 2 +D 5 +D 6 +D 7 ; g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ; g 11 (D)=1+D 1 +D 2 +D 5 +D 7 .
[0204] The octal numbers corresponding to the above component code generating polynomials are: 265, 317, 351, 373, 227, 275, 327, 345, 353, 247, 337 and 345 respectively. When binary representation is used, the component code generation vectors are {1,0,1,1,0,1,0,1}, {1,1,0,0,1,1,1,1}, {1,1,1,0,1,0,0,1}, {1,1,1,1,1,0,1,1}, {1,0,0,1,0,1,1,1}, {1,0,1,1,1,1,0,1}, {1,1,0,1,0,1,1,1}, {1,1,1,0,0,1,0,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,1,0,1,0,0,1,1}, and {1,1,1,0,0,1,0,1}.
[0205] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0206] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0207] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 7 and g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0208] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 And g2(D)=1+D 1 +D 2 +D 4 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0209] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 And g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0210] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 And g4(D)=1+D 3 +D 5 +D 6 Convolutional encoding is performed to obtain a coded bit sequence.
[0211] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 g4(D)=1+D 3 +D 5 +D 6 And g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 Convolutional encoding is performed to obtain a coded bit sequence.
[0212] Implementation 14: The constraint length of the convolutional coding is 10. In this case, the number of shift registers required is 10-1=9. The highest power of the preset component code generating polynomial group is 9. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ; g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ; g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ; g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ; g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ; g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ; g9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ; g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 ; g 11 (D)=1+D 3 +D 5 +D 6 +D 7 +D 9 .
[0213] The octal numbers corresponding to the component code generating polynomials are 1533, 1371, 1217, 1647, 1135, 1731, 1527, 1237, 1545, 1753, 1571, and 1135. When expressed in binary, the component code generating vectors are: {1,1,0,1,0,1,1,0,1,1}, {1,0,1,1,1,1,1,0,0,1}, {1,0,1,0,0,0,1,1,1,1}, {1,1,1,0,1,0,0,1,1,1}, {1,0,0,1,0,1,1,1,0,1}, {1,1,1,1,0,1 ,1,0,0,1}, {1,1,0,1,0,1,0,1,1,1}, {1,0,1,0,0,1,1,1,1}, {1,1,0,1,1,0,0,1,0,1}, {1,1,1,1,1,0,1,0,1,1}, {1,1,0,1,1,1,1,0,0,1}, and {1,0,0,1,0,1,1,1,0,1}.
[0214] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0215] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0216] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 and g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0217] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 And g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0218] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 And g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0219] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 And g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0220] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 And g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0221] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 1 +D 3 +D 5 +D 6 +D 8 +D 9 g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 And g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0222] In addition, the information bit sequence is b0, b1, b2, b3, ..., b K-1 , K is the length of the information bit sequence, and the specific process of performing convolution encoding based on the component code generating polynomial determined in the above example can refer to the specific description of the convolution encoding process in the above implementation method 1, which will not be repeated here.
[0223] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 +D 8 +D 9 ; g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 ; g2(D)=1+D 1 +D 2 +D 3 +D 7 +D 9 ; g3(D)=1+D 1 +D 2 +D 5 +D 7 +D 8 +D 9 ; g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 9 ; g5(D)=1+D 3 +D 4 +D 6 +D 7 +D 8 +D 9 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 8 +D 9 ; g7(D)=1+D 1 +D 2 +D 3 +D 4 +D 7 +D 9 ; g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 ; g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 +D 9 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ; g 11 (D)=1+D 2 +D 3 +D 4 +D 6 +D 9 .
[0224] The octal numbers corresponding to the above component code generating polynomials are: 1553, 1175, 1705, 1627, 1351, 1157, 1653, 1745, 1233, 1537, 1731 and 1351. When expressed in binary, the component code generating vectors are {1,1,0,1,1,0,1,0,1,1}, {1,0,0,1,1,1,1,1,0,1}, {1,1,1,1,0,0,0,1,0,1}, {1,1,1,0,0,1,0,1,1}, {1,0,1,1,1,0,1,0,0,1}, {1,0,0,1,1,1,0,1,0,0,1}, {1,0,0,1,1,1,0,1,0,0,1}. {1,1,1,1,0,1,0,1,0,1}, {1,1,1,1,1,0,0,1,0,1}, {1,0,1,0,0,1,1,0,1,1}, {1,1,0,1,0,1,1,1,1,1}, {1,1,1,1,0,1,1,0,0,1}, and {1,0,1,1,1,0,1,0,0,1}.
[0225] Furthermore, the transmitting end may determine T component code generator polynomials for convolutional coding from the above-mentioned group of component code generator polynomials. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generator polynomials used in convolutional coding include at least the first J component code generator polynomials of the above-mentioned 12 generator polynomials. The value of J may be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0226] Implementation 15: The constraint length of the convolutional coding is 11. In this case, the number of shift registers required is 11-1=10. The highest power of the preset component code generating polynomial group is 10. The preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ; g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ; g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 ; g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ; g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ; g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ; g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 ; g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ; g9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 .
[0227] The octal numbers corresponding to the component code generating polynomials are 2271, 3361, 3565, 3173, 2517, 2755, 2353, 3371, 2467, 2517, 3731 and 3653. When expressed in binary, the component code generating vectors are: {1,0,0,1,0,1,1,1,0,0,1}, {1,1,0,1,1,1,1,0,0,0,1}, {1,1,0,1,1,1,1,0,1,0,1}, {1,1,0,0,1,1,1,0,1,0,1}, {1,1,0,0,1,1,1,1,0,1,1}, {1,0,1,1,1,1,0,0,1,1,1}. ,1,1,0,1}, {1,0,0,1,1,1,0,1,0,1,1}, {1,1,0,1,1,1,1,1,0,0,1}, {1,0,1,0,0,1,1,0,1,1,1}, {1,0,1,0,1,0,0,1,1,1,1}, {1,1,1,1,1,0,1,1,0,0,1}, and {1,1,1,1,0,1,0,1,0,1,1}.
[0228] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12.
[0229] In some embodiments, the T component code generator polynomials used in the convolutional coding include at least the first J component code generator polynomials among the above 12 generator polynomials. Wherein, the value of J can be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0230] In one example, convolution coding uses at least two of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 5 +D 6 +D 7 +D 10 and g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0231] In another example, convolution coding uses at least three of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 And g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0232] In another example, convolution coding uses at least 4 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 And g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0233] In another example, convolution coding uses at least 5 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 And g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0234] In another example, convolution coding uses at least 6 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0235] In another example, convolution coding uses at least 8 of the above 12 generating polynomials to encode to obtain a coded bit sequence, for example, at least the above generating polynomial g0(D)=1+D is used. 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 And g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 Convolutional encoding is performed to obtain a coded bit sequence.
[0236] In addition, the information bit sequence is b0,b1,b2,b3,…,b K-1 , K is the length of the information bit sequence, and the specific process of performing convolution encoding based on the component code generating polynomial determined in the above example can refer to the specific description of the convolution encoding process in the above implementation method 1, which will not be repeated here.
[0237] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 4 +D 5 +D 7 +D 10 ; g1(D)=1+D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 +D 9 +D 10 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 +D 10 ; g4(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ; g5(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 +D 10 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 10 ; g7(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ; g8(D)=1+D 1 +D 2 +D 4 +D 5 +D 8 +D 10 ; g9(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ; g 10 (D)=1+D 3 +D 4 +D 6 +D 7 +D 8 +D 9 +D 10 ; g 11 (D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 +D 10 .
[0238] The octal numbers corresponding to the above component code generating polynomials are: 2351, 2173, 2567, 3363, 3625, 2675, 3271, 2373, 3545, 3625, 2337 and 3257. When expressed in binary, the component code generating vectors are {1,0,0,1,1,1,0,1,0,0,1}, {1,0,0,0,1,1,1,1,0,1,1}, {1,0,1,0,1,1,1,0,1,1}, {1,1,0,1,1,1,0,0,1,1}, {1,1,0,1,1,1,0,0,1,0,1}, {1,1,1,1,0,0,1,0,1,0,1}, {1,0,1,1,0,1,0,1,0,1} 1,1,1,0,1}, {1,1,0,1,0,1,1,1,0,0,1}, {1,0,0,1,1,1,1,1,0,1,1}, {1,1,1,0,1,1,0,0,1,0,1}, {1,1,1,1,0,0,1,0,1,0,1}, {1,0,0,1,1,0,1,1,1,1,1}, and {1,1,0,1,0,1,0,1,1,1,1}.
[0239] Furthermore, the transmitting end may determine T component code generator polynomials for convolutional coding from the above-mentioned group of component code generator polynomials. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generator polynomials used in convolutional coding include at least the first J component code generator polynomials of the above-mentioned 12 generator polynomials. The value of J may be 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0240] S103: Send all or part of the bits in the coded bit sequence.
[0241] In some embodiments, the transmitting end may immediately transmit the generated T bits after convolution encoding T bits for each bit of the input information bit sequence.
[0242] Alternatively, the transmitting end may perform convolution coding on all bits of the information bit sequence to obtain K*T bits, and then transmit the K*T bits in sequence.
[0243] Alternatively, the transmitter may perform convolution encoding on all bits of the information bit sequence to obtain K*T bits, and then interleave or partially interleave each component code output bit sequence (each of which has a length of K bits), and send each component code encoded output bit after interleaving.
[0244] Alternatively, the transmitter may perform convolution encoding on all bits of the information bit sequence to obtain K*T bits, and then interleave each component code output bit sequence separately or partially interleave, and then perform bit selection to obtain a rate-matched bit sequence, and send the rate-matched bit sequence.
[0245] Based on the above embodiment, the method can perform convolution encoding on an information bit sequence based on a preset component code generating polynomial, thereby obtaining a bit sequence to be transmitted. The present application also provides multiple possible implementations of the preset component code generating polynomial under different convolutional coding constraint lengths. Furthermore, since the number of non-zero coefficients in the component code generating polynomial provided by the present application is relatively small, by using the component code generating polynomial provided in the embodiment of the present application for convolution encoding, the weight of the component code is reduced, and the number of XOR gates is also reduced, which can reduce the complexity of the convolutional coding and increase the robustness of data communication.
[0246] In some embodiments, the present application also provides a decoding method, as shown in FIG5 , which includes the following steps:
[0247] S201: Receive all or part of the bits in a coded bit sequence.
[0248] A receiving end receives all or part of the bits in a coded bit sequence and can perform decoding operations on all or part of the bits in the coded bit sequence. Taking the communication system 100 shown in Figure 1 as an example, the receiving end can be a terminal device or a network device in communication system 100. During communication, if a network device sends data to a terminal device and the terminal device receives the data sent by the network device, the network device can be called a sending end. Correspondingly, the terminal device can be called a receiving end.
[0249] S202: Perform convolution decoding on all or part of the bits in the coded bit sequence according to the T component code generating polynomials to obtain an information bit sequence.
[0250] Wherein, T is an integer greater than 1. Exemplarily, the value of T includes 2, 3, 4, 6, 8, 10 or 12.
[0251] In some embodiments, the receiving end may also receive information related to the coded bit sequence. Exemplarily, the information may include T component code generator polynomials.
[0252] In some embodiments, the receiving end may also preset T component code generating polynomials, which are the same as the T component code generating polynomials used by the transmitting end to perform convolution encoding to obtain the coded bit sequence.
[0253] In some embodiments, the convolutional coding constraint length is determined based on the highest power of the polynomials in the T component code generator polynomials. For example, the convolutional coding constraint length can be the sum of the highest power of the polynomials in the T component code generator polynomials plus 1.
[0254] In some embodiments, the convolutional coding constraint length may be at least one of the following: 5, 6, 7, 8, 9, 10, and 11. In one example, the convolutional coding constraint length is 7 and 9. In another example, the convolutional coding constraint length is 5 and 9. In yet another example, the convolutional coding constraint length is 7 and 11. In yet another example, the convolutional coding constraint length is 7, 9, and 11.
[0255] In one example, when the convolution code value is 7, the number of shift registers required may be 7-1=6, and the highest power of the preset component code generating polynomial group is 6. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 2 +D 3 +D 4 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ; g6(D)=1+D 2 +D 3 +D 4 +D 6 ; g7(D)=1+D 1 +D 4 +D 6 ; g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ; g9(D)=1+D 2 +D 3 +D 4 +D 6 ; g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ; g 11 (D)=1+D 2 +D 3 +D 4 +D 6 .
[0256] In another example, when the convolution code value is 9, the number of shift registers required is 9-1=8, and the highest power of the preset component code generating polynomial group is 8. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 4 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ; g3(D)=1+D 2 +D 4 +D 7 +D 8 ; g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ; g5(D)=1+D 3 +D 5 +D 6 +D 8 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g 11 (D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0257] In another example, when the convolution code value is 5, the number of shift registers required may be 5-1=4, and the highest power of the preset component code generating polynomial group is 4. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 3 +D 4 ; g1(D)=1+D 1 +D 2 +D 4 ; g2(D)=1+D 2 +D 3 +D 4 ; g3(D)=1+D 1 +D 3 +D 4 ; g4(D)=1+D 1 +D 2 +D 4 ; g5(D)=1+D 2 +D 3 +D 4 ; g6(D)=1+D 1 +D 2 +D 4 ; g7(D)=1+D 2 +D 3 +D 4 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 ; g9(D)=1+D 2 +D 3 +D 4 ; g 10 (D)=1+D 1 +D 2 +D 4 ; g 11 (D)=1+D 2 +D 3 +D 4 .
[0258] In another example, when the convolution code value is 6, the number of shift registers required may be 6-1=5, and the highest power of the preset component code generating polynomial group is 5. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 ; g2(D)=1+D 3 +D 4 +D 5 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 ; g4(D)=1+D 2 +D 3 +D 4 +D 5 ; g5(D)=1+D 1 +D 3 +D 5 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 ; g7(D)=1+D 1 +D 2 +D 5 ; g8(D)=1+D 2 +D 4 +D 5 ; g9(D)=1+D 2 +D 3 +D 4 +D 5 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 5 ; g 11 (D)=1+D 1 +D 3 +D 4 +D 5 .
[0259] In another example, when the value of the convolution code is 8, the number of shift registers required may be 8-1=7, and the highest power of the preset component code generating polynomial group is 7. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 +D 7 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ; g2(D)=1+D 3 +D 5 +D 6 +D 7 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ; g4(D)=1+D 1 +D 2 +D 4 +D 7 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ; g9(D)=1+D 1 +D 2 +D 5 +D 7 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ; g 11 (D)=1+D 2 +D 5 +D 6 +D 7 .
[0260] In another example, when the value of the convolution code is 10, the number of shift registers required may be 10-1=9, and the highest power of the preset component code generating polynomial group is 9. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ; g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ; g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ; g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ; g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ; g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ; g9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ; g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 ; g 11 (D)=1+D 3 +D 5 +D 6 +D 7 +D 9 .
[0261] In another example, when the value of the convolution code is 11, the number of shift registers required may be 11-1=10, and the highest power of the preset component code generating polynomial group is 10. The above T component code generating polynomials can be determined from the following component code generating polynomials: g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ; g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ; g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 ; g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ; g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ; g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ; g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 ; g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ; g9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 。
[0262] For the detailed description and implementation of the component code generating polynomial, please refer to the relevant description in the above step S102, which will not be repeated here.
[0263] Based on the above embodiment, the obtained bit sequence can be decoded based on T component code generating polynomials. Since the number of non-zero coefficients in the component code generating polynomial provided in the present application is small, the weight of the component code is reduced. By using the component code generating polynomial provided in the embodiment of the present application for decoding, the complexity of convolutional encoding and decoding during the communication process can be reduced, and the robustness of data communication can be increased.
[0264] The information bit sequence can be convolutionally encoded based on a preset component code generating polynomial to obtain a bit sequence to be transmitted. The present application also provides multiple possible implementations of the preset component code generating polynomial under different convolutional coding constraint lengths. Furthermore, since the number of non-zero coefficients in the component code generating polynomial provided by the present application is relatively small, by using the component code generating polynomial provided in the embodiment of the present application for convolutional encoding, the weight of the component code is reduced, and the number of XOR gates is also reduced, which can reduce the complexity of the convolutional encoding and increase the robustness of data communication.
[0265] The above mainly introduces the solution provided by the present application from the perspective of the interaction between each node. It is understandable that each node, such as a device or equipment, includes a hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present invention can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0266] FIG6 is a schematic diagram showing the composition of an encoding device provided in an embodiment of the present application. As shown in FIG6 , the encoding device 60 includes an acquisition module 601 , a processing module 602 , and a sending module 603 .
[0267] In some embodiments, an acquisition module 601 is configured to acquire an information bit sequence. A processing module 602 is configured to perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence, where T is an integer greater than 1. A sending module 603 is configured to send all or part of the bits in the coded bit sequence.
[0268] In some embodiments, convolutional coding is implemented by a plurality of shift registers and a plurality of XOR gates, wherein every two adjacent shift registers in the plurality of shift registers are connected in series.
[0269] In some embodiments, the number of shift registers is determined based on the highest power of the T component code generator polynomials.
[0270] In some embodiments, the number of XOR gates is determined based on the number of coefficients of the T component code generator polynomials.
[0271] In some embodiments, the constraint length of the convolutional encoding is determined based on the highest power of the polynomial in the T component code generator polynomials.
[0272] In some embodiments, the T component code generating polynomials are determined from a set of preset component code generating polynomials.
[0273] In some embodiments, the processing module 602 is specifically used to: perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials, and interleave all or part of the component code bit sequences in the T component code bit sequences to obtain a coded bit sequence.
[0274] In some embodiments, the processing module 602 is specifically used to: perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials, perform sub-block interleaving on the i-th component code bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T, and determine the coding bit sequence according to the sub-block interleaved output sequence and other component code bit sequences in the T component code bit sequences except the i-th component code bit sequence.
[0275] For a more detailed description of the acquisition module 601, processing module 602 and sending module 603, as well as a more detailed description of each technical feature and a description of the beneficial effects, please refer to the above-mentioned corresponding encoding method embodiment part, which will not be repeated here.
[0276] FIG7 is a schematic diagram showing the composition of a decoding device provided in an embodiment of the present application. As shown in FIG7 , the decoding device 70 includes a receiving module 701 and a processing module 702 .
[0277] In some embodiments, the receiving module 701 is configured to receive all or part of the bits in the coded bit sequence. The processing module 702 is configured to perform convolution decoding on all or part of the bits in the coded bit sequence according to T component code generating polynomials to obtain an information bit sequence.
[0278] In some embodiments, the receiving module 701 is configured to receive information related to a coded bit sequence.
[0279] In some embodiments, the convolutional decoding is implemented based on Viterbi decoding or cyclic redundancy check (CRC)-assisted Viterbi table decoding.
[0280] For a more detailed description of the above-mentioned receiving module 701 and processing module 702, a more detailed description of each technical feature therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding encoding method embodiment part, which will not be repeated here.
[0281] It should be noted that the modules in FIG6 or FIG7 may also be referred to as units. For example, the processing module may be referred to as a processing unit. In addition, in the embodiments shown in FIG6 or FIG7 , the names of the modules may not be those shown in the figures. For example, the acquisition module or the sending module may also be referred to as a communication module.
[0282] If the various units in Figure 6 or Figure 7 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present application. The storage medium for storing computer software products includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0283] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, an embodiment of the present application provides a schematic structural diagram of a communication device, which can be the above-mentioned encoding device or decoding device, as shown in Figure 8. The communication device 800 includes: a processor 802, a communication interface 803, and a bus 804. Optionally, the communication device 800 may also include a memory 801.
[0284] Processor 802 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. Processor 802 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Processor 802 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. Processor 802 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, or a combination of a DSP and a microprocessor.
[0285] The communication interface 803 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.
[0286] The memory 801 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
[0287] As a possible implementation, the memory 801 can exist independently of the processor 802. The memory 801 can be connected to the processor 802 via a bus 804 to store instructions or program codes. When the processor 802 calls and executes the instructions or program codes stored in the memory 801, the method provided in the embodiment of the present application can be implemented.
[0288] In another possible implementation, the memory 801 may also be integrated with the processor 802 .
[0289] Bus 804 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 804 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG8 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.
[0290] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.
[0291] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiment can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it may include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the memory or memory of any of the aforementioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned device or apparatus, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above-mentioned device or apparatus. Further, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned device or apparatus and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.
[0292] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the methods provided in the above embodiments.
[0293] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude multiple situations. A single processor or other unit may implement several functions listed in the claims. The fact that certain measures are recorded in different dependent claims does not mean that these measures cannot be combined to produce good results.
[0294] Although the present application has been described with reference to specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely illustrative of the present application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, the present application is intended to include such modifications and variations as fall within the scope of the claims of the present application and their equivalents.
[0295] The above is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or replacements within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.< / null>
Claims
1. A coding method, characterized in that: The method comprises: Obtaining an information bit sequence; Convolutionally encode the information bit sequence according to T component code generating polynomials to obtain a coded bit sequence, where T is an integer greater than 1; All or part of the bits in the coded bit sequence are sent.
2. The method according to claim 1, characterized in that The value of T includes 2, 3, 4, 6, 8, 10 or 12.
3. The method according to claim 1, characterized in that The convolutional coding is implemented by a plurality of shift registers and a plurality of XOR gates, wherein every two adjacent shift registers in the plurality of shift registers are connected in series.
4. The method according to claim 3, characterized in that The number of the shift registers is determined based on the highest power of the T component code generating polynomials.
5. The method according to claim 3, characterized in that: The number of the XOR gates is determined based on the number of coefficients of the T component code generating polynomials.
6. The method according to claim 1, characterized in that The constraint length of the convolutional coding is determined based on the highest power of the polynomial among the T component code generating polynomials.
7. The method according to claim 6, characterized in that The value of the constraint length of the convolutional coding includes 5, 6, 7, 8, 9, 10 or 11.
8. The method according to claim 1, characterized in that The T component code generating polynomials are determined from a preset component code generating polynomial group.
9. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to a value of 7, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 2 +D 3 +D 4 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ; g6(D)=1+D 2 +D 3 +D 4 +D 6 ; g7(D)=1+D 1 +D 4 +D 6 ; g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ; g9(D)=1+D 2 +D 3 +D 4 +D 6 ; g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ; g 11 (D) = 1 + D 2 +D 3 +D 4 +D 6 .
10. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to a value of 7, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ; g1(D)=1+D 2 +D 3 +D 5 +D 6 ; g2(D)=1+D 1 +D 4 +D 6 ; g3(D)=1+D 3 +D 4 +D 5 +D 6 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 ; g5(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 ; g7(D)=1+D 1 +D 3 +D 6 ; g8(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ; g9(D)=1+D 1 +D 3 +D 4 +D 6 ; g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ; g 11 (D) = 1 + D 2 +D 4 +D 5 +D 6 .
11. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to a value of 7, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 4 +D 6 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ; g2(D)=1+D 2 +D 5 +D 6 ; g3(D)=1+D 1 +D 2 +D 3 +D 6 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 ; g7(D)=1+D 3 +D 5 +D 6 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ; g9(D)=1+D 1 +D 3 +D 4 +D 6 ; g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ; g 11 (D) = 1 + D 2 +D 4 +D 5 +D 6 .
12. The method according to claim 1, characterized in that The constraint length of the convolutional coding is 7, and the T component code generating polynomials include the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 ; g2(D)=1+D 1 +D 2 +D 4 +D 6 ; g3(D)=1+D 2 +D 5 +D 6 .
13. The method according to claim 8, characterized in that The constraint length of the convolutional coding is 9, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 4 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ; g3(D)=1+D 2 +D 4 +D 7 +D 8 ; g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ; g5(D)=1+D 3 +D 5 +D 6 +D 8 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ; g 10 (D) = 1 + D 1 +D 2 +D 3 +D 6 +D 8 ; g 11 (D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 。 14. The method according to claim 8, characterized in that The constraint length of the convolutional coding is 9, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 ; g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 8 ; g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ; g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ; g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ; g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g 10 (D) = 1 + D 2 +D 3 +D 5 +D 8 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 。 15. The method according to claim 8, characterized in that The constraint length of the convolutional coding is 9, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 4 +D 6 +D 8 ; g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 ; g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ; g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 ; g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ; g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ; g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ; g8(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ; g9(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ; g 10 (D) = 1 + D 3 +D 5 +D 6 +D 8 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 。 16. The method according to claim 1, characterized in that The constraint length of the convolutional coding is 9, and the T component code generating polynomials include the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 ; g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ; g2(D)=1+D 1 +D 2 +D 5 +D 8 ; g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 .
17. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to a value of 5, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 4 ; g1(D)=1+D 1 +D 2 +D 4 ; g2(D)=1+D 2 +D 3 +D 4 ; g3(D)=1+D 1 +D 3 +D 4 ; g4(D)=1+D 1 +D 2 +D 4 ; g5(D)=1+D 2 +D 3 +D 4 ; g6(D)=1+D 1 +D 2 +D 4 ; g7(D)=1+D 2 +D 3 +D 4 ; g8(D)=1+D 1 +D 2 +D 3 +D 4 ; g9(D)=1+D 2 +D 3 +D 4 ; g 10 (D) = 1 + D 1 +D 2 +D 4 ; g 11 (D) = 1 + D 2 +D 3 +D 4 .
18. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to a value of 6, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 ; g1(D)=1+D 1 +D 2 +D 3 +D 5 ; g2(D)=1+D 3 +D 4 +D 5 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 ; g4(D)=1+D 2 +D 3 +D 4 +D 5 ; g5(D)=1+D 1 +D 3 +D 5 ; g6(D)=1+D 1 +D 2 +D 3 +D 5 ; g7(D)=1+D 1 +D 2 +D 5 ; g8(D)=1+D 2 +D 4 +D 5 ; g9(D)=1+D 2 +D 3 +D 4 +D 5 ; g 10 (D) = 1 + D 1 +D 2 +D 3 +D 5 ; g 11 (D) = 1 + D 1 +D 3 +D 4 +D 5 .
19. The method according to claim 8, characterized in that The constraint length of the convolutional coding is 8, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 2 +D 4 +D 5 +D 7 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ; g2(D)=1+D 3 +D 5 +D 6 +D 7 ; g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ; g4(D)=1+D 1 +D 2 +D 4 +D 7 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ; g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 ; g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ; g9(D)=1+D 1 +D 2 +D 5 +D 7 ; g 10 (D) = 1 + D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ; g 11 (D) = 1 + D 2 +D 5 +D 6 +D 7 。 20. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to 10, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ; g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ; g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ; g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ; g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ; g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ; g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 ; g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ; g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ; g9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ; g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 ; g 11 (D)=1+D 3 +D 5 +D 6 +D 7 +D 9 。 21. The method according to claim 8, characterized in that The constraint length of the convolutional coding is set to 11, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials: g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ; g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ; g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 ; g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ; g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ; g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ; g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 ; g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ; g9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ; g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ; g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 。 22. The method according to any one of claims 9, 10, 11, 13, 14, 15, 17, 18, 19, 20 or 21, characterized in that The T component code generating polynomials include at least the first J component code generating polynomials in the preset component code generating polynomial group; wherein the value of J can be 2, 3, 4, 5, 6, 7, 8, 9 or 10, and J is an integer less than or equal to T.
23. The method according to claim 1, characterized in that The step of performing convolution encoding on the information bit sequence according to T component code generating polynomials to obtain the encoded bit sequence comprises: Convolutionally encode the information bit sequence according to T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials; Interleaving is performed on all or part of the T component code bit sequences to obtain the coded bit sequence.
24. The method according to claim 1, characterized in that The step of performing convolution encoding on the information bit sequence according to T component code generating polynomials to obtain the encoded bit sequence comprises: Convolutionally encode the information bit sequence according to T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials; Perform sub-block interleaving on the i-th component code bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T; The coded bit sequence is determined according to the sub-block interleaved output sequence and other component code bit sequences among the T component code bit sequences except the i-th component code bit sequence.
25. The method according to claim 24, characterized in that The value of i is determined according to one or more of the following: the number of component codes, the code rate, the total number of transmitted bits, the number of resources, the modulation order, and the length of the information bit sequence.
26. A decoding method, characterized in that: The method comprises: receiving all or part of the bits in a coded bit sequence; Convolution decoding is performed on all or part of the bits in the coded bit sequence according to T component code generating polynomials to obtain an information bit sequence.
27. The method according to claim 26, characterized in that The method further comprises: Receiving information related to the coded bit sequence.
28. The method according to claim 26, characterized in that The convolution decoding is implemented based on Viterbi decoding or Viterbi table decoding assisted by cyclic redundancy check CRC.
29. A communication device, characterized in that: include: Memory and processor; The memory is coupled to the processor; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 28 is performed.
30. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a communication device, the communication device is caused to execute the method according to any one of claims 1 to 28.
Citation Information
Patent Citations
Coding and decoding method, communication device and storage medium
CN119011073A
Code modulation method, demodulation and decoding method and system
CN101989887A
Turbo encoder and encoding method
CN102111163A
Coding method and device
CN113472363A
Turbo code decoder device with variable length
CN113872615A
