Coding and decoding method, communication device and storage medium
By performing component code generator multinomial convolutional coding and sub-block interleaving on the information bit sequence, the convolutional coding process is simplified, the problem of high coding complexity in short packet channels is solved, and an efficient communication system is realized.
Patent Information
- Application Number
- CN202310583281.7
- 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 a component code generator polynomial, and the output bit sequence of the component code is interleaved in sub-blocks to reduce the interleaving process of convolutional coding and thus reduce coding complexity.
By simplifying the convolutional coding process, the coding complexity is reduced, the efficiency and reliability of the communication system are improved, and the communication requirements of ultra-low latency and ultra-high reliability are met.
Smart Images

Figure CN119011072A_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 T component code output bit sequences, where T is an integer greater than 1;
[0009] Perform sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T;
[0010] A coding bit sequence is determined according to the sub-block interleaving output sequence and other component code bit sequences among the T component code bit sequences except the i-th component code bit sequence.
[0011] In a second aspect, a decoding method is provided, the method comprising:
[0012] receiving a soft bit sequence to be decoded;
[0013] Perform bit selection on the soft bit sequence to be decoded to obtain soft bit subsequences of T component codes;
[0014] Deblock-interleave the soft bit subsequence of the i-th component code to obtain a deinterleaved bit subsequence of the i-th component code, where i is a non-negative integer less than T;
[0015] The deinterleaved bit subsequence of the ith component code and the soft bit subsequences of the component codes other than the ith component code in the T component codes are convolution-decoded according to the T component code generating polynomials to obtain an information bit sequence.
[0016] According to a third aspect, there is provided an encoding device, comprising:
[0017] An acquisition module, used for acquiring an information bit sequence;
[0018] A processing module, used for performing convolution encoding on the information bit sequence according to T component code generating polynomials to obtain T component code output bit sequences, where T is an integer greater than 1;
[0019] The processing module is further used to perform sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T;
[0020] The processing module is further used to determine the coding bit sequence according to the sub-block interleaving output sequence and other component code bit sequences among the T component code bit sequences except the i-th component code bit sequence.
[0021] According to a fourth aspect, a decoding device is provided, comprising:
[0022] A receiving module, used for receiving a soft bit sequence to be decoded;
[0023] A processing module, used for performing bit selection on the soft bit sequence to be decoded to obtain soft bit subsequences of T component codes;
[0024] The processing module is further used to perform deblock interleaving on the soft bit subsequence of the i-th component code to obtain a deinterleaved bit subsequence of the i-th component code, where i is a non-negative integer less than T;
[0025] The processing module is also used to perform convolution decoding on the deinterleaved bit subsequence of the ith component code and the soft bit subsequences of the other component codes among the T component codes except the ith component code according to the T component code generating polynomials to obtain an information bit sequence.
[0026] 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.
[0027] 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.
[0028] 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.
[0029] Based on the above embodiment, the method can perform convolution encoding on the information bit sequence based on the preset component code generating polynomial, and select one of the component code output bit sequences for sub-block interleaving to obtain a sub-block interleaved output sequence, and determine the coded bit sequence based on the sub-block interleaved output sequence and other component code output bit sequences. In this scheme, sub-block interleaving is not required for other component code output bit sequences, so that the interleaving process of convolution encoding can be reduced to reduce the complexity of encoding. BRIEF DESCRIPTION OF THE DRAWINGS
[0030] 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.
[0031] Figure 1 A schematic diagram of the architecture of a communication system provided in an embodiment of the present application;
[0032] Figure 2 A schematic diagram of a flow chart of an encoding method provided in an embodiment of the present application;
[0033] Figure 3 A schematic diagram of a convolutional coding process provided in an embodiment of the present application;
[0034] Figure 4 A schematic diagram of a coding bit sequence provided in an embodiment of the present application;
[0035] Figure 5 A flowchart of a decoding method provided in an embodiment of the present application;
[0036] Figure 6 A schematic diagram of the composition of an encoding device provided in an embodiment of the present application;
[0037] Figure 7 A schematic diagram of the composition of a decoding device provided in an embodiment of the present application;
[0038] Figure 8 A schematic diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0039] 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.
[0040] 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.
[0041] 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.
[0042] 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.
[0043] 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.
[0044] 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, performing convolution coding on the information bit sequence according to T component code generating polynomials to obtain T component code output bit sequences, T is an integer greater than 1, performing sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence, i is a non-negative integer less than T, and determining 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. In this way, the interleaving process of convolution coding can be reduced to reduce the complexity of coding.
[0045] The method provided in the embodiment of the present application can be applied to various communication systems. For example, the communication system can be a long term evolution (LTE) system, a fifth generation (5G) communication system, a Wi-Fi system, a third generation partnership project (3GPP) related communication system, a future evolution communication system (such as a sixth generation (6G) communication system, etc.), or a system integrating multiple systems, etc., without limitation. 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.
[0046] Figure 1 The following is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application. Figure 1As 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 .
[0047] 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 .
[0048] 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.
[0049] 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.
[0050] 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.
[0051] 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.
[0052] Need to explain, Figure 1 The 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.
[0053] The embodiments provided in this application are described in detail below in conjunction with the accompanying drawings.
[0054] like Figure 2 As shown, an embodiment of the present application provides an encoding method, which includes the following steps:
[0055] S101. Obtain an information bit sequence.
[0056] 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.
[0057] 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.
[0058] S102. Perform convolution encoding on the information bit sequence according to T component code generating polynomials to obtain T component code output bit sequences.
[0059] Wherein, T is an integer greater than 1. Exemplarily, the value of T includes 2, 3, 4, 6, 8, 10 or 12.
[0060] 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.
[0061] Exemplarily, the convolution encoding process based on multiple shift registers and multiple XOR gates is described below:
[0062] In the process of convolutional coding, only one bit is stored in each shift register. 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 (that is, the current input bit) of the information bit sequence to obtain T bits. The T bits correspond to the 0th bit in the T component code output bit sequences.
[0063] 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, where m is the number of the shift registers. Furthermore, the transmitting end can encode based on the adjusted stored data in the shift register, the T component code generating polynomials, and the first bit of the information bit sequence to obtain T bits, which respectively correspond to the first bits in the T component code output bit sequences.
[0064] Taking the encoding operation of the 1st clock beat as an example, the encoding operations of the 2nd, 3rd, 4th, ... clock beats are performed in sequence to obtain the 2nd, 3rd, 4th, ... bits in the T component code output bit sequences respectively, until the K-1th clock beat, the T-1th bit in the T component code output bit sequences can be obtained. Among them, K is the length of the information bit sequence, and K is an integer greater than 0.
[0065] 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.
[0066] 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.
[0067] 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.
[0068] 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.
[0069] 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.
[0070] In some embodiments, the T component code generating polynomials can be determined from a preset component code generating polynomial group. Several possible implementations of generating a polynomial group from a preset component code are shown below:
[0071] 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:
[0072] g0(D)=1+D 2 +D 3 +D 5 +D 6 ;
[0073] g1(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0074] g2(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0075] g3(D)=1+D 2 +D 5 +D 6 .
[0076] 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 bit value of each generating vector corresponds to the high power of the component code generating polynomial, and the first bit 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.
[0077] In some embodiments, the weight of the four component codes obtained based on the above 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. In general, 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.
[0078] 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).
[0079] The preset component code generating polynomial group includes the following component code generating polynomials: g0(D)=1+D 2 +D 3 +D 5 +D 6 ; g1(D)=1+D 1 +D 2 +D 3 +D 6 ; g2(D)=1+D 1 +D 2 +D 4+D 6 ; g3(D)=1+D 2 +D 5 +D 6 Convolution coding is performed based on T=4 component code generating polynomials in the component code generating polynomial group. Then, the component code output bit sequences corresponding to the above 4 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.
[0080] 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.
[0081] For example, the shift register includes S0, S1, S2, S3, S4 and S5, and its initial value is set to S a =b (K-1-a) , a=0, 1, ..., 5. The output corresponding to the ath component code is C (a) , where a = 0, 1, ..., T-1, that is, the k-th bit of the input convolutional coding can obtain the k-th bit of the corresponding T component code output bit sequence represented by 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, convolutional coding using the 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 used is 1 / 4, convolutional coding using the 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.
[0082] 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:
[0083] g0(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0084] g1(D)=1+D 3 +D 4 +D 5 +D 6 ;
[0085] g2(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0086] g3(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0087] g4(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0088] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ;
[0089] g6(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0090] g7(D)=1+D 1 +D4 +D 6 ;
[0091] g8(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ;
[0092] g9(D)=1+D 2 +D 3 +D 4 +D 6 ;
[0093] g 10 (D) = 1 + D 3 +D 4 +D 5 +D 6 ;
[0094] g 11 (D) = 1 + D 2 +D 3 +D 4 +D 6 .
[0095] The octal numbers corresponding to the above component code generating polynomials are 155, 117, 127, 171, 135, 173, 135, 145, 157, 135, 117, and 135 respectively. When binary representation is used, the component code generation vectors are: {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1}, {1,0,1,0,1,1,1}, {1,1,1,1,0,0,1}, {1,0,1,1,1,0,1}, {1,1,1,1,0,1,1}, {1,0,1,1,1,0,1}, {1,1,0,0,1,0,1}, {1,1,0,1,1,1,1}, {1,0,1,1,1,0,1}, {1,0,1,1,1,1,0,1}, {1,0,1,1,1,1,0,1} and {1,0,1,1,1,0,1}.
[0096] 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.
[0097] 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.
[0098] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T = 2 component code output bit sequences.
[0099] In another example, the convolutional coding uses at least three of the above 12 generating polynomials to obtain T=3 component code output bit sequences, for example, at least the above generating polynomial g0(D)=1+D 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 T=3 component code output bit sequences.
[0100] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 And g3(D)=1+D 1 +D 2 +D 3 +D 6 Convolutional encoding is performed to obtain T=4 component code output bit sequences.
[0101] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to obtain T=6 component code output bit sequences, for example, at least the above generating polynomial 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 And g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0102] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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 +D5 +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 T=8 component code output bit sequences.
[0103] 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}.
[0104] 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.
[0105] 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:
[0106] g0(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ;
[0107] g1(D)=1+D 2 +D 3 +D 5 +D 6 ;
[0108] g2(D)=1+D 1 +D 4 +D 6 ;
[0109] g3(D)=1+D 3 +D 4 +D 5 +D 6 ;
[0110] g4(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0111] g5(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 ;
[0112] g6(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0113] g7(D)=1+D 1 +D 3 +D 6 ;
[0114] g8(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ;
[0115] g9(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0116] g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ;
[0117] g 11 (D)=1+D 2 +D 4 +D 5 +D 6 。
[0118] The octal numbers corresponding to the above component code generating polynomials are 175, 133, 145, 117, 127, 157, 165, 151, 137, 155, 117 and 127 respectively. When binary representation is used, the component code generation vectors are: {1,1,1,1,1,0,1}, {1,0,1,1,0,1,1}, {1,1,0,0,1,0,1}, {1,0,0,1,1,1,1}, {1,0,1,0,1,1,1}, {1,1,0,1,1,1,1}, {1,1,0,1,0,1,0,1}, {1,1,0,1,0,0,1}, {1,0,1,1,1,1,1}, {1,1,0,1,0,1,0,1}, {1,0,1,1,1,1,1}, {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1} and {1,0,1,0,1,1,1}.
[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 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.
[0121] 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 T component code output bit sequences. 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 T=2 component code output bit sequences, which are not listed one by one.
[0122] 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 +D4 +D 5 +D 6 , 1+D 1 +D 3 +D 6 , 1+D 2 +D 3 +D 4 +D 5 +D 6 , 1+D 1 +D 3 +D 4 +D 6 and 1+D 2 +D 4 +D 5 +D 6 The octal numbers corresponding to the component code 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}, {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}.
[0123] 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.
[0124] 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:
[0125] g0(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0126] g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 ;
[0127] g2(D)=1+D 2 +D 5+D 6 ;
[0128] g3(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0129] g4(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0130] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 ;
[0131] g6(D)=1+D 1 +D 2 +D 4 +D 6 ;
[0132] g7(D)=1+D 3 +D 5 +D 6 ;
[0133] g8(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 ;
[0134] g9(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0135] g 10 (D)=1+D 3 +D 4 +D 5 +D 6 ;
[0136] g 11 (D)=1+D 2 +D 4 +D 5 +D 6 。
[0137] The octal numbers corresponding to the above component code generating polynomials are 155, 137, 123, 171, 127, 173, 165, 113, 175, 155, 117 and 127 respectively. When binary representation is used, the component code generation vectors are: {1,1,0,1,1,0,1}, {1,0,1,1,1,1,1}, {1,0,1,0,0,1,1}, {1,1,1,1,0,0,1}, {1,0,1,0,1,1,1}, {1,1,1,1,0,1,1}, {1,1,1,0,1,0,1}, {1,0,0,1,0,1,1}, {1,1,1,1,1,0,1}, {1,1,0,1,0,1}, {1,1,0,1,1,0,1}, {1,0,0,1,1,1,1} and {1,0,1,0,1,1,1}.
[0138] 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.
[0139] 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.
[0140] 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 T component code output bit sequences. 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 T=2 component code output bit sequences, which are not listed one by one.
[0141] 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+D2 +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}.
[0142] 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.
[0143] 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:
[0144] g0(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0145] g1(D)=1+D 1 +D 3 +D 4 +D 6 ;
[0146] g2(D)=1+D 2 +D 4 +D 5 +D 6 ;
[0147] g3(D)=1+D 3 +D 4 +D 5 +D 6 .
[0148] The octal numbers corresponding to the above component code generating polynomials are 171, 155, 127 and 117 respectively. When binary representation is adopted, the component code generating vectors are: {1, 1, 1, 1, 0, 0, 1},
[0149] {1, 1, 0, 1, 1, 0, 1}, {1, 0, 1, 0, 1, 1, 1}, and {1, 0, 0, 1, 1, 1, 1}.
[0150] 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 4 component code generating polynomials: g0(D)=1+D 1 +D 2 +D 3 +D 6 ; g1(D)=1+D 1 +D 3 +D 4 +D 6 ; g2(D)=1+D 2 +D 4 +D 5 +D 6 ; g3(D)=1+D 3 +D 4 +D 5 +D 6 .
[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 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:
[0153] g0(D)=1+D 2 +D 3 +D 4 +D 8 ;
[0154] g1(D)=1+D 1 +D 2 +D 3 +D 5+D 7 +D 8 ;
[0155] g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0156] g3(D)=1+D 2 +D 4 +D 7 +D 8 ;
[0157] g4(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 7 +D 8 ;
[0158] g5(D)=1+D 3 +D 5 +D 6 +D 8 ;
[0159] g6(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0160] g7(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0161] g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0162] g9(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ;
[0163] g 10 (D)=1+D 1 +D2 +D 3 +D 6 +D 8 ;
[0164] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 6 +D 7 +D 8 .
[0165] 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}, {1,1,1,0,0,1,1,0,1}, {1,0,1,0,0,1,0,1,1}, {1,0,1,0,0,1,0,0,1,1}, {1,1,1,0,1,0,0,1,1}, {1,0,1,0,0,1,0,0,1,1} , 1,1,0,1}, {1,1,1,1,0,1,0,1,1}, {1,1,0,1,0,1,0,1}, {1,1,0,1,0,1,1,1,1}, {1,1,0,1,1,1,0,0,1}, {1,1,1,1,0,0,1,0,1}, and {1,1,0,1,0,1,1,1,1}.
[0166] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[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 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0168] In one example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, 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 8g2(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 T=4 component code output bit sequences.
[0169] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T=6 component code output bit sequences, for example, 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 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 T=6 component code output bit sequences.
[0170] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, 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 +D5 +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 T=8 component code output bit sequences.
[0171] 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 +D5 +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, each component code generation vector corresponds to {1,1,1,0,0,1,1,0,1}, {1,0,1,0,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,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}, {1,1,0,1,0,1,0,1,0,1}, {1,1,0,1,0,1,1,1,1}. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10 or 12. In some embodiments, the T component code generator polynomials used in 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.
[0172] 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.
[0173] 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:
[0174] g0(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0175] g1(D)=1+D 1 +D 3 +D 4 +D 7 +D 8 ;
[0176] g2(D)=1+D 1 +D 2 +D 5 +D 8 ;
[0177] g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 ;
[0178] g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ;
[0179] g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0180] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0181] g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ;
[0182] g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0183] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0184] g 10 (D) = 1 + D 2 +D 3 +D 5 +D 8 ;
[0185] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 8 .
[0186] 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}, {1,1,1,0,0,1,0,0,1}, {1,1,1,1,0,0,1,0,0,1}, {1,1,1,1,1,0,1,0,1}, {1,0,1,0,0,1,0,0,1}, {1,0,1,0,0,0,1,0,0,1} , 1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,0,0,1,1,1,0,1,1}, {1,1,1,1,0,0,1,0,1}, {1,1,0,1,0,1,1,1,1}, {1,0,1,1,0,1,0,0,1}, and {1,1,1,1,0,1,0,1,1}.
[0187] 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. The value of J can be 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T. T can be equal to 2, 3, 4, 5, 6, 8, 10, or 12.
[0188] In one example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, 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 encoding is performed to obtain T=4 component code output bit sequences.
[0189] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, 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 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D6 +D 8 And g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0190] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, 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 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 T=6 component code output bit sequences.
[0191] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, 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 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 T=8 component code output bit sequences.
[0192] 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 +D5 +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,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.
[0193] 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.
[0194] 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:
[0195] g0(D)=1+D 3 +D 4 +D 6 +D 8 ;
[0196] g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D 8 ;
[0197] g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ;
[0198] g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 ;
[0199] g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 ;
[0200] g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0201] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0202] g7(D)=1+D 3 +D 4 +D 5 +D 7 +D 8 ;
[0203] g8(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 ;
[0204] g9(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0205] g 10 (D) = 1 + D 3 +D 5 +D 6 +D 8 ;
[0206] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 8 .
[0207] 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}, {1,1,0,1,1,1,0,1,1}, {1,0,1,1,0,0,1,1}, {1,0,1,0,1,1,0,0,1,1}, {1,0,1,0,0,1,1,0,1}, {1,0,1,0,0,1,1,0,1} , 1,1,1,1}, {1,1,0,1,0,1,1,1,1}, {1,0,0,1,1,1,0,1,1}, {1,0,1,0,0,1,1,1,1}, {1,1,1,1,0,1,0,1,1}, {1,0,0,1,0,1,1,0,1}, and {1,1,1,1,0,1,0,1,1}.
[0208] 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.
[0209] 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, 10, or 12, and J is an integer less than or equal to T.
[0210] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=2 component code output bit sequences.
[0211] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial 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 And g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +Perform convolutional encoding to obtain T=3 component code output bit sequences.
[0212] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 8g2(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 T=4 component code output bit sequences.
[0213] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial 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 And g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0214] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 +D 6 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 4 +D 5 +D8 g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 g3(D)=1+D 2 +D 3 +D 6 +D 7 +D 8 g4(D)=1+D 2 +D 4 +D 5 +D 6 +D 8 And g5(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0215] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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+D1 +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 T=8 component code output bit sequences.
[0216] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0217] g0(D)=1+D 2 +D 4 +D 5 +D 8 ;
[0218] g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 8 ;
[0219] g2(D)=1+D 1 +D 3 +D 4 +D 5 +D 7 +D 8 ;
[0220] g3(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0221] g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 8 ;
[0222] g5(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0223] g6(D)=1+D 1 +D 2 +D3 +D 5 +D 7 +D 8 ;
[0224] g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 8 ;
[0225] g8(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 ;
[0226] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 ;
[0227] g 10 (D)=1+D 2 +D 3 +D 5 +D 8 ;
[0228] g 11 (D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 。
[0229] 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,0,1,0,1}, {1,1,1,1,0,0,1,0,1}, {1,1,1,1,0,1,0,1}, {1,1,1,1,0,1,0,1} Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above-mentioned component code generating polynomial group. The value of T may be 2, 3, 4, 5, 6, 7, 8, 10 or 12. In some embodiments, the T component code generating polynomials used for convolution coding include at least the first J component code generating polynomials among the above-mentioned 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.
[0230] 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.
[0231] 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:
[0232] g0(D)=1+D 2 +D 3 +D 4 +D 8 ;
[0233] g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 ;
[0234] g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 ;
[0235] g3(D)=1+D 2 +D 4 +D 7 +D 8 .
[0236] 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+D2 +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 generating 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}, {1,0,0,1,1,1,1,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,1,1,0,0,1,1,1}, {1,0,1,0,1,0,0,1,1}, {1,1,0,0,1,0,1,0,1,0,1}. Correspondingly, 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.
[0237] 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.
[0238] 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 T=4 component code output bit sequences. The component code generating polynomials correspond to octal numbers 561, 753, 715 and 523 respectively. In another example, the convolutional coding uses at least the above generating polynomial g0(D)=1+D2 +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 T=4 component code output bit sequences, wherein the component code generating polynomials correspond to octal numbers 561, 753, 715 and 625 respectively.
[0239] In another example, the convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D 5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 2 +D 4 +D 5 +D 6 +D 7 +D 8 Convolutional coding is performed to obtain T=4 component code output bit sequences, wherein the component code generating polynomials correspond to octal numbers 561, 753, 715 and 537 respectively.
[0240] In another example, the convolutional coding uses at least the above-mentioned generating polynomial g0(D)=1+D 2 +D 3 +D 4 +D 8 g1(D)=1+D 1 +D 2 +D 3 +D5 +D 7 +D 8 g2(D)=1+D 1 +D 2 +D 5 +D 6 +D 8 And g3(D)=1+D 1 +D 3 +D 6 +D 8 Convolutional coding is performed to obtain T=component code output bit sequences, wherein the component code generating polynomials correspond to octal numbers 561, 753, 637 and 645 respectively.
[0241] 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 , the corresponding binary representation component code generation vector is {1, 0, 1, 1, 0, 1, 1, 1, 1}, and the corresponding octal number is 557. The first component code generation 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 . Accordingly, the component code generating vector corresponding to the third component code is at least one of the following: {1,1,1,1,1,0,1,0,1}, {1,1,1,0,1,0,1,0,1}, {1,0,1,0,1,1,1,0,1}, {1,0,0,1,1,1,1,0,1}, {1,0,1,1,1,1,1,0,1}, {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.
[0242] 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.
[0243] 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 8Convolutional coding is performed to obtain T=4 component code output bit sequences, wherein the component code generating polynomials correspond to octal numbers 557, 663, 711 and 765 respectively.
[0244] 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:
[0245] g0(D)=1+D 3 +D 4 ;
[0246] g1(D)=1+D 1 +D 2 +D 4 ;
[0247] g2(D)=1+D 2 +D 3 +D 4 ;
[0248] g3(D)=1+D 1 +D 3 +D 4 ;
[0249] g4(D)=1+D 1 +D 2 +D 4 ;
[0250] g5(D)=1+D 2 +D 3 +D 4 ;
[0251] g6(D)=1+D 1 +D 2 +D 4 ;
[0252] g7(D)=1+D 2 +D 3 +D 4 ;
[0253] g8(D)=1+D 1 +D 2 +D 3 +D 4 ;
[0254] g9(D)=1+D 2 +D 3 +D 4 ;
[0255] g10 (D) = 1 + D 1 +D 2 +D 4 ;
[0256] g 11 (D) = 1 + D 2 +D 3 +D 4 .
[0257] 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 respectively. 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}, {1,0,1,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,0,1}, {1,0,1,1,1}, {1,1,1,1,1}, {1,0,1,1,1}, {1,1,1,0,1} and {1,0,1,1,1}.
[0258] Furthermore, the transmitting end may determine T component code generating polynomials for convolution coding from the above component code generating polynomial group.
[0259] 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, 10, or 12, and J is an integer less than or equal to T.
[0260] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 and g1(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain T=2 component code output bit sequences.
[0261] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 And g2(D)=1+D 2 +D3 +D 4 Convolutional encoding is performed to obtain T=3 component code output bit sequences.
[0262] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 And g3(D)=1+D 1 +D 3 +D 4 Convolutional encoding is performed to obtain T=4 component code output bit sequences.
[0263] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D 4 And g4(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0264] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D4 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 T=6 component code output bit sequences.
[0265] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 4 g1(D)=1+D 1 +D 2 +D 4 g2(D)=1+D 2 +D 3 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +D 3 +D 4 g6(D)=1+D 1 +D 2 +D 4 And g7(D)=1+D 2 +D 3 +D 4 ; Perform convolution encoding to obtain T = 8 component code output bit sequences.
[0266] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0267] g0(D)=1+D 1 +D 4 ;
[0268] g1(D)=1+D 2 +D 3 +D 4 ;
[0269] g2(D)=1+D 1 +D 2 +D 4 ;
[0270] g3(D)=1+D 1+D 3 +D 4 ;
[0271] g4(D)=1+D 1 +D 2 +D 4 ;
[0272] g5(D)=1+D 2 +D 3 +D 4 ;
[0273] g6(D)=1+D 1 +D 2 +D 4 ;
[0274] g7(D)=1+D 2 +D 3 +D 4 ;
[0275] g8(D)=1+D 1 +D 2 +D 3 +D 4 ;
[0276] g9(D)=1+D 2 +D 3 +D 4 ;
[0277] g 10 (D)=1+D 1 +D 2 +D 4 ;
[0278] g 11 (D)=1+D 2 +D 3 +D 4 。
[0279] 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}, {1, 1, 1, 0, 1}, {1, 0, 1, 1, 1}, {1, 1, 1, 0, 1}, {1, 0, 1, 1, 1}, {1, 1, 1, 1, 1}, {1, 0, 1, 1, 1}, {1, 1, 1, 0, 1} and {1, 0, 1, 1, 1}. Furthermore, the transmitter can determine T component code generating polynomials for convolutional coding from the above component code generating polynomial group. 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, 10, or 12, and J is an integer less than or equal to T.
[0280] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 4 And g1(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain T=2 component code output bit sequences.
[0281] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=3 component code output bit sequences.
[0282] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 4 g1(D)=1+D 2 +D 3 +D4 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 T=4 component code output bit sequences.
[0283] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 And g4(D)=1+D 1 +D 2 +D 4 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0284] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 And g5(D)=1+D 2 +D 3 +D 4 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0285] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 4 g1(D)=1+D 2 +D 3 +D 4 g2(D)=1+D 1 +D 2 +D 4 g3(D)=1+D 1 +D 3 +D 4 g4(D)=1+D 1 +D 2 +D 4 g5(D)=1+D 2 +D 3 +D 4 g6(D)=1+D 1 +D 2 +D 4 And g7(D)=1+D 2 +D 3 +D 4 ; Perform convolution encoding to obtain T = 8 component code output bit sequences.
[0286] 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:
[0287] g0(D)=1+D 2 +D 4 +D 5 ;
[0288] g1(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0289] g2(D)=1+D 3 +D 4 +D 5 ;
[0290] g3(D)=1+D 1 +D 3 +D 4 +D 5 ;
[0291] g4(D)=1+D2 +D 3 +D 4 +D 5 ;
[0292] g5(D)=1+D 1 +D 3 +D 5 ;
[0293] g6(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0294] g7(D)=1+D 1 +D 2 +D 5 ;
[0295] g8(D)=1+D 2 +D 4 +D 5 ;
[0296] g9(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0297] g 10 (D) = 1 + D 1 +D 2 +D 3 +D 5 ;
[0298] g 11 (D) = 1 + D 1 +D 3 +D 4 +D 5 .
[0299] The octal numbers corresponding to the component code generating polynomials are 53, 75, 47, 67, 57, 65, 75, 71, 53, 57, 75 and 67. When 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}, {1,0,1,1,1,1}, {1,1,0,1,0,1}, {1,1,1,1,0,1}, {1,1,1,0,0,1}, {1,0,1,0,1,1}, {1,0,1,0,1,1}, {1,0,1,1,1,1}, {1,1,1,0,1} and {1,1,0,1,1,1}.
[0300] 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.
[0301] 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, 10, or 12, and J is an integer less than or equal to T.
[0302] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 4 +D 5 and g1(D)=1+D 1 +D 2 +D 3 +D 5 Convolutional encoding is performed to obtain T=2 component code output bit sequences.
[0303] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=3 component code output bit sequences.
[0304] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 And g3(D)=1+D 1+D 3 +D 4 +D 5 Convolutional encoding is performed to obtain T=4 component code output bit sequences.
[0305] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial 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 And g4(D)=1+D 2 +D 3 +D 4 +D 5 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0306] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial 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 And g5(D)=1+D 1 +D 3 +D 5 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0307] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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 And g7(D)=1+D 1 +D 2 +D 5 Convolutional encoding is performed to obtain T=8 component code output bit sequences.
[0308] 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.
[0309] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0310] g0(D)=1+D 1 +D 3 +D 5 ;
[0311] g1(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0312] g2(D)=1+D 1+D 2 +D 5 ;
[0313] g3(D)=1+D 1 +D 2 +D 4 +D 5 ;
[0314] g4(D)=1+D 1 +D 2 +D 3 +D 5 ;
[0315] g5(D)=1+D 2 +D 4 +D 5 ;
[0316] g6(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0317] g7(D)=1+D 3 +D 4 +D 5 ;
[0318] g8(D)=1+D 1 +D 3 +D 5 ;
[0319] g9(D)=1+D 2 +D 3 +D 4 +D 5 ;
[0320] g 10 (D)=1+D 1 +D 2 +D 3 +D 5 ;
[0321] g 11 (D)=1+D 1 +D 2 +D 4 +D 5 。
[0322] 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}, {1,1,1,0,1,1}, {1,1,1,1,0,1}, {1,0,1,0,1,1}, {1,0,1,1,1,1}, {1,0,0,1,1,1}, {1,1,0,1,0,1,1}, {1,0,1,1,1,1}, {1,1,0,1,0,1}, {1,0,1,1,1,1}, {1,1,0,1,0,1} and {1,1,1,0,1,1}. Furthermore, the transmitting end 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 among the above 12 generating polynomials. Wherein, the value of J can be 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0323] 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:
[0324] g0(D)=1+D 2 +D 4 +D 5 +D 7 ;
[0325] g1(D)=1+D 1 +D 2 +D 3 +D 6 +D 7 ;
[0326] g2(D)=1+D 3 +D 5 +D 6 +D 7 ;
[0327] g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ;
[0328] g4(D)=1+D 1 +D 2 +D4 +D 7 ;
[0329] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ;
[0330] g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ;
[0331] g7(D)=1+D 2 +D 5 +D 6 +D 7 ;
[0332] g8(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ;
[0333] g9(D)=1+D 1 +D 2 +D 5 +D 7 ;
[0334] g 10 (D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ;
[0335] g 11 (D)=1+D 2 +D 5 +D 6 +D 7 。
[0336] The octal numbers corresponding to the above component code generating polynomials are 255, 363, 227, 337, 351, 275, 353, 247, 327, 345, 373 and 247 respectively. When binary representation is used, the component code generation vectors are: {1,0,1,0,1,1,0,1}, {1,1,1,1,0,0,1,1}, {1,0,0,1,0,1,1,1}, {1,1,0,1,1,1,1,1}, {1,1,1,0,1,0,0,1}, {1,0,1,1,1,1,0,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,1,0,1,0,0,1,1}, {1,1,0,1,0,1,1,1}, {1,1,0,1,0,1,0,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}.
[0337] 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.
[0338] 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, 10, or 12, and J is an integer less than or equal to T.
[0339] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=2 component code output bit sequences.
[0340] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 4 +D 5 +D 7 g1(D)=1+D 1 +D 2 +D 3 +D6 +D 7 And g2(D)=1+D 3 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain T=3 component code output bit sequences.
[0341] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=4 component code output bit sequences.
[0342] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial 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 And g4(D)=1+D 1 +D 2 +D 4 +D 7 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0343] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial 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 And g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0344] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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 And g7(D)=1+D 2 +D 5 +D 6 +D 7 Convolutional encoding is performed to obtain T=8 component code output bit sequences.
[0345] 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.
[0346] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0347] g0(D)=1+D 2 +D 3 +D 5 +D 7 ;
[0348] g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 ;
[0349] g2(D)=1+D 1 +D 2 +D 4 +D 7 ;
[0350] g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 ;
[0351] g4(D)=1+D 3 +D 5 +D 6 +D7 ;
[0352] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 ;
[0353] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 ;
[0354] g7(D)=1+D 1 +D 2 +D 5 +D 7 ;
[0355] g8(D)=1+D 1 +D 2 +D 4 +D 6 +D 7 ;
[0356] g9(D)=1+D 2 +D 5 +D 6 +D 7 ;
[0357] g 10 (D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 ;
[0358] g 11 (D)=1+D 1 +D 2 +D 5 +D 7 。
[0359] 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 correspond to {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,0,1}, {1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,1,1}, {1,0,1,0,0,1,1,1}, {1,1,0,1,0,0,1,1} and {1,1,1,0,0,1,0,1}.
[0360] 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.
[0361] 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, 10, or 12, and J is an integer less than or equal to T.
[0362] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=2 component code output bit sequences.
[0363] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D5 +D 6 +D 7 And g2(D)=1+D 1 +D 2 +D 4 +D 7 Convolutional encoding is performed to obtain T=3 component code output bit sequences.
[0364] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 And g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 Convolutional encoding is performed to obtain T=4 component code output bit sequences.
[0365] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 And g4(D)=1+D 3 +D5 +D 6 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0366] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 2 +D 3 +D 5 +D 7 g1(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 g2(D)=1+D 1 +D 2 +D 4 +D 7 g3(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 7 g4(D)=1+D 3 +D 5 +D 6 And g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 Convolutional encoding is performed to obtain T=6 component code output bit sequences.
[0367] 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:
[0368] g0(D)=1+D 1 +D 3 +D 5 +D 6 +D 8 +D 9 ;
[0369] g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0370] g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 ;
[0371] g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9 ;
[0372] g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 ;
[0373] g5(D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ;
[0374] g6(D)=1+D 1 +D 3 +D 5 +D 7 +D 8 +D 9 ;
[0375] g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 ;
[0376] g8(D)=1+D 1 +D 3 +D 4 +D 7 +D 9 ;
[0377] g9(D)=1+D 1 +D 2 +D 3 +D 4 +D 6 +D 8 +D 9 ;
[0378] g 10 (D)=1+D1 +D 3 +D 4 +D 5 +D 6 +D 9 ;
[0379] g 11 (D) = 1 + D 3 +D 5 +D 6 +D 7 +D 9 .
[0380] 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}, {1,0,1,1,1,1,1,0,0,1}, {1,0,1,0,0,0,1,1,1,1}, {1,1,1,0,1,0,0,1,1,1}, {1,0,0,1,0,0,1,1,1,0,1}, {1,1,1,0,1,0,0,1,1,1,0,1}, {1,1,1,0,1,0,1 {1,1,0,1,0,1,0,1,1,1}, {1,0,1,0,0,1,1,1,1}, {1,1,0,1,1,0,0,1,0,1}, {1,1,1,1,1,0,1,0,1,1}, {1,1,0,1,1,1,0,1,0,1}, and {1,0,0,1,0,1,1,1,0,1}.
[0381] 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.
[0382] 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, 10, or 12, and J is an integer less than or equal to T.
[0383] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 1 +D 3 +D 5 +D 6 +D 8 +D9 and g1(D)=1+D 2 +D 3 +D 4 +D 5 +D 6 +D 9 Convolutional encoding is performed to obtain T=2 component code output bit sequences.
[0384] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial 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 And g2(D)=1+D 2 +D 6 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain T=3 component code output bit sequences.
[0385] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 And g3(D)=1+D 1 +D 2 +D 4 +D 7 +D 8 +D 9Convolutional encoding is performed to obtain T=4 component code output bit sequences.
[0386] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial 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 And g4(D)=1+D 3 +D 5 +D 6 +D 7 +D 9 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0387] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial 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 +D2 +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 T=6 component code output bit sequences.
[0388] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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 +D8 +D 9 And g7(D)=1+D 2 +D 5 +D 6 +D 7 +D 8 +D 9 Convolutional encoding is performed to obtain T=8 component code output bit sequences.
[0389] 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.
[0390] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0391] g0(D)=1+D 1 +D 3 +D 4 +D 6 +D 8 +D 9 ;
[0392] g1(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 ;
[0393] g2(D)=1+D 1 +D 2 +D 3 +D 7 +D 9 ;
[0394] g3(D)=1+D 1 +D 2 +D 5 +D 7 +D 8 +D 9 ;
[0395] g4(D)=1+D 2 +D 3 +D 4 +D 6 +D 9 ;
[0396] g5(D)=1+D 3 +D4 +D 6 +D 7 +D 8 +D 9 ;
[0397] g6(D)=1+D 1 +D 2 +D 4 +D 6 +D 8 +D 9 ;
[0398] g7(D)=1+D 1 +D 2 +D 3 +D 4 +D 7 +D 9 ;
[0399] g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 ;
[0400] g9(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 8 +D 9 ;
[0401] g 10 (D)=1+D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ;
[0402] g 11 (D)=1+D 2 +D 3 +D 4 +D 6 +D 9 .
[0403] The octal numbers corresponding to the above-mentioned component code generating polynomials are: 1553, 1175, 1705, 1627, 1351, 1157, 1653, 1745, 1233, 1537, 1731 and 1351. When expressed in binary, the component code generating vectors are {1,1,0,1,1,0,1,0,1,1}, {1,0,0,1,1,1,1,1,0,1}, {1,1,1,1,0,0,0,1,0,1}, {1,1,1,0,0,1,0,1,0,1}, {1,0,1,1,0,0,1,0,1,1}, {1,0,1,1,0,0,1,0,0,1}, {1,0,1,1,0,1,0,0,1}, {1,0,0,1,1,0,1,0,0,1}. {1,0,1,1,1,0,1,0,1,0}, {1,0,1,0,0,1,0,1,0,1}, {1,1,0,1,0,0,1,0,1,1}, {1,1,0,1,0,1,1,1,1}, {1,1,0,1,0,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}.
[0404] Furthermore, the transmitting end can determine T component code generating polynomials for convolution coding from the above 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 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0405] 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:
[0406] g0(D)=1+D 3 +D 5 +D 6 +D 7 +D 10 ;
[0407] g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 ;
[0408] g2(D)=1+D 1 +D 2 +D 4 +D5 +D 6 +D 8 +D 10 ;
[0409] g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0410] g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0411] g5(D)=1+D 2 +D 3 +D 4 +D 5 +D 7 +D 8 +D 10 ;
[0412] g6(D)=1+D 3 +D 4 +D 5 +D 7 +D 9 +D 10 ;
[0413] g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 ;
[0414] g8(D)=1+D 2 +D 5 +D 6 +D 8 +D 9 +D 10 ;
[0415] g9(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 ;
[0416] g10 (D) = 1 + D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 10 ;
[0417] g 11 (D) = 1 + D 1 +D 2 +D 3 +D 5 +D 7 +D 9 +D 10 .
[0418] 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}, {1,1,0,1,1,1,1,0,0,0,1}, {1,1,0,1,1,1,1,0,0,0,1}, {1,1,0,1,1,1,1,0,1,0,1}, {1,1,0,0,1,1,1,0,1,0,1}, {1,0,1,0,1,1,1,0,0,1,1} {1,0,0,1,1,1,0,1,0,1,1}, {1,0,1,0,0,1,0,1,1,0,1}, {1,0,1,0,0,1,0,1,1,1}, {1,0,1,0,0,0,1,1,1,1}, {1,1,1,1,1,0,1,1,0,0,1}, and {1,1,1,1,0,1,0,1,0,1,1}.
[0419] 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.
[0420] 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, 10, or 12, and J is an integer less than or equal to T.
[0421] In one example, the convolutional coding uses at least two of the above 12 generating polynomials to encode to obtain T = 2 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 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 T=2 component code output bit sequences.
[0422] In another example, the convolutional coding uses at least 3 of the above 12 generating polynomials to encode to obtain T = 3 component code output bit sequences, for example, at least the above generating polynomial 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 And g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 Convolutional encoding is performed to obtain T=3 component code output bit sequences.
[0423] In another example, the convolutional coding uses at least 4 of the above 12 generating polynomials to encode to obtain T = 4 component code output bit sequences, for example, at least the above generating polynomial 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 +D5 +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 T=4 component code output bit sequences.
[0424] In another example, the convolutional coding uses at least 5 of the above 12 generating polynomials to encode to obtain T = 5 component code output bit sequences, for example, at least the above generating polynomial g0(D) = g0(D) = 1 + D 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 10 g2(D)=1+D 1 +D 2 +D 4 +D 5 +D 6 +D 8 +D 10 g3(D)=1+D 1 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 And g4(D)=1+D 2 +D 4 +D 7 +D 8 +D 9 +D 10 Convolutional encoding is performed to obtain T=5 component code output bit sequences.
[0425] In another example, the convolutional coding uses at least 6 of the above 12 generating polynomials to encode to obtain T = 6 component code output bit sequences, for example, at least the above generating polynomial g0(D) = 1 + D 3 +D 5 +D 6 +D 7 +D 10 g1(D)=1+D1 +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 T=6 component code output bit sequences.
[0426] In another example, the convolutional coding uses at least 8 of the above 12 generating polynomials to encode to obtain T = 8 component code output bit sequences, for example, at least the above generating polynomial 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 And g7(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 Convolutional encoding is performed to obtain T=8 component code output bit sequences.
[0427] 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.
[0428] In some embodiments, the preset component code generating polynomial group may further include at least one of the following component code generating polynomials:
[0429] g0(D)=1+D 3 +D 4 +D 5 +D 7 +D 10 ;
[0430] g1(D)=1+D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0431] g2(D)=1+D 2 +D 4 +D5 +D 6 +D 8 +D 9 +D 10 ;
[0432] g3(D)=1+D 1 +D 3 +D 4 +D 5 +D 6 +D 9 +D 10 ;
[0433] g4(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ;
[0434] g5(D)=1+D 2 +D 3 +D 5 +D 6 +D 7 +D 8 +D 10 ;
[0435] g6(D)=1+D 1 +D 3 +D 5 +D 6 +D 7 +D 10 ;
[0436] g7(D)=1+D 3 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 ;
[0437] g8(D)=1+D 1 +D 2 +D 4 +D 5 +D 8 +D 10 ;
[0438] g9(D)=1+D 1 +D 2 +D 3 +D 6 +D 8 +D 10 ;
[0439] g 10 (D) = 1 + D 3 +D 4 +D 6 +D 7 +D 8 +D 9 +D 10 ;
[0440] g 11 (D) = 1 + D 1 +D 3 +D 5 +D 7 +D 8 +D 9 +D 10 .
[0441] The octal numbers corresponding to the above component code generating polynomials are: 2351, 2173, 2567, 3363, 3625, 2675, 3271, 2373, 3545, 3625, 2337 and 3257. When expressed in binary, the component code generating vectors are {1,0,0,1,1,1,0,1,0,0,1}, {1,0,0,0,1,1,1,1,0,1,1}, {1,0,1,0,1,1,1,0,1,1}, {1,1,0,1,1,1,0,1,1,0,0,1,1}, {1,1,0,1,1,1,0,0,1,0,1}, {1,1,1,1,0,0,1,0,0,1,0,1}, {1,0,1,1,0,1,0,1,0,1} {1,1,1,0,1}, {1,1,0,1,0,1,1,1,0,0,1}, {1,0,0,1,1,1,1,0,1,1}, {1,1,1,0,1,1,0,0,1,0,1}, {1,1,1,1,0,0,1,0,1,0,1}, {1,0,0,1,1,0,1,0,1,0,1}, {1,0,0,1,1,0,1,1,1,1}, and {1,1,0,1,0,1,0,1,1,1,1}.
[0442] Furthermore, the transmitting end can determine T component code generating polynomials for convolution coding from the above 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 4, 5, 6, 7, 8, 9, 10, or 12, and J is an integer less than or equal to T.
[0443] It should be noted that the present application provides multiple possible implementations of component code generator polynomials preset under different convolutional coding constraint lengths and supporting flexible code rate design. In addition, the number of non-zero coefficients in the provided component code generator polynomial is small. By using the component code generator polynomial provided in the embodiment of the present application for convolutional coding, 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.
[0444] S103. Perform sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence.
[0445] Wherein, i is a non-negative integer less than T.
[0446] In some embodiments, the value of i is determined according to one or more of the following: the number of component codes T, the coding rate, the number of transmitted bits, the number of resource particles, the length of the output bit sequence of a single component code in the T component codes, the modulation order, the number of multi-antenna layers, the convolutional coding constraint length, and the information bit sequence length. The following is an explanation of the method for determining the value of i through a specific example:
[0447] Example 1: The value of i is determined according to T and the encoding bit rate.
[0448] In some embodiments, the value of i is determined based on the following formula (1):
[0449] i=mod(floor(1 / R),T) formula (1)
[0450] Wherein, R is the encoding bit rate, function floor(x) is a floor function, for example, floor(3.3)=3, mod(7,4)=3, function mod(a,b) is a modulus operation, which indicates the remainder obtained when a is divided by b, R is a real number greater than 0, a and b are positive integers. Moreover, “ / ” indicates a real number division operation.
[0451] For example, if the constraint length of the convolutional coding is 7, T is 4, and the T component code generator polynomials are:
[0452] g0(D)=1+D 2 +D 3 +D 5 +D 6 ;
[0453] g1(D)=1+D 1 +D 2 +D 3 +D 6 ;
[0454] g2(D)=1+D 1 +D2 +D 4 +D 6 ;
[0455] g3(D)=1+D 2 +D 5 +D 6 .
[0456] The corresponding octal numbers are 133, 171, 165 and 123. When expressed in binary, the four component code generation 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}.
[0457] With information bit sequence b0, b1, b2, b3, ..., b K-1 , K = 80 as an example, after the transmitter performs convolution encoding on the information bit sequence, it can obtain 4 component code output bit sequences with a length of 80 bits. If the code rate is R = 2 / 5, then based on the above formula (1), i = mod(floor(1 / R), T) = 2. That is, the transmitter needs to perform sub-block interleaving on the second component code output bit sequence to obtain a sub-block interleaved output sequence.
[0458] In some embodiments, the transmitting end may also combine the 0th, 1st, and 3rd component code output bit sequences and the sub-block interleaved output sequence of the 2nd component code into a total bit sequence, that is, a coded bit sequence. The corresponding component code sequence in the coded bit sequence is 0, 1, 2, and 3, where 0, 1, and 3 are component code output bit sequences, and 2 is a sub-block interleaved output sequence.
[0459] Example 2: The value of i is determined according to T, the length of the information bit sequence and the number of transmitted bits.
[0460] In some embodiments, the value of i is determined based on the following formula (2):
[0461] i=mod(floor(E / K),T) formula (2)
[0462] Wherein, K is the length of the information bit sequence, E is the number of transmitted bits, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder when a is divided by b, and K, E, a, and b are all positive integers.
[0463] For example, taking the four component code generating polynomials in Example 1 as an example, if the constraint length of the convolutional coding is 7, T is 4, and the information bit sequence is b0, b1, b2, b3, ..., b K-1 , K=64.
[0464] Thus, after the transmitter performs convolution encoding on the information bit sequence, four component code output bit sequences of length 64 bits can be obtained. If the number of bits is E = 300, then based on the above formula (2), i = mod (floor (E / K), T) = 0. That is, the transmitter needs to perform sub-block interleaving on the 0th component code output bit sequence to obtain a sub-block interleaved output sequence.
[0465] In some embodiments, the transmitting end may also combine the 1st, 2nd, and 3rd component code output bit sequences and the 0th component code sub-block interleaved output sequence into a total bit sequence, that is, a coded bit sequence. The coded bit sequence corresponds to the component code sequence of 0, 1, 2, and 3, where 1, 2, and 3 are component code output bit sequences, and 0 is a sub-block interleaved output sequence.
[0466] Example 3: The value of i is determined based on T, the number of transmitted bits, and the length of the output bit sequence of a single component code among the T component codes.
[0467] In some embodiments, the value of i is determined based on the following formula (3):
[0468] i=mod(floor(E / M),T) formula (3)
[0469] Wherein, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder obtained when a is divided by b, and E, M, a, and b are all positive integers.
[0470] In some embodiments, the length M of the output bit sequence of a single component code is an integer greater than or equal to the length K of the information bit sequence. Exemplarily, if the transmitting end adopts convolutional coding with both the first and last states being 0, the length M of the output bit sequence of a single component code may be equal to the sum of the length K of the information bit sequence and the convolutional coding constraint length L minus 1, that is, M=K+L-1. For example, based on the 4 component code generating polynomials in Example 1, convolutional coding is performed, the constraint length L=7, and there are L-1=6 shift registers. If the transmitter uses convolutional coding with both the first and last states being 0, then during the convolutional coding process, the initial values of the six shift registers are all equal to 0, and to ensure that the first and last states of the convolutional coding are equal to 0, after inputting all the bits of the information bit sequence, it is necessary to input L-1=6 0s to make the initial values of the shift registers S0, S1, S2, S3, S4, and S5 all equal to 0. After inputting all the bits of the information bit sequence, it is necessary to input 6 more 0s to ensure that the final values of the shift registers S0, S1, S2, S3, S4, and S5 are also equal to 0. The output corresponding to the ath component code is C k(a) , where a=0, 1, ..., T-1, k=0, 1, ..., K+L-2.
[0471] For example, taking the four component code generating polynomials in Example 1 as an example, if the constraint length of the convolutional coding is 7, T is 4, and the information bit sequence is b0, b1, b2, b3, ..., b K-1 , K = 64. Therefore, if the transmitter adopts convolutional coding with both the first and last states being 0, after convolutional coding the information bit sequence, 4 component code output bit sequences with lengths of M = K + L-1 = 70 bits can be obtained. If the number of bits is E = 256, then based on the above formula (3), i = mod(floor(E / M), T) = 3. That is, the transmitter needs to perform sub-block interleaving on the third component code output bit sequence to obtain a sub-block interleaved output sequence.
[0472] In some embodiments, the transmitting end may also combine the 0th, 1st, 2nd component code output bit sequences and the 3rd component code sub-block interleaved output sequence into a total bit sequence, i.e., a coded bit sequence. The coded bit sequence corresponds to the component code sequence of 0, 1, 2, 3, where 0, 1, 2 are the component code output bit sequences and 3 is the sub-block interleaved output sequence.
[0473] Example 4: The value of i is determined according to the length of the output bit sequence of a single component code among the T and T component codes, the number of resource particles, and the modulation order.
[0474] In some embodiments, the value of i is determined based on the following formula (4):
[0475] i=mod(floor((S*Q) / M), T) Formula (4)
[0476] Wherein, M is the length of the output bit sequence of a single component code in T component codes, S is the number of resource particles, Q is the modulation order, function floor(x) is a floor function, function mod(a, b) is a modulus operation, which indicates the remainder obtained by dividing a by b, and S, Q, M, a, and b are all positive integers. And, "*" indicates a real number multiplication operation. As a possible example, the number of resource particles S is equal to the number of modulation symbols. The modulation order is an integer greater than 0, which describes the number of bits mapped by a modulation symbol. In a specific example, if the modulation order Q is equal to 1, it corresponds to BPSK modulation; if the modulation order Q is equal to 2, it corresponds to QPSK modulation; if the modulation order Q is equal to 4, it corresponds to 16QAM modulation; if the modulation order Q is equal to 6, it corresponds to 64QAM modulation; if the modulation order Q is equal to 8, it corresponds to 256QAM modulation; if the modulation order Q is equal to 10, it corresponds to 1024QAM modulation.
[0477] In one example, if the four component code generating polynomials in Example 1 above are taken as an example, if the constraint length of the convolutional coding is 7, T is 4, and the information bit sequence is b0, b1, b2, b3, ..., b K-1 , K=64. Thus, if the transmitter adopts convolutional coding with both the first and last states being 0, then after the information bit sequence is convolutionally encoded, the four component code output bit sequences are all of length M=K+L-1=70 bits. If the number of resource particles is S=100 and the modulation order is Q=2, then based on the above formula (4), i=mod(floor((S*Q) / M), T)=2. That is, the transmitter needs to perform sub-block interleaving on the second component code output bit sequence to obtain a sub-block interleaved output sequence. In some embodiments, the transmitter can also combine the 0th, 1st, and 3rd component code output bit sequences and the sub-block interleaved output sequence of the second component code into a total bit sequence, that is, a coded bit sequence. Among them, the output bit sequence corresponds to the component code order of 0, 1, 2, and 3, where 0, 1, and 3 are component code output bit sequences, and 2 is a sub-block interleaved output sequence.
[0478] Example 5: The value of i is determined based on the length of the output bit sequence of a single component code among T and T component codes, the number of source particles, the modulation order, and the number of multiple antenna layers.
[0479] In some embodiments, the value of i is determined based on the following formula (5):
[0480] i=mod(floor((S*Q*V) / M), T) Formula (5)
[0481] Wherein, M is the length of the output bit sequence of a single component code in the T component codes, S is the number of resource particles, Q is the modulation order, V is the number of multi-antenna layers, function floor(x) is a floor function, function mod(a, b) is a modulus operation, which represents the remainder obtained by dividing a by b, and S, Q, M, V, a, and b are all positive integers. Wherein, the number of multi-antenna layers V is an integer greater than 0. Specifically, the number of multi-antenna layers V can be equal to 1, 2, 3, 4, 6, or 8.
[0482] For example, if the 6 component code generating polynomials in the above implementation mode 6 are taken as an example, if the constraint length of the convolutional coding is 9, T is 6, and the information bit sequence is b0, b1, b2, b3, ..., b K-1, K=64. Therefore, if the transmitter uses tail-biting convolutional coding to convolutionally encode the information bit sequence, the four component code output bit sequences are all of length M=64 bits. When tail-biting convolutional coding is performed, the length M of a single component code output bit sequence is equal to the length K of the information bit sequence. If the number of resource particles is S=220, the modulation order is Q=1, and the number of multi-antenna layers is V=4, then based on the above formula (5), i=mod(floor((S*Q*V) / M), T)=1. That is, the transmitter needs to perform sub-block interleaving on the first component code output bit sequence to obtain a sub-block interleaved output sequence.
[0483] In some embodiments, the transmitting end may also combine the 0th, 2nd, 3rd, 4th, and 5th component code output bit sequences and the 1st component code sub-block interleaved output sequence into a total bit sequence, that is, a coded bit sequence. The coded bit sequence corresponds to the component code sequence of 0, 1, 2, 3, 4, and 5, where 0, 2, 3, 4, and 5 are component code output bit sequences, and 1 is a sub-block interleaved output sequence.
[0484] Example 6: The value of i is determined according to the length of the output bit sequence of a single component code among the T component codes and the number of transmitted bits.
[0485] In some embodiments, the value of i is determined based on the following formula (6):
[0486] i=floor(E / M) Formula (6)
[0487] Wherein, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, and the function floor(x) is a floor function.
[0488] Furthermore, after i is determined, the i-th component code output bit sequence may be sub-block interleaved to obtain a sub-block interleaved output sequence.
[0489] In some embodiments, sub-block interleaving may be implemented based on an interleaving matrix and an inter-column permutation index set, where all elements in the inter-column permutation index set are non-negative integers.
[0490] In some embodiments, the number of columns of the interleaving matrix is determined based on the length of the inter-column permutation index set, the number of rows of the interleaving matrix is determined based on the length of the i-th component code output bit sequence. And, the number of rows of the interleaving matrix is determined based on the following formula (7):
[0491] (R·C)≥M Formula (7)
[0492] Wherein, R is the number of rows of the interleaving matrix, C is the number of columns of the interleaving matrix, and M is the length of the output bit sequence of the i-th component code.
[0493] Exemplarily, if the bit sequence of the ith component code output by sub-block interleaving is The length is M. If the interleaving matrix satisfies (R·C)≥M, the required padding amount is L F =(R·C)-M 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 yk= <null>for k = 0, 1, ..., L F -1, and k = 0, 1, ..., M-1. The sequence y is written into the interleaving matrix of the sub-block interleaving in row order.
[0494] In some embodiments, the length of the inter-column permutation index set is 8, 16, 32, or 64. In one example, the length of the inter-column permutation index set is 8, and the inter-column permutation index set P = [0, 4, 2, 6, 1, 5, 3, 7] or [1, 5, 3, 7, 0, 4, 2, 6]. In another example, the length of the inter-column permutation index set is 16, and the inter-column permutation index set P = [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15] or [1, 9, 5, 13, 3, 11, 7, 15, 0, 8, 4, 12, 2, 10, 6, 14]. In another example, the length of the inter-column permutation index set is 32, and the inter-column permutation index set is [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31]. In another example, the length of the inter-column permutation index set is 64, and the inter-column permutation index set is [0, 32, 16, 48, 8, 40, 24, 56, 4, 36, 20, 52, 12, 44, 28, 60, 2, 34, 18, 50, 10, 42, 26, 58, 6, 38, 22, 54, 14, 46, 30, 62, 1, 33, 17, 49, 9, 41, 25, 57, 5, 37, 21, 53, 13, 45, 29, 61, 3, 35, 19, 51, 11, 43, 27, 59, 7, 39, 23, 5 ,5,15,47,31,63] or [1,33,17,49,9,41,25,57,5,37,21,53,13,45,29,61,3,35,19,51,11,43,27,59,7,39,23,55,15,47,31,63,0,32,16,48,8,40,24,56,4,36,20,52,12,44,28,60,2,34,18,50,10,42,26,58,6,38,22,54,14,46,30,62].
[0495] Then, the transmitter performs column permutation on the interleaving matrix of the sub-block interleaving based on the inter-column permutation index set P, and the jth column of the interleaving matrix after permutation is equal to the P(j)th column in the original interleaving matrix, and j is equal to 0, 1, 2, ..., C-1. The matrix of size R×C after column permutation is read sequentially from column 0, and if the read data is a NULL bit, it is skipped, and then the sub-block interleaving output sequence corresponding to the i-th component code is obtained, and its length is equal to M.
[0496] In some embodiments, the transmitter can also read the P(j)th bit from the interleaving matrix in sequence based on the order of j's values 0, 1, 2, ..., and remove the read NULL bits to form the sub-block interleaved output sequence of the i-th component code.
[0497] Example 7: The value of i is determined based on T, the length of the output bit sequence of a single component code, the starting position index and the number of transmitted bits.
[0498] In some embodiments, the value of i is determined based on the following formula (8):
[0499] i=mod(floor((E+x) / M),T) Formula (8)
[0500] Wherein, M is the length of the output bit sequence of a single component code, x is the starting position index, E is the number of transmitted bits, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder obtained when a is divided by b, and K, E, x, a, and b are all positive integers.
[0501] For example, taking the four component code generating polynomials in Example 1 as an example, if the constraint length of the convolutional coding is 7, T is 4, and the information bit sequence is b0, b1, b2, b3, ..., b K-1 , K=64.
[0502] Thus, after the transmitter performs convolution encoding on the information bit sequence, four component code output bit sequences of length 64 bits can be obtained. If the number of bits is E=300 and the starting position index x is 10, then based on the above formula (2), i=mod(floor((E+x) / M), T)=0. That is, the transmitter needs to perform sub-block interleaving on the 0th component code output bit sequence to obtain a sub-block interleaved output sequence.
[0503] In some embodiments, the transmitting end may also combine the 1st, 2nd, and 3rd component code output bit sequences and the 0th component code sub-block interleaved output sequence into a total bit sequence, that is, a coded bit sequence. The coded bit sequence corresponds to the component code sequence of 0, 1, 2, and 3, where 1, 2, and 3 are component code output bit sequences, and 0 is a sub-block interleaved output sequence.
[0504] Example 8: The value of i can be equal to NULL (can also be represented by null or a negative number (such as -1)), and can be equal to a non-negative integer. If the value of i is NULL, there is no need to perform sub-block interleaving on the component code output bit sequence.
[0505] In some embodiments, the value of i is determined according to the number of component codes T, the length of the information bit sequence K, and the number of transmitted bits E. If E is equal to a positive integer multiple of K, the value of i is equal to null; otherwise, the value of i is determined based on formula (2). In a specific example, E is equal to 128, K is equal to 64, and T is equal to 3, then the value of i is null.
[0506] In some embodiments, the value of i is determined according to the number of component codes T, the length of the output bit sequence of a single component code M, and the number of transmitted bits E. If E is equal to a positive integer multiple of M, the value of i is equal to null; otherwise, the value of i is determined based on formula (3). In a specific example, if E is equal to 256, M is equal to 64, and T is equal to 6, the value of i is null.
[0507] In some embodiments, the value of i is determined according to the number of component codes T, the length of the output bit sequence of a single component code M, the number of resource particles S, and the modulation order Q. If S*Q is equal to a positive integer multiple of M, the value of i is equal to null; otherwise, the value of i is determined based on formula (4). In a specific example, the number of resource particles S is equal to 256, the modulation order Q is equal to 2, M is equal to 128, and T is equal to 6, then the value of i is null.
[0508] In some embodiments, the value of i is determined according to the number of component codes T, the length of the output bit sequence of a single component code M, the number of resource particles S, the modulation order Q, and the number of multi-antenna layers V. If S*Q*V is equal to a positive integer multiple of M, the value of i is equal to null; otherwise, the value of i is determined based on formula (5). In a specific example, the number of resource particles S is equal to 256, the modulation order Q is equal to 2, the number of multi-antenna layers V is equal to 3, M is equal to 128, and T is equal to 8, then the value of i is null.
[0509] In some embodiments, the value of i is determined according to the length M of the output bit sequence of a single component code and the number of transmitted bits E. If E is equal to a positive integer multiple of M, the value of i is equal to null; otherwise, the value of i is determined based on formula (6). In a specific example, E is equal to 200, M is equal to 50, and T is equal to 4, then the value of i is null.
[0510] In some embodiments, the value of i is determined according to the number of component codes T, the length of the output bit sequence of a single component code M, the starting position index x, and the number of transmitted bits E. If E+x is equal to a positive integer multiple of M, the value of i is equal to null; otherwise, the value of i is determined based on formula (8). In a specific example, E is equal to 220, x is equal to 20, M is equal to 80, and T is equal to 4, then the value of i is null.
[0511] S104. Determine a coding bit sequence 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.
[0512] Exemplarily, the transmitting end may combine the component code output bit sequences of 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), the length of which is equal to T*M. Furthermore, some or all of the bits in the coded bit sequence may be selected as bits to be transmitted. The t*Mth bit to the (t+1)*M-1th bit in the coded bit sequence are composed of the t-th component code output bit sequence, where t is a non-negative integer less than T and t is not equal to i. If t is equal to i, the t*Mth bit to the (t+1)*M-1th bit in the total bit sequence are composed of the sub-block interleaved output sequence of the i-th component code.
[0513] like Figure 4 As shown, if the coded bit sequence 400 includes T bit sequences of length M, the first i-1 bit sequences are the 0th to i-1th component code output bit sequences, the i-th bit sequence 402 is the sub-block interleaved output sequence, and the other bit sequences are the i+1th to T-1th component code output bit sequences.
[0514] In one example, if i=0, it means that the 0th bit sequence in the coded bit sequence 400 is a sub-block interleaved output sequence, and the 1st to T-1th bit sequences in the coded bit sequence 400 correspond to the 1st to T-1th component code output bit sequences respectively.
[0515] In another example, if i=T-1, it means that the T-1th bit sequence in the coded bit sequence 400 is a sub-block interleaved output sequence, and the 0th bit sequence to the T-2th bit sequence in the coded bit sequence 400 correspond to the 0th to the T-2th component code output bit sequences respectively.
[0516] It should be noted that in this step, sub-block interleaving is not required for output bit sequences of other component codes, so that the interleaving process of convolutional coding can be reduced and the complexity of coding can be reduced.
[0517] In some embodiments, the transmitting end may also send all or part of the bits in the coded bit sequence based on the determined coded bit sequence.
[0518] Exemplarily, the transmitter may perform bit selection on the coded bit sequence to obtain a 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.
[0519] Exemplarily, the transmitting end may perform bit selection on the coded bit sequence to obtain the bit sequence to be transmitted, wherein the cyclic selection starts from the xth bit in the total bit sequence, and if the last bit is selected, the selection continues from the first bit, and if the required number of bits is obtained, the selection stops. Wherein, x is the starting position index, and x is an integer greater than or equal to 0.
[0520] In one possible implementation, the transmitting end may combine the 0th, 1st, ..., (i-1), (i+1), ... (T-1)th component code output bit sequences and the sub-block interleaved output sequence of the i-th component code into a coded bit sequence, perform bit selection on the coded bit sequence to obtain a bit sequence to be sent, and send the bit sequence to be sent.
[0521] In another possible implementation, the transmitting end may perform bit selection on the sub-block interleaved output sequence to obtain a bit-selected bit sequence. Further, the transmitting end may send the 0th, 1st, ..., (i-1), (i+1), ... (T-1)th component code output bit sequence and the bit-selected bit sequence.
[0522] Based on the above embodiment, the method can perform convolution encoding on the information bit sequence based on the preset component code generating polynomial, and select one of the component code output bit sequences for sub-block interleaving to obtain a sub-block interleaved output sequence, and determine the coded bit sequence based on the sub-block interleaved output sequence and other component code output bit sequences. In this scheme, sub-block interleaving is not required for other component code output bit sequences, so that the interleaving process of convolution encoding can be reduced to reduce the complexity of encoding.
[0523] In some embodiments, the present application also provides a decoding method, such as Figure 5 As shown, the method comprises the following steps:
[0524] S201. Receive a soft bit sequence to be decoded.
[0525] The receiving end receives the soft bit sequence and can decode 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.
[0526] S202: Perform bit selection on the soft bit sequence to be decoded to obtain soft bit subsequences of T component codes.
[0527] S203 . Deblock-interleave the soft bit subsequence of the i th component code to obtain a deinterleaved bit subsequence of the i th component code.
[0528] Wherein, i is a non-negative integer less than T.
[0529] In some embodiments, the value of i is determined based on one or more of the following: the number of component codes T, the coding rate, the number of transmitted bits, the number of resource particles, the length of the output bit sequence of a single component code among the T component codes, the modulation order, the number of multiple antenna layers, the convolutional coding constraint length, and the information bit sequence length.
[0530] For the detailed description and implementation of the value of i, please refer to the relevant description in the above step S103, which will not be repeated here.
[0531] S204. Perform convolution decoding on the deinterleaved bit subsequence of the ith component code and the soft bit subsequences of the other component codes among the T component codes except the ith component code according to the T component code generating polynomials to obtain an information bit sequence.
[0532] Wherein, T is an integer greater than 1. Exemplarily, the value of T includes 2, 3, 4, 6, 8, 10 or 12.
[0533] 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.
[0534] 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.
[0535] 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.
[0536] 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.
[0537] 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.
[0538] Based on the above embodiment, during the encoding process, one of the component code output bit sequences can be selected for sub-block interleaving to obtain a sub-block interleaved output sequence, and during the decoding process, only the soft bit sub-sequence corresponding to the component code can be de-sub-block interleaved, which can reduce the de-interleaving process of convolutional decoding to reduce the complexity of decoding.
[0539] 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.
[0540] 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 and a processing module 602 .
[0541] 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 T component code output bit sequences, where T is an integer greater than 1. The processing module 602 is also used to perform sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T. The processing module 602 is also used to 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.
[0542] In some embodiments, the value of i is determined based on one or more of the following: the number of component codes T, the coding rate, the number of transmitted bits, the number of resource particles, the length of the output bit sequence of a single component code among the T component codes, the modulation order, the number of multiple antenna layers, the convolutional coding constraint length, and the information bit sequence length.
[0543] In some embodiments, the value of i is determined based on the following formula:
[0544] i = mod(floor(1 / R), T)
[0545] Wherein, R is the encoding bit rate, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder when a is divided by b, R is a real number greater than 0, and a and b are positive integers.
[0546] In some embodiments, the value of i is determined based on the following formula:
[0547] i = mod(floor(E / K), T)
[0548] Wherein, K is the length of the information bit sequence, E is the number of transmitted bits, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder when a is divided by b, and K, E, a, and b are all positive integers.
[0549] In some embodiments, the value of i is determined based on the following formula:
[0550] i = mod(floor(E / M), T)
[0551] Wherein, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder obtained when a is divided by b, and E, M, a, and b are all positive integers.
[0552] In some embodiments, the value of i is determined based on the following formula:
[0553] i=mod(floor((S*Q) / M),T)
[0554] Wherein, M is the length of the output bit sequence of a single component code among the T component codes, S is the number of resource particles, Q is the modulation order, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder obtained by dividing b by a, and S, Q, M, a, and b are all positive integers.
[0555] In some embodiments, the value of i is determined based on the following formula:
[0556] i=mod(floor((S*Q*V) / M),T)
[0557] Among them, M is the length of the output bit sequence of a single component code among the T component codes, S is the number of resource particles, Q is the modulation order, V is the number of multi-antenna layers, function floor(x) is the floor function, function mod(a, b) is the modulus operation, which represents the remainder obtained by dividing a by b, and S, Q, M, V, a, and b are all positive integers.
[0558] In some embodiments, the value of i is determined based on the following formula:
[0559] i=floor(E / M)
[0560] Wherein, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, and the function floor(x) is a floor function.
[0561] In some embodiments, sub-block interleaving is implemented based on an interleaving matrix and an inter-column permutation index set, and elements in the inter-column permutation index set are all non-negative integers.
[0562] In some embodiments, the number of columns of the interleaving matrix is determined based on the length of the inter-column permutation index set, and the number of rows of the interleaving matrix is determined based on the length of the i-th component code output bit sequence.
[0563] In some embodiments, the number of rows of the interleaving matrix satisfies the following relationship:
[0564] (R·C)≥M
[0565] Wherein, R is the number of rows of the interleaving matrix, C is the number of columns of the interleaving matrix, and M is the length of the output bit sequence of the i-th component code.
[0566] In some embodiments, the length of the inter-column permutation index set is 8, 16, 32, or 64.
[0567] In some embodiments, the length of the inter-column permutation index set is 8, and the inter-column permutation index set is [0, 4, 2, 6, 1, 5, 3, 7] or [1, 5, 3, 7, 0, 4, 2, 6].
[0568] In some embodiments, the length of the inter-column permutation index set is 16, and the inter-column permutation index set is [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15] or [1, 9, 5, 13, 3, 11, 7, 15, 0, 8, 4, 12, 2, 10, 6, 14].
[0569] In some embodiments, the length of the inter-column permutation index set is 32, and the inter-column permutation index set is [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31].
[0570] In some embodiments, the length of the inter-column permutation index set is 64, and the inter-column permutation index set is [0, 32, 16, 48, 8, 40, 24, 56, 4, 36, 20, 52, 12, 44, 28, 60, 2, 34, 18, 50, 10, 42, 26, 58, 6, 38, 22, 54, 14, 46, 30, 62, 1, 33, 17, 49, 9, 41, 25, 57, 5, 37, 21, 53, 13, 45, 29, 61, 3, 35, 19, 51, 11, 43, 27, 59, 7, 39, 23, ,55,15,47,31,63,0,32,16,48,8,40,24,56,4,36,20,52,12,44,28,60,2,34,18,50,10,42,26,58,6,38,22,54,14,46,30,62].
[0571] For a more detailed description of the acquisition module 601 and the processing module 602, 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.
[0572] 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 .
[0573] In some embodiments, the receiving module 701 is used to receive a soft bit sequence to be decoded. The processing module 702 is used to perform bit selection on the soft bit sequence to be decoded to obtain soft bit subsequences of T component codes. The processing module 702 is also used to perform block deinterleaving on the soft bit subsequence of the i-th component code to obtain a deinterleaved bit subsequence of the i-th component code, where i is a non-negative integer less than T. The processing module 702 is also used to perform convolution decoding on the deinterleaved bit subsequence of the i-th component code and the soft bit subsequences of other component codes in the T component codes except the i-th component code according to the T component code generating polynomials to obtain an information bit sequence.
[0574] In some embodiments, the convolutional decoding is implemented based on Viterbi decoding or Viterbi table decoding assisted by a cyclic redundancy check (CRC).
[0575] 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.
[0576] 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.
[0577] 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, a server, or a 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.
[0578] 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 .
[0579] 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.
[0580] 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.
[0581] 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.
[0582] 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.
[0583] In another possible implementation, the memory 801 may also be integrated with the processor 802 .
[0584] 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.
[0585] 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.
[0586] 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.
[0587] 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.
[0588] 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.
[0589] 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.
[0590] 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 T component code output bit sequences, where T is an integer greater than 1; Performing sub-block interleaving on the i-th component code output bit sequence to obtain a sub-block interleaved output sequence, where i is a non-negative integer less than T; A coding 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.
2. The method according to claim 1, characterized in that The value of i is determined according to one or more of the following: the number of component codes T, the coding rate, the number of transmitted bits, the number of resource particles, the length of the output bit sequence of a single component code among the T component codes, the modulation order, the number of multi-antenna layers, the convolutional coding constraint length, and the length of the information bit sequence.
3. The method according to claim 2, characterized in that The value of i is determined based on the following formula: i = mod(floor(1 / R), T) Wherein, R is the encoding bit rate, function floor(x) is a floor function, function mod(a,b) is a modulo operation, which represents the remainder when a is divided by b, R is a real number greater than 0, and a and b are positive integers.
4. The method according to claim 2, characterized in that: The value of i is determined based on the following formula: i = mod(floor(E / K), T) Wherein, K is the length of the information bit sequence, E is the number of transmitted bits, function floor(x) is a floor function, function mod(a,b) is a modulus operation, which represents the remainder when a is divided by b, and K, E, a, and b are all positive integers.
5. The method according to claim 2, characterized in that: The value of i is determined based on the following formula: i = mod(floor(E / M), T) Among them, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, function floor(x) is a floor function, function mod(a,b) is a modulus operation, which represents the remainder obtained by dividing b by a, and E, M, a, and b are all positive integers.
6. The method according to claim 2, characterized in that The value of i is determined based on the following formula: i=mod(floor((S*Q) / M),T) Among them, M is the length of the output bit sequence of a single component code in the T component codes, S is the number of resource particles, Q is the modulation order, function floor(x) is the floor function, function mod(a,b) is the modulus operation, which represents the remainder obtained by dividing b by a, and S, Q, M, a, and b are all positive integers.
7. The method according to claim 2, characterized in that The value of i is determined based on the following formula: i=mod(floor((S*Q*V) / M),T) Among them, M is the length of the output bit sequence of a single component code in the T component codes, S is the number of resource particles, Q is the modulation order, V is the number of multi-antenna layers, function floor(x) is a floor function, function mod(a,b) is a modulus operation, which represents the remainder obtained by dividing a by b, and S, Q, M, V, a, and b are all positive integers.
8. The method according to claim 2, characterized in that: The value of i is determined based on the following formula: i=floor(E / M) Wherein, M is the length of the output bit sequence of a single component code among the T component codes, E is the number of transmitted bits, and function floor(x) is a floor function.
9. The method according to claim 1, characterized in that: The sub-block interleaving is implemented based on an interleaving matrix and an inter-column permutation index set, and the elements in the inter-column permutation index set are all non-negative integers.
10. The method according to claim 9, characterized in that The number of columns of the interleaving matrix is determined based on the length of the inter-column permutation index set, and the number of rows of the interleaving matrix is determined based on the length of the i-th component code output bit sequence.
11. The method according to claim 10, characterized in that The number of rows of the interleaving matrix satisfies the following relationship: (R·C)≥M Among them, R is the number of rows of the interleaving matrix, C is the number of columns of the interleaving matrix, and M is the length of the i-th component code output bit sequence.
12. The method according to claim 9, characterized in that The length of the inter-column permutation index set is 8, 16, 32, or 64.
13. The method according to claim 9, characterized in that The length of the inter-column permutation index set is 8, and the inter-column permutation index set is [0, 4, 2, 6, 1, 5, 3, 7] or [1, 5, 3, 7, 0, 4, 2, 6].
14. The method according to claim 9, characterized in that The length of the inter-column permutation index set is 16, and the inter-column permutation index set is [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15] or [1, 9, 5, 13, 3, 11, 7, 15, 0, 8, 4, 12, 2, 10, 6, 14].
15. The method according to claim 9, characterized in that The length of the inter-column permutation index set is 32, and the inter-column permutation index set is [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31].
16. The method according to claim 9, characterized in that The length of the inter-column permutation index set is 64, and the inter-column permutation index set is [0,32,16,48,8,40,24,56,4,36,20,52,12,44,28,60,2,34,18,50,10,42,26,58,6,38,22,54,14,46,30,62,1,33,17,49,9,41,25,57,5,37,21,53,13,45,29,61,3,35,19,51,11,43,27,59,7,39,23,55 ,15,47,31,63] or [1,33,17,49,9,41,25,57,5,37,21,53,13,45,29,61,3,35,19,51,11,43,27,59,7,39,23,55,15,47,31,63,0,32,16,48,8,40,24,56,4,36,20,52,12,44,28,60,2,34,18,50,10,42,26,58,6,38,22,54,14,46,30,62].
17. A decoding method, characterized in that: The method comprises: receiving a soft bit sequence to be decoded; Performing bit selection on the soft bit sequence to be decoded to obtain soft bit subsequences of T component codes; Deblock-interleaving the soft bit subsequence of the i-th component code to obtain a deinterleaved bit subsequence of the i-th component code, where i is a non-negative integer less than T; The deinterleaved bit subsequence of the ith component code and the soft bit subsequences of the component codes other than the ith component code in the T component codes are convolution-decoded according to T component code generating polynomials to obtain an information bit sequence.
18. The method according to claim 17, characterized in that The convolution decoding is implemented based on Viterbi decoding or Viterbi table decoding assisted by cyclic redundancy check (CRC).
19. 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 18 is performed.
20. 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 perform the method according to any one of claims 1 to 18.
Citation Information
Patent Citations
Interleaving method and device
CN109391365A
Coding and decoding method of polarization code, sending device, receiving device and medium
CN110233698A
Decoding method and device and storage medium
CN114499548A
Cited By
Coding method, decoding method, communication apparatus and storage medium
EP4716124A1
Coding method, decoding method, communication apparatus and storage medium
WO2024239673A1
Sequence processing method, first communication node, second communication node, storage medium, and program product
WO2026171029A1
