Probabilistic shaping based on block codes

Abstract

Methods, systems, and devices for wireless communications are described. A transmitting device may support bit shaping in a block coding scheme and a probabilistic shaping framework to generate shaped bits including both information bits and shaping bits without conveying extra information (e.g., in addition to the shaped bits) to a receiving device. The transmitter may use a decoder, such as a polar decoder (e.g., a modem configured for both coding and decoding), to determine a set of shaping bits based on the information bits. The transmitting device may also map the information bits to frozen bit positions of a polar code and the shaping bits to polar information bit positions such that the coded (e.g., shaped) bits from the polar encoder satisfy a target probability distribution.

Description

[Technical Field]

[0001] Introduction The following relates to wireless communications, including stochastic shaping with various coding schemes.

[0002] Wireless communication systems are widely deployed to provide various types of communication content such as voice, video, packet data, messaging, broadcasts, and so on. These systems may be capable of supporting communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple-access systems include fourth-generation (4G) systems, such as Long Term Evolution (LTE), LTE-Advanced (LTE-A), or LTE-A Pro systems, and fifth-generation (5G) systems, sometimes referred to as New Radio (NR) systems. These systems may employ techniques such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-S-OFDM), etc. A wireless multiple-access communication system may include one or more base stations that each support wireless communication for communication devices, sometimes known as user equipment (UE). Summary of the Invention [Means for solving the problem]

[0003] The described techniques relate to improved methods, systems, devices, and apparatus that support stochastic shaping based on block codes.

[0004] A method for wireless communication in a first device is described. The method may include generating, based on a set of information bits, a plurality of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme, encoding the set of information bits and the set of shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution, and outputting a message based on the set of shaped bits.

[0005] An apparatus for wireless communication in a first device is described. The apparatus may include a processor, a memory coupled to the processor, and instructions stored in the memory. The instructions may be executable by the processor to cause the apparatus to generate, based on a set of information bits, a plurality of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme, encode the set of information bits and the set of shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution, and output a message based on the set of shaped bits.

[0006] Another apparatus for wireless communication in a first device is described. The apparatus may include means for generating, based on a set of information bits, a plurality of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme, means for encoding the set of information bits and the set of shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution, and means for outputting a message based on the set of shaped bits.

[0007] A non-transitory computer-readable medium storing code for wireless communication in a first device is described, wherein the code may include instructions executable by a processor to: generate, based on a set of information bits, a plurality of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme; encode the set of information bits and the set of shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution; and output a message based on the set of shaped bits.

[0008] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining a block coding scheme associated with a target probability distribution for transmitting a message.

[0009] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, control signaling scheduling transmission of the message and indicating the block coding scheme may be communicated with the second device, and determining the block coding scheme may be based on communicating the control signaling.

[0010] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include acts, features, means, or instructions for communicating control signaling indicating a target probability distribution for a message.

[0011] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for communicating control signaling indicating that messages may have been generated using channel coding and block coding schemes.

[0012] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that the block coding scheme may be one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0013] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, communicating and determining control signaling indicative of the block coding scheme is based on the control signaling.

[0014] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining a mapping of a set of information bits to a set of frozen bit positions and a mapping of a set of shaping bits to a set of information bit positions, and the message may be based on the mapping.

[0015] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, communicating control signaling indicative of the mapping and determining is based on communicating the control signaling.

[0016] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for calculating a set of log likelihood ratio (LLR) values ​​based on a target probability distribution, and decoding the set of LLR values ​​according to a decoding operation associated with a block coding scheme to generate a set of multiple shaping bits.

[0017] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, a set of information bits is mapped to a set of frozen bit positions of a block coding scheme, and the set of shaping bits may be based on a set of decoded LLR values.

[0018] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for mapping a second set of the plurality of information bits and the at least one candidate shaped bit to modulation symbols, determining a conditional distribution based on a target probability distribution, and determining an LLR value for the at least one candidate shaped bit based on the second set of the plurality of information bits and the conditional distribution associated with the modulation symbols, where calculating the set of LLR values ​​may be based on determining the LLR value for the at least one candidate shaped bit.

[0019] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the second set of information bits may be distributed independently from the distribution of the set of shaped bits according to the encoding.

[0020] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for shaping the second set of the plurality of information bits according to the encoding.

[0021] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for: shaping the set of shaped bits using a joint decoder for the block coding scheme and the channel coding scheme; and applying a channel coding scheme to the set of shaped bits, including the set of information bits and the set of shaping bits, to generate a set of parity bits using a joint decoder for the block coding scheme and the channel coding scheme, the joint decoder being based on a target probability distribution associated with the block coding scheme and a second target probability distribution associated with the channel coding scheme.

[0022] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for calculating a first set of LLR values ​​for a block coding scheme based on a target probability distribution, and calculating a second set of LLR values ​​for a channel coding scheme for a decoder associated with the channel coding scheme, the second set of LLR values ​​being based on a second target probability distribution corresponding to a set of multiple parity bits, and shaping the set of multiple shaped bits may be based on the first set of LLR values ​​and the second set of LLR values.

[0023] A method for wireless communication is described that may include obtaining, by a second device, a message from a first device and decoding the message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0024] An apparatus for wireless communication is described. The apparatus may include a processor, a memory coupled to the processor, and instructions stored in the memory. The instructions may be executable by the processor to cause the apparatus to obtain, by a second device, a message from a first device and decode the message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0025] Another apparatus for wireless communication is described that may include means for obtaining, by a second device, a message from a first device and means for decoding the message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0026] A non-transitory computer-readable medium storing code for wireless communications is described, wherein the code may include instructions executable by a processor to: obtain, by a second device, a message from a first device; and decode the message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0027] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining a block coding scheme associated with a target probability distribution for receiving a message.

[0028] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, control signaling scheduling transmission of the message and indicating the block coding scheme may be communicated with the first device, and determining the block coding scheme may be based on communicating the control signaling.

[0029] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include acts, features, means, or instructions for communicating control signaling indicating a target probability distribution for a message.

[0030] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for communicating control signaling indicating that messages may have been generated using channel coding and block coding schemes.

[0031] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that the block coding scheme may be one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0032] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, communicating and determining control signaling indicative of the block coding scheme is based on the control signaling.

[0033] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining a mapping of a set of information bits to a set of frozen bit positions and a mapping of a set of shaping bits to a set of information bits, and decoding the message may be based on the mapping.

[0034] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, communicating and determining control signaling indicative of the block coding scheme is based on the control signaling.

[0035] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the second set of information bits may be distributed independently from the distribution of the set of shaped bits according to a block coding scheme.

[0036] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein jointly decode a set of shaped bits including a set of information bits and a second set of information bits according to a forward error correction decoder associated with a channel coding scheme and a block coding scheme, wherein the set of shaped bits includes a plurality of parity bits associated with the channel coding scheme. [Brief explanation of the drawings]

[0037] [Figure 1] 1 illustrates an example of a wireless communication system that supports block code-based stochastic shaping, in accordance with one or more aspects of the present disclosure. [Figure 2] 1 illustrates an example of a wireless communication system that supports block code-based stochastic shaping, in accordance with one or more aspects of the present disclosure. [Figure 3] 1 illustrates an example of a signaling diagram supporting block code-based probabilistic shaping, in accordance with one or more aspects of the present disclosure. [Figure 4] 1 illustrates an example of a signaling diagram supporting block code-based probabilistic shaping, in accordance with one or more aspects of the present disclosure. [Figure 5] 1 illustrates an example of a shaping scheme that supports probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 6]1 illustrates an example of a bit generation scheme that supports stochastic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 7] 1 illustrates an example of a shaping scheme that supports probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 8] 1 illustrates an example of an encoding scheme that supports stochastic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 9A] 1 illustrates an example of a shaping scheme that supports probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 9B] 1 illustrates an example of a shaping scheme that supports probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 10] 1 illustrates an example process flow for supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 11] 1 illustrates a block diagram of a device that supports block code-based probabilistic shaping, in accordance with one or more aspects of the present disclosure. [Figure 12] 1 illustrates a block diagram of a device that supports block code-based probabilistic shaping, in accordance with one or more aspects of the present disclosure. [Figure 13] 1 illustrates a block diagram of a communications manager supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 14] 1 illustrates a diagram of a system including a device that supports block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. [Figure 15] 1 illustrates a flow diagram showing a method for supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 16] 1 illustrates a flow diagram showing a method for supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 17]1 illustrates a flow diagram showing a method for supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 18] 1 illustrates a flow diagram showing a method for supporting probabilistic shaping based on block codes, in accordance with one or more aspects of the present disclosure. [Figure 19] 1 illustrates an example of a network architecture that supports block code-based probabilistic shaping, in accordance with one or more aspects of the present disclosure. DETAILED DESCRIPTION OF THE INVENTION

[0038] In some wireless communication systems, higher-order modulation such as quadrature amplitude modulation (QAM) (e.g., 16QAM, 64QAM, 256QAM, etc.) may be used to increase spectral efficiency at improved signal-to-noise ratio (SNR) values. The constellation generated by the modulation may be fixed (e.g., information bits are modulated such that a carrier signal is modulated to a set of desired phase, frequency, and amplitude states, which may be referred to as a constellation), and each constellation point of the constellation may be used with equal probability. In some other examples, stochastic shaping may generate coded modulation symbols that are unevenly distributed. Stochastic shaping may refer to generating a constellation such that some signal combinations are sent more frequently and other signal combinations are sent less frequently to optimize signal quality at a destination or to maintain signal quality under varying transmit energy. Stochastic shaping may transform an information payload (e.g., uniform bits) into unevenly distributed bits (e.g., shaped bits) according to a given target probability distribution. Stochastic shaping is based on a source code and a source compression algorithm (e.g., arithmetic coding, Huffman code) to shape information bits into a given probability distribution, followed by a high-rate systematic code to encode the shaped information bits. Stochastic shaping may improve the spectral efficiency of the coded modulation symbols (because, for example, the non-uniformly distributed constellations produced by stochastic shaping may achieve greater mutual information than uniformly distributed constellations without increasing the signal-to-noise ratio (SNR)).

[0039] In some probabilistic shaping schemes, shaping bits may be used to shape the information bits by applying masking or scrambling to the coded information bits. The set of shaping bits may be a sequence of bits that may depend on the coded information bits, such that the combination of the set of shaping bits and the coded information bits may not be uniformly distributed (e.g., may achieve a shaped target distribution). The transmitting device may perform masking or scrambling of the coded information bits with the shaping bits (e.g., via a bitwise XOR operation), resulting in uneven shaping. In some examples, the transmitting device may transmit the shaping bits (e.g., unshaped but applied to achieve overall shaping of the transmission) over the same channel as the shaped information bits (e.g., data bits). For example, the shaping bits are used to achieve shaping but are not themselves shaped, resulting in additional bits being transmitted along with the shaped information bits. Transmitting both shaped information bits and unshaped shaping bits (e.g., shaping bits applied to information bits to generate a shaped non-uniform distribution) may result in increased signaling overhead, increased system latency, and increased delay on the decoding side.

[0040] The techniques described herein support using a block coding scheme (e.g., polar coding) and a probabilistic shaping framework to generate shaped bits that include both information bits (e.g., data) and shaping bits (e.g., a set of bits that are scrambled with or mask the information bits) without the need to communicate extra information (e.g., in addition to the shaped bits) to a receiving device. The transmitter may use a decoder, such as a polar decoder (e.g., a modem configured for both coding and decoding), to determine the set of shaping bits based on the information bits. Both the shaping bits and the information bits are shaped, eliminating the need to communicate extra information regarding the shaping bits to the receiver. The techniques may also include mapping the information bits to frozen bit positions of a polar code (e.g., positions in the polar code associated with all-zero bits) and mapping the shaping bits to information bit positions of the polar code (e.g., positions in the polar code associated with the information bits) such that the coded (e.g., shaped) bits from the polar encoder satisfy a target probability distribution. In some examples, the transmitting device may use a block coding scheme (e.g., a polar code) and a channel coding scheme (e.g., using a forward error correction scheme) to generate a set of parity bits such that the transmitting device transmits a complete set of shaped bits including information bits, shaping bits, and parity bits.

[0041] A set of log-likelihood ratio (LLR) values ​​(e.g., a set of values ​​indicating how well a model fits a dataset, where higher LLR values ​​indicate a better fit of the model to the dataset than lower values) may be calculated based on a target distribution of the probabilistic shaping framework and other non-information bits (e.g., to be mapped to the same modulation symbol). A polar decoder may decode the LLR values, where the frozen bits are filled with information bits. The decoder determines a set of shaping bits from the LLR values, where the shaping bits correspond to the information bits associated with the decoder. The transmitting device may map shaped bit candidates (e.g., particular bits from the set of bits mapped to the same modulation symbol) to the modulation symbol. In some examples, the shaped bits may be based on a target probability distribution and may all be mapped to the same bit position of the modulation symbol. The transmitting device may map multiple bits according to an independent distribution (e.g., the LLR of each bit v is determined independently of other data bits mapped to the same modulation symbol), sometimes referred to as unconditional shaping, or according to a conditional distribution (e.g., the LLR of each bit v is determined from other data bits mapped to the same modulation symbol). Shaping techniques based on block coding schemes may result in increased throughput, reduced system latency, improved wireless signaling reliability, and reduced signaling overhead because the described shaping techniques enable the improved power efficiency and signaling reliability of non-uniform distribution and stochastic shaping without the extra signaling overhead of transmitting unshaped shaping bits along with the shaped information bits (e.g., as implemented by other stochastic shaping techniques). Thus, the techniques described herein result in improved throughput (e.g., because additional unshaped bits are not transmitted along with the shaped information bits), improved system efficiency, reduced system latency, and an improved user experience, along with reduced power consumption.

[0042] Aspects of the present disclosure are first described in the context of a wireless communication system. Aspects of the present disclosure are further illustrated by and described with reference to wireless communication systems, signaling diagrams, shaping schemes, bit generation schemes, encoding schemes, and process flows. Aspects of the present disclosure are further illustrated by and described with reference to apparatus diagrams, system diagrams, and flowcharts relating to stochastic shaping based on block codes.

[0043] 1 illustrates an example of a wireless communication system 100 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The wireless communication system 100 may include one or more network entities 105, one or more UEs 115, and a core network 130. In some examples, the wireless communication system 100 may be a network operating in accordance with a Long Term Evolution (LTE) network, an LTE-Advanced (LTE-A) network, an LTE-A Pro network, a New Radio (NR) network, or other systems and radio technologies, including future systems and radio technologies not explicitly mentioned herein.

[0044] The network entities 105 may be dispersed throughout a geographic area to form the wireless communication system 100 and may include devices of different types or with different capabilities. In various examples, the network entities 105 may be referred to as network elements, mobility elements, radio access network (RAN) nodes, or network equipment, among other nomenclature. In some examples, the network entities 105 and the UEs 115 may communicate wirelessly via one or more communication links 125 (e.g., radio frequency (RF) access links). For example, each network entity 105 may support a coverage area 110 (e.g., a geographic coverage area) over which the UEs 115 and the network entities 105 may establish one or more communication links 125. The coverage area 110 may be an example of a geographic area over which the network entities 105 and the user equipment (UE) 115 may support communication of signals via one or more radio access technologies (RATs).

[0045] The UEs 115 may be dispersed throughout the coverage area 110 of the wireless communication system 100, and each UE 115 may be stationary or mobile or both at different times. The UEs 115 may be devices of different types or with different capabilities. Some example UEs 115 are illustrated in FIG. 1. The UEs 115 described herein may be able to support communication with various types of devices, such as other UEs 115 or network entities 105, as shown in FIG. 1.

[0046] As described herein, a node of the wireless communication system 100, which may be referred to as a network node or a wireless node, may be a network entity 105 (e.g., any network entity described herein), a UE 115 (e.g., any UE described herein), a network controller, an apparatus, a device, a computing system, one or more components, or another suitable processing entity configured to perform any of the techniques described herein. For example, a node may be a UE 115. As another example, a node may be a network entity 105. As another example, a first node may be configured to communicate with a second node or a third node. In one aspect of this example, the first node may be the UE 115, the second node may be the network entity 105, and the third node may be the UE 115. In another aspect of this example, the first node may be the UE 115, the second node may be the network entity 105, and the third node may be the network entity 105. In yet other aspects of this example, the first node, the second node, and the third node may be different for these examples. Similarly, reference to a UE 115, a network entity 105, an apparatus, a device, a computing system, etc. may include disclosure of the UE 115, the network entity 105, the apparatus, the device, the computing system, etc. being a node. For example, disclosure that a UE 115 is configured to receive information from a network entity 105 also discloses that a first node is configured to receive information from a second node.

[0047] In some examples, the network entities 105 may communicate with the core network 130, with each other, or with both. For example, the network entities 105 may communicate with the core network 130 via one or more backhaul communication links 120 (e.g., according to an S1, N2, N3, or other interface protocol). In some examples, the network entities 105 may communicate with each other either directly (e.g., directly between the network entities 105), or indirectly (e.g., via the core network 130) via the backhaul communication links 120 (e.g., according to an X2, Xn, or other interface protocol). In some examples, the network entities 105 may communicate with each other via midhaul communication links 162 (e.g., according to a midhaul interface protocol) or fronthaul communication links 168 (e.g., according to a fronthaul interface protocol), or any combination thereof. The backhaul communication link 120, the midhaul communication link 162, or the fronthaul communication link 168 may be or include, among other examples or various combinations thereof, one or more wired links (e.g., electrical links, optical fiber links), one or more wireless links (e.g., radio links, wireless optical links). The UE 115 may communicate with the core network 130 via the communication link 155.

