A channel-level joint decoder for repeated coding blocks and a decoding method thereof

By designing a channel-level joint decoder for repeated encoding blocks, diversity joint decoding of dual-link transmission data is realized in 5GNR system, solving the problem that diversity merge cannot be achieved in dual-link transmission, and improving communication reliability And enhances anti-interference ability.

CN116455521BActive Publication Date: 2024-11-26CHONGQING UNIV OF POSTS & TELECOMM
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310501605.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-05-06
Publication Date
2024-11-26
Estimated Expiration
2043-05-06

AI Technical Summary

Technical Problem

The existing dual-link transmission scheme cannot realize the data diversity merging in scenarios with real-time requirements, resulting in the inability to utilize the diversity merging in 5GNR systems to bring gain, affecting communication reliability.

Method used

A channel-level joint decoder for repeated encoding blocks is designed, and the two identical channel decoder modules, bit hard judgment modules, verification and inspection modules and continue iteration modules are composed of two identical channel decoder modules, verification and inspection modules, and the continuous iteration modules are processed separately from resource blocks of different physical layers. Log likelihood ratio data blocks and alternate iterative decoding is performed to achieve diversity joint decoding.

Benefits of technology

This method can not only resist strong interference, but also obtain the diversity combined gain of two retransmission transmission channels, improve communication reliability and avoid decoding performance caused by inaccurate signal-to-noise ratio calculation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116455521B_ABST
    Figure CN116455521B_ABST
Patent Text Reader

Abstract

The present invention relates to a channel hierarchical joint decoder of repeated coding blocks and a decoding method thereof, and belongs to the technical field of mobile communications. After the transmitting end performs channel coding on the data block to be transmitted, the data block is transmitted on different physical resources. The data blocks received by the receiving end on different physical resources are alternately iteratively decoded by two identical channel decoders, wherein the first channel decoder uses the external information of the second channel decoder, and the second channel decoder uses the external information of the first channel decoder. In order to increase the reliability of communication, a physical layer repeated transmission method is adopted, and there is no association after the repeated transmission of the data block, and each data block is decoded by itself. Although it can provide the communication anti-strong interference capability, it cannot obtain the transmission diversity gain of the retransmitted data block. The present invention sends two data blocks into a diversity joint decoder for decoding, which can not only resist strong interference, but also obtain the diversity combining gain of the two retransmission transmission channels.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of mobile communications and relates to a channel hierarchical joint decoder of repeated coding blocks and a decoding method thereof. Background Art

[0002] In the field of wireless communications, for example, 4G / 5G mobile communication systems generally use dual links for transmission in order to provide communication reliability. The two links can be different wireless access technologies or the same wireless access transmission links at different frequencies. The receiving end only needs to decode correctly on one link to indicate that the data transmission is correct. The advantage of this implementation is that it is completed by two independent independent links, but it also has disadvantages. Although dual links are used for data transmission, the diversity combining effect of the dual links is not considered.

[0003] Regarding the reliability of wireless link transmission, with the promotion of mobile communication application industry, especially in industrial applications and private network scenarios, transmission reliability is becoming more and more important in environments with stringent reliability requirements. The use of dual-link transmission is still a very important means, but the current solution still has some defects for scenarios with real-time requirements.

[0004] In the dual-link transmission scheme, the terminal packet data convergence protocol (PDCP) module sends data blocks to two radio link control (RLC) modules. The RLC modules are mapped to two radio links for transmission. The two radio links can be the same radio access technology or different radio access technologies. If they are the same radio access technology, they need to be transmitted on different carriers. Since the data packet transmission of this scheme is independent from the RLC module to the physical layer, it does not support diversity combining and only relies on single-link transmission performance.

[0005] Figure 1 Given dual-link transmission under different access technologies, in the 5GNR system, one link can be a 5GNR link and the other can be a 4GLTE link. It can also be composed of two independent 5GNR links.

