Probabilistic amplitude shaping over multiple dimensions
By applying probabilistic amplitude shaping over multiple dimensions to higher-order constellations, the method addresses symbol errors and phase noise, enhancing signal quality and reliability in wireless communications.
Patent Information
- Application Number
- PCT/CN2024/097479
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-06-05
- Publication Date
- 2025-12-11
AI Technical Summary
Challenges exist in applying probabilistic amplitude shaping to higher-order constellations, such as hexagonal or octagonal QAM constellations, due to their non-equivalent one-dimensional representations, leading to symbol errors from phase noise in AWGN channels, and existing techniques struggle to improve signal quality and reliability.
Probabilistic amplitude shaping is applied over multiple dimensions by converting constellation points to amplitude pairs and using arithmetic coding to distribute bits according to a probability distribution, enabling effective shaping for higher-order constellations.
This approach enhances wireless communication performance by reducing power consumption, increasing signal quality, and improving reliability, particularly in AWGN channels, through more efficient use of constellation points.
Smart Images

Figure CN2024097479_11122025_PF_FP_ABST
Abstract
Description
PROBABILISTIC AMPLITUDE SHAPING OVER MULTIPLE DIMENSIONS
[0001] INTRODUCTION
[0002] Field of the Disclosure
[0003] Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for digital modulation and demodulation.
[0004] Description of Related Art
[0005] Wireless communications systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, broadcasts, or other similar types of services. These wireless communications systems may employ multiple-access technologies capable of supporting communications with multiple users by sharing available wireless communications system resources with those users.
[0006] Although wireless communications systems have made great technological advancements over many years, challenges still exist. For example, complex and dynamic environments can still attenuate or block signals between wireless transmitters and wireless receivers. Accordingly, there is a continuous desire to improve the technical performance of wireless communications systems, including, for example: improving speed and data carrying capacity of communications, improving efficiency of the use of shared communications mediums, reducing power used by transmitters and receivers while performing communications, improving reliability of wireless communications, avoiding redundant transmissions and / or receptions and related processing, improving the coverage area of wireless communications, increasing the number and types of devices that can access wireless communications systems, increasing the ability for different types of devices to intercommunicate, increasing the number and type of wireless communications mediums available for use, and the like. Consequently, there exists a need for further improvements in wireless communications systems to overcome the aforementioned technical challenges and others.SUMMARY
[0007] One aspect provides a method for wireless communications by an apparatus. The method includes determining a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, based on one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation; mapping the set of amplitude pairs to a set of bits; modulating a signal based at least in part on the set of bits according to the digital modulation scheme; and outputting the signal.
[0008] Another aspect provides a method for wireless communications by an apparatus. The method includes obtaining a signal; demodulating the signal into a set of bits according to a digital modulation scheme; and decoding the set of bits into one or more information bits based on the set of bits mapping to a set of amplitude pairs, in a constellation of the digital modulation scheme, according to a probability distribution, based on the one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation.
[0009] Other aspects provide: one or more apparatuses operable, configured, or otherwise adapted to perform any portion of any method described herein (e.g., such that performance may be by only one apparatus or in a distributed fashion across multiple apparatuses) ; one or more non-transitory, computer-readable media comprising instructions that, when executed by one or more processors of one or more apparatuses, cause the one or more apparatuses to perform any portion of any method described herein (e.g., such that instructions may be included in only one computer-readable medium or in a distributed fashion across multiple computer-readable media, such that instructions may be executed by only one processor or by multiple processors in a distributed fashion, such that each apparatus of the one or more apparatuses may include one processor or multiple processors, and / or such that performance may be by only one apparatus or in a distributed fashion across multiple apparatuses) ; one or more computer program products embodied on one or more computer-readable storage media comprising code for performing any portion of any method described herein (e.g., such that code may be stored in only one computer-readable medium or across computer-readable media in a distributed fashion) ; and / or one or more apparatuses comprising one or more means for performing any portion of any method described herein (e.g., such that performance would be by only one apparatus or by multiple apparatuses in a distributed fashion) . By way of example, an apparatus may comprise a processing system, a device with a processing system, or processing systems cooperating over one or more networks. An apparatus may comprise one or more memories; and one or more processors configured to cause the apparatus to perform any portion of any method described herein. In some examples, one or more of the processors may be preconfigured to perform various functions or operations described herein without requiring configuration by software.
[0010] The following description and the appended figures set forth certain features for purposes of illustration.BRIEF DESCRIPTION OF DRAWINGS
[0011] The appended figures depict certain features of the various aspects described herein and are not to be considered limiting of the scope of this disclosure.
[0012] FIG. 1 depicts an example wireless communications network.
[0013] FIG. 2 depicts an example disaggregated base station architecture.
[0014] FIG. 3 depicts aspects of an example base station and an example user equipment (UE) .
[0015] FIGS. 4A, 4B, 4C, and 4D depict various example aspects of data structures for a wireless communications network.
[0016] FIG. 5 depicts an example transmitter chain and an example receiver chain for orthogonal frequency division multiplexing communications.
[0017] FIG. 6A depicts example operations for probabilistic amplitude shaping over multiple dimensions.
[0018] FIG. 6B depicts an example constellation associated with amplitude pairs.
[0019] FIG. 7A depicts an example of distribution matching for probabilistic amplitude shaping of amplitude pairs.
[0020] FIG. 7B depicts an example of probabilistic amplitude shaping of amplitude pairs in a quadrant of a two-dimensional constellation.
[0021] FIG. 8 depicts a process flow for probabilistic amplitude shaping over multiple dimensions.
[0022] FIG. 9 depicts a method for wireless communications.
[0023] FIG. 10 depicts another method for wireless communications.
[0024] FIG. 11 depicts aspects of an example communications device.
[0025] FIG. 12 depicts aspects of an example communications device.DETAILED DESCRIPTION
[0026] Aspects of the present disclosure provide apparatuses, methods, processing systems, and computer-readable mediums for probabilistic amplitude shaping over multiple dimensions.
[0027] Certain wireless communications systems apply digital modulation to convey information via radio waves. Digital modulation is the process by which digital information (e.g., a bit stream) is converted to certain waveform (s) that correspond to symbol (s) . A symbol may be a set of bits from a set of symbols that form an alphabet. Each symbol may correspond to a specific waveform, for example, according to a digital modulation scheme, such as quadrature phase shift keying (QPSK) or quadrature amplitude modulation (QAM) . As an example, the waveforms of QPSK can have four different phase shift states (e.g., four phase shifts of 45°, 135°, 225°, and 315) at the same amplitude, and each state corresponds to a different symbol (e.g., a bit combination of 00, 01, 10, or 11) . In certain cases, the symbols of an alphabet may be represented as points of a constellation, for example, as further described herein with respect to FIG. 6B. Each of the points of the constellation may represent a symbol, such that the polar coordinates of each point (e.g., the magnitude and angle) represent the amplitude and phase of the corresponding symbol waveform.
[0028] In wireless communication systems, higher-order modulation (e.g., QAM) may be combined with binary forward error correction (FEC) in order to facilitate high spectral efficiency for wireless communications. The constellations of certain wireless communications systems may be fixed, such that each constellation point may be used with equal probability. When the input is uniformly distributed across the points of the constellation for an additive white-Gaussian noise (AWGN) channel, a gap can arise between the channel capacity of Gaussian inputs and the channel capacity of uniform inputs. Such a gap may be referred to as a shaping gap, which can be equivalent to a loss in signal-to-noise ratio (SNR) (e.g., around 1.53 dB for the AWGN channel) . Certain constellation shaping techniques may be performed to reduce or close the shaping gap, such as geometric shaping or probabilistic shaping. Geometric shaping may apply equi-probable signaling with Gaussian-like distributed constellation points. Probabilistic shaping may apply a non-uniform (e.g., Gaussian-like) distribution over constellation points.
[0029] Technical problems for constellation shaping may include, for example, applying effective constellation shaping for certain digital modulation schemes. Certain techniques for probabilistic shaping include, for example, trellis shaping (e.g., which selects a sequence by searching through a trellis diagram) , shell mapping (e.g., which selects a sequence by searching through shells or rings of constellation points) , and probabilistic amplitude shaping. Probabilistic amplitude shaping combines an outer layer of shaping with an inner layer of binary FEC coding to provide a low-complexity and flexible integration with existing bit-interleaved coded modulation (BICM) schemes. Probabilistic amplitude shaping can provide large shaping gain and inherent rate adaptation functionality. Probabilistic amplitude shaping can be applied to one-dimensional constellations (such as amplitude shift keying (ASK) constellations without phase shifts) and square QAM constellations. Probabilistic amplitude shaping can be applied to square QAM constellations due to such constellations having two-dimensional alphabets that can be decomposed into the product of two respective one-dimensional alphabets. In other words, a square QAM constellation can be effectively treated as multiple one-dimensional constellations for the purpose of probabilistic amplitude shaping. However, it may be challenging to apply probabilistic amplitude shaping to certain higher-order constellations, such as non-square QAM constellations (e.g., a constellation that forms a hexagon or octagon) due to such constellations not having equivalent one-dimensional representations. Moreover, such higher-order constellations are susceptible to symbol errors due to phase noise encountered in AWGN channels. Phase noise can cause a constellation point to rotate around the origin and collide with another point. Accordingly, the performance of certain higher-order constellations may be impacted, for example, for AWGN channels.
[0030] Aspects described herein may overcome the aforementioned technical problem (s) , for example, by providing probabilistic amplitude shaping over multiple dimensions that may enable constellation shaping for higher-order constellations, such as constellations that form a hexagon or an octagon. In certain aspects, the points of a constellation of a digital modulation scheme (e.g., QAM) may be converted to amplitude pairs, where each point of the constellation may correspond to an amplitude pair. Probabilistic amplitude shaping may be applied to such amplitude pairs for a bit stream. As an example, a distribution matcher may convert a set of bits from a bit stream to a set of amplitude pairs of a constellation according to a probability distribution, as further described herein with respect to FIG. 7A. In certain aspects, arithmetic coding may be employed to apply the probability distribution across a multi-dimensional constant composition of the amplitude pairs. Arithmetic code may be used in two dimensions (e.g., the pair of amplitudes) to sequentially encode information bits to sequences of amplitude pairs having a target composition that corresponds to the probability distribution.
[0031] Certain techniques for probabilistic amplitude shaping over multiple dimensions described herein may provide various beneficial technical effects and / or advantages. The techniques for probabilistic amplitude shaping over multiple dimensions may enable improved wireless communications performance, such as reduced power consumption, increased signal quality, and / or increased reliability. The improved wireless communication performance may be attributable to the probabilistic amplitude shaping that may distribute the symbols of a bit stream across the points of a constellation according to a probability distribution. As an example, the probabilistic amplitude shaping may use low energy constellation points (e.g., low amplitude) more frequently than high-energy constellation points (e.g., high amplitude) for transmissions, and thus, the probabilistic amplitude shaping may enable reduced power consumption for wireless communications. The probabilistic amplitude shaping may allow a digital modulation to be more robust to phase noise, for example, encountered for AWGN channels, and thus, the probabilistic amplitude shaping may enable increased signal quality and / or increased reliability.
[0032] Introduction to Wireless Communications Networks
[0033] The techniques and methods described herein may be used for various wireless communications networks. While aspects may be described herein using terminology commonly associated with 3G, 4G, 5G, 6G, and / or other generations of wireless technologies, aspects of the present disclosure may likewise be applicable to other communications systems and standards not explicitly mentioned herein.
[0034] FIG. 1 depicts an example of a wireless communications network 100, in which aspects described herein may be implemented.
[0035] Generally, wireless communications network 100 includes various network entities (alternatively, network elements or network nodes) . A network entity is generally a communications device and / or a communications function performed by a communications device (e.g., a user equipment (UE) , a base station (BS) , a component of a BS, a server, etc. ) . As such communications devices are part of wireless communications network 100, and facilitate wireless communications, such communications devices may be referred to as wireless communications devices. For example, various functions of a network as well as various devices associated with and interacting with a network may be considered network entities. Further, wireless communications network 100 includes terrestrial aspects, such as ground-based network entities (e.g., BSs 102) , and non-terrestrial aspects (also referred to herein as non-terrestrial network entities) , such as satellite 140 and / or aerial or spaceborne platform (s) , which may include network entities on-board (e.g., one or more BSs) capable of communicating with other network elements (e.g., terrestrial BSs) and UEs.
[0036] In the depicted example, wireless communications network 100 includes BSs 102, UEs 104, and one or more core networks, such as an Evolved Packet Core (EPC) 160 and 5G Core (5GC) network 190, which interoperate to provide communications services over various communications links, including wired and wireless links.
[0037] FIG. 1 depicts various example UEs 104, which may more generally include: a cellular phone, smart phone, session initiation protocol (SIP) phone, laptop, personal digital assistant (PDA) , satellite radio, global positioning system, multimedia device, video device, digital audio player, camera, game console, tablet, smart device, wearable device, vehicle, electric meter, gas pump, large or small kitchen appliance, healthcare device, implant, sensor / actuator, display, internet of things (IoT) devices, always on (AON) devices, edge processing devices, data centers, or other similar devices. UEs 104 may also be referred to more generally as a mobile device, a wireless device, a station, a mobile station, a subscriber station, a mobile subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a remote device, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, and others.
[0038] BSs 102 wirelessly communicate with (e.g., transmit signals to or receive signals from) UEs 104 via communications links 120. The communications links 120 between BSs 102 and UEs 104 may include uplink (UL) (also referred to as reverse link) transmissions from a UE 104 to a BS 102 and / or downlink (DL) (also referred to as forward link) transmissions from a BS 102 to a UE 104. The communications links 120 may use multiple-input and multiple-output (MIMO) antenna technology, including spatial multiplexing, beamforming, and / or transmit diversity in various aspects.
[0039] BSs 102 may generally include: a NodeB, enhanced NodeB (eNB) , next generation enhanced NodeB (ng-eNB) , next generation NodeB (gNB or gNodeB) , access point, base transceiver station, radio base station, radio transceiver, transceiver function, transmission reception point, and / or others. Each of BSs 102 may provide communications coverage for a respective coverage area 110, which may sometimes be referred to as a cell, and which may overlap in some cases (e.g., small cell 102’ may have a coverage area 110’ that overlaps the coverage area 110 of a macro cell) . A BS may, for example, provide communications coverage for a macro cell (covering relatively large geographic area) , a pico cell (covering relatively smaller geographic area, such as a sports stadium) , a femto cell (relatively smaller geographic area (e.g., a home) ) , and / or other types of cells.
[0040] Generally, a cell may refer to a portion, partition, or segment of wireless communication coverage served by a network entity within a wireless communication network. A cell may have geographic characteristics, such as a geographic coverage area, as well as radio frequency characteristics, such as time and / or frequency resources dedicated to the cell. For example, a specific geographic coverage area may be covered by multiple cells employing different frequency resources (e.g., bandwidth parts) and / or different time resources. As another example, a specific geographic coverage area may be covered by a single cell. In some contexts (e.g., a carrier aggregation scenario and / or multi-connectivity scenario) , the terms “cell” or “serving cell” may refer to or correspond to a specific carrier frequency (e.g., a component carrier) used for wireless communications, and a “cell group” may refer to or correspond to multiple carriers used for wireless communications. As examples, in a carrier aggregation scenario, a UE may communicate on multiple component carriers corresponding to multiple (serving) cells in the same cell group, and in a multi-connectivity (e.g., dual connectivity) scenario, a UE may communicate on multiple component carriers corresponding to multiple cell groups.
[0041] While BSs 102 are depicted in various aspects as unitary communications devices, BSs 102 may be implemented in various configurations. For example, one or more components of a base station may be disaggregated, including a central unit (CU) , one or more distributed units (DUs) , one or more radio units (RUs) , a Near-Real Time (Near-RT) RAN Intelligent Controller (RIC) , or a Non-Real Time (Non-RT) RIC, to name a few examples. In another example, various aspects of a base station may be virtualized. More generally, a base station (e.g., BS 102) may include components that are located at a single physical location or components located at various physical locations. In examples in which a base station includes components that are located at various physical locations, the various components may each perform functions such that, collectively, the various components achieve functionality that is similar to a base station that is located at a single physical location. In some aspects, a base station including components that are located at various physical locations may be referred to as a disaggregated radio access network architecture, such as an Open RAN (O-RAN) or Virtualized RAN (VRAN) architecture. FIG. 2 depicts and describes an example disaggregated base station architecture.
[0042] Different BSs 102 within wireless communications network 100 may also be configured to support different radio access technologies, such as 3G, 4G, and / or 5G. For example, BSs 102 configured for 4G LTE (collectively referred to as Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E-UTRAN) ) may interface with the EPC 160 through first backhaul links 132 (e.g., an S1 interface) . BSs 102 configured for 5G (e.g., 5G NR or Next Generation RAN (NG-RAN) ) may interface with 5GC 190 through second backhaul links 184. BSs 102 may communicate directly or indirectly (e.g., through the EPC 160 or 5GC 190) with each other over third backhaul links 134 (e.g., X2 interface) , which may be wired or wireless.
[0043] Wireless communications network 100 may subdivide the electromagnetic spectrum into various classes, bands, channels, or other features. In some aspects, the subdivision is provided based on wavelength and frequency, where frequency may also be referred to as a carrier, a subcarrier, a frequency channel, a tone, or a subband. For example, 3GPP currently defines Frequency Range 1 (FR1) as including 410 MHz –7125 MHz, which is often referred to (interchangeably) as “Sub-6 GHz” . Similarly, 3GPP currently defines Frequency Range 2 (FR2) as including 24,250 MHz –71,000 MHz, which is sometimes referred to (interchangeably) as a “millimeter wave” ( “mmW” or “mmWave” ) . In some cases, FR2 may be further defined in terms of sub-ranges, such as a first sub-range FR2-1 including 24,250 MHz –52,600 MHz and a second sub-range FR2-2 including 52,600 MHz –71,000 MHz. A base station configured to communicate using mmWave / near mmWave radio frequency bands (e.g., a mmWave base station such as BS 180) may utilize beamforming (e.g., 182) with a UE (e.g., 104) to improve path loss and range.
[0044] The communications links 120 between BSs 102 and, for example, UEs 104, may be through one or more carriers, which may have different bandwidths (e.g., 5, 10, 15, 20, 100, 400, and / or other MHz) , and which may be aggregated in various aspects. Carriers may or may not be adjacent to each other. Allocation of carriers may be asymmetric with respect to DL and UL (e.g., more or fewer carriers may be allocated for DL than for UL) .
[0045] Communications using higher frequency bands may have higher path loss and a shorter range compared to lower frequency communications. Accordingly, certain base stations (e.g., 180 in FIG. 1) may utilize beamforming 182 with a UE 104 to improve path loss and range. For example, BS 180 and the UE 104 may each include a plurality of antennas, such as antenna elements, antenna panels, and / or antenna arrays to facilitate the beamforming. In some cases, BS 180 may transmit a beamformed signal to UE 104 in one or more transmit directions 182’ . UE 104 may receive the beamformed signal from the BS 180 in one or more receive directions 182” . UE 104 may also transmit a beamformed signal to the BS 180 in one or more transmit directions 182” . BS 180 may also receive the beamformed signal from UE 104 in one or more receive directions 182’ . BS 180 and UE 104 may then perform beam training to determine the best receive and transmit directions for each of BS 180 and UE 104. Notably, the transmit and receive directions for BS 180 may or may not be the same. Similarly, the transmit and receive directions for UE 104 may or may not be the same.
[0046] Wireless communications network 100 further includes a Wi-Fi AP 150 in communication with Wi-Fi stations (STAs) 152 via communications links 154 in, for example, a 2.4 GHz and / or 5 GHz unlicensed frequency spectrum.
[0047] Certain UEs 104 may communicate with each other using device-to-device (D2D) communications link 158. D2D communications link 158 may use one or more sidelink channels, such as a physical sidelink broadcast channel (PSBCH) , a physical sidelink discovery channel (PSDCH) , a physical sidelink shared channel (PSSCH) , a physical sidelink control channel (PSCCH) , and / or a physical sidelink feedback channel (PSFCH) .
[0048] EPC 160 may include various functional components, including: a Mobility Management Entity (MME) 162, other MMEs 164, a Serving Gateway 166, a Multimedia Broadcast Multicast Service (MBMS) Gateway 168, a Broadcast Multicast Service Center (BM-SC) 170, and / or a Packet Data Network (PDN) Gateway 172, such as in the depicted example. MME 162 may be in communication with a Home Subscriber Server (HSS) 174. MME 162 is the control node that processes the signaling between the UEs 104 and the EPC 160. Generally, MME 162 provides bearer and connection management.
[0049] Generally, user Internet protocol (IP) packets are transferred through Serving Gateway 166, which itself is connected to PDN Gateway 172. PDN Gateway 172 provides UE IP address allocation as well as other functions. PDN Gateway 172 and the BM-SC 170 are connected to IP Services 176, which may include, for example, the Internet, an intranet, an IP Multimedia Subsystem (IMS) , a Packet Switched (PS) streaming service, and / or other IP services.
[0050] BM-SC 170 may provide functions for MBMS user service provisioning and delivery. BM-SC 170 may serve as an entry point for content provider MBMS transmission, may be used to authorize and initiate MBMS Bearer Services within a public land mobile network (PLMN) , and / or may be used to schedule MBMS transmissions. MBMS Gateway 168 may be used to distribute MBMS traffic to the BSs 102 belonging to a Multicast Broadcast Single Frequency Network (MBSFN) area broadcasting a particular service, and / or may be responsible for session management (start / stop) and for collecting eMBMS related charging information.
[0051] 5GC 190 may include various functional components, including: an Access and Mobility Management Function (AMF) 192, other AMFs 193, a Session Management Function (SMF) 194, and a User Plane Function (UPF) 195. AMF 192 may be in communication with Unified Data Management (UDM) 196.
[0052] AMF 192 is a control node that processes signaling between UEs 104 and 5GC 190. AMF 192 provides, for example, quality of service (QoS) flow and session management.
[0053] Internet protocol (IP) packets are transferred through UPF 195, which is connected to the IP Services 197, and which provides UE IP address allocation as well as other functions for 5GC 190. IP Services 197 may include, for example, the Internet, an intranet, an IMS, a PS streaming service, and / or other IP services.
[0054] In various aspects, a network entity or network node can be implemented as an aggregated base station, as a disaggregated base station, a component of a base station, an integrated access and backhaul (IAB) node, a relay node, a sidelink node, to name a few examples.
[0055] FIG. 2 depicts an example disaggregated base station 200 architecture. The disaggregated base station 200 architecture may include one or more central units (CUs) 210 that can communicate directly with a core network 220 via a backhaul link, or indirectly with the core network 220 through one or more disaggregated base station units (such as a Near-Real Time (Near-RT) RAN Intelligent Controller (RIC) 225 via an E2 link, or a Non-Real Time (Non-RT) RIC 215 associated with a Service Management and Orchestration (SMO) Framework 205, or both) . A CU 210 may communicate with one or more distributed units (DUs) 230 via respective midhaul links, such as an F1 interface. The DUs 230 may communicate with one or more radio units (RUs) 240 via respective fronthaul links. The RUs 240 may communicate with respective UEs 104 via one or more radio frequency (RF) access links. In some implementations, the UE 104 may be simultaneously served by multiple RUs 240.
[0056] Each of the units, e.g., the CUs 210, the DUs 230, the RUs 240, as well as the Near-RT RICs 225, the Non-RT RICs 215 and the SMO Framework 205, may include one or more interfaces or be coupled to one or more interfaces configured to receive or transmit signals, data, or information (collectively, signals) via a wired or wireless transmission medium. Each of the units, or an associated processor or controller providing instructions to the communications interfaces of the units, can be configured to communicate with one or more of the other units via the transmission medium. For example, the units can include a wired interface configured to receive or transmit signals over a wired transmission medium to one or more of the other units. Additionally or alternatively, the units can include a wireless interface, which may include a receiver, a transmitter or transceiver (such as a radio frequency (RF) transceiver) , configured to receive or transmit signals, or both, over a wireless transmission medium to one or more of the other units.
[0057] In some aspects, the CU 210 may host one or more higher layer control functions. Such control functions can include radio resource control (RRC) , packet data convergence protocol (PDCP) , service data adaptation protocol (SDAP) , or the like. Each control function can be implemented with an interface configured to communicate signals with other control functions hosted by the CU 210. The CU 210 may be configured to handle user plane functionality (e.g., Central Unit –User Plane (CU-UP) ) , control plane functionality (e.g., Central Unit –Control Plane (CU-CP) ) , or a combination thereof. In some implementations, the CU 210 can be logically split into one or more CU-UP units and one or more CU-CP units. The CU-UP unit can communicate bidirectionally with the CU-CP unit via an interface, such as the E1 interface when implemented in an O-RAN configuration. The CU 210 can be implemented to communicate with the DU 230, as necessary, for network control and signaling.
[0058] The DU 230 may correspond to a logical unit that includes one or more base station functions to control the operation of one or more RUs 240. In some aspects, the DU 230 may host one or more of a radio link control (RLC) layer, a medium access control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, or the like) depending, at least in part, on a functional split, such as those defined by the 3rd Generation Partnership Project (3GPP) . In some aspects, the DU 230 may further host one or more low PHY layers. Each layer (or module) can be implemented with an interface configured to communicate signals with other layers (and modules) hosted by the DU 230, or with the control functions hosted by the CU 210.
[0059] Lower-layer functionality can be implemented by one or more RUs 240. In some deployments, an RU 240, controlled by a DU 230, may correspond to a logical node that hosts RF processing functions, or low-PHY layer functions (such as performing fast Fourier transform (FFT) , inverse FFT (iFFT) , digital beamforming, physical random access channel (PRACH) extraction and filtering, or the like) , or both, based at least in part on the functional split, such as a lower layer functional split. In such an architecture, the RU (s) 240 can be implemented to handle over the air (OTA) communications with one or more UEs 104. In some implementations, real-time and non-real-time aspects of control and user plane communications with the RU (s) 240 can be controlled by the corresponding DU 230. In some scenarios, this configuration can enable the DU (s) 230 and the CU 210 to be implemented in a cloud-based RAN architecture, such as a vRAN architecture.
[0060] The SMO Framework 205 may be configured to support RAN deployment and provisioning of non-virtualized and virtualized network elements. For non-virtualized network elements, the SMO Framework 205 may be configured to support the 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 elements, the SMO Framework 205 may be configured to interact with a cloud computing platform (such as an open cloud (O-Cloud) 290) to perform network element life cycle management (such as to instantiate virtualized network elements) via a cloud computing platform interface (such as an O2 interface) . Such virtualized network elements can include, but are not limited to, CUs 210, DUs 230, RUs 240 and Near-RT RICs 225. In some implementations, the SMO Framework 205 can communicate with a hardware aspect of a 4G RAN, such as an open eNB (O-eNB) 211, via an O1 interface. Additionally, in some implementations, the SMO Framework 205 can communicate directly with one or more DUs 230 and / or one or more RUs 240 via an O1 interface. The SMO Framework 205 also may include a Non-RT RIC 215 configured to support functionality of the SMO Framework 205.
[0061] The Non-RT RIC 215 may be configured to include a logical function that enables non-real-time control and optimization of RAN elements and resources, Artificial Intelligence / Machine Learning (AI / ML) workflows including model training and updates, or policy-based guidance of applications / features in the Near-RT RIC 225. The Non-RT RIC 215 may be coupled to or communicate with (such as via an A1 interface) the Near-RT RIC 225. The Near-RT RIC 225 may be configured to include a logical function that enables near-real-time control and optimization of RAN elements and resources via data collection and actions over an interface (such as via an E2 interface) connecting one or more CUs 210, one or more DUs 230, or both, as well as an O-eNB, with the Near-RT RIC 225.
[0062] In some implementations, to generate AI / ML models to be deployed in the Near-RT RIC 225, the Non-RT RIC 215 may receive parameters or external enrichment information from external servers. Such information may be utilized by the Near-RT RIC 225 and may be received at the SMO Framework 205 or the Non-RT RIC 215 from non-network data sources or from network functions. In some examples, the Non-RT RIC 215 or the Near-RT RIC 225 may be configured to tune RAN behavior or performance. For example, the Non-RT RIC 215 may monitor long-term trends and patterns for performance and employ AI / ML models to perform corrective actions through the SMO Framework 205 (such as reconfiguration via O1) or via creation of RAN management policies (such as A1 policies) .
[0063] FIG. 3 depicts aspects of an example BS 102 and a UE 104.
[0064] Generally, BS 102 includes various processors (e.g., 318, 320, 330, 338, and 340) , antennas 334a-t (collectively 334) , transceivers 332a-t (collectively 332) , which include modulators and demodulators, and other aspects, which enable wireless transmission of data (e.g., data source 312) and wireless reception of data (e.g., data sink 314) . For example, BS 102 may send and receive data between BS 102 and UE 104. BS 102 includes controller / processor 340, which may be configured to implement various functions described herein related to wireless communications. Note that the BS 102 may have a disaggregated architecture as described herein with respect to FIG. 2.
[0065] Generally, UE 104 includes various processors (e.g., 358, 364, 366, 370, and 380) , antennas 352a-r (collectively 352) , transceivers 354a-r (collectively 354) , which include modulators and demodulators, and other aspects, which enable wireless transmission of data (e.g., retrieved from data source 362) and wireless reception of data (e.g., provided to data sink 360) . UE 104 includes controller / processor 380, which may be configured to implement various functions described herein related to wireless communications.
[0066] In regards to an example downlink transmission, BS 102 includes a transmit processor 320 that may receive data from a data source 312 and control information from a controller / processor 340. The control information may be for the physical broadcast channel (PBCH) , physical control format indicator channel (PCFICH) , physical hybrid automatic repeat request (HARQ) indicator channel (PHICH) , physical downlink control channel (PDCCH) , group common PDCCH (GC PDCCH) , and / or others. The data may be for the physical downlink shared channel (PDSCH) , in some examples.
[0067] Transmit processor 320 may process (e.g., encode and symbol map) the data and control information to obtain data symbols and control symbols, respectively. Transmit processor 320 may also generate reference symbols, such as for the primary synchronization signal (PSS) , secondary synchronization signal (SSS) , PBCH demodulation reference signal (DMRS) , and channel state information reference signal (CSI-RS) .
[0068] Transmit (TX) multiple-input multiple-output (MIMO) processor 330 may perform spatial processing (e.g., precoding) on the data symbols, the control symbols, and / or the reference symbols, if applicable, and may provide output symbol streams to the modulators (MODs) in transceivers 332a-332t. Each modulator in transceivers 332a-332t may process a respective output symbol stream to obtain an output sample stream. Each modulator may further process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. Downlink signals from the modulators in transceivers 332a-332t may be transmitted via the antennas 334a-334t, respectively.
[0069] In order to receive the downlink transmission, UE 104 includes antennas 352a-352r that may receive the downlink signals from the BS 102 and may provide received signals to the demodulators (DEMODs) in transceivers 354a-354r, respectively. Each demodulator in transceivers 354a-354r may condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain input samples. Each demodulator may further process the input samples to obtain received symbols.
[0070] RX MIMO detector 356 may obtain received symbols from all the demodulators in transceivers 354a-354r, perform MIMO detection on the received symbols if applicable, and provide detected symbols. Receive processor 358 may process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data for the UE 104 to a data sink 360, and provide decoded control information to a controller / processor 380.
[0071] In regards to an example uplink transmission, UE 104 further includes a transmit processor 364 that may receive and process data (e.g., for the PUSCH) from a data source 362 and control information (e.g., for the physical uplink control channel (PUCCH) ) from the controller / processor 380. Transmit processor 364 may also generate reference symbols for a reference signal (e.g., for the sounding reference signal (SRS) ) . The symbols from the transmit processor 364 may be precoded by a TX MIMO processor 366 if applicable, further processed by the modulators in transceivers 354a-354r (e.g., for SC-FDM) , and transmitted to BS 102.
[0072] At BS 102, the uplink signals from UE 104 may be received by antennas 334a-t, processed by the demodulators in transceivers 332a-332t, detected by a RX MIMO detector 336 if applicable, and further processed by a receive processor 338 to obtain decoded data and control information sent by UE 104. Receive processor 338 may provide the decoded data to a data sink 314 and the decoded control information to the controller / processor 340.
[0073] Memories 342 and 382 may store data and program codes for BS 102 and UE 104, respectively.
[0074] Scheduler 344 may schedule UEs for data transmission on the downlink and / or uplink.
[0075] In various aspects, BS 102 may be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” may refer to various mechanisms of outputting data, such as outputting data from data source 312, scheduler 344, memory 342, transmit processor 320, controller / processor 340, TX MIMO processor 330, transceivers 332a-t, antenna 334a-t, and / or other aspects described herein. Similarly, “receiving” may refer to various mechanisms of obtaining data, such as obtaining data from antennas 334a-t, transceivers 332a-t, RX MIMO detector 336, controller / processor 340, receive processor 338, scheduler 344, memory 342, and / or other aspects described herein.
[0076] In various aspects, UE 104 may likewise be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” may refer to various mechanisms of outputting data, such as outputting data from data source 362, memory 382, transmit processor 364, controller / processor 380, TX MIMO processor 366, transceivers 354a-t, antenna 352a-t, and / or other aspects described herein. Similarly, “receiving” may refer to various mechanisms of obtaining data, such as obtaining data from antennas 352a-t, transceivers 354a-t, RX MIMO detector 356, controller / processor 380, receive processor 358, memory 382, and / or other aspects described herein.
[0077] In some aspects, a processor may be configured to perform various operations, such as those associated with the methods described herein, and transmit (output) to or receive (obtain) data from another interface that is configured to transmit or receive, respectively, the data.
[0078] In various aspects, artificial intelligence (AI) processors 318 and 370 may perform AI processing for BS 102 and / or UE 104, respectively. The AI processor 318 may include AI accelerator hardware or circuitry such as one or more neural processing units (NPUs) , one or more neural network processors, one or more tensor processors, one or more deep learning processors, etc. The AI processor 370 may likewise include AI accelerator hardware or circuitry. As an example, the AI processor 370 may perform AI- based beam management, AI-based channel state feedback (CSF) , AI-based antenna tuning, and / or AI-based positioning (e.g., non-line of sight positioning prediction) . In some cases, the AI processor 318 may process feedback from the UE 104 (e.g., CSF) using hardware accelerated AI inferences and / or AI training. The AI processor 318 may decode compressed CSF from the UE 104, for example, using a hardware accelerated AI inference associated with the CSF. In certain cases, the AI processor 318 may perform certain RAN-based functions including, for example, network planning, network performance management, energy-efficient network operations, etc.
[0079] FIGS. 4A, 4B, 4C, and 4D depict aspects of data structures for a wireless communications network, such as wireless communications network 100 of FIG. 1.
[0080] In particular, FIG. 4A is a diagram 400 illustrating an example of a first subframe within a 5G (e.g., 5G NR) frame structure, FIG. 4B is a diagram 430 illustrating an example of DL channels within a 5G subframe, FIG. 4C is a diagram 450 illustrating an example of a second subframe within a 5G frame structure, and FIG. 4D is a diagram 480 illustrating an example of UL channels within a 5G subframe.
[0081] Wireless communications systems may utilize orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP) on the uplink and downlink. Such systems may also support half-duplex operation using time division duplexing (TDD) . OFDM and single-carrier frequency division multiplexing (SC-FDM) partition the system bandwidth (e.g., as depicted in FIGS. 4B and 4D) into multiple orthogonal subcarriers. Each subcarrier may be modulated with data. Modulation symbols may be sent in the frequency domain with OFDM and / or in the time domain with SC-FDM.
[0082] A wireless communications frame structure may be frequency division duplex (FDD) , in which, for a particular set of subcarriers, subframes within the set of subcarriers are dedicated for either DL or UL. Wireless communications frame structures may also be time division duplex (TDD) , in which, for a particular set of subcarriers, subframes within the set of subcarriers are dedicated for both DL and UL.
[0083] In FIG. 4A and 4C, the wireless communications frame structure is TDD where D is DL, U is UL, and X is flexible for use between DL / UL. UEs may be configured with a slot format through a received slot format indicator (SFI) (dynamically through DL control information (DCI) , or semi-statically / statically through radio resource control (RRC) signaling) . In the depicted examples, a 10 ms frame is divided into 10 equally sized 1 ms subframes. Each subframe may include one or more time slots. In some examples, each slot may include 12 or 14 symbols, depending on the cyclic prefix (CP) type (e.g., 12 symbols per slot for an extended CP or 14 symbols per slot for a normal CP) . Subframes may also include mini-slots, which generally have fewer symbols than an entire slot. Other wireless communications technologies may have a different frame structure and / or different channels.
[0084] In certain aspects, the number of slots within a subframe (e.g., a slot duration in a subframe) is based on a numerology, which may define a frequency domain subcarrier spacing and symbol duration as further described herein. In certain aspects, given a numerology μ, there are 2μ slots per subframe. Thus, numerologies (μ) 0 to 6 may allow for 1, 2, 4, 8, 16, 32, and 64 slots, respectively, per subframe. In some cases, the extended CP (e.g., 12 symbols per slot) may be used with a specific numerology, e.g., numerology 2 allowing for 4 slots per subframe. The subcarrier spacing and symbol length / duration are a function of the numerology. The subcarrier spacing may be equal to 2μ×15 kHz, where μ is the numerology 0 to 6. As an example, the numerology μ=0 corresponds to a subcarrier spacing of 15 kHz, and the numerology μ=6 corresponds to a subcarrier spacing of 960 kHz. The symbol length / duration is inversely related to the subcarrier spacing. FIGS. 4A, 4B, 4C, and 4D provide an example of a slot format having 14 symbols per slot (e.g., a normal CP) and a numerology μ=2 with 4 slots per subframe. In such a case, the slot duration is 0.25 ms, the subcarrier spacing is 60 kHz, and the symbol duration is approximately 16.67 μs.
[0085] As depicted in FIGS. 4A, 4B, 4C, and 4D, a resource grid may be used to represent the frame structure. Each time slot includes a resource block (RB) (also referred to as physical RBs (PRBs) ) that extends, for example, 12 consecutive subcarriers. The resource grid is divided into multiple resource elements (REs) . The number of bits carried by each RE depends on the modulation scheme including, for example, quadrature phase shift keying (QPSK) or quadrature amplitude modulation (QAM) .
[0086] As illustrated in FIG. 4A, some of the REs carry reference (pilot) signals (RS) for a UE (e.g., UE 104 of FIGS. 1 and 3) . The RS may include demodulation RS (DMRS) and / or channel state information reference signals (CSI-RS) for channel estimation at the UE. The RS may also include beam measurement RS (BRS) , beam refinement RS (BRRS) , and / or phase tracking RS (PT-RS) .
[0087] FIG. 4B illustrates an example of various DL channels within a subframe of a frame. The physical downlink control channel (PDCCH) carries DCI within one or more control channel elements (CCEs) , each CCE including, for example, nine RE groups (REGs) , each REG including, for example, four consecutive REs in an OFDM symbol.
[0088] A primary synchronization signal (PSS) may be within symbol 2 of particular subframes of a frame. The PSS is used by a UE (e.g., 104 of FIGS. 1 and 3) to determine subframe / symbol timing and a physical layer identity.
[0089] A secondary synchronization signal (SSS) may be within symbol 4 of particular subframes of a frame. The SSS is used by a UE to determine a physical layer cell identity group number and radio frame timing.
[0090] Based on the physical layer identity and the physical layer cell identity group number, the UE can determine a physical cell identifier (PCI) . Based on the PCI, the UE can determine the locations of the aforementioned DMRS. The physical broadcast channel (PBCH) , which carries a master information block (MIB) , may be logically grouped with the PSS and SSS to form a synchronization signal (SS) / PBCH block (SSB) , and in some cases, referred to as a synchronization signal block (SSB) . The MIB provides a number of RBs in the system bandwidth and a system frame number (SFN) . The physical downlink shared channel (PDSCH) carries user data, broadcast system information not transmitted through the PBCH such as system information blocks (SIBs) , and / or paging messages.
[0091] As illustrated in FIG. 4C, some of the REs carry DMRS (indicated as R for one particular configuration, but other DMRS configurations are possible) for channel estimation at the base station. The UE may transmit DMRS for the PUCCH and DMRS for the PUSCH. The PUSCH DMRS may be transmitted, for example, in the first one or two symbols of the PUSCH. The PUCCH DMRS may be transmitted in different configurations depending on whether short or long PUCCHs are transmitted and depending on the particular PUCCH format used. UE 104 may transmit sounding reference signals (SRS) . The SRS may be transmitted, for example, in the last symbol of a subframe. The SRS may have a comb structure, and a UE may transmit SRS on one of the combs. The SRS may be used by a base station for channel quality estimation to enable frequency-dependent scheduling on the UL.
[0092] FIG. 4D illustrates an example of various UL channels within a subframe of a frame. The PUCCH may be located as indicated in one configuration. The PUCCH carries uplink control information (UCI) , such as scheduling requests, a channel quality indicator (CQI) , a precoding matrix indicator (PMI) , a rank indicator (RI) , and HARQ ACK / NACK feedback. The PUSCH carries data, and may additionally be used to carry a buffer status report (BSR) , a power headroom report (PHR) , and / or UCI.
[0093] Example OFDM Communications System
[0094] Certain wireless communication systems may be implemented using orthogonal frequency division multiplexing (OFDM) . The fundamental concept of a multicarrier system (such as OFDM) is the division of a data stream into several narrow subcarriers. An OFDM signal is essentially a bundle of narrowband carriers (e.g., subcarriers) transmitted across a carrier bandwidth. Each of the subcarriers conveys information by modulating the phase and / or the amplitude of the subcarrier over a particular symbol duration. For example, each subcarrier may use either phase-shift-keying (PSK) or quadrature-amplitude-modulation (QAM) to convey information.
[0095] FIG. 5 depicts an example wireless communications system 500 including an example transmitter chain and an example receiver chain for OFDM communications between a transmitter 502 and a receiver 504 over a wireless communications channel (hereinafter “the channel 540” ) . In this example, the transmitter 502 modulates a bit stream into symbols according to a digital modulation scheme (e.g., QPSK or QAM) at block 506. The transmitter 502 passes the symbols through a serial-to-parallel converter to divide the symbols into sub-streams at block 508. The sub-streams are mapped to subcarriers through a resource element mapper at block 510. The transmitter 502 determines the in-phase and quadrature components of the time-domain waveform by passing the subcarrier components through an inverse fast Fourier transform (FFT) at block 512. The parallel sub-streams are converted to the time-domain waveform through a parallel-to-serial converter at block 514. After adding a cyclic prefix (CP) to the time-domain waveform at block 516, the resulting signal can be mixed up to a RF carrier frequency and output by an RF transmitter (e.g., an RF front-end) at block 518. The CP provides a guard period to help prevent inter-symbol interference, which may be caused by a propagation channel delay spread, for example.
[0096] The receiver 504 receives the RF signal and then filters and converts the RF signal to a baseband signal via an RF receiver (e.g., an RF front-end) at block 520. The RF signal may be affected by the channel 540, for example, due to various signal propagation effects including path loss, multipath effects, fading, Doppler effects, etc. The baseband signal is converted from an analog signal to a digital signal for demodulation. The digital signal may correspond to the time-domain waveform of the symbols. At block 522, the CP is removed from symbols of the signal. At block 524, the serial stream of symbols is converted to parallel streams of symbols. At block 526, the parallel stream of symbols may be transformed to the frequency domain, for example, using a forward FFT, to recover the amplitude and phase of each subcarrier. The FFT may include any of various types of FFTs, for example, a radix-2 FFT, a radix-4 FFT, a mixed-radix FFT. At block 528, the symbols are translated to resource element (s) .
[0097] At block 530, a channel estimation is performed to determine various signal propagation effects of the channel 540 associated with the subcarriers of the OFDM signal. The channel estimation may include any of various types of channel estimations, for example, a frequency domain minimum mean square error (MMSE) or a time domain MMSE. As an example, the received signal may include pilot values at certain pilot subcarriers (e.g., DMRS) and information modulated in certain data subcarriers. The pilot values and respective position in the frequency domain (e.g., the pilot carrier index) are known to the receiver 504, and with this information, the receiver 504 can estimate the signal propagation effects of the channel 540 on the pilot subcarriers. Hence, the receiver 504 may estimate (e.g., interpolate) the channel values between the pilot subcarriers and the data subcarriers to determine an estimate of signal propagation effects for the data subcarriers.
[0098] At block 532, channel equalization is performed to compensate for the signal propagation effects of the channel 540 using the channel estimation determined at block 530. The channel equalization may include any of various types of channel equalization, for example, MMSE, blind equalization, adaptive median filter, etc. As an example, noise and / or interference as determined from the channel estimation may be filtered from the data subcarriers. In some cases, the channel equalization may compensate for other effects, such as propagation delay, fading, multipath effects, Doppler effects, etc.
[0099] At block 534, the parallel streams of symbols are converted to a serial stream of symbols.
[0100] At block 536, the receiver 504 recovers the transmitted bit stream, for example, by converting the symbols to bits. For each of the equalized symbols, the phase and amplitude may be represented as a constellation point. The constellation points of the symbols may form a constellation of complex values representative of a codeword (e.g., a combination of one or more bits) . The constellation points are demapped (demodulated or decoded) to transform the constellation points into the codeword or decoded information. As the subcarriers are subjected to various signal propagation effects through the channel 540, the constellation points may have errors (e.g., phase and / or magnitude errors) relative to the expected position of the constellation points. The receiver may perform any of various decoding operations to estimate the data conveyed in the constellation points, such as hard decision decoding (demodulation) or soft decision decoding (demodulation) .
[0101] As an example, each received constellation point may be compared to a reference constellation point (for example, using an MMSE-based demodulator or a maximum likelihood-based demodulator) . The receiver 504 may determine the reference constellation point that is closest to the received point, and the codeword that belongs to the closest reference constellation point may be assigned to the received point. The decoded information may include the one or more codewords decoded among the constellation points for the symbols. The information that is encoded at the transmitter and successfully decoded at the receiver may be called mutual information, which may be indicative of the capacity of the channel 540, for example, the data rate or throughput rate. The various types of decoding operations (e.g., a specific type of FFT, channel estimation, channel equalization, and / or demodulation) may be selected based on the performance of the corresponding operation, such as latency (e.g., computation time) , memory usage, number of computations performed, etc.
[0102] Aspects Related to Probabilistic Amplitude Shaping over Multiple Dimensions
[0103] Aspects of the present disclosure provide probabilistic amplitude shaping over multiple dimensions that may enable constellation shaping for higher-order constellations, such as constellations that form a hexagon or an octagon. The techniques of probabilistic amplitude shaping described herein may enable reduced power consumption, increased signal quality, and / or increased reliability of wireless communications.
[0104] FIG. 6A depicts example operations 600A for probabilistic amplitude shaping over multiple dimensions. In this example, the probabilistic amplitude shaping may apply a combination of amplitude shaping and forward error correction (FEC) . The probabilistic amplitude shaping may be performed to convert a bit stream to symbols according to a probability distribution, such as a Maxwell-Boltzmann distribution or a symmetrical distribution. The probabilistic amplitude shaping may be performed for the transmission of information via a transmitter. As an example, the probabilistic amplitude shaping may be performed at block 506 of the example transmitter chain described herein with respect to FIG. 5.
[0105] At block 602, a set of bits from a bit stream may be demultiplexed into a first set of information bits and a second set of information bits. The first set of information bits may be fed to a distribution matcher. In certain cases, the first set of information bits may be uniformly distributed. The second set of information bits may be or include additional information bits used for the FEC, as further described herein.
[0106] At block 604, the first set of information bits may be converted to a set of amplitude pairs via a two-dimensional amplitude shaper according to a probability distribution, as further described herein with respect to FIGS. 7A and 7B. As an example, a sequence uk of k information bits (e.g., uk= (u1, u2, …, uk) ) may be converted to a sequence sn of n amplitude pairs (e.g., sn= (s1, s2, …, sn) ) , where each amplitude pair (si) has two amplitude components (e.g., (a1, a2) ) that represents a point of a constellation. The constellation may be a 2M-ary constellation, such that the constellation has a total of 2M points, and in certain cases, M ≥ 3. Example constellations are further described herein with respect to FIGS. 6B and 7B. The two-dimensional amplitude shaping may provide various beneficial technical effects. The two-dimensional amplitude shaper may enable reduced power consumption, increased signal quality, and / or increased reliability of wireless communications. As an example, the two-dimensional amplitude shaper may provide a set of amplitude pairs that follow a probability distribution that reduces the power consumption for transmission (s) , increases the signal to noise ratio for wireless communications, and / or increases the reliability of wireless communications.
[0107] At block 606, each of the amplitude pairs may be converted to a binary label. The binary label associated with an amplitude pair may be a bit string, such that each of the bit strings for the binary labels corresponds to a respective amplitude pair. For example, the sequence sn of n amplitude pairs may be converted to n bit strings, where each of the bit strings has a length of (M-2) bits (e.g., ) . As discussed, M may be the power for the 2M-ary constellation. Accordingly, each of the n amplitude pairs corresponds to a bit string of (M-2) bits, and the binary labels may total n (M-2) amplitude bits.
[0108] At block 608, a forward error correction (FEC) encoder may generate parity bits using the amplitude bits and the second set of information bits, which may be γn additional information bits. The amplitude bits and the second set of information bits may constitute n (M-2+γ) bits. The amplitude bits and the second set of information bits may be fed to the FEC encoder as input to generate n (2-γ) parity bits (e.g., pn (2-γ) ) .
[0109] At block 610, the parity bits and the second set of information bits may be used to determine sign bits. The parity bits and the second set of information bits are fed to a sign mapper that generates two sign-bit sequences and over {-1, 1} . As an example, a negative sign (-or -1) may correspond to a bit value of 0, and a positive sign (e.g., + or +1) may correspond to a bit value of 1.
[0110] At block 612, the amplitude bits may be converted to the amplitude pairs. In certain cases, the amplitude pairs generated to block 604 may be fed to a multiplier without the additional conversion at block 612. The 2n sign bits are pointwise multiplied with the 2n amplitudes from the n amplitudes pairs of the sequence sn. The resulting points of the constellation may be mapped to symbols for transmission, for example, as described herein with respect to FIG. 5. Note that the transmit chain of FIG. 5 is an example of OFDM communications to facilitate an understanding of an application of the probabilistic amplitude shaping for bits-to-symbol mapping, for example, at block 506; and aspects of the bits-to-symbol mapping enabled via the probabilistic amplitude shaping described herein may be applied to other types of transmit chains.
[0111] Note that the probabilistic amplitude shaping described herein with respect to FIG. 6A is an example of mapping a set of bits to a set of symbols for transmission. Aspects of the present disclosure may apply to the reversal of operations of FIG. 6A, or any aspects related to such operations, for decoding a set of symbols to a set of bits, for example, as performed at block 536 of FIG. 5.
[0112] FIG. 6B depicts an example constellation 600B associated with amplitude pairs. The constellation may include one or more points (e.g., the point 620) arranged on a two-dimensional plane, for example, having a vertical axis 622 and a horizontal axis 624. The points of the constellation may correspond to a set of symbols (e.g., an alphabet) of a digital modulation scheme, such as amplitude shift keying (ASK) , QPSK, or QAM. In certain aspects, each of the points may correspond to a specific bit value among a set of bit combinations or bit values in the alphabet of the digital modulation scheme. In certain cases, the phasor associated with a point may represent the amplitude and phase of a symbol waveform associated with the digital modulation scheme.
[0113] In this example, the constellation 600B has sixteen points (including the point 620) forming a 24-ary constellation for a type of 16-QAM. In certain cases, the constellation 600B may be formed as a non-square constellation. The outermost points of the constellation (e.g., relative to the origin) may form a polygon having more than five sides, such as a hexagon or octagon (which is depicted in FIG. 6B) . Each point of the constellation may correspond to a set of real numbers (e.g., ) , for example, representing a pair of amplitudes (e.g., an amplitude pair) with a sign per amplitude (e.g., (s1a1, s2a2) ) . The pair of amplitudes may include a first amplitude (e.g., a1>0) corresponding to a first coordinate (e.g., the distance from the horizontal axis 624) and a second amplitude (e.g., a2>0) corresponding to a second coordinate (e.g., the distance from the vertical axis 622) . The sign of the first amplitude of the amplitude pair amplitude may be represented as s1∈ {-1, 1} , and the sign of the second amplitude of the amplitude pair may be represented as s2∈ {-1, 1} . As an example, the point 620 may have a first amplitude of 4 with a positive sign (e.g., a1=4 and s1=1) along the horizontal axis 624, and the point 620 may have a second amplitude of 2 with a positive sign (e.g., a2=2 and s2=1) along the vertical axis 622. Accordingly, the points of the constellation for a digital modulation scheme may be logically represented as amplitude pairs that then can be used for multi-dimensional probabilistic amplitude shaping, as described herein with respect to FIG. 6A and 7A.
[0114] FIG. 7A depicts an example of distribution matching 700A for probabilistic amplitude shaping of amplitude pairs. In this example, information bit (s) 702 (e.g., sequence uk of k information bits, where uk= (u1, u2, …, uk) ) are fed to an amplitude shaper 704 to perform distribution matching, such as a low-complexity invertible fixed-length-to-fixed-length distribution matching. The amplitude shaper 704 converts the information bits 702 to a set of amplitude pairs 706 (e.g., a sequence sn of n amplitude pairs, where sn= (s1, s2, …, sn) ) according to a target probability distribution with a rate of Rdm=k / n. The target probability distribution may be or include a Maxwell- Boltzmann distribution. The target probability distribution may be or include a symmetrical probability distribution. In certain aspects, the target probability distribution may be achieved by minimizing or reducing the average energy of the constellation points of the amplitude pairs subject to an entropy constraint. The amplitude pairs may be selected from elements of an alphabet of a digital modulation scheme (e.g., the set of symbols of the alphabet) . In certain aspects, the amplitude shaper 704 may perform constant composition distribution matching, for example, to apply a target probability distribution across an alphabet of amplitude pairs. As an example, the amplitude sharper 704 may be or include an arithmetic coder.
[0115] The amplitude shaper 704 may provide various beneficial technical effects. The amplitude shaper 704 may enable reduced power consumption, increased signal quality, and / or increased reliability of wireless communications. As an example, the amplitude shaper 704 may provide a set of amplitude pairs that follow a probability distribution that reduces the power consumption for transmission (s) (e.g., via a reduced energy of the constellation points) , increases the signal to noise ratio for wireless communications (which may increase the channel capacity) , and / or increases the reliability of wireless communications (e.g., due to the improved signal quality) . In certain aspects, the amplitude shaper 704 may enable the amplitude shaping of higher-order QAM constellations, such as non-square constellations, hexagon constellations, octagon constellations, or the like.
[0116] With respect to constant composition distribution matching, suppose there is an alphabet and a sequence s of elements of the alphabet, where the sequence has a length of n elements. The composition of the sequence s may be expressed as an ordered m-tuple, k (s) , as follows: k (s) =(k1 (s) , k2 (s) , …, km (s) ) (1)
[0117] where ki (s) is the number of occurrences of the given element i of the alphabet (e.g., ) in the sequence s, such that ki (s) =| {j: sj=ai} |. As an example, an alphabet may have a size (e.g., m=2) of two elements (e.g., ) . An example sequence s of six elements of the alphabet may be equal to (1, 1, 1, 1, 3, 3) . Thus, the composition of the sequence s may be equal to (4, 2) , where the composition indicates that there are four occurrences of the element ‘1’ of the alphabet and two occurrences of the element ‘3’ of the alphabet.
[0118] Suppose the set of all length-n sequences over the alphabet have a fixed composition (e.g., a target composition corresponding to a target probability distribution) expressed as: A given composition of the fixed composition set may follow the target probability distribution, such that where may be the target probability distribution over the alphabet Accordingly, the fixed composition may satisfy the following expression: and the total number of sequences having the fixed composition may be given by the following expression as a multinomial coefficient:
[0119] The set of sequences of the fixed composition may be expressed as
[0120] In certain aspects, the alphabet may be associated with specific orderings (e.g., permutations, π) among the elements of the alphabet (e.g., alphabetic ordering, sequential ordering, numeric ordering, or the like) . For example, given the alphabet the alphabet may have an ordering of the element ‘1’ being less than the element ‘3’ (e.g., 1<3) , where the permutation of π (1) =1 and π (3) =3. The alphabet may also have an ordering of 3<1, where π (1) =3 and π (3) =1. In certain aspects, the ordering of the alphabet may be based on the magnitude of the symbols of the alphabet. Accordingly, constant composition sequences can be ordered based on the ordering associated with the alphabet For example, a lexicographical ordering of the constant composition sequences may be as such (1, 1, 1, 1, 3, 3) < (1, 1, 1, 3, 1, 3) < (1, 1, 1, 3, 3, 1) based on the alphabetical ordering associated with the alphabet Such an ordering among the constant compositions sequences may enable arithmetic coding to be used to apply the target probability distribution across an alphabet of amplitude pairs.
[0121] The concept of a composition of a sequence may be applied to amplitude pairs described herein. As an example, a sequence of amplitude pairs ( (1, 3) , (1, 3) , (1, 3) , (3, 1) , (3, 1) , (2, 7) , (7, 2) ) may have a composition of (3, 2, 1, 1) . The multinomial coefficient number according to Expression (2) may provide the total number of sequences of amplitude pairs for a target composition (e.g., according to a target probability distribution) . An ordering may be applied to the alphabet of amplitude pairs, for example, (1, 3) < (3, 1) < (2, 7) < (7, 2) . Thus, arithmetic coding may be used in two dimensions to sequentially encode information bits to sequences of amplitude pairs having a target composition. The arithmetic coding may provide a lossless encoding technique to convert a set of bits (e.g., from a bit stream) to a set of amplitude pairs with a target composition (e.g., a target probability distribution) .
[0122] In certain aspects, arithmetic coding may be used to encode the information bits to a set of amplitude pairs having a target probability distribution using constant composition distribution matching. A k-bit sequence u= (u1, u2, …, uk) may be expressed as a dyadic number, x, (e.g., x∈ [0, 1) ) via binary expansion (e.g., 0. u1u2…uk) . The length (or size) of the bit sequence may be set to a value such that 2k may not exceed the total number of sequences of amplitude pairs of length n having a target composition k* of sequence of amplitude pairs, and the total number of such sequences may be determined by the multinomial coefficient of Expression (2) . The dyadic number of the bit sequence may be fed to an arithmetic coder as input, and the arithmetic coder may output a length-n symbol sequence s of amplitude pairs having a target composition k*.
[0123] To perform the arithmetic code, a prefix composition for a sequence of amplitude pairs may be initialized as where b0=0 and w0=1 for the dyadic number x∈ [bj+1, bj+1+wj+1) . Then, sequentially for k=0, 1, …, n-1, the transition probabilities pAC (·|kj) may be expressed as the composition of the remaining sequence, e.g., k*-kj. The amplitude pair ai is determined if x∈ [bj+1, bj+1+wj+1) . The prefix composition may be updated according to the following expression: kj+1=kj+ei, for example, the i-th position of kj may be increased by 1.
[0124] FIG. 7B depicts an example of probabilistic amplitude shaping 700B of amplitude pairs in a quadrant of a two-dimensional constellation. In this example, arithmetic code may be applied to a bit stream to encode the bit stream as a set of amplitude pairs with a target composition. The alphabet of amplitude pairs may have four elements, such as In certain cases, the alphabet may be the subset of points of a constellation in a positive quadrant (e.g., the constellation 600B of FIG. 6B) . In certain aspects, the alphabet may not be a product of two one-dimensional alphabets, and thus, the resulting target distribution may not factorize into two one-dimensional marginal distributions.
[0125] A first amplitude pair 708 (e.g., a1= (1, 3) ) may have a probability of 0.35 (e.g., ) ; a second amplitude pair 710 (e.g., a2= (3, 1) ) may have a probability of 0.35 (e.g., ) ; a third amplitude pair 712 (e.g., a3= (2, 7) ) may have a probability of 0.15 (e.g., ) ; and a fourth amplitude 714 pair (e.g., a3= (7, 2) may have a probability of 0.15 (e.g., ) . Suppose the set of amplitude pairs has a size of n (e.g., n=100) , there may be 35 occurrences of the symbol corresponding to the first amplitude pair (1, 3) , 35 occurrences of the symbol corresponding to the second amplitude pair (3, 1) , 15 occurrences of the symbol corresponding the third amplitude pair (2, 7) , and 15 occurrences of the symbol corresponding to fourth amplitude pair (7, 2) .
[0126] Example Signaling of Probabilistic Amplitude Shaping over Multiple Dimensions
[0127] FIG. 8 depicts a process flow 800 for signaling of probabilistic amplitude shaping over multiple dimensions in a system between a first wireless communications device (hereinafter “the first wireless device 802” ) and a second wireless communications device (hereinafter “the second wireless device 804” ) . In certain aspects, the first wireless device 802 and / or the second wireless device 804 may be an example of the BS 102 depicted and described with respect to FIGS. 1 and 3 or a disaggregated base station depicted and described with respect to FIG. 2. Similarly, the first wireless device 802 and / or the second wireless device 804 may be an example of UE 104 depicted and described with respect to FIGS. 1 and 3. However, in other aspects, the first wireless device 802 and / or the second wireless device 804 may be another type of wireless communications device, such as those described herein.
[0128] At 806, the first wireless device 802 encodes one or more information bits (e.g., from a bit stream) with probabilistic amplitude shaping. The first wireless device 802 encodes the information bit (s) to a set of bits (e.g., the amplitude bits output at block 606) based on the set of bits mapping to a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, for example, as described herein with respect to FIGS. 6A and 7A. In certain aspects, the first wireless device 802 may perform probabilistic amplitude shaping to convert the information bit (s) to the set of amplitude pairs that follow the probability distribution, for example, as described herein with respect to FIG. 6A. The probabilistic amplitude shaping may enable reduced power consumption, increased signal quality, and / or increased reliability, as described herein. The set of amplitude pairs may be converted to symbols using FEC, for example, as described herein with respect to FIGS. 6A. In certain aspects, the first wireless device 802 may perform arithmetic coding to convert the information bit (s) to the set of amplitude pairs that follow the probability distribution, for example, as described herein with respect to FIG. 7A. The symbols may be modulated to a time-domain waveform for transmission, for example, as described herein with respect to FIG. 5. In certain aspects, the first wireless device 802 may obtain, from the second wireless device 804, an indication of certain information used to encode the information bit (s) , such as the probability distribution, the code rate associated with the parity bits, the constellation, or the like.
[0129] At 808, the first wireless device 802 sends a signal to the second wireless device 804. The signal may be modulated based on the symbols formed from the amplitude pairs according to a digital modulation scheme, such as ASK, QPSK, and / or QAM.
[0130] At 810, the second wireless device 804 decodes the signal based on the probabilistic amplitude shaping applied at 806. In certain aspects, the second wireless device 804 may perform the operations 600A of FIG. 6A, or any related aspects, in reverse. The second wireless device 804 may demodulate the signal into a set of symbols according to the digital modulation scheme, for example, as described herein with respect to FIG. 5. The second wireless device 804 may decode the set of symbols into the information bits based on the probabilistic amplitude shaping. The set of symbols may correspond to a set of bits (e.g., the amplitude bits, sign bits, parity bits, and / or additional information bits) . The second wireless device 804 may decode the set of bits into the information bit (s) based on the set of bits mapping to the set of amplitude pairs in the constellation according to the probability distribution. In certain aspects, the first wireless device 802 may send, to the second wireless device 804, an indication of certain information used to decode the symbols, such as the probability distribution, the code rate, the constellation, or the like.
[0131] Note that the process flow illustrated in FIG. 8 is described herein to facilitate an understanding of multi-dimensional probabilistic amplitude shaping, and aspects of the present disclosure may be performed in various manners via alternative or additional signaling and / or operations. In certain aspects, the operations and / or signaling of FIG. 8 may occur in an order different from that described or depicted, and various actions, operations, and / or signaling may be added, omitted, or combined.
[0132] Example Operations of Probabilistic Amplitude Shaping over Multiple Dimensions
[0133] FIG. 9 shows a method 900 of wireless communications by an apparatus, such as UE 104 of FIGS. 1 and 3, BS 102 of FIGS. 1 and 3, or a disaggregated base station discussed with respect to FIG. 2.
[0134] Method 900 begins at block 905 with determining a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, based on one or more information bits (e.g., the first set of information bits of FIG. 6A) , wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation, for example, as described herein with respect to FIGS. 6A-7B. In certain aspects, each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point, for example, as described herein with respect to FIG. 6B.
[0135] Method 900 then proceeds to block 910 with mapping the set of amplitude pairs to a set of bits (e.g., the amplitude bit (s) of FIG. 6A) . In certain aspects, block 910 includes converting the set of amplitude pairs to the set of bits such that each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs. In certain aspects, mapping the set of amplitude pairs to the set of bits may involve or include the operations 600A of FIG. 6A.
[0136] Method 900 then proceeds to block 915 with modulating a signal based at least in part on the set of bits according to the digital modulation scheme. In certain aspects, the information bit (s) may converted to a set of symbols via the probabilistic amplitude shaping described herein with respect to FIGS. 6A and 7A. The symbols may be modulated into a time-domain waveform, such as the signal, according to the digital modulation scheme.
[0137] Method 900 then proceeds to block 920 with outputting the signal, for example, as described herein with respect to FIGS. 5 and 8.
[0138] In certain aspects, the probability distribution comprises a set of probabilities; the set of points of the constellation form an alphabet of the digital modulation scheme; each element of the alphabet is associated with a probability of the set of probabilities; and each element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability, for example, as described herein with respect to FIG. 7B. In certain aspects, a sequential order is applied among elements of the alphabet. In certain aspects, the probability distribution comprises a Maxwell-Boltzmann probability distribution. In certain aspects, the probability distribution comprises a symmetrical probability distribution. In certain aspects, the set of amplitude pairs may form a constant composition that corresponds to the probability distribution.
[0139] In certain aspects, the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides. In certain aspects, the constellation comprises a non-square constellation.
[0140] In certain aspects, block 905 includes performing arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution.
[0141] In certain aspects, method 900 further includes determining a set of parity bits based on the set of bits and the one or more information bits. In certain aspects, method 900 further includes determining sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits. In certain aspects, block 915 includes modulating the signal further based on the set of amplitude pairs with the sign information.
[0142] In certain aspects, method 900, or any aspect related to it, may be performed by an apparatus, such as communications device 1100 of FIG. 11 or communications device 1200 of FIG. 12, which includes various components operable, configured, or adapted to perform the method 900. Communications device 1100 and communications device 1200 are described below in further detail.
[0143] Note that FIG. 9 is just one example of a method, and other methods including fewer, additional, or alternative operations are possible consistent with this disclosure.
[0144] FIG. 10 shows a method 1000 of wireless communications by an apparatus, such as UE 104 of FIGS. 1 and 3, BS 102 of FIGS. 1 and 3, or a disaggregated base station discussed with respect to FIG. 2.
[0145] Method 1000 begins at block 1005 with obtaining a signal, for example, as described herein with respect to FIGS. 5 and 8.
[0146] Method 1000 then proceeds to block 1010 with demodulating the signal into a set of bits according to a digital modulation scheme. In certain aspects, the signal may be demodulated into a set of symbols, which may correspond to a set of bits.
[0147] Method 1000 then proceeds to block 1015 with decoding the set of bits into one or more information bits based on the set of bits mapping to a set of amplitude pairs, in a constellation of the digital modulation scheme, according to a probability distribution, based on the one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation, for example, as described herein with respect to FIGS. 6A-7B. In certain aspects, each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point, for example, as described herein with respect to FIG. 6B.
[0148] In certain aspects, the probability distribution comprises a set of probabilities; the set of points of the constellation form an alphabet of the digital modulation scheme; each element of the alphabet is associated with a probability of the set of probabilities; and each element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability, for example, as described herein with respect to FIG. 7B. In certain aspects, a sequential order is applied among elements of the alphabet. In certain aspects, the probability distribution comprises a Maxwell-Boltzmann probability distribution. In certain aspects, the probability distribution comprises a symmetrical probability distribution. In certain aspects, the set of amplitude pairs may form a constant composition that corresponds to the probability distribution.
[0149] In certain aspects, the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides. In certain aspects, the constellation comprises a non-square constellation.
[0150] In certain aspects, the set of bits map to the set of amplitude pairs based on arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution. In certain aspects, each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs. In certain aspects, the set of bits indicate a set of parity bits; and the method 1000 further comprises determining the one or more information bits based at least in part on the set of parity bits. In certain aspects, the set of bits indicate sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits. In certain aspects, block 1015 includes decoding the set of bits further based on the set of amplitude pairs with the sign information.
[0151] In certain aspects, method 1000, or any aspect related to it, may be performed by an apparatus, such as communications device 1100 of FIG. 11 or communications device 1200 of FIG. 12, which includes various components operable, configured, or adapted to perform the method 1000. Communications device 1100 and communications device 1200 are described below in further detail.
[0152] Note that FIG. 10 is just one example of a method, and other methods including fewer, additional, or alternative operations are possible consistent with this disclosure.
[0153] Example Communications Devices
[0154] FIG. 11 depicts aspects of an example communications device 1100. In some aspects, communications device 1100 is a user equipment, such as UE 104 described above with respect to FIGS. 1 and 3.
[0155] The communications device 1100 includes a processing system 1105 coupled to a transceiver 1185 (e.g., a transmitter and / or a receiver) . The transceiver 1185 is configured to transmit and receive signals for the communications device 1100 via an antenna 1190, such as the various signals as described herein. The processing system 1105 may be configured to perform processing functions for the communications device 1100, including processing signals received and / or to be transmitted by the communications device 1100.
[0156] The processing system 1105 includes one or more processors 1110. In various aspects, the one or more processors 1110 may be representative of one or more of receive processor 358, transmit processor 364, TX MIMO processor 366, and / or controller / processor 380, as described with respect to FIG. 3. The one or more processors 1110 are coupled to a computer-readable medium / memory 1145 via a bus 1180. In certain aspects, the computer-readable medium / memory 1145 is configured to store instructions (e.g., computer-executable code) , including code 1150-1175, that when executed by the one or more processors 1110, enable and cause the one or more processors 1110 to perform: the method 900 described with respect to FIG. 9, or any aspect related to it, including any operations described in relation to FIG. 9; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it, including any operations described in relation to FIG. 10. Note that reference to a processor performing a function of communications device 1100 may include one or more processors performing that function of communications device 1100, such as in a distributed fashion.
[0157] In the depicted example, computer-readable medium / memory 1145 stores code for determining 1150, code for mapping 1155, code for modulating 1160, code for outputting 1165, code for performing 1170, and code for converting 1175. Processing of the code 1150-1175 may enable and cause the communications device 1100 to perform: the method 900 described with respect to FIG. 9, or any aspect related to it; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it.
[0158] The one or more processors 1110 include circuitry configured to implement (e.g., execute) the code (e.g., executable instructions) stored in the computer-readable medium / memory 1145, including circuitry for determining 1115, circuitry for mapping 1120, circuitry for modulating 1125, circuitry for outputting 1130, circuitry for performing 1135, and circuitry for converting 1140. Processing with circuitry 1115-1140 may enable and cause the communications device 1100 to perform: the method 900 described with respect to FIG. 9, or any aspect related to it; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it.
[0159] More generally, means for communicating, transmitting, sending or outputting for transmission may include the transceivers 354, antenna (s) 352, transmit processor 364, TX MIMO processor 366, AI processor 370, and / or controller / processor 380 of the UE 104 illustrated in FIG. 3, transceiver 1185 and / or antenna 1190 of the communications device 1100 in FIG. 11, and / or one or more processors 1110 of the communications device 1100 in FIG. 11. Means for communicating, receiving or obtaining may include the transceivers 354, antenna (s) 352, receive processor 358, AI processor 370, and / or controller / processor 380 of the UE 104 illustrated in FIG. 3, transceiver 1185 and / or antenna 1190 of the communications device 1100 in FIG. 11, and / or one or more processors 1110 of the communications device 1100 in FIG. 11. Means for determining (including means for encoding and / or means for decoding) , means for mapping, means for modulating (and / or means for demodulating) , means for performing, and / or means for converting may include AI processor 370, and / or controller / processor 380 of the UE 104 illustrated in FIG. 3, and / or one or more processors 1110 of the communications device 1100 in FIG. 11.
[0160] FIG. 12 depicts aspects of an example communications device 1200. In some aspects, communications device 1200 is a network entity, such as BS 102 of FIGS. 1 and 3, or a disaggregated base station as discussed with respect to FIG. 2.
[0161] The communications device 1200 includes a processing system 1205 coupled to a transceiver 1285 (e.g., a transmitter and / or a receiver) and / or a network interface 1295. The transceiver 1285 is configured to transmit and receive signals for the communications device 1200 via an antenna 1290, such as the various signals as described herein. The network interface 1295 is configured to obtain and send signals for the communications device 1200 via communications link (s) , such as a backhaul link, midhaul link, and / or fronthaul link as described herein, such as with respect to FIG. 2. The processing system 1205 may be configured to perform processing functions for the communications device 1200, including processing signals received and / or to be transmitted by the communications device 1200.
[0162] The processing system 1205 includes one or more processors 1210. In various aspects, one or more processors 1210 may be representative of one or more of receive processor 338, transmit processor 320, TX MIMO processor 330, and / or controller / processor 340, as described with respect to FIG. 3. The one or more processors 1210 are coupled to a computer-readable medium / memory 1245 via a bus 1280. In certain aspects, the computer-readable medium / memory 1245 is configured to store instructions (e.g., computer-executable code) , including code 1250-1275, that when executed by the one or more processors 1210, enable and cause the one or more processors 1210 to perform the method 900 described with respect to FIG. 9, or any aspect related to it, including any operations described in relation to FIG. 9; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it, including any operations described in relation to FIG. 10. Note that reference to a processor of communications device 1200 performing a function may include one or more processors of communications device 1200 performing that function, such as in a distributed fashion.
[0163] In the depicted example, the computer-readable medium / memory 1245 stores code for determining 1250, code for mapping 1255, code for modulating 1260, code for outputting 1265, code for performing 1270, and code for converting 1275. Processing of the code 1250-1275 may enable and cause the communications device 1200 to perform: the method 900 described with respect to FIG. 9, or any aspect related to it; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it.
[0164] The one or more processors 1210 include circuitry configured to implement (e.g., execute) the code (e.g., executable instructions) stored in the computer-readable medium / memory 1245, including circuitry for determining 1215, circuitry for mapping 1220, circuitry for modulating 1225, circuitry for outputting 1230, circuitry for performing 1235, and circuitry for converting 1240. Processing with circuitry 1215-1240 may enable and cause the communications device 1200 to perform: the method 900 described with respect to FIG. 9, or any aspect related to it; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it.
[0165] Various components of the communications device 1200 may provide means for performing: the method 900 described with respect to FIG. 9, or any aspect related to it; and / or the method 1000 described with respect to FIG. 10, or any aspect related to it. Means for communicating, transmitting, sending or outputting for transmission may include the transceivers 332, antenna (s) 334, transmit processor 320, TX MIMO processor 330, AI processor 318, and / or controller / processor 340 of the BS 102 illustrated in FIG. 3, transceiver 1285, antenna 1290, and / or network interface 1295 of the communications device 1200 in FIG. 12, and / or one or more processors 1210 of the communications device 1200 in FIG. 12. Means for communicating, receiving or obtaining may include the transceivers 332, antenna (s) 334, receive processor 338, AI processor 318 and / or controller / processor 340 of the BS 102 illustrated in FIG. 3, transceiver 1285, antenna 1290, and / or network interface 1295 of the communications device 1200 in FIG. 12, and / or one or more processors 1210 of the communications device 1200 in FIG. 12. Means for determining (including means for encoding and / or means for decoding) , means for mapping, means for modulating (and / or means for demodulating) , means for performing, and / or means for converting may include AI processor 318 and / or controller / processor 340 of the BS 102 illustrated in FIG. 3, and / or one or more processors 1210 of the communications device 1200 in FIG. 12.
[0166] Example Clauses
[0167] Implementation examples are described in the following numbered clauses:
[0168] Clause 1: A method for wireless communications by an apparatus comprising: determining a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, based on one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation; mapping the set of amplitude pairs to a set of bits; modulating a signal based at least in part on the set of bits according to the digital modulation scheme; and outputting the signal.
[0169] Clause 2: The method of Clause 1, wherein each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point.
[0170] Clause 3: The method of any one of Clauses 1-2, wherein: the probability distribution comprises a set of probabilities; the set of points of the constellation form an alphabet of the digital modulation scheme; each element of the alphabet is associated with a probability of the set of probabilities; and each element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability.
[0171] Clause 4: The method of Clause 3, wherein a sequential order is applied among elements of the alphabet.
[0172] Clause 5: The method of any one of Clauses 1-4, wherein the probability distribution comprises a Maxwell-Boltzmann probability distribution.
[0173] Clause 6: The method of any one of Clauses 1-5, wherein the probability distribution comprises a symmetrical probability distribution.
[0174] Clause 7: The method of any one of Clauses 1-6, wherein the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides.
[0175] Clause 8: The method of any one of Clauses 1-7, wherein the constellation comprises a non-square constellation.
[0176] Clause 9: The method of any one of Clauses 1-8, wherein determining the set of amplitude pairs comprises performing arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution.
[0177] Clause 10: The method of any one of Clauses 1-9, wherein mapping the set of amplitude pairs comprises converting the set of amplitude pairs to the set of bits such that each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs.
[0178] Clause 11: The method of any one of Clauses 1-10, further comprising determining a set of parity bits based on the set of bits and the one or more information bits.
[0179] Clause 12: The method of Clause 11, further comprising determining sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits.
[0180] Clause 13: The method of Clause 12, wherein modulating the signal comprises modulating the signal further based on the set of amplitude pairs with the sign information.
[0181] Clause 14: The method of any one of Clauses 1-13, wherein the set of amplitude pairs form a constant composition that corresponds to the probability distribution.
[0182] Clause 15: A method for wireless communications by an apparatus comprising: obtaining a signal; demodulating the signal into a set of bits according to a digital modulation scheme; and decoding the set of bits into one or more information bits based on the set of bits mapping to a set of amplitude pairs, in a constellation of the digital modulation scheme, according to a probability distribution, based on the one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation.
[0183] Clause 16: The method of Clause 15, wherein each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point.
[0184] Clause 17: The method of any one of Clauses 15-16, wherein: the probability distribution comprises a set of probabilities; the set of points of the constellation form an alphabet of the digital modulation scheme; each element of the alphabet is associated with a probability of the set of probabilities; and each element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability.
[0185] Clause 18: The method of Clause 17, wherein a sequential order is applied among elements of the alphabet.
[0186] Clause 19: The method of any one of Clauses 15-18, wherein the probability distribution comprises a Maxwell-Boltzmann probability distribution.
[0187] Clause 20: The method of any one of Clauses 15-19, wherein the probability distribution comprises a symmetrical probability distribution.
[0188] Clause 21: The method of any one of Clauses 15-20, wherein the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides.
[0189] Clause 22: The method of any one of Clauses 15-21, wherein the constellation comprises a non-square constellation.
[0190] Clause 23: The method of any one of Clauses 15-22, wherein the set of bits map to the set of amplitude pairs based on arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution.
[0191] Clause 24: The method of any one of Clauses 15-23, wherein each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs.
[0192] Clause 25: The method of any one of Clauses 15-24, wherein: the set of bits indicate a set of parity bits; and the method further comprises determining the one or more information bits based at least in part on the set of parity bits.
[0193] Clause 26: The method of Clause 25, wherein the set of bits indicate sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits.
[0194] Clause 27: The method of Clause 26, wherein decoding the set of bits comprises decoding the set of bits further based on the set of amplitude pairs with the sign information.
[0195] Clause 28: The method of any one of Clauses 15-27, wherein the set of amplitude pairs form a constant composition that corresponds to the probability distribution.
[0196] Clause 29: One or more apparatuses, comprising: one or more memories comprising executable instructions; and one or more processors configured to execute the executable instructions and cause the one or more apparatuses to perform a method in accordance with any one of Clauses 1-28.
[0197] Clause 30: One or more apparatuses, comprising: one or more memories; and one or more processors, coupled to the one or more memories, configured to cause the one or more apparatuses to perform a method in accordance with any one of Clauses 1-28.
[0198] Clause 31: One or more apparatuses, comprising: one or more memories; and one or more processors, coupled to the one or more memories, configured to perform a method in accordance with any one of Clauses 1-28.
[0199] Clause 32: One or more apparatuses, comprising means for performing a method in accordance with any one of Clauses 1-28.
[0200] Clause 33: One or more non-transitory computer-readable media comprising executable instructions that, when executed by one or more processors of one or more apparatuses, cause the one or more apparatuses to perform a method in accordance with any one of Clauses 1-28.
[0201] Clause 34: One or more computer program products embodied on one or more computer-readable storage media comprising code for performing a method in accordance with any one of Clauses 1-28.
[0202] Additional Considerations
[0203] The preceding description is provided to enable any person skilled in the art to practice the various aspects described herein. The examples discussed herein are not limiting of the scope, applicability, or aspects set forth in the claims. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. For example, changes may be made in the function and arrangement of elements discussed without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For instance, the methods described may be performed in an order different from that described, and various actions may be added, omitted, or combined. Also, features described with respect to some examples may be combined in some other examples. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover such an apparatus or method that is practiced using other structure, functionality, or structure and functionality in addition to, or other than, the various aspects of the disclosure set forth herein. It should be understood that any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim.
[0204] The various illustrative logical blocks, modules and circuits described in connection with the present disclosure may be implemented or performed with a general purpose processor, an AI processor, a digital signal processor (DSP) , an ASIC, a field programmable gate array (FPGA) or other programmable logic device (PLD) , 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 in the alternative, the processor may be any commercially available 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, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, a system on a chip (SoC) , or any other such configuration.
[0205] As used herein, a phrase referring to “at least one of” a list of items refers to any combination of those items, including single members. As an example, “at least one of: a, b, or c” is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c, as well as any combination with multiples of the same element (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b, b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b, and c) .
[0206] As used herein, the term “determining” encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure) , ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information) , accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing and the like.
[0207] As used herein, “coupled to” and “coupled with” generally encompass direct coupling and indirect coupling (e.g., including intermediary coupled aspects) unless stated otherwise. For example, stating that a processor is coupled to a memory allows for a direct coupling or a coupling via an intermediary aspect, such as a bus.
[0208] The methods disclosed herein comprise one or more actions for achieving the methods. The method actions may be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of actions is specified, the order and / or use of specific actions may be modified without departing from the scope of the claims. Further, the various operations of methods described above may be performed by any suitable means capable of performing the corresponding functions. The means may include various hardware and / or software component (s) and / or module (s) , including, but not limited to a circuit, an application specific integrated circuit (ASIC) , or processor.
[0209] The following claims are not intended to be limited to the aspects shown herein, but are to be accorded the full scope consistent with the language of the claims. Reference to an element in the singular is not intended to mean only one unless specifically so stated, but rather “one or more. ” The subsequent use of a definite article (e.g., “the” or “said” ) with an element (e.g., “the processor” ) is not intended to invoke a singular meaning (e.g., “only one” ) on the element unless otherwise specifically stated. For example, reference to an element (e.g., “a processor, ” “a controller, ” “a memory, ” “a transceiver, ” “an antenna, ” “the processor, ” “the controller, ” “the memory, ” “the transceiver, ” “the antenna, ” etc. ) , unless otherwise specifically stated, should be understood to refer to one or more elements (e.g., “one or more processors, ” “one or more controllers, ” “one or more memories, ” “one more transceivers, ” etc. ) . The terms “set” and “group” are intended to include one or more elements, and may be used interchangeably with “one or more. ” Where reference is made to one or more elements performing functions (e.g., steps of a method) , one element may perform all functions, or more than one element may collectively perform the functions. When more than one element collectively performs the functions, each function need not be performed by each of those elements (e.g., different functions may be performed by different elements) and / or each function need not be performed in whole by only one element (e.g., different elements may perform different sub-functions of a function) . Similarly, where reference is made to one or more elements configured to cause another element (e.g., an apparatus) to perform functions, one element may be configured to cause the other element to perform all functions, or more than one element may collectively be configured to cause the other element to perform the functions. Unless specifically stated otherwise, the term “some” refers to one or more. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims.
Claims
1.An apparatus configured for wireless communications, comprising:one or more memories; andone or more processors coupled to the one or more memories, the one or more processors being configured to cause the apparatus to:determine a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, based on one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation;map the set of amplitude pairs to a set of bits;modulate a signal based at least in part on the set of bits according to the digital modulation scheme; andoutput the signal.2.The apparatus of claim 1, wherein each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point.3.The apparatus of claim 1, wherein:the probability distribution comprises a set of probabilities;the set of points of the constellation form an alphabet of the digital modulation scheme;each element of the alphabet is associated with a probability of the set of probabilities; andeach element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability.4.The apparatus of claim 1, wherein the probability distribution comprises a symmetrical probability distribution.5.The apparatus of claim 1, wherein the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides.6.The apparatus of claim 1, wherein to determine the set of amplitude pairs, the one or more processors are configured to cause the apparatus to perform arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution.7.The apparatus of claim 1, wherein to map the set of amplitude pairs, one or more processors are configured to cause the apparatus to convert the set of amplitude pairs to the set of bits such that each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs.8.The apparatus of claim 1, wherein the one or more processors are configured to cause the apparatus to determine a set of parity bits based on the set of bits and the one or more information bits.9.The apparatus of claim 8, wherein the one or more processors are configured to cause the apparatus to determine sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits.10.The apparatus of claim 9, wherein to modulate the signal, the one or more processors are configured to cause the apparatus to modulate the signal further based on the set of amplitude pairs with the sign information.11.An apparatus configured for wireless communications, comprising:one or more memories; andone or more processors coupled to the one or more memories, the one or more processors being configured to cause the apparatus to:obtain a signal;demodulate the signal into a set of bits according to a digital modulation scheme; anddecode the set of bits into one or more information bits based on the set of bits mapping to a set of amplitude pairs, in a constellation of the digital modulation scheme, according to a probability distribution, based on the one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation.12.The apparatus of claim 11, wherein each amplitude pair of the set of amplitude pairs comprises a first amplitude corresponding to a first coordinate of the respective point and a second amplitude corresponding to a second coordinate of the respective point.13.The apparatus of claim 11, wherein:the probability distribution comprises a set of probabilities;the set of points of the constellation form an alphabet of the digital modulation scheme;each element of the alphabet is associated with a probability of the set of probabilities; andeach element of the alphabet corresponds to a subset of amplitude pairs, of the set of amplitude pairs, with the respective probability.14.The apparatus of claim 11, wherein the probability distribution comprises a symmetrical probability distribution.15.The apparatus of claim 11, wherein the constellation forms a polygon among the set of points of the constellation, the polygon having five or more sides.16.The apparatus of claim 11, wherein the set of bits map to the set of amplitude pairs based on arithmetic coding that converts the one or more information bits to the set of amplitude pairs according to the probability distribution.17.The apparatus of claim 11, wherein each bit of the set of bits corresponds to a respective amplitude pair of the amplitude pairs.18.The apparatus of claim 11, wherein:the set of bits indicate a set of parity bits; andthe one or more processors are configured to cause the apparatus to determine the one or more information bits based at least in part on the set of parity bits.19.The apparatus of claim 18, wherein the set of bits indicate sign information for the set of amplitude pairs based on the set of parity bits and the one or more information bits.20.A method for wireless communications by an apparatus, comprising:determining a set of amplitude pairs, in a constellation of a digital modulation scheme, according to a probability distribution, based on one or more information bits, wherein each amplitude pair of the set of amplitude pairs corresponds to a respective point of a set of points of the constellation, wherein the set of amplitude pairs forms the probability distribution across the set of points of the constellation;mapping the set of amplitude pairs to a set of bits;modulating a signal based at least in part on the set of bits according to the digital modulation scheme; andoutputting the signal.
Citation Information
Patent Citations
Code modulation method and system based on probability geometry joint shaping
CN117579170A
Multi-code probabilistic signal shaping using frequency-division multiplexing
US20190158238A1
2d probalistic constellation shaping using shell mapping
US20200313773A1
Encoding Method, Decoding Method, and Apparatus
US20220345352A1
Modulation method, demodulation method and related apparatus
WO2023124890A1