Coding and decoding method, communication device 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
- CN202310583794.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-22
- Publication Date
- 2024-11-22
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 CN119011073A_ABST
Abstract
Description
Technical Field
[0001] 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
[0002] With the rapid development of technologies such as big data, cloud computing, and delay-sensitive networks, the number of user devices in wireless communication networks has exploded. Wireless communication networks will carry a variety of applications and massive amounts of data, which puts high demands on data transmission rate, throughput, reliability, latency, etc. Currently, with the development of intelligent transportation, intelligent industrial control, and intelligent logistics, the demand for ultra-low latency and ultra-high reliability communications is becoming increasingly strong, and some short packet data needs to be sent and successfully received in a very short time.
[0003] 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 issue that needs to be solved urgently in the industry. Summary of the invention
[0004] The present application provides a coding and decoding method, a communication device and a storage medium for reducing the complexity of convolutional coding.
[0005] In order to achieve the above purpose, this application adopts the following technical solutions:
[0006] In a first aspect, a coding method is provided, the method specifically comprising:
[0007] Obtaining an information bit sequence;
[0008] 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;
[0009] All or part of the bits in the coded bit sequence are sent.
[0010] In a second aspect, a decoding method is provided, the method comprising:
[0011] receiving all or part of the bits in a coded bit sequence;
[0012] 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.
[0013] According to a third aspect, there is provided an encoding device, comprising:
[0014] An acquisition module, used for acquiring an information bit sequence;
[0015] 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;
[0016] The sending module is used to send all or part of the bits in the coded bit sequence.
[0017] In a fourth aspect, a decoding device is provided, located at a second node, including:
[0018] A receiving module, used for receiving all or part of the bits in the coded bit sequence;
[0019] The processing module is used 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.
[0020] 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 method provided in the first aspect or the second aspect above.
[0021] In a sixth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first aspect or the second aspect.
[0022] In a seventh aspect, a computer program product comprising computer instructions is provided. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first aspect or the second aspect.
[0023] Based on the above embodiment, the method can perform convolution encoding on the information bit sequence based on the preset component code generator polynomial, and then obtain the bit sequence to be sent. The present application also provides a plurality of possible implementations of the preset component code generator polynomial under different convolution encoding constraint lengths, and further, since the number of non-zero coefficients in the component code generator polynomial provided by the present application is small, by using the component code generator 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 convolution encoding and increase the robustness of data communication. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] 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.
[0025] Figure 1 A schematic diagram of the architecture of a communication system provided in an embodiment of the present application;
[0026] Figure 2 A schematic diagram of a flow chart of an encoding method provided in an embodiment of the present application;
[0027] Figure 3 A schematic diagram of a convolutional coding process provided in an embodiment of the present application;
[0028] Figure 4 A schematic diagram of another convolutional encoding process provided in an embodiment of the present application;
[0029] Figure 5 A flowchart of a decoding method provided in an embodiment of the present application;
[0030] Figure 6 A schematic diagram of the composition of an encoding device provided in an embodiment of the present application;
[0031] Figure 7 A schematic diagram of the composition of a decoding device provided in an embodiment of the present application;
[0032] Figure 8 A schematic diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0033] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0034] 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 may 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 "plurality" means two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different.
[0035] 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 as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.
[0036] In a wireless communication system, the transmitter performs channel coding on the data to be transmitted to obtain a coded bit sequence, and then maps the coded bit sequence into constellation modulation symbols and sends it to the receiver. In the data transmission channel, data transmission errors may occur due to the influence of factors such as multipath, noise, and interference. The transmitter adds some redundant information to the data to be transmitted through channel coding, and the receiver can restore the original data to be transmitted through this redundant information, that is, eliminate the distortion caused by the data during the transmission process. The receiver needs to perform channel decoding on the received constellation modulation symbols to restore the data to be transmitted.
[0037] Currently, the more commonly used channel coding methods may 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. The decoding performance can be improved by iterative decoding, such as using confidence transfer decoding; the encoding end needs to store the 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. Theoretically, it has been proved that the Shannon limit can be reached when the code length is infinite. The serial cancellation list (SCL) decoding algorithm is generally used; the encoding end still needs to perform more XOR operations and rate matching operations, and the complexity is slightly higher. Convolutional coding groups the input information bits into information groups consisting of one or more bits. The coded output bits of each information group are not only related to the information bits of the group at the current moment, but also to the information bits of other groups at the previous moment.
[0038] Therefore, in order 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 sending all or part of the bits in the coded bit sequence. In this way, the complexity of convolution coding can be reduced.
[0039] 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 (5th
[0040] generation, 5G) communication systems, Wi-Fi systems, and the Third Generation Partnership Project (3rd
[0041] The following are not limited to communication systems related to the 3rd generation partnership project (3GPP), future evolving communication systems (such as the sixth generation (6G) communication system, etc.), or systems integrating multiple systems. Figure 1 Taking the communication system 100 as an example, the method provided in the embodiment of the present application is described. Figure 1 It 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 The following is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application. Figure 1 As shown, the communication system 100 may include one or more network devices and one or more terminal devices. Figure 1 As shown, the communication system 100 may include a network device 110 , a terminal device 120 , a terminal device 130 , a terminal device 140 and a 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 access control, mobility management, attachment and detachment, and gateway selection functions. Alternatively, the core network device is a user plane function (UPF) entity, having data routing / forwarding, Quality of Service (QoS) processing, and other functions. It should be noted that the core network device may also be other devices of the core network, which is not specifically limited in this application.
[0045] In some embodiments, the network device can be used to implement functions such as resource scheduling, wireless resource management, and wireless access control of the terminal device. Specifically, the network device can be any node in a base station 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 nodes. In some embodiments, the communication system 100 may also include different types of base stations, such as a macro cell base station and / or a small cell base station.
[0046] The terminal device may also be referred to as a terminal, user equipment (UE), mobile station, mobile terminal, etc. The terminal device may be an Internet of Things (IoT) device, which is used for various information collection and then forward error correction coding of the data information before sending the data to the base station. The terminal device may also be a mobile phone, a tablet computer, a computer with wireless transceiver function, a car, a tram and other mobile devices. In addition, the terminal device 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. In addition, various types of UE 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, and the like. Various types of UEs may 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 a part of an IoT system.
[0047] It should be noted that Figure 1 This is just an exemplary framework diagram. Figure 1 The number of nodes included in the Figure 1 In addition to the functional nodes shown, the communication system may also include other nodes.
[0048] Need to explain, Figure 1The communication system shown is only for 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 can appreciate 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 in conjunction with the accompanying drawings.
[0050] like Figure 2 As shown, the 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 may 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 may 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] With the above Figure 1 Taking the communication system 100 as an example, the sending end may be a terminal device or a network device in the communication system 100. During the communication process, if the network device sends data to the terminal device and the terminal device receives the data sent by the network device, the network device may be called the sending end. Correspondingly, the terminal device may be called the 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, 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. Furthermore, any component code output bit sequence is obtained by performing XOR based on the input bit and the bits of some shift registers.
[0057] Exemplarily, the convolution encoding process based on multiple shift registers and multiple XOR gates is described below:
[0058] During the convolution coding process, at the 0th clock beat, the transmitter can encode based on the T component code generating polynomials, the data stored in the shift register, and the 0th bit (i.e., the current input bit) of the information bit sequence to obtain T bits. Among them, each shift register stores only 1 bit.
[0059] At the first clock beat, 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 transmitting end can encode based on the adjusted stored data in the shift register, the T component code generating polynomials and the 1st 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 beat.
[0060] Taking the encoding operation of the first clock beat as an example, the encoding operations of the second, third, fourth, ... clock beats are performed 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 can be 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, then 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 if the number of coefficients of the T component code generator polynomials is more, the number of XOR gates is more, so that the complexity of the convolutional encoder is higher. Correspondingly, if the number of coefficients of the T component code generator polynomials is less, the number of XOR gates is less, so that the complexity of the convolutional encoder is lower.
[0063] In some embodiments, the weight of the component code is determined based on the number of "1"s in the component code generating vector, that is, the number of non-zero coefficients in the T component code generating polynomials. And, 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 constraint length of the convolutional coding is determined based on the highest power of the polynomial in the T component code generator polynomials. Exemplarily, the constraint length of the convolutional coding 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 constraint length of the convolutional coding may be at least one of the following: 5, 6, 7, 8, 9, 10, 11. In one example, the constraint length of the convolutional coding is 7 and 9. In another example, the constraint length of the convolutional coding is 5 and 9. In yet another example, the constraint length of the convolutional coding is equal to 7 and 11. In yet another example, the constraint length of the convolutional coding is 7, 9, and 11.
[0066] In a possible implementation, the transmitter may perform convolution encoding on the information bit sequence according to the T component code generating polynomials to obtain T component code bit sequences obtained by the T component code generating polynomials. Then, all or part of the component code bit sequences in the T component code bit sequences are interleaved to obtain a coded bit sequence.
[0067] In another possible implementation, the transmitter may 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. Then, the i-th component code bit sequence is sub-block interleaved to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T, and the coding bit sequence is determined 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. In some embodiments, 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.
[0068] Exemplarily, the implementation method can be specifically implemented as the following steps S1-S4:
[0069] S1. Convolutionally encode 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 may 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 may 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 i-th component code output bit sequence is sub-block interleaved. Assume that the i-th component code output bit sequence input to the sub-block interleaving is d0 (i) , d1 (i) , d2 (i) , …, The length is K. In some embodiments, the sub-block interleaving is implemented by a matrix interleaver, wherein 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 satisfying the following inequality is the number of rows (R×C)≥K.
[0074] For example, if (R×C)≥K, 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 Among them, 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 by 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], and the jth column of the permuted matrix block corresponds to the P(j)th column in the original matrix block, where j is equal to 0, 1, 2, ..., 31. The matrix of size R rows and C columns after column permutation is read sequentially from column 0, and if the read data is a NULL bit, it is skipped to obtain the sub-block interleaved output sequence corresponding to the i-th component code, whose length is equal to 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), and 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 is composed of the t-th component code output bit sequence, 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 is 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, so that the interleaving of the convolutional coding can be reduced, and the complexity of the coding can be reduced.
[0079] S4. Perform bit selection on the coded bit sequence to obtain a bit sequence to be sent, and send the bit sequence to be sent.
[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, and if the last bit is selected, selection continues from the first bit, and selection stops if the required number of bits is obtained.
[0082] In some embodiments, the T component code generating polynomials can be determined from a preset component code generating polynomial group. Also, in some embodiments, all the T component code generating polynomials can also form another preset component code generating polynomial group, that is, all the T component code generating polynomials in the preset component code generating polynomial group are used for convolution coding. Several possible implementations from the preset component code generating polynomial group are shown below:
[0083] Implementation method 1: The value of the constraint length of the convolutional coding is 7. At this time, 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 preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0084] g0(D)=1+D 2 +D 3 +D 5 +D 6 ;
[0085] g1(g)=1+D 1 +D 2 +D 3 +D 6 ;
[0086] g2(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0087] g3(D)=1+D 2 +D 5 +D 6 .
[0088] 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 value of each generating vector corresponds to the high power of the component code generating polynomial, and the first value corresponds to the low power of the component code generating polynomial. Thus, 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 should be noted that the three representation methods used in this article for convolutional coding: component code generator polynomial, binary representation of component code generator vector, octal representation of component code generator polynomial, these three representation methods are completely equivalent, any component code generator polynomial will have a corresponding binary representation of component code generator vector and an octal representation of component code generator polynomial. Therefore, when describing convolutional coding, you can use only any one of the representation methods, for example, you can use only octal representation of component code generator polynomial to describe convolutional coding, or you can use only component code generator polynomial to describe convolutional coding, or you can use only binary representation of component code generator vector to describe convolutional coding.
[0089] In some embodiments, the weight of the four component codes obtained based on the component code generating polynomials is equal to 19, and the weight of the component code refers to the number of "1" in the four component code generating vectors. Generally speaking, the number of "1" in the generating vector is proportional to the number of XOR gates required, that is, the more "1" the number, the more XOR gates are required, and the higher the complexity. Under the same performance, if the number of "1" in the generating vector is less, the corresponding hardware implementation is more favorable, that is, simpler.
[0090] If the information bit sequence is b0, b1, b2, b3, ..., b K-1 , the convolutional coding process is as follows Figure 3 As shown, 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 non-delayed bit (1 information bit), 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), the output of the fifth shift register (after 5 delays, corresponding to shift register S4), and the output of the sixth shift register (after 6 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 XORing the delay-free 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).
[0091] In one example, the preset component code generating polynomial group includes the following component code generating polynomial: 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 component 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 generating polynomial is g3=123.
[0092] In some embodiments, the convolutional coding method may be tail-biting convolutional code (TBCC). Figure 3 The initial values of the six shift registers in can be equal to the values of the last six bits of the information bit sequence to ensure that the first state and the last state of the convolutional coding are the same.
[0093] 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 C k (0) , C k (1) , …, C k (T-1) , where k = 0, 1, ..., K-1. Exemplarily, when the code rate used for convolutional coding is 1 / 2, encoding by component code generating polynomials g0(D) and g1(D) can obtain a total of 2 component code output bit sequences, and T = 2. When the code rate is 1 / 4, encoding by component code generating polynomials g0(D), g1(D), g2(D) and g3(D) can obtain a total of 4 component code output bit sequences, and T = 4.
[0094] Furthermore, if Figure 4 As shown, the obtained component code output bit sequence can also be converted into a parallel-serial sequence to obtain the output bit sequence C corresponding to the kth bit in the information bit sequence. k (0) , C k (1) , …, C k (T-1) , with a length of 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:
[0095] j = 0;
[0096] for k=0to K-1
[0097] for i=0to T-1
[0098] d j =C k (i) ;
[0099] j=j+1;
[0100] end for
[0101] end for.
[0102] Implementation method 2, the constraint length of the convolutional coding is 7, and the number of shift registers required at this time can be 7-1=6, the highest power of the preset component code generating polynomial group is 6, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0103] g0(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0104] g1(D)=1+D 3 +D 4 +D 5 +D 6 ;
[0105] g2(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0106] g3(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0107] g4(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0108] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ;
[0109] g6(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0110] g7(D)=1+D 1 +D 4 +D 6 ;
[0111] g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ;
[0112] g9(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0113] g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ;
[0114] g 11 (D) = 1 + D 2 +D 3 +D 4 +D 6 .
[0115] 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. When expressed in binary, the component code generating vectors are: {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1},
[0116] {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,0,1,1},
[0117] {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},
[0118] {1,0,0,1,1,1,1} and {1,0,1,1,1,0,1}.
[0119] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group, where T may be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0120] In some embodiments, the T component code generating polynomials used in the convolutional coding include at least the first J component code generating polynomials of the above 12 generating 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.
[0121] In one example, the convolutional 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.
[0122] In another example, the convolutional coding uses at least three of the above 12 generating polynomials to obtain the 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.
[0123] In another example, the convolutional 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.
[0124] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to obtain the 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.
[0125] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to obtain the 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(g)=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.
[0126] 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 generating polynomials are 155, 127, and 145. When expressed in binary, the component code generating vectors are {1,1,0,1,1,0,1}, {1,0,1,0,1,1,1}, and {1,1,0,0,1,0,1}.
[0127] 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.
[0128] Implementation method 3, the value of the constraint length of the convolutional coding is 7, and the number of shift registers required at this time can be 7-1=6, the highest power of the preset component code generating polynomial group is 6, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0129] g0(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ;
[0130] g1(D)=1+D 2 +D 3 +D 5 +D 6 ;
[0131] g2(D)=1+D 1 +D 4 +D 6 ;
[0132] g3(D)=1+D 3 +D 4 +D 5 +D 6 ;
[0133] g4(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0134] g5(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ;
[0135] g6(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0136] g7(D)=1+D 1 +D 3 +D 6 ;
[0137] g8(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ;
[0138] g9(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0139] g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ;
[0140] g 11 (D)=1+D 2 +D 4 +D 5 +D 6 。
[0141] 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. When expressed in binary, the component code generating vectors are: {1,1,1,1,1,0,1}, {1,0,1,1,0,1,1},
[0142] {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},
[0143] {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},
[0144] {1,0,0,1,1,1,1} and {1,0,1,0,1,1,1}.
[0145] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group, where T may be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0146] 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.
[0147] Exemplarily, the transmitting end may use 2, 3, 4, 5, 6, 8, 10 or 12 of the above 12 component code generating polynomials for 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.
[0148] 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 +
[0149] D 4 +D 6 and 1+D 2 +D 4 +D 5 +D 6 The octal numbers corresponding to the component code generating polynomials are 175, 145, 127, 151, 137, 155 and 127 respectively. When expressed in binary, the component code generating vectors are {1,1,1,1,1,0,1}, {1,1,0,0,1,0,1},
[0150] {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}.
[0151] 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.
[0152] Implementation method 4: The constraint length of the convolutional coding is 7. At this time, the number of shift registers required may 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:
[0153] g0(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0154] g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ;
[0155] g2(D)=1+D 2 +D 5 +D 6 ;
[0156] g3(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0157] g4(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0158] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ;
[0159] g6(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0160] g7(D)=1+D 3 +D 5 +D 6 ;
[0161] g8(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ;
[0162] g9(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0163] g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ;
[0164] g 11 (D)=1+D 2 +D 4 +D 5 +D 6 .
[0165] 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,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,0,0,1,1,1,1} and {1,0,1,0,1,1,1}.
[0166] 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 .
[0167] 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.
[0168] Exemplarily, the transmitting end may use 2, 3, 4, 5, 6, 8, 10 or 12 of the above 12 component code generating polynomials for 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.
[0169] 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 generating polynomials are 155, 137, 127, 113 and 175 respectively. When expressed in binary, the component code generating 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}.
[0170] 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.
[0171] Implementation method 5, the constraint length of the convolutional coding is 7, and the number of shift registers required at this time may be 7-1=6, the highest power of the preset component code generating polynomial group is 6, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0172] g0(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0173] g1(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0174] g2(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0175] g3(D)=1+D 3 +D 4 +D 5 +D 6 .
[0176] The octal numbers corresponding to the component code generating polynomials are 171, 155, 127 and 117. When expressed in binary, the component code generating 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}.
[0177] 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. Exemplarily, if the encoding rate of 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 .
[0178] 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.
[0179] Implementation method 6: The value of the constraint length of the convolutional coding is 9. In this case, the number of shift registers required may 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:
[0180] g0(D)=1+D 2 +D 3 +D 4 +D 8 ;
[0181] g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0182] g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0183] g3(D)=1+D 2 +D 4 +D 7 +D 8 ;
[0184] g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ;
[0185] g5(D)=1+D 3 +D 5 +D 6 +D 8 ;
[0186] g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0187] g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0188] g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0189] g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ;
[0190] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 6 +D 8 ;
[0191] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0192] The octal numbers corresponding to the above 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},
[0193] {1,1,1,0,0,1,1,0,1}, {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,0,1,0,1,1,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}.
[0194] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[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, where J can be 4, 5, 6, 7, 8, 9 or 10, and J is an integer less than or equal to T.
[0196] In one example, the convolutional 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 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.
[0197] In another example, the convolutional 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.
[0198] In another example, the convolutional 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.
[0199] 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 adopted, the component code generation vectors are {1,1,1,0,0,1,1,0,1}, {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,1,1,0,0,1,0,1}, {1,1,0,1,0,1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,1,0,1,1,1,0,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.
[0200] 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.
[0201] Implementation method 7, the value of the constraint length of the convolutional coding is 9, and the number of shift registers required at this time may be 9-1=8, the highest power of the preset component code generating polynomial group is 8, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0202] g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0203] g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ;
[0204] g2(D)=1+D 1 +D 2 +D 5 +D 8 ;
[0205] g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 ;
[0206] g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ;
[0207] g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0208] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0209] g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ;
[0210] g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0211] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0212] g 10 (D)=1+D 2 +D 3 +D 5 +D 8 ;
[0213] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 8 .
[0214] The octal numbers corresponding to the above 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},
[0215] {1,1,1,0,0,1,0,0,1}, {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,1}, and {1,1,1,1,0,1,0,1,1}.
[0216] 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. Wherein, T can be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0217] In one example, the convolutional 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 6 +D 7 +D 8 g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ,
[0218] 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.
[0219] In another example, the convolutional 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.
[0220] In another example, the convolutional coding uses at least 6 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. 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.
[0221] In another example, the convolutional 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.
[0222] 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 generating polynomials are 765, 535, 517, 657, 473, 745, 657, 551 and 753 respectively. When expressed in binary, the component code generating 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,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}. Wherein, the value of T can be 2, 3, 4, 5, 6, 7, 8, 10 or 12. In some embodiments, the T component code generating polynomials used in the convolutional coding include at least the first J component code generating polynomials of the above 12 generating 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.
[0223] 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.
[0224] Implementation 8: The value of the constraint length of the convolutional coding is 9. In this case, the number of shift registers required may 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:
[0225] g0(D)=1+D 3 +D 4 +D 6 +D 8 ;
[0226] g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 ;
[0227] g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ;
[0228] g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 ;
[0229] g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ;
[0230] g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0231] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0232] g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ;
[0233] g8(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0234] g9(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0235] g 10 (D)=1+D 3 +D 5 +D 6 +D 8 ;
[0236] g 11 (D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 .
[0237] The octal numbers corresponding to the above 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},
[0238] {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,1},
[0239] {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},
[0240] {1,0,0,1,0,1,1,0,1} and {1,1,1,1,0,1,0,1,1}.
[0241] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group, where the value of T may be 2, 3, 4, 5, 6, 7, 8, 10 or 12.
[0242] 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.
[0243] In one example, the convolutional 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.
[0244] In another example, the convolutional 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. 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.
[0245] In another example, the convolutional 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.
[0246] In another example, the convolutional 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.
[0247] In another example, the convolutional coding uses at least 6 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. 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 ,
[0248] 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.
[0249] In another example, the convolutional 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 ,
[0250] g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 g5(D)=1+D 2 +D 5 +D 6 +D 7 +
[0251] 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 +
[0252] D 5 +D 7 +D 8 Convolutional encoding is performed to obtain a coded bit sequence.
[0253] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0254] g0(D)=1+D 2 +D 4 +D 5 +D 8 ;
[0255] g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 8 ;
[0256] g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ;
[0257] g3(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0258] g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 8 ;
[0259] g5(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0260] g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0261] g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ;
[0262] g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0263] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0264] g 10 (D) = 1 + D 2 +D 3 +D 5 +D 8 ;
[0265] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0266] The octal numbers corresponding to the component code generating polynomials are 531, 477, 673, 715, 565, 745, 753, 671, 745, 657, 551 and 657. When expressed in binary, the component code generating vectors are {1,0,1,0,1,1,0,0,1}, {1,0,0,1,1,1,1,1,1}, {1,1,0,1,1,1,0,1,1}, {1,1,1,0,0,1,1,0,1}, {1,0,1,1,1,0,1,0,1}, {1,1,1,1,0,0,1,0,1}, {1,1,1,1,0,1,0,1} 0,0,1,0,1}, {1,1,1,1,0,1,0,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}, {1,0,1,1,0,1,0,0,1} and {1,1,0,1,0,1,1,1,1}. Furthermore, the transmitter can determine T component code generating polynomials for convolutional coding from the above-mentioned component code generating polynomial group. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10 or 12. In some embodiments, the T component code generating polynomials used in convolutional coding include at least the first J component code generating polynomials among the above 12 generating 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.
[0267] 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.
[0268] Implementation method 9, the value of the constraint length of the convolutional coding is 9, and the number of shift registers required at this time may be 9-1=8, the highest power of the preset component code generating polynomial group is 8, and the preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0269] g0(D)=1+D 2 +D 3 +D 4 +D 8 ;
[0270] g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0271] g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0272] g3(D)=1+D 2 +D 4 +D 7 +D 8 .
[0273] 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 generation 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 generation polynomial is g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 , the corresponding binary representation component code generation vector is {1,1,1,0,0,1,1,0,1}, and the corresponding octal number is 715. The third component code generation polynomial is at least one of the following: 1+D 2 +D 5 +D 6 +D 7 +D 8 , 1+D 2 +D 4 +D 5 +D 6 +D 7 +D 8 , 1+D 3 +D 4 +D 5 +D 6 +D 8 , 1+D 2 +D 4 +D 5 +D 6 +D 8 , 1+D 2 +D 3 +D 6 +D 7 +D 8 , 1+D 2 +D 4 +D 7 +D 8 or 1+D 1 +D 4 +D 6 +D 8 That is, the component code generation 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},
[0274] {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}. Accordingly, the component code generating polynomial corresponding to the third component code is at least one of the following octal numbers: 517, 537, 475, 535, 547, 523, and 625.
[0275] 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, and if the convolution code rate is 1 / 4, the value of T can be 4.
[0276] In one example, the convolutional coding uses at least the above 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.
[0277] In another example, the convolutional coding uses at least the above generating polynomial g0(D)=1+
[0278] 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.
[0279] In yet another example, the convolutional coding uses at least the above generating polynomial g0(D)=1+
[0280] 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.
[0281] In yet another example, the convolutional coding uses at least the above generating polynomial g0(D)=1+
[0282] 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.
[0283] Implementation 10: The constraint length of the convolutional coding is 9. At this time, the number of shift registers required can be 9-1=8. The highest power of the preset component code generating polynomial group is 8. If the 0th component code generating polynomial in the preset component code generating polynomial is g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 , corresponding to the binary representation of the component code generation vector is
[0284] {1,0,1,1,0,1,1,1,1}, 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 representation component code generation vector is {1,1,1,0,0,1,0,0,1}, and the corresponding octal number is 711. The third component code generation polynomial is at least one of the following: 1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 ; 1+D 1 +D 2 +D 4 +D 6 +D 8 ; 1+D 2 +D 4 +D 5 +D 6 +D 8 ; 1+D 3 +D 4 +D 5 +D 6 +D 8 ; 1+D 2 +D 3 +D 4 +D 5 +D 6 +D 8 ; 1+D 4 +D 5 +D 6 +D 8 Correspondingly, the component code generation 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},
[0285] {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}. And the component code generating polynomial corresponding to the third component code is at least one of the following octal numbers: 765, 725, 535, 475, 575 and 435.
[0286] 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, and if the convolution code rate is 1 / 4, the value of T can be 4.
[0287] In one example, the convolutional coding uses at least the above 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.
[0288] Implementation 11: The value of the constraint length of the convolutional coding is 5. At this time, the number of shift registers required may be 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:
[0289] g0(D)=1+D 3 +D 4 ;
[0290] g1(D)=1+D 1 +D 2 +D 4 ;
[0291] g2(D)=1+D 2 +D 3 +D 4 ;
[0292] g3(D)=1+D 1 +D 3 +D 4 ;
[0293] g4(D)=1+D 1 +D 2 +D 4 ;
[0294] g5(D)=1+D 2 +D 3 +D 4 ;
[0295] g6(D)=1+D 1 +D 2 +D 4 ;
[0296] g7(D)=1+D 2 +D 3 +D 4 ;
[0297] g8(D)=1+D 1 +D 2 +D 3 +D 4 ;
[0298] g9(D)=1+D 2 +D 3 +D 4 ;
[0299] g 10 (D) = 1 + D 1 +D 2 +D 4 ;
[0300] g 11 (D) = 1 + D 2 +D 3 +D 4 .
[0301] The octal numbers corresponding to the above component code generating polynomials are 23, 35, 27, 33, 35, 27, 35, 27, 37, 27, 35 and 27. When expressed 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},
[0302] {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}.
[0303] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[0304] 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.
[0305] In one example, the convolutional 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.
[0306] In another example, the convolutional 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. 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.
[0307] In another example, the convolutional 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.
[0308] In another example, the convolutional 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 ,
[0309] 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.
[0310] In another example, the convolutional coding uses at least 6 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. 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 ,
[0311] 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.
[0312] In another example, the convolutional 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 ,
[0313] g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +
[0314] 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 encoding to obtain a coded bit sequence.
[0315] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0316] g0(D)=1+D 1 +D 4 ;
[0317] g1(D)=1+D 2 +D 3 +D 4 ;
[0318] g2(D)=1+D 1 +D 2 +D 4 ;
[0319] g3(D)=1+D 1 +D 3 +D 4 ;
[0320] g4(D)=1+D 1 +D 2 +D 4 ;
[0321] g5(D)=1+D 2 +D 3 +D 4 ;
[0322] g6(D)=1+D 1 +D 2 +D 4 ;
[0323] g7(D)=1+D 2 +D 3 +D 4 ;
[0324] g8(D)=1+D 1 +D 2 +D 3 +D 4 ;
[0325] g9(D)=1+D 2 +d 3 +D 4 ;
[0326] g 10 (D) = 1 + D 1 +D 2 +D 4 ;
[0327] g 11 (D) = 1 + D 2 +D 3 +D 4 .
[0328] The octal numbers corresponding to the component code generating polynomials are 31, 27, 35, 33, 35, 27, 35, 27, 37, 27, 35 and 27. When expressed in binary, the component code generating vectors are {1,1,0,0,1}, {1,0,1,1,1}, {1,1,1,0,1}, {1,1,0,1,1},
[0329] {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},
[0330] {1,1,1,0,1} and {1,0,1,1,1}. Furthermore, the transmitter can determine T component code generating polynomials for convolution coding from the above component code generating polynomial group. In some embodiments, the T component code generating polynomials used in convolution coding include at least the first J component code generating polynomials of the above 12 generating 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.
[0331] In one example, the convolutional 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.
[0332] In another example, the convolutional 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 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.
[0333] In another example, the convolutional 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.
[0334] In another example, the convolutional 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 ,
[0335] 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.
[0336] In another example, the convolutional coding uses at least 6 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 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 ,
[0337] 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.
[0338] In another example, the convolutional 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 ,
[0339] g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +
[0340] 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 encoding to obtain a coded bit sequence.
[0341] Implementation 12: The value of the constraint length of the convolutional coding is 6. In this case, the number of shift registers required may be 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:
[0342] g0(D)=1+D 2 +D 4 +D 5 ;
[0343] g1(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0344] g2(D)=1+D 3 +D 4 +D 5 ;
[0345] g3(D)=1+D 1 +D 3 +D 4 +D 5 ;
[0346] g4(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0347] g5(D)=1+D 1 +D 3 +D 5 ;
[0348] g6(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0349] g7(D)=1+D 1 +D 2 +D 5 ;
[0350] g8(D)=1+D 2 +D 4 +D 5 ;
[0351] g9(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0352] g 10 (D)=1+D 1 +D 2 +D 3 +D 5 ;
[0353] g 11 (D)=1+D 1 +D 3 +D 4 +D 5 。
[0354] The octal numbers corresponding to the above component code generating polynomials are 53, 75, 47, 67, 57, 65, 75, 71, 53, 57, 75 and 67. When expressed 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},
[0355] {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},
[0356] {1,0,1,1,1,1}, {1,1,1,1,0,1}, and {1,1,0,1,1,1}.
[0357] 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.
[0358] 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.
[0359] In one example, the convolutional 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.
[0360] In another example, the convolutional 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. 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.
[0361] In another example, the convolutional 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.
[0362] In another example, the convolutional 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.
[0363] In another example, the convolutional coding uses at least 6 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. 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.
[0364] In another example, the convolutional 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.
[0365] 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.
[0366] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0367] g0(D)=1+D 1 +d 3 +D 5 ;
[0368] g1(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0369] g2(D)=1+D 1 +d 2 +D 5 ;
[0370] g3(D)=1+D 1 +D 2 +D 4 +D 5 ;
[0371] g4(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0372] g5(D)=1+D 2 +D 4 +D 5 ;
[0373] g6(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0374] g7(D)=1+D 3 +D 4 +D 5 ;
[0375] g8(D)=1+D 1 +D 3 +D 5 ;
[0376] g9(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0377] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 5 ;
[0378] g 11 (D) = 1 + D 1 +D 2 +D 4 +D 5 .
[0379] The octal numbers corresponding to the above component code generating polynomials are: 65, 57, 71, 73, 75, 53, 57, 47, 65, 57, 75 and 73. When expressed in binary, the component code generating vectors are {1,1,0,1,0,1}, {1,0,1,1,1,1}, {1,1,1,0,0,1},
[0380] {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},
[0381] {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 transmitter can determine T component code generating polynomials for convolution coding from the above-mentioned component code generating polynomial group. In some embodiments, the T component code generating polynomials used in convolution coding include at least the first J component code generating polynomials of the above 12 generating polynomials. Among them, 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.
[0382] Implementation 13: The constraint length of the convolutional coding is 8. In this case, the number of shift registers required may be 8-1=7. The highest power of the preset component code generating polynomial group is 7. The preset component code generating polynomial group includes at least one of the following component code generating polynomials:
[0383] g0(D)=1+D 2 +D 4 +D 5 +D 7 ;
[0384] g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ;
[0385] g2(D)=1+D 3 +D 5 +D 6 +D 7 ;
[0386] g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ;
[0387] g4(D)=1+D 1 +D 2 +D 4 +D 7 ;
[0388] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ;
[0389] g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ;
[0390] g7(D)=1+D 2 +D 5 +D 6 +D 7 ;
[0391] g8(D)=1+D 1 +D 3 +d 5 +D 6 +D 7 ;
[0392] g9(D)=1+D 1 +D 2 +D 5 +D 7 ;
[0393] g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ;
[0394] g 11 (D)=1+D 2 +D 5 +D 6 +D 7 。
[0395] 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 expressed in binary, the component code generating 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,0,1,0,0,1}, {1,0,1,1,1,1,0,1}, {1,1,1,0,1,0,1,1}, {1,1,1,0,1,0,1,1},
[0396] {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,1,1,0,1,1}, and {1,0,1,0,0,1,1,1}.
[0397] 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.
[0398] 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.
[0399] In one example, the convolutional 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.
[0400] In another example, the convolutional 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. 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.
[0401] In another example, the convolutional 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.
[0402] In another example, the convolutional 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.
[0403] In another example, the convolutional coding uses at least 6 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. 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.
[0404] In another example, the convolutional 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.
[0405] 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.
[0406] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0407] g0(D)=1+D 2 +D 3 +D 5 +D 7 ;
[0408] g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 ;
[0409] g2(D)=1+D 1 +D 2 +D 4 +D 7 ;
[0410] g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ;
[0411] g4(D)=1+D 3 +D 5 +D 6 +D 7 ;
[0412] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ;
[0413] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ;
[0414] g7(D)=1+D 1 +D 2 +D 5 +D 7 ;
[0415] g8(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ;
[0416] g9(D)=1+D 2 +D 5 +D 6 +D 7 ;
[0417] g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ;
[0418] g 11 (D)=1+D 1 +D 2 +D 5 +D 7 。
[0419] 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,0,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,1,0,1,1,1,1,1} and {1,1,1,0,0,1,0,1}.
[0420] 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.
[0421] 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.
[0422] In one example, the convolutional 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.
[0423] In another example, the convolutional 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. 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.
[0424] In another example, the convolutional 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.
[0425] In another example, the convolutional 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.
[0426] In another example, the convolutional coding uses at least 6 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. 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.
[0427] Implementation 14: The value of the constraint length of the convolutional coding is 10. In this case, the number of shift registers required may be 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:
[0428] g0(D)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ;
[0429] g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0430] g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ;
[0431] g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ;
[0432] g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ;
[0433] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ;
[0434] g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 ;
[0435] g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ;
[0436] g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ;
[0437] g9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ;
[0438] g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0439] g 11 (D) = 1 + D 3 +D 5 +D 6 +D 7 +D 9 .
[0440] The octal numbers corresponding to the above 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},
[0441] {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},
[0442] {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},
[0443] {1,0,1,0,0,1,1,1,1,1}, {1,1,0,1,1,0,0,1,0,1}, {1,1,1,1,1,0,1,0,1,1},
[0444] {1,1,0,1,1,1,1,0,0,1}, and {1,0,0,1,0,1,1,1,0,1}.
[0445] 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.
[0446] 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.
[0447] In one example, the convolutional 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.
[0448] In another example, the convolutional 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 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.
[0449] In another example, the convolutional 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.
[0450] In another example, the convolutional 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.
[0451] In another example, the convolutional coding uses at least 6 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 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.
[0452] In another example, the convolutional 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 +g 5 +D 6 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain a coded bit sequence.
[0453] 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.
[0454] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0455] g0(D)=1+D 1 +D 3 +D 4 +D 6 +D 8 +D 9 ;
[0456] g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 ;
[0457] g2(D)=1+D 1 +D 2 +D 3 +D 7 +D 9 ;
[0458] g3(D)=1+D 1 +D 2 +D 5 +D 7 +D 8 +D 9 ;
[0459] g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 9 ;
[0460] g5(D)=1+D 3 +D 4 +D 6 +D 7 +D 8 +D 9 ;
[0461] g6(D)=1+D 1 +D 2 +D 4 +D 6 +d 8 +D 9 ;
[0462] g7(D)=1+D 1 +D 2 +D 3 +D 4 +D 7 +D 9 ;
[0463] g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 ;
[0464] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 +D 9 ;
[0465] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ;
[0466] g 11 (D) = 1 + D 2 +D 3 +D 4 +D 6 +D 9 .
[0467] 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 binary representation is adopted, the component code generating vectors correspond to
[0468] {1,1,0,1,1,0,1,0,1,1}, {1,0,0,1,1,1,1,0,1}, {1,1,1,1,0,0,0,1,0,1},
[0469] {1,1,1,0,0,1,0,1,1,1}, {1,0,1,1,1,0,1,0,0,1}, {1,0,0,1,1,0,1,1,1,1},
[0470] {1,1,1,0,1,0,1,0,1,1}, {1,1,1,1,1,0,0,1,0,1}, {1,0,1,0,0,1,1,0,1,1},
[0471] {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}.
[0472] Furthermore, the transmitting end can determine T component code generating polynomials for convolution coding from the above-mentioned component code generating polynomial group. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generating polynomials used in convolution coding include at least the first J component code generating polynomials of the above 12 generating polynomials. Among them, 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.
[0473] Implementation 15: The value of the constraint length of the convolutional coding is 11. In this case, the number of shift registers required may be 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:
[0474] g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ;
[0475] g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ;
[0476] g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 ;
[0477] g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0478] g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0479] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ;
[0480] g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ;
[0481] g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 ;
[0482] g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ;
[0483] g9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0484] g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ;
[0485] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 .
[0486] The octal numbers corresponding to the above 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},
[0487] {1,1,0,1,1,1,1,0,0,0,1}, {1,1,1,0,1,1,1,0,1,0,1}, {1,1,0,0,1,1,1,0,1,1},
[0488] {1,0,1,0,1,0,0,1,1,1,1}, {1,0,1,1,1,1,0,1,1,0,1}, {1,0,0,1,1,1,0,1,0,1,1},
[0489] {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},
[0490] {1,1,1,1,1,0,1,1,0,0,1} and {1,1,1,1,0,1,0,1,0,1,1}.
[0491] 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.
[0492] 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.
[0493] In one example, the convolutional 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.
[0494] In another example, the convolutional 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. 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.
[0495] In another example, the convolutional 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 ,
[0496] 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.
[0497] In another example, the convolutional 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 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 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.
[0498] In another example, the convolutional coding uses at least 6 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. 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 And convolution encoding is performed to obtain a coded bit sequence.
[0499] In another example, the convolutional 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.
[0500] 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.
[0501] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0502] g0(D)=1+D 3 +D 4 +D 5 +D 7 +D 10 ;
[0503] g1(D)=1+D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0504] g2(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 +D 9 +D 10 ;
[0505] g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 +D 10 ;
[0506] g4(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ;
[0507] g5(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 +D 10 ;
[0508] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 10 ;
[0509] g7(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0510] g8(D)=1+D 1 +D 2 +D 4 +D 5 +D 8 +D 10 ;
[0511] g9(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ;
[0512] g 10 (D)=1+D 3 +D 4 +D 6 +D 7 +D 8 +D 9 +D 10 ;
[0513] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 7 +D 8 +D 9 +D 10 .
[0514] 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 binary representation is adopted, the component code generating vectors are:
[0515] {1,0,0,1,1,1,0,1,0,0,1}, {1,0,0,0,1,1,1,0,1,1}, {1,0,1,0,1,1,1,0,1,1,1},
[0516] {1,1,0,1,1,1,1,0,0,1,1}, {1,1,1,1,0,0,1,0,1,0,1}, {1,0,1,1,0,1,1,1,1,0,1},
[0517] {1,1,0,1,0,1,1,1,0,0,1}, {1,0,0,1,1,1,1,0,1,1}, {1,1,1,0,1,1,0,0,1,0,1},
[0518] {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}.
[0519] Furthermore, the transmitting end can determine T component code generating polynomials for convolution coding from the above-mentioned component code generating polynomial group. The value of T can be 2, 3, 4, 5, 6, 7, 8, 10, or 12. In some embodiments, the T component code generating polynomials used in convolution coding include at least the first J component code generating polynomials of the above 12 generating polynomials. Among them, 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.
[0520] S103: Send all or part of the bits in the coded bit sequence.
[0521] In some embodiments, the transmitter may immediately send the generated T bits after convolution encoding T bits for every 1 bit of the input information bit sequence.
[0522] Alternatively, the transmitting end may perform convolution coding on all bits of the information bit sequence to obtain K*T bits, and then send the K*T bits in sequence.
[0523] 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 with a length of K bits), and send each component code encoded output bit after interleaving.
[0524] 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, and then perform bit selection to obtain a rate-matched bit sequence, and send the rate-matched bit sequence.
[0525] Based on the above embodiment, the method can perform convolution encoding on the information bit sequence based on the preset component code generator polynomial, and then obtain the bit sequence to be sent. The present application also provides a plurality of possible implementations of the preset component code generator polynomial under different convolution encoding constraint lengths, and further, since the number of non-zero coefficients in the component code generator polynomial provided by the present application is small, by using the component code generator 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 convolution encoding and increase the robustness of data communication.
[0526] In some embodiments, the present application also provides a decoding method, such as Figure 5 As shown, the method comprises the following steps:
[0527] S201. Receive all or part of the bits in a coded bit sequence.
[0528] The receiving end receives all or part of the bits in the coded bit sequence and can perform decoding operations on all or part of the bits in the coded bit sequence. Figure 1 Taking the communication system 100 as an example, the receiving end may be a terminal device or a network device in the communication system 100. During the communication process, if the network device sends data to the terminal device and the terminal device receives the data sent by the network device, the network device may be referred to as the sending end. Correspondingly, the terminal device may be referred to as the receiving end.
[0529] S202. 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.
[0530] Wherein, T is an integer greater than 1. Exemplarily, the value of T includes 2, 3, 4, 6, 8, 10 or 12.
[0531] In some embodiments, the receiving end may also receive relevant information of the coded bit sequence. Exemplarily, the relevant information may include T component code generating polynomials.
[0532] In some embodiments, the receiving end may also preset T component code generating polynomials, and the T component code generating polynomials 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.
[0533] In some embodiments, the constraint length of the convolutional coding is determined based on the highest power of the polynomial in the T component code generator polynomials. Exemplarily, the constraint length of the convolutional coding can be the sum of the highest power of the polynomial in the T component code generator polynomials plus 1.
[0534] In some embodiments, the constraint length of the convolutional coding may be at least one of the following: 5, 6, 7, 8, 9, 10, 11. In one example, the constraint length of the convolutional coding is 7 and 9. In another example, the constraint length of the convolutional coding is 5 and 9. In yet another example, the constraint length of the convolutional coding is equal to 7 and 11. In yet another example, the constraint length of the convolutional coding is 7, 9, and 11.
[0535] In one example, when the value of the convolution code is 7, the number of shift registers required may be 7-1=6, and the highest power of the preset component code generator polynomial group is 6. The above T component code generator polynomials can be determined from the following component code generator polynomials:
[0536] g0(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0537] g1(D)=1+D 3 +D 4 +D 5 +D 6 ;
[0538] g2(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0539] g3(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0540] g4(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0541] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ;
[0542] g6(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0543] g7(D)=1+D 1 +D 4 +D 6 ;
[0544] g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ;
[0545] g9(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0546] g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ;
[0547] g 11 (D) = 1 + D 2 +D 3 +D 4 +D 6 .
[0548] In another example, when the value of the convolution code is 9, the number of shift registers required may be 9-1=8, and the highest power of the preset component code generator polynomial group is 8. The above T component code generator polynomials can be determined from the following component code generator polynomials:
[0549] g0(D)=1+D 2 +D 3 +D 4 +D 8 ;
[0550] g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0551] g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0552] g3(D)=1+D 2 +D 4 +D 7 +D 8 ;
[0553] g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ;
[0554] g5(D)=1+D 3 +D 5 +D 6 +D 8 ;
[0555] g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0556] g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0557] g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0558] g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ;
[0559] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 6 +D 8 ;
[0560] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0561] In another example, when the value of the convolution code is 5, the number of shift registers required may be 5-1=4, and the highest power of the preset component code generator polynomial group is 4. The above T component code generator polynomials can be determined from the following component code generator polynomials:
[0562] g0(D)=1+D 3 +D 4 ;
[0563] g1(D)=1+D 1 +D 2 +D 4 ;
[0564] g2(D)=1+D 2 +D 3 +D 4 ;
[0565] g3(D)=1+D 1 +D 3 +D 4 ;
[0566] g4(D)=1+D 1 +D 2 +D 4 ;
[0567] g5(D)=1+D 2 +D 3 +D 4 ;
[0568] g6(D)=1+D 1 +D 2 +D 4 ;
[0569] g7(D)=1+D 2 +D 3 +D 4 ;
[0570] g8(D)=1+D 1 +D 2 +D 3 +D 4 ;
[0571] g9(D)=1+D 2 +D 3 +D 4 ;
[0572] g 10 (D) = 1 + D 1 +D 2 +D 4 ;
[0573] g 11 (D) = 1 + D 2 +D 3 +D 4 .
[0574] In another example, when the value of the convolution code is 6, the number of shift registers required may be 6-1=5, and the highest power of the preset component code generator polynomial group is 5. The above T component code generator polynomials may be determined from the following component code generator polynomials:
[0575] g0(D)=1+D 2 +D 4 +D 5 ;
[0576] g1(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0577] g2(D)=1+D 3 +D 4 +D 5 ;
[0578] g3(D)=1+D 1 +D 3 +D 4 +D 5 ;
[0579] g4(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0580] g5(D)=1+D 1 +D 3 +D 5 ;
[0581] g6(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0582] g7(D)=1+D 1 +D 2 +D 5 ;
[0583] g8(D)=1+D 2 +D 4 +D 5 ;
[0584] g9(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0585] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 5 ;
[0586] g 11 (D) = 1 + D 1 +D 3 +D 4 +D 5 .
[0587] In another example, when the value of the convolutional code is 8, the number of shift registers required may be 8-1=7, and the highest power of the preset component code generator polynomial group is 7. The above T component code generator polynomials can be determined from the following component code generator polynomials:
[0588] g0(D)=1+D 2 +D 4 +D 5 +D 7 ;
[0589] g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ;
[0590] g2(D)=1+D 3 +D 5 +D 6 +D 7 ;
[0591] g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ;
[0592] g4(D)=1+D 1 +D 2 +D 4 +D 7 ;
[0593] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ;
[0594] g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ;
[0595] G7(d)=1+D 2 +D 5 +D 6 +D 7 ;
[0596] g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ;
[0597] G9(D)=1+D 1 +D 2 +D 5 +D 7 ;
[0598] g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ;
[0599] G 11 (D)=1+D 2 +D 5 +D 6 +D 7 。
[0600] In another example, when the value of the convolutional code is 10, the number of shift registers required may be 10-1=9, and the highest power of the preset component code generator polynomial group is 9. The above T component code generator polynomials can be determined from the following component code generator polynomials:
[0601] G0(d)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ;
[0602] g1(d)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0603] g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ;
[0604] g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ;
[0605] g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ;
[0606] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ;
[0607] g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +d 9 ;
[0608] g7(d)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ;
[0609] g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ;
[0610] G9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ;
[0611] G 10 (D) = 1 + D 1 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0612] G 11 (D) = 1 + D 3 +D 5 +D 6 +D 7 +D 9 .
[0613] In another example, when the value of the convolutional code is 11, the number of shift registers required may be 11-1=10, and the highest power of the preset component code generator polynomial group is 10. The above T component code generator polynomials may be determined from the following component code generator polynomials:
[0614] G0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ;
[0615] G1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ;
[0616] g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 ;
[0617] g3(d)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0618] g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0619] G5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ;
[0620] g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ;
[0621] g7(d)=1+D 1 +D 3 +D 4 +D 5 +D 6 +d 7 +D 10 ;
[0622] g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ;
[0623] G9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0624] G 10 (d) = 1 + D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ;
[0625] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 .
[0626] 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.
[0627] 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.
[0628] The information bit sequence can be convolutionally encoded based on the preset component code generating polynomial to obtain the bit sequence to be sent. 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 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 convolutional coding and increase the robustness of data communication.
[0629] The above mainly introduces the solution provided by the present application from the perspective of interaction between various nodes. It is understandable that each node, such as a device or equipment, includes a hardware structure and / or software module corresponding to each function in order to realize the above functions. It should be easily appreciated by those skilled in the art 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 exceed the scope of the present invention.
[0630] Figure 6 FIG. 1 is a schematic diagram showing the composition of a coding device provided in an embodiment of the present application. Figure 6 As shown, the encoding device 60 includes an acquisition module 601 , a processing module 602 and a sending module 603 .
[0631] In some embodiments, the acquisition module 601 is used to acquire an information bit sequence. The processing module 602 is used 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. The sending module 603 is used to send all or part of the bits in the coded bit sequence.
[0632] In some embodiments, convolutional coding is implemented by multiple shift registers and multiple XOR gates, wherein every two adjacent shift registers in the multiple shift registers are connected in series.
[0633] In some embodiments, the number of shift registers is determined based on the highest power of the T component code generator polynomials.
[0634] In some embodiments, the number of XOR gates is determined based on the number of coefficients of the T component code generator polynomials.
[0635] In some embodiments, the constraint length of the convolutional coding is determined based on the highest power of the polynomial among the T component code generating polynomials.
[0636] In some embodiments, the T component code generating polynomials are determined from a set of preset component code generating polynomials.
[0637] 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 perform interleaving processing on all or part of the component code bit sequences in the T component code bit sequences to obtain a coded bit sequence.
[0638] 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.
[0639] For a more detailed description of the acquisition module 601, the processing module 602 and the sending module 603, as well as 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.
[0640] Figure 7 FIG. 1 is a schematic diagram showing the composition of a decoding device provided in an embodiment of the present application. Figure 7 As shown, the decoding device 70 includes a receiving module 701 and a processing module 702 .
[0641] In some embodiments, the receiving module 701 is used to receive all or part of the bits in the coded bit sequence. The processing module 702 is used 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.
[0642] In some embodiments, the receiving module 701 is used to receive relevant information of the coded bit sequence.
[0643] In some embodiments, the convolutional decoding is implemented based on Viterbi decoding or Viterbi table decoding assisted by a cyclic redundancy check (CRC).
[0644] 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.
[0645] It should be noted that Figure 6 or Figure 7 The modules in the can also be called units, for example, the processing module can be called a processing unit. Figure 6 or Figure 7 In the illustrated embodiment, the names of the modules may not be the names shown in the figure. For example, an acquisition module or a sending module may also be called a communication module.
[0646] Figure 6 or Figure 7 If each unit in the embodiment is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially 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 to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of each embodiment of the present application. The storage medium for storing computer software products includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.
[0647] 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 diagram of the structure of a communication device, which may be the above-mentioned encoding device or decoding device. Figure 8 As shown, the communication device 800 includes: a processor 802 , a communication interface 803 , and a bus 804 . Optionally, the communication device 800 may further include a memory 801 .
[0648] The processor 802 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The 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 devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 802 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
[0649] The communication interface 803 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.
[0650] The memory 801 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices 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 codes in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
[0651] As a possible implementation, the memory 801 may exist independently of the processor 802, and the memory 801 may 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.
[0652] In another possible implementation, the memory 801 may also be integrated with the processor 802 .
[0653] The bus 804 may be an extended industry standard architecture (EISA) bus, etc. The bus 804 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 8 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0654] 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 assigned to 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.
[0655] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium can be the memory or memory of any of the above embodiments. The above computer-readable storage medium can also be an external storage device of the above device or device, 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 device or device. Further, the above computer-readable storage medium can also include both the internal storage unit of the above device or device and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above device or device. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.
[0656] An embodiment of the present application also 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.
[0657] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the present application for which protection is claimed, those skilled in the art may understand and implement other variations of the disclosed embodiments by viewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple situations. A single processor or other unit may implement several functions listed in a claim. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.
[0658] Although the present application has been described in conjunction with specific features and embodiments thereof, it is obvious 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 exemplary illustrations of the present application as defined by the appended claims, and are deemed to have covered 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, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.
[0659] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope 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 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 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 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 ; <h2 style=";text-align:left;direction:ltr">g3(D) = 1 + D<h2 style=";text-align:left;direction:ltr"> 2 <h2 style=";text-align:left;direction:ltr"> +D<h2 style=";text-align:left;direction:ltr"> 5 <h2 style=";text-align:left;direction:ltr"> +D<h2 style=";text-align:left;direction:ltr"> 6 <h2 style=";text-align:left;direction:ltr"> 。 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 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 ; <h2 style=";text-align:left;direction:ltr">g3(D) = 1 + D<h2 style=";text-align:left;direction:ltr"> 1 <h2 style=";text-align:left;direction:ltr"> +D<h2 style=";text-align:left;direction:ltr"> 3 <h2 style=";text-align:left;direction:ltr"> +D<h2 style=";text-align:left;direction:ltr"> 4 <h2 style=";text-align:left;direction:ltr"> ; 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 11, 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 an encoded bit sequence includes: 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; Memory and processor coupling; 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
Cited By
Encoding / decoding method, communication apparatus, and storage medium
EP4718754A1
Encoding / decoding method, communication apparatus, and storage medium
WO2024239718A1
Sequence processing method, first communication node, second communication node, storage medium, and program product
WO2026171029A1