[0006] At present, both 4G LTE and 5G NR system carrier aggregation solutions are very mature. In PDCP data, including repeated transmission, it can also support transmission on different carriers under the same access technology mode to provide transmission reliability. Figure 2 and Figure 3 shown.

[0007] Figure 2 For downlink transmission link carrier aggregation, Figure 3For uplink transmission link carrier aggregation, they have a common feature, that is, there is an independent HARQ entity corresponding to each carrier, and HARQ merging and retransmission are only performed on their own working carriers, and it is clearly required that the HARQ data and processes of carrier CC1 and CC2 cannot be shared and can only work independently. This also means that in the current 5GNR dual-link solution, diversity merging is not supported in any way, and it cannot be used to bring gains. Summary of the invention

[0008] In view of this, an object of the present invention is to provide a channel hierarchical joint decoding method for repeated coding blocks.

[0009] In order to achieve the above object, the present invention provides the following technical solutions:

[0010] A channel hierarchical joint decoder for repeated coding blocks, the diversity joint decoder comprising two identical channel decoder modules, a bit hard decision module, a check check module, a check determination module and a continuous iteration module;

[0011] The channel decoder module is composed of two identical channel decoders 1 and 2, which process the log-likelihood ratio LLR data blocks from channel demodulation of different physical layer resource blocks respectively; channel decoder 1 and channel decoder 2 output two kinds of information, internal information Le and external information Lex; channel decoder 1 uses the external information of channel decoder 2 for decoding, and channel decoder 2 uses the external information of channel decoder 1 for decoding;

[0012] The bit hard decision module completes the merging of the log-likelihood ratio of the received data block and the internal information, and then performs bit hard decision to obtain the received bit data stream; the bit hard decision is composed of two identical modules, which distribute and process the data from channel decoder 1 and channel decoder 2;

[0013] The verification and checking module performs a cyclic verification and checking on the bit data streams from the bit hard decision module and the combined bit hard decision module;

[0014] The verification and determination module determines whether the diversity joint decoder correctly decodes the data block sent by the sending end;

[0015] The continued iteration module determines whether to exit the iteration process according to the verification result. If the verification determines that the received bit data block is correctly verified or the number of decoding iterations reaches the maximum value, the decoding process of the diversity joint decoder is exited, otherwise the next round of decoding process is started.

[0016] The decoding method based on the diversity joint decoder comprises the following steps:

[0017] Step 1: The receiving end receives data from two different physical resource blocks, demodulates the data to obtain the log-likelihood ratios of the two data blocks, denoted as LLR1 and LLR2; the initial values ​​of the internal information and external information of the channel decoder are set to 0;

[0018] Step 2: LLR1 and LLR2 are sent to two channel decoders 1 and 2 of the diversity joint decoder respectively. The channel decoders output their own external information data blocks and internal information data blocks respectively, and the external information data block of channel decoder 1 is sent to channel decoder 2, and the external information data block of channel decoder 2 is sent to channel decoder 1;

[0019] Step 3: Accumulate and combine the internal information data block and the log-likelihood ratio data block output by channel decoder 1 and channel decoder 2, and then perform hard decision to obtain a decoded bit data stream;

[0020] Accumulating the log-likelihood ratio data blocks and internal information of channel decoder 1 and channel decoder 2, and performing hard decision to obtain a decoded bit data stream;

[0021] Step 4: The bit data stream of the hard decision is checked. If only one channel of data is checked correctly, the decoding is completed and the bit data stream of this channel is the final bit data stream of the decoding.

[0022] Step 5: The bit data stream of the hard decision is verified. If the data checks from the bit hard decision and the combined bit hard decision are not correct and the number of iterations has not reached the maximum number, the next round of iterative decoding process is started.

[0023] The beneficial effects of the present invention are:

[0024] First: In order to increase communication reliability, a physical layer retransmission method is adopted. There is no association after the repeated transmission of data blocks, and each data block is decoded by itself. Although it can provide communication anti-strong interference capability, it cannot obtain the transmission diversity gain of the retransmitted data blocks. The present invention sends two data blocks into a diversity joint decoder for decoding, which can not only resist strong interference, but also obtain the diversity combining gain of the two retransmission transmission channels.

