Data Processing in Channel Decoding

By determining the mapping relationship set approximate calculation of Jacobian logarithm and product operations, the problem of insufficient decoding performance of LDPC code and polarization code in URLLC is solved, and the error correction ability is improved and complexity control is achieved, and the performance gain of 0.3dB is provided. .

CN113273085BActive Publication Date: 2024-11-22ALCATEL LUCENT SHANGHAI BELL CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980088103.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-01-14
Publication Date
2024-11-22
Estimated Expiration
2039-01-14

AI Technical Summary

Technical Problem

In the low block error rate (BLER), the decoding performance of LDPC codes and polarized codes needs to be improved to meet the requirements of ultra-reliable low-delay communication (URLLC). The traditional Jacobian logarithmic and product approximation methods have degradation in performance and complexity issues.

Method used

By determining the mapping relationship set, approximately calculate the key terms in Jacobian logarithm and product operations, use a single lookup table to achieve high approximation accuracy of the product operations, and directly compensate for the less important terms in the equation, which is suitable for iterative and continuous Decoding algorithm.

Benefits of technology

It significantly improves the error correction capabilities of LDPC codes and polarized codes, provides a good balance between performance improvements and implementation complexity, alleviates inaccuracies in LLR calculations, and brings about 0.3dB of performance gain.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113273085B_ABST
    Figure CN113273085B_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure relate to devices, methods, apparatuses, and computer-readable storage media for data processing. In an example embodiment, a method for data processing is provided. The method includes obtaining a first input and a second input from a channel decoding process, performing a sum-product operation on the first input and the second input, and the sum-product operation includes one or more sub-operations. The method also includes determining a mapping relationship set for approximating at least one of the one or more sub-operations. The method also includes determining a first result of the sum-product operation based on the first input, the second input, and the mapping relationship set, and continuing the channel decoding process based on the first result. In this way, embodiments of the present disclosure can improve the error correction capability of low-density parity-check (LDPC) codes, polar codes, Reed-Muller (RM) codes, and the like.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present disclosure relate generally to data processing, and in particular to an apparatus, method, device, and computer-readable storage medium for data processing in channel decoding. Background Art

[0002] In the recent 3GPP specification (Rel-15), the New Radio (NR) enhanced mobile broadband (eMBB) standard includes two forward correction codes, namely low-density parity check (LDPC) codes and polar codes, as alternatives to long-term evolution (LTE) turbo codes and tail-biting convolutional codes for error correction in data and control channels. Similar to the NR eMBB case, LDPC codes and polar codes are two strong candidates for NR ultra-reliable low-latency communication (URLLC). URLLC applications impose some unique requirements different from eMBB, such as block error rate (BLER) as low as 10 -5 , which was considered more stringently during the eMBB standardization. In addition, the false alarm problem of cyclic redundancy check (CRC) detection only meets the eMBB requirements after extending the CRC code to 24 bits. The lower false alarm rate expected by URLLC is certainly more challenging.

[0003] Therefore, the forward correction codes standardized in Rel-15 are a good basis for the baseline. However, in such a low BLER range, the decoding performance of LDPC codes and / or polar codes needs to be improved to meet the requirements of URLLC. Since the operating region of LDPC codes and / or polar codes is already relatively close to the extreme capacity limit (for example, the performance of the polar-coded NR physical broadcast channel is only 0.8dB away from the capacity limit), any type of performance degradation should not be ignored, especially for URLLC, which aims at ultra-high reliability. Summary of the invention

[0004] In general, example embodiments of the present disclosure provide an apparatus, method, device, and computer-readable storage medium for data processing in channel decoding.

[0005] In a first aspect, a device for data processing is provided, comprising at least one memory indicating a processor and including computer program code. The at least one memory and the computer code are configured to, together with the at least one processor, enable the device to at least: obtain a first input and a second input from a channel decoding process, perform a sum-product operation on the first input and the second input, the sum-product operation including one or more sub-operations; determine a mapping relationship set for approximating at least one of the one or more sub-operations; determine a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input and the mapping relationship set; and continue the channel decoding process based on the first result.

[0006] In a second aspect, a method for data processing is provided. The method includes obtaining a first input and a second input from a channel decoding process, performing a sum-product operation on the first input and the second input, and the sum-product operation includes one or more sub-operations. The method also includes determining a mapping relationship set for approximating at least one sub-operation of the one or more sub-operations. The method also includes determining a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input, and the mapping relationship set. Additionally, the method also includes continuing the channel decoding process based on the first result.

[0007] In a third aspect, an apparatus is provided, the apparatus comprising means for performing the method according to the second aspect.

[0008] In a fourth aspect, there is provided a computer readable storage medium having a computer program stored thereon. The computer program, when executed by a processor of a device, causes the device to perform the method according to the second aspect.

[0009] It should be understood that the part of the summary of the present invention is not intended to identify the key or essential features of the embodiments of the present disclosure, nor is it intended to be used to limit the scope of the present disclosure. Other features of the present disclosure will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The above and other objects, features and advantages of the present disclosure will become more apparent through a more detailed description of some embodiments of the present disclosure in the accompanying drawings, in which:

[0011] Figure 1A and Figure 1B Illustrated is a schematic diagram of an example communication system 100 in which embodiments of the present disclosure may be implemented.

[0012] Figure 2 is a flow chart of an example method for data processing according to some embodiments of the present disclosure.

