Time-domain interleaving method, time-domain de-interleaving method, time-domain interleaver, and time-domain de-interleaver

Abstract

The present application discloses a time-domain interleaving method, a time-domain de-interleaving method, a time-domain interleaver, and a time-domain de-interleaver. The time-domain interleaving method comprises: extending a transport block by using n, and performing code block segmentation and encoding on the extended transport blocks to obtain k encoded code blocks, or performing code block segmentation and encoding on n transport blocks to obtain k encoded code blocks, where n is the number of redundancy versions used for interleaving, and both n and k are integers greater than or equal to 1; performing block interleaving processing in a rate matching operation on the k encoded code blocks, and writing the k code blocks subjected to the block interleaving processing into a circular buffer; on the basis of the number of physical resources of a subframe, the size of a transport block, and the number of redundancy versions, determining bit positions corresponding to the redundancy versions in the circular buffer; and with n subframes as a period, selecting a redundancy version for k code blocks in each subframe according to a predetermined selection method, and performing baseband processing and transmission on bits contained in the redundancy version.

Description

Temporal interleaving method, temporal deinterleaving method, temporal interleaver, and temporal deinterleaver

[0001] This application claims priority to Chinese Patent Application No. 202510137495.0, filed on February 7, 2025, the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and to time-domain interleaving methods, such as time-domain interleaving methods, time-domain deinterleaving methods, time-domain interleavers, and time-domain deinterleavers. Background Technology

[0003] With the rapid development of mobile communication technology, broadcasting technology is increasingly widely used in fifth-generation mobile communication technology (5G) and future communication networks, especially in multimedia broadcast / multicast services (MBMS) that support a large number of users. Broadcast and multicast communication can efficiently transmit the same data content to multiple terminal users, greatly saving spectrum resources. However, the complexity of the wireless propagation environment means that broadcast signals face challenges such as signal attenuation, interference, and multipath effects under high-speed mobile conditions, making it difficult to guarantee signal reception quality. In high-speed mobile scenarios, signal quality fluctuations are even more pronounced, leading to an increase in the bit error rate (BLER) and seriously affecting user experience.

[0004] To improve the performance of broadcast systems in high-speed mobile environments and enhance signal robustness, physical layer time interleaving technology has emerged and been widely applied. Time interleaving rearranges data according to the time dimension during data transmission, enabling the receiver to receive the signal at multiple different points in time, thus achieving time diversity gain. In high-speed mobile scenarios, this technology can significantly reduce the adverse effects of multipath effects and rapid fading, thereby greatly improving the reliability of signal transmission.

[0005] However, time interleaving methods typically require a significant increase in the memory requirements of the receiver's Log Likelihood Ratio (LLR) buffer when achieving time diversity. This can place a heavy burden on some receiving devices, especially low-power terminals or resource-constrained devices. To address this, existing solutions propose using a packet transmission algorithm based on Hybrid Automatic Repeat reQuest (HARQ) at the transceiver end and utilizing unused HARQ memory in the MBMS to achieve time interleaving, thereby avoiding additional resource consumption. The physical resource mapping is shown in Figure 1. However, these solutions still face problems such as insufficient time interleaving depth and concentrated distribution of information bits after interleaving. This leads to the loss or error of a large number of information bits in scenarios with continuous deep fading, thus affecting the overall performance and stability of the system.

[0006] Therefore, how to further improve the temporal interleaving effect without increasing the burden on resources remains a key issue that current technology urgently needs to address. Summary of the Invention

[0007] This application provides a time-domain interleaving method, a time-domain deinterleaving method, a time-domain interleaver, and a time-domain deinterleaaver.

[0008] This application provides an interleaving method, comprising: expanding a transport block using n, dividing and encoding the expanded transport block to obtain k encoded code blocks, or dividing and encoding n transport blocks to obtain k encoded code blocks; wherein n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1; performing block interleaving processing in rate matching operation on the k encoded code blocks, and writing the k code blocks after block interleaving processing into a circular memory; determining the corresponding bit position of each redundancy version in the circular memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions; selecting redundancy versions of the k code blocks in each subframe according to a predetermined selection method with a period of n subframes, and performing baseband processing and transmission on the bits contained in the redundancy versions.