[0025] Second: In the repeated transmission of physical layer data blocks, the commonly used method is to perform maximum ratio combining (abbreviated as: MRC) or equal gain combining (abbreviated as: EGC) on the two received data blocks, and then perform channel decoding on the combined data to obtain the final data block. In actual projects, if the EGC method is used, if one of the data blocks finds strong interference, it will affect the final decoding effect. If the MRC method is used, since the signal-to-noise ratio of the data block needs to be known when merging, it is difficult to accurately calculate the signal-to-noise ratio of the data block in actual projects, resulting in a decrease in the signal-to-noise ratio of the data block after merging. The present invention uses two decoders in a diversity joint decoder to decode independently, and then performs joint decoding, which will not affect the decoding performance due to inaccurate signal-to-noise ratio calculation.

[0026] Other advantages, objectives and features of the present invention will be described in the following description to some extent, and to some extent, will be obvious to those skilled in the art based on the following examination and study, or can be taught from the practice of the present invention. The objectives and other advantages of the present invention can be realized and obtained through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention will be described in detail below in conjunction with the accompanying drawings, wherein:

[0028] Figure 1 Repeated transmission scheme for different access technologies in mobile communications;

[0029] Figure 2 Configuring links for downlink L2 multi-carrier aggregation transmission;

[0030] Figure 3 Configuring links for uplink L2 multi-carrier aggregation transmission;

[0031] Figure 4 Diversity Joint Decoder Architecture

[0032] Figure 5 Decoding process for diversity joint decoder;

[0033] Figure 6 A physical layer repetitive transmission link using QPSK modulation and LDPC channel coding;

[0034] Figure 7 It is a conventional llr1 channel decoding link;

[0035] Figure 8 It is a conventional LDPC decoder structure;

[0036] Fig. 9 It is a conventional llr2 channel decoding link;

[0037] Fig.10 Merge channel decoding link for conventional EGC;

[0038] Fig.11 It is a conventional MRC channel decoding link;

[0039] Fig.12 It is the conventional AltSC channel decoding link;

[0040] Fig.13 It is the conventional AltSC channel decoding link;

[0041] Fig.14 It is the AltSC decoding process;

[0042] Fig.15 It is the conventional AltEGC channel decoding link;

[0043] Fig.16 It is the AltEGC diversity joint decoder structure;

[0044] Fig.17 It is the conventional AltMRC channel decoding link;

[0045] Fig.18 It is the AltMRC diversity joint decoder structure;

[0046] Fig.19 It is the conventional AltMRC channel decoding link;

[0047] Fig. 20 It is the AltJoint diversity joint decoder structure;

[0048] Fig.21 It is the LDPC decoding algorithm of the conventional BP method;

[0049] Fig. 22 is the simulated bit error rate curve of scenario 1;

[0050] Fig.23 is the simulated block error rate curve of scenario 1;

[0051] Fig.24 is the simulated bit error rate curve of scenario 2;

[0052] Fig.25 is the simulated block error rate curve of scenario 2;

[0053] Fig.26 is the simulated bit error rate curve of scenario 3;

[0054] Fig. 27 This is the simulated block error rate curve for scenario 3. DETAILED DESCRIPTION

[0055] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and features in the embodiments can be combined with each other without conflict.

[0056] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on the present invention. In order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of actual products. For those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.

[0057] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "front", "rear", etc. indicate the orientation or position relationship, they are based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operate in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as limiting the present invention. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.

[0058] The present invention provides a physical layer repeated transmission and decoding method. After the transmitting end performs channel coding on the data block to be transmitted, the data block is transmitted on different physical resources. The receiving end uses two identical channel decoders to perform alternating iterative decoding on the data blocks received on different physical resources, wherein the first channel decoder uses the external information of the second channel decoder, and the second channel decoder uses the external information of the first channel decoder. The diversity joint decoder structure of the present invention is as follows: Figure 4 shown.