[0013] Figure 3A diagram illustrating a performance comparison of three variants of sum-product operations; and

[0014] Figure 4 is a simplified block diagram of a device suitable for implementing embodiments of the present disclosure.

[0015] Throughout the drawings, the same or similar reference numbers represent the same or similar elements. DETAILED DESCRIPTION

[0016] The principles of the present disclosure will now be described with reference to some example embodiments. It will be appreciated that these embodiments are described for illustrative purposes only and to help those skilled in the art understand and implement the present disclosure without implying any limitation on the scope of the present disclosure. In addition to the methods described below, the present disclosure described herein can be implemented in various ways.

[0017] In the following description and claims, unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.

[0018] As used herein, the term "communication network" refers to a network that complies with any communication standard or communication protocol, such as Long Term Evolution (LTE), Advanced LTE (LTE-A), and Fifth Generation (5G) New Radio (NR), and employs any suitable communication technology, including, for example, Multiple Input Multiple Output (MIMO), OFDM, Time Division Multiplexing (TDM), Frequency Division Multiplexing (FDM), Code Division Multiplexing (CDM), Bluetooth, ZigBee, Machine Type Communication (MTC), eMBB, mMTC, and uRLLC technologies. For the purpose of discussion, in some embodiments, an LTE network, an LTE-A network, a 5G NR network, or any combination thereof is taken as an example of a communication network.

[0019] As used herein, the term "network device" refers to any suitable device at the network side of a communication network, including, for example, a base station (BS), a relay, an access point (AP), a Node B (NodeB or NB), an evolved NodeB (eNodeB or eNB), a gigabit NodeB (gNB), a remote radio unit (RRU), a radio head (RH), a remote radio head (RRH), a low power node such as a femto node, a pico node, etc. For the purpose of discussion, in some embodiments, an eNB is taken as an example of a network device.

[0020] The network equipment may also include any suitable equipment in the core network, for example, including multi-standard radio (MSR) radio equipment, such as MSR BS; network controllers, such as radio network controllers (RNC) or base station controllers (BSC), multi-cell / multicast coordination entities (MCE), mobile switching centers (MSC) and MMEs, operations and management (O&M) nodes, operations support systems (OSS); self-organizing network nodes (SON); positioning nodes, such as enhanced serving mobile positioning centers (E-SMLC), and / or mobile data terminals (MDTs).

[0021] As used herein, the term "terminal device" refers to a device that can be configured for, arranged for, and / or operable to communicate using a network device or another terminal device in a communication network. Communication may involve sending and / or receiving wireless signals, which may involve using electromagnetic signals, radio waves, infrared signals, and / or other signals suitable for transmitting information in the air. In some embodiments, the terminal device may be configured to send and / or receive information without direct human interaction. For example, when triggered by an internal or external event, or in response to a request from the network side, the terminal device may send information to a network device on a predetermined schedule.

[0022] Examples of terminal devices include, but are not limited to, user equipment (UE) such as a smartphone, a wireless-enabled tablet computer, an embedded laptop device (LEE), a mounted laptop device (LME), and / or a wireless client device (CPE). For the purpose of discussion, some embodiments are described below with reference to UE as an example of a terminal device, and the terms "terminal device" and "user equipment" (UE) may be used interchangeably in the context of the present disclosure.

[0023] As used herein, the term "cell" refers to an area covered by radio signals transmitted by a network device. Terminal devices within the cell can be served by the network device and access the communication network via the network device.

[0024] As described herein, the term "circuitry" may refer to one or more of the following:

[0025] (a) hardware circuit implementation (such as implementation in analog and / or digital circuitry only) and

[0026] (b) a combination of hardware circuitry and software, such as (where applicable): (i) a combination of analog and / or digital hardware circuitry and software / firmware and (ii) any portion of hardware processor(s) (including digital signal processor(s)), software, and memory(s) with software that work together to enable a device (such as a mobile phone or server) to perform various functions, and

[0027] (c) Hardware circuits and or processor(s), such as microprocessor(s) or portions of microprocessor(s), that require software (e.g., firmware) for operation, but in which the software may not be present when not required for operation.

[0028] This definition of circuitry applies to all uses of the term in this application. As a further example, as used in this application, the term circuitry also covers an implementation of only a hardware circuit or a processor (or multiple processors) or a portion of a hardware circuit or a processor and its (or their) accompanying software and / or firmware. The term circuitry also covers, for example, and if applicable to a specific claim element, a baseband integrated circuit or processor integrated circuit for a mobile device, or a similar integrated circuit in a server, a cellular network device, or other computing or network device.

[0029] As used herein, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. The term "including" and its variations should be taken as open-ended terms, meaning "including, but not limited to". The term "based on" should be taken as "based on at least in part". The terms "one embodiment" and "an embodiment" should be taken as "at least one embodiment". The term "another embodiment" should be taken as "at least one other embodiment". Other definitions, express or implied, may be included below.

[0030] As described above, in order to improve system performance and enhance user experience, some personal information of end users (e.g., user name, password, age, gender, fingerprint, phone number, unique identifier, location, credit card number, financial records, medical records, etc.) may be collected, stored, used, maintained and / or disseminated by service providers with end user authorization. However, some service providers may collect personal information that is not related to the services provided in order to conduct data mining and in-depth analysis to enable other services to obtain more profits. In addition, some service providers may share the collected personal information with third parties without informing the relevant end users. All of these may threaten the privacy of end users.

