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

Abstract

The invention discloses a time domain interleaving method, a de-interleaving method, an interleaver and a de-interleaver, and the time domain interleaving method comprises the following steps: carrying out expansion, code block segmentation and coding on a transmission block by using a redundancy version number n used for interleaving to obtain k coded code blocks, or carrying out code block segmentation and coding on the transmission block with the redundancy version number n used for interleaving to obtain k coded code blocks; obtaining k coded code blocks; performing rate matching related operation on the k coded code blocks, and writing the k coded code blocks into a circulating memory; according to the number of physical resources of the subframe, the size of a transmission block and the number of redundancy versions, determining a bit position corresponding to each redundancy version in the cyclic memory; and taking n subframes as a period, selecting a redundancy version for k code blocks in each subframe according to a preset selection method, and carrying out subsequent baseband processing and transmission on bits contained in the redundancy version. According to the method provided by the invention, the problem of concentrated information bit distribution in the existing time interleaving method for multiplexing HARQ storage can be effectively solved, the anti-interference capability of the system is remarkably improved, the bit error rate caused by channel fading is reduced, and the transmission quality and performance of the whole communication system are improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technologies, and more particularly, to a time-domain interleaving method, a de-interleaving method, an interleaver, and a de-interleaver. Background Art

[0002] With the rapid development of mobile communication technologies, broadcast technologies are increasingly widely used in 5G and future communication networks, especially in Multimedia Broadcast Multicast Service (MBMS) that supports a large number of users. Broadcast and multicast communications can efficiently transmit the same data content to multiple end users, greatly saving spectrum resources. However, the complexity of the wireless propagation environment makes broadcast signals face challenges such as signal attenuation, interference, and multipath effects under high-speed mobile conditions, resulting in difficulty in ensuring signal reception quality. In high-speed mobile scenarios, the fluctuation of signal quality will be more obvious, which will further lead to an increase in the Block Error Rate (BLER), seriously affecting the user experience.

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

[0004] However, when implementing time diversity, existing time interleaving methods usually require a significant increase in the memory requirement of the Log Likelihood Ratio (LLR) cache at the receiving end. This may impose a heavy burden on some receiving devices, especially low-power terminals or devices with limited resources. For this reason, current solutions have proposed using a packet transmission algorithm based on the Hybrid Automatic Repeat reQuest (HARQ) mechanism at the transceiver and implementing time interleaving using the HARQ memory that is not yet used in MBMS to avoid additional resource occupation. Its physical resource mapping is as Figure 1 shown. However, these solutions still face problems such as insufficient time interleaving depth and concentrated distribution of information bits after interleaving, resulting in the loss or error of a large number of information bits in some scenarios with continuous deep fades, thereby affecting the overall performance and stability of the system.

[0005] Therefore, how to further improve the time-domain interleaving effect without adding too much resource burden is still a key problem that needs to be solved urgently in the current technology. Summary of the Invention

[0006] Aiming at the problem that the information bit distribution is too concentrated after time-domain interleaving in the prior art, the present application provides a time-domain interleaving method, a deinterleaving method, an interleaver, and a deinterleaver.

[0007] An embodiment of the present application provides an interleaving method, including the following steps:

[0008] Using the number of redundant versions n used for interleaving to expand the transport block, perform code block segmentation and coding to obtain k encoded code blocks, or perform code block segmentation and coding on n transport blocks using the number of redundant versions for interleaving to obtain k encoded code blocks;

[0009] Perform rate matching related operations on the k encoded code blocks and write them into the cyclic memory;

[0010] Determine the corresponding bit positions of each redundant version in the cyclic memory according to the physical resource number of the subframe, the transport block size, and the number of redundant versions;

[0011] Taking n subframes as a period, in each subframe, select redundant versions from the k code blocks according to a predetermined selection method, and perform subsequent baseband processing and transmission on the bits included in the redundant version.

[0012] An embodiment of the present application provides a deinterleaving method, including the following steps:

[0013] Perform baseband demodulation on the received symbols to obtain the corresponding log-likelihood ratio, and fill the log-likelihood ratio into the corresponding positions in the cyclic memory according to the predetermined redundant version selection method, the physical resource number of the subframe, the transport block size, and the number of redundant versions;

[0014] Perform de-rate matching related operations and decoding processing;

[0015] Aggregate the decoded code blocks into transport blocks.

[0016] An embodiment of the present application provides a time-domain interleaver, including:

[0017] A processing unit that uses the number of redundant versions n used for interleaving to expand the transport block, perform code block segmentation and coding to obtain k encoded code blocks, or perform code block segmentation and coding on n transport blocks using the number of redundant versions for interleaving to obtain k encoded code blocks;