[0009] This application also provides a deinterleaving method, comprising: performing baseband demodulation on received symbols to obtain the log-likelihood ratio corresponding to the symbols; filling the log-likelihood ratio into the corresponding position in a circular memory according to a predetermined selection method, the number of physical resources of a subframe, the transport block size, and the number of redundant versions to obtain a code block; performing deblocking interleaving processing in the derate matching operation on the code block, and decoding the code block after the deblocking interleaving processing; and aggregating the decoded code blocks to form a transport block.

[0010] This application also provides a time-domain interleaver, comprising: a processing unit configured to expand a transport block using n, perform code block segmentation and encoding on the expanded transport block to obtain k encoded code blocks, or perform code block segmentation and encoding on n transport blocks to obtain k encoded code blocks; wherein n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1; performing block interleaving processing in rate matching operation on the k encoded code blocks, and writing the k code blocks after block interleaving processing into a circular memory; determining the corresponding bit position of each redundancy version in the circular memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions; selecting redundancy versions of the k code blocks in each subframe according to a predetermined selection method with a period of n subframes, and performing baseband processing on the bits contained in the redundancy versions to obtain baseband processed symbols; and a transmitting unit configured to transmit the baseband processed symbols.

[0011] This application provides a deinterleaving unit, comprising: a receiving unit configured to receive symbols transmitted through a channel; and a processing unit configured to perform baseband demodulation on the received symbols to obtain the log-likelihood ratio corresponding to the symbols, and fill the log-likelihood ratio into the corresponding position in a circular memory according to a predetermined selection method, the number of physical resources of a subframe, the transport block size, and the number of redundancy versions to obtain a code block; perform deblocking interleaving processing in the derate matching operation on the code block, and perform decoding processing on the code block after the deblocking interleaving processing; and perform code block aggregation on the decoded code block to form a transport block.

[0012] This application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-described interleaving or deinterleaving method. Attached Figure Description

[0013] Figure 1 is a schematic diagram of a physical resource mapping method related to the technology;

[0014] Figure 2 is a flowchart of an interleaving method provided in an embodiment of this application;

[0015] Figure 3 is a flowchart of a deinterleaving method provided in an embodiment of this application;

[0016] Figure 4 is a schematic diagram of an interleaver provided in an embodiment of this application;

[0017] Figure 5 is a schematic diagram of a deinterleaver provided in an embodiment of this application;

[0018] Figure 6 is a flowchart of an interleaving method provided in an embodiment of this application;

[0019] Figure 7 is a schematic diagram of physical resource mapping for an interleaving method provided in Embodiment 1 of this application;

[0020] Figure 8 is a schematic diagram of physical resource mapping for an interleaving method provided in Embodiment 2 of this application;

[0021] Figure 9 is a schematic diagram of physical resource mapping for an interleaving method provided in Embodiment 3 of this application;

[0022] Figure 10 is a schematic diagram of the structure of a network device provided in an embodiment of this application;

[0023] Figure 11 is a schematic diagram of the structure of a user equipment provided in an embodiment of this application. Detailed Implementation

[0024] Before discussing exemplary embodiments, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe multiple steps as sequential processes, many of these steps can be performed in parallel, concurrently, or simultaneously. Furthermore, the order of the multiple steps can be rearranged. The process can be terminated when its operation is complete, but it may also have additional steps not included in the figures. The process may correspond to a method, function, procedure, subroutine, subroutine, etc.

[0025] Furthermore, the embodiments and features described in this application may be combined with each other, unless otherwise specified.

[0026] The concepts of "first" and "second" mentioned in the embodiments of this application are only used to distinguish different devices, modules, units or other objects, and are not used to limit the order or interdependence of the functions performed by these devices, modules, units or other objects.

[0027] Interleaving methods in related technologies are based on continuous redundancy version mapping schemes. Typically, each code block corresponds to multiple redundancy versions (RVs). The first two RVs, such as RV0 and RV1, may contain a large number of information bits. If physical resource mapping is performed as described above, the information bits from RV0 and RV1 of multiple code blocks will be concentrated in two specific subframes (as shown in the first two subframes of Figure 1). Consequently, under specific time-selective fading channels, when the channel quality of these two specific subframes suddenly deteriorates (e.g., deep fading, strong interference), the information bits distributed in these two subframes will be lost, thus affecting the interleaving effect.

[0028] This application proposes a cross-transport block (TB) time-domain interleaving method that reuses HARQ cyclic memory. The core of this method lies in simultaneously performing channel coding on multiple TBs of data and then truncating the encoded bit sequences at specific start positions and lengths to generate data segments, or RVs, with different combinations of information bits and parity bits. Different redundant versions are transmitted within each subframe time, thus achieving the effect of time-domain interleaving.