[0031] As described above, the error correction capability of LDPC codes and / or polar codes needs to be further improved to meet the requirements of URLLC. Due to practical considerations. It is common for modern decoding algorithms to be implemented in the logarithmic domain to avoid numerical overflow and / or underflow. Some examples have been deployed in commercial services, such as BCJR also used for ultra codes, belief propagation for LDPC codes, and continuous cancellation for Reed-Muller (RM) codes, and all the decoding operations are performed in the logarithmic domain. Another advantage that may be beneficial in practice is that when the decoding algorithm is transferred from the linear domain to the logarithmic domain, arithmetic operations become quite easy. For example, the multiplication operation in the linear domain now becomes an addition operation, which is undoubtedly easier to implement.

[0032] Therefore, likelihood ratios (LR, which refers to the ratio of the probability that a given bit is 1 to its probability of being 0 or vice versa) are often converted to the logarithmic domain, and the result is generally called the log-likelihood ratio (LLR). In fact, LLR calculation plays a vital role in modern soft information-based decoding algorithms. In general, using LLR makes decoding easier and faster than using LR in most cases. Unfortunately, for some special arithmetic operations, logarithmic domain calculations may produce too high complexity, such as Jacobian logarithms and sum-product operations.

[0033] As a trade-off, conventional solutions often include suboptimal alternatives to approximate the conventional Jacobian logarithm and sum-product operations. Such suboptimal alternatives may be inaccurate and inevitably lead to performance degradation due to incorrect approximations.

[0034] Assuming A and B are the two inputs of the sum-product operation, the sum-product operation performs the following operation in the logarithmic domain:

[0035]

[0036] Some traditional solutions tend to consider only the first term (i.e., sign(A)sign(B)min(|A|,|B|), this simplified version of the sum-product is often called the minimum sum), while ignoring the second and third terms as follows:

[0037] g = ln(1+exp(-|A+B|))-ln(1+exp(-|AB|)) (2) This inherent basic simplification brings numerical inaccuracies, resulting in inevitable performance degradation.

[0038] There is a lot of evidence to support that when simplified sum-products (such as minimum sums) are used during decoding, the error correction capability for LDPC is significantly degraded. In addition, when the transport block size becomes larger and / or the code rate becomes lower (such as 1 / 3 and 1 / 5, which is an important rate area for NR URLLC services), it is shown that the performance gap is further exacerbated. In the worst case, this degradation can be extended to 0.5dB or more.

[0039] It should be understood that the sum-product operation is a key component of both the LDPC decoder and / or the polar decoder. Specifically, the sum-product operation is performed during the check node update in LDPC decoding, while the f-node calculation is performed in polar decoding.

[0040] Some traditional solutions attempt to improve the error correction capability in the LDPC decoding context by offset, normalization or adjustment minimum sum (that is, sign(A)sign(B)min(|A|,|B|)). However, some of these traditional solutions may be based on a wrong understanding of the sum-product, and therefore the best approximation to the correct value of the sum-product can not be provided. In addition, some of these traditional solutions may introduce additional time delays and / or complexity and are therefore difficult to realize in practice. In addition, some of these traditional solutions may have the requirement of the number of iterations, and therefore may not utilize a small amount of number of iterations to bring significant benefits. Additionally, some of these traditional solutions may rely on the iterative structure of the LDPC decoder, and therefore may not be suitable for decoders with other structures.

[0041] Embodiments of the present disclosure propose solutions for data processing in channel decoding to solve the above problems and one or more other potential problems. The solution can greatly improve the error correction capability of LDPC codes and / or polar codes, while providing a good balance between performance improvement and implementation complexity. The solution directly compensates for the less important terms in equation (1) rather than relying on the structure of the decoder, and therefore it can be well applied to both iterative and continuous decoding algorithms. It should be understood that the solution is not customized for LDPC codes or polar codes. However, it can be included in an LDPC decoder, polarization and / or RM decoder, or other decoder with minimal modifications.

[0042] For the purpose of illustration, the embodiments of the present disclosure will be described below in the context of channel decoding (such as LDPC, polarization and / or RM decoding). However, it should be understood that the sum-product operation shown in equation (1) above is widely used in many fields, such as physics, fluid mechanics, etc. Therefore, the embodiments of the present disclosure are also applicable to these fields, and the scope of the present disclosure is not limited to this point.

[0043] Figure 1A 1 is a diagram illustrating an example wireless communication system 100 in which embodiments of the present disclosure may be implemented. The wireless communication system 100 may include a network device 101 and a plurality of terminal devices 111 and 112 served by the network device 101. The network 100 may provide one or more service cells 102 to serve the terminal devices 111 and 112. The terminal devices 111 and 112 may communicate with the network device 101 via wireless transmission channels 131 and 132, respectively, and / or communicate with each other via a wireless transmission channel 133. It should be understood that the number of network devices, terminal devices, and / or service cells is for illustrative purposes only and does not impose any limitation on the present disclosure.

[0044] Figure 1B 1 is a simplified diagram illustrating the processing implemented at the transmitting device 120 and the receiving device 130 in communication. In some embodiments, the network device 101 can act as the transmitting device 120, and the terminal device 111 or 112 in FIG. 1 can act as the receiving device 130. In some embodiments, the network device 101 can act as the receiving device 130, and the terminal device 111 or 112 in FIG. 1 can act as the transmitting device 120.

