Encoder structure for high reliability in short block length intervals
By designing an enhanced QC-LDPC encoder to maximize the Tannerto length, the high reliability and low latency issues of wireless communication systems in the short block length range are solved, achieving better error leveling performance and lower complexity.
Patent Information
- Application Number
- CN202580007897.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-01-12
- Filing Date
- 2025-01-11
- Publication Date
- 2026-07-24
AI Technical Summary
Existing wireless communication systems struggle to achieve high reliability and low latency within short block length ranges, especially in applications such as eURLLC, where existing technologies cannot effectively address the issue of a block error rate (BLER) of less than 10⁻⁷.
An enhanced quasi-cyclic low-density parity-check (QC-LDPC) encoder design is adopted. By designing the permutation matrix to maximize the length of the Tanner diagram, the encoder structure is optimized to achieve a larger length Tanner diagram while maintaining low complexity and a simple hardware implementation.
Within the short to medium block length range, it significantly improves error leveling performance, achieving a lower block error rate (BLER), while maintaining low encoder complexity and hardware simplicity.
Smart Images

Figure CN122460013A_ABST
Abstract
Description
Cross-reference of related applications
[0001] This application claims priority to U.S. Provisional Patent Application No. 63 / 620,332, filed January 12, 2024, entitled "Encoder Structure for High Reliability in Short Block-Lengthregimes," the entire contents of which are hereby incorporated by reference. Technical Field
[0002] This disclosure relates to wireless communication, and more specifically to coded information used in wireless communication. Background Technology
[0003] A wireless communication system may include one or more network communication devices, such as base stations, that support wireless communication for one or more user communication devices, which may also be referred to as user equipment (UE) or other suitable terms. The wireless communication system can support wireless communication with one or more user communication devices by utilizing the resources of the wireless communication system (e.g., time resources (e.g., symbols, time slots, subframes, frames, etc.) or frequency resources (e.g., subcarriers, carriers, etc.)). Furthermore, the wireless communication system can support wireless communication across a variety of radio access technologies, including third-generation (3G), fourth-generation (4G), fifth-generation (5G), and other suitable radio access technologies other than 5G (e.g., sixth-generation (6G)).
[0004] Compared to the latency within 5G NR wireless communication systems, some use cases supported by wireless communication systems (such as enhanced ultra-reliable low-latency communication (eURLLC)) are expected to rely on significantly lower end-to-end latency (less than 1 ms) and the achievement of high levels of transmit reliability (e.g., where the block error rate (BLER) is less than 10). -7 ).
[0005] eURLLC and similar communication use cases enable certain emerging applications, such as factory applications, haptic internet services, distributed utility grids, metaverse applications, and mission-critical applications (e.g., remote surgery, autonomous driving, factory automation). Therefore, wireless communication systems, such as 5G NR or 6G radio access technologies, can seek to implement standardization processes to achieve enhanced end-to-end latency and reliability parameters. Summary of the Invention
[0006] The article “a” preceding an element is not limited and should be understood to refer to “at least one” or “one or more” of those elements. The terms “a,” “at least one,” “one or more,” and “at least one of one or more” are interchangeable. As used herein, the word “or” included in the claims, as used in a list of items (e.g., a list of items beginning with phrases such as “at least one,” “one or more,” or “one or two”), indicates an inclusive list such that a list of at least one of, for example, A, B, or C, means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). Furthermore, as used herein, the phrase “based on” should not be construed as referring to a closed set of conditions. For example, without departing from the scope of this disclosure, an example step described as “based on condition A” may be based on both condition A and condition B. In other words, as used herein, the phrase “based on” should be interpreted in the same manner as the phrase “at least partially based on.” Furthermore, as used herein, included in the claims, “group” may comprise one or more elements.
[0007] This disclosure relates to methods, apparatus, and systems for facilitating the design and implementation of enhanced encoder designs, such as quasi-cyclic low-density parity-check (QC-LDPC) encoders.
[0008] Some embodiments of the methods and apparatus described herein may further include an encoder comprising: at least one memory; and at least one processor coupled to the at least one memory and configured such that the encoder: applies a permutation matrix to a parity check matrix of a quasi-cyclic low-density parity-check (QC-LDCP) code or to an information bit vector to which the parity check matrix is applied, generates a codeword based on the parity check matrix of the QC-LDCP code applied to the permutation matrix, and transmits the generated codeword to a decoder via a data channel.
[0009] In some embodiments of the methods and apparatus described herein, the at least one processor is further configured to cause the encoder to generate a set of permutation matrices associated with the circumference of the Tanner map that maximizes the QC-LDPC code, and to select the permutation matrix from the generated set of permutation matrices.
[0010] In some implementations of the methods and apparatus described herein, each permutation matrix in the set of permutation matrices is associated with the code rate, bit size, Tanner diagram girth, and target block error rate (BLER) performance.
[0011] In some implementations of the methods and apparatus described herein, the BLER performance is determined based on Monte Carlo simulations performed on an additive white Gaussian noise (AWGN) channel.
[0012] In some embodiments of the methods and apparatus described herein, each of the set of permutation matrices is designed based on a modified progressive edge growth (PEG) algorithm.
[0013] In some embodiments of the methods and apparatus described herein, applying the permutation matrix to the parity check matrix of the QC-LDCP code preserves the quasi-cyclic property of the parity check matrix.
[0014] In some implementations of the methods and devices described herein, the QC-LDCP code is a 5G New Radio (NR) LCDP code.
[0015] In some implementations of the methods and devices described herein, the encoder is part of a network entity of a 5G communication network.
[0016] Some embodiments of the methods and apparatus described herein may further include a processor for wireless communication, comprising: at least one controller coupled to at least one memory and configured such that the processor: applies a permutation matrix to a parity check matrix of a QC-LDCP code or an information bit vector to which the parity check matrix is applied; generates a codeword based on the parity check matrix of the QC-LDCP code applied to the permutation matrix; and transmits the generated codeword to a receiver via a data channel.
[0017] In some embodiments of the methods and apparatus described herein, the at least one controller is further configured to cause the processor to generate a set of permutation matrices associated with maximizing the circumference of the Tanner diagram of the QC-LDPC code, and to select the permutation matrix from the generated set of permutation matrices.
[0018] In some implementations of the methods and apparatus described herein, each of the set of permutation matrices is associated with code rate, bit size, Tanner map encirclement length, and target block error rate (BLER) performance.
[0019] Some embodiments of the methods and apparatus described herein may further include a decoder comprising: at least one memory; and at least one processor coupled to the at least one memory and configured such that the decoder: receives reference bits of a permutation matrix representing a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied, and decodes a received codeword using the permutation matrix referenced by the received reference bits, which is signaled in downlink control information (DCI).
[0020] In some embodiments of the methods and apparatus described herein, the reference bit is referenced by a modulation and coding scheme (MCS) field within the DCI.
[0021] In some embodiments of the methods and apparatus described herein, the MCS field of the DCI may include the reference bit pointing to the permutation matrix modulation and the code rate in the associated MCS table column.
[0022] In some embodiments of the methods and apparatus described herein, the reference bit is signaled within a new DCI field of the DCI.
[0023] In some embodiments of the methods and apparatus described herein, the size of the new DCI field is based on the number of table column permutation matrices from which the permutation matrix is selected.
[0024] In some implementations of the methods and apparatus described herein, the reference bit is signaled within a dedicated field of the new DCI format.
[0025] Some embodiments of the methods and apparatus described herein may further include a processor for wireless communication, comprising: at least one controller coupled to at least one memory and configured such that the processor: receives reference bits representing a permutation matrix of a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied, and decodes a received codeword using the permutation matrix represented by the received reference bits.
[0026] In some embodiments of the methods and apparatus described herein, the reference bit is received within the DCI.
[0027] In some embodiments of the methods and apparatus described herein, the reference bit is referenced by the MCS field within the DCI. Attached Figure Description
[0028] Figure 1 Examples of wireless communication systems according to aspects of this disclosure are described.
[0029] Figure 2 This describes an example encoder structure based on aspects of this disclosure.
[0030] Figures 3A to 3B Example graphs illustrating the performance of LDPC codes at different block sizes, according to aspects of this disclosure.
[0031] Figure 4 This describes another example of an encoder structure based on aspects of this disclosure.
[0032] Figure 5 Examples of user equipment (UE) according to aspects of this disclosure are described.
[0033] Figure 6Examples of processors according to aspects of this disclosure are described.
[0034] Figure 7 Examples of network equipment (NE) according to aspects of this disclosure are described.
[0035] Figure 8 A flowchart illustrating the method performed by the encoder according to aspects of this disclosure.
[0036] Figure 9 A flowchart illustrating the method performed by the decoder according to aspects of this disclosure. Detailed Implementation
[0037] As described in this paper, eURLLC, which includes communication with short packet sizes and short block lengths, can achieve various key performance indicators (KPIs), such as low end-to-end transmit latency and ultra-reliability (10). -7 Services with stringent requirements for packet size flexibility and / or availability. This type of communication provides connectivity for enhanced services, such as emerging applications and services from vertical industries, and plays a crucial role in providing connectivity for new services and applications from vertical industries such as factory automation, haptic internet, and autonomous driving.
[0038] To meet these KPIs, legacy channel codes (e.g., LDPC and polar codes) can be updated and / or enhanced. For example, for large block lengths, the system can use asymptotic techniques (e.g., density evolution techniques) to estimate the performance of LDPC codes. Data channels (e.g., 5G NR data channels) utilize QC-LDPC codes due to the low-complexity implementation of QC-LDPC codes and their near-Shannon-limit performance based on iterative decoding on a very close additive white Gaussian noise (AWGN) channel.
[0039] However, for finite (e.g., short) block lengths, such techniques may be ineffective in performance estimation. Iterative decoding of finite-length codes can demonstrate abrupt changes in its error rate curve (known as error flattening) across a range of high signal-to-noise ratio (SNR) and low bit error rate (BER).
[0040] For example, short cycles can lead to capture and absorption sets within an LDPC Tanner graph. A Tanner graph, or bipartite graph, contains two sets of nodes: variable nodes and check nodes. Variable nodes correspond to the number of code symbols, and check nodes correspond to the number of parity symbols. Edges connect variable nodes constrained by check nodes. For a Tanner graph, an edge has a length... The ring is inside the diagram A path with edges that closes itself. The girth of the code. It is the length of the shortest cycle within the Tanner diagram associated with the code. Cycles can be used to degrade the performance of iterative decoding algorithms for LDPC codes.
[0041] Furthermore, since belief propagation (BP) or sum-product algorithm (SPA) on acyclic Tanna graphs can provide optimal decoding, minimizing the influence of cycles during the iterative decoding process can enhance performance when decoding finite-length codes. For example, when the cycles are long enough, the decoding algorithm can run for several iterations unaffected by the cycle length, while the error rate decreases exponentially with the number of independent iterations. For example, the progressive edge growth (PEG) construction can design Tanna graphs with large minimum cycle lengths (encirclements) in a best-effort sense by progressively building edges between symbol nodes and check nodes in an edge-by-edge manner.
[0042] Therefore, the systems and methods described herein provide enhanced error-flattening performance of QC-LDPC codes in the small to medium block length range by maximizing the girth of the QC-LDPC Tanner diagram using a permutation matrix. For example, the systems and methods provide novel or enhanced QC-LDPC encoder designs (and associated signaling) that achieve larger girths (e.g., the length of the shortest loop of the Tanner diagram) without increasing the complexity of the hardware implementation of the QC-LDPC encoder. Thus, the enhanced encoder facilitates the use of finite-length LDPC codes for wireless communication data channels, among other benefits.
[0043] Figure 1 This section describes an example of a wireless communication system 100 according to aspects of this disclosure. The wireless communication system 100 may include one or more NEs 102, one or more UEs 104, and a core network (CN) 106. The wireless communication system 100 may support various radio access technologies. In some embodiments, the wireless communication system 100 may be a 4G network, such as an LTE network or an LTE-A network. In some other embodiments, the wireless communication system 100 may be an NR network, such as a 5G network, a 5G-A network, or a 5G Ultra Wideband (5G-UWB) network. In other embodiments, the wireless communication system 100 may be a combination of 4G and 5G networks, or other suitable radio access technologies, including IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), and IEEE 802.20. The wireless communication system 100 may support radio access technologies other than 5G, such as 6G. In addition, the wireless communication system 100 can support technologies such as Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), or Code Division Multiple Access (CDMA).
[0044] One or more NEs 102 may be distributed across a geographical area to form a wireless communication system 100. One or more of the NEs 102 described herein may be, include, or be referred to as a network node, base station, network element, network function, network entity, radio access network (RAN), NodeB, eNodeB (eNB), next-generation NodeB (gNB), or other suitable terms. NEs 102 and UEs 104 may communicate via a communication link, which may be a wireless or wired connection. For example, NEs 102 and UEs 104 may perform wireless communication (e.g., receive signaling, transmit signaling) via a Uu interface.
[0045] NE 102 can provide a geographic coverage area within which it can support services for one or more UEs 104. For example, NE 102 and UE 104 can support wireless communication of signals associated with services (e.g., voice, video, packet data, messaging, broadcasting, etc.) based on one or more radio access technologies. In some embodiments, NE 102 can be mobile, for example, a satellite associated with a non-terrestrial network (NTN). In some embodiments, different geographic coverage areas associated with the same or different radio access technologies may overlap, but different geographic coverage areas may be associated with different NEs 102.
[0046] One or more UEs 104 may be distributed across a geographical area of the wireless communication system 100. UE 104 may include or be referred to as a remote unit, mobile device, wireless device, remote device, subscriber device, transmitter device, receiver device, or some other suitable term. In some implementations, UE 104 may be referred to as a unit, station, terminal, or client, and other instances thereof. Additionally or alternatively, UE 104 may be referred to as an Internet of Things (IoT) device, an Internet of Everything (IoE) device, or a Machine Type Communication (MTC) device, and other instances thereof.
[0047] UE 104 may be able to support direct wireless communication with other UE 104 via a communication link. For example, UE 104 may support direct wireless communication with another UE 104 via a device-to-device (D2D) communication link. In some implementations, such as vehicle-to-vehicle (V2V) deployments, vehicle-to-everything (V2X) deployments, or cellular-V2X deployments, the communication link may be referred to as a sidelink. For example, UE 104 may support direct wireless communication with another UE 104 via a PC5 interface.
[0048] NE 102 may support communication with CN 106 or with another NE 102 or both. For example, NE 102 may interface with other NE 102 or CN 106 via one or more backhaul links (e.g., S1, N2, N2, or network interfaces). In some embodiments, NE 102 may communicate directly with each other. In some other embodiments, NE 102 may communicate with each other or indirectly (e.g., via CN 106). In some embodiments, one or more NE 102 may include sub-components, such as access network entities, which may be instances of access node controllers (ANCs). The ANC may communicate with one or more UE 104s via one or more other access network transmitting entities (which may be referred to as radio heads, smart radio heads, or transmit-receive points (TRPs)).
[0049] CN 106 can support user authentication, access authorization, tracking, connectivity, and other access, routing, or mobility functions. CN 106 can be an evolved packet core (EPC) or a 5G core (5GC), which may include control plane entities that manage access and mobility (e.g., a mobility management entity (MME), access and mobility management functions (AMF)) and user plane entities that route or interconnect packets to external networks (e.g., a serving gateway (S-GW), a packet data network (PDN) gateway (P-GW), or a user plane function (UPF)). In some implementations, the control plane entities may manage non-access stratum (NAS) functions of one or more UEs 104 served by one or more NEs 102 associated with CN 106, such as mobility, authentication, and bearer management (e.g., data bearers, signaling bearers, etc.).
[0050] CN 106 can communicate with the packet data network via one or more backhaul links (e.g., via S1, N2, N2, or another network interface). The packet data network may contain an application server. In some implementations, one or more UEs 104 can communicate with the application server. UE 104 can establish a session (e.g., a Protocol Data Unit (PDU) session, etc.) with CN 106 via NE 102. CN 106 can use the established session (e.g., an established PDU session) to route services (e.g., control information, data, etc.) between UE 104 and the application server. A PDU session may be an instance of a logical connection between UE 104 and CN 106 (e.g., one or more network functions of CN 106).
[0051] In the wireless communication system 100, NE 102 and UE 104 can use the resources of the wireless communication system 100 (e.g., time resources (e.g., symbols, time slots, subframes, frames, etc.) or frequency resources (e.g., subcarriers, carriers)) to perform various operations (e.g., wireless communication). In some embodiments, NE 102 and UE 104 may support different resource structures. For example, NE 102 and UE 104 may support different frame structures. In some embodiments, such as in 4G, NE 102 and UE 104 may support a single frame structure. In some other embodiments, such as in 5G and other suitable radio access technologies, NE 102 and UE 104 may support various frame structures (i.e., multiple frame structures). NE 102 and UE 104 may support various frame structures based on one or more parameter sets.
[0052] The wireless communication system 100 may support one or more parameter sets, and the parameter sets may include subcarrier spacing and cyclic prefixes. A first parameter set (e.g., μ=0) may be associated with a first subcarrier spacing (e.g., 15 kHz) and a regular cyclic prefix. In some embodiments, the first parameter set (e.g., μ=0) associated with the first subcarrier spacing (e.g., 15 kHz) may utilize one time slot per subframe. A second parameter set (e.g., μ=1) may be associated with a second subcarrier spacing (e.g., 30 kHz) and a regular cyclic prefix. A third parameter set (e.g., μ=2) may be associated with a third subcarrier spacing (e.g., 60 kHz) and a regular cyclic prefix or an extended cyclic prefix. A fourth parameter set (e.g., μ=3) may be associated with a fourth subcarrier spacing (e.g., 120 kHz) and a regular cyclic prefix. A fifth parameter set (e.g., μ=4) may be associated with a fifth subcarrier spacing (e.g., 240 kHz) and a regular cyclic prefix.
[0053] Time intervals for resources (e.g., communication resources) can be organized according to frames (also known as radio frames). Each frame may have a duration, for example, 10 milliseconds (ms). In some embodiments, each frame may contain multiple subframes. For example, each frame may contain 10 subframes, and each subframe may have a duration, for example, 1 ms. In some embodiments, each frame may have the same duration. In some embodiments, each subframe of a frame may have the same duration.
[0054] Alternatively, the time intervals of resources (e.g., communication resources) can be organized according to time slots. For example, a subframe may contain a certain number (e.g., quantity) of time slots. The number of time slots in each subframe may also depend on one or more parameter sets supported in the wireless communication system 100. For example, the first, second, third, fourth, and fifth parameter sets (i.e., μ=0, μ=1, μ=2, μ=3, μ=4) associated with corresponding subcarrier intervals of 15 kHz, 30 kHz, 60 kHz, 120 kHz, and 240 kHz may utilize a single time slot per subframe, two time slots per subframe, four time slots per subframe, eight time slots per subframe, and 16 time slots per subframe, respectively. Each time slot may contain a certain number (e.g., quantity) of symbols (e.g., OFDM symbols). In some embodiments, the number (e.g., quantity) of time slots in a subframe may depend on the parameter set. For a conventional cyclic prefix, a time slot may contain 14 symbols. For an extended cyclic prefix (e.g., applicable to a 60 kHz subcarrier spacing), a time slot may contain 12 symbols. The relationship between the number of symbols per time slot for the regular cyclic prefix and the extended cyclic prefix, the number of time slots per subframe, and the number of time slots per frame may depend on the parameter set. It should be understood that references to the first parameter set (e.g., μ=0) associated with the first subcarrier spacing (e.g., 15 kHz) may be used interchangeably between subframes and time slots.
[0055] In the wireless communication system 100, the electromagnetic (EM) spectrum can be divided into various categories, frequency bands, channels, etc., based on frequency or wavelength. For example, the wireless communication system 100 may support one or more operating frequency bands, such as frequency range names FR1 (410 MHz to 7.125 GHz), FR2 (24.25 GHz to 52.6 GHz), FR3 (7.125 GHz to 24.25 GHz), FR4 (52.6 GHz to 114.25 GHz), FR4a or FR4-1 (52.6 GHz to 71 GHz), and FR5 (114.25 GHz to 300 GHz). In some embodiments, NE 102 and UE 104 may perform wireless communication on one or more of the operating frequency bands. In some embodiments, FR1 may be used by NE 102 and UE 104, as well as other equipment or devices, for cellular communication services (e.g., control information, data). In some implementations, FR2 can be used by NE 102 and UE 104, as well as other equipment or devices, for short-range, high data rate capabilities.
[0056] FR1 may be associated with one or more parameter sets (e.g., at least three parameter sets). For example, FR1 may be associated with a first parameter set containing a 15 kHz subcarrier spacing (e.g., μ=0); a second parameter set containing a 30 kHz subcarrier spacing (e.g., μ=1); and a third parameter set containing a 60 kHz subcarrier spacing (e.g., μ=2). FR2 may be associated with one or more parameter sets (e.g., at least two parameter sets). For example, FR2 may be associated with a third parameter set containing a 60 kHz subcarrier spacing (e.g., μ=2); and a fourth parameter set containing a 120 kHz subcarrier spacing (e.g., μ=3).
[0057] As described herein, the technology provides a novel or enhanced encoder design, such as a QC-LDPC encoder, for encoding QC-LDPC codes utilized by eURLLC and other data communications with short packet sizes and short block lengths. The QC-LDPC encoder described herein achieves larger Tannertu lengths while maintaining a low-complexity encoding scheme and simple hardware implementation. As described herein, the QC-LDPC encoder provides better error leveling performance for short-length intervals.
[0058] For example, a QC-LDPC parity check matrix can be constructed using a base map (e.g., one of the two base maps defined in the 3GPP specification) and a selected boost size and cyclic matrix. The choice of base map and / or boost size depends on the code rate and the information bit length. Therefore, the resulting parity check matrix H has a length of... The technique described in this paper designs and / or implements one or more permutation matrices π by selectively permuting carefully chosen columns and / or rows of H. i This promotes higher shortest cycle lengths in the graph while maintaining the quasi-cyclic property of the parity check matrix.
[0059] In some cases, the design or configuration of the permutation matrix is based on a modified progressive edge growth (PEG) algorithm. This technique can provide better error flattening performance for short to medium QC-LDPC code block lengths by eliminating absorption sets within the LDPC Tanner diagram.
[0060] Furthermore, for the decoder or receiver used to decode the received codeword, the technique (e.g., from the encoder) can signal the parameters of the permutation matrix to the decoder. The decoder, having received the codeword and parameters, can perform LDPC iterative decoding on the codeword. In some cases, using the techniques described herein, iterative decoding convergence at the decoder can be achieved in fewer iterations due to the elimination or minimization of the capture set and other benefits.
[0061] Figure 2This describes an example encoder 200 structure according to aspects of this disclosure. As described herein, the encoder 200 (e.g., a QC-LDPC encoder) is designed or constructed to include a permutation matrix 250 or an interleaver that permutates the QC-LDPC parity matrix. The permutation matrix 250 is designed or configured to achieve a larger Tannertu encirclement length, allowing for better error leveling performance at short to medium block lengths.
[0062] In some cases, the permutation matrix design is based on a modified version of the Progressive Edge Growth (PEG) algorithm, aiming to maximize the Tanner graph perimeter or the connectivity between the shortest node and the rest of the graph nodes (e.g., maximizing the ACE metric) when the perimeter cannot be maximized beyond a certain value. Furthermore, the encoder 200 can determine several permutation matrices for different bit rates and block sizes. The encoder 200 can table the permutation matrices along with the implemented perimeter and BLER performance. Therefore, the encoder complexity remains unaffected while maintaining the quasi-cyclic property of the parity check matrix after permutation.
[0063] In some embodiments, the permutation matrix is 250 or π. i It can be designed based on a modified progressive edge growth (PEG) algorithm and can be applied to enclosing a certain Tanner diagram. The parity check matrix of the constructed NR QC-LDPC code is 2^30 or H. The permutation matrix maximizes the Tanner diagram length H, which achieves better error-flattening performance of the LDPC code in medium and short block length ranges.
[0064] In some cases, the girth optimization procedure can be performed offline or before encoding the information bits. Encoder 200 can list or select, via selection module 260, permutation matrices corresponding to different bit rates, girth values, BLER performance, and / or information bit sizes. Therefore, the selected permutation matrix 250 or π i The columns and / or rows of the parity check matrix (PCM) 230 or H are permuted to maximize the shortest loop length without affecting encoder complexity and hardware implementation. This design enhances the short block length range, where 5G NR LDPC codes exhibit approximately 10 for certain block lengths and code rates. -4 The incorrect leveling.
[0065] Maximizing the Tannertu circumference allows for better QC-LDPC performance in the waterfall zone and better performance in the error level zone. Figures 3A to 3B Example graphs illustrating the performance of QC-LDPC codes at different block sizes, according to aspects of this disclosure. For example, Figure 3A The graph 300 shown depicts the performance of the LDPC code at different short block sizes with a code rate of 0.66667. As another example, Figure 3BThe graph 350 shown depicts the performance of the LDPC code at different short block sizes with a code rate of 0.5.
[0066] In some embodiments, the encoder 200 may include a legacy basemap selection 210, a boost size and cyclic matrix selection 220, and a determined LDPC parity matrix 230 or H. The structure may also include a permutation matrix 250 and a permutation matrix selection module 240. The selected permutation matrix 250 is applied to the selected parity matrix 230, and the encoder 200 performs permutations on columns and / or rows of the parity matrix H to generate or form a new LDPC parity matrix column 260, or... .
[0067] New matrix 260 encoded information bits b j , 1 ≤ j ≤ k, such that:
[0068] .
[0069] When the perimeter cannot be maximized beyond a certain value, the algorithm can maximize the node connectivity measured by ACE (Approximate Ring EMD), a parameter that measures the connectivity of a ring to the rest of the graph and can be determined based on the degree of the nodes. Therefore, the algorithm can design a permutation matrix that maintains a relatively small perimeter but maximizes the ACE of variable nodes within the shortest ring. This design achieves better error leveling performance and convergence of the iterative decoder in fewer iterations.
[0070] In some cases, permutation matrices can be designed such that the quasi-cyclic property of H is preserved. For example, row or column permutations may not be possible within the same cyclic matrix (e.g., belonging to a cyclic matrix). The column Will belong to another circular matrix Another column (Perform a substitution). This design can further constrain the optimization problem.
[0071] In some cases, It can be designed to be non-quasi-cyclic, where the parity check matrix is unstructured and can be considered a pseudo-random matrix. However, in both cases, the parity check matrix can be sparse, and the associated iterative decoder can successfully decode the codewords generated by encoder 200, potentially introducing additional complexity at encoder 200.
[0072] In some embodiments, given the correlation of matrix multiplication, the encoding process of information bit vector b can be expressed as follows:
[0073] ,
[0074] Where G is the LDPC code generator matrix, and c is the codeword. Using this encoding process, the QC LDPC code properties are preserved, and the permutation matrix is applied to the information bit vector b.
[0075] Furthermore, as described in this paper, in some cases, the permutation matrix π i This can be a deterministic interleaver applied to the information sequence prior to the LDPC encoding process. In these cases, the LDPC encoding structure can maintain its low complexity based on the interleaver and a simple linear shift register. The permutation matrix can be listed based on the desired gravitational length and the target BLER performance. Table 1 presents the permutation matrix and its associated properties:
[0076]
[0077] Table 1
[0078] In some embodiments, different permutation matrices associated with different code rates and information bit block lengths can be determined offline by solving corresponding optimization problems. In such cases, the different permutation matrices can be tabulated. As described above, Table 1 maps the permutation matrices to associated properties, such as achievable maximum girth, code rate, block length, and block error rate (BLER) performance. In some cases, BLER performance can be determined by running Monte Carlo simulations on a BI-AWGN channel.
[0079] In some embodiments, solving the convex optimization problem described herein enables the design of a permutation matrix for maximizing the girth of an LDPC Tanna graph. For example, the permutation matrix design algorithm can be based on a combination of a modified PEG algorithm and an ACE-constrained algorithm. The main difference is that PEG is used to construct LDPC codes with large girths given the degree distribution of the variable nodes. However, in some cases, the input to the modified PEG algorithm is a girth value. The QC-LDPC parity check matrix H, and the algorithm allows the design of outputs with a circumference of H. Parity check matrix The substitution makes .
[0080] Given The parity check matrix H is as follows:
[0081]
[0082] in and , Represents a cyclic permutation matrix, in columns and (in It is 1 at the point specified in TR.38.211 (based on the boost size) and zero elsewhere. Therefore, express Zero matrix. Furthermore, due to submatrix , Each of them The rank of H is at most 1 when the rows are summed over all vectors of one. .
[0083]
[0084] because medium length The ring is made of Location Define a matrix such that: (1) two consecutive positions are obtained only by alternating rows or columns, and (2) all positions are distinct except for the first and last positions. Therefore, any two consecutive positions in a ring belong to different cyclic permutation matrices, either in the same row or the same column. Thus, the length... A ring can be associated with an ordered sequence of cyclic permutation matrices.
[0085]
[0086] in , and , having from via arrive The convention. Length in H Any cycle can be represented by an ordered sequence:
[0087]
[0088] in , and Assumption:
[0089]
[0090] Matrix H contains length A ring if and only if: .
[0091] in , and (1) The definition of the middle is that it has a circumference of at least The simplified diagram of H is as follows:
[0092]
[0093] For all m; ;all , ,all , And all ,in , and .
[0094] Therefore, the instance girth maximization algorithm for QC-LDPC codes may include some or all of the following steps:
[0095] Identify the shortest length (g length) ring of H side:
[0096]
[0097] Identify each variable node involved in the ring degree distribution .
[0098] Evaluate the ACE (Cycle Connectivity) of each path.
[0099] Group edges with fewer ACEs and variable nodes with higher number distributions within the ring.
[0100] Permuting a column or row containing an edge with the minimum ACE corresponding to a variable node with the highest number distribution with another column or row belonging to another cyclic matrix, such that (1) no new cycle is created by the permutation, and (2) the cycle... The new enclosure length is .
[0101] ; and ,in , It is the index of the column in H that has been replaced.
[0102] Repeat steps 1), 2), 3), 4) and 5) until: (1) is achieved , or (2) maximize connectivity.
[0103] return H and And it ends.
[0104] In some embodiments, the permutation matrix can directly permutate the information bit vector. Figure 4This describes the structure of an encoder 400 according to another example of an aspect of this disclosure. As described herein, the encoder 400 includes an interleaver 410 that receives a permutation matrix 420 and transmits the permutation matrix 420 and information bits to an encoding module 430, which applies the permutations to the information bits to generate codewords (e.g., ...). Furthermore, similar to the structure of encoder 200, the complexity of encoder 400 is minimized when interleaver 410 is applied to the information bit vector prior to LDPC encoding.
[0105] In some embodiments, maximizing the girth of the QC-LDPC code described herein may include optimizations based on the LDPC decoder, such as the product sum algorithm (SPA). For example, a decoder-based algorithm compares the performance of the code in the current graph setting for each candidate check node and selects the permutation that produces the best performance according to the SPA.
[0106] While the complexity and processing at the encoder may increase, this choice achieves better performance, for example, in error-prone flat regions (e.g., regions with high SNR or low BER). In such cases, the method described in this paper and the permutation matrix are used. Related algorithms to construct For each candidate code generated using this test, the PCM undergoes an AWGN channel and a series of signal-to-noise ratio (SNR) values, and the candidate PCM is used for decoding via iterative decoding (e.g., SPA decoding). The performance of each candidate code is evaluated based on error level performance and convergence of iterative decoding. Finally, the code providing the optimal performance indicates the candidate permutation to be selected for maximizing the girth. Therefore, the decoder-optimized girth-maximization algorithm allows for better performance at the encoder with an acceptable increase in complexity.
[0107] In some embodiments, encoder 200 or 400 may employ different signaling procedures to signal the applied permutation matrix to the decoder. For example, encoder 200 or 400 may contain different downlink control information (DCI) formats, which may include additional fields that reference the corresponding or applied permutation matrix. In some cases, the DCI fields may affect the DCI size of a legacy DCI format. Furthermore, in some cases, the permutation matrix may be listed within the same modulation and coding scheme (MCS) table, and the "Modulation and Coding Scheme" field within the DCI may indicate both the MCS scheme used to generate the codeword and the permutation matrix.
[0108] In some embodiments, the channel coding signaling from LDPC parameters to the decoder may include information about the permutation matrix being used to allow for proper decoding of the received codewords. In some cases, the permutation matrix reference may be indicated within the "Modulation and Coding Scheme" field of the DCI mechanism.
[0109] In some cases, depending on the number of permutation matrices being listed, some bits can be added to the DCI, where the bits convey or refer to the permutation matrices. The added bits can affect the DCI size of an existing DCI format, and the DCI format can contain an N-bit field dedicated to signaling permutation matrix references. For example, when listing permutation matrices... The number is When dealing with a matrix, 6 bits can be added to the old DCI format or assigned in the new DCI format to signal the permutation matrix to the receiver (e.g., the decoder).
[0110] Table 2 presents a reference for the permutation matrix with DCI format 0_0, as follows:
[0111]
[0112] Table 2
[0113] In some cases, different permutation matrices can be listed within the same MCS table, and one or more permutation matrices can be added based on the code rate, modulation order, and / or spectral efficiency. In such cases, the same reference indicating the modulation and coding scheme in the DCI can also indicate the permutation matrix used at the encoder, as shown in Table 3:
[0114]
[0115] Table 3
[0116] In some cases, the decoder can perform blind recognition of the permutation matrix used at the encoder. For example, a reference to the matrix may not be signaled to the receiver, but the receiver can use knowledge of the LDPC parity matrix H and extract the permuted parity matrix from the received codeword. .
[0117] As described herein, the encoder and / or decoder may be part of other functions, devices, or entities of UE 104, network entity 102, or wireless communication system 100.
[0118] Figure 5 An example of a UE 500 according to aspects of this disclosure is described. UE 500 may include a processor 502, a memory 504, a controller 506, and a transceiver 508. The processor 502, memory 504, controller 506, or transceiver 508, or various combinations thereof, or various components thereof, may be examples of components for performing the various aspects of this disclosure as described herein. These components may be coupled via one or more interfaces (e.g., operatively, communicatively, functionally, electronically, electrically).
[0119] Processor 502, memory 504, controller 506, or transceiver 508, or various combinations or components thereof, may be implemented in hardware (e.g., a circuit system). The hardware may be a processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), or other programmable logic device, or any combination thereof configured or otherwise supporting components for performing the functions described in this disclosure.
[0120] Processor 502 may include intelligent hardware devices (e.g., a general-purpose processor, DSP, CPU, ASIC, FPGA, or any combination thereof). In some embodiments, processor 502 may be configured to operate memory 504. In some other embodiments, memory 504 may be integrated into processor 502. Processor 502 may be configured to execute computer-readable instructions stored in memory 504 to cause UE 500 to perform various functions of this disclosure.
[0121] Memory 504 may comprise volatile or non-volatile memory. Memory 504 may store computer-readable, computer-executable code containing instructions that, when executed by processor 502, cause UE 500 to perform the various functions described herein. The code may be stored in a non-transitory computer-readable medium, such as memory 504 or another type of memory. Computer-readable medium includes both non-transitory computer storage media and communication media, wherein the communication media includes any media that facilitates the transfer of a computer program from one place to another. Non-transitory storage media may be any available media accessible by a general-purpose or special-purpose computer.
[0122] In some implementations, processor 502 and memory 504 coupled to processor 502 may be configured to cause UE 500 to perform one or more of the functions described herein (e.g., processor 502 executing instructions stored in memory 504). For example, processor 502 may support wireless communication at UE 500 according to examples disclosed herein. UE 500 may be configured to support components for: applying a permutation matrix to a parity check matrix of a QC-LDCP code or an information bit vector to which a parity check matrix is applied, generating codewords based on the permutation matrix applied to the parity check matrix of the QC-LDCP code, and transmitting the generated codewords to a receiver via a data channel.
[0123] As another example, processor 502 may support wireless communication at UE 500 according to an example disclosed herein. UE 500 may be configured to support components for: receiving reference bits of a permutation matrix representing a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied, and decoding a received codeword using the permutation matrix represented by the received reference bits.
[0124] Controller 506 manages the input and output signals of UE 500. Controller 506 can also manage peripheral devices not integrated into UE 500. In some embodiments, controller 506 may utilize an operating system such as iOS®, ANDROID®, WINDOWS®, or other operating systems. In some embodiments, controller 506 may be implemented as part of processor 502.
[0125] In some embodiments, UE 500 may include at least one transceiver 508. In other embodiments, UE 500 may have more than one transceiver 508. Transceiver 508 may represent a wireless transceiver. Transceiver 508 may include one or more receiver chains 510, one or more transmitter chains 512, or a combination thereof.
[0126] Receiver chain 510 may be configured to receive signals (e.g., control information, data, packets) over a wireless medium. For example, receiver chain 510 may include one or more antennas for receiving signals over the air or over a wireless medium. Receiver chain 510 may include at least one amplifier (e.g., a low-noise amplifier (LNA)) configured to amplify the received signal. Receiver chain 510 may include at least one demodulator configured to demodulate the received signal and obtain transmitted data by reversing the modulation technique applied during signal transmission. Receiver chain 510 may include at least one decoder for decoding the demodulated signal to receive the transmitted data.
[0127] Transmitter chain 512 can be configured to generate and transmit signals (e.g., control information, data, packets). Transmitter chain 512 may include at least one modulator for modulating data onto a carrier signal, preparing the signal for transmission over a wireless medium. The at least one modulator may be configured to support one or more techniques, such as amplitude modulation (AM), frequency modulation (FM), or digital modulation schemes like phase shift keying (PSK) or quadrature amplitude modulation (QAM). Transmitter chain 512 may also include at least one power amplifier configured to amplify the modulated signal to an appropriate power level suitable for transmission over a wireless medium. Transmitter chain 512 may also include one or more antennas for transmitting the amplified signal into the air or wireless medium.
[0128] Figure 6An example of a processor 600 according to aspects of this disclosure is described. Processor 600 may be an example of a processor configured to perform various operations according to the examples described herein. Processor 600 may include a controller 602 configured to perform various operations according to the examples described herein. Processor 600 may optionally include at least one memory 604, which may be, for example, an L1 / L2 / L3 cache. Additionally or alternatively, processor 600 may optionally include one or more arithmetic logic units (ALUs) 606. One or more of these components may be electronically communicated or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more interfaces (e.g., buses).
[0129] Processor 600 may be a processor chipset and includes a protocol stack (e.g., a software stack) executed by the processor chipset to perform various operations (e.g., receive, acquire, retrieve, transmit, output, forward, store, determine, identify, access, write, read) according to the examples described herein. The processor chipset may include one or more cores, one or more caches (e.g., memory native to the processor chipset (e.g., processor 600) or contained within the processor chipset (e.g., processor 600) or other memory (e.g., random access memory (RAM), read-only memory (ROM), dynamic RAM (DRAM), synchronous dynamic RAM (SDRAM), static RAM (SRAM), ferroelectric RAM (FeRAM), magnetic RAM (MRAM), resistive RAM (RRAM), flash memory, phase-change memory (PCM), and others)).
[0130] Controller 602 can be configured to manage and coordinate various operations of processor 600 (e.g., signaling, receiving, acquiring, retrieving, transmitting, outputting, forwarding, storing, determining, identifying, accessing, writing, and reading) to enable processor 600 to support various operations according to the examples described herein. For example, controller 602 can operate as a control unit of processor 600, generating control signals that manage the operation of various components of processor 600. These control signals include enabling or disabling functional units, selecting data paths, initiating memory accesses, and coordinating operation timing.
[0131] Controller 602 may be configured to fetch (e.g., fetch, retrieve, receive) instructions from memory 604 and determine subsequent instructions to be executed to enable processor 600 to support various operations according to the examples described herein. Controller 602 may be configured to track the memory addresses of instructions associated with memory 604. Controller 602 may be configured to decode instructions to determine the operations to be performed and the operands involved. For example, controller 602 may be configured to interpret instructions and determine control signals to be output to other components of processor 600 to enable processor 600 to support various operations according to the examples described herein. Additionally or alternatively, controller 602 may be configured to manage data flow within processor 600. Controller 602 may be configured to control data transfers between registers, arithmetic logic unit (ALU), and other functional units of processor 600.
[0132] Memory 604 may include one or more caches (e.g., memory local to processor 600 or included in processor 600, or other memory such as RAM, ROM, DRAM, SDRAM, SRAM, MRAM, flash memory, etc.). In some embodiments, memory 604 may reside within or on the processor chipset (e.g., local to processor 600). In some other embodiments, memory 604 may reside outside the processor chipset (e.g., remote from processor 600).
[0133] Memory 604 may store computer-readable, computer-executable code containing instructions that, when executed by processor 600, cause processor 600 to perform the various functions described herein. The code may be stored in a non-transitory computer-readable medium, such as system memory or another type of memory. Controller 602 and / or processor 600 may be configured to execute computer-readable instructions stored in memory 604 to cause processor 600 to perform various functions. For example, processor 600 and / or controller 602 may be coupled to or coupled to memory 604, and processor 600, controller 602, and memory 604 may be configured to perform the various functions described herein. In some instances, processor 600 may include multiple processors, and memory 604 may include multiple memories. One or more of the multiple processors may be coupled to one or more of the multiple memories, which may be individually or collectively configured to perform the various functions described herein.
[0134] One or more ALUs 606 may be configured to support various operations according to the examples described herein. In some embodiments, one or more ALUs 606 may reside within or on a processor chipset (e.g., processor 600). In some other embodiments, one or more ALUs 606 may reside outside the processor chipset (e.g., processor 600). One or more ALUs 606 may perform one or more calculations on data, such as addition, subtraction, multiplication, and division. For example, one or more ALUs 606 may receive input operands and an opcode that determines the operation to be performed. One or more ALUs 606 may be configured with various logic and arithmetic circuitry, including adders, subtractors, shifters, and logic gates, to process and manipulate data according to the operation. Alternatively, one or more ALU 606s may support logical operations such as AND, OR, XOR, NOR, and NAND, enabling one or more ALU 606s to handle conditional operations, comparisons, and bitwise operations.
[0135] Processor 600 can support wireless communication according to examples disclosed herein. Processor 600 can be configured or operable to support components for: applying a permutation matrix to a parity check matrix of a QC-LDCP code or an information bit vector to which a parity check matrix is applied, generating codewords based on the permutation matrix applied to the parity check matrix of the QC-LDCP code, and transmitting the generated codewords to a receiver via a data channel.
[0136] As another example, the processor 600 may be configured or operable to support components for: receiving reference bits of a permutation matrix representing a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied, and using the permutation matrix represented by the received reference bits to decode the received codeword.
[0137] Figure 7 This describes an example of NE 700 according to aspects of this disclosure. NE 700 may include a processor 702, a memory 704, a controller 706, and a transceiver 708. The processor 702, memory 704, controller 706, or transceiver 708, or various combinations thereof, or various components thereof, may be examples of components for performing the various aspects of this disclosure as described herein. These components may be coupled via one or more interfaces (e.g., operatively ground, communicatively ground, functional ground, electronic ground, electrical ground).
[0138] Processor 702, memory 704, controller 706, or transceiver 708, or various combinations or components thereof, may be implemented in hardware (e.g., a circuit system). The hardware may be a processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), or other programmable logic device, or any combination thereof configured or otherwise supporting components for performing the functions described in this disclosure.
[0139] Processor 702 may include intelligent hardware devices (e.g., a general-purpose processor, DSP, CPU, ASIC, FPGA, or any combination thereof). In some embodiments, processor 702 may be configured to operate memory 704. In some other embodiments, memory 704 may be integrated into processor 702. Processor 702 may be configured to execute computer-readable instructions stored in memory 704 to cause NE 700 to perform various functions of this disclosure.
[0140] Memory 704 may comprise volatile or non-volatile memory. Memory 704 may store computer-readable, computer-executable code containing instructions that, when executed by processor 702, cause NE 700 to perform the various functions described herein. The code may be stored in a non-transitory computer-readable medium, such as memory 704 or another type of memory. Computer-readable medium includes both non-transitory computer storage media and communication media, wherein the communication media includes any media that facilitates the transfer of a computer program from one place to another. Non-transitory storage media may be any available media accessible by a general-purpose or special-purpose computer.
[0141] In some embodiments, processor 702 and memory 704 coupled to processor 702 may be configured to cause NE 700 to perform one or more of the functions described herein (e.g., processor 702 executing instructions stored in memory 704). For example, processor 702 may support wireless communication at NE 700 according to examples disclosed herein. NE 700 may be configured to support components for: applying a permutation matrix to a parity check matrix of a QC-LDCP code or an information bit vector to which a parity check matrix is applied, generating codewords based on the permutation matrix applied to the parity check matrix of the QC-LDCP code, and transmitting the generated codewords to a receiver via a data channel.
[0142] As another example, processor 702 may support wireless communication at NE 700 according to an example disclosed herein. NE 700 may be configured to support components for: receiving reference bits of a permutation matrix representing a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied, and decoding a received codeword using the permutation matrix represented by the received reference bits.
[0143] Controller 706 manages the input and output signals of NE 700. Controller 706 can also manage peripheral devices not integrated into NE 700. In some embodiments, controller 706 may utilize an operating system such as iOS®, ANDROID®, WINDOWS®, or other operating systems. In some embodiments, controller 706 may be implemented as part of processor 702.
[0144] In some embodiments, the NE 700 may include at least one transceiver 708. In other embodiments, the NE 700 may have more than one transceiver 708. The transceiver 708 may represent a wireless transceiver. The transceiver 708 may include one or more receiver chains 710, one or more transmitter chains 712, or a combination thereof.
[0145] Receiver chain 710 may be configured to receive signals (e.g., control information, data, packets) over a wireless medium. For example, receiver chain 710 may include one or more antennas for receiving signals over the air or over a wireless medium. Receiver chain 710 may include at least one amplifier (e.g., a low-noise amplifier (LNA)) configured to amplify the received signal. Receiver chain 710 may include at least one demodulator configured to demodulate the received signal and obtain transmitted data by reversing the modulation technique applied during signal transmission. Receiver chain 710 may include at least one decoder for decoding the demodulated signal to receive the transmitted data.
[0146] Transmitter chain 712 can be configured to generate and transmit signals (e.g., control information, data, packets). Transmitter chain 712 may include at least one modulator for modulating data onto a carrier signal, preparing the signal for transmission over a wireless medium. The at least one modulator may be configured to support one or more techniques, such as amplitude modulation (AM), frequency modulation (FM), or digital modulation schemes like phase shift keying (PSK) or quadrature amplitude modulation (QAM). Transmitter chain 712 may also include at least one power amplifier configured to amplify the modulated signal to an appropriate power level suitable for transmission over a wireless medium. Transmitter chain 712 may also include one or more antennas for transmitting the amplified signal into the air or wireless medium.
[0147] Figure 8 A flowchart illustrating method 800 according to an aspect of this disclosure is provided. The operation of the method may be implemented by an encoder, such as an encoder supported by a UE or NE as described herein. In some embodiments, the UE or NE may execute a set of instructions to control functional components of the UE or NE to perform the described functions.
[0148] At 802, the method may include applying a permutation matrix to a parity check matrix of a QC-LDCP code or to an information bit vector to which the parity check matrix is applied. The operation at 802 may be performed according to the examples described herein. In some embodiments, it may be performed by reference to... Figure 5 The UE described or as referenced Figure 7 The described NE is used to perform the operations of 802.
[0149] At 804, the method may include generating codewords based on applying a permutation matrix to a parity check matrix of a QC-LDCP code. The operation at 804 may be performed according to the examples described herein. In some embodiments, it may be performed by, as referenced... Figure 5 The UE described or as referenced Figure 7 The described NE is used to perform the operations of 804.
[0150] At 806, the method may include transmitting the generated codeword to a decoder via a data channel. The operation of 806 may be performed according to the examples described herein. In some embodiments, it may be performed by reference to... Figure 5 The UE described or as referenced Figure 7 The described NE is used to perform the operations of 806.
[0151] It should be noted that the method described herein describes one possible implementation, and the operation and steps may be rearranged or otherwise modified, and other implementations are possible.
[0152] Figure 9 A flowchart illustrating method 900 according to an aspect of this disclosure is provided. The operation of the method may be performed by a decoder, such as a decoder supported by a UE or NE as described herein. In some embodiments, the UE or NE may execute a set of instructions to control functional components of the UE or NE to perform the described functions.
[0153] At 902, the method may include receiving reference bits of a permutation matrix representing a parity check matrix to be applied to a QC-LDCP code or an information bit vector to which the parity check matrix is applied. The operation at 902 may be performed according to the examples described herein. In some embodiments, it may be performed by, as referenced... Figure 5 The UE described or as referenced Figure 7 The described NE is used to perform the operation of 902.
[0154] At 904, the method may include decoding the received codeword using a permutation matrix referenced by the received reference bits signaled within the DCI. The operation at 904 may be performed according to the examples described herein. In some embodiments, it may be performed by, as referenced... Figure 5 The UE described or as referenced Figure 7 The described NE is used to perform the operation of 904.
[0155] It should be noted that the methods described herein describe possible implementations, and the operations and steps may be rearranged or otherwise modified, and other implementations are possible.
[0156] The description herein is provided to enable those skilled in the art to make or use this disclosure. Various modifications to this disclosure will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the scope of this disclosure. Therefore, this disclosure is not limited to the examples and designs described herein, but should be given the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. An encoder comprising: At least one memory; and At least one processor, coupled to the at least one memory and configured to enable the encoder to: The permutation matrix is applied to the parity check matrix of a quasi-cyclic low-density parity-check (QC-LDCP) code or to the information bit vector to which the parity check matrix is applied. Codewords are generated by applying the permutation matrix to the parity check matrix of the QC-LDCP code; and The generated codeword is transmitted to the decoder via the data channel.
2. The encoder of claim 1, wherein the at least one processor is further configured to cause the encoder to: Generate a set of permutation matrices associated with maximizing the encirclement of the Tanner graph of the QC-LDPC code; and Select the permutation matrix from the generated set of permutation matrices.
3. The encoder of claim 1, wherein each permutation matrix in the set of permutation matrices is associated with the bit rate, bit size, Tanner diagram circumference, and target block error rate (BLER) performance.
4. The encoder of claim 3, wherein the BLER performance is determined based on a Monte Carlo simulation performed on an additive white Gaussian noise (AWGN) channel.
5. The encoder of claim 1, wherein each of the set of permutation matrices is designed based on a modified progressive edge growth (PEG) algorithm.
6. The encoder of claim 1, wherein applying the permutation matrix to the parity check matrix of the QC-LDCP code preserves the quasi-cyclic property of the parity check matrix.
7. The encoder according to claim 1, wherein the QC-LDCP code is a 5G New Radio (NR) LCDP code.
8. The encoder of claim 1, wherein the encoder is part of a network entity of a 5G communication network.
9. A processor for wireless communication, comprising: At least one controller, coupled to at least one memory and configured to enable the processor to: The permutation matrix is applied to the parity check matrix of a quasi-cyclic low-density parity-check (QC-LDCP) code or to the information bit vector to which the parity check matrix is applied. Codewords are generated by applying the permutation matrix to the parity check matrix of the QC-LDCP code; and The generated codeword is transmitted to the receiver via the data channel.
10. The processor of claim 9, wherein the at least one controller is further configured to cause the processor to: Generate a set of permutation matrices associated with maximizing the encirclement of the Tanner graph of the QC-LDPC code; and Select the permutation matrix from the generated set of permutation matrices.
11. The processor of claim 9, wherein each of the set of permutation matrices is associated with the code rate, information bit size, Tanner map encirclement length, and target block error rate (BLER) performance.
12. A decoder comprising: At least one memory; and At least one processor, coupled to the at least one memory and configured to enable the decoder to: Receive reference bits representing the parity check matrix to be applied to a quasi-cyclic low-density parity check (QC-LDCP) code or the permutation matrix of the information bit vector to which the parity check matrix is applied; The received codeword is decoded using the permutation matrix referenced by the received reference bit, which is signaled in the downlink control information (DCI).
13. The decoder of claim 12, wherein the reference bit is referenced by the modulation and coding scheme (MCS) field within the DCI.
14. The decoder of claim 13, wherein the MCS field of the DCI may include the reference bit pointing to the permutation matrix modulation and the code rate in the associated MCS table column.
15. The decoder of claim 12, wherein the reference bit is signaled within a new DCI field of the DCI.
16. The decoder of claim 15, wherein the size of the new DCI field is based on the number of table column permutation matrices from which the permutation matrix is selected.
17. The decoder of claim 12, wherein the reference bit is signaled within a dedicated field of the new DCI format.
18. A processor for wireless communication, comprising: At least one controller, coupled to at least one memory and configured to enable the processor to: Receive reference bits representing the parity check matrix to be applied to a quasi-cyclic low-density parity check (QC-LDCP) code or the permutation matrix of the information bit vector to which the parity check matrix is applied; The received codeword is decoded using the permutation matrix represented by the received reference bits.
19. The processor of claim 18, wherein the reference bit is received within downlink control information (DCI).
20. The processor of claim 19, wherein the reference bit is referenced by the modulation and coding scheme (MCS) field within the DCI.