[0018] Perform rate matching related operations on the k encoded code blocks and write them into the cyclic memory;

[0019] Determine the corresponding bit positions of each redundancy version in the cyclic memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions;

[0020] Taking n subframes as a period, in each subframe, select the redundancy version for k code blocks according to a predetermined selection method, and perform subsequent baseband processing on the bits included in the redundancy version to obtain the symbols after baseband processing.

[0021] The transmitting unit transmits the symbols after baseband processing.

[0022] An embodiment of the present application provides a deinterleaver, including:

[0023] The receiving unit receives the symbols after channel transmission;

[0024] The processing unit performs baseband demodulation on the received symbols to obtain the corresponding log-likelihood ratio, and fills the log-likelihood ratio into the corresponding positions in the cyclic memory according to the predetermined redundancy version selection method, the number of physical resources of the subframe, the transport block size, and the number of redundancy versions;

[0025] Perform rate matching related operations and decoding processing;

[0026] Aggregate the decoded code blocks into transport blocks.

[0027] An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned interleaving method or deinterleaving method is implemented.

[0028] A time-domain interleaving method, a deinterleaving method, an interleaver, and a deinterleaver provided by an embodiment of the present application expand the transport block by using the number of redundancy versions n used for interleaving, perform code block segmentation and coding to obtain k encoded code blocks, or perform code block segmentation and coding on n transport blocks using the number of redundancy versions n used for interleaving to obtain k encoded code blocks; perform rate matching related operations on the k encoded code blocks and write them into the cyclic memory; determine the corresponding bit positions of each redundancy version in the cyclic memory according to the number of physical resources of the subframe, the transport block size, and the number of redundancy versions; taking n subframes as a period, in each subframe, select the redundancy version for k code blocks according to a predetermined selection method, and perform subsequent baseband processing and transmission on the bits included in the redundancy version. The method proposed by the present invention can effectively solve the problem that the information bit distribution is too concentrated in the existing time-domain interleaving method for multiplexing HARQ storage, significantly improve the anti-interference ability of the system, reduce the bit error rate caused by channel fading, and improve the transmission quality and performance of the entire communication system. Description of the Drawings

[0029] With reference to the accompanying drawings and the following specific embodiments, the features, advantages, and aspects of the various embodiments of the present application will become more apparent. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic and the original components and elements are not necessarily drawn to scale.

[0030] Figure 1 Schematic diagram of physical resource mapping for the prior art;

[0031] Figure 2 Flowchart of an interleaving method provided by the present invention;

[0032] Figure 3 Flowchart of a deinterleaving method provided by the present invention;

[0033] Figure 4 Schematic diagram of the structure of an interleaver provided by the present invention;

[0034] Figure 5 Schematic diagram of the structure of a deinterleaver provided by the present invention.

[0035] Figure 6 Flowchart of an interleaving method provided by the present invention;

[0036] Figure 7 Schematic diagram of physical resource mapping for the interleaving method provided in Embodiment 1 of the present application;

[0037] Figure 8 Schematic diagram of physical resource mapping for the interleaving method provided in Embodiment 2 of the present application;

[0038] Figure 9 Schematic diagram of physical resource mapping for the interleaving method provided in Embodiment 3 of the present application. Detailed Description of the Embodiments

[0039] The present application will be further described in detail below with reference to the accompanying drawings and embodiments. It can be understood that the specific embodiments described herein are only for explaining the present application and not for limiting the present application. Additionally, it should be noted that for the sake of description, only the parts related to the present application are shown in the drawings and not all the structures.

[0040] Before discussing the exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe the steps as sequential processes, many of the steps can be implemented in parallel, concurrently, or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operations are completed, but it can also have additional steps not included in the drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0041] In addition, without conflict, the embodiments in this application and the features in the embodiments may be combined with each other.

[0042] The following further describes this application in detail with reference to the drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain this application, rather than limiting this application. Additionally, it should be noted that for ease of description, only parts related to this application rather than all structures are shown in the drawings.

[0043] Before discussing the exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe the steps as sequential processes, many of the steps can be implemented in parallel, concurrently, or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but it can also have additional steps not included in the drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, and so on.

[0044] It should be noted that the concepts such as "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 of functions executed by these devices, modules, units, or other objects or their interdependent relationships.

[0045] In addition, without conflict, the embodiments in this application and the features in the embodiments may be combined with each other.

[0046] Considering that the existing interleaving method is based on a continuous redundancy version mapping scheme, as Figure 1 shown. Generally, the RV (Redundancy Version) of each code block, here such as RV0 and RV1, contains a large number of information bits. If this method is used for physical resource mapping, it will cause the information bits to be concentrated in specific two subframes (such as Figure 1 the first two subframes shown). In a specific time-selective fading channel, this method will cause the information bits to be concentrated, thus affecting the interleaving effect.