[0048] One or more of the network entities 105 described herein may include or may be referred to as a base station 140 (e.g., base transceiver station, radio base station, NR base station, access point, radio transceiver, Node B, eNodeB (eNodeB, eNB), next generation Node B or gigaNode B (any of which may be referred to as gNB), 5G NB, next-generation eNB (ng-eNB), Home Node B, Home eNodeB, or other suitable terminology). In some examples, the network entities 105 (e.g., base stations 140) may be implemented in a converged (e.g., monolithic, standalone) base station architecture that may be configured to utilize protocol stacks that are physically or logically integrated within a single network entity 105 (e.g., a single RAN node such as the base station 140). In some examples, one or more network entities 105 may communicate with other wireless devices via one or more repeaters 145 (e.g., intelligent reflective surfaces, IAB nodes, etc., among other examples).

[0049] In the wireless communication system 100, the UE 115 and the network entity 105 (e.g., an eNodeB (eNB), a Next Generation NodeB or GigaNodeB, either of which may be referred to as a gNB, or some other base station) may support wireless communication via one or more radio access technologies. Examples of radio access technologies include 4G systems, such as LTE systems, and 5G systems, which may be referred to as NR systems. The wireless communication system 100 may be configured to support techniques for stochastic shaping based on block codes, as described herein. For example, one or more devices may include a UE communications manager 101, a network entity communications manager 102, or any combination thereof, which may be examples of a communications manager as described herein. The UE 115 and the network entity 105 may perform a bit shaping and encoding procedure or a de-shaping and decoding procedure via the communications manager. For example, a transmitting device may transmit a message (e.g., UE 115 may transmit via communications manager 101, or network entity 105 may transmit via communications manager 102) shaped using a block coding scheme such that the shaped bits of the message include shaping bits and information bits. The communications manager may be further operable to implement the techniques described herein.

[0050] In some examples, the network entities 105 may be implemented in a disaggregated architecture (e.g., a disaggregated base station architecture, a disaggregated RAN architecture) that may be configured to utilize a protocol stack that is physically or logically distributed between two or more network entities 105, such as an integrated access backhaul (IAB) network, an open RAN (O-RAN) (e.g., a network configuration sponsored by the O-RAN Alliance), or a virtualized RAN (vRAN) (e.g., cloud RAN (C-RAN)). For example, the network entity 105 may include one or more of a central unit (CU) 160, a distributed unit (DU) 165, a radio unit (RU) 170, a RAN Intelligent Controller (RIC) 175 (e.g., a Near-Real Time RIC (Near-RT RIC), a Non-Real Time RIC (Non-RT RIC)), a Service Management and Orchestration (SMO) 180 system, or any combination thereof. The RU 170 may also be referred to as a radio head, a smart radio head, a remote radio head (RRH), a remote radio unit (RRU), or a transmission reception point (TRP). One or more components of the network entity 105 in a disaggregated RAN architecture may be co-located, or one or more components of the network entity 105 may be located in distributed locations (e.g., separate physical locations).In some examples, one or more network entities 105 of the disaggregated RAN architecture may be implemented as virtual units (e.g., virtual CU (VCU), virtual DU (VDU), virtual RU (VRU)).

[0051] The division of functionality among the CU 160, the DU 165, and the RU 170 is flexible and may support different functions depending on which functions (e.g., network layer functions, protocol layer functions, baseband functions, RF functions, and any combination thereof) are implemented in the CU 160, the DU 165, or the RU 170. For example, a functional division of a protocol stack may be adopted between the CU 160 and the DU 165 such that the CU 160 can support one or more layers of the protocol stack and the DU 165 can support one or more different layers of the protocol stack. In some examples, the CU 160 may host upper protocol layer (e.g., layer 3 (L3), layer 2 (L2)) functions and signaling (e.g., Radio Resource Control (RRC), service data adaptation protocol (SDAP), Packet Data Convergence Protocol (PDCP)). The CU 160 may be connected to one or more DUs 165 or RUs 170, which may host lower protocol layers such as Layer 1 (L1) (e.g., physical (PHY) layer) or L2 (e.g., radio link control (RLC) layer, medium access control (MAC) layer) functions and signaling, each of which may be at least partially controlled by the CU 160. Additionally or alternatively, a functional division of the protocol stack may be employed between the DU 165 and the RU 170, such that the DU 165 can support one or more layers of the protocol stack, and the RU 170 can support one or more different layers of the protocol stack. The DU 165 may support one or more different cells (e.g., via one or more RUs 170).In some cases, the functional division between the CU 160 and the DU 165 or between the DU 165 and the RU 170 may be within a protocol layer (e.g., some functions for a protocol layer may be performed by one of the CU 160, the DU 165, or the RU 170, while other functions for the protocol layer are performed by a different one of the CU 160, the DU 165, or the RU 170). The CU 160 may be further functionally divided into a CU control plane (CU-CP) function and a CU user plane (CU-UP) function. The CU 160 may be connected to one or more DUs 165 via midhaul communication links 162 (e.g., F1, F1-c, F1-u), and the DU 165 may be connected to one or more RUs 170 via fronthaul communication links 168 (e.g., an open fronthaul (FH) interface). In some examples, the midhaul communication link 162 or the fronthaul communication link 168 may be implemented according to an interface (e.g., a channel) between layers of a protocol stack supported by the respective network entities 105 communicating over such communication link.

[0052] In addition to or as an alternative to being performed between the UE 115 and the network entity 105, the techniques described herein may be implemented via additional or alternative wireless devices, including the IAB node 104, distributed units (DUs) 165, central units (CUs) 160, radio units (RUs) 170, etc. For example, in some implementations, aspects described herein may be implemented in the context of a disaggregated radio access network (RAN) architecture (e.g., an open RAN architecture). In a disaggregated architecture, the RAN may be divided into three areas of functionality corresponding to the CU 160, the DU 165, and the RU 170. The division of functionality among the CU 160, the DU 165, and the RU 175 is flexible, thus resulting in numerous permutations of different functions depending on which functions (e.g., MAC functions, baseband functions, radio frequency functions, and any combination thereof) are performed in the CU 160, the DU 165, and the RU 175. For example, functional division of the protocol stack may be adopted between DU165 and RU170 such that DU165 may support one or more layers of the protocol stack and RU170 may support one or more different layers of the protocol stack.

[0053] In some wireless communication systems (e.g., wireless communication system 100), infrastructure and spectrum resources for NR access may supplement wired backhaul connections to additionally support wireless backhaul link capabilities, providing an IAB network architecture. One or more network entities 105 may include a CU 160, a DU 165, and an RU 170 and may be referred to as a donor network entity 105 or an IAB donor. One or more DUs 165 (e.g., and / or RUs 170) associated with the donor network entity 105 may be controlled in part by the CU 160 associated with the donor network entity 105. One or more donor network entities 105 (e.g., IAB donors) may communicate with one or more additional network entities 105 (e.g., IAB nodes 104) via supported access and backhaul links. The IAB nodes 104 may support mobile terminal (MT) functions controlled and / or scheduled by the DUs 165 of the associated IAB donors. Additionally, the IAB node 104 may include a DU 165 that supports communication links with additional entities (e.g., IAB nodes 104, UEs 115, etc.) in the access network (e.g., downstream) relay chain or configuration. In such cases, one or more components of the disaggregated RAN architecture (e.g., one or more IAB nodes 104, or components of an IAB node 104) may be configured to operate in accordance with the techniques described herein.

[0054] In some examples, the wireless communication system 100 may include a core network 130 (e.g., a next generation core network (NGC)), one or more IAB donors, IAB nodes 104, and UEs 115, where the IAB nodes 104 may be controlled in part by each other and / or the IAB donor. The IAB donor and IAB nodes 104 may be examples of aspects of a network entity 105. The IAB donor and one or more IAB nodes 104 may be configured as (e.g., communicate according to) some relay chain.

[0055] For example, an access network (AN) or RAN may refer to communication between an access node (e.g., an IAB donor), an IAB node 104, and one or more UEs 115. The IAB donor may facilitate a connection between the core network 130 and an AN (e.g., via a wired or wireless connection to the core network 130). That is, the IAB donor may refer to a RAN node that has a wired or wireless connection to the core network 130. The IAB donor may include a CU 160 and at least one DU 165 (e.g., and RU 170), and the CU 160 may communicate with the core network 130 via an NG interface (e.g., some backhaul link). The CU 160 may host Layer 3 (L3) (e.g., RRC, service data adaptation protocol (SDAP), PDCP, etc.) functions and signaling. At least one DU 165 and / or RU 170 may host lower layers such as Layer 1 (L1) and Layer 2 (L2) (e.g., RLC, MAC, physical (PHY), etc.) functions and signaling, each of which may be at least partially controlled by the CU 160. The DU 165 may support one or more different cells. The IAB donor and IAB node 104 may communicate over an F1 interface according to some protocol (e.g., an F1 AP protocol) that defines signaling messages. Additionally, the CU 160 may communicate with the core network over an NG interface (which may be an example of a portion of a backhaul link) and with other CUs 160 (e.g., CUs 160 associated with alternative IAB donors) over an Xn-C interface (which may be an example of a portion of a backhaul link).

[0056] An IAB node 104 may refer to a RAN node that provides IAB functionality (e.g., access for a UE 115, wireless self-backhaul capabilities, etc.). An IAB node 104 may include a DU 165 and an MT. The DU 165 may act as a distributed scheduling node for a child node associated with the IAB node 104, and the MT may act as a scheduled node for a parent node associated with the IAB node 104. That is, an IAB donor may be referred to as a parent node that communicates with one or more child nodes (e.g., an IAB donor may relay a transmission for a UE through one or more other IAB nodes 104). Additionally, an IAB node 104 may be referred to as a parent node or a child node to other IAB nodes 104 depending on the relay chain or configuration of the AN. Thus, the MT entity of the IAB node 104 (e.g., MT) may provide a Uu interface for a child node to receive signaling from a parent IAB node 104, and the DU interface (e.g., DU 165) may provide a Uu interface for a parent node to signal to a child IAB node 104 or UE 115.

[0057] For example, the IAB node 104 may be referred to as a parent node associated with the IAB node and a child node associated with the IAB donor. The IAB donor may include a CU 160 having a wired (e.g., optical fiber) or wireless connection to the core network and may act as a parent node to the IAB node 104. For example, the DU 165 of the IAB donor may relay a transmission to the UE 115 via the IAB node 104 or may directly signal a transmission to the UE 115. The CU 160 of the IAB donor may signal communication link establishment to the IAB node 104 via the F1 interface, and the IAB node 104 may schedule a transmission (e.g., a transmission to the UE 115 relayed from the IAB donor) via the DU 165. That is, data may be relayed to and from the IAB node 104 via signaling over the NR Uu interface to the MT of the IAB node 104. Communications with the IAB node 104 may be scheduled by the DU 165 of the IAB donor, and communications with the IAB node 104 may be scheduled by the DU 165 of the IAB node 104.

[0058] For the techniques described herein applied in the context of a disaggregated RAN architecture, one or more components of the disaggregated RAN architecture (e.g., one or more IAB nodes 104 or components of an IAB node 104) may be configured to support the techniques for large round trip times in the random access channel procedures described herein. For example, some operations described as being performed by the UE 115 or the network entity 105 may additionally or alternatively be performed by a component of the disaggregated RAN architecture (e.g., an IAB node, a DU, a CU, etc.).

[0059] As described herein, a node may be referred to as a node, a network node, a network entity 105, or a wireless node, and may be a base station (e.g., any base station described herein), a UE 115 (e.g., any UE described herein), a network controller, an apparatus, a device, a computing system, one or more components, and / or another suitable processing entity configured to perform any of the techniques described herein. For example, a network node may be a UE 115. As another example, a network node may be a base station. As another example, a first network node may be configured to communicate with a second network node or a third network node. In one aspect of this example, the first network node may be a UE 115, the second network node may be a base station, and the third network node may be a UE 115. In another aspect of this example, the first network node may be a UE 115, the second network node may be a base station, and the third network node may be a base station. In still other aspects of this example, the first network node, the second network node, and the third network node may differ relative to these examples. Similarly, references to a UE 115, a base station, an apparatus, a device, a computing system, etc. may include disclosure of the UE 115, the base station, the apparatus, the device, the computing system, etc. being network nodes. For example, a disclosure that a UE 115 is configured to receive information from a base station also discloses that a first network node is configured to receive information from a second network node. Consistent with this disclosure, when a specific example is expanded in accordance with this disclosure (e.g., also disclosing that a UE 115 is configured to receive information from a base station and that a first network node is configured to receive information from a second network node), the broader example of the narrower example may be interpreted in a converse, but broadly open-ended, manner.In the above example, which also discloses that the UE 115 is configured to receive information from a base station and the first network node is configured to receive information from a second network node, the first network node may refer to the first UE 115, first base station, first apparatus, first device, first computing system, first one or more components, first processing entity, etc. configured to receive the information, and the second network node may refer to the second UE 115, second base station, second apparatus, second device, second computing system, second one or more components, second processing entity, etc.

[0060] As described herein, communication of information (e.g., any information, signal, etc.) may be described in various manners using different terms. A disclosure of one communication term includes a disclosure of other communication terms. For example, a first network node may be described as configured to transmit information to a second network node. In this example, consistent with the present disclosure, a disclosure that a first network node is configured to transmit information to a second network node includes a disclosure that the first network node is configured to provide, send, output, communicate, or transmit information to the second network node. Similarly, in this example, consistent with the present disclosure, a disclosure that a first network node is configured to transmit information to a second network node includes a disclosure that the second network node is configured to receive, acquire, or decode information provided, sent, output, communicated, or transmitted by the first network node.

[0061] In a wireless communication system (e.g., wireless communication system 100), infrastructure and spectrum resources for radio access can supplement wired backhaul connections to support wireless backhaul link capabilities and provide an IAB network architecture (e.g., to the core network 130). In some cases, in an IAB network, one or more network entities 105 (e.g., IAB nodes 104) may be partially controlled by each other. One or more IAB nodes 104 may be referred to as donor entities or IAB donors. One or more DUs 165 or one or more RUs 170 may be partially controlled by one or more CUs 160 associated with the donor network entity 105 (e.g., donor base station 140). One or more donor network entities 105 (e.g., IAB donors) may be in communication with one or more additional network entities 105 (e.g., IAB nodes 104) via supported access links and backhaul links (e.g., backhaul communication links 120). An IAB node 104 may include an IAB mobile terminal (IAB-MT) controlled (e.g., scheduled) by the DU 165 of the associated IAB donor. The IAB-MT may include an independent set of antennas for relaying communications with the UE 115, or may share the same antenna (e.g., of the RU 170) of the IAB node 104 used for access via the DU 165 of the IAB node 104 (e.g., referred to as a virtual IAB-MT (vIAB-MT)). In some examples, the IAB node 104 may include a DU 165 that supports communication links with additional entities (e.g., the IAB node 104, the UE 115) in an access network (e.g., downstream) relay chain or configuration. In such cases, one or more components of the disaggregated RAN architecture (e.g., one or more IAB nodes 104, or components of the IAB node 104) may be configured to operate in accordance with the techniques described herein.

[0062] For example, an access network (AN) or RAN may include communication between an access node (e.g., an IAB donor), an IAB node 104, and one or more UEs 115. The IAB donor may facilitate connectivity between the core network 130 and the AN (e.g., via a wired or wireless connection to the core network 130). That is, an IAB donor may refer to a RAN node that has a wired or wireless connection to the core network 130. The IAB donor may include a CU 160 and at least one DU 165 (e.g., and / or an RU 170), where the CU 160 may communicate with the core network 130 over an interface (e.g., a backhaul link). The IAB donor and IAB node 104 may communicate over an F1 interface according to a protocol (e.g., an F1 AP protocol) that defines signaling messages. Additionally or alternatively, CU160 may communicate with the core network via an interface, which may be an example of a portion of a backhaul link, and may communicate with other CU160 (e.g., CU160 associated with an alternative IAB donor) via an Xn-C interface, which may be an example of a portion of a backhaul link.

[0063] An IAB node 104 may refer to a RAN node that provides IAB functionality (e.g., access to the UE 115, wireless self-backhaul capabilities). The DU 165 may function as a distributed scheduling node for a child node associated with the IAB node 104, and the IAB-MT may function as a scheduled node for a parent node associated with the IAB node 104. That is, an IAB donor may be referred to as a parent node that communicates with one or more child nodes (e.g., an IAB donor may relay a transmission for a UE through one or more other IAB nodes 104). Additionally or alternatively, an IAB node 104 may also be referred to as a parent node or a child node for other IAB nodes 104, depending on the relay chain or configuration of the AN. Thus, the IAB-MT entity of the IAB node 104 can provide a Uu interface for the child IAB node 104 to receive signaling from the parent IAB node 104, and the DU interface (e.g., DU 165) can provide a Uu interface for the parent IAB node 104 to signal to the child IAB node 104 or UE 115.

[0064] For example, the IAB node 104 may be referred to as a parent node supporting communication for a child IAB node, or as a child IAB node associated with an IAB donor, or both. The IAB donor may include a CU 160 having a wired or wireless connection (e.g., backhaul communication link 120) to the core network 130 and may function as a parent node to the IAB node 104. For example, the DU 165 of the IAB donor may relay transmissions to the UE 115 via the IAB node 104, or may directly signal transmissions to the UE 115, or both. The CU 160 of the IAB donor may signal communication link establishment to the IAB node 104 via the F1 interface, and the IAB node 104 may schedule transmissions (e.g., transmissions to the UE 115 relayed from the IAB donor) via the DU 165. That is, data may be relayed to and from the IAB node 104 via signaling over the NR Uu interface to the MT of the IAB node 104. Communications with the IAB node 104 may be scheduled by the DU 165 of the IAB donor, and communications with the IAB node 104 may be scheduled by the DU 165 of the IAB node 104.