[0045] like Figure 1B As shown, in order to ensure reliable transmission of data (including control signals), the transmitting device 120 may perform channel coding (140) on the data to be transmitted to introduce redundancy, thereby resisting the possibility of being introduced into the transmission channel (e.g., Figure 1A 131, 132, and 133 in ). Alternatively, the channel coded data may also be interleaved (not shown) and / or modulated (150) before being transmitted. At the receiving device 130, the reverse process of the transmitting device 120 is performed. That is, the received signal is demodulated (160), deinterleaved (not shown) and decoded (170) to recover the transmitted data. In some embodiments, the transmitting device 120 may involve other or different processing, and the receiving device 130 may perform the reverse operation accordingly.

[0046] In some embodiments, LDPC codes, polar codes and / or RM codes may be used in Figure 1B It should be understood that the channel used herein refers to the coding channel, that is, the channel involved in the coding process from input to output, rather than Figure 1A 131, 132 or 133 in the transmission channel. Accordingly, Figure 1B The channel decoding process 170 in may be used to decode a received signal including an error correction code, such as an LDPC code, a polar code, and / or an RM code.

[0047] exist Figure 1BIn the modulation process 150, any modulation technique currently known or to be developed in the future may be used, such as binary phase shift keying (BPSK), π / 2-BPSK, quadrature phase shift keying (QPSK), 16 quadrature amplitude modulation (16QAM), 64QAM and 256QAM. Figure 1B In the modulation process 160, a corresponding demodulation method will be adopted according to the modulation technology used in the modulation process 150.

[0048] Figure 2 1 shows a flow chart of a method 200 according to an embodiment of the present disclosure. The method 200 may be implemented at a receiving device 130 in a communication network 100. For example, the receiving device 130 may be a terminal device 111 or 112, or a network device 101 as shown in FIG. 1. It should be understood that the method 200 may further include additional blocks not shown, and / or omit some of the blocks shown, and the scope of the present disclosure is not limited in this regard.

[0049] like Figure 2 As shown, at block 210, the receiving device 130 obtains a first input and a second input from the channel decoding process 170, and a sum-product operation is to be performed on the first input and the second input.

[0050] In some embodiments, the first input may indicate a first ratio between a first likelihood that the first received bit is decoded as a first value and a second likelihood that the first received bit is decoded as a second value. The second input may indicate a second ratio between a third likelihood that the second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value. For example, the first value may be 1, and the second value may be 0. As another example, the first value may be 0, and the second value may be 1.

[0051] In some embodiments, the first input and the second input are two LLRs obtained from the channel decoding process 170 (e.g., generated directly from the soft demapper), and a sum-product is performed on them. For example, assuming that the first input is represented as 'A' and the second input is represented as 'B', the sum-product operation performed on the first and second inputs is defined as the above equation (1). The sum-product operation may include one or more sub-operations, such as the two individual Jacobian logarithm operations shown in the above equation (2).

[0052] At block 220 , the receiving device 130 determines a set of mapping relationships for approximating at least one of the one or more sub-operations.

[0053] One or more sub-operations shown in equation (2) above may be represented as curves in a 3-dimensional (3D) space. In some embodiments, receiving device 130 may determine a set of basic curves (also referred to as "mapping relationships") from a 2-dimensional (2D) space to approximate the 3D curves. For example, a total of M basic curves from a 2D space may be carefully designed to accurately approximate the correct value of the g term in equation (2) above.

[0054] In some embodiments, the value of M can be selectively adjusted to meet different needs of target deployment. Specifically, for some scenarios requiring extremely high reliability, a larger value can be selected. For other scenarios that focus on extremely low latency, a smaller value can be selected. In some embodiments, for example, M≥1. In some embodiments, for example, M ranges from 4 to 6.

[0055] In some embodiments, for example, a set of mapping relationships for approximating the correct value of the g term in equation (2) above may be expressed as follows:

[0056]

[0057] The parameter S can be determined based on the value of M. 1 , S 2 , ...S n For example, each parameter S 1 , S 2 , ...S n The value of can be taken from a series of base 2 exponentials, the speed of which can be easily achieved by bit-level shifting. In some embodiments, for example, each parameter S 1 , S 2 , ...S n The range is from -0.5 to 0. The parameter K 1 ,K 2 ,. . . K n The value of can be determined based on the value of M. In some embodiments, for example, each parameter K 1 ,K 2 ,... K n The range is from 0 to 6. Parameter D 1 ,D 2 ,... D n can be determined based on the value of M. In some embodiments, for example, each parameter D 1 ,D 2 ,...D n The range is from 0 to 1. It should be understood that the values ​​of the above parameters can be determined and fine-tuned offline to best match different deployment scenarios without the need for online adjustment.

[0058] In some embodiments, the mapping relationship set J(x) shown in equation (3) above may be stored as a lookup table in a memory. Similarly, the receiving device 130 may obtain a lookup table representing the mapping relationship set J(x) from the memory.

[0059] In some embodiments, in order to achieve better accuracy, it is necessary to consider both the first input A and the second input B jointly, rather than considering them as separate variables and processing them individually. Typically, it usually requires implementing two or more lookup tables for approximating the 3D curve. The number of lookup tables can be as many as the result of the Cartesian product of A and B. In contrast, in the embodiments of the present disclosure, since the first input A and the second input B are processed jointly, only one lookup table is required.