[0047] The present invention proposes a time-domain interleaving method for multiplexing HARQ cyclic memory across transport blocks (TBs). The core lies in simultaneously performing channel coding on the data of multiple TBs, and intercepting the bit sequences after coding with specific starting positions and lengths to generate data segments with different combinations of information bits and parity bits, that is, redundancy versions (RVs). Different redundancy versions are transmitted within each subframe time, thereby achieving the effect of time-domain interleaving.

[0048] In particular, the time-domain interleaving scheme proposed by the present invention includes two technical solutions for generating and selecting redundant versions.

[0049] The first technical solution for generating and selecting redundant versions of the present invention: First, continuous redundant versions are generated for each code block. Subsequently, within each subframe, for different code blocks, cyclic increment / decrement is adopted, or specific redundant version numbers are obtained in the manner of a given sequence number group, and the bits corresponding to the redundant versions are read for subsequent baseband processing and transmission. This technical solution is more simplified. Compared with the existing time interleaving technology that multiplexes the HARQ mechanism, it can effectively avoid the problem that the information bits are too concentrated after interleaving, making it difficult to resist bursty concentrated errors, effectively optimizes the interleaving process of the data stream, and ensures the efficiency and reliability of data transmission.

[0050] The second technical solution for generating and selecting redundant versions of the present invention: The redundant versions are generated by equally spaced reading of the bits in the cyclic buffer, so as to achieve uniform distribution of the information bits and parity bits of each code block on each redundant version. When each redundant version is transmitted in different subframes, the effect of time interleaving can be achieved. Compared with the existing time interleaving technology that multiplexes the HARQ mechanism, this method can effectively avoid the problem that the information bits are too concentrated after interleaving, making it difficult to resist bursty concentrated errors, effectively optimizes the interleaving process of the data stream, and ensures the efficiency and reliability of data transmission.

[0051] The time-domain interleaving scheme provided by the present invention can effectively solve the problem of concentrated distribution of information bits in the time-domain interleaving process, significantly improve the anti-interference ability 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.

[0052] In particular, for the first technical solution for generating and selecting redundant versions of the present invention, as Figure 2 shown, the provided interleaving method includes:

[0053] The transmission block is extended, code block segmentation and coding are performed using the number of redundant versions n for interleaving to obtain k encoded code blocks, or the number of redundant versions n of transmission blocks for interleaving are subjected to code block segmentation and coding to obtain k encoded code blocks;

[0054] Rate matching related operations are performed on the k encoded code blocks and written into the cyclic memory;

[0055] According to the physical resource number of the subframe, the transmission block size, and the number of redundant versions, the corresponding bit positions of the redundant versions of each encoded code block in the cyclic memory are determined;

[0056] Taking n subframes as a cycle, in each subframe, the redundant versions of the k code blocks are selected according to a predetermined selection method, and the bits included in the redundant versions are subjected to subsequent baseband processing and transmission.

[0057] It should be noted that the method of selecting redundant versions with different version numbers according to the predetermined selection method here includes cyclic increasing selection, cyclic decreasing selection, or selection according to a given sequence group, etc.

[0058] Optionally, the bit positions corresponding to each redundant version in the cyclic memory are continuously cyclically distributed.

[0059] Optionally, the sum of the number of bits of the n redundant versions in each code block is greater than, equal to, or less than the number of bits in the cyclic memory;

[0060] Optionally, the predetermined selection method is to perform cyclic increasing selection on the redundant versions of k code blocks.

[0061] It should be noted that the increment of the increment here can be 1, can be 2, can be 3, or can be any non - negative integer less than n.

[0062] Optionally, the predetermined selection method is to perform cyclic decreasing selection on the redundant versions of k code blocks.

[0063] It should be noted that the decrement of the decrement here can be 1, can be 2, can be 3, or can be any non - negative integer less than n.

[0064] Optionally, the predetermined selection method is to select the redundant versions of k code blocks according to a given sequence group.

[0065] Optionally, in the transmission period composed of n sub - frames, the n sub - frames are equally spaced;

[0066] The transmission period composed of n sub - frames completes the transmission of the corresponding bits of the n redundant versions in k code blocks.

[0067] In particular, for the first technical solution of redundant version generation and selection of the present invention, as Figure 3 shown, the present invention also provides a time - domain de - interleaving method, which demodulates the received symbols in the baseband to obtain the corresponding log - likelihood ratio, and fills the log - likelihood ratio into the corresponding positions in the cyclic memory according to the predetermined redundant version selection method, the physical resource number of the sub - frame, the transmission block size, and the number of redundant versions;