[0065] For the techniques described herein applied in the context of a disaggregated RAN architecture, one or more components of the disaggregated RAN architecture may be configured to support the block code-based stochastic shaping described herein. For example, some operations described as being performed by the UE 115 or a network entity 105 (e.g., a base station 140) may additionally or alternatively be performed by one or more components of the disaggregated RAN architecture (e.g., an IAB node 104, a DU 165, a CU 160, an RU 170, a RIC 175, an SMO 180).

[0066] The UE 115 may include or be referred to as a mobile device, a wireless device, a remote device, a handheld device, or a subscriber device, or any other suitable terminology, and a "device" may also be referred to as a unit, a station, a terminal, or a client, among other examples. The UE 115 may also include or be referred to as a personal electronic device, such as a cellular phone, a personal digital assistant (PDA), a tablet computer, a laptop computer, or a personal computer. In some examples, the UE 115 may include or be referred to as a wireless local loop (WLL) station, an Internet of Things (IoT) device, an Internet of Everything (IoE) device, or a machine type communications (MTC) device, among other examples, and may be implemented in various items such as an appliance, a vehicle, a meter, etc., among other examples.

[0067] The UEs 115 described herein may be able to communicate with various types of devices, such as other UEs 115, which may sometimes act as relays, as shown in FIG. 1, as well as network entities 105 and network equipment, including macro eNBs or gNBs, small cell eNBs or gNBs, or relay base stations, among other examples.

[0068] The UE 115 and the network entity 105 may communicate wirelessly with each other over one or more communication links 125 (e.g., access links) using resources associated with one or more carriers. The term “carrier” may refer to a set of RF spectrum resources having a defined physical layer structure that supports the communication link 125. For example, a carrier used for the communication link 125 may include a portion (e.g., a bandwidth part (BWP)) of an RF spectrum band operated according to one or more physical layer channels for a given radio access technology (e.g., LTE, LTE-A, LTE-A Pro, NR). Each physical layer channel may carry acquisition signaling (e.g., synchronization signals, system information), control signaling coordinating operation for the carrier, user data, or other signaling. The wireless communication system 100 may support communication with the UE 115 using carrier aggregation or multi-carrier operation. The UE 115 may be configured with multiple downlink component carriers and one or more uplink component carriers according to a carrier aggregation configuration. Carrier aggregation may be used with both frequency division duplexing (FDD) and time division duplexing (TDD) component carriers. Communication between a network entity 105 and another device may refer to communication between the device and any portion (e.g., entity, sub-entity) of the network entity 105. For example, when referring to a network entity 105, the terms "transmit," "receive," or "communicate" may refer to any portion of the network entity 105 (e.g., base station 140, CU 160, DU 165, RU 170) of the RAN that communicates with another device (e.g., directly or via one or more other network entities 105).

[0069] In some examples, such as carrier aggregation configurations, carriers may also have acquisition or control signaling to coordinate operation with other carriers. Carriers may be associated with frequency channels (e.g., Evolved Universal mobile Telecommunication system terrestrial Radio Access (E-UTRA) Absolute RF Channel Numbers (EARFCNs)) and may be identified according to a channel raster for discovery by the UE 115. Carriers may be operated in a standalone mode, where initial acquisition and connection may be made by the UE 115 via the carrier, or the carrier may be operated in a non-standalone mode, where connection is anchored using a different carrier (e.g., of the same or different radio access technology).

[0070] The communication links 125 shown in the wireless communication system 100 may include, among other configurations of transmissions, downlink transmissions (e.g., forward link transmissions) from the network entity 105 to the UE 115, uplink transmissions (e.g., return link transmissions) from the UE 115 to the network entity 105, or both. A carrier may carry downlink or uplink communications (e.g., in FDD mode) or may be configured to carry downlink and uplink communications (e.g., in TDD mode).

[0071] A carrier may be associated with a particular bandwidth of the RF spectrum, and in some examples, the carrier bandwidth may be referred to as the carrier or the “system bandwidth” of the wireless communication system 100. For example, the carrier bandwidth may be one of a set of bandwidths for a carrier of a particular radio access technology (e.g., 1.4, 3, 5, 10, 15, 20, 40, or 80 megahertz (MHz)). Devices of the wireless communication system 100 (e.g., the network entity 105, the UE 115, or both) may have a hardware configuration that supports communication using a particular carrier bandwidth or may be configurable to support communication using one of the set of carrier bandwidths. In some examples, the wireless communication system 100 may include a network entity 105 or a UE 115 that supports simultaneous communication using carriers associated with multiple carrier bandwidths. In some examples, each served UE 115 may be configured to operate using a portion (e.g., a sub-band, BWP) or all of the carrier bandwidth.

[0072] A signal waveform transmitted over a carrier may be composed of multiple subcarriers (e.g., using a multi-carrier modulation (MCM) technique such as orthogonal frequency division multiplexing (OFDM) or discrete Fourier transform spread OFDM (DFT-S-OFDM)). In a system employing MCM techniques, a resource element may relate to one symbol period (e.g., the time length of one modulation symbol) and one subcarrier, although the symbol period and subcarrier spacing may be inversely proportional. The number of bits carried by each resource element may depend on the modulation scheme (e.g., the order of the modulation scheme, the coding rate of the modulation scheme, or both), such that a relatively large number of resource elements (e.g., during a transmission duration) and a relatively high order of the modulation scheme may correspond to a relatively high communication rate. Wireless communication resources may refer to a combination of RF spectrum resources, time resources, and spatial resources (e.g., spatial layers or beams), and the use of multiple spatial resources may increase data rates or data integrity for communications with UE 115.

[0073] One or more numerologies for a carrier may be supported, and a numerology may include a subcarrier spacing (Δf) and a cyclic prefix. A carrier may be divided into one or more BWPs having the same or different numerologies. In some examples, a UE 115 may be configured with multiple BWPs. In some examples, a single BWP for a carrier may be active at a given time, and communication for the UE 115 may be limited to one or more active BWPs.

[0074] The time interval for the network entity 105 or the UE 115 is, for example, T s =1 / (Δf max N f) seconds, where Δf max may represent the supported subcarrier spacing, and N f may represent the supported Discrete Fourier Transform (DFT) sizes. The communication resource time intervals may be organized according to radio frames, each having a specified time length (e.g., 10 milliseconds (ms)). Each radio frame may be identified by a System Frame Number (SFN) (e.g., ranging from 0 to 1023).