[0059] The diversity joint decoder is composed of two identical channel decoders, bit hard decision, check check, check determination and continuous iteration modules.

[0060] The channel decoder module consists of two identical channel decoders 1 and 2, which process the log-likelihood ratio (LLR) data blocks from channel demodulation of different physical layer resource blocks respectively. The channel decoder outputs two types of information, internal information (Le) and external information (Lex). Channel decoder 1 uses the external information of channel decoder 2 for decoding, and channel decoder 2 uses the external information of channel decoder 1 for decoding.

[0061] The bit hard decision module completes the combination of the log-likelihood ratio of the received data block and the internal information, and then performs bit hard decision to obtain the received bit data stream. The bit hard decision also consists of two identical modules, which process the data from channel decoder 1 and channel decoder 2 in a distributed manner.

[0062] The check module performs a cyclic check on the bit data streams from the bit hard decision module and the merged bit hard decision module.

[0063] The verification and determination module determines whether the diversity joint decoder correctly decodes the data block sent by the sending end.

[0064] The continuing iteration module determines whether to exit the iteration process according to the verification result. If the verification determines that the received bit data block is correct or the number of decoding iterations reaches the maximum value, the decoding process of the diversity joint decoder is exited, otherwise the next round of decoding process is started.

[0065] The decoding process of the present invention is as follows: Figure 5 shown.

[0066] Step 1: The receiving end receives data from two different physical resource blocks and demodulates the data to obtain the log-likelihood ratios of the two data blocks, which are recorded as LLR1 and LLR2 data blocks. The initial values ​​of the internal and external information of the channel decoder are set to 0. Figure 5 Middle 1 step.

[0067] Step 2: Send the two LLR data to the two channel decoders 1 and 2 of the diversity joint decoder respectively. The channel decoders output their own external information data blocks and internal information data blocks respectively, and send the external information data block of channel decoder 1 to channel decoder 2, and send the external information data block of channel decoder 2 to channel decoder 1. Figure 5 Steps 2 and 3.

[0068] Step 3: Accumulate and combine the internal information data block and log-likelihood ratio data block output by the channel decoder, and then make a hard decision to obtain the decoded bit data stream. Figure 5 Steps 4 and 5.

[0069] Furthermore, the log-likelihood ratio data blocks and internal information of the two channel decoders are accumulated, and hard decisions are made to obtain the decoded bit data stream. Figure 5 Middle 6 steps.

[0070] Step 4: The hard-decided bit data stream is checked. If only one data stream is correct, the decoding is completed and the bit data stream is the final bit data stream for decoding. Figure 5 Steps 7 and 8.

[0071] Step 5: The bit data stream of the hard decision is verified. If the data checks from the bit hard decision and the combined bit hard decision are not correct, and the number of iterations has not reached the maximum number, the next round of iterative decoding process is started. Figure 5 Middle 8 steps.

[0072] In order to verify the feasibility of the present invention and its practicality in a practical environment, since LDPC code is a channel coding method that has been widely studied and is known for its excellent performance, coupled with the low-complexity decoding scheme brought about by the flexible structure and sparse check matrix, it occupies an important position in the field of channel coding. Therefore, this embodiment uses LDPC compilation as an example. The Matlab platform is used for simulation, QPSK modulation is used, LDPC channel coding and coding are used, and the generated data blocks are passed through two independent channel models, and various LDPC decoding methods are used for decoding, and finally the data sent by the transmitter is obtained, and the performance of various LDPC decoding methods is evaluated. Figure 6 shown.

[0073] In this embodiment, the number of transmission information bits set by LDPC is 1008, the number of check bits is 1008, the total code length is 2016, and the code rate is 0.5. In order to reduce the delay caused by iterative decoding, the maximum number of iterations is set to 5 times.