[0068] Perform operations related to rate matching and decoding processing;

[0069] Aggregate the decoded code blocks into a transmission block.

[0070] In particular, for the first technical solution of redundant version generation and selection of the present invention, as Figure 4 shown, the present invention also provides a time - domain interleaver, including:

[0071] The processing unit 100 expands the transport block using the number of redundant versions n for interleaving, performs code block segmentation and encoding to obtain k encoded code blocks, or performs code block segmentation and encoding on n transport blocks using the number of redundant versions for interleaving to obtain k encoded code blocks;

[0072] Perform rate matching related operations on the k encoded code blocks and write them into the cyclic memory;

[0073] Determine the corresponding bit positions of each redundant version in the cyclic memory according to the number of physical resources in the subframe, the transport block size, and the number of redundant versions;

[0074] Taking n subframes as a period, in each subframe, select the redundant version for the k code blocks according to a predetermined selection method, and perform subsequent baseband processing on the bits included in the redundant version.

[0075] The transmitting unit 200 transmits the data symbols after baseband processing.

[0076] In particular, the present invention aims at the first technical solution for redundant version generation and selection, such as Figure 5 As shown, the present invention also provides a time-domain deinterleaver, including:

[0077] The receiving unit 300 receives the symbols after being transmitted through the channel;

[0078] The processing unit 400 performs baseband demodulation on the received symbols to obtain the corresponding log-likelihood ratio, and fills the log-likelihood ratio into the corresponding positions in the cyclic memory according to the predetermined redundant version selection method, the number of physical resources in the subframe, the transport block size, and the number of redundant versions;

[0079] Perform rate dematching related operations and decoding processing;

[0080] Aggregate the decoded code blocks into transport blocks.

[0081] Specifically, for these two technical solutions for redundant version generation and selection, the following steps may be included:

[0082] Encode the code blocks to obtain encoded code blocks;

[0083] Perform rate matching related operations on the encoded code blocks;

[0084] Generate multiple redundant versions for each code block according to specific rules and read the bit sequence;

[0085] Perform constellation mapping to map the bit sequence to complex symbols;

[0086] Convert the modulated symbols into time-domain signals and add a cyclic prefix;

[0087] Transmit the time-domain signal with the cyclic prefix added.

[0088] Optionally, before encoding the code block, it includes:

[0089] Performing extension, code block segmentation, and encoding on the transport block according to the number of redundancy versions to obtain code blocks; or

[0090] Performing code block segmentation and encoding on the transport blocks of the number of redundancy versions to obtain code blocks.

[0091] Optionally, the process of performing rate matching related operations on the encoded code blocks includes:

[0092] Performing rate matching internal block interleaving processing and cyclic memory writing on the code blocks.

[0093] Optionally, according to the number of physical resources in the subframe, the transport block size, and the number of redundancy versions, determine the bit positions corresponding to each redundancy version in the cyclic memory of each code block:

[0094] Subsequently, by cyclic incrementing / decrementing, or in the manner of a given sequence number group, sequentially select the redundancy version numbers of each code block to be transmitted in this subframe, read the corresponding bits, and perform subsequent baseband processing such as physical resource mapping and transmission.

[0095] Specifically, the interleaving method provided by the present invention, as Figure 6 shown, can actually include: 7 steps such as transport block size (TBS) extension, code block segmentation, channel coding, rate matching related operations, redundancy version generation and physical resource mapping, constellation mapping, symbol generation and transmission, etc., thus forming a complete cross-transport block time interleaving technical solution. Therefore, a detailed description is carried out for each step:

[0096] 1. Transport block size extension

[0097] To ensure that the transmission throughput is consistent with non-interleaved transmission, the transport block size is appropriately extended according to the preset number of redundancy versions. According to the system configuration and channel conditions, obtain the transport block size TBS ori , then the extended transport block size can be expressed as:

[0098] TBS extended = round(TBS ori × n)

[0099] where the round(·) operation represents selecting the transport block size closest to {TBS ori × n} that is legal for the 5G broadcast standard, and n is the preset number of redundancy versions.

[0100] 2. Code block segmentation

[0101] The extended transport block will be segmented into multiple code blocks (CBs) to meet the input requirements of the channel encoder. According to the interleaving algorithm specified by the 3GPP group, two interleaving parameters f 1 and f 2 correspond to fixed code block lengths. Therefore, the input length of the channel encoder must be two legal lengths (minimum 40 bits, maximum 6144 bits). Define the number of segments with segment lengths K plus and K minus as C plus and C minus respectively. The code block segmentation rule is:

[0102]

[0103] where N CB is the number of code blocks. Padding bits are supplemented if necessary.