[0029] The time-domain interleaving scheme proposed in this application includes two redundancy version generation and selection techniques.

[0030] The first redundancy version generation and selection technique of this application involves: firstly, generating consecutive redundancy versions for each code block; then, within each subframe, obtaining specific redundancy version numbers for different code blocks using cyclic increment / decrement or according to a given sequence number group; reading the bits corresponding to the redundancy version; and performing subsequent baseband processing and transmission. This technique is more simplified and, compared with the time interleaving technique using the HARQ multiplexing mechanism, effectively avoids the problem of excessive concentration of information bits after interleaving, which makes it difficult to resist sudden concentrated errors. It effectively optimizes the data stream interleaving process and ensures the efficiency and reliability of data transmission.

[0031] The second redundancy version generation and selection technique of this application generates redundancy versions by reading bits from the circular buffer at equal intervals, thereby achieving a uniform distribution of information bits and parity bits for each code block across the redundancy versions. When the redundancy versions are transmitted in different subframes, time interleaving can be achieved. Compared with the time interleaving technique using the HARQ multiplexing mechanism, this method effectively avoids the problem of excessive concentration of information bits after interleaving, which makes it difficult to resist sudden concentrated errors. It effectively optimizes the interleaving process of the data stream and ensures the efficiency and reliability of data transmission.

[0032] The time-domain interleaving scheme provided in this application can effectively solve the problem of concentrated information bit distribution in the time-domain interleaving method of HARQ storage, improve the anti-interference capability of the system, reduce the bit error rate caused by channel fading, and ultimately improve the transmission quality and performance of the entire communication system.

[0033] Regarding the first redundancy version generation and selection technical solution of this application, as shown in Figure 2, this application embodiment provides a time-domain interleaving method including: expanding a transport block using n, dividing and encoding the expanded transport block to obtain k encoded code blocks, or dividing and encoding n transport blocks to obtain k encoded code blocks; where n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1; performing block interleaving processing in rate matching operation on the k encoded code blocks, and writing the k code blocks after block interleaving processing into a circular memory; determining the corresponding bit position of the redundancy version of each encoded code block in the circular memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions; selecting a redundancy version for the k code blocks in each subframe according to a predetermined selection method with n subframes as the period, and performing subsequent baseband processing and transmission on the bits contained in the redundancy version.

[0034] The methods for selecting redundant versions with different version numbers according to the predetermined selection method include cyclic increment selection, cyclic decrement selection, or selection according to a given sequence group.

[0035] In one embodiment, the bit positions corresponding to each redundant version in the circular memory are distributed in a continuous circular pattern.

[0036] In one embodiment, the sum of the number of bits in the n redundant versions corresponding to each code block is greater than, equal to, or less than the number of bits in the circular memory.

[0037] In one embodiment, the predetermined selection method is to cyclically and incrementally select redundant versions of k code blocks.

[0038] The increment here can be 1, 2, 3, or any non-negative integer less than n.

[0039] In one embodiment, the predetermined selection method is to cyclically and incrementally select redundant versions of k code blocks.

[0040] The amount of decrease here can be 1, 2, 3, or any non-negative integer less than n.

[0041] In one embodiment, the predetermined selection method is to select redundant versions of k code blocks according to a given sequence number group.

[0042] In one embodiment, in a transmission period consisting of n subframes, the n subframes are equally spaced; transmitting the bits contained in the redundant version includes: in a transmission period consisting of n subframes, completing the transmission of the bits corresponding to the n redundant versions in each of the k code blocks.

[0043] Regarding the first redundancy version generation and selection technical solution of this application, as shown in Figure 3, this application also provides a time-domain deinterleaving method, including: performing baseband demodulation on the received symbols to obtain the log-likelihood ratio corresponding to the symbols; filling the log-likelihood ratio into the corresponding position in the circular memory according to a predetermined selection method, the number of physical resources of the subframe, the transport block size, and the number of redundancy versions to obtain a code block; performing deblocking interleaving processing in the derate matching operation on the code block, and decoding the code block after deblocking interleaving processing; and aggregating the decoded code blocks to form a transport block.

[0044] Regarding the first redundant version generation and selection technology solution of this application, as shown in Figure 4, this application also provides a time-domain interleaver, including:

