Encoding and decoding method, encoder and decoder

Abstract

Embodiments of the present application provide a method and device for encoding and decoding. The method comprises: obtaining a first code block (CB) and a second CB, wherein the first CB and the second CB are encoded using the same scheme, the first CB and the second CB correspond to different MIMO antennas respectively, the first CB comprises m information bits, and the m information bits are mapped to the second CB; and transmitting the first CB and the second CB. According to the present application, the technology of using related bits between multiple CBs in a transmission block is applied to a MIMO transmission system, wherein the multiple CBs are from different MIMO antennas respectively, which helps to improve the accuracy of CB transmission in the MIMO transmission system and reduce the word error rate (WER) of the CB.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to an encoding and decoding method, an encoder, and a decoder. Background Technology

[0002] Multiple-input multiple-output (MIMO) technology is a wireless communication technique that improves the reliability and efficiency of data transmission by using multiple antennas at both the transmitting and receiving ends. By using multiple antennas, MIMO technology can simultaneously transmit and receive multiple data streams, thereby increasing the overall data rate of the wireless communication system.

[0003] In New Radio (NR), polar codes and low-density parity-check (LDPC) codes are used in most channels. In 5G NR, LDPC codes are used for data transmission in mobile broadband (MBB) services, while polar codes are used for control signaling. Polar codes are error-correcting codes that can be used to transmit data over noisy communication channels. To further improve the performance of polar codes, a technique called dynamic bit freezing can be used. Frozen bits are bits preset to fixed values ​​(0 or 1) and not used to transmit any data. Polar codes using dynamic bit freezing do not initialize the frozen positions of the polar code with preset values ​​(0 or 1), but instead set some frozen bits to combinations of previous information bits, which affects the code spectrum. A polar code that uses dynamic bit freezing and shares it across several transmission code blocks is defined as inter-frame coding. Based on this, the values ​​of frozen bits are dynamically set to make two consecutive frames correlated. Using the correlation between consecutive frames, errors in the unfrozen bits of the failed decoding frame with extremely low reliability are corrected. Experiments have shown that there exists an optimal value m for dynamically frozen bits that results in the lowest probability of errors.

[0004] However, in current MIMO transmission systems, code blocks (CBs) within a transport block do not utilize the potential correlations between blocks. CBs transmitted in parallel in MIMO are processed independently, thus reducing the decoding success rate of parallel CBs. Furthermore, existing methods for estimating the optimal value of dynamically frozen bits involve time-consuming simulations, requiring computationally intensive simulations for each channel type and coding parameter, and only consider polar-coded transmission, thus limiting the applicability of this method.

[0005] Therefore, it is urgent to propose an encoding and decoding method to solve the above problems. Summary of the Invention

[0006] This application provides an encoding and decoding method for parallel CB transmission using correlated bits in a MIMO system, applicable to various transmission channels such as fading channels. These embodiments propose a method for estimating the optimal value of dynamically frozen bits, replacing existing complex and time-consuming simulations.

[0007] According to a first aspect, this application provides an encoding method. The method is applied to a MIMO transmission system. The method includes: Obtain a first code block and a second code block (CB), wherein the first CB and the second CB are encoded using the same scheme, the first CB and the second CB correspond to different MIMO antennas, and the first CB includes elements mapped to the second CB. m One information bit; send the first CB and the second CB.

[0008] For example, the first CB and the second CB belong to the same transport block.

[0009] In another example, the first CB and the second CB are modulated using any modulation method such as BPSK, QPSK, QAM, etc.

[0010] According to the above technical solution, the technique of using correlated bits among multiple CBs within a transport block is applied to a MIMO transmission system, wherein the multiple CBs come from different MIMO antennas. This helps to improve the accuracy of CB transmission in the MIMO transmission system and reduce the word error rate (WER) of the CB recovery.

[0011] In some possible implementations, obtaining the first CB and the second CB includes: determining based on a first threshold associated with a first noise variance and a second threshold associated with a second noise variance. m The values ​​are given, where the first and second thresholds represent the upper and lower limits of the transmitted WER, respectively. Both the first and second thresholds are determined by any of the following approximation algorithms: Gaussian approximation (GA), normal approximation (NA), or meta-converse (MC). The first noise variance is the noise variance of the channel used to transmit the first CB, and the second noise variance is the noise variance of the channel used to transmit the second CB. m The value determines the m One information bit; the... m Each information bit is mapped to the second CB.

[0012] It should be noted that in different application scenarios,m The value will change dynamically.

[0013] According to the above technical solution, the WER and boundary value corresponding to two CBs with related bits are determined through online theoretical calculation, and based on the WER and the boundary value, the following is determined: m The value of is thus replaced by time-consuming simulation and the computational efficiency is improved.

[0014] In some possible implementations, the channel used to transmit the first CB and the channel used to transmit the second CB are additive white Gaussian noise (AWGN) channels, wherein the determination is based on a first threshold associated with the first noise variance and a second threshold associated with the second noise variance. m The values ​​include those determined according to the following equation. m Value: p 1=Pe( N , K , s 1)(1–Pe( N , K+m, s 2))Pe( N , K–m, s 1)(1) p 2=Pe( N , K , s 1)Pe( N , K + m , s 2)(2) m =arg min m ( p 1+ p 2)(3) Among them, Pe( N , K , s 1) indicates that the variance of the first noise is s At time 1, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+m, s 2) indicates that the variance of the second noise is s At time 2, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K–m, s1) indicates that the variance of the first noise is s At time 1, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 represents the probability that the first CB is incorrectly re-decoded given that the second CB is correctly decoded; p 2 represents the probability that both CBs are incorrectly decoded; m express m The calculated value.

[0015] According to the above technical solution, the WER and the boundary value corresponding to the two CBs with related bits are determined by deterministic equations, and the WER and the boundary value are used to determine... m The method of finding the value replaces time-consuming simulations and improves computational efficiency.