[0074] In this embodiment, the focus is on simulating the performance of a diversity joint decoder, and the method of the present invention and the following eight methods are used to simulate the performance comparison under different channel environments.

[0075] Comparative method 1 (llr1): a conventional LDPC decoder (abbreviated as: LDPC decoder) is used to decode LLR1, and LLR2 data block information is not used. Figure 7 and Figure 8 shown.

[0076] Comparative method 2 (llr2): Use a conventional LDPC decoder to decode LLR2 without using the LLR2 data block information. Fig. 9 shown.

[0077] Comparative method 3 (EGC llr1+llr2 decoding): LLR1 and LLR2 are combined with equal gain ratio and then decoded using a conventional LDPC decoder. The specific calculation method for EGC combination is (LLR1+LLR2) / 2, such as Fig.10 shown.

[0078] Comparative method 4 (MRC llr1+llr2 decoding): LLR1 and LLR2 are combined using the maximum signal-to-noise ratio, and then decoded using a conventional LDPC decoder. Fig.11 shown.

[0079] Specific calculation method for MRC merging: Assume that the signal-to-noise ratio of LLR1 is SNR1, and the signal-to-noise ratio of LLR2 is SNR2. Then the calculation formula for MRC merging data blocks is: LLR1*(SNR1 / (SNR1+SNR2))+LLR2*(SNR2 / (SNR1+SNR2)).

[0080] In this embodiment, the SNR calculation method is:

[0081] Assume that the transmitted QPSK modulated data is TxDataBlock, and the received QPSK demodulated data is RxDataBlock.

[0082] v_signal_power=sum(abs(TxDataBlock));

[0083] SNR=v_signal_power / sum(abs(RxDataBlock-TxDataBlock));

[0084] Comparative method 5 (AltSC llr1+llr2 decoding): LLR1 and LLR2 data blocks are sent to two conventional LDPC decoders for iterative decoding, and the two conventional decoders independently perform alternating decoding. Fig.12 , Fig.13 and Fig.14 shown.

[0085] Comparative method 6 (AltEGC llr1+llr2 decoding): LLR1 and LLR2 data blocks are sent to the AltEGC diversity joint decoder for decoding. The LDPC channel decoder is mainly used to calculate the internal information and external information data blocks. Fig.15 and 16 shown.

[0086] Comparative method 7 (AltMRC llr1+llr2 decoding): Send LLR1 and LLR2 data blocks to the AltMRC diversity joint decoder for decoding. Fig.17 and Fig.18shown.

[0087] Comparative method 8 (AltJointllr1+llr2 decoding): Send LLR1 and LLR2 data blocks to the AltMRC diversity joint decoder for decoding. Fig.19 and Fig. 20 shown.

[0088] In the various decoding methods introduced above, the LDPC channel decoder is used to calculate the intrinsic information and extrinsic information during LDPC decoding.

[0089] like Fig.21 The specific calculation method is as follows:

[0090] First, initialize the log-likelihood value of the variable node information

[0091] L (0) (q ij )=LLR

[0092] Where i represents the message bit position, j represents the check bit position, and q ij represents the log-likelihood value of the i-th message bit at the j-th check bit position, and L represents the log-likelihood value.

[0093] The calculation formula for the log-likelihood value of the node information in each iteration is:

[0094]

[0095] In the above formula, l represents the number of iterations, L (l-1) (q ki ) represents the log-likelihood value of the variable node at the l-1th iteration. V(i) represents the check node. V(i)\j represents the variable node j itself is excluded, that is, the node itself does not participate in the calculation.

[0096] The calculation formula for the log-likelihood value of the variable node at the lth iteration is:

[0097]

[0098] This allows us to obtain the internal and external information for each iteration:

[0099] Internal information calculation formula:

[0100] External information calculation formula:

[0101] In this embodiment, 8 comparison algorithms are given, as shown in Table 1. In order to show that the algorithm can be adapted to various scenarios, three typical application scenarios are used for comparison, as shown in Table 2.