[0045] The processing unit 100 is configured to expand a transport block using n blocks, perform code block segmentation and encoding on the expanded transport block to obtain k encoded code blocks, or perform code block segmentation and encoding on n transport blocks to obtain k encoded code blocks; where n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1; perform block interleaving processing in the rate matching operation on the k encoded code blocks, and write the k code blocks after block interleaving processing into a circular memory; determine the corresponding bit position of each redundancy version in the circular memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions; select a redundancy version for the k code blocks in each subframe according to a predetermined selection method, with a period of n subframes, and perform subsequent baseband processing on the bits contained in the redundancy version.

[0046] The transmitting unit 200 is configured to transmit data symbols processed by the baseband.

[0047] Regarding the first redundant version generation and selection technology solution of this application, as shown in Figure 5, this application also provides a time-domain deinterleaving device, including:

[0048] The receiving unit 300 is configured to receive symbols transmitted through the channel.

[0049] The processing unit 400 is configured to perform baseband demodulation on the received symbols to obtain the log-likelihood ratio corresponding to the symbols, and fill the log-likelihood ratio into the corresponding position in the circular memory according to a predetermined selection method, the number of physical resources of the subframe, the transport block size, and the number of redundant versions to obtain a code block; perform deblocking interleaving processing in the derate matching operation on the code block, and perform decoding processing on the code block after deblocking interleaving; and perform code block aggregation on the decoded code block to form a transport block.

[0050] Both of these redundancy version generation and selection techniques can include the following steps: encoding the code block to obtain the encoded code block; performing block interleaving in the rate matching operation on the encoded code block; writing the block-interleaved code block into a circular memory; generating multiple redundancy versions for each code block according to specific rules and reading the bit sequence; performing constellation mapping to map the bit sequence into complex symbols; converting the modulation symbols into a time-domain signal and adding a cyclic prefix; and transmitting the time-domain signal with the added cyclic prefix.

[0051] In one embodiment, before encoding the code block, the method includes: expanding the transport block according to the number of redundant versions, segmenting the code block, and encoding it to obtain a code block; or segmenting and encoding several redundant version transport blocks to obtain a code block.

[0052] In one embodiment, the complete process of performing rate matching on the encoded code block includes: performing block interleaving processing within the rate matching process on the code block; writing the code block into a circular memory; determining the corresponding bit position of the redundant version of the encoded code block in the circular memory according to the number of physical resources of the subframe, the transport block size, and the number of redundant versions; and selecting the redundant version of the code block in each subframe according to a predetermined selection method, with at least one subframe as the period.

[0053] In one embodiment, the bit positions corresponding to each redundant version of each code block in the circular memory are determined based on the number of physical resources, the size of the transport block, and the number of redundant versions of the subframe. Then, the redundant version numbers of each code block to be transmitted in this subframe are selected sequentially by cyclic increment / decrement or according to a given sequence number group. The corresponding bits are read for subsequent baseband processing such as physical resource mapping and transmission.

[0054] The interleaving method provided in this application, as shown in Figure 6, actually includes seven steps: Transport Block Size (TBS) expansion, code block segmentation, channel coding, block interleaving processing and writing to the circular memory in rate matching operations, redundancy version generation and physical resource mapping in rate matching operations, constellation mapping, symbol generation and transmission, thus forming a complete cross-transport block time interleaving technology solution. Each step is described here:

[0055] 1. Transfer block size extension

[0056] To ensure consistent throughput with non-interleaved transmission, the transport block size is appropriately expanded based on a preset number of redundant versions. Based on system configuration and channel conditions, the transport block size before expansion is... The expanded transport block size can then be expressed as:

[0057]

[0058] in, Operation means selection The nearest valid transport block size for the 5G broadcast standard, where n is the preset number of redundant versions.

[0059] 2. Code block segmentation

[0060] The expanded transport block will be divided into multiple code blocks to accommodate the input requirements of the channel encoder. According to the interleaving algorithm specified by the 3rd Generation Partnership Project (3GPP) group, the two interleaving parameters... and This corresponds to a fixed coded block length. Therefore, the input length of the channel encoder must be two valid lengths (minimum 40 bits, maximum 6144 bits). The segment lengths are defined as follows: and The number of segments, respectively and The code block segmentation rule is as follows:

[0061]

[0062] in, This represents the number of code blocks. Padding bits may be used as needed.