[0016] In some possible implementations, the channel for transmitting the first CB and the channel for transmitting the second CB are MIMO fading channels using orthogonal frequency division multiplexing (OFDM) transmission, determined based on a first threshold associated with the first noise variance and a second threshold associated with the second noise variance. m The values ​​include those determined according to the following equation. m Value: W=(H H H) –1 H H (4) p 1=Pe( N , K , s 1 )(1–Pe( N , K+m, s 2 Pe(N, K–m, s 1 (5) p 2=Pe( N , K , s 1 Pe( N , K + m , s 2 (6) m =arg min m ( p 1+ p 2)(7) Where W represents the zero-forcing decision based on the channel matrix H of the channel; Pe( N , K , s 1 ) indicates that the first noise variance is updated to s 1 When, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+ m, s 2 ) indicates that the second noise variance is updated to s 2 When, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K – m , s 1 ) indicates that the first noise variance is updated to s 1 When, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 represents the probability that the first CB is incorrectly re-decoded given that the second CB is correctly decoded; p 2 represents the probability that both CBs are incorrectly decoded; m express m The calculated value, s 1 or s 2 Determined based on the following relationship: s i = s i ( ∑(w i 2 )) 1 / 2 , where w i Indicates the first W i OK, s 1 represents the first noise variance. s 2 represents the second noise variance.

[0017] For example, solving m The optimal value, i.e. m =arg min m ( p 1+ p 2), it is necessary to calculate ( p 1+ p 2) The independent variable when the minimum value is taken. m The value may be a real number and needs to be rounded. The following rounding methods can be used.

[0018] In one implementation, rounding is done to the nearest smaller integer. If m If the integer is 2.3, 2.5, or 2.8, then round it to the nearest smallest integer. m =2.

[0019] In one implementation, rounding is done to the nearest larger integer. If m If the integer is 2.3, 2.5, or 2.8, then round it to the nearest smallest integer. m =3.

[0020] In one implementation, rounding is done to the nearest integer. If m =2.3, then m =2, if m =2.8, then m =3. If m =2.5, then m Rounded to 2.

[0021] According to the above technical solution, the WER and the boundary value corresponding to the two CBs with related bits are determined by deterministic equations, and the WER and the boundary value are used to determine... m The method of finding the value replaces time-consuming simulations and improves computational efficiency.

[0022] In some possible implementations, when the encoding scheme is polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the most reliable frozen bit position of the second CB; or, in the case that the encoding scheme is LDPC encoding, the... mThe information bits are the first CB m Each random information bit is mapped to a random position in the second CB.

[0023] In some possible implementations, when the encoding scheme is a cross-block encoding based on polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the most reliable frozen bit position of the second CB, which includes [number] information bits. n Information bits, the n The information bits represent the lowest reliability of the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB. m The value and n The value may be greater than or equal to 0.

[0024] According to the above technical solution, the encoding method can be applied to a variety of encoding scenarios, thereby increasing the applicability of the encoding method.

[0025] According to a second aspect, this application provides a decoding method. The method is applied to a MIMO transmission system and includes: Receive a first CB and a second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, the first CB including m The second CB includes one information bit. n One information bit, m Each information bit is mapped to a second CB; accordingly, the second CB is used. n One information bit and the first CB m Each information bit is used to decode the first CB and the second CB.

[0026] According to the above technical solution, the technique of using correlated bits among multiple CBs within a transport block is applied to a MIMO transmission system, wherein the multiple CBs come from different MIMO antennas. This helps to improve the accuracy of CB transmission in the MIMO transmission system and reduce the WER of the CB recovery.

[0027] In some possible implementations, when the encoding scheme is polar coding, these m The information bits represent the lowest reliability of the first CB. m These information bits are mapped to the most reliable frozen bit position of the second CB; or, in the case that the encoding scheme is LDPC encoding, these m The information bits are the first CBm Each random information bit is mapped to a random position in the second CB; n The value is equal to m The value of .

[0028] In some possible implementations, when the encoding scheme is a cross-block encoding based on polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The information bits represent the lowest reliability of the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB.

[0029] According to the above technical solution, the encoding method can be applied to a variety of encoding scenarios, and correspondingly, the decoding method can be applied to a variety of decoding scenarios, thereby improving the applicability of the decoding method.

[0030] In some possible implementations, according to the second CB n The information bits and the first CB m Decoding the first CB and the second CB with each information bit includes: decoding the first CB; if the first CB is correctly decoded, then it is considered that the... m Knowing the information bits, decode the second CB; if the first CB is decoded incorrectly, then the information bits are considered to be... m If one information bit is unknown, the second CB is decoded; if the second CB is correctly decoded, then it is considered that the... n If one information bit is known, the first CB is re-decoded; if both the first CB and the second CB are incorrectly decoded, then both the first CB and the second CB are considered to have been incorrectly decoded.

[0031] According to the above technical solution, in the case that the first CB is incorrectly decoded, the first CB can be re-encoded based on the relevant bits between the first CB and the second CB, thereby helping to improve the probability of the CB being correctly decoded.

[0032] According to a third aspect, this application provides an encoding apparatus. The apparatus is applied to a MIMO transmission system, and includes: an encoding unit for acquiring a first CB and a second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB respectively correspond to different MIMO antennas, and the first CB... mOne information bit is mapped to the second CB; a transmitting unit is used to transmit the first CB and the second CB.

[0033] In some possible implementations, the encoding unit is specifically used to: determine based on a first threshold associated with a first noise variance and a second threshold associated with a second noise variance. m The values ​​are defined as follows: where the first and second thresholds represent the upper and lower limits of the transmitted WER, respectively. Both the first and second thresholds are determined by any of the following approximation algorithms, including Gaussian approximation, normal approximation, and the elementary inverse bound. The first noise variance is the noise variance of the channel used to transmit the first CB, and the second noise variance is the noise variance of the channel used to transmit the second CB. The thresholds are determined based on the calculated values. m ; will the m Each information bit is mapped to the second CB.

[0034] In some possible implementations, the channel used to transmit the first CB and the channel used to transmit the second CB are AWGN channels, and the coding unit is specifically used to determine according to the aforementioned equations (1) to (3). m The value of .

[0035] In some possible implementations, the channel used to transmit the first CB and the channel used to transmit the second CB are fading channels, and the coding unit is specifically used to determine according to the aforementioned equations (4) to (7). m The value of .

[0036] In some possible implementations, when the encoding scheme is polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the most reliable frozen bit position of the second CB; or, in the case that the encoding scheme is LDPC encoding, the... m The information bits are the first CB m Each random information bit is mapped to a random position in the second CB.

[0037] In some possible implementations, when the encoding scheme is a cross-block encoding based on polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The information bits represent the lowest reliability of the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB.

[0038] According to a fourth aspect, this application provides a decoding apparatus. The apparatus is applied to a MIMO transmission system, and the apparatus includes: A receiving unit is configured to receive a first CB and a second CB, wherein the first CB and the second CB are encoded using the same scheme, the first CB and the second CB correspond to different MIMO antennas, and the first CB includes elements mapped to the second CB. m Information bits, the second CB includes bits mapped to the first CB. n One information bit; a decoding unit for using the second CB. n Each information bit is used to decode and utilize the first CB. m The second CB is decoded using one information bit.

[0039] In some possible implementations, when the encoding scheme is polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the most reliable frozen bit position of the second CB; or, in the case that the encoding scheme is LDPC encoding, the... m The information bits are the first CB m Each random information bit is mapped to a random position in the second CB.

[0040] In some possible implementations, when the encoding scheme is a cross-block encoding based on polar coding, the... m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The information bits represent the lowest reliability of the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB. n The value and m The values ​​may be the same ( n = m (or different) m The value and n The value may be greater than or equal to 0.

[0041] In some possible implementations, the encoding unit is specifically used to decode the first CB; if the first CB is correctly decoded, then it is considered that the... m One information bit is known, and the second CB is decoded; if the first CB is incorrectly decoded, then it is considered that the... mOne information bit is unknown, and the second CB is decoded; if the second CB is correctly decoded, then it is considered that the... n If one information bit is known, the first CB is re-decoded; if both the first CB and the second CB are incorrectly decoded, then both the first CB and the second CB are considered to have been incorrectly decoded.

[0042] According to a fifth aspect, an apparatus is provided, including a processor and a memory. The processor is connected to the memory. The memory is used to store instructions, and the processor is used to execute the instructions. When the processor executes the instructions stored in the memory, the processor performs the method in any possible implementation of the first or second aspect.

[0043] According to a sixth aspect, this application provides a communication system including the apparatus described in any possible implementation of the third and fourth aspects, as well as the apparatus described in any possible implementation of the fifth aspect.

[0044] According to a seventh aspect, this application provides a computer-readable storage medium including instructions. When the instructions are executed on a processor, the processor causes the processor to perform the method in any possible implementation of the first or second aspect.

[0045] According to an eighth aspect, this application provides a computer program product including computer program code. When the computer program code is run on a computer, it causes the computer to perform the method described in any possible implementation of the first or second aspect.

[0046] In some possible implementations, all or part of the aforementioned computer program code may be stored in a first storage medium. The first storage medium may be packaged together with the processor or separately from the processor.

[0047] According to a ninth aspect, this application provides a chip system including a memory and a processor. The memory is used to store a computer program, and the processor is used to retrieve and run the computer program from the memory to cause an electronic device equipped with the chip system to perform the method described in any possible implementation of the first or second aspect. Attached Figure Description

[0048] One or more embodiments have been described by way of example with reference to the accompanying drawings, which are not intended to limit the embodiments. Elements with the same reference numerals in the drawings are shown as similar elements, and the drawings are not to scale. Figure 1A schematic diagram of transport block segmentation.

[0049] Figure 2 This is a schematic diagram of a traditional code block scheme.

[0050] Figure 3 This is a schematic diagram of inter-frame polarization coding.

[0051] Figure 4 This is a schematic diagram of encoding method 400.

[0052] Figure 5 A schematic diagram of a method 500 for obtaining the first CB and the second CB.

[0053] Figure 6 The total error probability (Pr) is the value of the number of correlated bits. m A schematic diagram of ( ).

[0054] Figure 7 This is a schematic diagram of decoding method 700.

[0055] Figure 8 This is a schematic diagram of the CB encoding and decoding process based on polar codes.

[0056] Figure 9 To make the first CB m A schematic diagram showing how information bits are mapped to the second CB.

[0057] Figure 10 This is a schematic diagram of the CB encoding and decoding process based on polar codes.

[0058] Figure 11 This is a schematic diagram of the CB encoding and decoding process based on LDPC.

[0059] Figure 12 To make the first CB m Another schematic diagram of mapping one information bit to the second CB.

[0060] Figure 13 This is another schematic diagram of the CB encoding and decoding process based on polar codes.

[0061] Figure 14 To make the first CB m Another schematic diagram of mapping one information bit to the second CB.

[0062] Figure 15 This is a schematic block diagram of the encoding device 1500.

[0063] Figure 16 Another schematic block diagram of the decoding device 1600. Detailed Implementation

[0064] To gain a more detailed understanding of the features and technical content of the embodiments of the present invention, the implementation methods of the embodiments of the present invention will be described in detail below with reference to the accompanying drawings. The drawings are for reference and illustration only and are not intended to limit the embodiments of the present invention. In the following technical description, many details are set forth for ease of explanation in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may be practiced without these details. In other instances, well-known structures and apparatuses may be shown in a simplified manner to simplify the accompanying drawings.

[0065] To better understand the technical solution proposed in this application, the relevant technologies and concepts are introduced first.

[0066] MIMO (Multiple-Input Multiple-Output) is a wireless communication technology that improves the reliability and efficiency of data transmission by using multiple antennas at both the transmitting and receiving ends. By using multiple antennas, MIMO can simultaneously transmit and receive multiple data streams, thereby increasing the overall data rate of the wireless communication system. MIMO can be combined with coding and modulation schemes to further enhance the performance of wireless communication systems. Channel coding is a technique that adds redundancy to transmitted data, helping to detect and correct errors that may occur during transmission. By combining channel coding with MIMO, future wireless communication systems can achieve high data rate transmission, which is crucial for applications such as video streaming, online gaming, and other data-intensive tasks. In 5G networks, LDPC and polarization coding schemes are combined with MIMO to achieve high data rates and reliable transmission. Modulation schemes used in 5G networks include Quadrature Phase-Shift Keying (QPSK) and Quadrature Amplitude Modulation (QAM) (such as 16-QAM and 64-QAM), which can be used in different combinations to optimize data rate and signal quality. Overall, using MIMO technology in combination with coding and modulation schemes is an effective way to achieve high-speed, reliable communication in wireless networks. By optimizing the use of available resources, wireless communication systems can achieve higher data rates and better network performance, which is crucial for applications such as high-definition video streaming, online gaming, and other data-intensive tasks.

[0067] In 5G mobile communication systems, a transport block (TB) refers to a block of data transmitted over the air interface between a base station and user equipment. The size of a transport block depends on various factors, such as the modulation and coding scheme used, channel conditions, and quality of service requirements. The transport block is the basic unit for transmitting data over the air interface in a 5G network. It contains user data and control information, such as error correction codes, channel quality indicators, and other information necessary for reliable transmission. The size of the transport block is variable and can be dynamically adjusted based on channel conditions and the signal-to-noise ratio. In 5G networks, transport blocks are transmitted using advanced technologies such as MIMO, beamforming, and other optimization techniques. This enables higher data rates and more reliable communication, which is crucial for applications such as high-definition video streaming, virtual and augmented reality, and other data-intensive tasks.

[0068] In 5G mobile communication systems, a single modulation and coding scheme (MCS) is typically assigned to each transport block. This is because the MCS used for a transport block is optimized based on the channel conditions, signal-to-noise ratio (SNR), and quality of service (QoS) requirements. Assigning a single MCS to a transport block effectively utilizes available resources and ensures optimized transmission for specific channel conditions. Using multiple MCSs for a single transport block would lead to inefficient utilization of available resources. Furthermore, using a single MCS for a transport block simplifies the implementation and management of the communication system. This simplifies system design, reduces the complexity of the communication process, and enables faster and more reliable communication.

[0069] In 5G networks, using a single modulation and coding scheme for each transport block has certain drawbacks, although these drawbacks may not be significant in most cases. Some potential drawbacks include: 1. Suboptimal performance: If channel conditions change during transmission, allocating a single MCS to a transport block based on those channel conditions may result in suboptimal performance. In such cases, a different MCS might be more suitable, but switching to a different MCS within a single transport block is not supported.

[0070] 2. Inefficient resource utilization: In some cases, allocating a single MCS to a transport block may result in inefficient utilization of available resources. For example, if channel conditions are favorable, a higher-order MCS can be used to achieve a higher data rate, which is not possible with a single MCS.

[0071] 3. Lack of flexibility: Using a single MCS for each transport block may limit the flexibility of the communication system. For example, it is not possible to allocate different MCSs to different users based on their specific needs.

[0072] 4. Increased Latency: In some cases, using a single MCS for each transport block can lead to increased latency because data needs to be retransmitted if an error occurs. This latency can be higher than that of a system that can switch between different MCSs based on channel conditions.

[0073] Overall, while using a single MCS per transport block in 5G networks is generally efficient and feasible, this approach is not optimal in certain situations.

[0074] In NR, polar codes and LDPC codes are used for most channels. In 5G NR, LDPC codes are used for data transmission of MBB services, while polar codes are used for control signaling. From an implementation perspective, LDPC codes have significant advantages, especially at data rates of several gigabits per second. The LDPC codes used in NR employ a rate-compatible structure, unlike the LDPC codes used in other wireless technologies. This structure supports transmission at different code rates and HARQ operation. NR uses polar codes in physical layer control signaling, where information blocks are relatively small compared to data transmission.

[0075] Polar codes are error-correcting codes used to transmit data over noisy communication channels. The polar coding process is based on the channel polarization phenomenon. Its core principle is that, through certain transformations, the information transmission channel can be divided into two sub-channels. As the code length approaches infinity, the error probability of each sub-channel approaches 0 or 1. Based on this characteristic of sub-channels, data bits are transmitted through the sub-channel with the highest reliability, while preset data bits (usually 0) are transmitted through the sub-channel with the lowest reliability.

[0076] To further improve the performance of polar codes, a technique called dynamic bit freezing can be employed. Frozen bits are bits preset to fixed values ​​(0 or 1) and not used for transmitting any data. Polar codes using dynamic bit freezing do not initialize the frozen positions of the polar code with preset values ​​(0 or 1), but instead set some frozen bits to combinations of previous information bits, which affects the code spectrum. A polar code that shares dynamic bit freezing across several transmission blocks is defined as inter-frame coding. Based on research on successive cancellation of flip decoding in decoding failure scenarios, the first error usually occurs in unfrozen bits with low reliability or bits with a small average log-likelihood ratio (LLR). Once the error is corrected, the probability of successful decoding increases significantly. Based on this finding, an inter-frame polar coding scheme using dynamic bit freezing for consecutive block transmission is proposed. The values ​​of the frozen bits are dynamically set to ensure correlation between two consecutive frames.

[0077] By leveraging the dependencies between consecutive frames, errors in unfrozen bits of highly unreliable type in failed decoding frames are corrected. Experiments reveal an optimal value for dynamically frozen bits that minimizes the probability of errors. m .

[0078] Experience shows that there are specific m This value achieves the lowest possible block error rate (BLER) performance. This is because: for smaller values... m The value is insufficient to provide enough extra frozen bits to assist in re-decoding failed decoded frames, and for larger values... m Excessive frozen bits are considered as unfrozen bits participating in frame decoding; therefore, there exists an optimal value for dynamically frozen bits that results in the lowest error probability. m .

[0079] To improve the overall reliability of transmission and ensure accurate and efficient data delivery, an MCS can be assigned to each transport block.

[0080] Transport blocks can be quite large, so they are often divided into smaller code blocks (CBs) to improve transmission efficiency.

[0081] Figure 1 This is a schematic diagram of transport block segmentation. Figure 2 This is a schematic diagram of a traditional code block scheme.

[0082] These CBs (block #1, block #2, and block #3) are the same size, and all CBs in a transport block (TB) share the same MCS parameters, i.e. ( N , K ): Code length is N and includes K Each CB in the TB uses the same modulation and coding scheme, ensuring that all CBs are transmitted with the same level of reliability. The TB carries a cyclic redundancy check (CRC) code, also known as TB-CRC; correspondingly, each CB in the TB carries a CRC code, also known as CB-CRC, and the last CB contains the TB-CRC.

[0083] By dividing the transport block into smaller code blocks, the system can better handle errors. If a code block is lost or corrupted during transmission, the receiver can still recover the data from the other code blocks in the transport block. This improves the overall reliability of the transmission and ensures that data is delivered accurately and efficiently.

[0084] Furthermore, consider a polar code of length N constructed based on a reliability sequence, with index v={ v 0,...,v N–1}, where, if i < j Then the bit index v i Its reliability is lower than that of the bit index. v j Typical polar coding schemes are based on v and the number of unfrozen bits. K All N The source bits are divided into two sets: the set of unfrozen bits. ={ v N–K ,..., v N–1} Includes highly reliable K The index of bits, the rest ( N – K The index of the 10 bits comes from the frozen bit set. ={ v 0,..., v N–K–1 To achieve reasonable error correction performance in finite-length polar codes, the length is... r The CRC and polar code are concatenated and decoded using CA-SCL. r CRC bits and ( K – r ) information bits are allocated to the index The bits. The index is The frozen bits are fixed to predefined values ​​known to the decoder.

[0085] Figure 3 This is a schematic diagram of inter-frame polarization coding.

[0086] In an inter-frame polarization coding scheme employing dynamically frozen bits for AWGN channels, the values ​​of the frozen bits are dynamically set to ensure correlation between two consecutive frames (CB#1, CB#2). Each subsequently transmitted frame contains the information bit set from the previous frame. Simulation experiments revealed the optimal values ​​for the correlation bits. m .set up ={ v N–K–m ,..., v N–K–1} indicates the highest reliability m A set of frozen bits ={ v N–K ,..., v N+m–1} indicates the lowest reliability m A set of unfrozen bits. Note ∈ , ∈ And| |=| |= m The frozen bit with the highest reliability in a frame can be assigned to the unfrozen bit with the lowest reliability in the previous frame, and the remaining frozen bits can be set to zero.

[0087] The optimal values ​​of relevant bits for the AWGN channel are estimated through simulation. In the prior art, code blocks in a transport block are encoded using error-correcting codes with the same code rate.

[0088] Due to throughput limitations and system configuration, 5G systems lack the ability to allocate a certain number of MCS values ​​to code blocks. This can lead to several drawbacks, such as suboptimal performance, inefficient resource utilization, lack of flexibility, and increased latency. In current MIMO systems, code blocks within a transport block do not utilize the potential correlation between blocks, and there is a lack of flexibility in allocating code rates within a transport block. Existing technologies do not consider methods for using correlated bits for parallel CB transmission in MIMO; correlated bits are only applied to serial code block transmission in AWGN channels. Furthermore, existing technologies for estimating the optimal value of dynamically frozen bits involve time-consuming simulations, requiring computationally intensive simulations for each channel type and coding parameter, and only consider polar-coded transmission.

[0089] In view of the above, embodiments of this application provide an encoding and decoding method that utilizes relevant bits for parallel CB transmission in a MIMO system and is applicable to various transmission channels; at the same time, a method for estimating the optimal value of dynamically frozen bits is proposed to replace the existing complex and time-consuming simulation.

[0090] Consider a portion of a channel coding pipeline consisting of CRC appending, code block segmentation, and forward error correction. Code block segmentation breaks down the transport block (TB) transmitted in the previous layer into smaller code blocks (CBs) with discrete size options. This stage also adds two CRCs: one at the TB level and another for each CB. Channel coding is performed using forward error correction codes (polar codes, LDPC codes). Specific modulation and coding scheme (MCS) values ​​are assigned to transport blocks. All CBs within a transport block share the same MCS parameters (rate, modulation scheme).

[0091] Accordingly, consider transmitting several blocks using error-correcting codes with CRC appended. CRC verification is performed after decoding. If one block fails to decode, relevant bit processing is performed. If another block, including the corresponding duplicate bits, is correctly decoded, the relevant bits from the correct block are treated as known bits when re-decoding the erroneous block, and these additional bits are used for re-decoding.

[0092] The technical solution proposed in this application is described in more detail below.

[0093] Figure 4 This is a schematic diagram of encoding method 400.

[0094] Method 400 is applied to MIMO transmission systems and specifically includes the following steps, such as... Figure 4 As shown.

[0095] Step 410: Obtain the first CB and the second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, the first CB including m One information bit, m One information bit is mapped to the second CB.

[0096] In some embodiments, the first CB and the second CB belong to the same transport block.

[0097] It should be noted that, m The information bits are the relevant bits in the above embodiments.

[0098] Step 420: Send the first CB and the second CB.

[0099] According to the above technical solution, the technique of using correlated bits among multiple CBs within a transport block is applied to a MIMO transmission system, wherein the multiple CBs come from different MIMO antennas. This helps to improve the accuracy of CB transmission in the MIMO transmission system and reduce the WER of CB recovery.

[0100] Figure 5 This is a schematic diagram of a method 500 for obtaining the first CB and the second CB. (See diagram for example.) Figure 5 As shown, method 500 specifically includes the following steps.

[0101] Step 510: Determine based on a first threshold associated with the first noise variance and a second threshold associated with the second noise variance. mThe values ​​are given by , where the first and second thresholds represent the upper and lower limits of the transmitted WER, respectively. Both the first and second thresholds are determined by any of the following approximation algorithms, including GA, NA, and MC. The first noise variance is the noise variance of the channel used to transmit the first CB, and the second noise variance is the noise variance of the channel used to transmit the second CB.

[0102] It should be noted that in different application scenarios, m The value will change dynamically.

[0103] Step 520: Based on m The calculated value is determined m One information bit.

[0104] Step 530: Mapping m One information bit is sent to the second CB.

[0105] According to the above technical solution, the WER and boundary value corresponding to two CBs with related bits are determined through online theoretical calculation, and the value of m is determined based on the WER and the boundary value, thereby replacing time-consuming simulation and improving computational efficiency.

[0106] In some embodiments, the encoding of the first CB and the second CB can be implemented using multiple schemes, with different encoding schemes corresponding to... m Different mapping methods for each information bit and m The different contents of each information bit.

[0107] In some embodiments, when the encoding method is polar coding... m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB; or, in the case of LDPC encoding, the information bits are mapped to the frozen bit position in the second CB. m The first CB has one information bit. m Each bit of random information is mapped to a random position in the second CB.

[0108] In one embodiment, polar coding can be applied to cross-block coding scenarios. When the coding method is a cross-block coding based on polar coding, m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB, which includes... n One information bit, n The reliability of the second CB is the lowest among the information bits. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB.

[0109] Based on the above technical solutions, methods 400 and 500 can be applied to various coding scenarios, thereby improving the applicability of methods 400 and 500.

[0110] According to the above embodiment of method 500, WER can be approximated by using a boundary value.

[0111] For example, under some fixed channel conditions, consider using two transmitting antennas ( N t =2) and any number of receiving antennas N r Experimental transmission is conducted. Two code blocks are arranged between two transmit antennas. In this example, the information bits from one code block are copied into the other code block.

[0112] Assume the first CB carries K Each information bit, using ( N , K The error correction code is used for encoding. The second CB carries... K One information bit, and selected from the information bits of the first CB. m An additional information bit. This additional bit is placed in the most reliable frozen bit of the second CB. The second CB uses ( N , K+m The error correction code is used for encoding. The total from the first CB... m One information bit is additionally encoded in the second CB.

[0113] Figure 6 The total error probability (Pr) is the value of the number of correlated bits. m A schematic diagram of ( ).

[0114] Simulation results show that the optimal values ​​for total error probability and number of correlated bits are... m The choice (obtained through experimental observation) is approximately represented by three curves: (1) The probability (Pr) that the second CB is incorrectly decoded given that the first CB is correctly decoded.

[0115] (2) The probability that the first CB is incorrectly decoded under the condition that the second CB is correctly decoded.

[0116] (3) The probability that the first CB and the second CB are incorrectly decoded.

[0117] Visual representation of curves as follows Figure 6 As shown.

[0118] Given that the first CB is correctly decoded, the probability of the second CB being incorrectly decoded is evaluated. In this case, the probability of the first CB being correctly decoded and the second CB being incorrectly decoded is assessed. An attempt is made to use the values ​​derived from the first CB. m The extra bits are used to recover the second CB. The probability (Pr(·)) of the first CB being correctly decoded is Pr(1 st correct) = 1 – Pe( N , K ), where Pe( N , K )for( N , K The decoding of the CB code is WER. The probability that the second CB is incorrectly decoded is Pr(2). st incorrect) = Pe(N, K+m). Given that the first CB is correctly decoded, the probability that the second CB is incorrectly recovered is Pr(2). st incorrect|1 st (Correct). Assume these probabilities are independent of each other.

[0119] At this point, the probability Pr(1) st Correct, 2 st (Incorrect) estimate: Pr(1 st Correct, 2 st incorrect)=Pr(1 st correct)Pr(2 st incorrect)Pr(2 st incorrect|1 st (correct) =(1–Pe( N , K Pe( N , K+m Pe( N , K ) Among them, Pe( N , K )for( N , K The WER of the code. According to experiments, this probability is close to a constant, so it can be omitted in subsequent calculations.

[0120] The probability of the first CB being incorrectly decoded again, assuming the second CB is correctly decoded, corresponds to the scenario where the first CB is incorrectly decoded and the second CB is correctly decoded. Try using the second CB... m The extra bits are used to recover the first CB. The probability (Pr) of the first CB being incorrectly decoded is Pr(1).st incorrect) = Pe( N , K ), where Pe( N , K )for( N , K The error rate of the second CB being incorrectly decoded. The probability of the second CB being correctly decoded is Pr(2). st correct) = 1 – Pe( N , K+m The probability that the first CB is incorrectly recovered under the condition that the second CB is correctly decoded is Pr(1). st incorrect|2 st (Correct). Assume the probabilities are independent. The first CB is still incorrectly decoded ( m not enough).

[0121] At this point, the probability Pr(2) st correct, 1 st (Incorrect) estimate: Pr(2 st correct, 1 st incorrect)=Pr(1 st incorrect)Pr(2 st correct)Pr(1 st incorrect|2 st (correct) =Pe( N , K )(1–Pe( N , K+m Pe( N , K–m ) The situation arises when both the first CB and the second CB are incorrectly decoded. Assume the events are independent.

[0122] At this point, the probability Pr(1) st incorrect, 2 st (Incorrect) estimate: Pr(1 st incorrect, 2 st incorrect)=Pr(1 st incorrect)Pr(2 st (incorrect) =Pe( N , K Pe(N , K+m ) This method can be generalized to any number of code blocks.

[0123] In some embodiments, the Pe value can be experimentally calculated using Monte Carlo simulations. To avoid these highly complex simulations, a structured algorithm is proposed to approximate the Pe curve using theoretical calculations based on asymptotic WER thresholds.

[0124] According to the above embodiment of method 500, the structured algorithm includes: a meta-inverse bound, a normal approximation, a Gaussian approximation bound for continuous elimination decoding, or a joint bound.

[0125] It should be understood that if a compact WER bound is known, then the estimate of the relevant bit count will also be compact.

[0126] WER Pe( N , K The noise variance will also be... s As the independent variable. Therefore, for an AWGN channel, the noise variance can be substituted into the probability estimate, i.e., Pe( N , K, s i ),in, i For CB indexing. For flat fading channels, the multiplicative channel attenuation factor needs to be considered, and the noise variance needs to be recalculated using the following method: Given the channel matrix H, the zero-forcing decision can be written as W=(H H H) –1 H H Based on W, the updated noise variance is s i =s i ( ∑(w i 2 )) 1 / 2 , where w i For W's i OK.

[0127] Accordingly, this application provides a decoding method.

[0128] Figure 7 This is a schematic diagram of decoding method 700.

[0129] Method 700 is applied to MIMO transmission systems and specifically includes the following steps, such as... Figure 7 As shown.

[0130] Step 710: Receive the first CB and the second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas. The first CB includes... m The second CB includes one information bit. n One information bit, m One information bit is mapped to the second CB.

[0131] Step 720: According to the first CB m One information bit and the second CB n Each information bit is used to decode the first CB and the second CB.

[0132] According to the above technical solution, the technique of using correlated bits among multiple CBs within a transport block is applied to a MIMO transmission system, wherein the multiple CBs come from different MIMO antennas. This helps to improve the accuracy of CB transmission in the MIMO transmission system and reduce the WER of CB recovery.

[0133] In some embodiments, the encoding of the first CB and the second CB can have multiple schemes, and different encoding schemes correspond to... m Different ways of mapping information bits to the second CB m The different contents of each information bit and n The different contents of each information bit.

[0134] In some embodiments, when the encoding scheme is polar coding... m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB; or, in the case of LDPC encoding, the information bits are mapped to the frozen bit position in the second CB. m The first CB has one information bit. m Each random information bit is mapped to a random position in the second CB; n The value is equal to m The value of .

[0135] In one embodiment, polar coding can be applied to cross-block coding scenarios. When the coding scheme is a cross-block coding scheme based on polar coding, m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The reliability of the second CB is the lowest among the information bits. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB; m The value and n The values ​​may be the same ( m=n (or different) m The value and n The value may be greater than or equal to 0.

[0136] According to the above technical solution, multiple encoding methods can be used to encode the first CB and the second CB, thereby improving the applicability of method 700.

[0137] In some embodiments, it can be done according to the following methods m one information bit and n Each information bit is used to decode the first CB and the second CB: Decode the first CB; If the first CB is correctly decoded, then it is considered m Knowing that one information bit is known, decode the second CB; If the first CB is incorrectly decoded, then it is considered m One information bit is unknown; decode the second CB. If the second CB is correctly decoded, then it is considered n Knowing that all information bits are present, the first CB is re-decoded; If both the first CB and the second CB are incorrectly decoded, then both the first CB and the second CB are considered to have been incorrectly decoded.

[0138] According to the above technical solution, in the case of the first CB being incorrectly decoded, the first CB can be re-encoded based on the relevant bits between the first CB and the second CB, thereby helping to improve the probability of the CB being correctly decoded.

[0139] To facilitate understanding, the following will combine... Figure 8 to Figure 15 The encoding and decoding methods proposed in the embodiments of this application will be described in detail.

[0140] Figure 8 This is a schematic diagram of the CB encoding and decoding process based on polar codes. Figure 9 To make the first CB m A schematic diagram showing the mapping of information bits to the second CB. In this embodiment, the encoding scheme consists of a polarimetric non-system encoder and a list size of... L The SC or SCL decoder implementation.

[0141] like Figure 8 and Figure 9 As shown, for the encoding end, the first CB uses ( N , K The second CB is encoded using polar codes. N , K+m The polar code is used for encoding, wherein the first CB includes m One information bit,m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position of the second CB. The first and second CBs are modulated using any modulation scheme such as BPSK, QPSK, or QAM. Then, the first and second CBs are transmitted through the AWGN channel.

[0142] like Figure 8 As shown, for the decoding end, firstly, the first CB is decoded. If the first CB is decoded correctly, then it is considered... m The extra bits are known bits used to decode the second CB. In one embodiment, m The extra bits are the first CB. m One information bit. If the first CB is incorrectly decoded, then it is considered to be from the first CB. m The extra bits are unknown; decode the second CB. If the second CB is successfully decoded, use the bits from the second CB. m Each bit is used to re-decode the first CB that was initially decoded incorrectly. Otherwise, both CBs are considered to have been decoded incorrectly.

[0143] For calculation Figure 9 Optimal number of relevant bits in the scenario m The following steps are used. Noise variance and threshold are taken as input. First, based on the given threshold and noise variance... s 1. s 2. Calculate the WER (Warnings Estimation) when the first CB is incorrectly decoded, assuming the second CB is correctly decoded. Next, based on the given threshold and noise variance... s 1. s 2. Calculate the WER of the two erroneously decoded CBs. Finally, estimate the optimal value of the number of relevant bits as the independent variable that minimizes the sum of the two WERs.

[0144] Based on the above description, the following equation is used to determine... m Value: p 1=Pe( N , K , s 1)(1–Pe( N , K+m, s 2))Pe( N , K–m, s 1)(1) p 2=Pe( N , K , s 1)Pe( N , K + m , s2)(2) m =arg min m ( p 1+ p 2)(3) Among them, Pe( N , K , s 1) indicates that the variance of the first noise is s At time 1, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+m, s 2) indicates that the variance of the second noise is s At time 2, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K–m, s 1) indicates that the variance of the first noise is s At time 1, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 indicates a WER where the first CB is incorrectly re-decoded, provided the second CB is correctly decoded; p 2 indicates a WER in which both CBs are incorrectly decoded; m express m The calculated value.

[0145] Figure 10 To make the first CB m Another schematic diagram of mapping one information bit to the second CB. In this embodiment, the channel used to transmit the first CB and the channel used to transmit the second CB are fading channels, which are MIMO fading channels for OFDM transmission. The coding scheme consists of a polarimetric non-system encoder and a list size of [missing information]. L The SC or SCL decoder implementation.

[0146] like Figure 10 As shown, for the encoding end, the first CB uses ( N , K The second CB is encoded using polar codes. N , K The polar code is used for encoding, wherein the first CB includes m One information bit, m The reliability of the first CB is the lowest among the information bits. mEach information bit is mapped to the most reliable frozen bit position of the second CB. The first and second CBs are modulated using any modulation scheme such as BPSK, QPSK, or QAM. Then, the first and second CBs are transmitted through a fading channel.

[0147] and Figure 8 The corresponding implementation is similar. For the decoding end, firstly, the first CB is decoded. If the first CB is decoded correctly, then... m Additional bits are used to decode the second CB. In one embodiment, m The extra bits are the first CB. m One information bit. If the first CB is incorrectly decoded, then it is considered to be from the first CB. m The extra bits are unknown; decode the second CB. If the second CB is successfully decoded, use the bits from the second CB. m Each bit is used to re-decode the first CB that initially had a decoding error. Otherwise, both CBs are marked as incorrectly decoded.

[0148] For calculation Figure 10 Optimal number of relevant bits in the scenario m The following steps are used. The noise variance and threshold are taken as input. First, based on the given threshold and noise variance σ1, the parameters are calculated as follows ( N , K The first CB's WER. Secondly, based on the given threshold and noise variance σ², the parameters are calculated as ( N , K + m The second CB's WER. Finally, the optimal value for estimating the number of relevant bits is the independent variable that minimizes the sum of the two WERs.

[0149] Based on the above description, the following equation is used to determine... m Value: W=(H H H) –1 H H (4) p 1=Pe( N , K , s 1 )(1–Pe( N , K+m, s 2 Pe( N , K–m, s 1 (5) p 2=Pe( N , K , s 1 Pe( N , K + m , s 2 (6) m =arg min m ( p 1+ p 2)(7) Where W represents the zero-forcing decision based on the channel matrix H; Pe( N , K , s 1 ) indicates that the first noise variance is updated to s 1 When, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+m, s 2 ) indicates that the second noise variance is updated to s 2 When, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K–m, s 1 ) indicates that the first noise variance is updated to s 1 When, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 indicates a WER where the first CB is incorrectly re-decoded, provided the second CB is correctly decoded; p 2 indicates a WER in which both CBs are incorrectly decoded; m express m The calculated value, s 1 or s 2 Determined by the following relationship: You i = s i ( ∑(w i 2 )) 1 / 2 , where w iThis represents the i-th row of W. s 1 represents the first noise variance. s 2 represents the second noise variance.

[0150] Figure 11 This is a schematic diagram of the CB encoding and decoding process based on LDPC. Figure 12 To make the first CB m Another schematic diagram of mapping one information bit to the second CB. In this embodiment, the channel used to transmit the first CB and the channel used to transmit the second CB are fading channels or AWGN channels, and the coding scheme consists of an LDPC encoder and an iteration number of... I The BP decoder implementation.

[0151] like Figure 11 and Figure 12 As shown, for the encoding end, the first CB uses ( N , K Encoding is done using LDPC code, and the second CB uses ( N , K+m LDPC codes are used for encoding. For LDPC codes, the positions of the relevant bits can be arbitrarily chosen from the information positions. The first CB is encoded in random positions. m bits are mapped to random positions in the second CB, where m Each information bit originates from a random position in the first CB. The first and second CBs are modulated using any modulation scheme such as BPSK, QPSK, or QAM. Then, the first and second CBs are transmitted through a fading channel or an AWGN channel.

[0152] like Figure 11 For the decoding end, firstly, the first CB is decoded. If the first CB is decoded correctly, then... m Additional bits are used to decode the second CB. In one embodiment, m The extra bits are m One information bit. If the first CB is incorrectly decoded, then it is considered to be from the first CB. m The extra bits are unknown; decode the second CB. If the second CB is successfully decoded, use the bits from the second CB. m Each bit is used to re-decode the first CB that initially had a decoding error. Otherwise, both CBs are marked as incorrectly decoded.

[0153] For calculation Figure 12 Optimal number of relevant bits in the scenario m The following steps are used. Noise variance and threshold are taken as input. First, based on the given threshold and noise variance... s 1. The calculation parameters are ( N , KThe first CB's WER. Secondly, based on the given threshold and noise variance. s 2. The calculation parameters are ( N , K + m The second CB's WER. Finally, the optimal value for estimating the number of relevant bits is the independent variable that minimizes the sum of the two WERs.

[0154] Based on the above description, when the channel used to transmit the first CB and the channel used to transmit the second CB are AWGN channels, the determination is made according to equations (1) to (3). m The value of is determined according to equations (4) to (6) when the channels used to transmit the first CB and the channel used to transmit the second CB are fading channels. m The value of .

[0155] Figure 13 This is another schematic diagram of the CB encoding and decoding process based on polar codes. Figure 14 To make the first CB m Another schematic diagram of mapping one information bit to the second CB. In this embodiment, the channel used to transmit the first CB and the channel used to transmit the second CB are fading channels or AWGN channels, and the coding scheme consists of a polarimetric nonsystem encoder and a list size of [missing information]. L The SC or SCL decoder implementation.

[0156] like Figure 13 and Figure 14 As shown, for the encoding end, the first CB has the lowest reliability. m Each information bit is mapped to the position of the frozen bit with the highest reliability in the second CB, and the position of the frozen bit with the lowest reliability in the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB. n The value and m The values ​​may be the same ( n = m ) or different. The first CB uses ( N , K+n The second CB is encoded using polar codes. N , K+m Encode using polar codes.

[0157] like Figure 14 For the decoding end, if n = m Therefore, the decoding order can be chosen arbitrarily. First, the first CB is decoded. If the first CB is decoded correctly, then... m Additional bits are used to decode the second CB. In one embodiment, m The extra bits are mOne information bit. If the first CB is incorrectly decoded, then it is considered to be from the first CB. m The extra bits are unknown; decode the second CB. If the second CB is successfully decoded, use the bits from the second CB. n Each bit is used to re-decode the first CB that initially had a decoding error. In one embodiment, the bits from the second CB... n bits are n One information bit. Otherwise, both CBs are marked as incorrect decoding.

[0158] Based on the above description, when the channel used to transmit the first CB and the channel used to transmit the second CB are AWGN channels, the determination is made according to equations (1) to (3). m The value of is determined according to equations (4) to (6) when the channels used to transmit the first CB and the channel used to transmit the second CB are fading channels. m The value of . In one embodiment, in n ≠ m In the case of determining n The method of determining the value can be related to... m The method for calculating the value is the same.

[0159] In some embodiments, solve m The optimal value, i.e. m =arg min m ( p 1+ p 2), it is necessary to calculate ( p 1+ p 2) The independent variable when the minimum value is taken. m The value may be a real number and needs to be rounded. The following rounding methods can be used.

[0160] In one embodiment, rounding is performed to the nearest smaller integer. If m If the integer is 2.3, 2.5, or 2.8, then round it to the nearest smallest integer. m =2.

[0161] In one embodiment, rounding is performed to the nearest larger integer. If m If the integer is 2.3, 2.5, or 2.8, then round it to the nearest smallest integer. m =3.

[0162] In one embodiment, rounding is performed to the nearest integer. If m =2.3, then m =2, if m =2.8, then m =3. If m =2.5, then m Rounded to 2.

[0163] In some embodiments, when the number of transmitting antennas is greater than 2 (i.e. N t When >2), the antenna can be divided into two groups, and the code blocks in one group can share their bits with the code blocks in the other group through the above technical solution.

[0164] Figure 15 This is a schematic block diagram of an encoding device 1500 according to an embodiment of this application. The device 1500 can be installed in an encoder.

[0165] like Figure 15 The device 1500 includes: an encoding unit 1510 for acquiring a first CB and a second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, the first CB including... m One information bit, m One information bit is mapped to the second CB; the transmitting unit 1520 is used to transmit the first CB and the second CB.

[0166] In one embodiment, the encoding unit 1510 is specifically configured to: determine based on a first threshold associated with a first noise variance and a second threshold associated with a second noise variance. m The values ​​are given, where the first and second bounds represent the upper and lower limits of the transmitted WER, respectively. Both the first and second bounds are determined by any of the following approximation algorithms, including Gaussian approximation, normal approximation, and the elementary inverse bound. The first noise variance is the noise variance of the channel used to transmit the first CB, and the second noise variance is the noise variance of the channel used to transmit the second CB. Based on... m The calculated value is determined m One information bit; mapping m One information bit is sent to the second CB.

[0167] In one embodiment, the channel for transmitting the first CB and the channel for transmitting the second CB are AWGN channels, and the coding unit 1510 is specifically used to determine according to the aforementioned equations (1) to (3). m The value of .

[0168] In one embodiment, the channel for transmitting the first CB and the channel for transmitting the second CB are fading channels, and the coding unit 1510 is specifically used to determine according to the aforementioned equations (4) to (7). m The value of .

[0169] In one embodiment, when the encoding scheme is polar coding... m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB; in the case of LDPC encoding. m The first CB has one information bit. m Each random information bit is mapped to a random position in the second block; or, in the case of a cross-block coding scheme based on polar coding, m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB, which includes... n One information bit, n The reliability of the second CB is the lowest among the information bits. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB.

[0170] Figure 16 This is a schematic block diagram of another decoding device 1600 according to an embodiment of this application. Device 1600 can be installed in a decoder.

[0171] like Figure 16 The device 1600 includes: a receiving unit 1610 for receiving a first CB and a second CB, wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, respectively, and the signal from the first CB... m Each information bit is mapped to the second CB, and the bits from the second CB... n Each information bit is mapped to the first CB; the decoding unit 1620 is used to decode according to the first CB. m One information bit and the second CB n Each information bit is used to decode the first CB and the second CB.

[0172] In one embodiment, when the encoding scheme is polar coding... m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the most reliable frozen bit position in the second CB; in the case of LDPC encoding. m The first CB has one information bit. mEach bit of random information is mapped to a random position in the second CB. n The value is 0; or in the case of a cross-block coding scheme based on polar coding, m The reliability of the first CB is the lowest among the information bits. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The reliability of the second CB is the lowest among the information bits. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB; m and n The values ​​may be equal ( m = n (or different) m The value and n The value may be greater than or equal to 0.

[0173] In one embodiment, the encoding unit 1510 is specifically used to decode the first CB; if the first CB is correctly decoded, then... m The first CB is decoded using one information bit; if the first CB is decoded incorrectly, it is not used. m Decode the second CB using one information bit; if the second CB is correctly decoded, use... n The first CB is re-decoded using one information bit; if both the first CB and the second CB are incorrectly decoded, then both the first CB and the second CB are marked as incorrectly decoded.

[0174] This application also provides a computer program product. The computer program product includes computer program code. When the computer program code is run on a computer, it causes the computer to perform the steps in the above-described method.

[0175] Optionally, all or part of the computer program code may be stored in the first storage medium. The first storage medium may be packaged together with the processor or packaged separately from the processor.

[0176] This application also provides a chip system, which includes an input / output interface, at least one processor, at least one memory, and a bus. The at least one memory is used to store instructions, and the at least one processor is used to invoke the instructions from the at least one memory to perform the operations in the methods described above.

[0177] In the embodiments of this application, "at least one" refers to one or more, and "multiple" refers to two or more. The term "and / or" describes the association relationship between associated objects, indicating that there may be three possible relationships. For example, A and / or B can represent the following three cases: A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between associated objects. "At least one of the following" and similar expressions refer to any combination of these items, including any combination of one or more items. For example, at least one of a, b, and c can represent: a, b, c, "a and b", "a and c", "b and c", or "a, b, and c", where a, b, and c can be singular or plural.

[0178] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium. When the program runs, it executes the processes of the methods in the above embodiments. The storage medium may include: a magnetic disk, an optical disk, a read-only memory (ROM), or a random-access memory (RAM).

[0179] In the several embodiments provided in this application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the described device embodiments are merely examples. For example, unit division is only a logical functional division, and other division methods may be used in actual implementation. For example, multiple units or components may be merged or integrated into another system, or some features may be ignored or not performed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be implemented through some interfaces. Indirect coupling or communication connection between devices or units can be implemented electronically, mechanically, or in other ways.

[0180] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; they may be located in one place or distributed across multiple network units. Some or all of the units can be selected according to actual requirements to achieve the purpose of the embodiment.

[0181] Furthermore, the functional units in the embodiments of this application can be integrated into one processing unit, or each unit can exist physically independently, or two or more units can be integrated into one unit.

[0182] The above description is merely a specific implementation of this application and is not intended to limit the scope of protection of this application. Any variations or substitutions that are readily conceived by those skilled in the art within the scope of the technology disclosed in this application are within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. An encoding method, characterized in that, Applications include multiple-input multiple-output (MIMO) transmission systems, including: Obtain a first code block (CB) and a second code block (CB), wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, wherein the first CB includes... m Information bits, the m One information bit is mapped to the second CB; Send the first CB and the second CB.

2. The method according to claim 1, characterized in that, The acquisition of the first CB and the second CB includes: Determined based on a first threshold associated with the first noise variance and a second threshold associated with the second noise variance. m The values ​​are: where the first threshold and the second threshold represent the upper and lower limits of the transmission error rate (WER), respectively; the first threshold and the second threshold are determined by any approximation algorithm including Gaussian approximation (GS), normal approximation (NA), and primitive inverse bound; the first noise variance is the noise variance of the channel used to transmit the first CB; and the second noise variance is the noise variance of the channel used to transmit the second CB. based on m The value determines the m One information bit; The m Each information bit is mapped to the second CB.

3. The method according to claim 2, characterized in that, The channel used to transmit the first CB and the channel used to transmit the second CB are additive white Gaussian noise (AWGN) channels, and the determination is based on the first threshold associated with the first noise variance and the second threshold associated with the second noise variance. m The values ​​include: Determined according to the following equation m Value: p 1=On( N , K , σ 1)(1–On( N , K+m, σ 2))On( N , K–m, σ 1)(1) p 2=On( N , K , σ 1)On( N , K + m , σ 2)(2) m =angry me m ( p 1+ p 2)(3) Among them, Pe( N , K , σ 1) indicates that the variance of the first noise is σ At time 1, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+m, σ 2) indicates that the variance of the second noise is σ At time 2, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K–m, σ 1) indicates that the variance of the first noise is σ At time 1, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 represents the probability that the first CB is incorrectly re-decoded given that the second CB is correctly decoded; p 2 represents the probability that both CBs are incorrectly decoded; m express m The value of .

4. The method according to claim 2, characterized in that, The channel used to transmit the first CB and the channel used to transmit the second CB are fading channels, and the determination is based on the first threshold associated with the first noise variance and the second threshold associated with the second noise variance. m The values ​​include: Determined according to the following equation m Value: W=(H H H) –1 H H (4) p 1=On( N , K , σ 1 )(1–On( N , K+m, σ 2 ))On( N , K–m, σ 1 )(5) p 2=On( N , K , σ 1 )On( N , K + m , σ 2 )(6) m =angry me m ( p 1+ p 2)(7) Where W represents the zero-forcing decision based on the channel matrix H of the channel; Pe( N , K , σ 1 ) indicates that the first noise variance is updated to σ 1 When, the length is N And including K The probability that the first CB of a given information bit is incorrectly decoded; Pe( N , K+ m, σ 2 ) indicates that the second noise variance is updated to σ 2 When, the length is N And including ( K+m The probability that the second CB of ) information bits is incorrectly decoded; Pe( N , K–m, σ 1 ) indicates that the first noise variance is updated to σ 1 When, the length is N And including ( K–m The probability that the first CB of ) information bits is incorrectly decoded; p 1 represents the probability that the first CB is incorrectly re-decoded given that the second CB is correctly decoded; p 2 represents the probability that both CBs are incorrectly decoded; m express m The value, σ 1 or σ 2 Determined based on the following relationship: σ i =σ i ( ∑(w i 2 )) 1 / 2 , where w i Indicates the first W i OK, σ 1 represents the first noise variance. σ 2 represents the second noise variance.

5. The method according to any one of claims 1 to 4, characterized in that, The encoding scheme is polar coding. m The information bits represent the lowest reliability of the first CB. m One information bit and mapped to the most reliable frozen bit position of the second CB; or The encoding scheme is low-density parity-check (LDPC) encoding. m The information bits are the first CB m Each random information bit is mapped to a random position in the second CB.

6. The method according to any one of claims 1 to 4, characterized in that, The encoding scheme is a cross-block encoding based on polar coding, and the first CB is located in the position with the lowest reliability. m Each information bit is mapped to the position of the frozen bit with the highest reliability of the second CB, while the second CB is in the position with the lowest reliability. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB.

7. A decoding method, characterized in that, Applications include multiple-input multiple-output (MIMO) transmission systems, including: Receive a first code block (CB) and a second code block (CB), wherein the first CB and the second CB are encoded using the same scheme, and the first CB and the second CB correspond to different MIMO antennas, respectively. m One information bit is mapped to the second CB, and the second CB n One information bit is mapped to the first CB; Accordingly, according to the first CB m The information bits and the second CB n Each information bit is used to decode the first CB and the second CB.

8. The method according to claim 7, characterized in that, The encoding scheme is polar coding. m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB; or the encoding scheme is low-density parity-check (LDPC) encoding. m The information bits are the first CB m Each random information bit is mapped to a random position in the second CB.

9. The method according to claim 7, characterized in that, The encoding scheme is a cross-block encoding based on polar coding. m The information bits represent the lowest reliability of the first CB. m Each information bit is mapped to the position of the most reliable frozen bit in the second CB. n The information bits represent the lowest reliability of the second CB. n Each information bit is mapped to the position of the most reliable frozen bit in the first CB; n The value and m The values ​​can be the same ( n = m (or different) 10. The method according to any one of claims 7 to 9, characterized in that, The statement according to the first CB m The information bits and the second CB n Decoding the first CB and the second CB using one information bit includes: Decode the first CB; If the first CB is correctly decoded, then it is considered that the m Knowing that one information bit is known, decode the second CB; If the first CB is incorrectly decoded, then it is considered that the m One information bit is unknown; the second CB is then decoded. If the second CB is correctly decoded, then it is considered that... n Knowing that one information bit is known, the first CB is re-decoded; If both the first CB and the second CB are incorrectly decoded, then mark that both the first CB and the second CB are incorrectly decoded.

11. An encoder, characterized in that, The device includes a processor and a memory, wherein the processor is connected to the memory; the memory is used to store instructions, and the processor is used to execute the instructions; when the processor executes the instructions stored in the memory, the processor performs the method according to any one of claims 1 to 6.

12. A decoder, characterized in that, The system includes a processor and a memory, wherein the processor is connected to the memory; the memory is used to store instructions, and the processor is used to execute the instructions; when the processor executes the instructions stored in the memory, the processor performs the method according to any one of claims 7 to 10.

Images