[0060] At block 230 , based on the first input A, the second input B, and the mapping relationship set J(x), the receiving device 130 determines a result of the sum-product operation performed on the first input and the second input (hereinafter also referred to as a “first result”).

[0061] In some embodiments, based on the first input A, the second input B, and the mapping relationship set J(x), the receiving device 130 can determine the result of the item g in the above equation (2) (also referred to as the "second result" hereinafter), and then determine the first result of the sum-product operation (i.e., the item f of the above equation (1)).

[0062] In some embodiments, in order to determine the second result, the receiving device 130 may determine a first absolute value of the sum of the first input A and the second input B, and determine a first candidate result of the term g in the above equation (2) based on the first absolute value and the mapping relationship set. The receiving device 130 may determine a second absolute value of the difference between the first input and the second input, and determine a second candidate result of the term g in the above equation (2) based on the second absolute value and the mapping relationship set. Then, the receiving device 130 may select one of the first candidate result, the second candidate result, and a predetermined value (such as 0) as the second result by comparing the first absolute value and the second absolute value.

[0063] For example, to further reduce complexity, an additional selector Ψ as shown in the following equation (4) may be used to quickly determine the second result:

[0064]

[0065] The two constants C and C2 determine the polarity of the output. In some embodiments, for example, the constants C and C2 each range from 0.5 to 5.5.

[0066] The above equation (3) together with the above equation (4) can achieve high approximation accuracy of the sum-product operation by using only one lookup table instead of multiple lookup tables. This in turn leads to a significant improvement in decoding error rate of LDPC codes and / or polar codes, which will be discussed further below. It should be understood that the principles of the present disclosure can be extended to using 3D curves to approximate curves in 4D space.

[0067] Specifically, in the following, for example, the above equations (3) and (4) with recommended parameters are as shown in the following equations (5) and (6):

[0068]

[0069]

[0070] In the above equation (5), S 1 =0.394, S 2 =0.221, S 3 =0.118, S 4 =0.046, D 1 =0.680, D 2 =0.533, D 3 =0.364, D 4 =0.189, K 1 =0.881, K 2 =1.665, K 3 =2.403 and K 4 =3.821. In the above equation (6), C = 4.4 and C2 = 1.5. Let Δ = |Ψ-correct value of g|, the mean value of Δ can reach 7.5e -4 As low as, and the variable Δ is 1.7e -5 This demonstrates the high approximation accuracy.

[0071] At block 240 , based on the determined result of the sum-product operation performed on the first input and the second input, the receiving module 130 continues the channel decoding process.

[0072] In some embodiments, the above method 200 can be applied to polar codes. That is, the channel decoding process can be used to decode polar codes. In this way, a low-complexity implementation of sum-product operations can be envisioned, which can alleviate the LLR inaccuracy problem in those traditional solutions that only consider the minimum sum and ignore the operation formulated in equation (2). The above method 200 can be applied to the most critical decoding steps in polar decoding, such as LLR calculation when decoding bits with odd indices (i.e., f nodes) and / or decoding bits with even indices (i.e., g nodes).

[0073] For example, in polar decoding, the recursive formula for decoding bits with odd indices (i.e., 2i-1) is as follows:

[0074]

[0075] in Represents the vector (y 1 ,y 2 , …, y N ), indicating a sequence of N received complex-valued symbols to be decoded. represents the first bit to the (2i-2)th decoded bit, and Represents a given And the log-likelihood ratio of the (2i-1)th bit in the case of sequence length N, where The function sign(x) is defined as follows: The function min(a, b) is defined as follows: symbol Represents the exclusive-or (also called modulo-2 sum) operation. (equal to the first input A) and (equal to the second input B), The value of can be determined recursively, where represents the bits with odd indices from the first to the (2i-2)th decoded bits. From the above equation (7), we can see that The results can be determined according to embodiments of the present disclosure.

[0076] Additionally, the recursive equation for decoding bits with even indices (i.e., 2i) is as follows:

[0077]

[0078] in The above equations (7) and (8) are recursively calculated until It represents the generated channel LLRs directly from the soft demapper.

[0079] After the recursion of LLR calculation is completed, and / or can be determined, where Then, a hard decision can be performed to determine the decoded bits as follows:

[0080]

[0081] and / or

[0082]

[0083] In some embodiments, the above method 200 can be used for LDPC decoding. For example, the Ψ term as shown in equation (4) above can be added to the existing check node update rule to achieve significant decoding error improvement while minimizing computational cost.

[0084] Figure 3 A schematic diagram comparing three variants of a sum-product operation labeled sum-product (i.e., the best decoder used as a performance benchmark), a minimum sum (i.e., a conventional decoder ignoring the operation formulated in equation (2)), and a proposed solution according to the present disclosure is illustrated. Figure 3 The URLLC usage scenario is assumed in , where the payload usually tends to be light and the code rate is low, for example, 256 bits are sent at 1 / 4 rate. In addition, the receiving device is usually powered by a battery with limited processing power, and therefore the choice of list size is simplified to 1. That is, the general successive cancellation (SC) algorithm is used for decoding.