[0063] Alternatively, the "Transport Block Size Extension" and "Code Block Segmentation" modules can be replaced with: The original n transport blocks... The code blocks are segmented separately, and the segmented code blocks are then uniformly entered into the "channel coding" module.

[0064] 3. Channel coding

[0065] Each code block is channel-coded, adding redundant bits to improve anti-interference capability. Any channel coding scheme can be selected (such as Turbo coding, Low-Density Parity-Check (LDPC) coding, etc.). The encoded code block contains information bits and check bits, and the channel coding rate is:

[0066]

[0067] T is the information bit length, and N is the total bit length after encoding.

[0068] 4. Block interleaving and writing to circular memory in rate matching operations

[0069] The encoded code block needs to undergo rate matching, which adjusts the length of the encoded bit sequence to accommodate physical resource constraints. The information bits and parity bits output by the encoder undergo block interleaving within the rate matching process before being written to the circular memory.

[0070] 5. Redundancy version generation and physical resource mapping in rate matching operations, including two redundancy version generation and selection techniques.

[0071] Based on the number of physical resources in the subframe, the transport block size, and the number of redundant versions, the bit positions of each redundant version in the circular memory are determined. This application proposes two methods for generating the bit positions of the redundant versions, namely, two technical solutions for determining the start pointer, pointer increment, and length of each redundant version:

[0072] First approach: Inter-block cyclic redundancy versioning method.

[0073] This method achieves physical resource mapping by cyclically incrementing / decrementing, or by reading the redundancy version number of each code block according to a given sequence group. The increment / decrement can be any non-negative integer less than the redundancy version number of each code block. The steps are as follows:

[0074] First, each code block generates its redundant version using the concept of "continuous redundancy version". That is, the starting pointer of the current redundant version of each code block is defined as the position after the ending pointer of the previous redundant version, and the pointer increment is fixed at 1. At this time, the calculation method for the length of each redundant version of each code block is as follows: (1) If the aforementioned steps involve expanding the transmission block with the number of redundant versions n, and then performing code block segmentation and encoding on the expanded transmission block, then the length of the redundant version of each code block is (2) If the aforementioned steps involve segmenting and encoding code blocks using n redundant versions of the transport blocks, then the length of the redundant version of each code block is... or Where k represents the total number of code blocks, and the remaining variables and related calculation rules are consistent with TS 36.212.

[0075] Subsequently, the redundancy version number of each code block is selected sequentially and physical resource mapping is performed, either by cyclic increment / decrement or by selection according to a given sequence group. Here, we take cyclic increment with an increment of 1 as an example. Let the redundancy version number selected for the k-th code block in the current subframe be... Its corresponding redundant version is Then the redundant version number selected for the (k+1)th code block is:

[0076]

[0077] in, The operator represents the modulo operation. Therefore, the redundant version selected for the (k+1)th code block corresponds to... .

[0078] In the next subframe, the redundancy version number selected for the k-th code block is... The calculation method for the redundant version number of the remaining code blocks is the same.

[0079] This method uses redundant versions as the basic time interleaving unit, cyclically incrementing / decrementing within each subframe, or selecting the redundant version number of each code block according to a given sequence number group. This process is repeated across different subframes. In this way, information bits are effectively distributed across multiple subframes, while reducing the probability of information bits from different code blocks appearing in the same subframe, thereby optimizing the robustness and reliability of the transmission.

[0080] The second approach: Comb-based method for generating redundant versions.

[0081] This method takes the following steps when generating n redundant versions of each code block:

[0082] The starting pointer position of each redundancy version is set to the position following the starting pointer position of the previous redundancy version; the pointer increment of each redundancy version is equal and constant, usually not 1. To achieve an approximately uniform distribution of information bits and parity bits in each redundancy version, the value of this increment can be set to the reciprocal of the channel coding rate, i.e.:

[0083]

[0084] in, This is the channel coding rate.

[0085] All redundant versions of each code block are of equal length and approximately equal to the total number of bits that can be transmitted after rate matching of that code block. At this point, the n redundant versions obtained from the k-th code block can be represented by variables as follows: .

[0086] The redundant versions generated based on the above steps exhibit a "comb-like" staggered distribution in terms of bit distribution. That is, the bit positions of each redundant version are appropriately offset compared to the previous version, thus forming a comb-like structure overall. This staggered distribution makes the information bits and check bits more evenly distributed among multiple redundant versions, which helps to improve the time interleaving effect.

