Low bitrate decoding design
By designing low-rate LDPC codes and utilizing punching and repeating bit techniques, the problem of balancing extended distance and throughput in low-rate decoding in wireless communication is solved, enabling cost-effective encoder and decoder reuse.
Patent Information
- Application Number
- CN202580028985.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-04-26
- Filing Date
- 2025-03-06
- Publication Date
- 2026-11-17
AI Technical Summary
Existing wireless communication technologies struggle to balance extended long-distance transmission and target throughput when implementing low-code-rate decoding, while existing encoders and decoders also incur high development costs and time.
It adopts a low-bit-rate LDPC code design, and uses techniques such as puncturing and repeating bits to achieve low-bit-rate encoding and decoding, reusing existing encoders and decoders to reduce development costs.
It achieves the goal of maintaining target throughput while extending long-distance transmission, and reduces development costs by reusing existing encoders and decoders.
Smart Images

Figure CN123125794A_ABST
Abstract
Description
[0001] Cross-references to related applications
[0002] This application claims priority to U.S. Patent Application No. 18 / 648,331, filed April 26, 2024, which has been assigned to the assignee of this application and is expressly incorporated herein by reference in its entirety, as fully set forth below and for all applicable purposes. Technical Field
[0003] This disclosure relates generally to wireless communication, and more specifically to the design for implementing codewords with low decoding rates. Background Technology
[0004] Wireless communication networks can include various types of wireless communication devices, including network entities such as wireless access points (APs) or base stations (BSs), client devices such as wireless stations (STAs) or user equipment (UEs), and other wireless nodes. These wireless communication devices can communicate with each other via various technologies and wireless communication protocols, including wireless local area networks (WLANs) or Wi-Fi-based protocols, or cellular-based protocols such as 4G, 5G, or 6G. Wireless communication networks can support communication with multiple users by sharing available system resources such as time, frequency, and spatial resources. To achieve features or provide improved performance, wireless communication devices can employ techniques such as orthogonal frequency division multiple access (OFDMA), multiple-user multiple-input multiple-output (MU-MIMO), spatial multiplexing, and beamforming. For greater interoperability, wireless communication networks can support backward compatibility (such as support for legacy wireless communication devices) and forward compatibility (such as support for communication with wireless communication devices compliant with next-generation wireless communication standards). Summary of the Invention
[0005] The systems, methods, and apparatus disclosed herein each have several innovative aspects, and no single aspect is solely responsible for the desired properties disclosed herein.
[0006] An innovative aspect of the subject matter described in this disclosure can be implemented in a method for wireless communication by a first wireless node. The method includes: obtaining a set of data bits; encoding the set of data bits based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, the reduced nominal code rate being lower than the first nominal code rate; and outputting the one or more codewords.
[0007] Another innovative aspect of the subject matter described in this disclosure can be implemented in a method for wireless communication by a first wireless node. The method includes: obtaining one or more codewords associated with a reduced nominal code rate; and decoding the one or more codewords based on at least a first nominal code rate to recover a set of data bits, wherein the first nominal code rate is higher than the reduced nominal code rate.
[0008] Details of one or more specific embodiments of the subject matter described in this disclosure are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages will become apparent from the description, drawings, and claims. It should be noted that the relative dimensions in the following drawings may not be drawn to scale. Attached Figure Description
[0009] Figure 1 A schematic diagram of an example wireless communication network is shown.
[0010] Figure 2 An example encoded send chain is shown.
[0011] Figure 3 A table showing example encoding parameters is provided.
[0012] Figure 4 An example call flowchart is shown.
[0013] Figure 5 An example encoded transmission chain for achieving a reduced code rate is shown.
[0014] Figure 6 An example design for implementing codewords with a reduced code rate is shown.
[0015] Figure 7 An example design for decoding codewords with a reduced code rate is shown.
[0016] Figure 8 A table showing example encoding parameters is provided.
[0017] Figure 9 An example design for implementing codewords with a reduced code rate is shown.
[0018] Figure 10 An example design for implementing codewords with a reduced code rate is shown.
[0019] Figure 11 An example design for decoding codewords with a reduced code rate is shown.
[0020] Figure 12 An example design for implementing codewords with a reduced code rate is shown.
[0021] Figure 13An example design for decoding codewords with a reduced code rate is shown.
[0022] Figure 14 An example design for decoding codewords with a reduced code rate is shown.
[0023] Figure 15 A flowchart illustrating an example procedure that can be executed by or at a wireless node is shown.
[0024] Figure 16 A flowchart illustrating an example procedure that can be executed by or at a wireless node is shown.
[0025] Figure 17 A block diagram of an example wireless communication device is shown.
[0026] Similar reference numerals and names in the various figures indicate similar elements. Detailed Implementation
[0027] The following description refers to certain specific examples in order to illustrate the innovative aspects of this disclosure. However, those skilled in the art will readily recognize that the teachings herein can be applied in a variety of different ways. Some or all of the examples described can be applied in accordance with the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard, the IEEE 802.15 standard, or Bluetooth as defined by the Bluetooth Special Interest Group (SIG). ® It is implemented in any device, system, or network that transmits and receives radio frequency (RF) signals, either in accordance with the standard or one or more of the Long Term Evolution (LTE), 3G, 4G, 5G (New Radio (NR)), or 6G standards published by the 3rd Generation Partnership Project (3GPP).
[0028] The described examples can be implemented in any suitable device, component, system, or network capable of transmitting and receiving RF signals according to one or more of the following technologies or techniques: Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Orthogonal Frequency Division Multiplexing (OFDM), Frequency Division Multiple Access (FDMA), Orthogonal FDMA (OFDMA), Single Carrier FDMA (SC-FDMA), Space Division Multiple Access (SDMA), Rate Split Multiple Access (RSMA), Multi-User Shared Access (MUSA), Single-User (SU) Multiple-Input Multiple-Output (MIMO), and Multi-User (MU)-MIMO (MU-MIMO). The described examples can also be implemented using other wireless communication protocols or RF signals suitable for use in one or more of Wireless Personal Area Networks (WPANs), Wireless Local Area Networks (WLANs), Wireless Wide Area Networks (WWANs), Wireless Metropolitan Area Networks (WMANs), Non-Terrestrial Networks (NTNs), or Internet of Things (IoT) networks.
[0029] Various physical layer channel decoding schemes using binary convolutional codes (BCC) and low-density parity-check (LDPC) codes have been introduced for different types of communication to achieve improved throughput, latency, and reliability. In many systems, LDPC decoding is used for user data, while polarization decoding is used for control information.
[0030] LDPC codes are a type of error-correcting code widely used in digital communication systems. A key characteristic of LDPC codes is their sparse parity-check matrix, where only a small subset of entries are non-zero. This sparsity facilitates efficient encoding and decoding processes. In LDPC encoding, information bits are mapped to codewords through matrix multiplication. The sparsity of the parity-check matrix allows for high parallelism during encoding, resulting in computational efficiency.
[0031] The LDPC encoding process involves multiplying the information bits by a generator matrix to generate codewords. Each row of the matrix represents a parity check equation, and the resulting codewords satisfy all of these equations. This process introduces redundancy into the data, enabling error detection and correction during transmission. LDPC codes are renowned for their excellent error correction performance.
[0032] Some systems can be designed to achieve high reliability (Ultra-High Reliability - UHR). Such systems can also be designed to support long transmission ranges, sometimes referred to as Extended Long Range (ELR) mode, while still achieving relatively robust throughput (e.g., about 1 Mbps).
[0033] Distance extension can be achieved through power gain. A certain amount of power gain can be achieved through decoding gain using lower code rate decoding (such as lower code rate LDPC or lower code rate BCC). This disclosure provides various designs for implementing low code rate codes.
[0034] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. The low bit-rate codes described herein can help achieve the goal of extending long-distance transmission while still achieving the target throughput. In some examples, low bit-rate codes can be implemented by utilizing existing (higher bit-rate) codes. Therefore, certain existing encoders and decoders can be reused, which helps to avoid the time and cost required to develop a large number of entirely new encoders and decoders to support the low bit-rate codes proposed herein.
[0035] Figure 1A schematic diagram of an example wireless communication network 100 is shown. Depending on some aspects, the wireless communication network 100 may be an example of a wireless local area network (WLAN) (such as a Wi-Fi network). For example, the wireless communication network 100 may be a network implementing the IEEE 802.11 wireless communication protocol standard family as defined by the IEEE 802.11-2020 specification or its revisions (including, but not limited to, 802.11ay, 802.11ax (also known as Wi-Fi 6), 802.11az, 802.11ba, 802.11bc, 802.11bd, 802.11be (also known as Wi-Fi 7), 802.11bf, and 802.11bn (also known as Wi-Fi 8)) or at least one of other WLAN or Wi-Fi standards such as those associated with the Integrated Millimeter Wave (IMMW) research group. In some other examples, the wireless communication network 100 may be an example of a cellular radio access network (RAN), such as a 5G RAN or 6G RAN implementing one or more cellular protocols, such as those specified in one or more 3GPP standards. In some other examples, the wireless communication network 100 may include a WLAN that operates in an interoperable or converged manner with one or more cellular RANs to provide greater or enhanced network coverage to wireless communication devices within the wireless communication network 100, or to enable these devices to connect to the core of the cellular network, such as accessing network management capabilities and functionality provided by the cellular network core. In some other examples, the wireless communication network 100 may include a WLAN that operates in an interoperable or converged manner with one or more personal area networks (such as networks implementing Bluetooth or other wireless technologies) to provide greater or enhanced network coverage or to provide or implement other capabilities, functionality, applications, or services.
[0036] Wireless communication network 100 may include a number of wireless communication devices, including wireless access points (APs) 102 and any number of wireless stations (STAs) 104. Although in Figure 1Only one AP 102 is shown, but the wireless communication network 100 may include multiple APs 102 (e.g., in an Extended Service Set (ESS) deployment, an enterprise network, or an AP mesh network), or may not include any APs at all (e.g., in an Independent Basic Service Set (IBSS) (such as a peer-to-peer (P2P) network or other self-organizing network)). AP 102 can be or represent various types of network entities, including but not limited to home networking APs, enterprise APs, single-band APs, dual-band synchronous (DBS) APs, tri-band synchronous (TBS) APs, standalone APs, non-standalone APs, software-enabled APs (software APs), and multi-link APs (also known as AP multi-link devices (MLDs)), as well as cellular (such as 3GPP, 4G LTE, 5G, or 6G) base stations or other cellular network nodes (such as Node B, evolved Node B (eNB), gNB, Transmit / Receive Point (TRP)) or another type of equipment or apparatus included in the radio access network (RAN), including open RAN (O-RAN) network entities such as central units (CUs), distributed units (DUs), or radio units (RUs).
[0037] Each STA 104 may also be referred to as a mobile station (MS), mobile device, mobile phone, wireless phone, access terminal (AT), user equipment (UE), subscriber station (SS), or subscriber unit, etc. STA 104 can represent a variety of devices such as mobile phones, other handheld or wearable communication devices, netbooks, laptops, tablets, laptops, Chromebooks, augmented reality (AR), virtual reality (VR), mixed reality (MR), or extended reality (XR) wireless headsets or other peripherals, wireless earbuds, other wearable devices, display devices (e.g., televisions, computer monitors, or video game consoles), video game controllers, navigation systems, music or other audio or stereo devices, remote control devices, printers, kitchen appliances (including smart refrigerators) or other home appliances, remote keys (e.g., for passive keyless entry and start (PKES) systems), Internet of Things (IoT) devices, vehicles, etc.
[0038] The associated set of individual AP 102 and STA 104 may be referred to as the Infrastructure Basic Services Set (BSS), which is managed by the corresponding AP 102. Figure 1Additionally, an example coverage area 108 of AP 102 is shown, which may represent the Basic Service Area (BSA) of wireless communication network 100. The BSA can be identified by STA 104 and other devices via a Service Set Identifier (SSID) and a Basic Service Set Identifier (BSSID), which may be the Media Access Control (MAC) address of AP 102. AP 102 may periodically broadcast beacon frames (“beacons”) including the BSSID to enable any STA 104 within the wireless range of AP 102 to “associate” or reassociate with AP 102 to establish or maintain a corresponding communication link 106 with AP 102 (also referred to hereinafter as a “Wi-Fi link”). For example, the beacon may include an identifier of the primary channel used by the corresponding AP 102 or an indication of that primary channel, and a Timing Synchronization Function (TSF) for establishing or maintaining timing synchronization with AP 102. AP 102 can provide access to external networks to each STA 104 in the wireless communication network 100 via the corresponding communication link 106.
[0039] To establish a communication link 106 with AP 102, each STA 104 is configured to perform passive or active scanning operations (“scans”) on frequency channels in one or more frequency bands (e.g., 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, or 60 GHz bands). To perform a passive scan, STA 104 listens for beacons transmitted by the corresponding AP 102 at periodic time intervals (referred to as the Target Beacon Transmission Time (TBTT)). To perform an active scan, STA 104 generates probe requests and transmits these requests sequentially on each channel to be scanned, and listens for probe responses from AP 102. Each STA 104 can identify, determine, determine, or select an AP 102 to associate with based on the scanning information obtained through passive or active scanning, and perform authentication and association operations to establish a communication link 106 with the selected AP 102. The selected AP 102 assigns an association identifier (AID) to STA 104 at the end of the association operation, and AP 102 uses the association identifier (AID) to track STA 104.
[0040] As wireless networks become increasingly prevalent, STA 104 may have the opportunity to choose from one of many BSSs within its range or from multiple APs 102 that together form an Extended Service Set (ESS) (comprising multiple connected BSSs). For example, wireless communication network 100 may be connected to a wired or wireless distribution system capable of connecting multiple APs 102 in such an ESS. Therefore, STA 104 may be covered by more than one AP 102 and may be associated with different APs 102 at different times for different transmissions. Additionally, after associating with an AP 102, STA 104 may periodically scan its surroundings to find a more suitable AP 102 to associate with. For example, STA 104 moving relative to its associated AP 102 may perform a “roaming” scan to find another AP 102 with more desirable network characteristics, such as a larger Received Signal Strength Indicator (RSSI) or reduced traffic load.
[0041] In some examples, STA 104 can form a network without AP 102 or any other equipment besides STA 104 itself. An example of such a network is an ad hoc network (or wireless ad hoc network). Ad hoc networks may also be referred to as mesh networks or peer-to-peer (P2P) networks. In some examples, ad hoc networks can be implemented within a larger network, such as wireless communication network 100. In such examples, while STA 104 may be able to communicate with each other via communication link 106 through AP 102, STA 104 can also communicate directly with each other via direct wireless communication link 110. Additionally, two STA 104 can communicate via direct wireless communication link 110, regardless of whether the two STA 104 are associated with and served by the same AP 102. In such ad hoc systems, one or more STAs among STA 104 can assume the role played by AP 102 in the BSS. Such STA 104 can be referred to as the group owner (GO) and can coordinate transmissions within the ad hoc network. Examples of direct wireless communication links 110 include Wi-Fi direct connections, connections established by using Wi-Fi Tunneling Direct Link Establishment (TDLS) links, and other P2P group connections.
[0042] In some networks, AP 102 or STA 104, or both, can support applications associated with high throughput or low latency requirements, or provide lossless audio to one or more other devices. For example, AP 102 or STA 104 can support applications and use cases associated with ultra-low latency (ULL), such as ULL gaming, or streaming lossless audio and video to one or more personal audio devices (such as peripherals) or AR / VR / MR / XR headsets. In scenarios where a user uses two or more peripherals, AP 102 or STA 104 can support extended personal audio networks that enable communication with these two or more peripherals. Additionally, AP 102 and STA 104 can support additional ULL applications with ULL and high throughput requirements, such as cloud-based applications (such as VR cloud gaming).
[0043] As indicated above, in some implementations, AP 102 and STA 104 may operate and communicate according to one or more of the IEEE 802.11 wireless communication protocol standard family (via the corresponding communication link 106). These standards define WLAN radio and baseband protocols for the physical (PHY) layer and MAC layer. AP 102 and STA 104 transmit and receive wireless communications to and from each other in the form of PHY Protocol Data Units (PPDUs) (also referred to below as "Wi-Fi communication" or "wireless packets").
[0044] Each PPDU is a composite structure comprising a PHY preamble and a payload in the form of a PHY Service Data Unit (PSDU). The information provided in the preamble can be used by the receiving device to decode subsequent data in the PSDU. In instances where the PPDU is transmitted on a bound channel or a wideband channel, the preamble field may be copied and transmitted in each of the multiple component channels. The PHY preamble may include both a legacy portion (or "legacy preamble") and a non-legacy portion (or "non-legacy preamble"). The legacy preamble can be used for other purposes such as packet detection, automatic gain control, and channel estimation. The legacy preamble is also typically used to maintain compatibility with legacy equipment. The format, decoding, and information provided in the non-legacy portion of the preamble are associated with the specific IEEE 802.11 wireless communication protocol to be used to transmit the payload.
[0045] AP 102 and STA 104 in wireless communication network 100 can transmit PPDUs on unlicensed spectrum, which may be a portion of the spectrum including frequency bands traditionally used by Wi-Fi technologies, such as the 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, and 60 GHz bands. Some examples of AP 102 and STA 104 described herein can also communicate in other frequency bands that can support both licensed and unlicensed communication. For example, AP 102 or STA 104, or both, may also be able to communicate on licensed operating frequency bands, where multiple operators may have corresponding licenses to operate in the same or overlapping frequency ranges. Such licensed operating frequency bands may be specified or associated with frequency ranges mapped to or associated with FR1 (410MHz to 7.125GHz), FR2 (24.25GHz to 52.6GHz), FR3 (7.125GHz to 24.25GHz), FR4a or FR4-1 (52.6GHz to 71GHz), FR4 (52.6GHz to 114.25GHz), and FR5 (114.25GHz to 300GHz).
[0046] Each of these frequency bands may include multiple sub-bands and frequency channels (also referred to as sub-channels). The terms "channel" and "sub-channel" are used interchangeably herein, as each can refer to a portion of the spectrum within the frequency band (e.g., a 20MHz, 40MHz, 80MHz, or 160MHz portion of the spectrum) through which communication between two or more wireless communication devices can occur. For example, PPDUs conforming to revisions of the IEEE 802.11n, 802.11ac, 802.11ax, 802.11be, and 802.11bn standards may be transmitted on one or more of the 2.4 GHz, 5 GHz, or 6 GHz frequency bands, each of which is divided into multiple 20MHz channels. Thus, these PPDUs are transmitted on physical channels with a minimum bandwidth of 20MHz, but larger channels can be formed through channel bonding. For example, a PPDU can be transmitted on a physical channel with bandwidths of 40MHz, 80MHz, 160MHz, 240MHz, 320MHz, 480MHz, or 640MHz by bundling multiple 20MHz channels together.
[0047] AP 102 can determine or select the operating bandwidth for STA 104 in its BSS, and select a range of channels within that bandwidth to provide that operating bandwidth. For example, AP 102 can select sixteen 20MHz channels that collectively span a 320MHz operating bandwidth. Within the operating bandwidth, AP 102 typically selects a single primary 20MHz channel on which AP 102 and STA 104 in its BSS monitor contention-based access schemes. In some examples, AP 102 or STA 104 may be able to monitor only a single primary 20MHz channel for packet detection (e.g., for detecting preambles of PPDUs). Under normal circumstances, any transmission made by AP 102 or STA 104 within the BSS must involve transmission on the primary 20MHz channel. Therefore, in a conventional system, the transmitting device must contend for and win the TXOP on the primary channel to transmit any content. However, some APs 102 and STAs 104 that support Ultra-High Reliability (UHR) communication or communication according to the IEEE 802.11bn standard amendment can be configured to operate, monitor, compete for, and communicate using multiple primary 20MHz channels. This monitoring of multiple primary 20MHz channels can be sequential, such that in response to determining, identifying, or detecting that a first primary 20MHz channel is unavailable, the wireless communication device can switch to monitoring and competing using a second primary 20MHz channel. Additionally or alternatively, the wireless communication device can be configured to monitor multiple primary 20MHz channels in parallel. In some examples, the first primary 20MHz channel may be referred to as the main primary (M-primary) channel, and one or more additional secondary primary channels may each be referred to as the opportunistic primary (O-primary) channel. For example, if the wireless communication device measures, identifies, identifies, detects, or otherwise determines that the M-primary channel is busy or occupied (e.g., due to overlapping BSS (OBSS) transmissions), the wireless communication device can switch to monitoring and competing on the O-primary channel. In some examples, the M primary channel can be used for beacon transmission and servicing legacy client equipment, while the O primary channel can be used by non-legacy (e.g., UHR or IEEE 802.11bn compatible) equipment to opportunistically access spectrum that may otherwise be underutilized.
[0048] Overview of low-density parity codes
[0049] To achieve a low block error rate (BLER) while still maintaining a very high data rate during transmission over the air interface, channel decoding can be used. That is, wireless communication typically utilizes appropriate error-correcting block codes. In a typical block code, the information message or sequence is broken down into code blocks (CBs), and the encoder (e.g., codec) at the transmitting device then mathematically adds redundancy to the information message. Utilizing this redundancy in the encoded information message improves message reliability and corrects for any bit errors that may occur due to noise.
[0050] Data decoding can be implemented in several ways. In early 5G NR specifications, quasi-cyclic low-density parity-check (LDPC) was used to decode user data using two different base maps: one base map was used for large code blocks and / or high code rates, while the other base map was used for other cases. Polar decoding was used to decode control information and the Physical Broadcast Channel (PBCH) based on nested sequences. For these channels, puncturing, shortening, and repetition were used for rate matching.
[0051] Figure 2 An example LDPC encoded transmission chain 200 is depicted. As illustrated, the LDPC encoded transmission chain 200 includes a parity check matrix 204 and a generator matrix 206 for encoding the data stream 202 to generate LDPC codewords.
[0052] Rate matching can be performed to adapt the code block size to the modulation and decoding scheme (MCS) selected for transmission. This step may involve puncturing bits or repeating bits to match the desired code rate. Pilot symbols, as known reference symbols, can be inserted into OFDM symbols to assist in channel estimation and equalization. QAM data symbols can be interleaved to improve performance in the presence of frequency-selective fading. Finally, mapping block 208 maps the coded bits to the constellation, thereby generating the modulation symbols.
[0053] LDPC codes can be represented by a bipartite graph (often called a "Tanna graph"). In a bipartite graph, the set of variable nodes corresponds to the bits of the codeword (e.g., information bits or system bits), and the set of parity nodes corresponds to the set of parity constraints defining the code. Edges in the graph connect the variable nodes to the parity nodes. Thus, the nodes of the graph are divided into two distinct sets, with edges connecting nodes of two different types (variables and parity).
[0054] The graph can be represented in various ways, such as the one used in LDPC decoding. This is achieved by replicating the bipartite base graph (G) (or prototype graph) a certain number of times. ZTo create lifting codes. The number of times is referred to in this paper as lifting, lifting size, or lifting size value. If a variable node and a check node are connected in the graph by an "edge" (i.e., a line connecting a variable node and a check node), they are considered "neighbors". Furthermore, for each edge (e) of the bipartite base graph (G), a permutation (typically an integer value associated with the edge permutation, which is generated by...) is applied. k The value (represented and referred to as the boost value) applied to edge (e) Z Each copy is interconnected with G. Z A valid codeword has a bit sequence with a one-to-one association with the variable node sequence if and only if, for each check node, the sum of the bits associated with all adjacent variable nodes is 0 modulo 2 (i.e., they include an even number of 1s). If the permutation (lifting value) used is cyclic, the resulting LDPC code can be quasi-cyclic (QC).
[0055] The received LDPC codewords can be decoded to produce a reconstructed version of the original codewords. In the absence of errors, or where errors can be corrected, decoding can be used to recover the original encoded data units. Redundant bits can be used by the decoder to detect and correct bit errors. The LDPC decoder typically operates by iteratively performing local computations and passing those results, by exchanging messages along edges within a bipartite graph and updating these messages by performing computations at nodes based on incoming messages. These steps can be repeated several times. For example, each variable node in the graph may initially be provided with "soft bits" (e.g., representing the received bits of the codeword), which indicate an estimate of the associated bit values as determined by observations from the communication channel. Using these soft bits, the LDPC decoder updates messages by iteratively reading messages or portions thereof from memory and writing the updated messages or portions thereof back to memory. The update operation is typically based on parity constraints of the corresponding LDPC code. In specific implementations used for boosting LDPC codes, messages on similar edges are often processed in parallel.
[0056] LDPC codes designed for high-speed applications typically employ quasi-cyclic constructions with large boost factors and relatively small base graphs to support high parallelism in encoding and decoding operations. LDPC codes with higher code rates (e.g., the ratio of message length to codeword length) tend to have relatively fewer parities. If the number of basic parities is less than the degree of a variable node (e.g., the number of edges connecting to the variable node), then in the base graph, the variable node is connected to at least one of the basic parities via two or more edges (e.g., the variable node may have "bilateral" connections). Having base variable nodes and base parity nodes connected by two or more edges is generally undesirable for parallel hardware implementation purposes. For example, such bilateral connections can lead to multiple concurrent read and write operations on the same memory location, which can in turn cause data consistency problems. During a single parallel parity update, a bilateral connection in a base LDPC code can trigger two parallel reads of the same soft bit value memory location. Therefore, additional circuitry is typically required to combine the soft bit values written back to memory in order to correctly merge the two updates. Eliminating the double sides in the LDPC code helps avoid this additional complexity.
[0057] Punching is the act of removing bits from a codeword to produce a shorter codeword. Therefore, punctured variable nodes correspond to codeword bits that were not actually transmitted. Punching variable nodes in an LDPC code creates a shortened code (e.g., due to bit removal) while also effectively removing parity nodes. Specifically, for a matrix representation of an LDPC code that includes bits to be punctured, where the variable nodes to be punctured have a degree of one (such a representation can be possible through row combination if the code is correct), puncturing the variable nodes removes the associated bits from the code and effectively removes their individual adjacent parity nodes from the graph. Therefore, the number of parity nodes in the graph is reduced by one.
[0058] Overview of Decoding and Rate Matching
[0059] Some systems (e.g., 802.11be, also known as Ultra High Throughput or EHT) can apply a two-step padding process to the PPDU. In such cases, an FEC (Forward Error Correction) pre-padding process, which includes both FEC MAC pre-padding and FEC PHY pre-padding, can be applied before FEC decoding. FEC PHY post-padding can also be applied to FEC coded bits.
[0060] Four FEC pre-padding boundaries divide the last OFDM symbol of the EHT PPDU into four symbol segments. FEC pre-padding can be directed towards one of the four possible boundaries. The four FEC pre-padding boundaries are determined by the FEC pre-padding factor parameter. a express.
[0061] The encoding process for single-user (SU) and multi-user (MU) transmissions in a system used for PPDUs (e.g., EHT) can involve various steps. For example, these steps may include a first step of determining the LDPC FEC pre-padding boundary, a second step of determining the LDPC codeword size and number of codewords, a third step of shortening, a fourth step of punching and / or repeating, and a fifth step of finally determining the LDPC / BCC FEC pre-padding and FEC post-padding.
[0062] For the first step, in the EHT MU PPDU transmission, the transmitter can first calculate the user's... u The number of data bits remaining in the final OFDM symbol:
[0063] ;
[0064] Among them APEP_LENGTH u It is the first u The TXVECTOR parameter APEP_LENGTH for each user; It is for users u The number of tail bits for each encoder, and For BCC and For LDPC; It is the number of bits in the SERVICE field; It is aimed at the first u The number of data bits per OFDM symbol for each user, of which It is the first u Nominal decoding rate per user; It is for users u The number of decoded bits for each OFDM symbol, where With the u The value corresponding to the occupied RU or MRU size of each user (the effective number of data frequency modulations carrying unique data in an OFDM symbol). It is aimed at the first u The number of spatial streams per user, It is for users u The number of decoded bits for each OFDM symbol in each spatial stream.
[0065] based on The sender then targets the useru The following equation is used to calculate the initial number of symbol segments in the initial final OFDM symbol (initial FEC pre-fill factor value). The initial number of OFDM symbols. :
[0066] ;as well as
[0067] ,
[0068] in ,in ,in It corresponds to the first u The RU or MRU size occupied by each user (The effective number of data frequency modulations carrying unique data in each of the first three symbol segments) value.
[0069] Among all users, the transmitter can derive the user index with the longest encoded packet duration as shown in the following equation. S A set, and select a value from that set as... u max :
[0070] ,
[0071] in Then, the public among all users Value and The value can be derived using the following equation:
[0072] ;as well as
[0073] .
[0074] Next, the initial number of data bits in the last OFDM symbol for each user. and the initial number of decoding bits The following equations can be used to calculate the results:
[0075]
[0076] .
[0077] For each user utilizing LDPC encoding, the parameters and The following equations can be used to calculate:
[0078]
[0079]
[0080] in This refers to the PHY payload size, which is the number of data bits including the FEC prepush bits. It is situated within the PHY payload boundary (or FEC prepush boundary), which is the OFDM symbol. symbol segment in At the end, and It is the number of PHY decoding bits that fit within the current PHY decoding bit boundary, which is the OFDM symbol. symbol segment in The end of.
[0081] Therefore, based on these two values u The effective code rate is:
[0082] .
[0083] In some cases, the PHY decoder bit boundaries can be adjusted to accommodate more PHY decoder bits by adding one or more OFDM symbols and / or portions of symbols (e.g., one or more symbol segments), which may reduce the effective code rate and decrease the puncture rate.
[0084] For the second step, the transmitter can... Figure 3 The table 300 shown is used to calculate the target for users. u The number N integers of LDPC codewords sent CW,u And to target users u The length L of the codeword used LDPC,u .
[0085] For the third step, the transmitter can calculate the padding to N before encoding. pld,u Each data bit is for the user u The number of shortened bits N shrt,u As shown in the following equation:
[0086] .
[0087] when When, the shortening is not performed. At that time, the shortened bits can be evenly distributed across all N bits. CW,u On each code word, the first one This codeword is one bit shorter than the others. See below for a more detailed description. Figure 6 Shortened bits can be appended after the data bits. After encoding, the shortened bits are discarded.
[0088] For the fourth step, the transmitter can calculate the target codeword to be sent to the user as follows:u The number of holes N punc,u :
[0089]
[0090] when At that time, drilling will not be performed. At that time, the punching positions can be evenly distributed across all N. CW,u On each code word, the first one This codeword has one more hole than the others. Only the odd and even bits can be punched.
[0091] If there exists at least one user utilizing LDPC encoding, and the following conditions are met during the LDPC encoding process:
[0092]
[0093] True or if:
[0094] .
[0095] If true, then it applies to any user. u All users utilizing LDPC encoding will make Incrementing additional symbol segments and based on new Value to be recalculated :
[0096] .
[0097] The sender can then update the common FEC pre-fill factor for all users as follows: a and N SYM value:
[0098]
[0099] It can be noted that in this case, if Then the last OFDM symbol is the next OFDM symbol after the initial last OFDM symbol. Because Updated to a larger value, more PHY decoder bits are fitted within the adjusted PHY decoder bit boundary, which is the OFDM symbol. symbol segment in The end of.
[0100] On the other hand, if any user using LDPC encoding does not meet the above conditions in the LDPC encoding process, or if all users scheduled in the EHT MU PPDU are BCC encoded, then no additional symbol segment is added. Then, the common FEC pre-fill factor for all users is updated as follows. a andN SYM value:
[0101] .
[0102] The transmitter can calculate the amount of data to be sent to the user as follows: u The number of repeated decoding bits N rep,u :
[0103]
[0104] when When, do not perform repetition. When repeating the same number of decoded bits, the number of bits to be repeated should be evenly distributed across all N bits. CW,u On each code word, including the first one This codeword repeats one bit more than the rest of the codewords. Starting from the beginning of the LDPC codeword (the beginning of the data bits), any decoded bit that repeats for any codeword should be copied only from the codeword itself. Note that typically, when a bit is punched, the decoded bit is not repeated, and conversely, when a decoded bit is repeated, punching may not occur.
[0105] For the fifth step, for users utilizing LDPC encoding, the transmitter can transmit the N of the last OFDM symbol. DBPS Updated to:
[0106] .
[0107] For users using BCC encoding, the N in the final OFDM symbol... DBPS Updated to:
[0108] .
[0109] For each user utilizing LDPC or BCC encoding, the N of the final OFDM symbol... CBPS Updated to:
[0110] .
[0111] For each user utilizing LDPC encoding, the first u The number of FEC prepup bits for each user is calculated as follows:
[0112]
[0113] For users using LDPC encoding, the PHY payload boundary (or FEC pre-padding boundary) remains OFDM symbol. symbol segment in The end, only by and Sure.
[0114] For users utilizing BCC encoding, the following equation shows the first... u Number of FEC prepup bits per user:
[0115] .
[0116] For users using BCC encoding, both the PHY payload boundary (or FEC prep padding boundary) and the PHY decode bit boundary, and the OFDM symbol... symbol segment in The ends are the same, by and Sure.
[0117] For each user using LDPC or BCC encoding, calculate the number of FEC-padding bits in the last symbol as shown in the following equation:
[0118] .
[0119] FEC post-padding will fill in the data frequency modulation that was not occupied by the PHY decoding bits in the last OFDM symbol (e.g., the remaining symbol segments in the last OFDM symbol).
[0120] In the FEC prepend bits, the MAC can deliver the PSDU, which fills the available eight bytes in the data field of the EHT PPDU, in the final OFDM symbol, for user-oriented signals encoded via LDPC. The expected initial FEC pre-fill boundary is represented, and for users oriented via BCC encoding... The expected FEC pre-padding boundary is represented. The PHY then determines the number of padding bits to add and appends it to the PSDU. The number of FEC pre-padding bits added by the PHY will always be between 0 and 7.
[0121] Aspects related to low-rate decoding design
[0122] The aspects of this disclosure can help achieve distance extension via decoding gain by providing designs for lower code-rate decoding. These designs can be applied to different types of decoding, for example, to provide lower code-rate LDPC codes and / or binary convolutional codes (BCC). The low code-rate proposed herein can help achieve higher power gain compared to higher code-rate codes.
[0123] In some examples, low-bit-rate codes can be implemented by utilizing existing (high-bit-rate) codes. Therefore, some existing encoders and decoders can be reused, which helps to avoid the time and cost required to develop a large number of entirely new encoders and decoders to support the low-bit-rate codes presented in this paper.
[0124] The techniques proposed in this paper can be used to generate lower-rate LDPC codes and achieve LDPC rate matching for Extended Long-Range (ELR) modes. These techniques can also be used to generate lower-rate BCC codes and achieve BCC rate matching for ELR. As will be described below, existing decoding parameters can also be utilized when determining the lower-rate decoding parameters proposed in this paper. For example, nominal codeword sizes of 648, 1296, 1944, and 3888 (=2 × 1944) can be used.
[0125] In this context, code rate generally refers to the ratio of the number of data bits in a codeword to the number of decoded bits. The nominal code rate typically refers to the code rate defined for encoding (e.g., in 802.11be, nominal code rates include 1 / 2, 2 / 3, 3 / 4, and 5 / 6). Before transmission, various rate-matching operations (e.g., shortening, puncturing, and / or repeating bits) can be performed to ensure an appropriate number of bits are obtained so that the effective code rate matches the desired code rate. Therefore, the effective code rate during transmission refers to the actual code rate produced by the rate-matching process. Rate matching can be designed to fit codewords or decoded bits into a specific number of OFDM symbols and / or a specific number of symbol segments (through shortening, puncturing, and / or repeating bits), which results in the effective code rate during transmission potentially differing from the nominal low code rate.
[0126] There are various methods for achieving reduced code rate codes. One approach would be to design new general (e.g., LDPC) decodings that achieve reduced code rates. R For example, among them R <1 / 2. For example, one approach is to target a reduced bitrate. R Design a new parity check matrix for each nominal codeword size. Using this method, the (existing) nominal codeword size can still be used.
[0127] As noted above, other methods can utilize existing nominal code rates (e.g., LDPC codes at 1 / 2, 2 / 3, 3 / 4, or 5 / 6 of the 11be code rate) to generate codes with a reduced target code rate. R LDPC code.
[0128] Figure 4 An example call flowchart 400 for a low-code-rate code design according to various aspects of this disclosure is illustrated, which utilizes an existing nominal code rate. This example assumes transmission between a first wireless node (transmitter / Tx) and a second wireless node (receiver / Rx). In some cases, the first and / or second wireless node may be... Figure 1 Examples of AP 102 and / or STA 104 are shown.
[0129] As indicated in 402, the first wireless node encodes a set of data bits based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, which is lower than the first nominal code rate. As indicated in 404, the first wireless node transmits the low-rate codeword (CW) to the second wireless node.
[0130] As indicated in 406, the second wireless node decodes the codewords associated with the reduced nominal code rate based on at least a first nominal code rate, which is higher than the reduced nominal code rate. In other words, as will be described in more detail below, the second wireless node may utilize a decoder based on the higher nominal code rate.
[0131] Various methods exist to generate LDPC codes with reduced target code rates using existing nominal code rates (e.g., LDPC codes at 1 / 2, 2 / 3, 3 / 4, or 5 / 6 of the 11be code rate). R LDPC code.
[0132] The first method to achieve a reduced nominal code rate is to utilize existing nominal codes and repetitions to achieve the target reduced code rate. R .
[0133] According to this method, for example, the transmitter can first base its signal on an existing bit rate. R0 And generate LDPC codewords of a certain nominal codeword size, and then repeat the decoding bits. N This is to obtain the nominal bitrate. R0 / N The LDPC code, and make the new nominal codeword size the same as the original nominal codeword size. N For example, by using half the nominal bitrate and repeating at 2x, 3x, and 4x respectively ( N =2, N =2, N =2), resulting in reduced bitrates of 1 / 4, 1 / 6, and 1 / 8. Similarly, using 2 / 3 of the nominal bitrate and repeating twice ( N =2) can achieve a 1 / 3 reduction in bitrate; using 3 / 4 of the nominal bitrate and repeating 3 times ( N =3) can achieve a 1 / 4 reduction in bitrate; using 5 / 6 of the nominal bitrate and performing 5 times the repetition ( N =5) can achieve a 1 / 6 reduction in bit rate.
[0134] A second method to achieve a reduced nominal code rate is to utilize the concatenation of existing nominal codes to achieve the target reduced code rate. R .
[0135] According to this method, for example, the transmitter can first use the bit rate R1The first encoder generates LDPC codewords, and then these LDPC codewords are used as the code rate. R2 The input to the second encoder is used to generate new LDPC codewords, thereby obtaining the nominal code rate. R1 R2 LDPC code. For example... Figure 5 As illustrated in Example 500, more than two encoders (e.g., 502, 504, and 506) can be cascaded in this manner, with the final nominal code rate being the product of the code rates of the individual encoders (e.g., ...). R1 R2 R3 ).
[0136] Figure 5 Example diagram 500 illustrates a concatenated code. In the illustrated example, the first LDPC encoder 502 has a first nominal code rate R1, the second LDPC encoder 504 has a second nominal code rate R2, and the third LDPC encoder 506 has a third nominal code rate R3. Therefore, in this example, the effective code rate (R_new) is the product of the code rates of all encoders: R_new = R1 R2 R3.
[0137] In some cases, challenges may arise when utilizing existing codes because the encoder input and output sizes are fixed for each combination of code rate and nominal codeword size. For example, assuming nominal code rates of 1 / 2, 2 / 3, 3 / 4, and 5 / 6 LDPC codes, a reduced nominal code rate of 1 / 3 can be achieved using code rates of 1 / 2 and 2 / 3, where the encoder input / output sizes (e.g., ...) are different. Figure 5 The nominal codeword sizes (as indicated) are: N_1=648, N_2=1296, N_3=1944; while a 1 / 6 reduction in nominal code rate can be achieved using concatenated code rates of 1 / 2, 2 / 3, and 1 / 2, where N_1=648, N_2=1296, N_3=1944, and N_4=3888. In such cases, the new nominal codeword size can remain the same as the existing nominal codeword size (e.g., N_3=1944 at a code rate of 1 / 3, and N_4=3888 at a code rate of 1 / 6).
[0138] However, to generalize this method to achieve more low bit rates, the target bit rate R (where R < 1 / 2) can be constructed by cascading multiple LDPC encoders with existing LDPC bit rates (1 / 2, 2 / 3, 3 / 4, 5 / 6). Each encoder (e.g., the i-th encoder) can be combined with shortening and puncturing / repetition to maintain the same bit rate R_i, but using different sets of input and output sizes (N_i, N_{i+1}). For example, to achieve a 1 / 4 reduced bit rate, a cascade of bit rates 1 / 2 and 1 / 2 can be used, where N_1 = 648 and N_2 = 1296. In this case, the input of the second encoder can use 1944 - 1296 = 648 shortened bits, and the output of the second encoder can have 3888 bits, where the transmitter can discard 648 shortened bits and puncture 648 parity bits, resulting in N_3 = 2592. In this example scenario, the new nominal codeword size is 2592.
[0139] This method provides flexibility for achieving a wide range of reduced nominal bitrates. For example, a 1 / 3 bitrate can be achieved by concatenating 1 / 2 and 2 / 3 bitrates; a 1 / 4 bitrate can be achieved by concatenating 1 / 2 and 1 / 2 bitrates; a 1 / 6 bitrate can be achieved by concatenating 1 / 2, 1 / 2 and 2 / 3 bitrates; a 1 / 8 bitrate can be achieved by concatenating 1 / 2, 1 / 2, 2 / 3 and 2 / 3 bitrates; a 1 / 9 bitrate can be achieved by concatenating 1 / 2, 1 / 2, 1 / 2 and 2 / 3 bitrates; and a 1 / 16 bitrate can be achieved by concatenating 1 / 2, 1 / 2, 1 / 2 and 1 / 2 bitrates.
[0140] A third method to achieve a reduced nominal bit rate is to use an encoder that uses padding bits (also known as extended shortening bits).
[0141] According to this method, as referenced Figure 6 As will be described in more detail below, some input bits to the encoder can be padding bits (values known) that are known to both the Tx and Rx nodes. For example, these known padding bits can be zero bits, all bits, or a known sequence. On the Tx side, the transmitter can discard these padding bits at the LDPC output and not transmit them. On the Rx side, the receiver can supplement the decoder input with the log-likelihood ratio (LLR) of these known padding bits and discard the corresponding bits at the decoder output.
[0142] Figure 6Figure 600 illustrates an example of how a reduced code rate can be achieved using an encoder with extended shortening / padding bits. The illustrated example assumes an LDPC encoder (for a single codeword) with a nominal codeword size of 1944. In the illustrated example, padding bit 604 is known to be (486) zero bits and is appended to (486) information bits 602 before encoding using a nominal decoding rate of 1 / 2. Encoding results in (972) parity bits 606. As illustrated, padding bit 604 is removed before transmission, preserving the information bits and parity bits.
[0143] like Figure 7 As illustrated, on the receiver side, the receiver can generate LLR 702 and 706 for the information bits and parity bits, respectively. The receiver can insert LLR 704 for a known bit sequence. Using a decoder with a nominal code rate of 1 / 2, the receiver can then obtain the information bits 602 and the padding bits 606.
[0144] In this way, the LDPC encoder can achieve a new nominal decoding rate while using half the nominal decoding rate. As noted above, this method can be generalized to achieve various low bitrates (e.g., =1 / 3, 1 / 4, 1 / 8, 1 / 12, 1 / 16...). In such cases, such as... Figure 8 As illustrated in Figure 800, the parity length can be fixed as... ,in This is the nominal codeword size. This may involve a fixed information bit length B, which can be determined by solving the following equation:
[0145] ,
[0146] like Figure 8 As indicated in Table 850, B can be represented as:
[0147] ,
[0148] The round(), floor(), or ceil() functions can be used to round B to the nearest integer. Figure 8 As illustrated, the parity bits can have a fixed length. ,in This refers to the nominal codeword size. Figure 8 Examples are shown. =1944, and therefore the parity bit has a fixed length of 972.
[0149] As indicated, Length-B may include both "payload bits" and "shortened bits," where the length of the bit sequence (e.g., zero bits) is known. To obtain a fixed parity bit length. In some cases, this can be viewed as a longer shortened bit in the hardware implementation.
[0150] New LDPC length ( It can be used to determine the number of codewords. Number of shortened bits and the number of holes .like Figure 8 As indicated in Table 850, compared with the original nominal And the calculation of encoding parameters related to R=1 / 2 can be based on the new code rate (Rnew) and the new nominal codeword size ( Adjustments will be made.
[0151] Various methods can also be combined to achieve a reduced nominal bit rate.
[0152] For example, a combination of the first and second methods could involve concatenated codes followed by repetition. For instance, using concatenated code rates of 1 / 2 and 2 / 3 and then repeating at twice the rate (…). N =2) can achieve a bitrate of 1 / 6; using concatenated bitrates of 1 / 2 and 2 / 3 and then repeating them 4 times ( N =2) can achieve a bitrate of 1 / 12.
[0153] For example, a combination of the second and third methods may involve concatenated codes and / or encoders using extended shortened bits. Using this method, a 1 / 6 reduction in code rate can be achieved by using a nominal decoding rate of 1 / 2 and an extended shortened bit encoder with a code rate of 1 / 3; a 1 / 12 reduction in code rate can be achieved by using concatenation of nominal decoding rates of 1 / 2 and 1 / 2 and an extended shortened bit encoder with a code rate of 1 / 3.
[0154] For example, a combination of the first and third methods could involve first generating a lower-rate LDPC code from an extended shortened bit encoder, followed by repetition. For instance, using an extended shortened bit encoder with a 1 / 3 bit rate and performing double repetition (…). N =2) can achieve a bit rate of 1 / 6; using an extended shortened bit encoder with a bit rate of 1 / 3 and repeating twice ( N =4) can achieve a bitrate of 1 / 12.
[0155] For example, a combination of the first, second, and third methods can involve concatenated codes, which are lower-rate codes generated by an encoder with extended shortening bits and then repeated. For instance, concatenating a nominal code rate of 1 / 2 with a code rate of 1 / 3 (implemented by an encoder with extended shortening bits) and repeating it twice (N=2) yields a reduced code rate of 1 / 12.
[0156] Various rate-LDPC rate matching procedures can be applied to ELR mode. For example, such rate matching can be applied to various methods proposed in this paper to achieve a reduced nominal bitrate in ELR mode.
[0157] As described above, the nominal codeword size and nominal coderate can change due to the new low-rate LDPC design. Assuming the original nominal coderate... Taken from set {1 / 2, 2 / 3, 3 / 4, 5 / 6}, original nominal codeword size Taken from the set of nominal codeword sizes {648, 1296, 1944, 3888}. In ELR mode, the new nominal coderate... The new nominal codeword size is expressed as As described above. In some cases, the codeword size scaling factor can be... b Defined as: If the new general low-rate LDPC design is used, the nominal codeword size may remain unchanged (e.g., corresponding to...). ).
[0158] If repetition is used to achieve a reduced nominal bit rate, then due to the... N For each repetition, the nominal codeword size can be the original nominal codeword size. N times (for example, If a reduced nominal code rate is achieved by concatenating nominal code rates or using an encoder with extended shortening bits, the scaling factor may depend on the new nominal code rate. And it doesn't have to be an integer.
[0159] LDPC rate matching in ELR mode can use rate matching algorithms similar to existing (e.g., 802.11be) rate matching algorithms, but requires some modifications.
[0160] First, basic parameters can be adjusted. For example, if the effective number of QAM modulations and / or data frequency modulations carrying unique data changes, the user can adjust... u Number of decoding bits and .user u Number of data bits and Can be based on and and the new nominal bitrate Recalculate.
[0161] Second, the original nominal bit rate Replace with the new nominal bitrate Third, the original nominal codeword size Replace with the new nominal codeword size Fourth, to select the codeword size and number of codewords (e.g., in the second rate matching step above), since the nominal codeword size has changed, a scaling factor can be used based on the codeword size. Adjust the conditions for obtaining the decoding parameters (e.g., from Table 1). For example, regarding... The range conditions can be derived from Change to And conditions Can be changed to .
[0162] If repetition is used, other changes can be made in addition to those mentioned above. First, due to the nature of repetition, given... During the repetition, the number of shortened bits in each codeword must be . A multiple of. In step 3 (shortening), the total number of shortened bits is changed to:
[0163] .
[0164] Therefore, when When, the shortening is not performed. At that time, according to multiple groups The shortened bits can be evenly distributed across all N bits. CW,u On each code word, the first one This code character is shorter than the others. Units digit. As described above, shortened bits can be appended to the data bits (and discarded after encoding). The number of shortened bits for each codeword before repetition can be 1 / 3 the number of shortened bits for each codeword after repetition. N (For example, the number of shortened bits will also be repeated.) N Second-rate).
[0165] Secondly, for puncturing and / or repetition (e.g., each fourth rate matching step described above), the total number of punctured bits and the total number of repetition bits can still be calculated based on the same equation (e.g., the equation in 11be), but the number of punctured bits and the number of repetition bits can be chosen differently. It can be noted that the number of punctured bits per codeword and the number of repetition bits per codeword do not need to be... Multiples of.
[0166] Regarding drilling, when At that time, drilling will not be performed. At that time, the punching positions can be evenly distributed across all N. CW,u On each code word, the first one This codeword has one more puncture bit than the others. Typically, only the parity bit can be punctured. Due to the repetitive nature of the bit, each parity bit has a certain number of puncture bits before being punctured. NThe punching step may selectively punch all copies of certain parity bits (typically starting from the last parity bit and working backwards). In other cases, the punching step may punch the copied parity bits (due to the repetition method) while retaining at least one copy for each parity bit.
[0167] Regarding repetition, when When, do not perform repetition. When the number of decoding bits to be repeated is equal to that of all N, the remaining bits can be evenly distributed across all N bits. CW,u On each code word, including the first one One codeword repeats one bit more than the others. Starting from the beginning of the LDPC codeword (the beginning of the data bits), the decoded bits to be repeated for any codeword can be copied only from the codeword itself. The repetition step can be to repeat all copies of certain data bits (the beginning of the data bits in each copy), or in some cases, to repeat as many different data bits as possible.
[0168] The technique presented in this paper can also be used to achieve reduced code rates for binary convolutional code (BCC) encoding. In some cases (e.g., 802.11be), the DATA field can support channel decoding using BCCs with decoding rates R=1 / 2, 2 / 3, 3 / 4, and 5 / 6. The BCC with R=1 / 2 is generated by an industry-standard generator polynomial. and Generate. BCCs with R=2 / 3, 3 / 4, and 5 / 6 can be derived from BCCs with R=1 / 2 by using "punching".
[0169] Various aspects of this disclosure can be used to implement BCC with reduced code rates (e.g., R < 1 / 2). For example, as Figure 9 The illustrated example uses a BCC encoder 902 at a given bit rate, along with repetition (as indicated at 904) and (in some cases) puncturing (as indicated at 906) to achieve a reduced bit rate. In the illustrated example, the transmitter may first generate a BCC at half the bit rate, then perform repetitive decoding and (if necessary) puncturing to achieve the target lower bit rate.
[0170] Examples that do not involve punching include: using BCC at 1 / 2 bitrate with repetitions at 2x, 3x, 4x, 5x, 6x, and 8x ( N =2、 N =3、 N =4、 N =5、 N =6、 N =8) and thus reduced bitrates of 1 / 4, 1 / 6, 1 / 8, 1 / 10, 1 / 12, and 1 / 16. Examples involving punching could include: using BCC at 1 / 2 bitrate with 2x repeat ( =8) N=2) and a 1 / 3 reduction in bit rate obtained by punching 1 bit in every 4 bits; and using BCC with 1 / 2 bit rate and 3 times repetition ( N =3) and a 1 / 5 reduction in bit rate is obtained by punching 1 bit in every 6 bits.
[0171] Figure 10 An example is shown where the transmitter uses a BCC with a bit rate of 1 / 2, performs double repetition, and punches one bit every four bits to achieve a 1 / 3 reduction in BCC bit rate. In the illustrated example, "repetition every 2 bits" is used as an example. However, the repetition pattern can be implemented in different variations, such as "bit repetition" (e.g., A0, A0, B0, B0, A1, A1, B1, B1, ...).
[0172] In the illustrated example, as indicated by Xs, bits (B0, A1) are punctured iteratively every 8 bits. Therefore, in this example, the actual bits transmitted after repetition and puncturing are "A0, B0, A0, A1, B1, B1". Of course, the puncturing pattern can also be implemented in different variations, such as iteratively puncturing (A0, B1) or (A0, B0) or (A1, B1). Figure 11 Examples are given corresponding to Figure 10 The example shown is an example of receiver-side processing. As illustrated, on the receiver side, bits corresponding to the punched data are inserted, and combinations are performed to account for repetitions, ultimately resulting in decoded data.
[0173] Figure 12 This example illustrates a transmitter that achieves a 1 / 4 reduced BCC rate by using a 1 / 2 BCC rate with double repetition without puncturing. In the illustrated example, the bits are "repeated every 2 bits". Without puncturing, the transmitted bits are "A0, B0, A0, B0, A1, B1, A1, B1". Figure 13 Examples are given corresponding to Figure 11 The example shown is an example of receiver-side processing. As illustrated, on the receiver side, after data reshaping, a combination is performed to account for duplicates, ultimately resulting in decoded data.
[0174] BCC rate matching in ELR mode can reuse existing BCC rate matching algorithms (e.g., 802.11be), but requires various modifications. First, the basic parameters can be adjusted, similar to LDPC rate matching in ELR mode, as described above. Second, the original nominal bit rate can be... R (e.g., 1 / 2, 2 / 3, 3 / 4, 5 / 6) are replaced with the new nominal bitrate. R_ new (e.g., 1 / 3, 1 / 6, 1 / 16). This is related to the number of decoding bits. , and the number of data bits , The relevant parameters need to be adjusted according to the new nominal bitrate. R_new Adjustments will be made.
[0175] BCC rate matching differs from LDPC rate matching for various reasons. For example, BCC coding is not based on block codes, making it easier to fit data bits within the pre-FEC padding boundaries and decoded bits within the PHY decoded bit boundaries. BCC rate matching may also not involve further puncturing and, as described above, can use only repetition to reach the PHY decoded bit boundaries. In BCC rate matching, the pre-FEC padding boundaries and PHY decoded bit boundaries can be the same.
[0176] In some cases, repeating the decoded bits can increase the signal's peak-to-average power ratio (PAPR), which can be mitigated by applying a mask or scrambling sequence. For example, this scheme can be used in... Figure 14 The transmitter scenario 1400 shown is applied, where the encoder 1402 (e.g., BCC or LDPC) is repeated (at 1404) and possibly punched (at 1406).
[0177] According to the first option for mitigating PAPR, a mask can be applied to the copied decoded bits to break the repetition pattern. This can be understood by considering an example: suppose block-by-block repetition (as in...) Figure 14 (As shown at position 1404 in the diagram), where the decoded bit block size L=8. We can assume [C1……C8] represents the 8 original decoded bits in a certain OFDM symbol. The output bit stream after 4 times repetition is a 32-bit sequence:
[0178] Cout=[[C1….C8], [C1….C8, C1….C8, C1….C8]] XOR S32,
[0179] S32 is a 32-bit scrambling sequence used to reduce PAPR, consisting of 0s and 1s. The output bitstream after 8 repetitions is a 64-bit sequence.
[0180] Cout=[[C1….C8], [C1….C8, C1….C8, C1….C8, C1….C8, C1….C8, C1….C8, C1….C8]] XOR S64,
[0181] S64 is a scrambling sequence of length 64 to reduce PAPR, consisting of 0 and 1 bit values.
[0182] In some cases, the scrambling sequences S32 and S64 can be optimized to minimize the PAPR statistic, or a known sequence that is known to both the transmitter and receiver and is beneficial for reducing PAPR can be used.
[0183] In some cases, the scrambling sequence may be taken from an existing scrambling sequence. The scrambling sequence may have a fixed initial value (e.g., across different groups) or different initial values for different groups. In the case of different values for different groups, this value may be the same as the initial value of the scrambling for the data field of that group (which is random and signaled in the SERVICE field). In some cases, the scrambling sequence may be taken from an existing data scrambling sequence (e.g., 802.11a to 802.11ax), which is generated by a generator polynomial. The scrambling sequence is defined and has a fixed set of 7 initial bits (e.g., all 1s). S32 can be the first 32 bits generated by the scrambling unit, or similarly, S64, S16 (for 2x repetition), or S48 (for 6x repetition). Alternatively, the scrambling sequence can be taken from an existing (e.g., 802.11be) data scrambling sequence generated by the generator polynomial. The scrambling sequence is defined and has a fixed set of 11 initial bits (e.g., all 1s). S32 can be the first 32 bits generated by this scrambling unit, and similarly for S64, S16 (for 2x repetition), and S48 (for 6x repetition). By using a fixed existing scrambling sequence defined for the data, these examples can be generalized to any decoded bit block size. L And any number of repetitions.
[0184] According to the first option for mitigating PAPR, after constellation mapping, a mask can be applied to the data frequency modulus of each OFDM symbol. For example, an existing (e.g., 802.11be) 20MHz symbol may have 242 frequency modulus, of which 8 are pilots and 234 are data frequency modulus. In such a case, the decoded bits of the copy assigned to each OFDM symbol can be mapped to QAM symbols (one QAM symbol per data frequency modulus). Known masks can be applied to the data frequency modulus to help reduce PAPR, for example, using HE-LTF or EHT-LTF defined for 20MHz (e.g., masking using LTF values on the data frequency modulus). This method can be considered in effect as similar to performing a rotation on each data frequency modulus to reduce PAPR.
[0185] Some of the processes, methods, operations, techniques, or other aspects described herein may be implemented, at least in part, using artificial intelligence (AI) programs, such as programs that include machine learning (ML) or artificial neural network (ANN) models (collectively, AI / ML models). One or more AI / ML models may be implemented in wireless communication devices (e.g., AP 102 and STA 104) to enhance various aspects associated with wireless communication. For example, AI / ML models may be trained to identify patterns or relationships in data observed in wireless communication network 100. AI / ML models may support operational decisions related to various aspects associated with wireless communication networks or services. For example, AI / ML models may be used to support or improve aspects such as reducing signaling overhead (e.g., compression via CSI feedback), enhancing roaming or other mobility operations, multi-AP coordination, and generally facilitating network management or optimizing network connectivity or characteristics, thereby, for example, increasing throughput or capacity, reducing latency, or otherwise enhancing the user experience.
[0186] Example AI / ML models may include mathematical representations or definitions of computational capabilities used to infer from input data based on patterns or relationships identified in the input data. As used herein, the term "inference" may include one or more of decision, prediction, determination, or value, which may represent the output of an AI / ML model. Computational capabilities may be defined based on certain parameters of the AI / ML model, such as weights and biases. Weights may indicate a relationship between certain input data and certain outputs of the AI / ML model, and biases are offsets that may indicate the starting point of the AI / ML model's output. An example AI / ML model that operates on input data may start with an initial output based on the biases and then update the output based on a combination of input data and weights.
[0187] STAs or APs (such as STA 104 or AP 102) can exchange local observations or provide communication-related feedback with other wireless communication devices, such as other STAs or APs. This can significantly expand the types of input data that can be considered input to AI / ML models, as such information might not otherwise be available at other wireless communication devices. For example, information received from other STAs or APs may include: observed RSSI values, packet success / failure / retry rates experienced by each client / AP, BSS / QoS load / demand, or historical records of poor / good AP links, which can be conveyed based on scores or rankings.
[0188] AI / ML models can be centralized, distributed, or federated. Since both STA 104 and AP 102 can participate in AI / ML-based operations, efficient AI / ML model distribution can enhance the performance of wireless communication systems. In some examples supporting centralized AI / ML models, STA 104 can provide training data to a centralized network location (such as an AP, AP MLD, or server), where a global AI / ML model is generated and refined. The centralized network location can then distribute the global AI / ML model to various STAs. In some examples, the global AI / ML model can train a single classifier based on all training data received from various inputs / sources. In some examples supporting distributed learning or distributed models, both AP and STA can be able to independently compute AI / ML models and share data with other participating wireless communication devices in the wireless communication network, allowing each device to train the global AI / ML model locally. In some examples supporting federated learning or hybrid AI / ML models, virtually all participating wireless communication devices (such as AP 102 and STA 104) can generate local AI / ML models and share their local models to a centralized network location or entity. Subsequently, the centralized network entity can use the received local model as input to generate a global AI / ML model, and distribute the global model to all or some of the participating wireless communication devices.
[0189] In some examples, the AI / ML model can be downloadable. For instance, an AP can share AI / ML model components with associated STAs or other friendly / cooperative APs. STAs can download the AI / ML model and use it to make wireless communication-related decisions. Downloading the AI / ML model can be independent of signaling input to the AI / ML model (e.g., some wireless communication devices can download the AI / ML model without exchanging information with other wireless communication devices; some wireless communication devices can exchange information and use such information as input to the AI / ML model without downloading the model; and some wireless communication devices can download the AI / ML model and exchange information or the AI / ML model with other wireless communication devices).
[0190] Figure 15 A flowchart illustrating an example process 1500 that can be executed by or at a first wireless node supporting the low code rate decoding proposed herein is shown. Operation of process 1500 may be implemented by a wireless AP or its components as described herein, or by a wireless STA or its components as described herein. For example, process 1500 may be implemented by a wireless communication device (such as reference 1500) operating as a wireless AP and / or wireless STA, or operating within such a wireless AP or wireless STA. Figure 17The described wireless communication device 1700 performs this process. In some examples, process 1500 may be performed by a wireless AP (such as reference 1700). Figure 1 The process 1500 is performed by one of the APs described in AP 102. In some examples, the process 1500 may be performed by a wireless STA (such as reference STA). Figure 1 The STA described in STA 104 is executed.
[0191] Procedure 1500 begins at block 1505, where the set of data bits is obtained. In some cases, the operation of this block refers to, as in reference... Figure 17 The circuit and / or code described for obtaining, or that can be executed by the circuit and / or the code.
[0192] Then, process 1500 proceeds to block 1510, where the set of data bits is encoded based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, which is lower than the first nominal code rate. In some cases, the operation of this block refers to... Figure 17 The circuitry used for encoding and / or the code used for encoding, or the circuitry and / or the code that can be executed.
[0193] Then, process 1500 proceeds to block 1515, where one or more codewords are output. In some cases, the operation of this block refers to... (refer to...) Figure 17 The circuitry and / or code described for the output, or the code that can be executed by the circuitry and / or the code.
[0194] In some respects, the encoding involves at least one of the following: LDPC encoding; or BCC encoding.
[0195] In some aspects, encoding includes: generating a first codeword; and repeating the decoded bits of the first codeword to generate a second codeword, which includes one or more codewords.
[0196] In some respects, the repetition includes repeating the decoded bits of the first codeword N times; the size of a codeword in the second codeword is N times the size of a codeword in the first codeword; and the reduced nominal code rate is (1 / N) of the first nominal code rate.
[0197] In some respects, the number of shortened bits in each codeword in the second codeword is a multiple of N.
[0198] In some respects, generating the first codeword includes: encoding a set of data bits based on a first nominal code rate to obtain a first decoded bit; and encoding the first decoded bit based on a second nominal code rate to obtain the first codeword.
[0199] In some respects, generating the first codeword includes: forming a set of system bits by appending a set of padding bits to a set of data bits, encoding the system bits to generate parity bits, and generating the first codeword by appending the parity bits to the data bits.
[0200] In some aspects, the encoding includes: generating a first codeword; repeating the decoded bits associated with the first codeword to generate a second codeword; and applying a mask sequence to the repeated decoded bits within each codeword in the second codeword to generate one or more codewords.
[0201] In some aspects, encoding includes generating a first codeword and repeating the decoded bits associated with the first codeword to generate a second codeword; and process 1500 further includes performing constellation mapping on the repeated decoded bits to generate an OFDM symbol; and applying a mask sequence to the data frequency modulation of the OFDM symbol.
[0202] In some aspects, the encoding includes: encoding a set of data bits based on a first nominal code rate to generate a first codeword; and further encoding the first codeword based on at least a second nominal code rate to generate a third codeword, the third codeword having a reduced code rate that is a function of at least the first code rate and the second code rate.
[0203] In some aspects, process 1500 further includes forming a system bit set by appending a set of padding bits to a set of data bits before encoding, encoding the system bits based on a first nominal code rate to generate a first codeword, and further encoding the first codeword based on a second nominal code rate to generate a third codeword. In some cases, the operation of this block refers to, as referenced... Figure 17 The circuit and / or code described for formation, or that can be executed by the circuit and / or the code.
[0204] In some respects, at least one encoder used for further encoding performs at least one of punching a fixed number of parity bits or repeating a fixed number of data bits to achieve a target nominal bit rate and a nominal codeword size for the second codeword.
[0205] In some aspects, process 1500 further includes forming a set of system bits by appending a set of padding bits to a set of data bits, wherein encoding includes: encoding the system bits to generate a first codeword of a first size having parity bits, and generating a second codeword of a second size using the data bits and the parity bits. In some cases, the operation of this block refers to, as referenced... Figure 17 The circuit and / or code described for formation, or that can be executed by the circuit and / or the code.
[0206] In some respects, the length of the data bits in each codeword of the second codeword is a function of the reduced code rate and the nominal codeword size of the first codeword.
[0207] In some respects, the length of the padding bits in each codeword of the second codeword is a function of the length of the data bits in each codeword of the second codeword and the nominal codeword size of the first codeword.
[0208] In some respects, the size of one or more second codewords is a function of the length of the data bits in each codeword of the second codeword and the nominal codeword size of the first codeword.
[0209] In some respects, at least one of the following situations exists: the nominal codeword size is adjusted based on the nominal codeword size of the second codeword; or at least one of the number of decoded bits, the number of shortened bits, or the number of data bits is adjusted based on the reduced code rate.
[0210] It should be noted that Figure 15 This is merely one example of a process, and other processes consistent with this disclosure, including fewer, additional, or alternative blocks, are possible.
[0211] Figure 16 A flowchart illustrating an example process 1600 that can be executed by or at a wireless STA supporting the low code rate decoding proposed herein is shown. Operation of process 1600 may be implemented by a wireless AP or its components as described herein, or by a wireless STA or its components as described herein. For example, process 1600 may be operated by a wireless communication device (such as reference 1600) operating as a wireless AP and / or wireless STA, or operating within such a wireless AP or wireless STA. Figure 17 The described wireless communication device 1700 performs this process. In some examples, process 1600 may be performed by a wireless AP (such as reference 1700). Figure 1 The process 1600 is performed by one of the APs described in AP 102. In some examples, the process 1600 may be performed by a wireless STA (such as reference STA). Figure 1 The STA described in STA 104 is executed.
[0212] Process 1600 begins with block 1605, in which one or more codewords associated with the reduced nominal code rate are obtained. In some cases, the operation of this block refers to, as referenced... Figure 17 The circuit and / or code described for obtaining, or that can be executed by the circuit and / or the code.
[0213] Then, process 1600 proceeds to block 1610, where one or more codewords are decoded based on at least a first nominal code rate to recover the set of data bits, wherein the first nominal code rate is higher than a reduced nominal code rate. In some cases, the operation of this block refers to, as referenced... Figure 17 The circuitry and / or code used for decoding described, or that can be executed by the circuitry and / or the code.
[0214] In some respects, decoding involves at least one of the following: LDPC decoding; or BCC decoding.
[0215] In some respects, decoding includes: decoding one or more codewords; and combining the decoded bits after decoding.
[0216] In some respects, decoding includes: decoding one or more codewords based on a first nominal code rate to obtain a first codeword; and decoding the first codeword based on a second nominal code rate.
[0217] In some respects, decoding includes: decoding one or more codewords to obtain a system bit set, which includes a padding bit set appended to the data bit set.
[0218] In some respects, decoding includes: decoding one or more codewords based on a first nominal code rate to obtain a first codeword; and decoding the first codeword based on a second nominal code rate.
[0219] In some respects, decoding includes: decoding one or more codewords to obtain a system bit set, which includes a padding bit set appended to the data bit set.
[0220] In some respects, the length of the padding bits is a function of the length of the data bits and the nominal codeword size of the first codeword.
[0221] In some respects, the length of the data bits is a function of the reduced code rate and the nominal codeword size.
[0222] In some respects, there is at least one of the following situations: adjusting the nominal codeword size based on the nominal codeword size of the second codeword; and adjusting at least one of the number of decoded bits, the number of shortened bits, or the number of data bits based on the reduced code rate.
[0223] It should be noted that Figure 16 This is merely one example of a process, and other processes consistent with this disclosure, including fewer, additional, or alternative blocks, are possible.
[0224] Figure 17 A block diagram of an example wireless communication device 1700 supporting the low code rate decoding proposed herein is shown. In some examples, the wireless communication device 1700 is configured to perform reference... Figure 15The process 1500 is described. Wireless communication device 1700 may include one or more chips, SoCs, chipsets, packages, components, or devices that individually or collectively constitute or include a processing system. The processing system may interface with other components of wireless communication device 1700 and typically processes information (such as inputs or signals) received from and outputs information (such as outputs or signals) to such other components. In some aspects, an example chip may include a processing system, a first interface for outputting or transmitting information, and a second interface for receiving or acquiring information. For example, the first interface may refer to an interface between the chip's processing system and a transmitting component, allowing device 1700 to transmit information output from the chip. In such an example, the second interface may refer to an interface between the chip's processing system and a receiving component, allowing device 1700 to receive information subsequently passed to the processing system. In some such examples, the first interface may also acquire information, for example, from the transmitting component, and the second interface may also output information, for example, to the receiving component.
[0225] The processing system of the wireless communication device 1700 includes processor (or “processing”) circuitry in the form of one or more processors, microprocessors, processing units (such as a central processing unit (CPU), graphics processing unit (GPU), or digital signal processor (DSP)), processing blocks, application-specific integrated circuits (ASICs), programmable logic devices (PLDs) (such as field-programmable gate arrays (FPGAs)), or other discrete gate or transistor logic components or circuits (all of which are generally referred to herein individually as “processors” or collectively as “processors” or “processor circuitry”). One or more of these processors may be individually or collectively configured to perform the various functions or operations described herein. The processing system may also include memory circuitry in the form of one or more memory devices, memory blocks, memory elements, or other discrete gate or transistor logic components or circuitry, each of which may include tangible storage media such as random access memory (RAM) or read-only memory (ROM) or combinations thereof (all of which are generally referred to herein individually as “memory” or collectively as “memory” or “memory circuitry”). One or more of these memories may be coupled to one or more processors and may store processor-executable code, individually or collectively, which, when executed by one or more processors, configures one or more processors to perform the various functions or operations described herein. Additionally or alternatively, in some examples, one or more processors may be pre-configured to perform the various functions or operations described herein without software configuration. The processing system may also include or be coupled to one or more modems (such as a Wi-Fi (e.g., IEEE compliant) modem or a cellular (e.g., 3GPP 4G LTE, 5G, or 6G compliant) modem). In some embodiments, one or more processors of the processing system include or implement one or more modems. The processing system may also include or be coupled to multiple radio components (collectively, “radio components”), multiple RF chains, or multiple transceivers, each of which may in turn be coupled to one or more antennas. In some embodiments, one or more processors of the processing system include or implement one or more of the radio components, RF chains, or transceivers.
[0226] In some examples, the wireless communication device 1700 may be configured to be used for, or be configured to be used for, in an AP (such as a reference). Figure 1The described AP 102) is used. In some other examples, the wireless communication device 1700 may be an AP that includes such a processing system as well as other components including multiple antennas. In some examples, the wireless communication device 1700 may be able to be configured for or be configured for use in STAs (such as reference STAs). Figure 1 The described STA 104 is used. In some other examples, the wireless communication device 1700 may be an STA that includes such a processing system and other components including multiple antennas. The wireless communication device 1700 is capable of transmitting and receiving wireless communications, for example, in the form of wireless packets. For example, the wireless communication device 1700 may be configured or configured to transmit and receive packets in the form of physical layer PPDUs and MPDUs conforming to one or more wireless communication protocol standards in the IEEE 802.11 wireless communication protocol standard family. In some other examples, the wireless communication device 1700 may be configured or configured to transmit and receive signals and communications conforming to one or more 3GPP specifications, including specifications for 5G NR or 6G. In some examples, the wireless communication device 1700 also includes one or more application processors or may be coupled to such application processors, which may be further coupled to one or more other memories. In some examples, the wireless communication device 1700 also includes at least one external network interface coupled to the processing system, which enables communication with the core network or backhaul network implementing the wireless communication device 1700 to obtain access to external networks, including the Internet.
[0227] Wireless communication device 1700 includes an acquisition component 1705, an encoding component 1710, an output component 1715, a generation component 1720, a repetition component 1725, a forming component 1730, an application component 1735, an execution component 1740, a decoding component 1745, and a combination component 1750. A portion of one or more of components 1705, 1710, 1715, 1720, 1725, 1730, 1735, 1740, 1745, and 1750 may be implemented at least partially in hardware or firmware. For example, the acquisition component 1705 may be implemented at least partially by a processor or a modem. In some examples, a portion of one or more of components 1705, 1710, 1715, 1720, 1725, 1730, 1735, 1740, 1745, and 1750 may be implemented at least partially by a processor and software in the form of processor-executable code stored in memory.
[0228] In some cases, instead of actually transmitting, for example, signals and / or data, the wireless communication device 1700 may have an interface (a component for outputting or providing) for outputting or providing signals and / or data for transmission. For example, a processor may output signals and / or data to the radio frequency (RF) front end of the wireless communication device 1400 via a bus interface for transmission. In various aspects, the RF front end may include various components, including transmit and receive processors, transmit and receive MIMO processors, modulators, demodulators, etc.
[0229] In some cases, instead of actually receiving signals and / or data, the wireless communication device 1700 may have an interface (for acquisition components) for acquiring signals and / or data received from another device. For example, a processor may acquire (or receive) signals and / or data from the RF front end of the wireless communication device 1700 via a bus interface for reception. In various aspects, the RF front end may include various components, including transmit and receive processors, transmit and receive MIMO processors, modulators, demodulators, etc. In various aspects, the acquisition components, encoding components, adjustment components, output components, generation components, repetition components, punching components, application components, execution components, formation components, and decoding components may include one or more processors (such as one or more processors / components illustrated in the figures and / or described above).
[0230] Example Terms
[0231] Specific implementation examples are described in the following numbered clauses.
[0232] Clause 1: A method for wireless communication at a first wireless node, the method comprising: obtaining a set of data bits; encoding the data bits based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, the reduced nominal code rate being lower than the first nominal code rate; and outputting the one or more codewords.
[0233] Clause 2: The method described in Clause 1, wherein the encoding involves at least one of the following: low-density parity-check (LDPC) encoding; or binary convolutional code (BCC) encoding.
[0234] Clause 3: The method according to any one of Clauses 1 to 2, wherein the encoding comprises: generating a first codeword including decoded bits; and repeating the decoded bits of the first codeword to generate a second codeword, wherein the one or more codewords include the second codeword.
[0235] Clause 4: The method according to Clause 3, wherein at least one of the following conditions exists: the repetition includes repeating the decoded bits of the first codeword N times; the size of a codeword in the second codeword is N times the size of a codeword in the first codeword; or the reduced nominal code rate is (1 / N) of the first nominal code rate.
[0236] Clause 5: The method described in Clause 4, wherein the number of shortened bits in each codeword of the second codeword is a multiple of N.
[0237] Clause 6: The method according to Clause 3, wherein generating the first codeword comprises: encoding the data bits based on the first nominal code rate to obtain a first decoded bit; and encoding the first decoded bit based on a second nominal code rate to obtain the first codeword.
[0238] Clause 7: The method according to Clause 3, wherein generating the first codeword comprises: forming a system bit by appending padding bits to the data bits, encoding the system bit to generate a parity bit, and appending the parity bit to the data bits to generate the first codeword.
[0239] Clause 8: The method according to any one of Clauses 1 to 7, wherein the encoding comprises: generating a first codeword; repeating the decoded bits associated with the first codeword to generate a second codeword; and applying a mask sequence to the repeated decoded bits in each of the second codewords to generate the one or more codewords.
[0240] Clause 9: The method according to Clause 8, wherein the mask sequence is based on a scrambling sequence.
[0241] Clause 10: The method according to Clause 9, wherein the initial value of the scrambling sequence is a fixed value or a different value.
[0242] Clause 11: The method according to any one of Clauses 1 to 10, wherein: the encoding comprises: generating a first codeword including decoded bits; and repeating the decoded bits of the first codeword to generate a second codeword; and the method further comprises: performing constellation mapping on the repeated decoded bits to generate an orthogonal frequency division multiplexing (OFDM) symbol; and when outputting the one or more codewords, applying a mask sequence to the data frequency modulation of the OFDM symbol.
[0243] Clause 12: The method according to Clause 11, wherein the mask sequence is based on a value sequence including +1 and -1 values.
[0244] Clause 13: The method according to Clause 12, wherein the mask sequence is based on a known sequence of +1 and -1 values.
[0245] Clause 14: The method according to Clause 13, wherein the mask sequence is based on a known sequence used in a long training field (LTF).
[0246] Clause 15: The method according to any one of Clauses 1 to 14, wherein the encoding comprises: encoding the set of data bits based on the first nominal code rate to generate a first codeword; and further encoding the first codeword based on at least a second nominal code rate to generate a second codeword having the reduced nominal code rate, the reduced nominal code rate being a function of at least the first code rate and the second code rate, wherein the one or more codewords include the second codeword.
[0247] Clause 16: The method according to Clause 15, the method comprising: forming a system bit set by appending a set of padding bits to the set of data bits prior to the encoding, encoding the system bits based on a first nominal code rate to generate a first codeword, and further encoding the first codeword based on a second nominal code rate to generate a second codeword.
[0248] Clause 17: The method according to Clause 15, wherein the further encoding includes performing at least one of punching a fixed number of parity bits or repeating a fixed number of data bits.
[0249] Clause 18: The method according to any one of Clauses 1 to 17, the method comprising: forming a system bit by appending padding bits to the data bit, wherein the encoding comprises encoding the system bit to generate a first codeword of a first size having parity bits, and generating a second codeword of a second size using the data bit and the parity bits, wherein the one or more codewords include the second codeword.
[0250] Clause 19: The method according to Clause 18, wherein the length of the data bits in one of the codewords of the second codeword is a function of the reduced nominal code rate and the nominal codeword size of the first codeword.
[0251] Clause 20: The method according to Clause 19, wherein the length of the padding bit is a function of the length of the data bit in one of the codewords of the second codeword and the nominal codeword size of the first codeword.
[0252] Clause 21: The method according to Clause 19, wherein the size of the one or more second codewords is a function of the length of the data bits in each of the second codewords and the nominal codeword size of the first codeword.
[0253] Clause 22: The method according to any one of Clauses 1 to 21 further comprises at least one of: adjusting the nominal codeword size based on the nominal codeword size of the second codeword; or adjusting at least one of the number of decoded bits, the number of shortened bits, or the number of data bits based on the reduced nominal code rate.
[0254] Clause 23: A method for wireless communication at a first wireless node, the method comprising: obtaining one or more codewords associated with a reduced nominal code rate; and decoding the one or more codewords based on at least a first nominal code rate to recover a set of data bits, wherein the first nominal code rate is higher than the reduced nominal code rate.
[0255] Clause 24: The method described in Clause 23, wherein the decoding involves at least one of the following: low-density parity-check (LDPC) decoding; or binary convolutional code (BCC) decoding.
[0256] Clause 25: The method according to any one of Clauses 23 to 24, wherein the decoding comprises: decoding the one or more codewords; and combining the decoded bits after the decoding.
[0257] Clause 26: The method according to Clause 25, wherein the decoding comprises: decoding the one or more codewords based on the first nominal code rate to obtain a first codeword; and decoding the first codeword based on a second nominal code rate.
[0258] Clause 27: The method according to Clause 25, wherein the decoding comprises: decoding the one or more codewords to obtain a system bit set, the system bit set including a padding bit set appended to the data bit set.
[0259] Clause 28: The method according to any one of Clauses 23 to 27, wherein the decoding comprises: decoding the one or more codewords based on the first nominal code rate to obtain a first codeword; and decoding the first codeword based on a second nominal code rate.
[0260] Clause 29: The method according to Clause 28, wherein the decoding comprises: decoding the one or more codewords to obtain a system bit set, the system bit set including a padding bit set appended to the data bit set.
[0261] Clause 30: The method according to Clause 29, wherein the length of the padding bit is a function of the length of the data bit and the nominal codeword size of the first codeword.
[0262] Clause 31: The method according to any one of Clauses 23 to 30, wherein the length of the data bits is a function of the reduced code rate and the nominal codeword size.
[0263] Clause 32: The method according to any one of Clauses 23 to 31, wherein at least one of the following is present: adjusting the nominal codeword size based on the nominal codeword size of the second codeword; and adjusting at least one of the number of decoded bits, the number of shortened bits, or the number of data bits based on the reduced code rate.
[0264] Clause 33: An apparatus comprising: at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the apparatus to perform the method according to any combination of Clauses 1 to 32.
[0265] Clause 34: An apparatus comprising: a component for performing the method according to any combination of Clauses 1 to 32.
[0266] Clause 35: A non-transitory computer-readable medium comprising executable instructions that, when executed by at least one processor of a device, cause the device to perform the method according to any combination of Clauses 1 to 32.
[0267] Clause 36: A computer program product embodied on a computer-readable storage medium, the computer-readable storage medium including code for performing the methods described in any combination of Clauses 1 to 32.
[0268] Clause 37: A wireless node comprising: at least one transceiver; at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the device to perform the method according to any combination of Clauses 1 to 22, wherein the at least one transceiver is configured to transmit the one or more codewords.
[0269] Clause 38: A wireless node comprising: at least one transceiver; at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the device to perform the method according to any combination of Clauses 23 to 32, wherein the at least one transceiver is configured to receive the one or more codewords.
[0270] Additional considerations
[0271] As used herein, the term "determine" encompasses a wide variety of actions, and therefore, "determine" can include calculation, computation, processing, derivation, estimation, investigation, searching (such as by searching in a table, database, or other data structure), reasoning, ascertaining, or measuring, among other possibilities. Furthermore, "determine" can include receiving (such as receiving information), accessing (such as accessing data stored in memory), or sending (such as sending information), among other possibilities. Additionally, "determine" can include parsing, selecting, obtaining, choosing, building, and other similar actions.
[0272] As used herein, the phrase “at least one of” or “one or more of” refers to any combination of these items, including a single member. For example, “at least one of a, b, or c” is intended to cover: a, b, c, ab, ac, bc, and abc. As used herein, “or” is intended to be interpreted in an inclusive sense unless otherwise explicitly indicated. For example, “a or b” may include only a, only b, or a combination of a and b. Furthermore, as used herein, the phrase referring to “one” element means one or more of such elements that act individually or collectively to perform the stated function. Additionally, “set” means one or more items, and “subset” means less than the entire set, but not empty.
[0273] As used herein, unless otherwise explicitly indicated, “based on” is intended to be interpreted in an inclusive sense. For example, unless otherwise explicitly indicated, “based on” may be used interchangeably with “at least partially based on,” “associated with,” “associated with,” or “according to.” Specifically, unless the phrase in the context means “based on only one” or an equivalent, whether it is “based on one” or “at least partially based on one,” it may be based solely on “one” or based on a combination of “one” and one or more other factors, conditions, or information.
[0274] The various exemplary components, logic units, logic blocks, modules, circuits, operations, and algorithmic processes described in conjunction with the examples disclosed herein can be implemented as electronic hardware, firmware, software, or a combination of hardware, firmware, or software, including the structures disclosed in this specification and their structural equivalents. This interchangeability of hardware, firmware, and software has been generally described in terms of its functionality and exemplified in the various exemplary components, blocks, modules, circuits, and processes described above. Whether this functionality is implemented in hardware, firmware, or software depends on the specific application and the design constraints imposed on the overall system.
[0275] Various modifications to the examples described in this disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other examples without departing from the spirit or scope of this disclosure. Therefore, the claims are not intended to be limited to the examples shown herein, but are to be granted the widest scope consistent with this disclosure, the principles disclosed herein, and the novel features.
[0276] Additionally, the various features described in this specification in the context of individual examples may also be implemented in combination in a single specific embodiment. Conversely, the various features described in the context of a single specific embodiment may also be implemented individually or in any suitable sub-combination in multiple examples. Thus, although features may be described above as functioning in a particular combination, and even initially claimed in this way, one or more features from the claimed combination may be removed from the combination in some cases, and the claimed combination may involve sub-combinations or variations of sub-combinations.
[0277] Similarly, although operations are depicted in a specific order in the diagrams, this should not be construed as requiring such operations to be performed in the specific order shown or in sequential order, or to perform all illustrated operations to achieve the desired result. Furthermore, the accompanying figures may schematically depict one or more example processes in the form of flowcharts or flow diagrams. However, other operations not depicted may be incorporated into the schematically illustrated example processes. For example, one or more additional operations may be performed before, after, simultaneously with, or between any of the illustrated operations. In some environments, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the examples described above should not be construed as requiring such separation in all examples, but rather should be understood as meaning that the described program components and systems can generally be integrated together in a single software product or encapsulated in multiple software products.
Claims
1. An apparatus for wireless communication, the apparatus comprising: At least one memory, the at least one memory including computer-executable instructions; as well as One or more processors, the one or more processors being configured to execute the computer-executable instructions and cause the device to: Obtain the set of data bits; The data bits are encoded based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, the reduced nominal code rate being lower than the first nominal code rate; and Output the one or more codewords.
2. The apparatus of claim 1, wherein the encoding relates to at least one of the following: Low-density parity-check (LDPC) coding; or Binary convolutional code (BCC) encoding.
3. The apparatus of claim 1, wherein the encoding comprises: Generate the first codeword, including the decoded bits; as well as The decoded bits of the first codeword are repeated to generate a second codeword, wherein the one or more codewords include the second codeword.
4. The apparatus according to claim 3, wherein at least one of the following conditions exists: The repetition includes repeating the decoded bits of the first codeword. N Second-rate; The size of a codeword in the second codeword is the same as the size of a codeword in the first codeword. N times; or The reduced nominal bit rate is (1 / N) of the first nominal bit rate.
5. The apparatus according to claim 4, wherein the number of shortened bits in each codeword of the second codeword is N Multiples of.
6. The apparatus of claim 3, wherein generating the first codeword comprises: The data bits are encoded based on the first nominal code rate to obtain the first decoded bits; as well as The first decoded bit is encoded based on the second nominal code rate to obtain the first codeword.
7. The apparatus of claim 3, wherein generating the first codeword comprises: The system bits are formed by appending padding bits to the data bits, the system bits are encoded to generate parity bits, and the parity bits are appended to the data bits to generate the first codeword.
8. The apparatus of claim 1, wherein the encoding comprises: Generate the first codeword; Repeat the decoded bits associated with the first codeword to generate the second codeword; as well as A mask sequence is applied to the repeated decoded bits within each of the second codewords to generate the one or more codewords.
9. The apparatus of claim 8, wherein the mask sequence is based on a scrambling sequence.
10. The apparatus of claim 9, wherein the initial value of the scrambling sequence is a fixed value or different values.
11. The apparatus according to claim 1, wherein: The encoding includes: Generate the first codeword including the decoded bits; and The decoded bits of the first codeword are repeated to generate the second codeword; and The method further includes: Perform constellation mapping on the repeated decoded bits to generate orthogonal frequency division multiplexing (OFDM) symbols; and When the one or more codewords are output, a mask sequence is applied to the data frequency modulation of the OFDM symbol.
12. The apparatus of claim 11, wherein the mask sequence is based on a value sequence including +1 and -1 values.
13. The apparatus of claim 12, wherein the mask sequence is based on a known sequence of +1 and -1 values.
14. The apparatus of claim 13, wherein the mask sequence is based on a known sequence used in a long training field (LTF).
15. The apparatus of claim 1, wherein the encoding comprises: The data bit set is encoded based on the first nominal code rate to generate a first codeword; as well as The first codeword is further encoded based on at least a second nominal code rate to generate a second codeword having the reduced nominal code rate, the reduced nominal code rate being a function of at least the first code rate and the second code rate, wherein the one or more codewords include the second codeword.
16. The apparatus of claim 15, wherein the one or more processors are further configured to cause the apparatus to: Before the encoding, a system bit set is formed by appending a set of padding bits to the set of data bits, the system bits are encoded based on the first nominal code rate to generate the first codeword, and the first codeword is further encoded based on the second nominal code rate to generate the second codeword.
17. The apparatus of claim 15, wherein the further encoding comprises performing at least one of punching a fixed number of parity bits or repeating a fixed number of data bits.
18. The apparatus of claim 1, wherein the one or more processors are further configured to cause the apparatus to: System bits are formed by appending padding bits to the data bits, wherein the encoding includes encoding the system bits to generate a first codeword of a first size having parity bits, and generating a second codeword of a second size using the data bits and the parity bits, wherein one or more codewords include the second codeword.
19. The apparatus of claim 18, wherein the length of the data bits in one of the codewords of the second codeword is a function of the reduced nominal code rate and the nominal codeword size of the first codeword.
20. The apparatus of claim 19, wherein the length of the padding bit is a function of the length of the data bits in one of the codewords of the second codeword and the nominal codeword size of the first codeword.
21. The apparatus of claim 19, wherein the size of the one or more second codewords is a function of the length of the data bits in each of the second codewords and the nominal codeword size of the first codeword.
22. The apparatus of claim 1, wherein the one or more processors are further configured to cause the apparatus to perform at least one of the following: Adjust the nominal codeword size based on the nominal codeword size of the second codeword; or The number of decoded bits, the number of shortened bits, or the number of data bits are adjusted based on the reduced nominal code rate.
23. The apparatus of claim 1, further comprising at least one transceiver configured to transmit the one or more codewords, wherein the apparatus is configured as a wireless station.
24. An apparatus for wireless communication, the apparatus comprising: At least one memory, the at least one memory including computer-executable instructions; as well as One or more processors, the one or more processors being configured to execute the computer-executable instructions and cause the device to: Obtain one or more codewords associated with the reduced nominal code rate; as well as The one or more codewords are decoded based on at least a first nominal code rate to recover a set of data bits, wherein the first nominal code rate is higher than the reduced nominal code rate.
25. The apparatus of claim 24, wherein the decoding involves at least one of the following: Low-density parity-check (LDPC) decoding; or Binary convolutional code (BCC) decoding.
26. The apparatus of claim 24, wherein the decoding comprises: Decode the one or more codewords; as well as The decoded bits are combined after the decoding.
27. The apparatus of claim 26, wherein the decoding comprises: Decode the one or more codewords based on the first nominal code rate to obtain the first codeword; as well as The first codeword is decoded based on the second nominal code rate.
28. The apparatus of claim 26, wherein the decoding comprises: Decoding the one or more codewords yields a system bit set, the system bit set including a padding bit set appended to the data bit set.
29. The apparatus of claim 24, further comprising at least one transceiver configured to receive the one or more codewords, wherein the apparatus is configured as a wireless station.
30. A method for conducting wireless communication at a wireless node, the method comprising: Obtain the set of data bits; The data bits are encoded based on at least a first nominal code rate to generate one or more codewords associated with a reduced nominal code rate, the reduced nominal code rate being lower than the first nominal code rate; and Output the one or more codewords.