[0075] Each frame may include multiple consecutively numbered subframes or slots, but each subframe or slot may have the same time length. In some examples, a frame may be divided (e.g., in the time domain) into subframes, and each subframe may be further divided into a certain amount of slots. Alternatively, each frame may include a variable number of slots, and the number of slots may depend on the subcarrier spacing. Each slot may include a certain number of symbol periods (e.g., depending on the length of a cyclic prefix prepended to each symbol period). In some wireless communication systems 100, a slot may be further divided into multiple minislots associated with one or more symbols. Excluding the cyclic prefix, each symbol period may include one or more (e.g., N f The duration of a symbol period may depend on the subcarrier spacing or the operating frequency band.

[0076] A subframe, slot, minislot, or symbol may be the smallest scheduling unit (e.g., in the time domain) of the wireless communication system 100, sometimes referred to as a Transmission Time Interval (TTI). In some examples, the TTI duration (e.g., the number of symbol periods in a TTI) may be variable. Additionally or alternatively, the smallest scheduling unit of the wireless communication system 100 may be dynamically selected (e.g., in bursts of shortened TTIs (sTTIs)).

[0077] Physical channels may be multiplexed for communication using carriers according to various techniques. Physical control channels and physical data channels may be multiplexed for signaling over downlink carriers using, for example, one or more of a time division multiplexing (TDM) technique, a frequency division multiplexing (FDM) technique, or a hybrid TDM-FDM technique. A control region (e.g., a control resource set (CORESET)) for a physical control channel may be defined by a set of symbol periods and may span the system bandwidth of the carrier or a subset of the system bandwidth. One or more control regions (e.g., CORESETs) may be configured for a set of UEs 115. For example, one or more of the UEs 115 may monitor or search the control region for control information according to one or more search space sets, and each search space set may include one or more control channel candidates at one or more aggregation levels arranged in a cascaded manner. The aggregation level for a control channel candidate may refer to the amount of control channel resources (e.g., control channel elements (CCEs)) associated with coded information for a control information format having a given payload size. The search space sets may include a common search space set configured to send control information to multiple UEs 115 and a UE-specific search space set for sending control information to a specific UE 115.

[0078] The network entity 105 may provide communication coverage via one or more cells, e.g., macro cells, small cells, hot spots, or other types of cells, or any combination thereof. The term “cell” may refer to a logical communication entity used for communication with the network entity 105 (e.g., using a carrier) and may be associated with an identifier (e.g., a physical cell identifier (PCID), a virtual cell identifier (VCID), or other) for distinguishing neighboring cells. In some examples, a cell may also refer to a coverage area 110 or a portion (e.g., a sector) of a coverage area 110 in which the logical communication entity operates. Such a cell may range from a smaller area (e.g., a structure, a subset of a structure) to a larger area, depending on various factors such as the capabilities of the network entity 105. For example, a cell may be or include a building, a subset of a building, or an outside space between or overlapping with the coverage area 110, among other examples.

[0079] A macro cell generally covers a relatively large geographic area (e.g., several kilometers in radius) and may allow unrestricted access by UEs 115 that subscribe to service with the network provider that supports the macro cell. A small cell may be associated with a lower-power network entity 105 (e.g., a lower-power base station 140) compared to a macro cell, and the small cell may operate using the same or a different (e.g., licensed, unlicensed) frequency band as the macro cell. A small cell may provide unrestricted access to UEs 115 that subscribe to service with the network provider, or may provide restricted access to UEs 115 that have an association with the small cell (e.g., UEs 115 in a Closed Subscriber Group (CSG), UEs 115 associated with users in their homes or offices). The network entity 105 may support one or more cells and may also support communication via one or more cells using one or more component carriers.

[0080] In some examples, a carrier may support multiple cells, and different cells may be configured according to different protocol types (e.g., MTC, narrowband IoT (NB-IoT), enhanced mobile broadband (eMBB)) that may provide access to different types of devices.

[0081] In some examples, the network entities 105 (e.g., base stations 140, RUs 170) may be mobile and thus may provide communication coverage for moving coverage areas 110. In some examples, different coverage areas 110 associated with different technologies may overlap, but the different coverage areas 110 may be supported by the same network entity 105. In some other examples, overlapping coverage areas 110 associated with different technologies may be supported by different network entities 105. The wireless communication system 100 may include a heterogeneous network, for example, where different types of network entities 105 provide coverage to various coverage areas 110 using the same or different radio access technologies.

[0082] The wireless communications system 100 may support synchronous or asynchronous operation. For synchronous operation, the network entities 105 (e.g., base stations 140) may have similar frame timing, and transmissions from different network entities 105 may be approximately aligned in time. For asynchronous operation, the network entities 105 may have different frame timing, and transmissions from different network entities 105 may, in some instances, not be aligned in time. The techniques described herein may be used for either synchronous or asynchronous operation.

[0083] Some UEs 115, such as MTC or IoT devices, may be low-cost or low-complexity devices and may provide automated communication between machines (e.g., via machine-to-machine (M2M) communication). M2M communication or MTC may refer to data communication techniques that allow devices to communicate with each other or with a network entity 105 (e.g., a base station 140) without human intervention. In some examples, M2M communication or MTC may include communication from devices that incorporate sensors or meters to measure or capture information and relay that information to a central server or application program that uses such information or presents it to a human who interacts with the application program. Some UEs 115 may be designed to collect information or enable automated behavior of machines or other devices. Examples of applications for MTC devices include smart metering, inventory monitoring, water level monitoring, equipment monitoring, healthcare monitoring, wildlife monitoring, weather and geological event monitoring, fleet management and tracking, remote security sensing, physical access control, and transaction-based business billing.

[0084] Some UEs 115 may be configured to employ operating modes that reduce power consumption, such as half-duplex communication (e.g., a mode that supports one-way communication via transmission or reception, but not simultaneous transmission and reception). In some examples, half-duplex communication may be performed at a reduced peak rate. Other power conservation techniques for UEs 115 include entering a power-saving deep sleep mode when not engaged in active communication, operating using a limited bandwidth (e.g., pursuant to narrowband communication), or a combination of these techniques. For example, some UEs 115 may be configured for operation using a narrowband protocol type associated with a defined portion or range (e.g., a set of subcarriers or resource blocks (RBs)) within a carrier, within a guard band of a carrier, or outside a carrier.

[0085] The wireless communication system 100 may be configured to support ultra-reliable or low-latency communications, or various combinations thereof. For example, the wireless communication system 100 may be configured to support ultra-reliable low-latency communications (URLLC). The UE 115 may be designed to support ultra-reliable, low-latency, or critical functionality. Ultra-reliable communications may include private or group communications and may be supported by one or more services, such as push-to-talk, video, or data. Support for ultra-reliable, low-latency functionality may include service prioritization, and such services may be used for public safety or general commercial applications. The terms ultra-reliable, low-latency, and ultra-reliable low-latency may be used interchangeably herein.

[0086] In some examples, the UEs 115 may be configured to support direct communication with other UEs 115 via a device-to-device (D2D) communication link 135 (e.g., according to a peer-to-peer (P2P), D2D, or sidelink protocol). In some examples, one or more UEs 115 of a group conducting D2D communication may be within a coverage area 110 of a network entity 105 (e.g., a base station 140, an RU 170), which may support aspects of such D2D communication configured (e.g., scheduled) by the network entity 105. In some examples, one or more UEs 115 of such a group may be outside the coverage area 110 of the network entity 105, or may otherwise be unable to or not configured to receive transmissions from the network entity 105. In some examples, a group of UEs 115 communicating via D2D communication may support a one-to-many (1:M) system, in which each UE 115 transmits to each of the other UEs 115 in the group. In some examples, the network entity 105 may facilitate scheduling of resources for D2D communication. In some other examples, D2D communication may be performed between UEs 115 without the involvement of the network entity 105.

[0087] In some systems, the D2D communication link 135 may be an example of a communication channel between vehicles (e.g., UEs 115), such as a sidelink communication channel. In some examples, the vehicles may communicate using vehicle-to-everything (V2X) communication, vehicle-to-vehicle (V2V) communication, or some combination thereof. The vehicles may signal information associated with traffic conditions, signal scheduling, weather, safety, emergencies, or any other information relevant to the V2X system. In some examples, the V2X system may communicate with roadside infrastructure, such as roadside units, or with a network via one or more network nodes (e.g., network entities 105, base stations 140, RUs 170) using vehicle-to-network (V2N) communication, or both.

[0088] The core network 130 may provide user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions. The core network 130 may be an evolved packet core (EPC) or a 5G core (5G core, 5GC), which may include at least one control plane entity (e.g., a mobility management entity (MME), an access and mobility management function (AMF)) that manages access and mobility, and at least one user plane entity (e.g., a serving gateway (S-GW), a Packet Data Network (PDN) gateway (P-GW), or a user plane function (UPF)) that routes packets or interconnects to external networks. The control plane entity may manage non-access stratum (NAS) functions such as mobility, authentication, and bearer management for UEs 115 served by network entities 105 (e.g., base stations 140) associated with the core network 130. User IP packets may be forwarded through a user plane entity, which may provide IP address allocation and other functions. The user plane entity may connect to IP services 150 for one or more network operators. The IP services 150 may include access to the Internet, an intranet, an IP Multimedia Subsystem (IMS), or packet-switched streaming services.

[0089] The wireless communication system 100 may operate using one or more frequency bands, which may range from 300 megahertz (MHz) to 300 gigahertz (GHz). The 300 MHz to 3 GHz region is commonly known as the ultra-high frequency (UHF) region or decimeter band because wavelengths range in length from approximately 1 decimeter to 1 meter. Although UHF waves may be blocked or redirected by buildings and environmental features, sometimes referred to as clusters, the waves may penetrate structures sufficiently for a macrocell to provide service to UEs 115 located indoors. Communications using UHF waves may be associated with smaller antennas and shorter distances (e.g., less than 100 kilometers) compared to communications using lower frequency and longer waves in the shortwave (high frequency (HF)) or very high frequency (VHF) portions of the spectrum below 300 MHz.

[0090] The wireless communication system 100 may also operate using the Super High Frequency (SHF) region, also known as the centimeter band, which may range from 3 GHz to 30 GHz, or the Extremely High Frequency (EHF) region of the spectrum, also known as the millimeter band (e.g., 30 GHz to 300 GHz). In some examples, the wireless communication system 100 may support millimeter wave (mmW) communications between the UE 115 and the network entity 105 (e.g., base station 140, RU 170), although the EHF antennas on each device may be smaller and more closely spaced than UHF antennas. In some examples, such techniques may facilitate the use of antenna arrays within the device. However, propagation of EHF transmissions may experience greater attenuation and shorter distances than SHF or UHF transmissions. The techniques disclosed herein may be employed across transmissions using one or more different frequency ranges, and the designated use of bands across these frequency ranges may vary by country or regulatory body.

[0091] The electromagnetic spectrum is often subdivided into various classes, bands, channels, etc. based on frequency / wavelength. For 5G NR, two initial operating bands have been identified by the frequency range designations FR1 (410 MHz to 7.125 GHz) and FR2 (24.25 GHz to 52.6 GHz). It should be understood that, although a portion of FR1 is above 6 GHz, FR1 is often referred to (interchangeably) as the “sub-6 GHz” band in various documents and papers. Similar nomenclature issues may arise with respect to FR2, which is often referred to (interchangeably) as the “millimeter wave” band in documents and papers, even though it is different from the extremely high frequency (EHF) band (30 GHz to 300 GHz) identified by the International Telecommunications Union (ITU) as the “millimeter wave” band.

[0092] Frequencies between FR1 and FR2 are often referred to as mid-band frequencies. Recent 5G NR studies have identified operating bands for these mid-band frequencies as a frequency range designated FR3 (7.125 GHz to 24.25 GHz). Frequency bands included within FR3 may inherit FR1 and / or FR2 characteristics, thus effectively extending the characteristics of FR1 and / or FR2 to the mid-band frequencies. In addition, higher frequency bands are currently being explored to extend 5G NR operation beyond 52.6 GHz. For example, three higher operating bands have been identified as frequency ranges designated FR4a or FR4-1 (52.6 GHz to 71 GHz), FR4 (52.6 GHz to 114.25 GHz), and FR5 (114.25 GHz to 300 GHz). Each of these higher frequency bands is included within the EHF band.

[0093] With the above aspects in mind, it should be understood that unless specifically stated otherwise, terms such as "sub-6 GHz," as used herein, may broadly refer to frequencies that may be below 6 GHz, may be within FR1, or may include mid-band frequencies. Furthermore, unless specifically stated otherwise, it should be understood that terms such as "mmWave," as used herein, may broadly refer to frequencies that may include mid-band frequencies, may be within the ranges of FR2, FR4, FR4-a, or FR4-1, and / or FR5, or may be within the EHF band.

[0094] The wireless communication system 100 may utilize both licensed and unlicensed RF spectrum bands. For example, the wireless communication system 100 may employ License Assisted Access (LAA), LTE-Unlicensed (LTE-U) radio access technology, or NR technology in an unlicensed band, such as the 5 GHz industrial, scientific, and medical (ISM) band. While operating using the unlicensed RF spectrum band, devices such as the network entity 105 and the UE 115 may employ carrier sensing for collision detection and collision avoidance. In some examples, operations using the unlicensed band may be based on a carrier aggregation configuration in conjunction with component carriers operating using a licensed band (e.g., LAA). Operations using the unlicensed spectrum may include downlink transmissions, uplink transmissions, P2P transmissions, or D2D transmissions, among other examples.

[0095] The network entity 105 (e.g., base station 140, RU 170) or the UE 115 may be equipped with multiple antennas that can be used to employ techniques such as transmit diversity, receive diversity, multiple-input multiple-output (MIMO) communications, or beamforming. The antennas of the network entity 105 or the UE 115 may be arranged in one or more antenna arrays or antenna panels that can support MIMO operation or transmit or receive beamforming. For example, one or more base station antennas or antenna arrays may be collocated in an antenna assembly such as an antenna tower. In some examples, the antennas or antenna arrays associated with the network entity 105 may be located in various geographic locations. The network entity 105 may include an antenna array having a set of rows and columns of antenna ports that the network entity 105 can use to support beamforming of communications with the UE 115. Similarly, the UE 115 may include one or more antenna arrays that can support various MIMO or beamforming operations. Additionally or alternatively, the antenna panel may support RF beamforming for signals transmitted via the antenna ports.

[0096] The network entity 105 or the UE 115 may use MIMO communications to exploit multipath signal propagation and increase spectral efficiency by transmitting or receiving multiple signals via different spatial layers. Such techniques are sometimes referred to as spatial multiplexing. Multiple signals may be transmitted by a transmitting device via different antennas or different combinations of antennas, for example. Similarly, multiple signals may be received by a receiving device via different antennas or different combinations of antennas. Each of the multiple signals may be referred to as a separate spatial stream and may carry information associated with the same data stream (e.g., the same codeword) or different data streams (e.g., different codewords). Different spatial layers may be associated with different antenna ports used for channel measurement and reporting. MIMO techniques include single-user MIMO (SU-MIMO), in which multiple spatial layers are transmitted to the same receiving device, and multi-user MIMO (MU-MIMO), in which multiple spatial layers are transmitted to multiple devices.

[0097] Beamforming, sometimes referred to as spatial filtering, directional transmission, or directional reception, is a signal processing technique that may be used at a transmitting or receiving device (e.g., network entity 105, UE 115) to shape or steer an antenna beam (e.g., a transmit beam, a receive beam) along a spatial path between the transmitting and receiving devices. Beamforming may be achieved by combining signals communicated via antenna elements of an antenna array such that some signals propagating along a particular orientation relative to the antenna array experience constructive interference, while other signals experience destructive interference. Adjusting signals communicated via antenna elements may include the transmitting or receiving device applying an amplitude offset, a phase offset, or both to signals carried via antenna elements associated with the device. The adjustment associated with each of the antenna elements may be defined by a beamforming weight set associated with a particular orientation (e.g., with respect to the antenna array of the transmitting or receiving device, or with respect to some other orientation).

[0098] The network entity 105 or the UE 115 may use beam sweeping techniques as part of a beamforming operation. For example, the network entity 105 (e.g., base station 140, RU 170) may use multiple antennas or antenna arrays (e.g., antenna panels) to perform a beamforming operation for directional communication with the UE 115. Some signals (e.g., synchronization signals, reference signals, beam selection signals, or other control signals) may be transmitted multiple times by the network entity 105 along different directions. For example, the network entity 105 may transmit signals according to different beamforming weight sets associated with different transmission directions. The transmissions along different beam directions may be used to identify beam directions (e.g., by a transmitting device such as the network entity 105 or by a receiving device such as the UE 115) for subsequent transmission or reception by the network entity 105.

[0099] Some signals, such as data signals associated with a particular receiving device, may be transmitted by a transmitting device (e.g., transmitting network entity 105, transmitting UE 115) along a single beam direction (e.g., a direction associated with a receiving device, such as receiving network entity 105 or receiving UE 115). In some examples, the beam direction associated with a transmission along a single beam direction may be determined based on signals transmitted along one or more beam directions. For example, UE 115 may receive one or more of the signals transmitted by network entity 105 along different directions and may report to network entity 105 an indication of the signal received by UE 115 with the highest signal quality or otherwise acceptable signal quality.

[0100] In some examples, transmission by a device (e.g., by the network entity 105 or the UE 115) may be performed using multiple beam directions, and the device may use a combination of digital precoding or beamforming to generate a composite beam for transmission (e.g., from the network entity 105 to the UE 115). The UE 115 may report feedback indicating precoding weights for one or more beam directions, and the feedback may correspond to a configured set of beams across the system bandwidth or one or more subbands. The network entity 105 may transmit reference signals (e.g., cell-specific reference signals (CRS), channel state information reference signals (CSI-RS)) that may be precoded or non-precoded. The UE 115 may provide feedback for beam selection, which may be a precoding matrix indicator (PMI) or codebook-based feedback (e.g., a multi-panel type codebook, a linear combination type codebook, a port selection type codebook). Although these techniques are described with reference to signals transmitted along one or more directions by the network entity 105 (e.g., base station 140, RU 170), the UE 115 may employ similar techniques to transmit a signal multiple times along different directions (e.g., to identify a beam direction for subsequent transmission or reception by the UE 115) or to transmit a signal along a single direction (e.g., to transmit data to a receiving device).

[0101] A receiving device (e.g., UE 115) may perform receiving operations according to multiple receiving configurations (e.g., directional listening) when receiving various signals from the receiving device (e.g., network entity 105), such as a synchronization signal, a reference signal, a beam selection signal, or other control signals. For example, the receiving device may perform receiving according to multiple receiving directions by receiving via different antenna subarrays, by processing received signals according to different antenna subarrays, by receiving according to different receive beamforming weight sets (e.g., different directional listening weight sets) applied to signals received at multiple antenna elements of the antenna array, or by processing received signals according to different receive beamforming weight sets applied to signals received at multiple antenna elements of the antenna array, any of which may be referred to as “listening” according to different receiving configurations or receiving directions. In some examples, the receiving device may use a single receiving configuration to receive along a single beam direction (e.g., when receiving a data signal). A single receiving configuration may be aligned along a beam direction determined based on listening along different receiving configuration directions (e.g., a beam direction determined to have the highest signal strength, highest signal-to-noise ratio (SNR), or otherwise acceptable signal quality based on listening along multiple beam directions).

[0102] The wireless communication system 100 may be a packet-based network operating according to a layered protocol stack. In the user plane, communications at the bearer or PDCP layer may be IP-based. The RLC layer may perform packet segmentation and reassembly for communications over logical channels. The MAC layer may perform priority handling and multiplexing of logical channels onto transport channels. The MAC layer may also implement error detection, error correction, or both to support retransmissions and improve link efficiency. In the control plane, the RRC layer may provide establishment, configuration, and maintenance of the RRC connection between the UE 115 and the network entity 105 or the core network 130 supporting radio bearers for user plane data. The PHY layer may map transport channels to physical channels.

[0103] The UE 115 and the network entity 105 may support retransmission of data to increase the likelihood that the data is successfully received. Hybrid automatic repeat request (HARQ) feedback is one technique for increasing the likelihood that data is correctly received over a communication link (e.g., communication link 125, D2D communication link 135). HARQ may include a combination of error detection (e.g., using a cyclic redundancy check (CRC)), forward error correction (FEC), and retransmission (e.g., automatic repeat request (ARQ)). HARQ may improve throughput at the MAC layer in poor radio conditions (e.g., low signal-to-noise conditions). In some examples, a device may support same-slot HARQ feedback, in which case the device may provide HARQ feedback for data received via a previous symbol in a particular slot. In some other examples, the device may provide HARQ feedback in a subsequent slot or according to some other time interval.

[0104] In some examples, a transmitting device (e.g., the UE 115 or the network entity 105) may support bit shaping in a block coding scheme (e.g., polar coding) and a probabilistic shaping framework to generate shaped bits including both information bits (e.g., data) and shaping bits without having to convey extra information (e.g., in addition to the shaped bits) to a receiving device. The transmitter may use a decoder, such as a polar decoder (e.g., a modem configured for both coding and decoding), to determine a set of shaping bits based on the information bits. Both the shaping bits and the information bits are shaped, eliminating the need to convey extra information regarding the shaping bits to a receiver. The techniques may also include mapping information bits to frozen bit positions of a polar code (e.g., positions in the polar code associated with all-zero bits) and mapping shaping bits to information bit positions of the polar code (e.g., positions in the polar code associated with information bits) such that the coded (e.g., shaped) bits from the polar encoder satisfy a target probability distribution. In some examples, the transmitting device may use a block coding scheme (e.g., a polar code) and a channel coding scheme (e.g., using a forward error correction scheme) to generate a set of parity bits such that the transmitting device transmits a complete set of shaped bits including information bits, shaping bits, and parity bits.

[0105] 2 illustrates an example of a wireless communication system 200 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The wireless communication system 200 may implement or be implemented by aspects of the wireless communication system 100. For example, the wireless communication system 200 may include a wireless device 205-a and a wireless device 205-b, which may be examples of corresponding devices (e.g., a network entity 105, a UE 115) described herein. The wireless device 205-a may communicate with the wireless device 205-b via a communication link 210 and a communication link 215. The wireless device 205 may communicate one or more bits 220. The communication link 210 and the communication link 215 may be either an uplink or a downlink, and in some cases may be a sidelink connection. A device that transmits a signal or message (e.g., on the uplink, downlink, or sidelink) may be referred to as a transmitting device, and a device that receives a transmitted signal (e.g., on the uplink, downlink, or sidelink) may be referred to as a receiving device.

[0106] Generally, wireless communication system 200 illustrates one example of wireless device 205-a and wireless device 205-b communicating via communication link 210 and communication link 215. For example, wireless device 205-a, wireless device 205-b, or both, may transmit signals modulated to represent a set of bits 220. For example, bits 220 may be transmitted via a message including a distribution of modulated symbols, where each symbol in the distribution may represent one or more bits.

[0107] Some wireless communication systems (e.g., cellular, Wi-Fi) may utilize higher-order modulation (e.g., 16-quadrature amplitude modulation (QAM), 64-QAM, 256-QAM, 1024-QAM, 4096-QAM) to increase spectral efficiency for wireless transmissions at higher signal-to-noise ratio (SNR) values. In such systems, the constellation of modulated symbols may be fixed (e.g., may be a square constellation), and each constellation point (e.g., value, symbol) may have the same probability of being used as another constellation point (e.g., each constellation point may be used with equal probability). In some examples, the SNR of uniform modulation (e.g., 16QAM, 64QAM, 256QAM, quadrature phase shift keying (QPSK)) and stochastic shaping (e.g., a uniform distribution 230 with the same energy (E) for each constellation point defined by I (in-phase carrier) on the X-axis and Q (quadrature carrier) on the Y-axis) increases as the information rate increases. The optimized constellation distribution may reach a plateau (e.g., initially, for a given modulation or shaping scheme, an increase in SNR may result in an increase in information rate, but at some point, the SNR may continue to increase while the information rate remains the same). Stochastic shaping may reach a plateau at the same information rate as 256QAM and at a higher information rate than other uniform QAMs.

[0108] In some cases, the distribution of symbols may be shaped so that different symbols may have different probabilities of use, and such a distribution may be referred to as a non-uniform distribution of symbols. For example, the non-uniform distribution of symbols may include a first set of symbols having respective probabilities of use below a first probability level and a second set of symbols having respective probabilities of use above the first probability level. In such cases, the first set of symbols may include one or more probabilities below the first probability level (e.g., different probabilities below the first probability level), and the second set of symbols may include one or more probabilities above the first probability level (e.g., different probabilities above the first probability level).

[0109] The non-uniform distribution of symbols may be shaped using one or more stochastic shaping techniques (e.g., according to stochastic shaping 240). Stochastic shaping may be a technique used to increase the spectral efficiency of coded modulation and may generate non-uniformly distributed coded modulation symbols or non-uniformly distributed constellations. In some examples, non-uniformly distributed QAM may have a higher capacity than uniformly distributed QAM. Such a non-uniform distribution may result in higher transmission capacity, higher spectral efficiency, or generally higher communication quality than a uniform symbol distribution. For example, a non-uniformly distributed constellation may be associated with greater mutual information (e.g., information I defined by parameters X and Y) than a uniformly distributed constellation at the same SNR.

[0110] An example of a probabilistic shaping framework (e.g., for generating probabilistic shaping 240) may be probabilistic amplitude shaping (PAS) (e.g., distribution matching). PAS may shape the amplitude of a constellation of modulated symbols (e.g., the amplitude may be non-uniform) while keeping the constellation's indicators uniformly distributed. In some examples, PAS may be performed before channel coding of the information bits. In some examples, PAS may perform shaping on the information bits (e.g., shaping the bits for distribution to a non-uniform symbol constellation) and may utilize a systematic channel code. For example, PAS may use a systematic channel code to preserve the shaping applied to the information bits (e.g., the shaping may be preserved during channel coding, which may occur after shaping). In PAS, parity bits are not shaped but instead may be mapped to the constellation's indicators (e.g., which indicators may not be shaped by PAS).

[0111] The PAS may be based on a code. In some other examples, the PAS may be based on a source compression technique such as arithmetic coding (e.g., Huffman code). The source coding may convert a non-uniformly distributed source into uniform bits, and the PAS may invert the conversion. Techniques for the PAS may include CCDM (constant-composition distribution matching), multi-CCDM (multiple-composition distribution matching), sphere shaping (constraining an input codeword (a multidimensional complex vector) to a power sphere), etc. However, to apply such a scheme to a communication system, bit compression may be specified. For example, the compression algorithm may be specified up to a fixed point, which may be quantized by a probability value of a defined precision. Additionally, the compression algorithm specification may include different configurations for the shaping rate, target probe distribution, block length, modulation order, etc. In some examples, the source code may be nonlinear, which may be difficult to co-design with the FEC. Furthermore, hardware and software improvements may be implemented to accommodate high-speed compression and decompression.

[0112] In some examples, the PAS may be based on a source compression algorithm (e.g., arithmetic coding, Huffman coding) for shaping information bits into a given probability distribution, followed by a high-rate systematic code for encoding the shaped information bits. By using a high-rate systematic code, the distribution for the information bits may be maintained. In some other examples, the PAS may be based on a block code (e.g., polar code), which may generate masking bits to mask the information bits into a particular distribution.

[0113] In some examples, polar codes may be used for information transmission.

[0114]

number

number

number

number

[0115]

number

[0116] The signaling diagram 300 may implement or may be implemented by aspects of the wireless communication system 100 and the wireless communication system 200. For example, the signaling diagram 300 may be an example of communication between wireless devices 205 as described with reference to Figure 2. The signaling diagram 300 illustrates an example of stochastic shaping, including a stochastic shaper 310 (e.g., distribution matching) followed by forward error correction (FEC).

[0117] 3 illustrates an example signaling diagram 300 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The signaling diagram 300 may implement or be implemented by aspects of the wireless communication systems 100 and 200. For example, the signaling diagram 300 may be an example of communication between wireless devices 205 as described with reference to FIG. 2. The signaling diagram 300 shows an example of stochastic shaping including a stochastic shaper 310 (e.g., distribution matching) followed by forward error correction (FEC). In some examples, a device 365 (e.g., a transmitter) may perform stochastic shaping in accordance with the signaling diagram 300.

[0118] According to stochastic shaping (e.g., probabilistic amplitude shaping (PAS)), a transmitting device (e.g., wireless device 205) may input information bits 305 (an information payload, such as a set of input bits associated with a data message) to a stochastic shaper 310. The stochastic shaper 310 may output a set of shaped bits 320 and a set of uniform bits 315, which may be input to an FEC encoder 325. The stochastic shaper 310 may convert the information bits 305 (e.g., uniform bits) into non-uniformly distributed bits (e.g., shaped bits 320) according to a given target probability distribution. The wireless device 205 may additionally input a set of parity bits to the FEC encoder 325 associated with the information payload. In some aspects, the FEC encoder 325 may be a high-rate systematic FEC encoder.

[0119] The FEC encoder 325 may output a set of shaped bits (e.g., information bits, systematic bits) 330, a set of unshaped bits (e.g., information bits, systematic bits) 335, and a set of parity bits (which may also be unshaped) 340. The constellation mapping 345 may map the set of shaped bits 330, which may be unevenly distributed or biased, to one or more constellation point amplitudes 350. The constellation mapping 345 may map the set of unshaped bits 335, which may be uniformly distributed or unbiased, and the set of parity bits 340, to one or more constellation point indicators 355. Thus, for a given constellation point, the constellation point amplitude is shaped, but the constellation point indicator may remain unshaped (and associated with a uniform distribution). In some examples, the modulation symbols resulting from the constellation mapping 345 may be unevenly distributed. In some aspects, the constellation mapping 345 may be associated with a QAM modulation, the output of which may be a uniformly distributed QAM constellation 360.

[0120] In some examples of the techniques described herein, a transmitting device may generate a set of shaped bits (e.g., including shaping bits and information bits) and may transmit a message including the shaped bits to a receiving device.

[0121] FIG. 4 illustrates an example signaling diagram 400 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The signaling diagram 400 may implement or be implemented by the aspects of FIGS. 1-3. FIG. 4 may be an example of one or more features of a framework for block code and bit masking-based stochastic shaping. For example, a transmitter (e.g., a transmitting wireless device such as the UE 115 or the network entity 105) may encode and transmit messages in accordance with the signaling diagram 400 and may be an example of a corresponding device described with reference to FIGS. 1-3 (e.g., the UE 115, the wireless device 205, or the network entity 105). FIG. 4 illustrates one or more techniques for processing information bits 405 (e.g., u) to code, shape, and combine the information bits 305 (e.g., data and associated parity bits) for transmission.

[0122] For example, a transmitting device (e.g., wireless device 205) may directly encode information bits 405 using channel coding 410 (e.g., a channel coding scheme). After performing channel coding 410, the information bits 405 may be referred to as coded information bits 415 (e.g., x). In masking bit generation 420, the transmitting device may use the coded information bits 415 to generate a set of masking bits 425 and may also generate a set of shaping bits 430. The set of masking bits 425 may have the same amount of bits (e.g., n bits) as the coded information bits so that combinations of the set of shaping bits and the coded information bits (e.g., via a bitwise XOR operation) are not uniformly distributed (e.g., to achieve a target shaped distribution).

[0123] For example, after modulation, the masking bits 425 and the coded information bits 415 may be combined in bit combinations 435. The combination of the set of masking bits 425 and the coded information bits 415 (e.g., x+v) may result in a desired distribution (e.g., a non-uniform distribution) of modulated symbols. In some examples, there may be a quantity (e.g., v) of code words of a block code. In some examples, the masking bit generation 420 may be applied to parity bits associated with data carried by the coded information bits 315. For example, the coded information bits 415 may include parity bits associated with the data included in the coded information bits 415.

[0124] In some examples, information regarding the set of masking bits 425 may not be available to the receiving device (e.g., UE 115, network entity 105). Therefore, information associated with the set of masking bits 425 may be generated and transmitted to the receiver to unshape (e.g., unmask or descramble) the received information bits. For example, the transmitting device may use the set of masking bits 425 to generate a set of shaping bits 430 that can be used to generate a mask (e.g., v, the set of masking bits 425) for masking the coded information bits 415. In some cases, the transmitting device may use the set of shaping bits 430 to generate the set of masking bits 425. The set of shaping bits 430 may represent a second bit sequence (e.g., s) that may be shorter in length than v, but may be used to generate v (e.g., the set of masking bits 425). For example, the shaping bits 430 may be generated by compressing the set of masking bits 425 such that the masking bits 425 may be equal to the shaping bits 430 multiplied by a generator matrix (e.g., G). In some examples, the masking bits 425 may be generated (e.g., regenerated by a receiving device, generated by a transmitting device) from the shaping bits 430 via a linear block code (e.g., a Golay code, a polar code, an LDPC code, a convolutional code, a Turbo code, a Reed-Muller code) using a generator matrix (e.g., G). For example, the linear block code may be applied to the shaping bits 430 by multiplying the shaping bits 430 by a generator matrix (e.g., the generator matrix may be associated with or configured for application of a linear block code).

[0125] As described herein with respect to FIG. 4, the technique of stochastic shaping based on a block code and bit masking generation 420 does not involve specifying an additional source coding algorithm. The technique does not involve specifying a code (such as a polar code or another linear code), so that the detailed shaping algorithm, as well as the channel decoder, can be implemented according to the specification. However, such a technique may generate a set of shaping bits 430, which may be a compressed version of the masking bits 425 (e.g., v) that can be communicated to a receiver. The shaping bits 430 may be communicated using the same communication channel as the data, which may allow the receiver to recover the masking bits 425. In such an example, the shaping bits 430 are not shaped, and the information bits are shaped. For example, if the shaping rate is (equation, K info / (K info +K shape ) is 0.7, the amount of shaping bits 430 generated (for example, K shape ) may be 75% of the number of information bits 405, and the shaping bits 430 may not be shaped.

[0126] 5 illustrates an example of a shaping scheme 500 that supports block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The shaping scheme 500 may implement or be implemented by aspects of wireless communication system 100 and wireless communication system 200. For example, a transmitter (e.g., a transmitting wireless device such as UE 115 or network entity 105) may encode and transmit a message in accordance with the shaping scheme 500 and may be an example of a corresponding device described with reference to FIGS. 1-4 (e.g., UE 115 or network entity 105).

[0127] The techniques described herein support a shaping and encoding procedure that results in improved throughput and increased reliability of transmission. The transmitter uses a shaper 505 to generate a set of K data bits b (e.g., [b 0 ,...,b K-1]), and a set of L shaping bits s (e.g., [s0,...,s L-1 ]), resulting in a set of N shaped bits v (e.g., [v0,...,v N-1 ]), resulting in shaped bits 520. In some examples, the procedure of multiplying the set of bits by the matrix G (e.g., using shaper 505) may be called a polar transform or may be referred to as applying a polar transform to the set of bits. In some examples, the polar transform may be implemented via a fast Hadamard transform.

[0128] In some examples, the transmitter may use a block code (e.g., a polar code) and a target probability distribution for the coded bits. For example, the transmitter may use a block encoder (e.g., a block code) to encode the data bits 510 and the shaping bits 515 into a set of block-coded (e.g., polar-coded) bits, thereby generating a target probability distribution for the data bits (e.g., [b0,...,b K-1 ]) are placed in the frozen bit positions of the polar code, and the shaping bits (e.g., [s0,...,s L-1 ]) are placed in the information bit positions of the polar code, and the encoded bits or shaped bits 520 (e.g., [v0,...,v L-1 ]) has a desired target probability distribution. In some examples, the techniques described herein with reference to Figures 5-10 may be implemented using any block code, channel code, linear code, etc. For example, the techniques described herein may be implemented using a low-density generator matrix (LDGM) code, a convolutional code, a Turbo code, a Reed-Muller code, or an algebraic code (e.g., a Bose-Chaudhuri-Hocquenghem (BCH) code, a Reed-Solomon code, or a Hamming code), among other examples.

[0129] Based on the data bits 510 and using a polar decoder, the transmitter generates a set of shaping bits 515 (e.g., [s0,...,s L-1 ]). The shaping bits 515 may be obtained from a function (e.g., a deterministic function) of the data bits. In some examples, the shaping bits 515 or shaped bits 520 may contain zero new information conditional on all other data bits 510. For example, the conditional entropy of the shaped bits 520 or shaping bits 515 for a given data bit 510 may be zero. The data bits 510 may be determined based on the data bits to be shaped (e.g., [b0,...,b K-1 ]), and may also include other data bits that are not to be shaped (eg, as described in more detail with reference to FIG. 9A).

[0130] In some examples, as described in more detail with reference to FIGS. 6-7 , the transmitter may determine the shaping bits 515 based on a set of LLR values. In some cases, the transmitter may calculate LLR values ​​based on data (e.g., data bits 510). The shaped bits 520 may be based on a target distribution and may all be placed in the same bit position of a modulation symbol. For example, (e.g., in an 8-QAM system such as a 64-QAM system), the transmitter may map three bits (e.g., [a, v, c]) to a modulation symbol. The transmitter may map bits [a, v, c] according to a shaping scheme (e.g., an independent distribution 525-a, sometimes referred to as unconditional shaping) or according to a different shaping scheme (e.g., a conditional distribution 525-b). In some examples, the transmitter may map bits a, v, and c according to a target distribution using uniformly distributed shaping, where v may represent the bit to be shaped, such as a candidate shaped bit (e.g., candidate bit a, v, or c). The transmitter may first determine a conditional distribution (e.g., Pr(v=0|c)) based on the target distribution. i The LLR of can be determined from other data bits (e.g., bit c) to be mapped to the same modulation symbol, and the target conditional distribution Pr(v|c) is

[0131]

number

[0132]

number

[0133] A receiving device may receive and decode a transmission generated according to the techniques described herein (e.g., with reference to FIG. 5). For example, the receiver may obtain shaped bits v (e.g., shaped bits 520). The receiver may apply a polar transform (e.g., multiply the vector of bits v by the same matrix G, which may be an NXN matrix) to obtain a set of data bits b (e.g., data bits 510) and shaping bits s (e.g., shaping bits 515). The receiver may extract the data bits b from frozen bit positions of the corresponding polar code, and the shaping bits s may be discarded (e.g., because they do not contain useful information corresponding to the data).

[0134] In some examples, as described in more detail with reference to FIG. 6, the transmitter may generate shaping bits based on the LLR values.

[0135] 6 illustrates an example of a bit generation scheme 600 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The bit generation scheme 500 may implement or be implemented by aspects of the wireless communication system 100 or the wireless communication system 200. For example, a device 625 (e.g., a transmitting wireless device such as a UE 115 or a network entity 105) may encode and transmit a message in accordance with the bit generation scheme 500 and may be an example of a corresponding device described with reference to FIGS. 1-5 (e.g., the UE 115 or the network entity 105).

[0136] The transmitter may encode and transmit a message according to the techniques described herein. The transmitter may generate shaping bits based on a set of LLR values ​​(e.g., as described with reference to FIG. 5). In some examples, a decoder 610 (e.g., a polar decoder) may be used to encode and decode wireless signaling. For example, the polar decoder 610 may obtain LLR values ​​605 (e.g., from a channel output) and obtain frozen bits 620, which the transmitter may set to an all-zero value, resulting in output of decoded bits 615 (e.g., decoded information bits). However, such techniques may result in reduced throughput and increased latency at the receiver side (e.g., due to the receiver decoding the shaped bits and additional data bits). The techniques described herein may support generating shaped bits (e.g., without requiring additional decoding of the shaped bits and data or information bits).

[0137] For example, according to the techniques described herein, a transmitter may obtain LLR values ​​based on a target distribution, other non-data bits, or both. The transmitter may decode the LLR values ​​using a decoder 610 (e.g., a polar decoder). The decoder 610 may also fill frozen bits of the polar code with data bits instead of all-zero bits. The decoder 610 may be able to determine a set of shaping bits from the LLR values ​​(e.g., the decoded bits 615 are the shaping bits), and the shaping bits may correspond to information bits associated with the decoder 610.

[0138] 7 illustrates an example of a shaping scheme 700 that supports block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The shaping scheme 700 may implement or be implemented by aspects of wireless communication system 100 and wireless communication system 200. For example, a transmitter (e.g., a transmitting wireless device such as UE 115 or network entity 105) may encode and transmit a message in accordance with the shaping scheme 700 and may be an example of a corresponding device described with reference to FIGS. 1-6 (e.g., UE 115 or network entity 105).

[0139] In some examples, the transmitter may select a set of shaping bits s (e.g., [s0,...,s L-1 ]), where s denotes a length K data vector including all-zero frozen bits and shaping bits, b denotes a length K data vector to be shaped, and G denotes a generator matrix. In such an example, the generator matrix G may be of size K×K.

[0140] In some examples, according to the techniques described herein, shaping may be applied to block-coded data (e.g., polar-coded data such as shaped bits 520), such as c=bG, where b is the number of data bits on frozen bit positions (e.g., [b0,...,b K-1]) and all-zero bits on the information bit positions of a block code (e.g., a polar code), and G denotes a generator matrix. In such an example, the size of the generator matrix G may be N×N. Thus, the transmitter may pre-encode data using a block code (e.g., polar coding) by inserting data bits on the frozen bit positions and adding zeros in the information bit positions. Thus, the input 710 may include data bits on the frozen bit positions and zeros in the information bit positions.

[0141] The shaper 705 may generate shaped bits 725 (e.g., shaped bits v, where v=u+c) according to a generator matrix G, and may convert pre-encoded bits 720 (e.g., [c0,...,c N-1 ]) may be defined as c = bG (in which case, for example, equivalence can be shown via the linearity of G, such that (s + b)G = sG + bG, where b represents data bits, s represents shaping bits, and v represents shaped bits, where v = u + c). In some examples, the size of matrix G may be defined as K × K, where K indicates the number of data bits before shaping. In some examples, as described herein, the size of matrix G may be defined as NXN, where N indicates the length of the information bits after shaping (e.g., the shaped bits may include both unshaped data bits and shaping bits). In examples where the size of matrix G is K × K, the shaping bits may be transmitted separately to the receiver to enable the receiver to decode data bits b. However, in the second approach, information about the shaping bits can be included in the shaped bits (e.g., u+c=(s+b)G), and therefore, information about the shaping bits s does not need to be separately communicated to the receiver.

[0142] Such techniques may result in reduced processing at the receiver side, reduced signaling overhead, more efficient utilization of communication resources, and improved reliability of wireless signaling. For example, some shaping and transmission techniques (e.g., as described in some aspects of FIG. 5) may include inserting data bits into frozen bit positions and may use a decoder to directly generate the shaped bits. However, such procedures may involve modifying existing polar decoders (e.g., by replacing frozen bits with data bits). Such procedures may be costly because the frozen bits may be hard-coded to be all zeros, and changing these bits to non-zero values ​​(e.g., as opposed to hard-coding device hardware) may require modifications to existing decoding implementations to change these bits from all-zero frozen bits to non-zero data bits (e.g., which may result in increased consumption of power and processing resources, increased processing delays, etc.).

[0143] In some examples, as described with reference to FIG. 7, the transmitting wireless device may use its own polar decoder by keeping the frozen bits to all zeros, and thus an existing polar decoder may be reused (e.g., without modification). In such a technique, the decoder may output several intermediate bits (e.g., u), and the transmitter device may add pre-coded data bits 720 (e.g., c=bG) to the intermediate bits u to generate final shaped bits 725 (e.g., v). Because such a technique may be implemented using an existing encoder, such a technique may be relatively easy to implement by the transmitting device.

[0144] Overall, the techniques described with reference to Figure 5 and the techniques described with reference to Figure 7 may result in similar sets of shaped bits, but the approach described with reference to Figure 7 may be easier to implement if the device already implements a polar decoder / encoder for communication purposes (e.g., to communicate control signals).

[0145] A receiving device may receive and decode a transmission generated according to the techniques described herein (e.g., with reference to FIG. 7). For example, the receiver may obtain shaped bits v (e.g., shaped bits 725). The receiver may apply a polar transform (e.g., multiply the vector of bits v by the same matrix NXN, which may be matrix G) to obtain a set of data bits b and shaping bits s. The receiver may extract data bits b from frozen bit positions of the corresponding polar code, and the shaping bits s may be discarded (e.g., because they do not contain useful information corresponding to the data).

[0146] The transmitter may calculate the LLR values ​​based on the data, as described in more detail with reference to Figure 6. In some examples, the transmitter may shape the parity bits according to a joint design with the FEC.

[0147] FIG. 8 illustrates an example of an encoding scheme 800 supporting stochastic shaping based on a block code in accordance with one or more aspects of the present disclosure. The encoding scheme may be implemented by wireless communication system 100 and wireless communication system 200 or may implement aspects thereof (e.g., by a transmitting device such as device 875). The transmitting device may include a stochastic shaper 810 that may obtain an information payload 805 and output shaped bits 815, as described in more detail with reference to FIGS. 4-7. The transmitting device may perform an encoding procedure (e.g., generate the shaped bits 815) using the stochastic shaper 810. In some examples, the transmitting device may generate the shaped bits 815 using a block channel coding scheme 875. In some examples, the block channel coding scheme 875 may be a polar coding scheme 845, an LDGM coding scheme 850, a convolutional coding scheme 855, a Turbo code coding scheme 860, a Reed-Muller coding scheme 865, or an algebraic coding scheme 870 (e.g., a BCH code, a Reed-Solomon code, or a Hamming code, etc.).

[0148] In some examples, the techniques described herein may support a shaping design based at least in part on (e.g., taking into account) the channel code or FEC (e.g., LDPC) used by the transmitter. This may result in shaping the parity bits 830 of the FEC decoder 820 in addition to the systematic bits 825. For example, the FEC decoder 820 may take the shaped bits 815 as input, output the systematic bits 825 and the parity bits 830, and then perform modulation on the systematic bits 825 and the parity bits 830 (e.g., in a modulator 835) to generate modulation symbols 840 (e.g., unevenly distributed modulation symbols). Such techniques may support joint use of a decoder that decodes the FEC decoder 820 and a block code (e.g., a polar code) used in a stochastic shaper. Such techniques are described in more detail with reference to FIGS. 9A and 9B.

[0149] 9A and 9B illustrate example shaping schemes 900 and 901 that support block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. Shaping schemes 900 and 901 may implement or be implemented by aspects of wireless communication system 100 or wireless communication system 200. For example, device 965-a (e.g., a transmitting wireless device such as UE 115 or network entity 105) may encode and transmit a message in accordance with shaping scheme 900, or device 965-b (e.g., a receiving device such as UE 115 or network entity 105) may receive and decode a message in accordance with shaping scheme 901, and may be an example of a corresponding device described with reference to FIGS. 1-8 (e.g., UE 115 or network entity 105).

[0150] The transmitter may use an FEC decoder 935 to calculate LLR values ​​that are fed to a decoder of the stochastic shaper. In some examples, the transmitter may use the techniques outlined with reference to FIGS. 6-7 to generate the bits that the transmitter shapes (e.g., shaped information bits 910) and parity bits 945 (e.g., a set of M parity bits p, where [p0,...,p M-1 ]), the transmitter may prepare a first set of LLR values ​​for the FEC decoder 935. If information bits are not to be shaped and are input to the FEC decoder 935, the transmitter may set the LLR values ​​for such bits to positive infinity or negative infinity (e.g., infinity may simply represent a very large number).

[0151] For example, the formatter 905 formats one or more data bits 915 and one or more formatting bits 920 (e.g., a formatting matrix

[0152]

number

[0153] Such techniques involve generating a new set of LLR values ​​(e.g., LLR post (v i )) and may use the new set of LLR values ​​in the shaper to perform the shaping. post (v i)) may take into account desired probability distributions for the systematic bits 940 and the parity bits 945. In some examples, the transmitting device may apply a block coding scheme 950 and a channel coding scheme 955. For example, the shaped bits may include information bits, shaping bits, and a set of parity bits associated with the FEC decoder 935 (e.g., channel coding scheme 955). The transmitter may identify a channel coding scheme 955 for encoding the shaped bits 910 (e.g., including the data bits 915 and the shaping bits 920) to generate the set of parity bits 945. The transmitter may use a joint decoder of the block coding scheme 950 and the channel coding scheme 955 to determine the shaping bits 920 based on a target probability distribution for the shaped bits 910 and a second target probability distribution for the shaped parity bits 945 (e.g., the first and second target probability distributions may be the same or different). In such an example, the transmitting device may apply a channel coding scheme 955 to the shaped bits 910 to generate parity bits 945, and the selection of the shaping bits 920 may be performed such that the resulting parity bits 945 are also shaped according to a target probability distribution (e.g., or a second target probability distribution). Some techniques (e.g., as described with reference to FIGS. 5-7) may not take the distribution of the parity bits 945 into account in generating LLRs for a decoder corresponding to the shaping code. As a result, the generated parity bits 945 from the LDPC / channel encoder may be uniformly distributed.

[0154] In some examples, a wireless device may receive a message according to the shaping scheme 901. For example, the receiving device may receive the message and determine one or more LLR values ​​960 corresponding to shaped information bits, unshaped information bits, shaped parity bits, unshaped parity bits, or any combination thereof (e.g., systematic bits 940 and parity bits 945). The LLR values ​​950 may be provided to an FEC decoder 935. The FEC decoder 935 may output shaped bits 910, which may be provided to a shaper 905 (e.g., a polar decoder). The shaper 905 may generate an output including data bits 970 (e.g., shaping bits and information bits).

[0155] 10 illustrates an example of a process flow 1000 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. In the following description of process flow 1000, operations between wireless device 205-c and wireless device 205-d may be performed in a different order or at different times. Some operations may also be omitted from process flow 1000, or other operations may be added. While wireless device 205-c and wireless device 205-d are shown performing the operations of process flow 1000, some aspects of some operations may also be performed by one or more other wireless devices.

[0156] At 1005, wireless device 205-c and wireless device 205-d may communicate control signaling. Wireless device 205-c may determine, based on the control signaling or autonomously, a block coding scheme associated with a target probability distribution for the transmission of a message. The block coding scheme may be one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof. Wireless device 205-c may communicate control signaling indicating the block coding scheme, and the determining may be based on the control signaling.

[0157] The wireless device 205-d may determine a block coding scheme that may be associated with a target probability distribution for reception of the message. The wireless device 205-d may communicate control signaling with the wireless device 205-d that schedules transmission of the message and indicates the block coding scheme, and may determine the block coding scheme based on communicating the control signaling.

[0158] The wireless device 205-c may determine a mapping of the information bits to the frozen bit positions and a mapping of the shaping bits to the information bit positions, and may then encode and transmit the message based on the mapping. The wireless device 205-c may communicate control signaling indicating the mapping, and the determining may be based on communicating the control signaling.

[0159] In some examples, the control signaling may indicate a target probability distribution for the message, may indicate that the message is generated using a channel coding scheme and a block coding scheme, or a combination thereof.

[0160] At 1010, the wireless device 205-c (e.g., a first device) may generate a plurality of shaping bits. The shaping bit generation may be based on a plurality of information bits, and the plurality of shaping bits may be associated with shaping the plurality of information bits to (e.g., by) a target probability distribution associated with a block coding scheme. Generating the shaping bits may include calculating a set of LLR values ​​based on the target probability distribution and decoding the set of LLR values ​​according to a decoding operation associated with the block coding scheme to generate the plurality of shaping bits. In some examples, the plurality of information bits may be mapped to a plurality of frozen bit positions of the block coding scheme, and the plurality of shaping bits may be based on the set of decoded LLR values.

[0161] Computing the set of LLR values ​​may include mapping the second set of information bits and the at least one candidate shaped bit to modulation symbols. In some examples, the computing may include determining a conditional distribution based on a target probability distribution and determining an LLR value for the at least one candidate shaped bit based on the second set of information bits and the conditional distribution associated with the modulation symbols, and computing the set of LLR values ​​is based on determining the LLR value for the at least one candidate shaped bit. In some examples, the second set of information bits may be distributed independently from the distribution of the shaped bits according to the coding, and shaping the second set of information bits according to the coding.

[0162] At 1015, the wireless device 205-c may encode the plurality of information bits and the plurality of shaping bits according to a block coding scheme to generate a plurality of shaped bits that satisfy a target probability distribution. The wireless device 205-c may generate the plurality of shaped bits using a joint decoder for the block coding scheme and the channel coding scheme based at least in part on the target probability distribution associated with the block coding scheme and a second target probability distribution associated with the channel coding scheme. The wireless device 205-c may apply the channel coding scheme to the plurality of shaped bits, including the plurality of information bits and the plurality of shaping bits, to generate a plurality of parities.

[0163] The encoding may include calculating a first set of LLR values ​​for the block coding scheme based on a target probability distribution and calculating a second set of LLR values ​​for a channel coding scheme for a decoder associated with the channel coding scheme (e.g., at 1020, the wireless device 205-c may perform error correction according to a channel coding scheme associated with the FEC decoder). The second set of LLR values ​​may be based on a second target probability distribution corresponding to the plurality of parity bits, and shaping the plurality of shaped bits is based on the first set of LLR values ​​and the second set of LLR values.

[0164] At 1025, the wireless device 205-c (e.g., the first device) may output a message based on the plurality of shaped bits. The wireless device 205-d (e.g., the second device) may obtain the message from the wireless device 205-c.

[0165] At 1030, the wireless device 205-d may decode the message to generate a plurality of shaped bits that satisfy a target probability distribution associated with the block coding scheme, the plurality of shaped bits including a plurality of information bits and a plurality of shaping bits. The wireless device 205-d may jointly decode the plurality of shaping bits including the plurality of information bits and a second set of a plurality of information bits. The information bits and the second set of information bits may be decoded according to a forward error correction decoder associated with the channel coding scheme and the block coding scheme. In such an example, the plurality of shaped bits may include a plurality of parity bits associated with the channel coding scheme.

[0166] 11 illustrates a block diagram 1100 of a device 1105 supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The device 1105 may be an example of a general device aspect as described herein. The device 1105 may include an input component 1110, an output component 1115, and a communications manager 1120. The device 1105 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).

[0167] The input component 1110 may manage input signals for the device 1105. For example, the input component 1110 may identify input signals based on interaction with a modem, keyboard, mouse, touchscreen, or similar device. These input signals may be associated with user input or processing in other components or devices. In some cases, the input component 1110 may utilize an operating system such as iOS®, ANDROID®, MS-DOS®, MS-WINDOWS®, OS / 2®, UNIX®, LINUX®, or another known operating system for handling input signals. The input component 1110 may send aspects of these input signals to other components of the device 1105 for processing. For example, the input component 1110 may send input signals to the communications manager 1120 to support stochastic shaping based on block codes. In some cases, the input component 1110 may be a component of the I / O controller 1410 as described with reference to FIG. 14 .

[0168] The output component 1115 may manage output signals of the device 1105. For example, the output component 1115 may receive signals from other components of the device 1105, such as the communications manager 1120, and may transmit these signals to other components or devices. In some particular examples, the output component 1115 may transmit the output signals for display in a user interface, for storage in a database or data store, for further processing on a server or server cluster, or for any other process in any number of devices or systems. In some cases, the output component 1115 may be a component of an I / O controller 1410 as described with reference to FIG. 14 .

[0169] The communications manager 1120, the input component 1110, the output component 1115, or various combinations or components thereof may be examples of means for implementing various aspects of the block code-based stochastic shaping described herein. For example, the communications manager 1120, the input component 1110, the output component 1115, or various combinations or components thereof may support a method for implementing one or more of the functions described herein.

[0170] In some examples, the communications manager 1120, the input components 1110, the output components 1115, or various combinations or components thereof, may be implemented in hardware (e.g., in communications management circuitry). The hardware may include a processor, a DSP, a CPU, an ASIC, an FPGA or other programmable logic device, a microcontroller, discrete gate or transistor logic, discrete hardware components, or any combination thereof configured as or otherwise supporting means for performing the functions described in this disclosure. In some examples, the processor and memory coupled to the processor may be configured to perform one or more of the functions described herein (e.g., by the processor executing instructions stored in the memory).

[0171] Additionally or alternatively, in some examples, the communications manager 1120, the input components 1110, the output components 1115, or various combinations or components thereof may be implemented in code executed by a processor (e.g., as communications management software or firmware). If implemented in code executed by a processor, the functionality of the communications manager 1120, the input components 1110, the output components 1115, or various combinations or components thereof may be performed by a general-purpose processor, DSP, CPU, ASIC, FPGA, microcontroller, or any combination of these or other programmable logic devices (e.g., configured as or otherwise supporting a means for performing the functions described in this disclosure).

[0172] In some examples, the communications manager 1120 may be configured to perform various operations (e.g., receiving, obtaining, monitoring, outputting, transmitting) using or otherwise cooperating with the input component 1110, the output component 1115, or both. For example, the communications manager 1120 may receive information from the input component 1110 and send information to the output component 1115, or may be integrated in combination with the input component 1110, the output component 1115, or both to obtain information, output information, or perform various other operations described herein.

[0173] The communications manager 1120 may support wireless communications in the first device according to examples as disclosed herein. For example, the communications manager 1120 may be configured as or otherwise support a means for generating, based on a set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme. The communications manager 1120 may be configured as or otherwise support a means for encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy the target probability distribution. The communications manager 1120 may be configured as or otherwise support a means for outputting a message based on the set of shaped bits.

[0174] Additionally or alternatively, communications manager 1120 may support wireless communications according to examples disclosed herein. For example, communications manager 1120 may be configured as or otherwise support a means for obtaining a message from a first device by a second device. Communications manager 1120 may be configured as or otherwise support a means for decoding a message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0175] By including or configuring a communications manager 1120 according to examples as described herein, the device 1105 (e.g., a processor controlling or otherwise coupled to the input component 1110, the output component 1115, the communications manager 1120, or a combination thereof) may support techniques for shaping and transmitting information bits and shaping bits, thereby resulting in reduced processing at the receiver side, reduced signaling overhead, more efficient utilization of communications resources, and improved reliability of wireless signaling.