[0085] Can be obtained from Figure 3 It can be seen that the curve labeled "sum product" provides the best performance among the three variants because neither any simplification nor any approximation is used. In other words, the curve labeled "sum product" represents the direct calculation of the above equation (1). The disadvantage is that the direct calculation complexity of the sum product is too high, making it almost impossible to implement in commercial products. On the other hand, the curve labeled "minimum sum" only accounts for the first term of the above equation (1), while the second and third terms are completely ignored to save computing resources. Undoubtedly, the performance degradation of "minimum sum" is inevitable. As Figure 3 As shown, the proposed solution is able to compensate for the performance loss caused by the minimum sum, bringing a gain of about 0.3dB. Due to the effectiveness of the new design, the curve representing the proposed solution is close enough to the best curve marked as "sum product". Considering that the polar code in Rel-15 is 0.8dB away from the ultimate capacity limit described above, the improvement of 0.3dB is a significant achievement and is crucial for NR URLLC.

[0086] Through the above description, it can be seen that the embodiments of the present disclosure provide a solution for data processing in channel decoding. The solution can greatly improve the error correction capability of LDPC codes, polar codes and / or RM codes, while providing a good balance between performance improvement and implementation complexity. The solution directly compensates for the less important terms of equation (1) rather than relying on the structure of the decoder, so it works well for both iterative decoding algorithms and continuous decoding algorithms. It should be understood that the solution is not customized for LCPD codes or polar codes. Instead, it can be included in one of the LDPC decoders, polarization and / or RM decoders, or other decoders with minimal modifications.

[0087] In some embodiments, the device capable of executing method 200 may include components for executing the corresponding steps of method 200. The components may be implemented in any suitable form. For example, the components may be implemented in a circuit system or a software module.

[0088] In some embodiments, a component includes at least one processor and at least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processor, cause execution of the apparatus.

[0089] In some embodiments, an apparatus capable of executing method 200 includes: a component for obtaining a first input and a second input from a channel decoding process, performing a sum-product operation on the first input and the second input, the sum-product operation including one or more sub-operations; a component for determining a mapping relationship set for approximating at least one of the one or more sub-operations; a component for determining a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input and the mapping relationship set; and a component for continuing the channel decoding process based on the first result.

[0090] In some embodiments, the means for determining the first result includes: means for determining a second result of one or more sub-operations based on the first input, the second input, and the set of mapping relationships; and means for determining the first result based at least on the second result.

[0091] In some embodiments, the component for determining the second result includes: a component for determining a first absolute value of the sum of a first input and a second input; a component for determining a first candidate result of one or more sub-operations based on the first absolute value and a mapping relationship set; a component for determining a second absolute value of a difference between the first input and the second input; a component for determining a second candidate result of one or more sub-operations based on the second absolute value and a mapping relationship set; and a component for selecting one of the first candidate result, the second candidate result, and a predetermined value (such as 0) as the second result by comparing the first absolute value and the second absolute value.

[0092] In some embodiments, the first input indicates a first ratio between a first likelihood that the first received bit is decoded as a first value and a second likelihood that the second received bit is decoded as a second value. In some embodiments, the second input indicates a second ratio between a third likelihood that the second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value.

[0093] In some embodiments, the mapping relationship set is stored as a lookup table in a memory. The means for determining the mapping relationship set includes: means for obtaining a lookup table representing the mapping relationship set from the memory.

[0094] In some embodiments, the channel decoding process is used to decode low density parity check (LDPC) codes.

[0095] In some embodiments, a channel decoding process is used to decode polar codes and / or Redmueller codes.

[0096] Figure 4 1 is a simplified block diagram of a device 400 suitable for implementing an embodiment of the present disclosure. The device 400 can be used to implement the sending device 120 or the receiving device 130 in the embodiment of the present disclosure, for example, the network device 101 shown in FIG. 1 or a terminal device, such as the terminal device 111 or 112 shown in FIG. 1.

[0097] As shown, the device 400 includes a processor 410, a memory 420 coupled to the processor 410, a suitable transmitter (TX) and receiver (RX) 440 coupled to the processor 410, and a communication interface coupled to the TX / RX 440. The TX / RX 440 is used for bidirectional communication. The TX / RX 440 has at least one antenna to facilitate communication, although in practice, the access nodes mentioned in this application may have several antennas. The communication interface may represent any interface required for communicating with other network elements.

[0098] Assuming that the program 430 includes program instructions, when the instructions are executed by the associated processor 410, the device 400 is capable of operating according to the implementation of the present disclosure, as described herein with reference to FIGS. 1 to 4. Figure 3 Implementations herein may be implemented by computer software executable by a processor 410 of the device 400, or by hardware, or by a combination of software and hardware. The processor 410 may be configured to implement various implementations of the present disclosure. In addition, the combination of the processor 410 and the memory 420 may form a processing component 450 suitable for implementing various implementations of the present disclosure.

[0099] Memory 420 may be of any type suitable for a local technology network and may be implemented using any suitable data storage technology, such as non-transitory computer-readable storage media, semiconductor-based storage devices, magnetic storage devices and systems, optical storage devices and systems, fixed memory, and removable memory, as non-limiting examples. Although only one memory 420 is shown in device 400, there may be multiple physically distinct memory modules in device 400. Processor 410 may be of any type suitable for a local technology network and may include one or more of a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), and a processor based on a multi-core processor architecture, as non-limiting examples. Device 400 may have multiple processors, such as application-specific integrated circuit chips, which are clocked from a synchronized master processor in time.