[0104] Alternatively, the two modules of "transport block size extension" and "code block segmentation" can be replaced by: performing code block segmentation on the n transport blocks TBS 1 , TBS 2 ,..., TBS n before extension respectively, and the segmented code blocks enter the "channel coding" module uniformly.

[0105] 3. Channel Coding

[0106] Perform channel coding on each code block to add redundant bits to improve the anti-interference ability. Any channel coding scheme (such as Turbo coding, LDPC coding, etc.) can be arbitrarily selected. The coded code block contains information bits and parity bits, and the channel coding rate is:

[0107]

[0108] where T is the length of the information bits and N is the total length of the coded bits.

[0109] 4. Rate Matching Related Operations

[0110] The coded code block needs to go through rate matching related operations, that is, adjust the length of the coded bit sequence to adapt to the physical resource constraints. Specifically, the information bits and parity bits output by the encoder need to go through block interleaving processing inside the rate matching and then be written into the cyclic memory.

[0111] 5. Redundancy Version Generation and Physical Resource Mapping, including two technical solutions for redundancy version generation and selection

[0112] Determine the bit positions of each redundancy version in the cyclic memory according to the number of physical resources in the subframe, the transport block size, and the number of redundancy versions. The present invention proposes two methods for generating the bit positions of redundancy versions, that is, two technical solutions for determining the start pointer, pointer increment, and redundancy version length of each redundancy version:

[0113] The first solution: the continuous cyclic redundancy version method between code blocks:

[0114] This method realizes physical resource mapping by cyclically incrementing / decrementing or reading the redundancy version numbers of each code block according to a given sequence number group. Among them, the change amount of the above-mentioned cyclic incrementing / decrementing can be taken as any non-negative integer less than the number of redundancy versions of each code block. The specific steps are as follows:

[0115] First, each code block generates its redundancy version by adopting the concept of "continuous redundancy version". That is, it is stipulated that the start pointer of the redundancy version of each code block is the next position of the end pointer of the previous redundancy version, and the pointer increment is fixed at 1. At this time, the calculation method for the length of each redundancy version of each code block is: (1) If the previous step is to expand the transport block, divide the code block, and encode using the number of redundancy versions

[0116] n, then the redundancy version length of each code block is (2) If the previous step is to divide the code block and encode using n transport blocks with the number of redundancy versions, then the redundancy version length of each code block is Or Among them, k represents the total number of code blocks, and the remaining variables and related calculation rules are consistent with TS 36.212.

[0117] Subsequently, here, by cyclically incrementing / decrementing or selecting according to a given sequence number group, the redundancy version numbers of each code block are sequentially selected and physical resource mapping is performed. Here, taking cyclic incrementing selection with an increment of 1 as an example, let the redundancy version number selected for the kth code block in the current subframe be i k , and its corresponding redundancy version is Then the redundancy version number selected for the k + 1th code block is:

[0118] i k+1 =(i k + 1) mod n

[0119] Among them, the mod(·) operator represents the modulo operation. Then the selected redundancy version corresponding to the k + 1th code block is

[0120] In the next subframe, the redundancy version number selected for the kth code block is i‘ k =(i k + 1) mod n, and the calculation method for the redundancy version numbers selected for the remaining code blocks is the same.

[0121] This method uses redundant versions as the basic time-interleaving unit, incrementing / decrementing cyclically within each subframe, or selecting the redundant version numbers of each code block in the manner of a given sequence number group, and incrementing / decrementing cyclically between different subframes, or selecting the redundant version numbers of each code block in the manner of a given sequence number group. In this way, the information bits are effectively dispersed in multiple subframes, while reducing the probability that the information bits of each code block appear in the same subframe, thus significantly optimizing the robustness and reliability of the transmission.

[0122] The second scheme: Comb-shaped generation of redundant versions method:

[0123] When generating n redundant versions of each code block, this method takes the following steps:

[0124] Set the starting pointer position of each redundant version to the next position of the starting pointer position of the previous redundant version; the pointer increments of each redundant version are equal and are constants, usually not 1. To achieve an approximately uniform distribution of information bits and parity bits in each redundant version, the specific value of this increment can be set to the reciprocal of the channel coding rate, i.e.:

[0125]

[0126] where R b is the channel coding rate.

[0127] All the redundant versions of each code block have equal lengths and are approximately At this time, the n redundant versions obtained for the kth code block can be represented by variables as RV k0 , RV k1 , …, RV k(n-1) .

[0128] The redundant versions generated based on the above steps show a "comb-shaped" interleaved distribution state in terms of bit distribution, that is, the bit positions of each redundant version are appropriately shifted compared to the previous version, thus forming a structure similar to the teeth of a comb as a whole. This interleaved distribution makes the information bits and parity bits more evenly distributed among multiple redundant versions, which helps to improve the effect of time interleaving.