[0102] Table 1 8 comparison algorithms

[0103] Serial number Algorithm Name 1 SCllr1 2 SCllr2 3 EGCllr1+llr2 4 MRCllr1+llr2 5 AltSCllr1+llr2 6 AltEGCllr1+llr2 7 AltMRCllr1+llr2 8 AltJointllr1+llr2

[0104] Table 2 Three simulation channel scenarios

[0105]

[0106] Simulation scenario 1:

[0107] Channel model 1 and channel model 2 both use AWGN channels and use the same signal-to-noise ratio for simulation.

[0108] In scenario 1, the bit error rates of eight different decoding algorithms are compared, such as Fig. 22 As shown. The best method uses EGCllr+llr2 and MRC llr1+llr2, and the maximum ratio combining performance is slightly better than equal gain combining, but better than other combining schemes. From the simulation, it can also be seen that the various algorithms of AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / AltJoint llr1+llr2 are better than the single link decoding performance, and these algorithms all have combining gains.

[0109] In scenario 1, the block error rates of 8 different decoding algorithms are compared, such as Fig.23 As shown. The best method uses EGCllr+llr2 and MRC llr1+llr2, and the maximum ratio combining performance is slightly better than equal gain combining, but better than other combining schemes. From the simulation, it can also be seen that the performance of AltJoint llr1+llr2 is better than that of AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / various algorithms, and is better than the single link decoding performance.

[0110] Simulation scenario 2:

[0111] like Fig.24 As shown, both channel model 1 and channel model 2 adopt AWGN channels, wherein each time during simulation, the signal-to-noise ratio of channel model 1 is 1 db worse than that of channel model 2.

[0112] like Fig.25As shown in Figure 2, the bit error rates of eight different decoding algorithms are compared in scenario 2. The best methods are EGCllr+llr2 and MRC llr1+llr2, and the maximum ratio combining method is slightly better than the equal gain combining method, but better than other combining methods. It can also be seen from the simulation that the various algorithms such as AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / AltJoint llr1+llr2 are better than the single link decoding performance, and all of these algorithms have combining gains.

[0113] In scenario 2, the block error rates of 8 different decoding algorithms are compared. The best methods are EGC llr+llr2 and MRCllr1+llr2. The maximum ratio combining method is slightly better than the equal gain combining method, but better than other combining methods. From the simulation, it can also be seen that the performance of AltJoint llr1+llr2 is better than that of AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / various algorithms, and is better than the single link decoding performance.

[0114] Simulation scenario 3:

[0115] like Fig.26 As shown, both channel model 1 and channel model 2 use AWGN channels, and channel model 1 also adds a Rice multipath channel. The multipath information parameters are as follows:

[0116] Path delay: pathDelays = [0200800120023003700] * 1e-9; % unit: second

[0117] Path loss: pathGains = [0-0.9-4.9-8-7.8-23.9]; % unit: dB

[0118] like Fig. 27 As shown in Figure 3, the bit error rates of 8 different decoding algorithms are compared in scenario 3, among which AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / AltJoint llr1+llr2 have similar performances, among which AltSC llr1+llr2 performs slightly better than other schemes, and there is almost no impact of bad channels.

[0119] In scenario 3, the block error rates of eight different decoding algorithms are compared. Among them, AltSC llr1+llr2 / AltEGC llr1+llr2 / AltMRC llr1+llr2 / AltJoint llr1+llr2 have similar performances. AltSC llr1+llr2 and AltJoint llr1+llr2 perform slightly better than the other schemes, and there is almost no impact from the bad channel.

[0120] Note: In scenario 3, SC llr2 has better performance, reaching the performance of AltJoint llr1+llr2. In actual simulation, channel mode 1 and channel mode 2 are used for simulation separately, and the degraded channel is channel model 2. However, in actual engineering, it is difficult for the receiver to choose to use data on channel mode 1 or channel mode 2. If a merging method is used, it is difficult to determine when to use the data on the two channels for independent decoding or combined decoding, but the AltJoint llr1+llr2 decoding method used in the present invention does not have these problems.