[0087] Subsequently, the i-th redundant version generated by each code block is sequentially mapped onto the physical resources of the i-th subframe.

[0088] 6. Zodiac Sign Mapping

[0089] Modulation schemes such as Quadrature Phase Shift Keying (QPSK), 16-Quadrature Amplitude Modulation (16QAM), or 64-Quadrature Amplitude Modulation (64QAM) are used to map bit sequences to complex symbols. The mapping rules can be dynamically adjusted according to system configuration and channel conditions.

[0090] 7. Symbol Generation and Transmission

[0091] An appropriate modulation method is used to convert the modulation symbols into a time-domain signal and add a cyclic prefix. The transmit power and antenna configuration are dynamically adjusted based on channel state information, and the signal is transmitted using the transmit antenna.

[0092] After the symbol is sent, the reverse process of the receiving end and the sending end stores the log-likelihood ratio corresponding to each redundant version, and decodes it after all redundant versions have been received.

[0093] In summary, this application, through its designed cross-transmitter block time-domain interleaving method, not only ensures the stability of transmission throughput but also achieves an approximately uniform temporal distribution of information bits and parity bits, effectively combating continuous time-selective fading and providing an effective solution for improving the reliability and efficiency of wireless broadcast transmission.

[0094] The time-domain interleaving technique for reusing HARQ cyclic storage proposed in this application can be implemented through the following data processing method.

[0095] First, to ensure consistent throughput with non-interleaved transmissions, the transport block size (TBS) is appropriately expanded based on a preset number of redundancy versions (n). Assuming each code block has n redundancy versions, the expanded transport block size is:

[0096]

[0097] in, This indicates the size of the nearest valid transport block according to the 5G broadcast standard. The expanded transport block is then divided into K code blocks. Alternatively, it can be the size of the original n TB transport block. The code blocks are divided into K blocks in total.

[0098] Subsequently, channel coding is performed on the K code blocks to obtain the information bits and parity bits for each code block. Then, block interleaving is performed on each code block in the rate matching operation, and the data is written to a circular buffer. Next, this application uses a predetermined selection method to generate and select redundant versions of each code block as the transmission data for the current subframe, ensuring that the information bits are distributed as evenly as possible in the time domain. Then, the data is sequentially sent to the transmit antenna after physical mapping, constellation mapping, and Orthogonal Frequency Division Multiplexing (OFDM) symbol generation and transmission. The receiver stores the log-likelihood ratio (LLR) of each redundant version through the reverse process of the transmitter, and decodes it after all redundant versions have been received, avoiding the need to increase the LLR buffer memory. The above time-domain interleaving process is illustrated in Figure 6.

[0099] This application primarily focuses on how to generate and select redundant versions of each code block in a transmission environment with continuous deep fading, thereby ensuring that the information bits and parity bits of each code block are distributed as evenly as possible in the time domain, while reducing the probability of information bits of each code block appearing in the same subframe. To this end, this application proposes a continuous cyclic redundancy version method between code blocks (i.e., the first scheme) and a comb-based redundant version generation method (i.e., the second scheme). The implementation methods can be categorized as follows.

[0100] Example 1:

[0101] Figure 7 illustrates an implementation of the continuous cyclic redundancy version method for code blocks. In this embodiment, each code block is sequentially processed through channel coding and block interleaving in rate matching operations before being written into a circular buffer. To reduce the implementation complexity of time-domain interleaving while ensuring an approximately uniform distribution of information bits and parity bits in the time domain, redundancy versions are used as the basic time-domain operation unit. This embodiment uses a cyclically increasing redundancy version number with an increment of 1 as an example. In practice, redundancy version numbers can be selected cyclically increasing / decreasing (and the change can be any non-negative integer less than the number of redundancy versions n), or according to a given sequence group.

[0102] Assuming each code block is generated A series of redundant versions, which are taken in this embodiment. As an example, let the k-th code block be... The starting pointer position (i.e., the bit label in the circular buffer) of each redundant version is: .in, Let the length of the redundant version be 1. Let be the total bit length after rate matching of the k-th code block. Requirements: It is to satisfy The largest integer. The pointer increment is set to 1, meaning that the bit sequence of each redundant version increments sequentially from the starting pointer position. At this point, the k-th code block generates 4 consecutive redundant versions, represented as follows: And K represents the total number of code blocks.