[0176] 12 illustrates a block diagram 1200 of a device 1205 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The device 1205 may be an example of an aspect of the device 1105 described herein, such as a transmitting device or a receiving device. The device 1205 may be an example of a network entity 105 or a UE 115. The device 1205 may include an input component 1210 (e.g., a receiver), an output component 1215 (e.g., a transmitter), and a communications manager 1220. The device 1205 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).

[0177] The input component 1210 may manage input signals for the device 1205. For example, the input component 1210 may identify input signals based on interaction with a modem, keyboard, mouse, touchscreen, or similar device. These input signals may be associated with user input or processing in other components or devices. In some cases, the input component 1210 may utilize an operating system such as iOS®, ANDROID®, MS-DOS®, MS-WINDOWS®, OS / 2®, UNIX®, LINUX®, or another known operating system for handling input signals. The input component 1210 may send aspects of these input signals to other components of the device 1205 for processing. For example, the input component 1210 may send input signals to the communications manager 1220 to support stochastic shaping based on block codes. In some cases, the input component 1210 may be a component of the I / O controller 1410 as described with reference to FIG. 14 .

[0178] Output component 1215 may manage output signals of device 1205. For example, output component 1215 may receive signals from other components of device 1205, such as communications manager 1220, and may transmit these signals to other components or devices. In some particular examples, output component 1215 may transmit output signals for display in a user interface, for storage in a database or data store, for further processing on a server or server cluster, or for any other process in any number of devices or systems. In some cases, output component 1215 may be a component of I / O controller 1410 as described with reference to FIG. 14.