[0121] The simulation of the above three scenarios is summarized as shown in Table 3.

[0122] Table 3 Comparison of three channel scenarios

[0123]

[0124] From the above analysis, it can be seen that in the configuration of channel model 1 and channel model 2, if the channel environment of channel model 1 and channel model 2 is relatively good, that is, scenario 1 and scenario 2, no matter which diversity mode is used, the performance can be improved, among which MRC llr1+llr2 and EGC llr1+llr2 have the best merging performance. However, these two merging modes will affect the final decoding performance in scenario 3, that is, when one channel deteriorates. The AltJoint llr1+llr2 method provided by the present invention fully considers the diversity merging and the relative independence of the two channels during the decoding process, and has good performance even in scenario 3.

[0125] In this embodiment, the simulation method is adopted to implement without considering the implementation complexity, so the LDPC channel decoder 1 and the LDPC channel decoder 2 are implemented by two independent modules. In actual engineering, since the LDPC channel decoder 1 and the LDPC channel decoder 2 have exactly the same structure, a set of circuits can be used to save hardware resources.

[0126] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solution, which should be included in the scope of the claims of the present invention.

Claims

1. A channel-level joint decoder for repeated coding blocks, characterized in that: The hierarchical joint decoder is composed of two identical channel decoder modules, a bit hard decision module, a check check module, a check determination module and a continuous iteration module; The channel decoder module is composed of two identical channel decoders 1 and 2, which respectively process log-likelihood ratio LLR data blocks from channel demodulation of different physical layer resource blocks; Channel decoder 1 and channel decoder 2 output two kinds of information, internal information Le and external information Lex; channel decoder 1 uses the external information of channel decoder 2 for decoding, and channel decoder 2 uses the external information of channel decoder 1 for decoding; The bit hard decision module combines the log-likelihood ratio of the received data block with the internal information, and then performs bit hard decision to obtain a received bit data stream; The bit hard decision consists of two identical modules, which process the data from channel decoder 1 and channel decoder 2 in a distributed manner; The verification and checking module performs a cyclic verification and checking on the bit data streams from the bit hard decision module and the combined bit hard decision module; The verification and determination module determines whether the hierarchical joint decoder correctly decodes the data block sent by the sending end; The continuing iteration module determines whether to exit the iteration process according to the verification result. If the verification determines that the received bit data block is verified correctly or the number of decoding iterations reaches the maximum value, the decoding process of the hierarchical joint decoder is exited, otherwise the next round of decoding process is started; The decoding method based on the hierarchical joint decoder comprises the following steps: Step 1: The receiving end receives data from two different physical resource blocks, demodulates the data to obtain the log-likelihood ratios of the two data blocks, denoted as LLR1 and LLR2; the initial values ​​of the internal information and external information of the channel decoder are set to 0; Step 2: LLR1 and LLR2 are sent to two channel decoders 1 and 2 of the hierarchical joint decoder respectively. The channel decoders output their own external information data blocks and internal information data blocks respectively, and the external information data block of channel decoder 1 is sent to channel decoder 2, and the external information data block of channel decoder 2 is sent to channel decoder 1; Step 3: Accumulate and combine the internal information data block and the log-likelihood ratio data block output by channel decoder 1 and channel decoder 2, and then perform hard decision to obtain a decoded bit data stream; Accumulating the log-likelihood ratio data blocks and internal information of channel decoder 1 and channel decoder 2, and performing hard decision to obtain a decoded bit data stream; Step 4: The bit data stream of the hard decision is checked. If only one channel of data is checked correctly, the decoding is completed and the bit data stream of this channel is the final bit data stream of the decoding. Step 5: The bit data stream of the hard decision is verified. If the data checks from the bit hard decision and the combined bit hard decision are not correct and the number of iterations has not reached the maximum number, the next round of iterative decoding process is started.