[0129] Subsequently, the ith redundant version generated by each code block is sequentially mapped to the physical resources of the ith subframe

[0130] 6. Constellation mapping

[0131] Adopt modulation schemes such as QPSK, 16QAM or 64QAM to map the bit sequence into complex symbols. The mapping rules can be dynamically adjusted according to the system configuration and channel conditions.

[0132] 7. Symbol Generation and Transmission

[0133] Using an appropriate modulation method, the modulated symbols are converted into time-domain signals and a cyclic prefix is added. The transmission power and antenna configuration are dynamically adjusted according to the channel state information, and transmitted via the transmit antenna.

[0134] After symbol transmission is completed, the receiving end stores the log-likelihood ratio corresponding to each redundant version in the reverse process of the transmitting end, and decodes after all redundant versions are received.

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

[0136] Specifically, for the time-domain interleaving technology of multiplexing HARQ cyclic storage proposed by the present invention, it can be implemented through the following data processing methods.

[0137] First, in order to ensure the same throughput as non-interleaved transmission, the transport block size TBS is appropriately extended according to the preset number of redundant versions n. Assuming that the number of redundant versions of each code block is n, the extended transport block size is:

[0138] TBS′ = round(n × TBS)

[0139] where round(·) represents selecting the nearest transport block size legal for the 5G broadcast standard. The extended transport block is divided into K code blocks through code block segmentation. Or for the n TBs before transport block extension, i.e., TBS 1 , TBS 2 ,..., TBS n are respectively subjected to code block segmentation, and a total of K code blocks are obtained.

[0140] Subsequently, the K code blocks are respectively subjected to channel coding to obtain the information bits and parity bits of each code block. Subsequently, each code block performs rate matching-related operations and is written into the cyclic buffer. Subsequently, the present invention uses a predetermined selection method to generate and select the redundant versions of each code block as the transmission data of the current subframe to ensure that the information bits are as evenly dispersed as possible in the time domain. Then, it is successively sent to the transmit antenna through operations such as physical mapping, constellation mapping, OFDM symbol generation and transmission. The receiving end stores the log-likelihood ratio (LLR) of each redundant version through the reverse process of the transmitting end, and decodes after all redundant versions are received, avoiding increasing the memory requirement of the LLR buffer. The above time-domain interleaving process is shown in Figure 6 .

[0141] The present invention mainly focuses on how to generate and select redundant versions of each code block in a transmission environment with continuous deep fading, so as to ensure that the information bits and parity bits of each code block are as evenly distributed as possible in the time domain, while reducing the probability that the information bits of each code block appear in the same subframe. For this purpose, the present invention proposes a method of continuous cyclic redundancy versions between code blocks (i.e., the first solution) and a method of generating redundant versions in a comb shape (i.e., the second solution). The specific implementation at this time can be divided into the following preferred embodiments.

[0142] Embodiment 1:

[0143] As Figure 7 shown, it shows the specific implementation of the method of continuous cyclic redundancy versions between code blocks. In this embodiment, each code block is successively written into a cyclic buffer after channel coding and rate matching related operations. In order to reduce the implementation complexity of time domain interleaving and at the same time ensure an approximate uniform distribution of information bits and parity bits in the time domain, we use the redundant version as the basic time domain operation unit. In this embodiment, the redundant version number is selected in a cyclic increasing manner, and the increment is 1 as an example. Optionally, it can be selected in a cyclic increasing / decreasing manner (and the change amount can be any non - negative integer less than the redundant version number n), or the redundant version number can be selected according to a given sequence number group.

[0144] Suppose each code block CB generates n continuous redundant versions. In this embodiment, n = 4 is taken as an example. Let the starting pointer position (i.e., the bit label in the cyclic buffer) of the i k th redundant version of the kth code block be i k M k , i = 0, 1, 2, 3. Among them, M k is the bit length of the redundant version. Let be the total bit length after rate matching of the kth code block. It is required that M k is the largest integer that satisfies . The pointer increment is set to 1, that is, the bit sequence of each redundant version increases successively from the starting pointer position. At this time, the kth code block generates 4 continuous redundant versions, which are respectively represented as RV k0 , RV k1 , RV k2 , RV k3 , k = 0, 1, …, K - 1, and K represents the total number of code blocks.