[0179] Device 1205, or its various components, may be an example of a means for implementing various aspects of block code-based stochastic shaping described herein. For example, communications manager 1220 may include a shaping bit generation component 1225, a bit encoding component 1230, a message component 1235, a message decoding component 1240, or any combination thereof. Communications manager 1220 may be an example of an aspect of communications manager 1120 described herein. In some examples, communications manager 1220, or its various components, may be configured to perform various operations (e.g., receiving, acquiring, monitoring, outputting, transmitting) using or otherwise cooperating with input component 1210, output component 1215, or both. For example, the communications manager 1220 may receive information from the input component 1210 and send information to the output component 1215, or may be integrated in combination with the input component 1210, the output component 1215, or both to obtain information, output information, or perform various other operations described herein.

[0180] The communications manager 1220 may support wireless communications in the first device according to examples as disclosed herein. The shaping bit generation component 1225 may be configured as, or otherwise support a means for generating, based on a set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme. The bit encoding component 1230 may be configured as, or otherwise support a means for encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy the target probability distribution. The message component 1235 may be configured as, or otherwise support a means for outputting a message based on the set of shaped bits.

[0181] Additionally or alternatively, communications manager 1220 may support wireless communications according to examples disclosed herein. Message component 1235 may be configured as or otherwise support a means for obtaining a message from a first device by a second device. Message decoding component 1240 may be configured as or otherwise support a means for decoding a message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0182] FIG. 13 illustrates a block diagram 1300 of a communications manager 1320 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The communications manager 1320 may be an example of aspects of the communications manager 1120, the communications manager 1220, or both, described herein. The communications manager 1320, or its various components, may be an example of a means for implementing various aspects of the block code-based stochastic shaping described herein. For example, the communications manager 1320 may include a shaping bit generation component 1325, a bit encoding component 1330, a message component 1335, a message decoding component 1340, an encoding scheme component 1345, a mapping component 1350, a shaping component 1355, a bit decoding component 1360, or any combination thereof. Each of these components may communicate directly or indirectly with each other (e.g., via one or more buses).

[0183] The communications manager 1320 may support wireless communications in the first device according to examples as disclosed herein. The shaping bit generation component 1325 may be configured as, or otherwise support a means for generating, based on a set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme. The bit encoding component 1330 may be configured as, or otherwise support a means for encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy the target probability distribution. The message component 1335 may be configured as, or otherwise support a means for outputting a message based on the set of shaped bits.

[0184] In some examples, the coding scheme component 1345 may be configured as or otherwise support a means for determining a block coding scheme associated with a target probability distribution for transmission of a message.

[0185] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling with the second device that schedules the transmission of the message and indicates the block coding scheme, and determining the block coding scheme is based on communicating the control signaling.

[0186] In some examples, the encoding scheme component 1345 may be configured as or otherwise support a means for communicating control signaling that indicates a target probability distribution for a message.

[0187] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling indicating that a message is being generated using a channel coding scheme and a block coding scheme.

[0188] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for determining that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0189] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling indicating the block coding scheme, and the determining is based on the control signaling.

[0190] In some examples, the mapping component 1350 may be configured as or otherwise support a means for determining a mapping of a set of information bits to a set of frozen bit positions and a mapping of a set of shaping bits to a set of information bit positions, and the message is based on the mapping.

[0191] In some examples, the mapping component 1350 may be configured with or otherwise support a means for communicating control signaling indicating the mapping, and the determining is based on communicating the control signaling.

[0192] In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for calculating a set of LLR values ​​based on a target probability distribution. In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for decoding a set of LLR values ​​according to a decoding operation associated with a block coding scheme to generate a plurality of sets of shaping bits.