[0100] The components included in the apparatus and / or equipment of the present disclosure can be implemented in a variety of ways, including software, firmware, or any combination thereof. In one embodiment, one or more units can be implemented using software and / or firmware, for example, machine executable instructions stored on a storage medium. In addition to or in place of machine executable instructions, some or all of the units in the apparatus and / or equipment, at least some of the units, can be implemented by one or more hardware logic components. For example, and not limited to, schematic types of hardware logic components that can be used include field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), etc.

[0101] In general, various embodiments of the present disclosure may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. Some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software executed by a controller, microprocessor, or other computing device. When aspects of various embodiments of the present disclosure are illustrated and described as block diagrams, or when some other graphical representations are used, it should be understood that the blocks, configurations, systems, techniques, or methods herein may be implemented as non-limiting examples in general hardware or controllers or other computing devices, or some combination thereof.

[0102] The present disclosure also provides at least one tangible computer program product tangibly stored on a non-transitory computer-readable storage medium. The computer program product includes computer executable instructions, such as those included in a program module, executed in a device on a target real or virtual processor to perform the above-mentioned reference Figure 2Method 200 described. In general, computer modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The functionality of program modules can be combined or split between program modules as required in various embodiments. In distributed devices, program modules can be located in both local and remote storage media.

[0103] The program code for executing the disclosed method can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer and a special-purpose computer, or other programmable data processing device, so that when the processor or controller executes the program code, the function / operation specified by the flow chart and / or block diagram is realized. The program code can be executed completely or partially on the machine, partially on the machine as an independently running software package, partially on a remote machine, or completely on a remote machine or server.

[0104] In the context of the present disclosure, computer program codes or related data may be carried by any suitable carrier to enable a device, apparatus or processor to perform the various processes and operations described above. Examples of carriers include signals and computer-readable media.

[0105] The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or equipment, or any suitable combination of the foregoing. More specific examples of computer readable media may include an electrical connection with one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0106] For the purposes of the present disclosure described herein above, it should be noted that

[0107] - the method steps which may be implemented as software code parts and executed using a processor in a network element or terminal (such as an example of a device, means and / or module thereof, or thus such an entity comprising means and / or modules) are independent software codes and may be specified using any known or future developed program software, as long as the functionality defined by the method steps is preserved;

[0108] - in general, anything suitable for being implemented as software, or by hardware, without changing the idea of ​​the invention in terms of the implemented functions;

[0109] - the method steps and / or devices, units or components that may be implemented as hardware components of the apparatus defined above or any of its (multiple) modules (for example, performing the functions of the apparatus according to the embodiments described above, such as the eNodeB described above, etc.) are independent hardware and may be implemented using any known or future developed hardware technology or a mixture of any of these technologies, such as MOS (metal oxide semiconductor), CMOS (complementary MOS), BiMOS (polar MOS), BiCMOS (polar CMOS), ECL (emitter coupled logic), TTL (transistor-transistor logic), etc., using, for example, ASIC (application specific IC (integrated circuit)) components, FPGA (field programmable gate array) components, CPLD (complex programmable logic device) components or DSP (digital signal processor) components;

[0110] - devices, units or components (e.g. the means defined above, or any of their respective components) may be implemented as a single device, unit or component, but this does not exclude that they are implemented in a distributed manner throughout the system, as long as the functionality of the device, unit or component is preserved;

[0111] - the device may be implemented by a semiconductor chip, a chipset, or a (hardware) module comprising such a chip or chipset, however this does not exclude the possibility that the functionality of the device or module is not implemented by hardware but as software in a module (software), such as a computer program or a computer program product comprising executable software code portions for execution or running on a processor;

[0112] - A device may be considered as a means or an assembly of more than one means, for example, either functionally cooperating with each of the other devices or functionally independent of each of the other devices but in the same device housing.

[0113] It should be noted that the embodiments and examples described above are provided for illustrative purposes only, and are not intended to limit the present invention thereto. On the contrary, it is intended that all variations and modifications be included within the spirit and scope of the appended claims.

[0114] Then, when describing operation in a specific order, this should not be understood as requiring such operation to be performed in the specific order shown or in a continuous order, or requiring all illustrated operations to be performed to achieve the desired result. In some environments, multitasking and parallel processing may be beneficial. Similarly. When the above discussion includes the details of several specific implementations, these should be interpreted as limitations on the scope of the present disclosure, rather than as the description or features of a clear specific embodiment. Some features described in the context of a separate embodiment can also be realized in the combination of a single embodiment. On the contrary, the various features described in the context of a single embodiment can also be realized in a plurality of separate embodiments or in any suitable sub-combination.

[0115] Although the present disclosure is described in language that specifies structural features and / or methodological acts, it should be understood that the present disclosure defined in the appended claims is not necessarily limited to the specific features or acts described above. Instead, the specific features and acts described above are disclosed as example forms of implementing the claims.

[0116] Various embodiments of the present technology have been described. In addition to or as an alternative to the above, the following examples are described. The features described in any of the following examples can be utilized with other examples described herein.

Claims