[0103] Next, physical resource mapping is performed by cyclically incrementing the redundancy version number of each code block within a subframe, and cyclically incrementing the redundancy version number between subframes of the same code block. The redundancy version selected in the first subframe is... The redundant version selected for the second subframe is , No. The redundant version selected for each subframe is:

[0104]

[0105] in, This represents the modulo operation. By analogy, the selection of redundant versions transmitted in each subframe and the mapping of physical resources can be achieved.

[0106] By using the above method, information bits can be effectively distributed across multiple subframes, while reducing the probability of information bits from different code blocks appearing in the same subframe, thereby optimizing the robustness and reliability of transmission.

[0107] Example 2:

[0108] Figure 8 illustrates another implementation of the inter-block continuous cyclic redundancy version method. In this embodiment, each code block is sequentially processed through channel coding and block interleaving in rate matching operations before being written into a circular buffer. To reduce the implementation complexity of time-domain interleaving while ensuring an approximately uniform distribution of information bits and parity bits in the time domain, redundancy versions are used as the basic time-domain operation unit. This embodiment uses the selection of redundancy version numbers from any given sequence number group as an example. In practice, redundancy version numbers can be selected cyclically increasing / decreasing (and the change can be any non-negative integer less than the number of redundancy versions n), or according to a given sequence number group.

[0109] Assuming each code block is generated A series of redundant versions, which are taken in this embodiment. As an example, let the k-th code block be... The starting pointer position (i.e., the bit label in the circular buffer) of each redundant version is: .in, Let the length of the redundant version be 1. Let be the total bit length after rate matching of the k-th code block. Requirements: It is to satisfy The largest integer. The pointer increment is set to 1, meaning that the bit sequence of each redundant version increments sequentially from the starting pointer position. At this point, the k-th code block generates 4 consecutive redundant versions, represented as follows: And K represents the total number of code blocks. This embodiment uses K = 4 as an example.

[0110] Next, redundant versions of each code block are selected according to an arbitrarily given sequence number group for physical resource mapping. The arbitrarily given sequence number group must satisfy the following conditions: it must contain redundant versions of all generated code blocks, and no redundant version must be selected repeatedly. This embodiment uses the following given sequence number group as an example: the redundant version selected in the first subframe is... The redundant version selected for the second subframe is The redundant version selected for the third subframe is The redundant version selected for the fourth subframe is Finally, the selection of redundant versions and the mapping of physical resources were completed.

[0111] Example 3:

[0112] Figure 9 illustrates an implementation of the comb-based redundant version generation method. In this embodiment, Turbo coding is used as the channel coding method, and the channel coding rate is [missing information]. The encoded code blocks undergo block interleaving in the rate matching operation and are sequentially written into the circular buffer according to the method described above. At this point, the information bits are concentrated in the first part of the buffer. The region, where the first and second parity bits are interleaved in the back. area.

[0113] Because transport block extension increases the generalized coding rate, "punching" may occur in each code block. To address this issue, this application first calculates the total bit length of each code block after "punching" based on the generalized coding rate. Then generated from the "punched" code block A redundant version (in this embodiment, 1) (For example). To ensure that information bits are evenly distributed across all redundant versions, this embodiment uses a combination of continuously incrementing the starting pointer position of the redundant version and reading at equal intervals to generate redundant versions, i.e., the "comb-shaped redundant version generation method". The steps are as follows:

[0114] Set the start pointer of the i-th redundant version of each code block to the address of bit number i in the circular buffer of that code block. The bit numbers in the circular buffer increase sequentially in a clockwise direction starting from the first information bit, and the first information bit is set to 0.

[0115] pointer increments for redundant versions Set to the reciprocal of the channel coding rate, that is:

[0116]

[0117] Then the i-th redundant version The bit sequence consists of the following label sequence:

[0118]

[0119] Where the value in [] represents the bit label read from the circular buffer, and M is the bit length of a single redundant version, which takes the value that satisfies The largest integer.

[0120] Subsequently, the redundant versions generated for each code block are... The redundant versions of each code block are sequentially mapped to the physical resources corresponding to the first subframe. The redundant versions of each code block are sequentially mapped to the physical resources corresponding to the second subframe. The data is then mapped sequentially to the physical resources corresponding to the third subframe, thereby enabling the generation and selection of redundant versions.

[0121] The above method ensures that the information bits and parity bits of each code block are evenly distributed at the bit level throughout the transmission process, thereby effectively improving the robustness of the system in complex transmission environments such as continuous deep fading.