[0193] In some examples, the set of information bits is mapped to a set of frozen bit positions of a block coding scheme. In some examples, the set of shaping bits is based on a set of decoded LLR values.

[0194] In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for mapping the second set of information bits and the at least one candidate shaped bit to a modulation symbol. In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for determining a conditional distribution based on a target probability distribution. In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for determining an LLR value for the at least one candidate shaped bit based on the second set of information bits and the conditional distribution associated with the modulation symbol, wherein calculating the set of LLR values ​​is based on determining an LLR value for the at least one candidate shaped bit.

[0195] In some examples, the second set of information bits is distributed independently from the distribution of the set of shaped bits according to the encoding.

[0196] In some examples, the shaping bit generation component 1325 may be configured as or otherwise support a means for shaping the second set of the plurality of information bits according to the encoding.

[0197] In some examples, the shaping component 1355 may be configured as or otherwise support a means for generating a plurality of sets of shaped bits using a joint decoder for the block coding scheme and the channel coding scheme based at least in part on a target probability distribution associated with the block coding scheme and a second target probability distribution associated with the channel coding scheme. In some examples, the shaping component 1355 may be configured as or otherwise support a means for applying a channel coding scheme to a plurality of sets of shaped bits, including a set of a plurality of information bits and a set of a plurality of shaping bits, to generate a plurality of sets of parity bits.

[0198] In some examples, the shaping component 1355 may be configured as or otherwise support a means for calculating a first set of LLR values ​​for a block coding scheme based on a target probability distribution. In some examples, the shaping component 1355 may be configured as or otherwise support a means for calculating a second set of LLR values ​​for a channel coding scheme for a decoder associated with the channel coding scheme, the second set of LLR values ​​being based on a second target probability distribution corresponding to the set of multiple parity bits, and the shaping of the set of multiple shaped bits is based on the first set of LLR values ​​and the second set of LLR values.

[0199] Additionally or alternatively, the communications manager 1320 may support wireless communications according to examples disclosed herein. In some examples, the message component 1335 may be configured as or otherwise support a means for obtaining a message from a first device by a second device. The message decoding component 1340 may be configured as or otherwise support a means for decoding a message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0200] In some examples, the coding scheme component 1345 may be configured as or otherwise support a means for determining a block coding scheme associated with a target probability distribution for receipt of a message.

[0201] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling with the first device that schedules the transmission of the message and indicates the block coding scheme, and determining the block coding scheme is based on communicating the control signaling.

[0202] In some examples, the encoding scheme component 1345 may be configured as or otherwise support a means for communicating control signaling that indicates a target probability distribution for a message.

[0203] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling indicating that a message is being generated using a channel coding scheme and a block coding scheme.

[0204] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for determining that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0205] In some examples, the coding scheme component 1345 may be configured with or otherwise support a means for communicating control signaling indicating the block coding scheme, and the determining is based on the control signaling.

[0206] In some examples, the mapping component 1350 may be configured as or otherwise support a means for determining a mapping of a set of information bits to a set of frozen bit positions and a mapping of a set of shaping bits to a set of information bits, and decoding the message is based on the mapping.

[0207] In some examples, the mapping component 1350 may be configured with or otherwise support a means for communicating control signaling indicating the block coding scheme, and the determining is based on the control signaling.

[0208] In some examples, the second set of information bits is distributed independently from the distribution of the set of shaped bits according to a block coding scheme.

[0209] In some examples, the bit decoding component 1360 may be configured as or otherwise support a means for jointly decoding a set of shaped bits including a set of information bits and a second set of information bits in accordance with a forward error correction decoder associated with a channel coding scheme and a block coding scheme, wherein the set of shaped bits includes a set of parity bits associated with the channel coding scheme.

[0210] 14 illustrates a diagram of a system 1400 including a device 1405 supporting block code-based stochastic shaping in accordance with one or more aspects of the present disclosure. The device 1405 may be an example of or may include components of the device 1105, the device 1205, or any transmitting or receiving device described herein. The device 1405 may be an example of a network entity 105 or a UE 115. The device 1405 may include components for two-way voice and data communication, including components for transmitting and receiving communications, such as a communications manager 1420, an I / O controller 1410, a database controller 1415, a memory 1425, a processor 1430, and a database 1435. These components may be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., a bus 1440).

[0211] The I / O controller 1410 may manage the input signals 1445 and output signals 1450 of the device 1405. The I / O controller 1410 may also manage peripheral devices not integrated with the device 1405. In some cases, the I / O controller 1410 may represent a physical connection or port to an external peripheral device. In some cases, the I / O controller 1410 may utilize an operating system such as iOS®, ANDROID®, MS-DOS®, MS-WINDOWS®, OS / 2®, UNIX®, LINUX®, or another known operating system. Additionally or alternatively, the I / O controller 1410 may represent or interact with a modem, keyboard, mouse, touchscreen, or similar device. In some cases, the I / O controller 1410 may be implemented as part of a processor. In some examples, a user may interact with the device 1405 through the I / O controller 1410 or through hardware components controlled by the I / O controller 1410.

[0212] The database controller 1415 may manage the storage and processing of data in the database 1435. The database 1435 may be external to the device 1405, temporarily or permanently connected to the device 1405, or may be a data storage component of the device 1405. In some cases, a user may interact with the database controller 1415. In some other cases, the database controller 1415 may operate automatically without user interaction. The database 1435 may be an example of a persistent data store, a single database, a distributed database, multiple distributed databases, a database management system, or an emergency backup database.

[0213] Memory 1425 may include random-access memory (RAM) and ROM. Memory 1425 may store computer-readable, computer-executable software that includes instructions that, when executed, cause the processor to perform various functions described herein. In some cases, memory 1425 may include a BIOS that may control basic hardware or software operations, such as interaction with peripheral components or devices, among other things.

[0214] The processor 1430 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, a microcontroller, an ASIC, an FPGA, a programmable logic device, discrete gate or transistor logic components, discrete hardware components, or any combination thereof). In some cases, the processor 1430 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 1430. The processor 1430 may be configured to execute computer-readable instructions stored in the memory 1425 to perform various functions (e.g., functions or tasks supporting block code-based stochastic shaping).

[0215] The communications manager 1420 may support wireless communications in the first device according to examples as disclosed herein. For example, the communications manager 1420 may be configured as or otherwise support a means for generating, based on a set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with a block coding scheme. The communications manager 1420 may be configured as or otherwise support a means for encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy the target probability distribution. The communications manager 1420 may be configured as or otherwise support a means for outputting a message based on the set of shaped bits.

[0216] Additionally or alternatively, communications manager 1420 may support wireless communications according to examples disclosed herein. For example, communications manager 1420 may be configured as or otherwise support a means for obtaining a message from a first device by a second device. Communications manager 1420 may be configured as or otherwise support a means for decoding a message to generate a set of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the set of shaped bits including a set of information bits and a set of shaping bits.

[0217] By including or configuring a communications manager 1420 according to examples as described herein, the device 1405 can shape and transmit information bits and shaping bits and support techniques for shaping bits, resulting in reduced processing at the receiver side, reduced signaling overhead, reduced system latency, more efficient utilization of communications resources, improved reliability of wireless signaling, and an improved user experience.

[0218] FIG. 15 illustrates a flow diagram showing a method 1500 for supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The operations of method 1500 may be implemented by a generic device or components thereof as described herein. For example, the operations of method 1500 may be performed by a generic device described with reference to FIGS. 1-14. In some examples, the generic device may execute a set of instructions to control functional elements of the generic device to perform the described functions. Additionally or alternatively, the generic device may use dedicated hardware to perform aspects of the described functions.

[0219] At 1505, the method may include generating, based on the set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with the block coding scheme. The operations of 1505 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1505 may be performed by a shaping bit generation component 1325, as described with reference to FIG. 13 .

[0220] At 1510, the method may include encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy a target probability distribution. The operations of 1510 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1510 may be performed by bit encoding component 1330, as described with reference to FIG. 13.

[0221] At 1515, the method may include outputting a message based on the set of the plurality of shaped bits. The operations of 1515 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1515 may be performed by message component 1335, as described with reference to FIG. 13 .

[0222] FIG. 16 illustrates a flow diagram showing a method 1600 for supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The operations of method 1600 may be implemented by a generic device or components thereof as described herein. For example, the operations of method 1600 may be performed by a generic device described with reference to FIGS. 1-14. In some examples, the generic device may execute a set of instructions to control functional elements of the generic device to perform the described functions. Additionally or alternatively, the generic device may use dedicated hardware to perform aspects of the described functions.

[0223] At 1605, the method may include determining a block coding scheme associated with a target probability distribution for transmission of the message. The operations of 1605 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1605 may be performed by coding scheme component 1345, as described with reference to FIG. 13 .

[0224] At 1610, the method may include generating, based on the set of information bits, a set of shaping bits associated with shaping the set of information bits to a target probability distribution associated with the block coding scheme. The operations of 1610 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1610 may be performed by the shaping bit generation component 1325, as described with reference to FIG. 13 .

[0225] At 1615, the method may include encoding the set of information bits and the set of shaping bits according to a block coding scheme to generate a set of shaped bits that satisfy the target probability distribution. The operations of 1615 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1615 may be performed by bit encoding component 1330, as described with reference to FIG. 13.

[0226] At 1620, the method may include outputting a message based on the set of the plurality of shaped bits. The operations of 1620 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1620 may be performed by message component 1335, as described with reference to FIG. 13 .

[0227] FIG. 17 illustrates a flow diagram showing a method 1700 for supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The operations of method 1700 may be implemented by a generic device or components thereof as described herein. For example, the operations of method 1700 may be performed by a generic device described with reference to FIGS. 1-14. In some examples, the generic device may execute a set of instructions to control functional elements of the generic device to perform the described functions. Additionally or alternatively, the generic device may use dedicated hardware to perform aspects of the described functions.

[0228] At 1705, the method may include obtaining, by the second device, the message from the first device. The operations of 1705 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1705 may be performed by the message component 1335, as described with reference to FIG. 13 .

[0229] At 1710, the method may include decoding the message to generate a plurality of sets of shaped bits that satisfy a target probability distribution associated with the block coding scheme, the plurality of sets of shaped bits including a plurality of sets of information bits and a plurality of sets of shaping bits. The operations of 1710 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1710 may be performed by a message decoding component 1340, as described with reference to FIG. 13.

[0230] FIG. 18 illustrates a flow diagram showing a method 1800 for supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The operations of method 1800 may be implemented by a generic device or components thereof as described herein. For example, the operations of method 1800 may be performed by a generic device described with reference to FIGS. 1-14. In some examples, the generic device may execute a set of instructions to control functional elements of the generic device to perform the described functions. Additionally or alternatively, the generic device may use dedicated hardware to perform aspects of the described functions.

[0231] At 1805, the method may include obtaining, by the second device, the message from the first device. The operations of 1805 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1805 may be performed by the message component 1335, as described with reference to FIG. 13 .

[0232] At 1810, the method may include determining a block coding scheme associated with a target probability distribution for reception of the message. The operations of 1810 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1810 may be performed by coding scheme component 1345, as described with reference to FIG. 13 .

[0233] At 1815, the method may include decoding the message to generate a plurality of sets of shaped bits that satisfy a target probability distribution associated with the block coding scheme, the plurality of sets of shaped bits including a plurality of sets of information bits and a plurality of sets of shaping bits. The operations of 1815 may be performed in accordance with examples disclosed herein. In some examples, aspects of the operations of 1815 may be performed by a message decoding component 1340, as described with reference to FIG. 13.

[0234] FIG. 19 illustrates an example of a network architecture 1900 (e.g., a disaggregated base station architecture, a disaggregated RAN architecture) supporting block code-based probabilistic shaping in accordance with one or more aspects of the present disclosure. The network architecture 1900 may illustrate an example for implementing one or more aspects of the wireless communication system 100. The network architecture 1900 may include one or more CUs 160-a that may communicate directly with the core network 130-a via a backhaul communication link 120-a or indirectly with the core network 130-a via one or more disaggregated network entities 105 (e.g., a quasi-RT RIC 175-b via an E2 link, or a non-RT RIC 175-a associated with an SMO 180-a (e.g., an SMO framework), or both). The CUs 160-a may communicate with one or more DUs 165-a via respective midhaul communication links 162-a (e.g., an F1 interface). The DUs 165-a may communicate with one or more RUs 170-a via respective fronthaul communication links 168-a. The RUs 170-a may be associated with respective coverage areas 110-a and may communicate with the UEs 115-a via one or more communication links 125-a. In some implementations, the UEs 115-a may be served by multiple RUs 170-a simultaneously.

[0235] Each of the network entities 105 (e.g., CU 160-a, DU 165-a, RU 170-a, non-RT RIC 175-a, quasi-RT RIC 175-b, SMO 180-a, Open Cloud (O-Cloud) 205, Open eNBs (O-eNBs) 210) of network architecture 200 may include one or more interfaces or may be coupled with one or more interfaces configured to receive or transmit signals (e.g., data, information) over a wired or wireless transmission medium. Each network entity 105, or an associated processor (e.g., controller) that provides instructions to the interfaces of the network entity 105, may be configured to communicate with one or more of the other network entities 105 over a transmission medium. For example, a network entity 105 may include a wired interface configured to receive or transmit signals to one or more of the other network entities 105 over a wired transmission medium. Additionally or alternatively, the network entity 105 may include a wireless interface, which may include a receiver, a transmitter, or a transceiver (e.g., an RF transceiver), configured to receive and / or transmit signals to one or more of the other network entities 105 via a wireless transmission medium.

[0236] In some examples, the CU 160-a may host one or more higher layer control functions. Such control functions may include RRC, PDCP, SDAP, etc. Each control function may be implemented using an interface configured to communicate signals with other control functions hosted by the CU 160-a. The CU 160-a may be configured to handle user plane functions (e.g., CU-UP), control plane functions (e.g., CU-CP), or a combination thereof. In some examples, the CU 160-a may be logically divided into one or more CU-UP units and one or more CU-CP units. The CU-UP units, when implemented in an O-RAN configuration, may communicate bidirectionally with the CU-CP units via an interface such as an E1 interface. The CU 160-a may be implemented to communicate with the DU 165-a, as needed, for network control and signaling.

[0237] The DU 165-a may correspond to a logical unit including one or more functions (e.g., base station functions, RAN functions) for controlling the operation of one or more RUs 170-a. In some examples, the DU 165-a may at least partially host one or more of the RLC layer, the MAC layer, and one or more aspects of the PHY layer (e.g., higher PHY layers, such as modules for FEC encoding and decoding, scrambling, modulation and demodulation, etc.), at least in part according to a functional division such as that defined by the 3rd Generation Partnership Project (3GPP). In some examples, the DU 165-a may further host one or more lower PHY layers. Each layer (or module) may be implemented with an interface configured to communicate signals with other layers hosted by the DU 165-a or with control functions hosted by the CU 160-a.

[0238] In some examples, lower layer functions may be implemented by one or more RUs 170-a. For example, an RU 170-a controlled by a DU 165-a may correspond to a logical node hosting RF processing functions, low PHY layer functions (such as performing fast Fourier transforms (FFTs), inverse FFTs (iFFTs), digital beamforming, physical random access channel (PRACH) extraction and filtering, etc.), or both, based at least in part on a functional division, such as a lower layer functional division. In such an architecture, an RU 170-a may be implemented to handle over-the-air (OTA) communications with one or more UEs 115-a. In some implementations, real-time and non-real-time aspects of control plane and user plane communications with the RU 170-a may be controlled by the corresponding DU 165-a. In some examples, such a configuration may enable the DU 165-a and CU 160-a to be implemented in a cloud-based RAN architecture, such as a vRAN architecture.

[0239] The SMO 180-a may be configured to support RAN deployment and provisioning of non-virtualized and virtualized network entities 105. For non-virtualized network entities 105, the SMO 180-a may be configured to support deployment of dedicated physical resources for RAN coverage requirements, which may be managed via an operations and maintenance interface (such as an O1 interface). For virtualized network entities 105, the SMO 180-a may be configured to interact with a cloud computing platform (e.g., O-Cloud 205) to perform network entity lifecycle management (e.g., instantiate virtualized network entities 105) via a cloud computing platform interface (e.g., an O2 interface). Such virtualized network entities 105 may include, but are not limited to, a CU 160-a, a DU 165-a, an RU 170-a, and a quasi-RT RIC 175-b. In some implementations, the SMO 180-a may communicate with components configured according to a 4G RAN (e.g., via an O1 interface). Additionally or alternatively, in some implementations, the SMO 180-a may communicate directly with one or more RUs 170-a via an O1 interface. The SMO 180-a may also include a non-RT RIC 175-a configured to support the functionality of the SMO 180-a.

[0240] The non-RT RIC 175-a may be configured to include logic functions that enable non-real-time control and optimization of RAN elements and RAN resources, artificial intelligence (AI) or machine learning (ML) workflows including model training and updates, or policy-based guidance of applications / features in the quasi-RT RIC 175-b. The non-RT RIC 175-a may be coupled to or communicate with the quasi-RT RIC 175-b (e.g., via an A1 interface). The quasi-RT RIC 175-b may be configured to include logic functions that enable near-real-time control and optimization of RAN elements and RAN resources through data collection and action via an interface connecting one or more CUs 160-a, one or more DUs 165-a, or both, and the O-eNB 210 to the quasi-RT RIC 175-b (e.g., via an E2 interface).

