A communication system, method and device
By employing parallel column-by-column and row-by-row layered decoding methods, combined with LDPC encoding and row-column interleaving techniques, the problem of low efficiency in block LDPC decoding is solved, achieving a highly efficient decoding process.
Patent Information
- Application Number
- CN202510631885.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-15
- Publication Date
- 2026-11-17
AI Technical Summary
The existing block LDPC decoding efficiency is low and urgently needs to be improved.
Parallel column-level and row-level decoding methods are employed, combined with LDPC encoding and row-column interleaving techniques, to generate parallel codewords. Decoding efficiency is improved through sliding window iterative decoding.
It improves the efficiency and parallelism of LDPC decoding, reduces decoding latency, and ensures the effectiveness and efficiency of the decoding process.
Smart Images

Figure CN123122564A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of LDPC, and more particularly to a communication system, method, and apparatus. Background Technology
[0002] Low-density parity-check (LDPC) codes are a channel coding scheme very close to the Shannon limit, characterized by high performance and low complexity. They have been selected by the 3rd Generation Partnership Project (3GPP) as the coding and decoding scheme for data channels in 5G communication. Currently, the decoding efficiency of block LDPC is relatively low, and there is an urgent need to find a more efficient method for LDPC decoding. Summary of the Invention
[0003] This application provides a communication system, method, and device for improving LDPC encoding and decoding efficiency.
[0004] In a first aspect, embodiments of this application provide a communication system, which includes a first device and a second device. Here, the first device is described as an encoding device and the second device is a decoding device.
[0005] The first device is capable of encoding the sequence to be transmitted, generating an encoded sequence containing multiple codewords. Taking the generation of two codewords in the encoded sequence as an example, the first device generates a first codeword based on a first sequence and a second sequence, and generates a second codeword based on a second sequence and a third sequence. The first codeword and the second codeword are two adjacent codewords, and the first device sends the first codeword and the second codeword to the second device.
[0006] After receiving the first codeword and the second codeword, the second device performs at least one iterative decoding on the first codeword and the second codeword. Each iterative decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword, that is, performing column-by-column layer-by-layer decoding on each code block in parallel. After completing the I-th layer decoding on each code block in the first codeword, the device starts row-by-row layer-by-row decoding on the I-th code block in the second codeword, where I is a positive integer.
[0007] Through the aforementioned system, from a decoding perspective, the second device can perform column-by-column layer-by-layer decoding of each code block of the first codeword in parallel during the decoding process, ensuring the decoding efficiency of the first codeword. Furthermore, once the same layer of decoding for each code block of the first codeword is completed, row-by-row layer-by-layer decoding of a specific code block in the second codeword can be initiated. The decoding of the second codeword does not require waiting for all code blocks of the first codeword to complete column-by-column layer-by-layer decoding; the decoding process of the second codeword can begin as soon as the same layer of decoding for each code block is completed. The decoding of the second codeword and the first codeword can proceed almost synchronously, improving the parallelism on the decoding side and ensuring decoding efficiency.
[0008] From an encoding perspective, since the first and second codewords use the same sequence (i.e., the second sequence) in their generation, there is a correlation between them. This ensures that while some decoding operations on the first codeword are completed on the decoding side, some decoding operations on the second codeword can be performed, thus guaranteeing decoding efficiency.
[0009] In one possible implementation, when generating the first codeword, the first device performs LDPC encoding on the first sequence to generate a first intermediate sequence, and performs row-column interleaving on the first intermediate sequence to generate a first interleaved sequence; for the second sequence, the first device performs LDPC encoding on the second sequence to generate a second intermediate sequence. The first device generates the first codeword based on the first interleaved sequence and the second intermediate sequence.
[0010] Using the aforementioned system, the first device performs LDPC encoding on the first and second sequences to ensure that the codewords contain sequence-related check bits. By performing simple row-column interleaving on the first intermediate sequence, a first interleaved sequence is quickly obtained. The first device then obtains a first codeword based on the second intermediate sequence and the first interleaved sequence, such that the first codeword simultaneously carries the relevant information of both the first and second sequences.
[0011] In one possible implementation, when generating the second codeword, the first device performs row-column interleaving on the second intermediate sequence to obtain a second interleaved sequence, performs LDPC encoding on the third sequence to obtain a third intermediate sequence, and then generates the second codeword based on the second interleaved sequence and the third intermediate sequence.
[0012] Using the aforementioned system, the first device performs LDPC encoding on the second and third sequences to ensure that the codewords contain sequence-related check bits. By performing simple row-column interleaving on the second intermediate sequence, a second interleaved sequence is quickly obtained. The first device then obtains a second codeword based on the third intermediate sequence and the second interleaved sequence, ensuring that the second codeword simultaneously carries information from both the second and third sequences.
[0013] In one possible implementation, after the second device completes the I-th layer decoding of each code block in the first codeword, it obtains a first posterior log-likelihood ratio vector. Since a second interleaving sequence is used in the generation of the second codeword, the second device passes the first posterior log-likelihood ratio vector to the I-th code block in the second codeword and then initiates row-by-row layered decoding of the I-th code block in the second codeword.
[0014] Through the above system, after a certain layer of decoding of the first codeword is completed, the first posterior log-likelihood ratio vector related to the second interleaved sequence can be obtained and passed to a certain code block of the second codeword to correct the probability of 1 or 0 on the code bits in the code block. Based on this, the code block is decoded in a row-by-row manner, which can both ensure the effectiveness of code block decoding and improve the efficiency of code block decoding.
[0015] In one possible implementation, after the second device completes the row-by-row layered decoding of the I-th code block in the second codeword, it can obtain a second posterior log-likelihood ratio vector. This second posterior log-likelihood ratio vector is then passed to the I-th layer of each code block in the first codeword.
[0016] Through the above system, after completing a certain code block of the second codeword, a second posterior log-likelihood ratio vector related to the second interleaving sequence can be obtained. This second posterior log-likelihood ratio vector is passed to the I-th layer of each code block of the first codeword, which can correct the probability of 1 or 0 at the code bits of the I-th layer of each code block, thus preparing for the next iteration.
[0017] In one possible implementation, after the second device performs column-by-column layer-by-layer decoding on each code block in the first codeword, it obtains decision information indicating a second sequence error generated after decoding the first codeword, and then initiates the next iteration of decoding.
[0018] The system described above, after the first codeword is decoded, initiates the next iteration based on the decision information to ensure that the correct second sequence can be obtained through decoding.
[0019] In one possible implementation, the first device sends an encoded sequence, which includes multiple codewords, wherein the first codeword and the second codeword are two adjacent codewords among the multiple codewords.
[0020] The second device decodes the encoded sequence using a sliding window approach. That is, each decoding operation decodes only the codewords within the sliding window. After decoding the codewords within the window, the window is moved, with the movement measured in steps. After moving the window, decoding continues for the codewords within it. The window size is two codewords, and the step size is one codeword. The second device performs at least one iterative decoding of the first and second codewords, while covering them with the sliding window.
[0021] The above system, which uses a sliding window decoding method, ensures that the second device can obtain an original sequence, such as the second sequence, when decoding every two codewords in the encoded sequence.
[0022] Secondly, this application also provides a communication method, which can be executed by a first device. The beneficial effects can be found in the relevant description of the first aspect, and will not be repeated here. In this method: the first device can encode multiple sequences to generate various codewords in the encoded sequence. Here, the generation of the first codeword and the second codeword in the encoded sequence is taken as an example for explanation.
[0023] The first device generates a first codeword based on the first sequence and the second sequence; generates a second codeword based on the second sequence and the third sequence; after generating the first codeword and the second codeword, the first device sends the first codeword and the second codeword to the second device.
[0024] In one possible implementation, when generating the first codeword, the first device generates the first codeword based on a first interleaving sequence and a second intermediate sequence, wherein the first interleaving sequence is generated by row-column interleaving of the first intermediate sequence, the first intermediate sequence is generated by LDPC encoding of the first sequence, and the second intermediate sequence is generated by LDPC encoding of the second sequence.
[0025] In one possible implementation, when generating the second codeword, the second device generates the second codeword based on the second interleaving sequence and the third intermediate sequence, wherein the second interleaving sequence is generated by row-column interleaving of the second intermediate sequence, the second intermediate sequence is generated by LDPC encoding of the second sequence, and the third intermediate sequence is generated by LDPC encoding of the third sequence.
[0026] In one possible implementation, the first device sends an encoded sequence, which includes multiple codewords, wherein the first codeword and the second codeword are two adjacent codewords among the multiple codewords.
[0027] Thirdly, embodiments of this application also provide a communication method, which can be executed by a second device. The beneficial effects are described in the relevant section of the first aspect and will not be repeated here. In this method: the second device receives a first codeword and a second codeword, and performs at least one iterative decoding on the first codeword and the second codeword.
[0028] Each iteration of decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword; and, after the I-th layer of decoding on each code block in the first codeword is completed, starting row-by-row layer-by-layer decoding on the I-th code block in the second codeword, where I is a positive integer.
[0029] In one possible implementation, after the second device completes the I-th layer decoding of each code block in the first codeword and obtains the first posterior log-likelihood ratio vector, which is then passed to the I-th code block in the second codeword, it initiates row-by-row layer decoding of the I-th code block in the second codeword.
[0030] In one possible implementation, after the second device completes the row-by-row layered decoding of the I-th code block in the second codeword, it obtains the second posterior log-likelihood ratio vector and passes the second posterior log-likelihood ratio vector to the I-th layer of each code block in the first codeword.
[0031] In one possible implementation, after the second device performs column-by-column layer-by-layer decoding on each code block in the first codeword, it obtains decision information indicating a second sequence error generated after decoding the first codeword, and then initiates the next iteration of decoding.
[0032] In one possible implementation, the second device decodes multiple codewords in the encoded sequence using a sliding window. The window size of the sliding window is two codewords, and the step size of the sliding window is one codeword. The first codeword and the second codeword are decoded at least once while the sliding window covers the first codeword and the second codeword.
[0033] Fourthly, embodiments of this application also provide an encoding device that has the function of implementing the behavior in the method example of the second aspect described above. The beneficial effects can be found in the description of the first aspect and will not be repeated here. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the encoding device includes a generation module and a transmission module. These modules can perform the corresponding functions in the method example of the second aspect described above; see the detailed description in the method example for details, which will not be repeated here.
[0034] Fifthly, embodiments of this application also provide a decoding apparatus that has the function of implementing the behavior in the method example of the third aspect described above. The beneficial effects can be found in the description of the first aspect and will not be repeated here. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the decoding apparatus includes a decoding module, an action module, and a decision module. These modules can execute the corresponding functions in the method example of the first aspect described above, as detailed in the method example, and will not be repeated here.
[0035] Sixthly, this application also provides a computing device, which includes a processor and a memory, and may further include a communication interface. The processor executes computer program instructions in the memory to perform the method provided by the second aspect or any possible implementation thereof. Alternatively, the processor executes computer program instructions in the memory to perform the method provided by the third aspect or any possible implementation thereof. The memory is coupled to the processor and stores computer program instructions and data necessary for determining data transmission. The communication interface is used for communicating with other devices.
[0036] Seventhly, this application also provides a computing device, which includes a memory and a processor, and optionally, a communication interface. The memory is coupled to the processor and stores computer program instructions and data required for file access. The processor executes the method provided in the second aspect or any possible implementation thereof; or executes the method provided in the third aspect or any possible implementation thereof. The communication interface is used for communicating with other devices.
[0037] Eighthly, this application provides a computing device system including at least one computing device. Each computing device includes a memory and a processor. The processor of at least one computing device is configured to access code in the memory to execute the method provided by the second aspect or any possible implementation thereof, or the processor of at least one computing device is configured to access code in the memory to execute the method provided by the third aspect or any possible implementation thereof.
[0038] Ninthly, this application provides a computer-readable storage medium that, when executed by a computing device, allows the computing device to perform the method provided in the second aspect or any possible implementation thereof, or to perform the method provided in the third aspect or any possible implementation thereof. The storage medium stores computer program instructions. The storage medium includes, but is not limited to, volatile memory, such as random access memory, and non-volatile memory, such as flash memory, hard disk drive (HDD), and solid-state drive (SSD).
[0039] Tenthly, this application provides a computer device program product, which includes computer program instructions. When executed by a computing device, the computing device performs the method provided in the second aspect or any possible implementation thereof, or performs the method provided in the third aspect or any possible implementation thereof. The computer program product can be a software installation package. When it is necessary to use the method provided in the second aspect or any possible implementation thereof, or when it is necessary to use the method provided in the third aspect or any possible implementation thereof, the computer program product can be downloaded and executed on the computing device.
[0040] In the eleventh aspect, this application also provides a computer chip connected to a memory, the chip being used to read and execute computer program instructions stored in the memory, to execute the methods in the second aspect and various possible implementations of the second aspect, or to execute the methods in the third aspect and various possible implementations of the third aspect.
[0041] The technical effects that can be achieved in the second to eleventh aspects mentioned above are described in the description of the technical effects that can be achieved by the corresponding design schemes in the first aspect mentioned above, and will not be repeated here. Attached Figure Description
[0042] Figure 1 A schematic diagram of the structure of a communication system provided in this application;
[0043] Figure 2 A schematic diagram of another communication system provided in this application;
[0044] Figure 3 A schematic diagram of a communication method structure provided in this application;
[0045] Figure 4 A schematic diagram of row and column interleaving operation provided in this application;
[0046] Figure 5 A schematic diagram of a communication method provided in this application;
[0047] Figure 6 A decoding regularity diagram provided for this application;
[0048] Figures 7-9 This application provides a schematic diagram comparing the performance of the layered decoding method with that of block LDPC.
[0049] Figure 10 A schematic diagram illustrating the lower bound performance of the hierarchical decoding method provided in this application;
[0050] Figure 11A performance diagram of the decoding method provided in this application after quantization;
[0051] Figure 12 This is a schematic diagram of the structure of an encoding device provided in an embodiment of this application;
[0052] Figure 13 This is a schematic diagram of the structure of a decoding device provided in an embodiment of this application;
[0053] Figures 14-15 This is a schematic diagram of the structure of a computing device provided in an embodiment of this application. Detailed Implementation
[0054] like Figure 1 The diagram shows a communication system provided in an embodiment of this application. This communication system includes multiple devices that can transmit data between each other. For ease of explanation, the first device 10 and the second device 20 are used as examples. In this embodiment, the first device 10 is the data sender, and the second device 20 is the data receiver.
[0055] Data sender: First device 10.
[0056] Before sending data to the second device 20, the first device 10 needs to encode the data to be sent, and then send the encoded data to the second device 20. The purpose of encoding is to ensure the security of the data to be sent, and to generate a check bit for the data to be sent. When the data is transmitted to the second device 20, it may change due to noise interference. The check bit can be used to verify and correct the data.
[0057] The data to be sent can exist in the form of a sequence, such as a sequence containing several 0s and / or 1s. In this embodiment, the sequence is called a source sequence, which includes multiple elements. The source sequence represents the raw data that needs to be transmitted to the second device 20 and has not undergone encoding processing. For the first device 10, there may be more than one source sequence, that is, the first device 10 needs to send multiple source sequences to the second device 20, such as the first sequence, second sequence, third sequence, etc. mentioned in this embodiment.
[0058] The first device 10 encodes multiple source sequences to generate an encoded sequence, which includes one or more codewords (such as the first codeword and the second codeword mentioned in the embodiments of this application). Each codeword is generated based on two source sequences from the multiple source sequences, and each codeword is also a sequence, such as a sequence containing several 0s and / or 1s.
[0059] When generating a codeword, the first device 10 generates the codeword based on the interleaving sequence corresponding to one source sequence and the LDPC sequence corresponding to another source sequence. The LDPC sequence corresponding to the source sequence is formed by performing LDPC encoding on each subsequence of the source sequence, and the interleaving sequence corresponding to the source sequence is formed by performing row-column interleaving on the LDPC sequence corresponding to the source sequence.
[0060] The first device 10 uses basic LDPC encoding and row-column interleaving operations when generating the encoded sequence. This encoding method is simple, convenient, and has high encoding efficiency.
[0061] Data receiver: Second device 20.
[0062] For the second device 20, the data received from the first device 10 is an encoded sequence that has undergone encoding processing. This encoded sequence is not the same as the multiple source sequences. The second device 20 needs to "translate" the multiple source sequences from the encoded sequence through decoding.
[0063] When decoding the encoded sequence, the second device 20 can use sliding window decoding to decode the codewords in the encoded sequence one by one. The window size of the sliding window is equal to two codewords. That is, the second device 20 decodes based on two codewords within the sliding window each time to obtain a source sequence. After the decoding is completed, the sliding window is moved by one codeword, and then decoding is performed again based on the two codewords within the sliding window to obtain the next source sequence.
[0064] The decoding process of the second device 20 based on the two codewords within the sliding window is as follows:
[0065] The second device 20 performs multiple iterations. In each iteration: the second device 20 decodes each code block in the previous codeword in parallel, column-wise. It then applies the first posterior log-likelihood ratio vector obtained after the I-th layer decoding of each code block in the previous codeword to the I-th code block of the second codeword. The first posterior log-likelihood ratio vector is the posterior log-likelihood ratio vector obtained after the I-th layer decoding of each code block in the previous codeword. After passing the first posterior log-likelihood ratio vector to the I-th code block of the second codeword, the second device 20 performs row-wise decoding of the I-th code block in the second codeword to obtain the second posterior log-likelihood ratio vector. The second posterior log-likelihood ratio vector is the posterior log-likelihood ratio vector obtained after row-wise decoding of the I-th code block. If the decision information obtained from the column-wise column-wise decoding of each code block in the previous codeword indicates the correctness of the generated source sequence, the iteration stops; otherwise, the next iteration begins.
[0066] During the decoding process, the second device 20 can perform column-by-column layer-by-layer decoding on each code block of the previous codeword in parallel. After the I-th layer of decoding for each code block in the first codeword is completed, the first posterior log-likelihood ratio vector can be applied to the I-th code block of the next codeword. Row-by-row layer-by-layer decoding for this I-th code block can then begin. That is, during the decoding of two codewords within the sliding window, the decoding processes of the two codewords are not sequential but can be executed in parallel. The decoding process of the next codeword only starts slightly later than that of the previous codeword. In other words, as soon as the same layer of decoding for each code block in the previous codeword is completed, the decoding process for the corresponding code block in the next codeword can begin. This parallel decoding method improves decoding efficiency and reduces latency.
[0067] This application does not limit the specific form or deployment location of the first device 10 and the second device 20, such as Figure 2 As shown, this application's embodiments utilize the architecture of another communication system. Figure 2 The communication system 1000 shown includes a wireless access network 100 and a core network 200. Optionally, the communication system 1000 also includes an Internet 300. The wireless access network 100 may include at least one network device (such as...). Figure 2 110a and 110b in the above), may also include at least one terminal device (such as Figure 2 (e.g., 120a-120j). Terminal devices connect to network devices wirelessly, and network devices connect to the core network wirelessly or via wired connections. Core network devices and network devices can be independent physical devices, or they can integrate the functions of core network devices and the logical functions of network devices onto the same physical device, or a single physical device can integrate some core network device functions and some network device functions. Terminal devices and network devices can be interconnected via wired or wireless connections. Figure 2 This is just an illustration; the communication system may also include other network devices, such as wireless repeaters and wireless backhaul devices. Figure 2 It is not shown in the middle.
[0068] Network equipment is an access device that allows terminal devices to connect to a communication system via wired or wireless means. Network equipment can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in 5G mobile communication systems, a next-generation base station in 6G mobile communication systems, a base station in a future mobile communication system, or an access node in a WiFi system; it can also be a module or unit that performs some of the functions of a base station, for example, a central unit (CU), a distributed unit (DU), or a radio unit (RU). Network equipment can also be a macro base station (such as...). Figure 2 110a in the text), can also be a micro base station or an indoor station (such as... Figure 2 In 110b), it can also be a relay node or a donor node, etc. The embodiments of this application do not limit the specific technology or device form used in the network equipment.
[0069] A terminal device is a device with wireless transceiver capabilities, capable of sending signals to or receiving signals from network devices. Terminal devices include, but are not limited to, terminal equipment, user equipment (UE), mobile stations, and mobile terminals. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, and smart cities. Specifically, a terminal device can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle, aircraft, ship, robot, robotic arm, smart home device, etc. The embodiments of this application do not limit the specific technologies or device forms used in the terminal devices.
[0070] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.
[0071] The roles of network devices and terminal devices can be relative, for example, Figure 2 The helicopter or drone 120i can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device, meaning that 110a and 120i communicate via a wireless air interface protocol. Alternatively, 110a and 120i can also communicate via a network device-to-network device interface protocol; in this case, 120i is also a network device relative to 110a.
[0072] Communication between network devices and terminal devices, between network devices, and between terminal devices can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.
[0073] Figure 2 Any of the network devices and terminal devices shown can be used as the first device 10 to communicate with other devices in the communication system, encode the data to be sent, generate an encoded sequence, and send the encoded sequence to other devices. Figure 2 Any of the network devices and terminal devices shown can also serve as a second device 20 to communicate with other devices in the communication system, obtain the encoded sequences sent by other devices, decode the received encoded sequences, and obtain one or more source sequences.
[0074] like Figure 3The diagram illustrates a communication method provided in this application embodiment. In this method, a first device 10 acts as the data sender, and a second device 20 acts as the data receiver. The method mainly includes two parts. One part involves the encoding process of the source sequence to be generated by the first device 10. In this embodiment, the generation of two adjacent codewords (the first codeword and the second codeword) in the encoded sequence is used as an example, as detailed in steps 301 to 302. The other part involves the decoding process of the encoded sequence by the second device 20. In this embodiment, the decoding of two adjacent codewords (the first codeword and the second codeword) in the encoded sequence is used as an example, as detailed in step 304.
[0075] Step 301: The first device 10 generates the first codeword.
[0076] The first codeword is generated based on two source sequences to be sent. To facilitate the distinction between these two source sequences, they are referred to as the first sequence and the second sequence, respectively.
[0077] The process by which the first device 10 generates the first codeword is as follows:
[0078] Step 3011: The first device 10 pairs the first sequence u (1) Perform LDPC encoding to obtain the first intermediate sequence v (1) Among them, the first sequence u (1) Including B subsequences Where i is a positive integer not less than 0 and less than B, and each subsequence The length is k, meaning it includes k bits. The first sequence belongs to a Bn-dimensional linear space of a finite field (the number of elements in the finite field is 2), that is... First intermediate sequence v (1) A subsequence Subsequence of the first sequence Obtained after LDPC encoding. Each subsequence. The length is n, that is, it includes n bits, the first intermediate sequence
[0079] Wherein, LDPC encoding satisfies: C(s) = sG, where s represents the sequence to be encoded, G is the generator matrix, and C(s) is the sequence generated after LDPC encoding. In this embodiment, each subsequence of the first sequence is LDPC encoded to obtain the second intermediate sequence. and subsequence satisfy:
[0080] Step 3012: First device 10 pairs the first intermediate sequence v (1) Perform row-column interleaving operation Π to obtain the first interleaving sequence w. (1) , The row-column interleaving operation Π is used to arrange the bits in the first intermediate sequence row by row and then read the bits column by column. In the embodiments of this application, the symbol "Π" is used to represent the row-column interleaving operation.
[0081] Here we combine Figure 4 The implementation process of row-column interleaving operation is introduced as follows:
[0082] like Figure 4 As shown, the first intermediate sequence First intermediate sequence v (1) It is a long sequence containing multiple subsequences.
[0083] First, the first intermediate sequence v (1) The B subsequences are arranged in a column, with each subsequence occupying a separate row, thus forming a matrix with B rows and n columns.
[0084] Next, starting from the first column of the matrix, read the bits of each column sequentially until the last column is read. The read bits are sorted according to the order of reading, and the sorted sequence is the first interleaving sequence w. (1) .
[0085] First interlacing sequence w (1) Including B subsequences Where i is a positive integer not less than 0 and less than B, and each subsequence The length is n, meaning it includes n bits. The first interleaved sequence Each subsequence Each subsequence is related to every subsequence in the first intermediate sequence. Includes the first intermediate sequence v (1) One or more bits in each subsequence.
[0086] Step 3013: First device 10 pairs with second sequence u (2) Perform LDPC encoding to obtain the second intermediate sequence v (2) The second sequence includes B subsequences. Where i is a positive integer not less than 0 and less than B, the second sequence Second intermediate sequence v (2) A subsequence For the second sequence u (2) subsequence of Obtained after LDPC encoding. Each subsequence. The length of the second intermediate sequence is n.
[0087] For details on LDPC encoding, please refer to the relevant explanation in step 3011, which will not be repeated here. Subsequence and subsequence satisfy:
[0088] Step 3014: The first device 10, according to the first interleaving sequence w (1) The first codeword C1 is generated by combining the second intermediate sequence with the second intermediate sequence.
[0089] Step 302: The first device 10 generates the second codeword.
[0090] The second codeword is the first codeword sent after the first codeword; that is, the first and second codewords are two adjacent codewords in the encoded sequence. This second codeword is generated based on the two source sequences to be sent. For ease of distinction, these two source sequences are referred to as the second sequence and the third sequence, respectively. In other words, there are currently three source sequences to be sent: the first sequence, the second sequence, and the third sequence. The first codeword (the one to be sent) can be generated from the first two sequences, and the second codeword (the one to be sent) can be generated from the last two sequences.
[0091] The process by which the first device 10 generates the second codeword is as follows:
[0092] Step 3021: First device 10 pairs the second intermediate sequence v (2) Perform row and column interleaving operations to obtain the second interleaved sequence w. (2) , For an explanation of row and column interleaving operations, please refer to the previous explanation, which will not be repeated here.
[0093] Second interleaving sequence w (2) Including B subsequences Where i is a positive integer not less than 0 and less than B, and each subsequence The length is n. The second interleaving sequence. Each subsequence Each subsequence is related to the second intermediate sequence. Includes the second intermediate sequence v (2) One or more bits in each subsequence.
[0094] Step 3022: First device 10 pairs with third sequence u (3) Perform LDPC encoding to obtain the third intermediate sequence v (3) The third sequence includes B subsequences. Where i is a positive integer not less than 0 and less than B, and the third sequence Third intermediate sequence v (3) A subsequence For the second sequence u (3) subsequence of Obtained after LDPC encoding. Each subsequence. The length of the second intermediate sequence is n.
[0095] For details on LDPC encoding, please refer to the relevant explanation in step 3011, which will not be repeated here. Subsequence and subsequence satisfy:
[0096] Step 3023: The first device 10, according to the second interleaving sequence w (2) With the third intermediate sequence v (3) Generate the second codeword C2.
[0097] Step 303: The first device 10 sends the first codeword and the second codeword.
[0098] Following the aforementioned method, the first device 10 can convert multiple source sequences into multiple codewords. These multiple codewords can constitute an encoded sequence, which the first device 10 can then transmit. Figure 3 The embodiments shown only illustrate the first and second codewords in the transmitted encoded sequence.
[0099] When the first device 10 performs step 303, it can send one codeword after each codeword is generated. Alternatively, the first device 10 can send each codeword sequentially after all codewords have been generated.
[0100] Step 304: The second device 20 receives the first codeword and the second codeword, and calls the belief propagation algorithm to decode the first codeword and the second codeword to obtain the second sequence.
[0101] Before introducing the decoding process, let's first introduce the concept of the parity check matrix H. The parity check matrix H and the generator matrix G have a one-to-one correspondence, and the parity check matrix H and the generator matrix G satisfy: G T H = 0, where G T Let G be the transpose of G.
[0102] On the decoding side (e.g., the second device 20), the parity check matrix H is used to verify the encoded sequence C(t). The parity check matrix H and the correct encoded sequence C(t) satisfy: HC(t) T =0, where C(t) T HC(t) is the transpose of C(t). T=0 is also called the check equation system, namely HC(t). T =0 contains multiple check equations, each check equation being a row of elements of H and C(t). T The operational equation.
[0103] At the beginning of decoding, first determine HC(t). T If the condition is not met (=0), it means that the received encoded sequence C(t) has changed during transmission, and the values of each element in C(t) need to be adjusted until HC(t) is reached. T =0 is true.
[0104] When decoding the first codeword and the second codeword, the second device 20 needs to perform at least one iterative decoding. The process of each iterative decoding is as follows:
[0105] Step 3041: The second device 20 performs column-by-column layer-by-layer decoding on each code block in the first codeword in parallel to obtain decision information. The decision information is used to indicate whether the second sequence generated after decoding the first codeword is correct. If the decision information indicates that the second sequence generated after decoding the first codeword is correct, the iterative decoding stops. Otherwise, proceed to step 3042.
[0106] When performing step 3041, the second device 20 needs to extract multiple code blocks from the first codeword. As can be seen from the generation process of the first codeword, it is generated based on the first interleaving sequence and the second intermediate sequence. When extracting multiple code blocks from the first codeword, the second intermediate sequence is obtained based on the first codeword and the first interleaving sequence. This second intermediate sequence includes multiple code blocks. These multiple code blocks are implicit in the first codeword; therefore, they can be considered as multiple code blocks of the first codeword. After extracting the multiple code blocks, the second device 20 can perform column-by-column layer-by-layer decoding on each code block in parallel.
[0107] Column-wise layered decoding is a decoding method in LDPC layered decoding. When performing column-wise layered decoding on any code block in the first codeword, the code block is divided into multiple layers with the columns of the parity check matrix as the granularity. Each layer may include one or more columns of the parity check matrix. Each layer of the codeword is decoded sequentially. When decoding any layer of the codeword, that layer is treated as the data to be decoded.
[0108] For example, suppose the parity-check matrix of each code block in the first codeword contains n columns. These n columns are divided into B layers, so each layer contains n / B columns, where n and B are both positive integers. The first layer of each code block in the first codeword is decoded in parallel. After decoding the first layer of all code blocks of the first codeword as data to be decoded, the second layer of each code block in the first codeword is decoded in parallel, until all layers of each code block of the first codeword are decoded.
[0109] Since each code block in the first codeword is independent of each other, the second device 20 can perform column-by-column layer-by-layer decoding on each code block of the first codeword in parallel.
[0110] In other words, column-by-column layer-by-layer decoding is performed at the layer level. After decoding one layer, the next layer is decoded. Here is a simplified description of the process of column-by-column layer-by-layer decoding of a code block:
[0111] Step S1: Initially, configure the log-likelihood ratio (LLR). The log-likelihood ratio is used to characterize the probability of different values of a certain code point in the encoded sequence. The value of the log-likelihood ratio is the logarithm of the probability ratio, where the probability ratio is the ratio of the probability of the element being 1 to the probability of it being 0.
[0112] Step S2: Calculate the variable matrix M based on the verification matrix H, and update the elements in the verification matrix H using the log-likelihood ratio. The updated verification matrix H is the variable matrix M. For example, the log-likelihood ratio can be used to replace the elements with a value of 1 in the verification matrix. In this way, each non-zero element of the probability matrix can represent the log-likelihood ratio of each bit.
[0113] When decoding any layer of a code block, each element of that layer is used as a code bit (each code bit is one bit) in the sequence to be decoded, and steps S3 to S4 are executed.
[0114] Step S3: Update the variable matrix M according to the constraints of the parity check equation H. As explained above, each row of the parity check matrix H represents a parity check equation, and each row constrains the relevant code points in the sequence to be decoded. Therefore, by combining the constraints of the parity check equation, the log-likelihood value of each element in the current layer of the variable matrix M is corrected, thereby updating the matrix.
[0115] Step S4: Generate the posterior log-likelihood ratio vector based on the variable matrix M and the initial log-likelihood ratio. Assuming that in step S2, the log-likelihood ratio is used to replace the elements with a value of 1 in the verification matrix, in step S4, for each column of the probability matrix E, the elements in that column are summed and then added to the log-likelihood ratio to obtain the posterior log-likelihood ratio vector.
[0116] The posterior log-likelihood ratio vector contains multiple elements, each corresponding to a code point in the sequence to be decoded, and the value of each element represents the logarithm of the probability ratio between 1 and 0 for the corresponding code point.
[0117] For each layer of the code block, execute steps S3 to S4 to obtain the posterior log-likelihood ratio vector corresponding to each layer. Then, execute step S5.
[0118] Step S5: Decision is made on the code block based on the posterior log-likelihood ratio vector corresponding to each layer. The values of each code bit in the code block are corrected based on the posterior log-likelihood ratio vector. The modified code block is then input into the parity check equation to determine if the equation holds true. If it does not hold true, the corrected sequence is not a correct code block, and the next iteration is performed. That is, steps S3 to S4 are continued for each layer of the code block. In the next iteration, the variable matrix needs to be updated based on the posterior log-likelihood ratio vector obtained in the previous iteration. If the equation holds true, the modified sequence is a correct code block.
[0119] Step 3042: The second device 20 transmits the first posterior log-likelihood ratio vector obtained after decoding the first layer of each code block in the first codeword to the first code block of the second codeword.
[0120] The posterior log-likelihood ratio vector obtained by decoding the I-th layer of each code block in the first codeword (here, for ease of distinction, the posterior log-likelihood ratio vector obtained after decoding the I-th layer is referred to as the first posterior log-likelihood ratio vector) represents the probability that the I-th layer of each code block in the first codeword takes a value of 0 or 1. Processing this first posterior log-likelihood ratio vector further yields first probability information, which is used to characterize the ratio of the probability of each element in the third intermediate sequence of the second codeword taking a value of 1 to 0.
[0121] Based on the generation process of the second codeword, it can be seen that the second codeword is related to the second interleaved sequence and the third intermediate sequence. The posterior log-likelihood ratio vector of the second interleaved sequence implicitly contains the first probability information. The first probability information is used to characterize the ratio of the probability of each element in the third intermediate sequence taking the value 1 to 0.
[0122] After obtaining the first posterior log-likelihood ratio vector, the second device 20 performs an information transfer operation on the first posterior log-likelihood ratio vector to extract first probability information. This information transfer operation is related to the process of extracting a third intermediate sequence from the second codeword using the second interleaving sequence.
[0123] For example, during the generation of the second codeword, the second interleaved sequence and the third intermediate sequence are XORed and superimposed. Therefore, the first probability information of the first layer can be calculated using the log-likelihood ratio vector of the second codeword and the first posterior log-likelihood ratio vector of the first layer decoding output of the second intermediate sequence of each code block in the first codeword.
[0124] Step 3043: After the second device 20 transmits the first posterior log-likelihood ratio vector to the I-th code block of the second codeword, the second device 20 performs row-by-row layered decoding on the I-th code block of the second codeword to obtain the second posterior log-likelihood ratio vector.
[0125] After obtaining the first probability information and applying the first probability information to the I-th code block of the second codeword, the second device 20 obtains the log-likelihood ratio of the I-th code block of the second codeword. The second device 20 can then begin to perform row-by-row layered decoding on the I-th code block of the second codeword.
[0126] For the second codeword, the second codeword is generated based on the second interleaving sequence and the third intermediate sequence. Similar to the first codeword, the third intermediate sequence can be extracted from the second codeword using the second interleaving sequence (which can be determined based on the second sequence obtained after decoding the first codeword). The third intermediate sequence contains multiple code blocks, so the second codeword implicitly contains multiple code blocks of the third intermediate sequence.
[0127] Row-by-row layered decoding refers to dividing the parity check matrix into rows, splitting it into B layers, each layer representing one or more rows of the parity check matrix. Decoding is performed on the I-th code block layer by layer. The decoding process is similar to steps S3-S4, except that here the I-th code block is treated as the sequence to be decoded, whereas in steps S3-S4 each layer of the code block is treated as the sequence to be decoded. Because the parity check matrix is layered, decoding on a layer-by-layer basis allows for updating the variable matrix layer by layer. After updating all layers of the variable matrix, a decision is made on the code block; if the parity check is not met, the next iteration continues. After decoding the I-th code block of the second codeword, a posterior log-likelihood ratio vector is also obtained. For ease of distinction, the posterior log-likelihood ratio vector obtained after decoding the I-th code block of the second codeword is called the second posterior log-likelihood ratio vector. This second posterior log-likelihood ratio vector is used to characterize the probability that each code bit in the I-th code block takes the value of 1 or 0.
[0128] Step 3044: The second device 20 passes the second posterior log-likelihood ratio vector to the I-th layer of each code block in the first codeword.
[0129] After obtaining the second posterior log-likelihood ratio vector, the second device 20 performs an information transfer operation on the second posterior log-likelihood ratio vector to extract second probability information. The second probability information is used to indicate the ratio of the probabilities of each value of 1 and 0 in the second interleaved sequence of the second codeword.
[0130] Similarly, after performing layered decoding on the I-th code block of the second codeword, a posterior log-likelihood ratio vector can be obtained (for ease of distinction, this posterior log-likelihood ratio vector is called the second posterior log-likelihood ratio vector). This second posterior log-likelihood ratio vector indicates the probability that each element in the I-th code block of the second codeword takes the value of 0 or 1. Since the second interleaving sequence is used in the generation of the second code block, the second posterior log-likelihood ratio vector obtained after layered decoding of the I-th code block implicitly contains information characterizing the probability that each element in the second interleaving sequence of the second codeword takes the value of 0 or 1. This information is also a type of probabilistic information. Unlike the first probabilistic information, this information is contained in the second posterior log-likelihood ratio vector obtained after decoding the I-th code block of the second codeword. To distinguish it from the first probabilistic information, this information is called the second probabilistic information, which is the second probabilistic information calculated from the second posterior log-likelihood ratio vector obtained after decoding the I-th code block of the third intermediate sequence in the second codeword.
[0131] After the second device 20 decodes the I-th code block in the second codeword to obtain the second posterior log-likelihood ratio vector, it performs an information transfer operation on the obtained second posterior log-likelihood ratio vector to extract the second probability information. The information transfer operation is related to the process of extracting the second interleaving sequence from the second codeword using the third intermediate sequence.
[0132] For example, during the generation of the second codeword, the second interleaved sequence and the third intermediate sequence are XORed and superimposed. Therefore, the second probability information of the first layer of each code block of the second intermediate sequence in the first codeword can be calculated using the log-likelihood ratio vector of the second codeword and the second posterior log-likelihood ratio vector of the decoded output of the I-th code block of the third intermediate sequence in the second codeword.
[0133] Combining steps 3042 and 3043, it can be seen that once the second intermediate sequence of each code block of the first codeword is decoded at the same level, step 3043 can be initiated to perform row-by-row layered decoding on the corresponding third intermediate sequence of the second codeword. That is, steps 3042 and 3043 can be executed synchronously. Furthermore, in step 3043, the row-by-row layered decoding of each third intermediate sequence can also be performed synchronously, effectively ensuring the high efficiency of decoding.
[0134] The second probability information is applied to the I-th layer of each code block in the first codeword, that is, the ratio of the probability of each element in the I-th layer of each code block in the first codeword taking the value of 0 to 1 is adjusted using the second probability information. After adjustment, the next iteration can be started. This continues until the decision information in step 3041 indicates that the first sequence generated by decoding is correct, or the number of iterations reaches the threshold.
[0135] The following is in conjunction with the appendix Figure 5 The communication method provided in the embodiments of this application will be described. Figure 5 describes the process that the first device 10 encodes a plurality of source sequences to generate encoded sequences, and the second device 20 decodes the encoded sequences. As Figure 5 shown, the method includes:
[0136] Step 501: The first device 10 performs LDPC encoding on each source sequence in the source sequence u.
[0137] The source sequence u includes L source sequences u (t) , where t is an integer and 0≤t<L, that is, the source sequence u=(u (0) ,u (1) ,…,u (L-1) ).
[0138] For any source sequence u (t) , u (t) is divided into B segments each with a length of k, that is using an LDPC encoder to encode into B codewords the codeword is exactly the aforementioned first intermediate sequence or second intermediate sequence, and are concatenated to obtain
[0139] Step 502: Set v (-1) =0, the first device 10 performs a row-column interleaving operation on the codeword v (t-1) to obtain w (t) =v (t -1) Π. For the row-column interleaving operation, reference may be made to the foregoing description, and details are not described herein again.
[0140] Step 503: The first device 10 performs bitwise XOR superposition on w (t) and v (t) to obtain the codeword c corresponding to time t (t) , that is, c (t) =w (t) +v (t) . And c (L) =v (t) Π is used as the last codeword. c (t) is exactly the aforementioned first codeword or second codeword.
[0141] Step 504: The first device 10 sends the encoded sequence C, where C=(c (0) ,c (1) ,…,c (L-1) ,c (L) ).
[0142] Step 505: The second device 20 receives the encoded sequence and decodes each codeword in the encoded sequence C using a sliding window decoding method. The second device 20 decodes based on two codewords within the sliding window each time, obtaining a source sequence. After this decoding is completed, the sliding window is moved one codeword, and decoding is performed again based on the two codewords within the sliding window to obtain the next source sequence.
[0143] Here, we assume that the first of the two codewords in the window is... That is, the code c (t) It consists of B code blocks, each with a length of n. Each codeword... The parity check matrix is divided into L c (L c =Column B). The next codeword is Code c (t+1) It consists of B code blocks, each with a length of n. Each codeword c... i (t+1) The parity check matrix is divided into L r Line (assuming L) r <L c ).
[0144] Execute J on the two codewords within the window. max In the next iteration, when the J-th iteration is performed (J is greater than 0 and less than J), max The process of finding a positive integer is as follows:
[0145] 1. The second device has 20 pairs of the previous codeword c. (t) All code blocks are decoded column-by-column. The second device 20 will decode the previous codeword c. (t) After all code blocks at layer I are decoded, the soft information output by the decoder (i.e., the aforementioned first posterior log-likelihood ratio vector) is passed to the next codeword c. (t+1) The I-th code block.
[0146] 2. For the second character code Let r = (Ii) mod B, if 0 <r≤L r The second device has 20 pairs of codewords. Perform line-by-line layered decoding; the second device 20 will decode the next codeword c. (t+1) After decoding all code blocks row by row, the soft information obtained from the decoding of the r-th row (i.e., the aforementioned second posterior log-likelihood ratio vector) is passed to the previous codeword c. (t) layer i.
[0147] like Figure 6The diagram shown is a decoding normalization diagram according to an embodiment of this application. This decoding normalization diagram describes the various operations performed to obtain the source sequence from each codeword after decoding. "C", "=", "+", and "Π" represent the various operations performed during the decoding process. "C" represents basic LDPC decoding (i.e., decoding is achieved through multiple iterations using the belief propagation algorithm), "Π" represents row-column interleaving, "+" represents superposition operations (such as bitwise XOR), and "=" represents a judgment operation, i.e., determining whether the contents on both sides of the "=" sign are consistent.
[0148] The aforementioned code c (t) After the decoding of the I-th column of all code blocks is completed, the soft information output by the decoding is passed to the next codeword c. (t+1) The path of the I-th codeword is: “C” → “=" → “Π” → “+” → “=". The information after the soft information undergoes the “Π” operation can be considered as the first probability information.
[0149] The aforementioned code c (t+1) After decoding all code blocks row by row, the soft information obtained from decoding the r-th row is passed to the previous codeword c. (t) The path in column i is: "C" → "=" → "Π" → "=". The information after the soft information undergoes the "Π" operation can be considered as the second probability information.
[0150] 3. The second device has 20 pairs of the previous codeword c. (t) After all code blocks are decoded column-by-column, if all codewords satisfy the check, that is, the codeword c is corrected using the decoded second a posteriori log-likelihood ratio vector. (t) After that, the code word c (t) If the verification formula is satisfied, the iteration stops; otherwise, the next iteration is executed.
[0151] c (t) After decoding, its connection information with the next layer is linked to the next layer's c. (t+1) Channel input information in c (t+1) The processing is done at the plus sign node ("+"), and then passed to c. (t+1) The equals sign node (“=") is used as the c after the sliding window. (t+1) Input.
[0152] After the second device 20 stops iterating, it outputs codeword c. (t) Corresponding decoding result Then, slide the window (slide one codeword) and continue decoding based on the two codewords in the window. The decoding process is described above and will not be repeated here.
[0153] like Figure 7 , 8Figure 9 shows a schematic diagram of the relationship between bit error rate (BER) and signal-to-noise ratio (SNR) when using the layered decoding method provided in the embodiments of this application (i.e., the decoding method described in steps 505 and 304).
[0154] like Figure 7 As shown, the basic code is LDPC[2048,1723], the Chip product B = 8, and it is divided into L... c =8 columns L r =6, using 128DSQ modulation. Wherein, LDPC represents existing column-by-column layered decoding, and BMST-LDPC represents the layered decoding provided in this application.
[0155] like Figure 8 As shown, the basic code is LDPC[2048,1681], the Chip product B = 8, and it is divided into L... c =8 columns L r =7, using 128DSQ modulation. Wherein, LDPC represents existing column-by-column layered decoding, and BMST-LDPC represents the layered decoding provided in this application.
[0156] like Figure 9 As shown, the basic code is LDPC[2048,1561], the Chiron product B = 8, and it is divided into L... c =8 columns L r =6, using 256QAM modulation. Wherein, LDPC represents existing column-by-column layered decoding, and BMST-LDPC represents the layered decoding provided in this application.
[0157] like Figure 10 The figure shows the lower bound performance of the layered decoding method provided in this application embodiment. The genie-aided lower bound is the performance assuming perfect knowledge of the next layer. Let f BMST-LDPC (γ b ) and f LDPC ((γ b ) represent the BER performance functions of BMST-LDPC (i.e., the layered decoding provided in the embodiments of this application) and block LDPC codes, respectively, where γ b E b / N0. When the length L of the coupled chain is finite, the following holds:
[0158]
[0159] Among them, 10log 10 (1+1 / L) is caused by the loss of bit rate.
[0160] From the above formula, we can obtain that = the left-shifted component LDPC code curve This yields the lower bound of the BMST-LDPC code. For the codeword of the previous layer, it is equivalent to transmitting twice, thus its performance differs from the basic code (i.e., the block LDPC code) by approximately 10 logarithmic values. 10 2≈3dB.
[0161] In the hierarchical decoding method provided in this application embodiment: assuming the decoding of the previous codeword is completely correct, it is passed to the next codeword. When the next codeword performs basic LDPC decoding, some decoding bit errors may occur, and it is then passed to the previous codeword. This is equivalent to the previous codeword undergoing one Additive White Gaussian Noise (AWGN) channel propagation and one AWGN+BSC channel propagation. The hierarchical decoding method provided in this application embodiment actually simulates a waterfall region with a difference of approximately 0.4 dB from the lower boundary.
[0162] Figure 11 The figure shows the performance of the decoding method provided by the embodiment of this application after quantization. As can be seen from the figure, the BER of the decoding method provided by the embodiment of this application can reach below 1E-12 when SNR=23.5dB.
[0163] Based on the same inventive concept as the method embodiments, this application also provides an encoding device, which is deployed in a first device 10 and is used to execute the method executed by the first device 10 in the above method embodiments. Figure 12 As shown, the encoding device includes a generation module 1201 and a transmission module 1202. Specifically, in the encoding device 1200, the modules are connected through a communication path.
[0164] The generation module 1201 is used to generate a first codeword based on the first sequence and the second sequence; and to generate a second codeword based on the second sequence and the third sequence.
[0165] The sending module 1202 is used to send the first codeword and the second codeword to the second device.
[0166] As one possible implementation, the generation module 1201 generates a first codeword based on the first interleaving sequence and the second intermediate sequence, wherein the first interleaving sequence is generated by row-column interleaving of the first intermediate sequence, the first intermediate sequence is generated by LDPC encoding of the first sequence, and the second intermediate sequence is generated by LDPC encoding of the second sequence.
[0167] In one possible implementation, the generation module 1201 generates a second codeword based on the second interleaving sequence and the third intermediate sequence, wherein the second interleaving sequence is generated by row-column interleaving of the second intermediate sequence, the second intermediate sequence is generated by LDPC encoding of the second sequence, and the third intermediate sequence is generated by LDPC encoding of the third sequence.
[0168] In one possible implementation, the sending module 1202 sends an encoded sequence, which includes multiple codewords, wherein the first codeword and the second codeword are two adjacent codewords among the multiple codewords.
[0169] Based on the same inventive concept as the method embodiments, this application also provides a decoding device deployed in a second device 20, which is used to execute the method executed at the second device 20 in the above method embodiments. Figure 13 As shown, the decoding device 1300 includes a receiving module 1301 and a decoding module 1302. Specifically, in the decoding device 1300, the modules are connected through a communication path.
[0170] The receiving module 1301 is used to receive the first codeword and the second codeword.
[0171] The decoding module 1302 is used to perform at least one iterative decoding on the first codeword and the second codeword; wherein each iterative decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword; and, when the I-th layer decoding on each code block in the first codeword is completed, starting the row-by-row layer-by-layer decoding on the I-th code block in the second codeword, where I is a positive integer.
[0172] As one possible implementation, the decoding device 1300 further includes an action module 1303. After completing the first layer decoding of each code block in the first codeword, the action module 1303 obtains a first posterior log-likelihood ratio vector, passes the first posterior log-likelihood ratio vector to the first code block in the second codeword, and then starts the row-by-row layered decoding of the first code block in the second codeword.
[0173] As one possible implementation, after the action module 1303 completes the row-by-row layered decoding of the I-th code block in the second codeword, it obtains the second posterior log-likelihood ratio vector and passes the second posterior log-likelihood ratio vector to the I-th layer of each code block in the first codeword.
[0174] The decoding device 1300 also includes a decision module 1304. After performing column-by-column layer-by-layer decoding on each code block in the first codeword, the decision module 1304 obtains decision information. The decision information indicates a second sequence error generated after decoding the first codeword and initiates the next iteration of decoding.
[0175] In one possible implementation, the receiving module 1301 receives an encoded sequence including multiple codewords, wherein the first codeword and the second codeword are two adjacent codewords among the multiple codewords. The decoding module 1302 decodes the multiple codewords in the encoded sequence using a sliding window, wherein the window size is two codewords and the step size of the sliding window is one codeword. While covering the first and second codewords with the sliding window, the first and second codewords are decoded at least once in an iterative manner.
[0176] The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in the various embodiments of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.
[0177] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a terminal device (which may be a personal computer, mobile phone, or network device, etc.) or processor to execute all or part of the steps of the methods in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0178] This application also provides, for example Figure 14 The computing device 1400 shown includes a bus 1401, a processor 1402, a communication interface 1403, and a memory 1404. The processor 1402, the memory 1404, and the communication interface 1403 communicate with each other via the bus 1401.
[0179] The processor 1402 can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
[0180] Memory 1404 can be dynamic random access memory (DRAM). Besides DRAM, memory 1404 can also be other types of random access memory, such as static random access memory (SRAM). Additionally, memory 1402 can also be read-only memory (ROM). For example, read-only memory can be programmable read-only memory (PROM) or erasable programmable read-only memory (EPROM). Memory 1404 can also be flash memory, hard disk drive (HDD), or solid-state drive (SSD).
[0181] The memory 1404 stores computer program instructions, and the processor 1402 calls these computer program instructions to execute the aforementioned... Figure 5 The steps performed by the second device 20 in the described method, or the computer program instructions invoked to perform the aforementioned steps, are described. Figure 5 The method described refers to the steps of the first device 10. The memory 1404 may also include other software modules required for running processes, such as an operating system (e.g., multiple modules in file access device 700 or file access device 800). The operating system may be LINUX. TM UNIX TM WINDOWS TM wait.
[0182] This application also provides a computing device system, the computing device system including at least one such as Figure 15The computing device 1500 shown includes a bus 1501, a processor 1502, a communication interface 1503, and a memory 1504. The processor 1502, the memory 1504, and the communication interface 1503 communicate with each other via the bus 1501. At least one computing device 1500 in the computing device system communicates with each other via a communication path.
[0183] The specific types of processor 1502 and memory 1504 can be found in the descriptions of processor 1402 and memory 1404, and will not be repeated here. Processor 1502 calls the computer program instructions stored in memory 1504 to execute the aforementioned... Figure 5 The method described may involve some or all of the steps performed by the second device 20. Alternatively, the processor 1502 may invoke computer program instructions stored in the memory 1504 to execute the aforementioned steps. Figure 5 The described method may include some or all of the steps performed by the first device 10. The memory may also include other software modules required for running processes, such as an operating system. The operating system may be Linux. TM UNIX TM WINDOWS TM wait.
[0184] At least one computing device 1500 in the computing device system establishes communication with each other through a communication network, and each computing device 1500 runs multiple modules of the encoding device 1200.
[0185] At least one computing device 1500 in the computing device system establishes communication with each other through a communication network, and multiple modules in the decoding device 1300 run on each computing device 1500.
[0186] The descriptions of the processes corresponding to the above-mentioned figures each have their own emphasis. For parts of a process that are not described in detail, please refer to the relevant descriptions of other processes.
[0187] In the above embodiments, implementation can be achieved, in whole or in part, through 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. A computer program product includes computer program instructions, which, when loaded and executed on a computer, generate, in whole or in part, the product according to the embodiments of the present invention. Figure 5 The process or function described.
[0188] The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another 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 may 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. The available medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., SSD).
[0189] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.
Claims
1. A communication system, characterized by The system includes: A first device is configured to generate a first codeword based on a first sequence and a second sequence; generate a second codeword based on the second sequence and a third sequence; and send the first codeword and the second codeword to a second device. The second device is configured to perform at least one iterative decoding on the first codeword and the second codeword, wherein each iterative decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword; and, upon completion of the I-th layer decoding on each code block in the first codeword, initiating row-by-row layer-by-layer decoding on the I-th code block in the second codeword, where I is a positive integer.
2. The system of claim 1, wherein, The second device is used for: After the first layer of decoding of each code block in the first codeword is completed, the first posterior log-likelihood ratio vector is obtained. After the first posterior log-likelihood ratio vector is passed to the first code block in the second codeword, the row-by-row layered decoding of the first code block in the second codeword is started.
3. The system of claim 1, wherein, The second device is also used for: After the row-by-row layered decoding of the I-th code block in the second codeword is completed, the second posterior log-likelihood ratio vector is obtained, and the second posterior log-likelihood ratio vector is passed to the I-th code block of each code block in the first codeword.
4. The system of any of claims 1 to 3, wherein, The second device is also used for: After each code block in the first codeword is decoded in a column-by-column manner, decision information is obtained. The decision information indicates a second sequence error generated after the first codeword is decoded, and the next iteration of decoding is initiated.
5. The system of claim 1, wherein, The first device is used for: The first codeword is generated based on the first interleaving sequence and the second intermediate sequence, wherein the first interleaving sequence is generated by row-column interleaving of the first intermediate sequence, the first intermediate sequence is generated by LDPC encoding of the first sequence, and the second intermediate sequence is generated by LDPC encoding of the second sequence.
6. The system of claim 1 or 2, wherein, The first device is used for: A second codeword is generated based on the second interleaving sequence and the third intermediate sequence, wherein the second interleaving sequence is generated by row-column interleaving of the second intermediate sequence, the second intermediate sequence is generated by LDPC encoding of the second sequence, and the third intermediate sequence is generated by LDPC encoding of the third sequence.
7. The system of any one of claims 1 to 6, wherein, The first device is used for: Send an encoded sequence, the encoded sequence including multiple codewords, wherein the first codeword and the second codeword are two adjacent codewords among the multiple codewords; The second device is configured to: decode the encoded sequence in a sliding window manner, wherein the window size of the sliding window is two codewords and the step size of the sliding window is one codeword, and perform at least one iterative decoding on the first codeword and the second codeword while covering the first codeword and the second codeword with the sliding window.
8. A communication method characterized by comprising: The method includes: Receive the first codeword and the second codeword; Perform at least one iteration of decoding on the first codeword and the second codeword; Each iteration of decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword; and, upon completion of the I-th layer-by-layer decoding on each code block in the first codeword, initiating row-by-row layer-by-layer decoding on the I-th code block in the second codeword, where I is a positive integer.
9. The method of claim 8, wherein, The method further includes: After the first layer of decoding of each code block in the first codeword is completed, the first posterior log-likelihood ratio vector is obtained. After the first posterior log-likelihood ratio vector is passed to the first code block in the second codeword, the row-by-row layered decoding of the first code block in the second codeword is started.
10. The method of claim 8 or 9, wherein, The method further includes: After the row-by-row layered decoding of the I-th code block in the second codeword is completed, the second posterior log-likelihood ratio vector is obtained, and the second posterior log-likelihood ratio vector is passed to the I-th layer of each code block in the first codeword.
11. The method according to any one of claims 8 to 10, characterized in that, The method further includes: After each code block in the first codeword is decoded in a column-by-column manner, decision information is obtained. The decision information indicates a second sequence error generated after the first codeword is decoded, and the next iteration of decoding is initiated.
12. The method according to any one of claims 8 to 11, characterized in that, The step of performing at least one iterative decoding on the first codeword and the second codeword includes: Multiple codewords in the encoded sequence are decoded using a sliding window method. The window size of the sliding window is two codewords, and the step size of the sliding window is one codeword. When the sliding window covers the first codeword and the second codeword, the first codeword and the second codeword are decoded at least once iteratively.
13. A communications device, characterized by The device includes: The receiving module is used to receive the first codeword and the second codeword; The decoding module is used to perform at least one iterative decoding on the first codeword and the second codeword; Each iteration of decoding includes: performing column-by-column layer-by-layer decoding on each code block in the first codeword; and, upon completion of the I-th layer-by-layer decoding on each code block in the first codeword, initiating row-by-row layer-by-layer decoding on the I-th code block in the second codeword, where I is a positive integer.
14. The apparatus of claim 13, wherein, The device further includes an operating module, the operating module being used for: After the first layer of decoding of each code block in the first codeword is completed, a first posterior log-likelihood ratio vector is obtained. After applying the first posterior log-likelihood ratio vector to the first code block in the second codeword, row-by-row layered decoding of the first code block in the second codeword is started.
15. The apparatus of claim 13 or 14, wherein, The functional module in the device also includes: After the row-by-row layered decoding of the I-th code block in the second codeword is completed, the second posterior log-likelihood ratio vector is obtained, and the second posterior log-likelihood ratio vector is passed to the I-th layer of each code block in the first codeword.
16. The device of any one of claims 13 to 15, characterized in that The device further includes a decision module, the decision module being used for: After each code block in the first codeword is decoded in a column-by-column manner, decision information is obtained. The decision information indicates a second sequence error generated after the first codeword is decoded, and the next iteration of decoding is initiated.
17. The apparatus according to any one of claims 13 to 16, characterized in that, The receiving module is configured to: receive an encoded sequence, the encoded sequence including multiple codewords, the multiple codewords including a first codeword and a second codeword; The decoding module is configured to: decode multiple codewords in the encoded sequence using a sliding window, wherein the window size of the sliding window is two codewords and the step size of the sliding window is one codeword; and perform at least one iterative decoding on the first codeword and the second codeword while covering the first codeword and the second codeword with the sliding window.
18. A computing device, characterized in that, The computing device includes a processor and memory; The memory is used to store computer program instructions; The processor executes computer program instructions in the memory to perform the method as described in any one of claims 8 to 12.
19. A computer-readable storage medium, characterized in that, When the computer-readable storage medium is executed by a computing device, the computing device performs the method according to any one of claims 8 to 12.