[0122] As shown in Figure 10, this application embodiment also provides a network device, including a processor 101 and a memory 102. The memory 102 is configured to store a computer program. When the computer program is executed by the processor 101, the processor 101 implements the time-domain interleaving method as described above.

[0123] As shown in Figure 11, this application embodiment also provides a user equipment, including a processor 111 and a memory 112. The memory 112 is configured to store a computer program. When the computer program is executed by the processor 111, the processor 111 implements the above-described time-domain deinterleaving method.

[0124] This application also provides a computer-readable storage medium including a computer program, which, when executed by a processor, causes the processor to implement any one of the methods.

[0125] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any other combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. Available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media (e.g., solid-state drives (SSDs)).

[0126] Those skilled in the art will recognize that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

Claims

1. A time-domain interleaving method, comprising: The transport block is expanded using n, and the expanded transport block is segmented and encoded to obtain k encoded code blocks, or n transport blocks are segmented and encoded to obtain k encoded code blocks; where n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1. The k code blocks are subjected to block interleaving in the rate matching operation, and the k code blocks after the block interleaving are written into the circular memory; Based on the number of physical resources in the subframe, the transport block size, and the number of redundant versions, determine the corresponding bit positions of the redundant versions of each encoded code block in the circular memory; With a period of n subframes, in each subframe, a redundant version is selected from the k code blocks according to a predetermined selection method, and the bits contained in the redundant version are processed and transmitted in baseband.

2. The time-domain interleaving method according to claim 1, wherein, The bit positions corresponding to each redundant version in the circular memory are distributed in a continuous circular pattern.

3. The time-domain interleaving method according to claim 1, wherein, The sum of the number of bits in the n redundant versions corresponding to each code block is greater than, equal to, or less than the number of bits in the circular memory.

4. The time-domain interleaving method according to claim 1, wherein, The predetermined selection method includes: selecting only one redundant version for each code block, cyclically increasing / decreasing the selection of redundant versions of the k code blocks, or selecting redundant versions of the k code blocks according to a given sequence number group.

5. The time-domain interleaving method according to claim 1, wherein, In the transmission period consisting of the n subframes, the n subframes are distributed at equal intervals; Transmitting the bits contained in the redundant version includes: In the transmission period consisting of the n subframes, the transmission of the bits corresponding to the n redundant versions in each of the k code blocks is completed.

6. A time-domain deinterleaving method, comprising: The received symbols are demodulated using baseband to obtain the log-likelihood ratio corresponding to the symbols. According to a predetermined selection method, the number of physical resources of the subframe, the transport block size, and the number of redundant versions, the log-likelihood ratio is filled into the corresponding position in the circular memory to obtain the code block. The code block is subjected to deblocking interleaving in the rate matching operation, and the code block after the deblocking interleaving is then decoded. The decoded code blocks are then aggregated to form a transmission block.

7. A time-domain interleaver, comprising: The processing unit is configured as follows: The transport block is expanded using n, and the expanded transport block is segmented and encoded to obtain k encoded code blocks, or n transport blocks are segmented and encoded to obtain k encoded code blocks; where n is the number of redundancy versions used for interleaving, and n and k are both integers greater than or equal to 1. The k code blocks are subjected to block interleaving in the rate matching operation, and the k code blocks after the block interleaving are written into the circular memory; Based on the number of physical resources in the subframe, the transport block size, and the number of redundant versions, determine the corresponding bit positions of the redundant versions of each encoded code block in the circular memory; With n subframes as the period, in each subframe, redundant versions are selected from the k code blocks according to a predetermined selection method, and the bits contained in the redundant versions are subjected to baseband processing to obtain the baseband processed symbols. The transmitting unit is configured to transmit the symbols processed by the baseband.

8. A time-domain deinterleaver, comprising: The receiving unit is configured to receive multiple symbols transmitted through the channel. The processing unit is configured as follows: The received symbols are demodulated using baseband to obtain the log-likelihood ratio corresponding to the symbols. According to a predetermined selection method, the number of physical resources of the subframe, the transport block size, and the number of redundant versions, the log-likelihood ratio is filled into the corresponding position in the circular memory to obtain the code block. The code block is subjected to deblocking interleaving in the rate matching operation, and the code block after the deblocking interleaving is then decoded. The decoded code blocks are then aggregated to form a transmission block.

9. A computer-readable storage medium comprising a computer program that, when executed by a processor, causes the processor to perform the method as described in any one of claims 1-6.

Images