[0145] Then, the redundant version numbers of each code block are selected in a cyclic increasing manner within the subframe, and the redundant version numbers of the same code block are selected in a cyclic increasing manner between subframes for physical resource mapping. Specifically, the redundant versions selected in the first subframe are RV 00 , RV 11 , RV 22 , RV 33 , …, RV(K-1)[(K-1)mod4)] , and the redundancy version selected for the second subframe is [RV 01 , RV 12 , RV 23 , RV 30 , …, RV (K-1){[(K-1)+1]mod4)} , and the redundancy version selected for the idx sf -th subframe is where mod(·) represents the modulo operation. By analogy, the selection of the redundancy version transmitted by each subframe and the physical resource mapping can be implemented.

[0146] Through the above method, the information bits can be effectively dispersed into multiple subframes, and at the same time, the probability that the information bits of each code block appear in the same subframe is reduced, thereby optimizing the robustness and reliability of the transmission.

[0147] Embodiment 2:

[0148] As Figure 8 shown, another specific implementation manner of the inter-code-block continuous cyclic redundancy version method is shown. In this embodiment, each code block is successively subjected to channel coding and rate matching related operations and then written into the cyclic buffer. In order to reduce the implementation complexity of time-domain interleaving and at the same time ensure an approximately uniform distribution of information bits and parity bits in the time domain, we use the redundancy version as the basic time-domain operation unit. In this embodiment, the manner of selecting the redundancy version number by an arbitrarily given sequence number group is taken as an example. Optionally, it can be cyclically incremented / decremented (and the change amount can be any non-negative integer less than the number of redundancy versions n), or the redundancy version number can be selected according to a given sequence number group.

[0149] Suppose each code block CB generates n consecutive redundancy versions. In this embodiment, n = 4 is taken as an example. It is set that the starting pointer position (i.e., the bit label in the cyclic buffer) of the i k -th redundancy version of the k-th code block is i k M k , i = 0, 1, 2, 3. Where M k is the bit length of the redundancy version. Suppose is the total bit length after rate matching of the k-th code block. It is required that M k is the largest integer that satisfies . The pointer increment is set to 1, that is, the bit sequence of each redundancy version is incremented successively from the starting pointer position. At this time, the k-th code block generates 4 consecutive redundancy versions, which are respectively represented as RV k0 , RV k1 , RV k2 , RV k3 , k = 0, 1, …, K - 1, and K represents the total number of code blocks. In this embodiment, K = 4 is taken as an example.