[0241] In some examples, the non-RT RIC 175-a may receive parameters or external enrichment information from an external server to generate AI / ML models that are deployed to the quasi-RT RIC 175-b. Such information may be utilized by the quasi-RT RIC 175-b and may be received at the SMO 180-a or the non-RT RIC 175-a from non-network data sources or from network functions. In some examples, the non-RT RIC 175-a or the quasi-RT RIC 175-b may be configured to adjust RAN behavior or performance. For example, the non-RT RIC 175-a may employ AI / ML models to monitor long-term trends and patterns in performance and implement corrective actions through the SMO 180-a (e.g., reconfiguration via O1) or by creating RAN management policies (e.g., A1 policies).

[0242] The following provides a summary of aspects of the present disclosure.

[0243] Aspect 1: A method for wireless communication in a first device, the method including: generating, based at least in part on a plurality of information bits, a plurality of shaping bits associated with shaping the plurality of information bits to a target probability distribution associated with a block coding scheme; encoding the plurality of information bits and the plurality of shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution; and outputting a message based at least in part on the plurality of shaped bits.

[0244] Aspect 2: The method of aspect 1, further comprising determining a block coding scheme associated with a target probability distribution for transmission of the message.

[0245] Aspect 3: The method of aspect 2, further comprising communicating control signaling with the second device that schedules transmission of the message and indicates the block coding scheme, wherein determining the block coding scheme is based at least in part on communicating the control signaling.

[0246] Aspect 4: The method of aspect 3, wherein communicating includes communicating control signaling that indicates a target probability distribution for the message.

[0247] Example 5: The method of example 3 or example 4, wherein communicating includes communicating control signaling indicating that the message is generated using a channel coding scheme and a block coding scheme.

[0248] Aspect 6: The method of any one of aspects 1 to 5, further comprising determining that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0249] Aspect 7: The method of aspect 6, further comprising communicating control signaling indicating the block coding scheme, wherein the determining is based at least in part on the control signaling.

[0250] Aspect 8: The method of any one of aspects 1 to 7, further comprising determining a mapping of a plurality of information bits to a plurality of frozen bit positions and a mapping of a plurality of shaping bits to a plurality of information bit positions, wherein the message is based at least in part on the mapping.

[0251] Aspect 9: The method of aspect 8, further comprising communicating control signaling indicating the mapping, wherein the determining is based at least in part on communicating the control signaling.

[0252] Aspect 10: The method of any of aspects 1 to 9, wherein generating includes calculating a set of LLR values ​​based at least in part on a target probability distribution; and decoding the set of LLR values ​​according to a decoding operation associated with a block coding scheme to generate a plurality of shaping bits.

[0253] Example 11: The method of example 10, wherein a plurality of information bits are mapped to a plurality of frozen bit positions of a block coding scheme, and the plurality of shaping bits are based at least in part on a set of decoded LLR values.

[0254] Aspect 12: The method of aspect 10 or 11, wherein the calculating includes mapping a second plurality of information bits and at least one candidate shaped bit to a modulation symbol, determining a conditional distribution based at least in part on a target probability distribution, and determining an LLR value for the at least one candidate shaped bit based at least in part on the second plurality of information bits and the conditional distribution associated with the modulation symbol, and wherein calculating the set of LLR values ​​is based at least in part on determining the LLR value for the at least one candidate shaped bit.

[0255] Example 13: The method of example 12, wherein the second plurality of information bits are distributed independently from the distribution of the plurality of shaped bits according to the encoding.

[0256] Example 14: The method of example 12 or example 13, further comprising shaping the second plurality of information bits according to the encoding.

[0257] Aspect 15: The method of any one of aspects 1 to 14, wherein the encoding includes: shaping the plurality of shaped bits using a joint decoder for the block coding scheme and the channel coding scheme; and applying a channel coding scheme to the plurality of shaped bits, including the plurality of information bits and the plurality of shaping bits, using the joint decoder for the block coding scheme and the channel coding scheme based at least in part on a target probability distribution associated with the block coding scheme and a second target probability distribution associated with the channel coding scheme, to generate a plurality of parity bits.

[0258] Aspect 16: The method of aspect 15, further comprising: calculating a first set of LLR values ​​for a block coding scheme based at least in part on a target probability distribution; and calculating a second set of LLR values ​​for a channel coding scheme for a decoder associated with the channel coding scheme, the second set of LLR values ​​being based at least in part on a second target probability distribution corresponding to a plurality of parity bits, wherein the shaping of the plurality of shaped bits is based at least in part on the first set of LLR values ​​and the second set of LLR values.

[0259] Aspect 17: A method for wireless communication, comprising: obtaining, by a second device, a message from a first device; and decoding the message to generate a plurality of shaped bits that satisfy a target probability distribution associated with a block coding scheme, wherein the plurality of shaped bits comprises a plurality of information bits and a plurality of shaping bits.

[0260] Example 18: The method of example 17, further comprising determining a block coding scheme associated with a target probability distribution for receiving the message.

[0261] Aspect 19: The method of aspect 18, further comprising communicating control signaling with the first device that schedules transmission of the message and indicates the block coding scheme, wherein determining the block coding scheme is based at least in part on communicating the control signaling.

[0262] Example 20: The method of example 19, wherein communicating includes communicating control signaling that indicates a target probability distribution for the message.

[0263]

[0041] Aspect 21: The method of aspect 19 or 20, wherein communicating includes communicating control signaling indicating that the message is generated using a channel coding scheme and a block coding scheme.

[0264] Aspect 22: The method of any one of aspects 17 to 21, further comprising determining that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

[0265] Aspect 23: The method of aspect 22, further comprising communicating control signaling indicating the block coding scheme, wherein the determining is based at least in part on the control signaling.

[0266] Aspect 24: The method of any one of aspects 17 to 23, further comprising determining a mapping of a plurality of information bits to a plurality of frozen bit positions and a mapping of a plurality of shaping bits to a plurality of information bits, wherein decoding the message is based at least in part on the mapping.

[0267]

[0071] Aspect 25: The method of aspect 24, further comprising communicating control signaling indicating the block coding scheme, wherein the determining is based at least in part on the control signaling.

[0268] Example 26: The method of example 24 or 25, wherein the second plurality of information bits are distributed independently from the distribution of the plurality of shaped bits according to the block coding scheme.

[0269] Aspect 27: The method of any one of aspects 17 to 26, further comprising jointly decoding a plurality of shaped bits including a plurality of information bits and a second plurality of information bits according to a forward error correction decoder associated with a channel coding scheme and a block coding scheme, wherein the plurality of shaped bits include a plurality of parity bits associated with the channel coding scheme.

[0270] Aspect 28: An apparatus for wireless communication in a first device, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method described in any of aspects 1 to 16.

[0271] Aspect 29: An apparatus for wireless communication in a first device, the apparatus comprising at least one means for performing the method of any of aspects 1-16.

[0272] Aspect 30: A non-transitory computer-readable medium storing code for wireless communication in a first device, the code including instructions executable by a processor to perform a method described in any of aspects 1 to 16.

[0273] Aspect 31: An apparatus for wireless communication, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method described in any of aspects 17 to 27.

[0274] Aspect 32: An apparatus for wireless communication, comprising at least one means for performing the method of any of aspects 17 to 27.

[0275] Aspect 33: A non-transitory computer-readable medium storing code for wireless communication, the code including instructions executable by a processor to perform a method described in any of aspects 17 to 27.

[0276] It should be noted that the methods described herein describe possible implementations, that operations and steps may be rearranged or otherwise modified, and that other implementations are possible. Furthermore, aspects from two or more of these methods may be combined.

[0277] Although aspects of an LTE, LTE-A, LTE-A Pro, or NR system may be described as examples, and LTE, LTE-A, LTE-A Pro, or NR terminology may be used throughout much of the description, the techniques described herein may be applicable to networks other than LTE, LTE-A, LTE-A Pro, or NR. For example, the techniques described may be applicable to various other wireless communication systems, such as Ultra Mobile Broadband (UMB), Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, and other systems and radio technologies not explicitly mentioned herein.

[0278] The information and signals described herein may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referred to throughout the specification may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0279] The various illustrative blocks and components described in connection with the disclosure herein may be implemented or performed using a general-purpose processor, a DSP, an ASIC, a CPU, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but alternatively, the processor may be any processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration).

[0280] The functions described herein may be implemented using hardware, software executed by a processor, firmware, or any combination thereof. If implemented using software executed by a processor, the functions may be stored on or transmitted using one or more instructions or code on a computer-readable medium. Other examples and implementations are within the scope of this disclosure and the appended claims. For example, due to the nature of software, the functions described herein may be implemented using software executed by a processor, hardware, firmware, hardwiring, or any combination thereof. Features implementing the functions may also be physically located in various locations, including being distributed such that portions of the functions are implemented in different physical locations.

[0281] Computer-readable media includes both non-transitory computer storage media and communication media, including any medium that facilitates transfer of a computer program from one location to another. Non-transitory storage media may be any available medium that can be accessed by a general-purpose or special-purpose computer. By way of example, and not limitation, non-transitory computer-readable media may include RAM, ROM, electrically erasable programmable ROM (EEPROM), flash memory, compact disk (CD) ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other non-transitory medium that may be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included within the definition of computer-readable media. As used herein, disk and disc include CDs, laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs. A disk can reproduce data magnetically, and a disc can reproduce data optically using a laser. Combinations of the above are also included within the scope of computer-readable media.

[0282] As used herein, including the claims, "or" as used in a list of items (e.g., a list of items followed by a phrase such as "at least one of" or "one or more of") indicates an inclusive list, such as, for example, a list of at least one of A, B, or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). Also, as used herein, the phrase "based on" should not be construed as a reference to a closed set of conditions. For example, an example step described as "based on condition A" could be based on both condition A and condition B without departing from the scope of the present disclosure. In other words, as used herein, the phrase "based on" is to be construed in the same manner as the phrase "based at least in part on (").

[0283] The terms "determine" or "determining" encompass various actions, and thus "determining" can include calculating, computing, processing, deriving, investigating, looking up (such as via looking up in a table, database, or other data structure), ascertaining, etc. "Determining" can also include receiving (e.g., receiving information), accessing (e.g., accessing data stored in a memory), etc. "Determining" can also include resolving, obtaining, selecting, choosing, establishing, and other such similar actions.

[0284] In the accompanying figures, similar components or features may have the same reference label. Furthermore, various components of the same type may be distinguished by following the reference label with a dash and a second label that distinguishes between the similar components. If only a first reference label is used herein, the specification is applicable to any of the similar components having the same first reference label, regardless of a second reference label, or other subsequent reference label.

[0285] The descriptions set forth herein with reference to the accompanying drawings describe exemplary configurations and do not necessarily represent all examples that may be implemented or that are within the scope of the claims. As used herein, the term "example" means "serving as an example, instance, or illustration" and does not mean "preferred" or "advantageous over other examples." The detailed description includes specific details for the purpose of providing an understanding of the described techniques. However, these techniques may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the described examples.

[0286] The description herein is provided to enable any person skilled in the art to make or use the disclosure. Various modifications of the disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the scope of the disclosure. Thus, the disclosure is not limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. 1. An apparatus for wireless communication in a first device, comprising: a processor; a memory coupled to the processor, the processor comprising: generating, based at least in part on the plurality of information bits, a plurality of shaping bits associated with shaping the plurality of information bits to a target probability distribution associated with a block coding scheme; encoding the information bits and the shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution; and outputting a message based at least in part on the plurality of shaped bits.

2. The processor: The apparatus of claim 1 , further configured to determine the block coding scheme associated with the target probability distribution for transmission of the message.

3. The processor:

3. The apparatus of claim 2, further configured to communicate control signaling with a second device that schedules transmission of the message and indicates the block coding scheme, the block coding scheme being determined based at least in part on the control signaling.

4. The processor: The apparatus of claim 3 , further configured to communicate the control signaling indicating the target probability distribution for the message.

5. The processor: The apparatus of claim 3 , further configured to communicate the control signaling indicating that the message is generated using a channel coding scheme and the block coding scheme.

6. The processor:

10. The apparatus of claim 1, further configured to determine that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

7. The processor: The apparatus of claim 6 , further configured to communicate control signaling indicating the block coding scheme, the block coding scheme being determined based at least in part on the control signaling.

8. The processor:

2. The apparatus of claim 1, further configured to determine a mapping of the plurality of information bits to a plurality of frozen bit positions and a mapping of the plurality of shaping bits to a plurality of information bit positions, wherein the message is based at least in part on the mapping.

9. The processor: The apparatus of claim 8 , further configured to communicate control signaling indicating the mapping, the mapping being determined based at least in part on the control signaling.

10. The processor: calculating a set of log-likelihood ratio values ​​based at least in part on the target probability distribution; The apparatus of claim 1 , further configured to: decode the set of log-likelihood ratio values ​​according to a decoding operation associated with the block coding scheme to generate the plurality of shaping bits.

11. A plurality of information bits are mapped to a plurality of frozen bit positions of the block coding scheme; The apparatus of claim 10 , wherein the plurality of shaping bits are based at least in part on the set of decoded log-likelihood ratio values.

12. The processor: mapping the second plurality of information bits and the at least one candidate shaped bit to modulation symbols; determining a conditional distribution based at least in part on the target probability distribution; 11. The apparatus of claim 10, further configured to determine a log-likelihood ratio value for the at least one candidate shaped bit based at least in part on the second plurality of information bits and the conditional distribution associated with the modulation symbol, wherein the set of log-likelihood ratio values ​​is calculated based at least in part on determining the log-likelihood ratio value for the at least one candidate shaped bit.

13. 13. The apparatus of claim 12, wherein the second plurality of information bits are distributed independently from a distribution of the plurality of shaped bits according to the encoding.

14. The processor:

13. The apparatus of claim 12, further configured to shape the second plurality of information bits according to the encoding.

15. The processor: generating the plurality of shaped bits using a joint decoder for the block coding scheme and the channel coding scheme based at least in part on the target probability distribution associated with the block coding scheme and a second target probability distribution associated with a channel coding scheme; 10. The apparatus of claim 1, further configured to apply a channel coding scheme to the plurality of shaped bits comprising the plurality of information bits and the plurality of shaping bits to generate a plurality of parity bits.

16. The processor: calculating a first set of log-likelihood ratio values ​​for the block coding scheme based at least in part on the target probability distribution; 16. The apparatus of claim 15, further configured to calculate a second set of log-likelihood ratio values ​​of the channel coding scheme for the joint decoder associated with the channel coding scheme, the second set of log-likelihood ratio values ​​being based at least in part on the second target probability distribution corresponding to the plurality of parity bits, wherein the plurality of shaped bits are shaped based at least in part on the first set of log-likelihood ratio values ​​and the second set of log-likelihood ratio values.

17. The apparatus of claim 1 , wherein the processor further comprises one or more antenna arrays for outputting the messages.

18. 1. An apparatus for wireless communication, comprising: a processor; a memory coupled to the processor, the processor comprising: Get the message, 1. An apparatus configured to decode the message to generate a plurality of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the plurality of shaped bits comprising a plurality of information bits and a plurality of shaping bits.

19. The processor:

20. The apparatus of claim 18, further configured to determine the block coding scheme associated with the target probability distribution for receipt of the message.

20. The processor:

20. The apparatus of claim 19, further configured to communicate control signaling with a first device that schedules transmission of the message and indicates the block coding scheme, the block coding scheme being determined based at least in part on the control signaling.

21. The processor:

21. The apparatus of claim 20, further configured to communicate the control signaling indicating the target probability distribution for the message.

22. The processor:

21. The apparatus of claim 20, further configured to communicate the control signaling indicating that the message is generated using a channel coding scheme and the block coding scheme.

23. The processor:

20. The apparatus of claim 18, further configured to determine that the block coding scheme is one of a polar coding scheme, a low-density generator matrix coding scheme, a convolutional coding scheme, a turbo coding scheme, a Reed-Muller coding scheme, an algebraic coding scheme, or any combination thereof.

24. The processor:

24. The apparatus of claim 23, further configured to communicate control signaling indicating the block coding scheme, the block coding scheme being determined based at least in part on the control signaling.

25. The processor:

20. The apparatus of claim 18, further configured to determine a mapping of the plurality of information bits to a plurality of frozen bit positions and a mapping of the plurality of shaping bits to a plurality of information bits, and wherein to decode the message, the processor is further configured to decode the message based at least in part on the mapping.

26. The processor:

26. The apparatus of claim 25, further configured to communicate control signaling indicating the block coding scheme, the mapping being determined based at least in part on the control signaling.

27. 26. The apparatus of claim 25, wherein a second plurality of information bits is distributed independently from a distribution of the plurality of shaped bits according to the block coding scheme.

28. The processor:

28. The apparatus of claim 27, further configured to jointly decode the plurality of shaped bits comprising the plurality of information bits and the second plurality of information bits in accordance with a channel coding scheme and a forward error correction decoder associated with the block coding scheme, wherein the plurality of shaped bits comprises a plurality of parity bits associated with the channel coding scheme.

29. 1. A method for wireless communication in a first device, comprising: generating, based at least in part on a plurality of information bits, a plurality of shaping bits associated with shaping the plurality of information bits to a target probability distribution associated with a block coding scheme; encoding the information bits and the shaping bits according to the block coding scheme to generate a plurality of shaped bits that satisfy the target probability distribution; and outputting a message based at least in part on the plurality of shaped bits.

30. 1. A method for wireless communication, comprising: Retrieving messages; decoding the message to generate a plurality of shaped bits that satisfy a target probability distribution associated with a block coding scheme, the plurality of shaped bits comprising a plurality of information bits and a plurality of shaping bits.

Images