1. A device for data processing, comprising: at least one processor; as well as at least one memory including computer program code; The at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to at least: A first input and a second input are obtained from a channel decoding process, and a sum-product operation is performed on the first input and the second input, the sum-product operation comprising one or more sub-operations, wherein the first input indicates a first ratio between a first likelihood that a first received bit is decoded as a first value and a second likelihood that the first received bit is decoded as a second value; and wherein the second input indicates a second ratio between a third likelihood that a second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value, wherein the sum-product operation performs the following operation in the logarithmic domain: Wherein A and B represent the first input and the second input respectively; Determining a set of mapping relationships for approximating at least one of the one or more sub-operations; Determine a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input, and the mapping relationship set; as well as The channel decoding process is continued based on the first result.

2. The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, together with the at least one processor, cause the apparatus to: Determine a second result of the one or more sub-operations based on the first input, the second input, and the mapping relationship set; and The first result is determined based at least on the second result.

3. The apparatus of claim 2, wherein the at least one memory and the computer program code are configured to, together with the at least one processor, cause the apparatus to: determining a first absolute value of a sum of the first input and the second input; Determine first candidate results of the one or more sub-operations based on the first absolute value and the mapping relationship set; determining a second absolute value of a difference between the first input and the second input; Determine a second candidate result of the one or more sub-operations based on the second absolute value and the mapping relationship set; as well as By comparing the first absolute value and the second absolute value, one of the first candidate result, the second candidate result and a predetermined value is selected as the second result.

4. The apparatus according to claim 1, wherein the set of mapping relationships is stored as a lookup table in a memory, and wherein the at least one memory and the computer program code are configured to, together with the at least one processor, cause the apparatus to: The lookup table representing the mapping relationship set is obtained from the memory.

5. The apparatus of claim 1, wherein the channel decoding process is used to decode a low density parity check (LDPC) code.

6. The apparatus according to claim 1, wherein the channel decoding process is used to decode polar codes and / or Redmueller codes.

7. A method for data processing, comprising: A first input and a second input are obtained from a channel decoding process, and a sum-product operation is performed on the first input and the second input, the sum-product operation comprising one or more sub-operations, wherein the first input indicates a first ratio between a first likelihood that a first received bit is decoded as a first value and a second likelihood that the first received bit is decoded as a second value; and wherein the second input indicates a second ratio between a third likelihood that a second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value, wherein the sum-product operation performs the following operation in the logarithmic domain: Wherein A and B represent the first input and the second input respectively; Determining a set of mapping relationships for approximating at least one of the one or more sub-operations; Determine a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input, and the mapping relationship set; as well as The channel decoding process is continued based on the first result.

8. The method of claim 7, wherein determining the first result comprises: Determine a second result of the one or more sub-operations based on the first result, the second input, and the mapping relationship set; as well as The first result is determined based at least on the second result.

9. The method of claim 8, wherein determining the second result comprises: determining a first absolute value of a sum of the first input and the second input; Determine first candidate results of the one or more sub-operations based on the first absolute value and the mapping relationship set; determining a second absolute value of a difference between the first input and the second input; Determine a second candidate result of the one or more sub-operations based on the second absolute value and the mapping relationship set; as well as By comparing the first absolute value and the second absolute value, one of the first candidate result, the second candidate result and a predetermined value is selected as the second result.

10. The method of claim 7, wherein the set of mapping relationships is stored as a lookup table in a memory, and wherein determining the set of mapping relationships comprises: The lookup table representing the mapping relationship set is obtained from the memory.

11. The method of claim 7, wherein the channel decoding process is used to decode a low density parity check (LDPC) code.

12. The method according to claim 7, wherein the channel decoding process is used to decode polar codes and / or Redmueller codes.

13. An apparatus comprising: Means for obtaining a first input and a second input from a channel decoding process, performing a sum-product operation on the first input and the second input, the sum-product operation comprising one or more sub-operations, wherein the first input indicates a first ratio between a first likelihood that a first received bit is decoded as a first value and a second likelihood that the first received bit is decoded as a second value; and wherein the second input indicates a second ratio between a third likelihood that a second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value, wherein the sum-product operation performs the following operation in a logarithmic domain: Wherein A and B represent the first input and the second input respectively; means for determining a set of mapping relationships for approximating at least one of the one or more sub-operations; means for determining a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input and the set of mapping relationships; as well as Means for continuing the channel decoding process based on the first result.

14. The device of claim 13, wherein the component comprises: at least one processor; as well as At least one memory including computer program code, the at least one memory and the computer program code being configured to, with the at least one processor, cause execution of the apparatus.

15. A computer-readable storage medium comprising program instructions stored thereon, which instructions, when executed by a processor of a device, cause the device to: A first input and a second input are obtained from a channel decoding process, and a sum-product operation is performed on the first input and the second input, the sum-product operation comprising one or more sub-operations, wherein the first input indicates a first ratio between a first likelihood that a first received bit is decoded as a first value and a second likelihood that the first received bit is decoded as a second value; and wherein the second input indicates a second ratio between a third likelihood that a second received bit is decoded as the first value and a fourth likelihood that the second received bit is decoded as the second value, wherein the sum-product operation performs the following operation in the logarithmic domain: Wherein A and B represent the first input and the second input respectively; determining a set of mapping relationships for approximating at least one of the one or more sub-operations of the sub-operation; Determine a first result of the sum-product operation performed on the first input and the second input based on the first input, the second input, and the mapping relationship set; as well as The channel decoding process is continued based on the first result.