[0150] Next, select the redundant versions of each code block in the manner of any given sequence number group, and perform physical resource mapping. Among them, the arbitrarily given sequence number group needs to meet the requirements that it includes all the redundant versions of the generated code blocks and does not select any redundant version repeatedly. In this embodiment, the following given sequence number group is taken as an example, that is: the redundant versions selected in the first subframe are [RV 00 ,RV 12 ,RV 21 ,RV 30 , the redundant versions selected in the second subframe are [RV 02 ,RV 11 ,RV 20 ,RV 33 , the redundant versions selected in the third subframe are [RV 03 ,RV 10 ,RV 23 ,RV 32 , and the redundant versions selected in the fourth subframe are [RV 01 ,RV 13 ,RV 22 ,RV 31 . Finally, the selection of redundant versions and physical resource mapping are completed.

[0151] Embodiment 3:

[0152] As Figure 9 shown, the specific implementation manner of the comb-shaped redundant version generation method is shown. In this embodiment, Turbo code is used as the channel coding method, and the channel coding rate is . After the coded code blocks undergo rate matching related operations and are written into the cyclic buffer in sequence according to the method described above. At this time, the information bits are concentrated in the front region of the buffer, while the first parity bit and the second parity bit are interleaved and distributed in the rear region.

[0153] Due to the increase in the generalized coding rate caused by the transmission block expansion, "puncturing" may occur in each code block. In response to this phenomenon, the present invention first calculates the total bit length L RM after "puncturing" for each code block according to the generalized coding rate, and then generates n redundant versions (n = 3 in this embodiment) from the "punctured" code blocks. In order to ensure the uniform distribution of information bits in each redundant version, this embodiment adopts a method of combining continuous increasing of the redundant version starting pointer position and equally spaced reading to generate redundant versions, that is, the "comb-shaped redundant version generation method". The specific steps are as follows:

[0154] Set the starting pointer of the i-th redundant version of each code block to the address with bit label i in the cyclic buffer of this code block. The bit labels in the cyclic buffer increase sequentially in the clockwise direction starting from the first information bit, and let the label of the first information bit be 0.

[0155] The pointer increment Δ of each redundant version p Is set to the reciprocal of the channel coding rate, that is:

[0156]

[0157] Then the bit sequence of the i-th redundant version RV i Consists of the following label sequence:

[0158] RV i = [i, i + Δ p , i + 2Δ p , …, i + (M - 1)Δ p

[0159] Wherein, the values within [] represent the bit labels read from the cyclic buffer, M is the bit length of a single redundant version, and its value is the largest integer that satisfies n × M ≤ L RM

[0160] Subsequently, map the redundant versions RV generated by each code block 0 Sequentially to the physical resources corresponding to the first subframe, map the redundant versions RV generated by each code block 1 Sequentially to the physical resources corresponding to the second subframe, map the redundant versions RV generated by each code block 2 Sequentially to the physical resources corresponding to the third subframe, thereby realizing the generation and selection process of redundant versions.

[0161] Through the above method, it can be ensured that the information bits and parity bits of each code block achieve a uniform distribution at the bit level during the entire transmission process, thereby effectively improving the robustness of the system in complex transmission environments such as continuous deep fading.

[0162] This application also provides a network device, including a processor and a memory. The memory is configured to store a computer program. When the computer program is executed by the processor, the processor implements the interleaving method as described above.

[0163] This application also provides a user equipment, including a processor and a memory. The memory is configured to store a computer program. When the computer program is executed by the processor, the processor implements the deinterleaving method as described above.

[0164] This application also provides a computer-readable storage medium, including a computer program. When the computer program is executed by the processor, the processor implements any one of the methods.​​

[0165] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions according to the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (such as coaxial cable, optical fiber, digital subscriber line) or wirelessly (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that the computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (such as a floppy disk, hard disk, magnetic tape), an optical medium (such as a digital video disc (DVD)), or a semiconductor medium (such as a solid state disk (SSD)), etc.

[0166] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. A professional technician can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0167] The above are only the preferred embodiments of the present application, and do not limit the embodiments and protection scope of the present application. Those skilled in the art should be able to realize that all equivalent replacements and obvious changes made by using the specification and illustrated content of the present application should be included in the protection scope of the present application.

Claims

1. A time domain interleaving method, characterized in that: The following steps are involved: Using the redundant version number n used for interleaving to expand the transport block, code block segmentation and encoding, to obtain k coded code blocks, or code block segmentation and encoding of the redundant version number n transport blocks used for interleaving, to obtain k coded code blocks; Perform rate matching related operations on k code blocks and write them into the circular memory; Determine the corresponding bit position of the redundant 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 redundant versions; With n subframes as a period, a redundant version is selected for k code blocks in each subframe according to a predetermined selection method, and the bits included in the redundant version are subsequently baseband processed and transmitted.

2. The time domain interleaving method according to claim 1, characterized in that: The bit positions corresponding to the redundant versions in the cyclic memory are distributed in a continuous cyclic manner.

3. The time domain interleaving method according to claim 1, characterized in that: The sum of the number of bits of the n redundant versions in 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, characterized in that: The predetermined selection method is to select only one redundant version for each code block, perform cyclic increasing / decreasing selection on the redundant versions of k code blocks, or select the redundant versions of k code blocks according to a given sequence number group.

5. The time domain interleaving method according to claim 1, characterized in that: In a transmission period consisting of n subframes, the n subframes are equally spaced; A transmission period consisting of n subframes completes the transmission of bits corresponding to n redundant versions in k code blocks.

6. A time domain deinterleaving method, characterized in that: Perform baseband demodulation on the received symbols to obtain corresponding log-likelihood ratios, and fill the log-likelihood ratios into corresponding positions in the circular memory according to a predetermined redundant version selection method and the number of physical resources of the subframe, the transmission block size, and the number of redundant versions; Perform rate matching related operations and decoding processing; The decoded code blocks are aggregated to form a transmission block.

7. A time domain interleaver, characterized in that: include: The processing unit uses the redundant version number n used for interleaving to expand the transmission block, divide the code block and encode it to obtain k encoded code blocks, or divides the code block of the redundant version number n used for interleaving, encodes it, and obtains k encoded code blocks; Perform rate matching related operations on k code blocks and write them into the circular memory; Determine the corresponding bit position of the redundant 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 redundant versions; With n subframes as a period, in each subframe, a redundant version is selected for k code blocks according to a predetermined selection method, and bits included in the redundant version are subsequently baseband processed to obtain symbols after baseband processing. The sending unit transmits the symbols after baseband processing.

8. A time domain deinterleaver, characterized in that: include: A receiving unit, receiving symbols after being transmitted through a channel; The processing unit performs baseband demodulation on the received symbols to obtain corresponding log-likelihood ratios, and fills the log-likelihood ratios into corresponding positions in the circular memory according to a predetermined redundancy version selection method and the number of physical resources of the subframe, the transmission block size, and the number of redundancy versions; Perform rate matching related operations and decoding processing; The decoded code blocks are aggregated to form a transmission block.

9. A computer-readable storage medium, comprising a computer program, wherein when the computer program is executed by a processor, the processor implements the method according to any one of claims 1 to 6.

Images