Finite precision energy-based arithmetic coding

Abstract

Various aspects of the present disclosure generally relate to wireless communications. In some aspects, a wireless communication device (WCD) may encode a set of bits into a sequence of symbols, the encoding using energy-based arithmetic encoding of finite accuracy and including an iterative operation including identifying one or more numbers of candidate sequences, a candidate sequence having a length of remaining symbols of the sequence after a symbol in the sequence of symbols is selected and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more numbers having a finite accuracy; identifying an interval boundary based at least in part on the one or more numbers of partial sums; and selecting a symbol in the sequence of symbols based at least in part on the interval boundary and an information integer to be encoded. Numerous other aspects are described.

Description

Technical Field

[0001] Aspects of the present disclosure relate generally to wireless communications, and to techniques and apparatus for limited-precision energy-based arithmetic coding. Background Art

[0002] Wireless communication systems are widely deployed to provide a variety of telecommunication services, such as telephony, video, data, messaging, and broadcasts. Typical wireless communication systems may employ multiple access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access technologies include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, time division synchronous code division multiple access (TD-SCDMA) systems, and long term evolution (LTE). LTE / LTE-Advanced is a set of enhancements to the Universal Mobile Telecommunications System (UMTS) mobile standard promulgated by the Third Generation Partnership Project (3GPP).

[0003] A wireless network may include one or more network nodes that support communication for wireless communication devices, such as user equipment (UE) or multiple UEs. The UE may communicate with the network node via downlink and uplink communications. A "downlink" (or "DL") refers to the communication link from the network node to the UE, and an "uplink" (or "UL") refers to the communication link from the UE to the network node. Some wireless networks may support device-to-device communication, such as via a local link (e.g., a sidelink (SL), a wireless local area network (WLAN) link, and / or a wireless personal area network (WPAN) link, etc.).

[0004] The above-mentioned multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that enables different UEs to communicate at a city, country, region, and / or global level. New Radio (NR) (which may be referred to as 5G) is a set of enhancements to the LTE mobile standard promulgated by 3GPP. NR is designed to better support mobile broadband Internet access by: improving spectrum efficiency; reducing costs; improving services; utilizing new spectrum; and using orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP) (CP-OFDM) on the downlink and CP-OFDM and / or single carrier frequency division multiplexing (SC-FDM) (also known as discrete Fourier transform spread OFDM (DFT-s-OFDM)) on the uplink to better integrate with other open standards; as well as supporting beamforming, multiple-input multiple-output (MIMO) antenna technology, and carrier aggregation. As the demand for mobile broadband access continues to increase, further improvements in LTE, NR, and other radio access technologies remain useful. Summary of the Invention

[0005] Some aspects described herein relate to a method of wireless communication performed by a wireless communication device (WCD). The method may include encoding a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: identifying one or more quantities of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on partial sums of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits. The method may include transmitting a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0006] Some aspects described herein relate to a wireless communication device (WCD) for wireless communication. The WCD may include a memory, one or more processors coupled to the memory, and instructions stored in the memory and executable by the one or more processors. The instructions may be executable by the one or more processors to cause the wireless communication device to: encode a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on partial sums of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits. The instructions may be executable by the one or more processors to cause the wireless communication device to: transmit a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0007] Some aspects described herein relate to a non-transitory computer-readable medium storing a set of instructions for wireless communication by a wireless communication device (WCD). The set of instructions, when executed by one or more processors of the WCD, may cause the WCD to: encode a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on a partial sum of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits. The instructions may be executable by the one or more processors to cause the wireless communication device to: transmit a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0008] Some aspects described herein relate to an apparatus for wireless communication. The apparatus may include means for encoding a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: means for identifying one or more quantities of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; means for identifying interval boundaries based at least in part on partial sums of the one or more quantities; and means for selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits. The apparatus may include means for transmitting a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0009] The various aspects collectively include methods, apparatus, systems, computer program products, non-transitory computer-readable media, user equipment, base stations, network entities, network nodes, wireless communication devices, and / or processing systems as fully described herein with reference to the accompanying drawings and description, and as illustrated in the accompanying drawings and description.

[0010] The features and technical advantages of the examples according to the present disclosure have been outlined quite broadly above so that the following detailed description may be better understood. Additional features and advantages will be described below. The concepts and specific examples disclosed may be readily utilized as a basis for modifying or designing other structures for achieving the same purposes of the present disclosure. Such equivalent constructions do not depart from the scope of the appended claims. The characteristics of the concepts disclosed herein, both in terms of their organization and method of operation, and the associated advantages will be better understood by considering the following description in conjunction with the accompanying drawings. Each of the figures in the drawings is provided for the purpose of illustration and description and not as a definition of limitations of the claims.

[0011] Although various aspects are described in the present disclosure by illustrating some examples, it will be understood by those skilled in the art that such aspects can be implemented in many different arrangements and scenarios. The technology described herein can be implemented using different platform types, devices, systems, shapes, sizes and / or packaging arrangements. For example, some aspects can be implemented via integrated chip implementations or other devices based on non-module components (e.g., end-user devices, vehicles, communication equipment, computing equipment, industrial equipment, retail / shopping equipment, medical equipment and / or artificial intelligence devices). Various aspects can be implemented in chip-level components, modular components, non-modular components, non-chip-level components, device-level components and / or system-level components. The equipment incorporated into the various aspects and features described may include additional components and features for implementing and practicing the various aspects claimed and described. For example, the transmission and reception of wireless signals may include one or more components (e.g., hardware components, including antennas, radio frequency (RF) chains, power amplifiers, modulators, buffers, processors, interleavers, adders and / or summers) for analog and digital purposes. The various aspects described herein are intended to be practiced in various devices, components, systems, distributed arrangements and / or end-user devices of various sizes, shapes and compositions. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order that the above-described features of the present disclosure may be fully understood, a more particular description of the invention briefly summarized above may be obtained by reference to various aspects (some of which are illustrated in the accompanying drawings). It should be noted, however, that the drawings illustrate only certain typical aspects of the present disclosure and are not therefore to be considered limiting of its scope, as the description may admit to other equally effective aspects. The same reference numerals in different drawings may identify the same or similar elements.

[0013] Figure 1 is a diagram illustrating an example of a wireless network according to the present disclosure.

[0014] Figure 2 is a diagram illustrating an example of communication between a network node and a user equipment (UE) in a wireless network according to the present disclosure.

[0015] Figure 3 is a diagram illustrating an example decomposed base station architecture according to the present disclosure.

[0016] Figure 4 is a diagram illustrating an example of a transmit (Tx) chain and a receive (Rx) chain of a UE according to the present disclosure.

[0017] Figure 5 is a diagram illustrating an example transmit chain for probability amplitude shaping according to the present disclosure.

[0018] Figure 6 is a diagram illustrating an example transmit chain for probability amplitude shaping according to the present disclosure.

[0019] Figure 7 is a diagram illustrating an example transmit chain for energy-based probability amplitude shaping according to the present disclosure.

[0020] Figure 8 is a diagram of an example associated with limited-precision energy-based arithmetic coding according to the present disclosure.

[0021] Figure 9 is a diagram illustrating an example process performed, for example, by a WCD, according to the present disclosure.

[0022] Figure 10 is a diagram of an example apparatus for wireless communications according to the present disclosure. DETAILED DESCRIPTION

[0023] Various aspects of the present disclosure are described more fully below with reference to the accompanying drawings. However, the present disclosure can be embodied in many different forms and should not be interpreted as being limited to any specific structure or function presented throughout the present disclosure. Instead, these aspects are provided so that the present disclosure will be thorough and complete, and the scope of protection of the present disclosure will be fully conveyed to those skilled in the art. Those skilled in the art will appreciate that the scope of the present disclosure is intended to cover any aspect of the present disclosure disclosed herein, whether it is implemented independently or in combination with any other aspect of the present disclosure. For example, any number of aspects set forth herein may be used to implement a device or practice method. In addition, the scope of the present disclosure is intended to cover such devices or methods implemented using other structures, functionality, or structure and functionality in addition to or different from 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 the present claims.

[0024] Several aspects of telecommunications systems will now be presented with reference to various devices and techniques. These devices and techniques will be described in the following detailed description and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, or algorithms (collectively, "elements"). These elements can be implemented using hardware, software, or a combination thereof. Whether such elements are implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system.

[0025] Although various aspects may be described herein using terminology generally associated with 5G or New Radio (NR) radio access technology (RAT), various aspects of the present disclosure may be applicable to other RATs, such as 3G RAT, 4G RAT, and / or post-5G (e.g., 6G) RATs.

[0026] Figure 1 1 is a diagram illustrating an example of a wireless network 100 according to the present disclosure. The wireless network 100 may be a 5G (e.g., NR) network and / or a 4G (e.g., Long Term Evolution (LTE)) network, or may include elements of a 5G (e.g., NR) network and / or elements of a 4G (e.g., Long Term Evolution (LTE)) network, etc. The wireless network 100 may include one or more network nodes 110 (illustrated as network node 110a, network node 110b, network node 110c, and network node 110d), user equipment (UE) 120 or multiple UEs 120 (illustrated as UE 120a, UE 120b, UE 120c, UE 120d, and UE 120e), and / or other entities. The network node 110 is a network node that communicates with the UE 120. As shown in the figure, the network node 110 may include one or more network nodes. For example, the network node 110 may be a converged network node, meaning that the converged network node is configured to utilize a radio protocol stack that is physically or logically integrated within a single radio access network (RAN) node (e.g., within a single device or unit). As another example, the network node 110 may be a disaggregated network node (sometimes referred to as a disaggregated base station), meaning that the network node 110 is configured to utilize a protocol stack that is physically or logically distributed between two or more nodes (such as one or more central units (CUs), one or more distributed units (DUs), or one or more radio units (RUs)).

[0027] In some examples, network node 110 is or includes a network node (such as an RU) that communicates with UE 120 via a radio access link. In some examples, network node 110 is or includes a network node (such as a DU) that communicates with other network nodes 110 via a fronthaul link or a midhaul link. In some examples, network node 110 is or includes a network node (such as a CU) that communicates with other network nodes 110 via a midhaul link or communicates with a core network via a backhaul link. In some examples, network node 110 (such as a converged network node 110 or a decomposed network node 110) may include multiple network nodes, such as one or more RUs, one or more CUs, and / or one or more DUs. Network node 110 may include, for example, an NR base station, an LTE base station, a Node B, an eNB (e.g., in 4G), a gNB (e.g., in 5G), an access point, a transmit receive point (TRP), a DU, an RU, a CU, a mobility element of a network, a core network node, a network element, network equipment, a RAN node, or a combination thereof. In some examples, network nodes 110 may be interconnected to each other or to one or more other network nodes 110 in wireless network 100 using any suitable transport network via various types of fronthaul interfaces, midhaul interfaces, and / or backhaul interfaces, such as direct physical connections, air interfaces, or virtual networks.

[0028] In some examples, network node 110 may provide communication coverage for a particular geographic area. In the Third Generation Partnership Project (3GPP), the term "cell" may refer to the coverage area of ​​network node 110 and / or a network node subsystem serving that coverage area, depending on the context in which the term is used. Network node 110 may provide communication coverage for a macrocell, a picocell, a femtocell, and / or another type of cell. A macrocell may cover a relatively large geographic area (e.g., a radius of several kilometers) and may allow unrestricted access by UEs 120 with service subscriptions. A picocell may cover a relatively small geographic area and may allow unrestricted access by UEs 120 with service subscriptions. A femtocell may cover a relatively small geographic area (e.g., a home) and may allow restricted access by UEs 120 associated with the femtocell (e.g., UEs 120 in a closed subscriber group (CSG)). A network node 110 for a macrocell may be referred to as a macro network node. A network node 110 for a picocell may be referred to as a pico network node. The network node 110 for a femto cell may be referred to as a femto network node or a home network node. Figure 1In the example shown, network node 110a may be a macro network node for macro cell 102a, network node 110b may be a pico network node for pico cell 102b, and network node 110c may be a femto network node for femto cell 102c. A network node may support one or more (e.g., three) cells. In some examples, the cells may not necessarily be stationary, and the geographic area of ​​the cells may move depending on the location of a mobile network node 110 (e.g., a mobile network node).

[0029] In some aspects, the term "base station" or "network node" may refer to a converged base station, a decomposed base station, an integrated access and backhaul (IAB) node, a relay node, or one or more components thereof. For example, in some aspects, a "base station" or "network node" may refer to a CU, a DU, a RU, a near real-time (near-RT) RAN intelligent controller (RIC), or a non-real-time (non-RT) RIC, or a combination thereof. In some aspects, the term "base station" or "network node" may refer to a device configured to perform one or more functions, such as those described herein in conjunction with network node 110. In some aspects, the term "base station" or "network node" may refer to multiple devices configured to perform one or more functions. For example, in some distributed systems, each of multiple different devices (which may be located in the same geographic location or in different geographic locations) may be configured to perform at least a portion of a function, or to repeatedly perform at least a portion of the function, and the term "base station" or "network node" may refer to any one or more of these different devices. In some aspects, the term "base station" or "network node" may refer to one or more virtual base stations or one or more virtual base station functions. For example, in some aspects, two or more base station functions may be instantiated on a single device. In some aspects, the term "base station" or "network node" may refer to one of the base station functions but not another base station function. In this way, a single device may include more than one base station.

[0030] The wireless network 100 may include one or more relay stations. A relay station is a network node that can receive transmissions of data from an upstream node (e.g., a network node 110 or a UE 120) and transmit transmissions of data to a downstream node (e.g., a UE 120 or a network node 110). A relay station may be a UE 120 that can relay transmissions for other UEs 120. Figure 1 In the example shown in , a network node 110 d (e.g., a relay network node) may communicate with a network node 110 a (e.g., a macro network node) and a UE 120 d to facilitate communications between the network node 110 a and the UE 120 d. A network node 110 that relays communications may be referred to as a relay station, a relay base station, a relay network node, a relay node, a relay, etc.

[0031] The wireless network 100 may be a heterogeneous network that includes different types of network nodes 110, such as macro network nodes, pico network nodes, femto network nodes, relay network nodes, etc. These different types of network nodes 110 may have different transmit power levels, different coverage areas, and / or different impacts on interference in the wireless network 100. For example, a macro network node may have a high transmit power level (e.g., 5 watts to 40 watts), while a pico network node, a femto network node, and a relay network node may have a lower transmit power level (e.g., 0.1 watt to 2 watts).

[0032] The network controller 130 may be coupled to or in communication with a set of network nodes 110 and may provide coordination and control for the network nodes 110. The network controller 130 may communicate with the network nodes 110 via a backhaul communication link or a midhaul communication link. The network nodes 110 may also communicate directly with each other or indirectly via a wireless backhaul communication link or a wired backhaul communication link. In some aspects, the network controller 130 may be or may include a CU or a core network device.

[0033] UEs 120 may be dispersed throughout wireless network 100, and each UE 120 may be stationary or mobile. UE 120 may include, for example, an access terminal, a terminal, a mobile station, and / or a subscriber unit. UE 120 may be a cellular phone (e.g., a smartphone), a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet computer, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device, a biometric device, a wearable device (e.g., a smart watch, smart clothing, smart glasses, a smart wristband, smart jewelry (e.g., a smart ring or smart bracelet)), an entertainment device (e.g., a music device, a video device, and / or a satellite radio), a vehicle component or sensor, a smart meter / sensor, industrial manufacturing equipment, a global positioning system device, a UE function of a network node, and / or any other suitable device configured to communicate via a wireless or wired medium.

[0034] Some UEs 120 may be considered machine type communication (MTC) or evolved or enhanced machine type communication (eMTC) UEs. MTC UEs and / or eMTC UEs may include, for example, robots, drones, remote devices, sensors, meters, monitors, and / or location tags that can communicate with a network node, another device (e.g., a remote device), or some other entity. Some UEs 120 may be considered Internet of Things (IoT) devices and / or may be implemented as NB-IoT (narrowband IoT) devices. Some UEs 120 may be considered customer premises equipment. The UE 120 may be included within a housing that houses components of the UE 120, such as a processor component and / or a memory component. In some examples, the processor component and the memory component may be coupled together. For example, the processor component (e.g., one or more processors) and the memory component (e.g., memory) may be operatively coupled, communicatively coupled, electronically coupled, and / or electrically coupled.

[0035] Generally speaking, any number of wireless networks 100 may be deployed in a given geographic area. Each wireless network 100 may support a specific RAT and may operate on one or more frequencies. A RAT may be referred to as a radio technology, air interface, etc. A frequency may be referred to as a carrier, frequency channel, etc. Each frequency may support a single RAT in a given geographic area to avoid interference between wireless networks of different RATs. In some cases, NR or 5G RAT networks may be deployed.

[0036] In some examples, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) can communicate directly using one or more sidelink channels (e.g., without using network node 110 as an intermediary to communicate with each other). For example, UE 120 can communicate using peer-to-peer (P2P) communication, device-to-device (D2D) communication, vehicle-to-everything (V2X) protocols (e.g., which may include vehicle-to-vehicle (V2V) protocols, vehicle-to-infrastructure (V2I) protocols, or vehicle-to-pedestrian (V2P) protocols), and / or mesh networks. In such examples, UE 120 can perform scheduling operations, resource selection operations, and / or other operations described elsewhere herein as being performed by network node 110.

[0037] The devices of the wireless network 100 can communicate using an electromagnetic spectrum, which can be subdivided into various categories, bands, channels, etc. based on frequency or wavelength. For example, the devices of the wireless network 100 can communicate using one or more operating bands. In 5G NR, two initial operating bands have been identified as frequency range designations FR1 (410 MHz to 7.125 GHz) and FR2 (24.25 GHz to 52.6 GHz). It should be understood that although a portion of FR1 is greater than 6 GHz, FR1 is often (interchangeably) referred to as the "sub-6 GHz" band in various documents and articles. A similar naming issue sometimes occurs with respect to FR2, which is often (interchangeably) referred to as the "millimeter wave" band in documents and articles, although it is different from the extremely high frequency (EHF) band (30 GHz-300 GHz) identified as the "millimeter wave" band by the International Telecommunication Union (ITU).

[0038] Frequencies between FR1 and FR2 are generally referred to as mid-band frequencies. Recent 5G NR research has identified the operating bands for these mid-band frequencies as frequency range designation FR3 (7.125GHz-24.25GHz). The frequency bands falling within FR3 can inherit FR1 characteristics and / or FR2 characteristics, and thus the features of FR1 and / or FR2 can be effectively extended to mid-band frequencies. In addition, higher frequency bands are currently being explored to extend 5G NR operation to more than 52.6GHz. For example, three higher operating bands have been identified as frequency range designations FR4a or FR4-1 (52.6GHz-71GHz), FR4 (52.6GHz-114.25GHz), and FR5 (114.25GHz-300GHz). Each of these higher frequency bands falls within the EHF band.

[0039] With the above examples in mind, unless otherwise specifically stated, it should be understood that if the term "sub-6 GHz" or the like is used herein, the term may broadly refer to frequencies that may be lower than 6 GHz, may be within FR1, or may include mid-band frequencies. Additionally, unless otherwise specifically stated, it should be understood that if the term "millimeter wave" or the like is used herein, the term may broadly refer to frequencies that may include mid-band frequencies, may be within FR2, FR4, FR4-a, FR4-1, and / or FR5, or may be within the EHF band. It is contemplated that the frequencies included in these operating bands (e.g., FR1, FR2, FR3, FR4, FR4-a, FR4-1, and / or FR5) may be modified, and the techniques described herein are applicable to those modified frequency ranges.

[0040] In some aspects, the WCD may include a communication manager 140 or 150. As described in greater detail elsewhere herein, the communication manager 140 or 150 may encode a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on a partial sum of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and transmitting a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding. Additionally or alternatively, the communication manager 140 or 150 may perform one or more other operations described herein.

[0041] As indicated above, Figure 1 are provided as examples. Other examples can be found in the Figure 1 The examples described are different.

[0042] Figure 2 2 is a diagram illustrating example 200 of a network node 110 communicating with a UE 120 in a wireless network 100 according to the present disclosure. The network node 110 may be equipped with a set of antennas 234a through 234t, such as T antennas (T ≥ 1). The UE 120 may be equipped with a set of antennas 252a through 252r, such as R antennas (R ≥ 1). The network node 110 of example 200 includes one or more radio frequency components, such as antennas 234 and a modem 232. In some examples, the network node 110 may include an interface, a communication component, or another component that facilitates communication with the UE 120 or another network node. Some network nodes 110 may not include radio frequency components, such as one or more CUs or one or more DUs, that facilitate direct communication with the UE 120.

[0043] At network node 110, transmit processor 220 may receive data intended for UE 120 (or a group of UEs 120) from data source 212. Transmit processor 220 may select one or more modulation and coding schemes (MCS) for UE 120 based at least in part on one or more channel quality indicators (CQIs) received from UE 120. Network node 110 may process (e.g., encode and modulate) the data for UE 120 based at least in part on the MCS selected for UE 120 and may provide data symbols for UE 120. Transmit processor 220 may process system information (e.g., for semi-static resource partitioning information (SRPI)) and control information (e.g., CQI requests, grants, and / or upper layer signaling) and provide overhead symbols and control symbols. Transmit processor 220 may generate reference symbols for reference signals (e.g., cell-specific reference signals (CRS) or demodulation reference signals (DMRS)) and synchronization signals (e.g., primary synchronization signals (PSS) or secondary synchronization signals (SSS)). The transmit (TX) multiple-input, multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on ​​data symbols, control symbols, overhead symbols, and / or reference symbols, as applicable, and may provide a set of output symbol streams (e.g., T output symbol streams) to a corresponding set of modems 232 (e.g., T modems) (shown as modems 232a through 232t). For example, each output symbol stream may be provided to a modulator component (shown as MOD) of the modem 232. Each modem 232 may process a corresponding output symbol stream (e.g., for OFDM) using a corresponding modulator component to obtain an output sample stream. Each modem 232 may also process (e.g., convert to analog, amplify, filter, and / or frequency upconvert) the output sample stream using a corresponding modulator component to obtain a downlink signal. The modems 232a through 232t may transmit a set of downlink signals (e.g., T downlink signals) via a corresponding set of antennas 234 (e.g., T antennas) (shown as antennas 234a through 234t).

[0044] At the UE 120, a set of antennas 252 (shown as antennas 252a through 252r) may receive downlink signals from the network node 110 and / or other network nodes 110 and may provide a set of received signals (e.g., R received signals) to a set of modems 254 (e.g., R modems) (shown as modems 254a through 254r). For example, each received signal may be provided to a demodulator component (shown as DEMOD) of the modem 254. Each modem 254 may use a corresponding demodulator component to condition (e.g., filter, amplify, downconvert, and / or digitize) the received signal to obtain input samples. Each modem 254 may use the demodulator component to further process the input samples (e.g., for OFDM) to obtain received symbols. A MIMO detector 256 may obtain received symbols from the modem 254, may perform MIMO detection on the received symbols, if applicable, and may provide detected symbols. The receive processor 258 may process (e.g., demodulate and decode) the detected symbols, may provide decoded data for the UE 120 to a data sink 260, and may provide decoded control information and system information to the controller / processor 280. The term "controller / processor" may refer to one or more controllers, one or more processors, or a combination thereof. The channel processor may determine, among other things, a reference signal received power (RSRP) parameter, a received signal strength indicator (RSSI) parameter, a reference signal received quality (RSRQ) parameter, and / or a CQI parameter. In some examples, one or more components of the UE 120 may be included in a housing 284.

[0045] The network controller 130 may include a communication unit 294, a controller / processor 290, and a memory 292. The network controller 130 may include, for example, one or more devices in a core network. The network controller 130 may communicate with the network node 110 via the communication unit 294.

[0046] One or more antennas (e.g., antennas 234a to 234t and / or antennas 252a to 252r) may include or be included within one or more antenna panels, one or more antenna groups, one or more groups of antenna elements, and / or one or more antenna arrays, etc. An antenna panel, antenna group, group of antenna elements, and / or antenna array may include one or more antenna elements (within a single housing or multiple housings), a group of coplanar antenna elements, a group of non-coplanar antenna elements, and / or be coupled to one or more transmit and / or receive components (such as, Figure 2 One or more antenna elements of one or more components in.

[0047] On the uplink, at the UE 120, a transmit processor 264 may receive and process data from a data source 262 and control information (e.g., for reports including RSRP, RSSI, RSRQ, and / or CQI) from the controller / processor 280. The transmit processor 264 may generate reference symbols for one or more reference signals. The symbols from the transmit processor 264 may be pre-decoded by the TX MIMO processor 266, if applicable, further processed by the modem 254 (e.g., for DFT-s-OFDM or CP-OFDM), and transmitted to the network node 110. In some examples, the modem 254 of the UE 120 may include a modulator and a demodulator. In some examples, the UE 120 includes a transceiver. The transceiver may include any combination of an antenna 252, a modem 254, a MIMO detector 256, a receive processor 258, a transmit processor 264, and / or a TX MIMO processor 266. The transceiver may be used by a processor (eg, controller / processor 280) and memory 282 to execute the instructions herein (eg, reference Figures 8 to 10 ) any aspects of any of the methods described.

[0048] At network node 110, uplink signals from UE 120 and / or other UEs may be received by antenna 234, processed by modem 232 (e.g., a demodulator component (shown as DEMOD) of modem 232), detected by MIMO detector 236 (if applicable), and further processed by receive processor 238 to obtain decoded data and control information transmitted by UE 120. Receive processor 238 may provide the decoded data to a data sink 239 and the decoded control information to controller / processor 240. Network node 110 may include a communication unit 244 and may communicate with network controller 130 via communication unit 244. Network node 110 may include a scheduler 246 to schedule one or more UEs 120 for downlink and / or uplink communications. In some examples, modem 232 of network node 110 may include a modulator and a demodulator. In some examples, network node 110 includes a transceiver. The transceiver may include any combination of antenna 234, modem 232, MIMO detector 236, receive processor 238, transmit processor 220, and / or TX MIMO processor 230. The transceiver may be used by a processor (e.g., controller / processor 240) and memory 242 to execute the instructions herein (e.g., reference 242). Figures 8 to 10 ) any aspects of any of the methods described.

[0049] The controller / processor 240 of the network node 110, the controller / processor 280 of the UE 120, and / or Figure 2 Any other components in may perform one or more techniques associated with limited precision energy-based arithmetic coding, as described in more detail elsewhere herein. In some aspects, the WCD described herein is Figure 2 10, is included in the base station 110, or includes one or more components of the base station 110. In some aspects, the WCD described herein is a UE 120, is included in the UE 120, or includes Figure 2 One or more components of the UE 120 are shown. For example, the controller / processor 240 of the network node 110, the controller / processor 280 of the UE 120, and / or Figure 2 Any other component of the may perform or direct e.g. Figure 9 900 and / or operations of other processes as described herein. Memory 242 and memory 282 may store data and program codes for network node 110 and UE 120, respectively. In some examples, memory 242 and / or memory 282 may include a non-transitory computer-readable medium storing one or more instructions (e.g., code and / or program code) for wireless communication. For example, the one or more instructions, when executed by one or more processors of network node 110 and / or UE 120 (e.g., directly, or after compilation, conversion, and / or interpretation), may cause the one or more processors, UE 120, and / or network node 110 to perform or direct, for example, Figure 9 The process 900 and / or operations of other processes as described herein. In some examples, executing instructions may include running instructions, converting instructions, compiling instructions, and / or interpreting instructions, etc.

[0050] In some aspects, a wireless communication device (WCD) includes means for encoding a set of bits into a sequence of symbols, members of the sequence of symbols being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: means for identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; means for identifying interval boundaries based at least in part on partial sums of the one or more quantities; and / or means for selecting symbols in the sequence of symbols based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and / or means for transmitting a communication including the sequence of symbols encoded using the finite-precision energy-based arithmetic coding. In some aspects (e.g., where the WCD comprises or is included in a network node), means for a wireless communication device (WCD) to perform operations described herein may include, for example, one or more of the communication manager 150, transmit processor 220, TX MIMO processor 230, modem 232, antenna 234, MIMO detector 236, receive processor 238, controller / processor 240, memory 242, or scheduler 246. In some aspects (e.g., where the WCD comprises or is included in a UE), means for a wireless communication device (WCD) to perform operations described herein may include, for example, one or more of the communication manager 140, antenna 252, modem 254, MIMO detector 256, receive processor 258, transmit processor 264, TX MIMO processor 266, controller / processor 280, or memory 282.

[0051] Although Figure 2 The blocks in FIG. 2 are illustrated as distinct components, but the functionality described above with respect to these blocks may be implemented in a single hardware, software, or combined component or in various combinations of components. For example, the functionality described with respect to the transmit processor 264, the receive processor 258, and / or the TX MIMO processor 266 may be performed by or under the control of the controller / processor 280.

[0052] As indicated above, Figure 2 are provided as examples. Other examples can be found in the Figure 2 The examples described are different.

[0053] The deployment of a communication system such as a 5G NR system can be arranged in a variety of ways with various components or constituent parts. In a 5G NR system or network, a network node, a network entity, a mobility element of the network, a RAN node, a core network node, a network element, a base station or network equipment may be implemented in an aggregated architecture or a decomposed architecture. For example, a base station (such as a node B (NB), an evolved NB (eNB), an NR base station, a 5G NB, an access point (AP), a TRP or a cell, etc.) or one or more units (or one or more components) performing base station functionality may be implemented as an aggregated base station (also referred to as an independent base station or a monolithic base station) or a decomposed base station. A “network entity” or a “network node” may refer to a decomposed base station or one or more units of a decomposed base station (such as one or more CUs, one or more DUs, one or more RUs or a combination thereof).

[0054] A converged base station (e.g., a converged network node) may be configured to utilize a radio protocol stack that is physically or logically integrated within a single RAN node (e.g., within a single device or unit). A decomposed base station (e.g., a decomposed network node) may be configured to utilize a protocol stack that is physically or logically distributed between two or more units (such as one or more CUs, one or more DUs, or one or more RUs). In some examples, the CU may be implemented within a network node, and one or more DUs may be co-located with the CU, or alternatively, may be geographically or virtually spread across one or more other network nodes. The DU may be implemented to communicate with one or more RUs. Each of the CU, DU, and RU may also be implemented as a virtual unit, such as a virtual central unit (VCU), a virtual distributed unit (VDU), or a virtual radio unit (VRU), among others.

[0055] Base station type operation or network design may take into account the aggregated nature of base station functionality. For example, a disaggregated base station may be utilized in an IAB network, an open radio access network (O-RAN (such as a network configuration initiated by the O-RAN Alliance)), or a virtualized radio access network (vRAN, also known as a cloud radio access network (C-RAN)) to facilitate scaling of the communication system by separating base station functionality into one or more units that can be deployed separately. A disaggregated base station may include functionality implemented across two or more units at various physical locations, as well as functionality implemented virtually for at least one unit, which may enable flexibility in network design. Each unit of the disaggregated base station may be configured for wired or wireless communication with at least one other unit of the disaggregated base station.

[0056] Figure 3FIG2 is a diagram illustrating an example decomposed base station architecture 300 according to the present disclosure. The decomposed base station architecture 300 may include a CU 310 that may communicate directly with a core network 320 via a backhaul link, or indirectly with the core network 320 through one or more decomposed control units (such as a near-RT RIC 325 via an E2 link, a non-RT RIC 315 associated with a service management and orchestration (SMO) framework 305, or both). The CU 310 may communicate with one or more DUs 330 via respective midhaul links (such as via an F1 interface). Each of the DUs 330 may communicate with one or more RUs 340 via respective fronthaul links. Each of the RUs 340 may communicate with one or more UEs 120 via respective radio frequency (RF) access links. In some implementations, a UE 120 may be served simultaneously by multiple RUs 340.

[0057] Each of the units (including the CU 310, DU 330, RU 340) and the near-RT RIC 325, the non-RT RIC 315, and the SMO framework 305 may include 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 that provides instructions to one or more communication interfaces of the corresponding unit, may be configured to communicate with one or more of the other units via the transmission medium. In some examples, each of the units may include a wired interface configured to receive signals or transmit signals to one or more of the other units via a wired transmission medium, and a wireless interface that may include a receiver, a transmitter, or a transceiver (such as an RF transceiver) configured to receive signals or transmit signals to one or more of the other units via a wireless transmission medium, or both.

[0058] In some aspects, the CU 310 may host one or more higher layer control functions. Such control functions may include radio resource control (RRC) functions, packet data convergence protocol (PDCP) functions, or service data adaptation protocol (SDAP) functions, among others. Each control function may be implemented using an interface that is configured to communicate signals with other control functions hosted by the CU 310. The CU 310 may be configured to handle user plane functionality (e.g., central unit-user plane (CU-UP) functionality), control plane functionality (e.g., central unit-control plane (CU-CP) functionality), or a combination thereof. In some implementations, the CU 310 may be logically split into one or more CU-UP units and one or more CU-CP units. When implemented in an O-RAN configuration, the CU-UP unit may communicate bidirectionally with the CU-CP unit via an interface (such as an E1 interface). As needed, the CU 310 may be implemented to communicate with the DU 330 for network control and signaling.

[0059] Each DU 330 may correspond to a logical unit that includes one or more base station functions for controlling the operation of one or more RUs 340. In some aspects, the DU 330 may host one or more of a radio link control (RLC) layer, a medium access control (MAC) layer, and one or more higher physical (PHY) layers, at least in part according to a functional split (such as that defined by 3GPP). In some aspects, the one or more higher PHY layers may be implemented by one or more modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, and the like. In some aspects, the DU 330 may also host one or more lower PHY layers, such as those implemented by one or more modules for fast Fourier transform (FFT), inverse FFT (iFFT), digital beamforming, or physical random access channel (PRACH) extraction and filtering. Each layer (which may also be referred to as a module) may be implemented using an interface configured to communicate signals with other layers (and modules) hosted by the DU 330 or with control functions hosted by the CU 310.

[0060] Each RU 340 may implement low-layer functionality. In some deployments, the RU 340 controlled by the DU 330 may correspond to a logical node that hosts RF processing functions or low PHY layer functions based on functional split (e.g., functional split defined by 3GPP) (such as low-layer functional split), such as performing FFT, performing iFFT, digital beamforming, or PRACH extraction and filtering, etc. In this architecture, each RU 340 may be operated to handle over-the-air (OTA) communications with one or more UEs 120. In some implementations, real-time and non-real-time aspects of control plane and user plane communications with the RU 340 may be controlled by the corresponding DU 330. In some scenarios, this configuration may enable each DU 330 and CU 310 to be implemented in a cloud-based RAN architecture (such as a vRAN architecture).

[0061] The SMO framework 305 can be configured to support RAN deployment and provisioning of both non-virtualized and virtualized network elements. For non-virtualized network elements, the SMO framework 305 can be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which can be managed via an operations and maintenance interface (such as the O1 interface). For virtualized network elements, the SMO framework 305 can be configured to interact with a cloud computing platform (such as the Open Cloud (O-Cloud) platform 390) to perform network element lifecycle management (such as instantiating virtualized network elements) via a cloud computing platform interface (such as the O2 interface). Such virtualized network elements can include, but are not limited to, CU 310, DU 330, RU 340, non-RT RIC 315, and near-RT RIC 325. In some implementations, the SMO framework 305 can communicate with hardware aspects of the 4G RAN (such as the Open eNB (O-eNB) 311) via the O1 interface. Additionally, in some implementations, the SMO framework 305 can communicate directly with each of the one or more RUs 340 via a corresponding O1 interface. The SMO framework 305 can also include a non-RT RIC 315 configured to support the functionality of the SMO framework 305.

[0062] The non-RT RIC 315 can be configured to include logic that enables non-real-time control and optimization of RAN elements and resources, artificial intelligence / machine learning (AI / ML) workflows including model training and updating, or policy-based guidance of applications / features in the near-RT RIC 325. The non-RT RIC 315 can be coupled to or in communication with the near-RT RIC 325 (e.g., via an A1 interface). The near-RT RIC 325 can be configured to include logic that enables near-real-time control and optimization of RAN elements and resources through data collection and actions over an interface (e.g., via an E2 interface) that connects one or more CUs 310, one or more DUs 330, or both, and the O-eNB with the near-RT RIC 325.

[0063] In some implementations, the non-RT RIC 315 can receive parameters or external enrichment information from an external server to generate an AI / ML model to be deployed in the near-RT RIC 325. Such information can be utilized by the near-RT RIC 325 and can be received from non-network data sources or from network functions at the SMO framework 305 or the non-RT RIC 315. In some examples, the non-RT RIC 315 or the near-RT RIC 325 can be configured to tune RAN behavior or performance. For example, the non-RT RIC 315 can monitor long-term trends and patterns in performance and employ AI / ML models to perform corrective actions through the SMO framework 305 (such as via reconfiguration of the O1 interface) or through the creation of RAN management policies (such as A1 interface policies).

[0064] As indicated above, Figure 3 are provided as examples. Other examples can be found in the Figure 3 The examples described are different.

[0065] Figure 4 is a diagram illustrating an example 400 of a transmit (Tx) chain 402 and a receive (Rx) chain 404 of a UE 120 according to the present disclosure. In some examples, one or more components of the Tx chain 402 may be combined as described above. Figure 2 The described transmit processor 264, TX MIMO processor 266, modem 254, and / or controller / processor 280 are implemented. In some examples, Tx chain 402 can be implemented in UE 120 for transmitting data 406 (e.g., uplink data, uplink reference signal, or uplink control information) to network node 110 on an uplink channel.

[0066] Encoder 407 may change signal (e.g., bit stream) 403 into data 406. Data 406 to be transmitted is provided as input from encoder 407 to serial-to-parallel (S / P) converter 408. In some examples, S / P converter 408 may split the transmit data into N parallel data streams 410.

[0067] The N parallel data streams 410 may then be provided as input to a mapper 412. The mapper 412 may map the N parallel data streams 410 onto N constellation points. The mapping may be accomplished using a modulation constellation such as amplitude shift keying (ASK), binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), 8-phase shift keying (8PSK), or quadrature amplitude modulation (QAM). Thus, the mapper 412 may output N parallel symbol streams 416, each corresponding to one of the N orthogonal subcarriers of an inverse fast Fourier transform (IFFT) component 420. These N parallel symbol streams 416 are represented in the frequency domain and may be converted by the IFFT component 420 into N parallel time domain sample streams 418.

[0068] In some aspects, N parallel modulations in the frequency domain correspond to N modulation symbols in the frequency domain, which are equal to N mappings and N-point IFFTs in the frequency domain, which are equal to one (useful) OFDM symbol in the time domain, which is equal to N samples in the time domain. One OFDM symbol Ns in the time domain is equal to Ncp (number of guard samples per OFDM symbol) + N (number of useful samples per OFDM symbol).

[0069] The N parallel time-domain sample streams 418 may be converted into an OFDM / OFDMA symbol stream 422 by a parallel-to-serial (P / S) converter 424. A guard insertion component 426 may insert a guard interval between successive OFDM / OFDMA symbols in the OFDM / OFDMA symbol stream 422. The output of the guard insertion component 426 may then be up-converted to a desired transmit frequency band by an RF front end 428. An antenna 430 may then transmit the resulting signal 432.

[0070] In some examples, Rx chain 404 can utilize OFDM / OFDMA. In some examples, one or more components of Rx chain 404 can be combined as described above. Figure 2 The described receive processor 258, MIMO detector 256, modem 254, or controller / processor 280 may be implemented. In some examples, Rx chain 404 may be implemented in UE 120 for receiving data 406 (e.g., downlink data, downlink reference signal, or downlink control information) from network node 110 on a downlink channel.

[0071] Transmitted signal 432 is shown traveling from Tx chain 402 to Rx chain 404 over wireless channel 434. When signal 432' is received by antenna 430', received signal 432' can be down-converted to a baseband signal by RF front end 428'. Guard removal component 426' can then remove the guard interval inserted between OFDM / OFDMA symbols by guard insertion component 426.

[0072] The output of the protection removal component 426' can be provided to an S / P converter 424'. This output can include an OFDM / OFDMA symbol stream 422', and the S / P converter 424' can divide the OFDM / OFDMA symbol stream 422' into N parallel time-domain symbol streams 418', each of which corresponds to one of the N orthogonal subcarriers. The FFT component 420' can convert the N parallel time-domain symbol streams 418' into the frequency domain and output N parallel frequency-domain symbol streams 416'.

[0073] Demapper 412' can perform the inverse of the symbol mapping operation performed by mapper 412, thereby outputting N parallel data streams 410'. P / S converter 408' can combine N parallel data streams 410' into a single data stream 406'. Ideally, data stream 406' corresponds to data 406 provided as input to Tx chain 402. Data stream 406' can be decoded by decoder 407' into decoded data stream 403'.

[0074] As indicated above, Figure 4 are provided as examples. Other examples can be found in the Figure 4 The examples described are different.

[0075] Figure 5 is a diagram illustrating an example transmit chain 500 for probability amplitude shaping according to the present disclosure.

[0076] like Figure 5 As shown, the transmission chain 500 includes a distribution matcher 510, an amplitude to bit mapper 512, a system FEC encoder 514, and a sign bit converter 516. The transmission chain 500 can be used for example for ASK modulation, where the ASK constellation has a modulation order of 2. M Modulation order 2 M The ASK constellation may include a set of constellation points {±1,±3,…,±(2 M -1)}. In some examples, the transmission chain 500 may have a transmission rate R c =R dm +γ, where R dm denotes the rate of the distribution matcher 510, and γ denotes a set of parity bits added to the k information bits to be encoded.

[0077] The ASK constellation can be used with the amplitude alphabet {1,3,…,(2 M -1)} associated. The amplitude alphabet may include a set of possible constellation points (e.g., no symbols) from which a set of constellation points is generated. For example, an amplitude alphabet of size m>1 may be configured for the transmit chain 500. in Each element of is called a symbol. can be constrained so that each element Internal sorting (e.g., for any a i , a1 <a2<…<a m ). For the alphabet For each value i in , the symbol can have energy E(a i ). Based on the above constraints, the symbol energy is calculated according to Sort the symbols in the order so that 0≤E(a i ) <E(a i+1 ). For 2 M ASK constellation, such as Figure 5 As described, where m = 2 M-1 and Corresponding to the 2 M In this example, a i =2i-1, so that a1=1, a2=3, ..., a m =2 M -1, and such that for each i, in the first example the symbol a i Energy E(a i )=(2i-1) 2 , or in the second example In these two examples, the second example is the (2i-1) in the first example. 2 Rescaling of items.

[0078] For a symbol sequence s=(s1,s2,…,s n ) of size m where each element of s is selected from Energy E(s) is a sequence of symbols The accumulation (e.g., sum) of all symbol energies of . Accordingly, for 2 M ASK constellation, where M = 3; And m=4, an example symbol sequence (5, 1, 1, 3, 5, 7) with a configurable length of n=6 can be configured. For the example symbol sequence, the symbol energy can be determined to be E(1)=1, E(3)=9, E(5)=25, and E(7)=49, so that E(s)=2E(1)+E(3)+2E(5)+E(7)=2+9+50+49=110. In another example, for E(1)=0, E(3)=1, E(5)=3, and E(7)=6, the symbol energy can be determined to be E(s)=2E(1)+E(3)+2E(5)+E(7)=13.

[0079] like Figure 5 As further shown, the distribution matcher 510 may receive k information bits and map the k information bits to n amplitude symbols. The distribution matcher 510 may have a rate R dm =k / n. In some examples, the distribution matcher 510 maps information bits to amplitude symbols to achieve a non-uniform distribution on the amplitude symbols. The non-uniform distribution caused by the distribution matcher 510 can be closer to the capacity-achieving input distribution than that achieved by a uniform distribution. In other words, the non-uniform distribution caused by the distribution matcher 510 is a probability distribution in an additive white Gaussian noise (AWGN) channel (e.g., a Maxwell-Boltzmann (MB) distribution). The transmit chain 500 can pass n amplitude symbols to the amplitude-to-bit mapper 512, which can map the n amplitude symbols to a set of n(M-1) amplitude bits. The transmit chain 500 can map the n(M-1) amplitude bits and γ n The additional information bits (eg, FEC bits) are passed to the system FEC encoder 514 for FEC encoding. In this example, the system FEC encoder 514 operates at a rate of R c =(M-1+γ) / M receives n(M-1+γ) bits as input. The system FEC encoder 514 can be used at rate R c Generate a set of n(1–γ) parity bits. The transmission chain 500 can combine n(1–γ) parity bits and γ n The additional information bits are passed to the sign bit converter 516, which can generate a set of n sign bits. The sign bit converter 516 generates a sign bit "1" for bit "0" and a sign bit "-1" for bit "1". The transmit chain 500 can perform point-by-point multiplication to combine the n amplitude signs with the n sign bits to generate a set of n constellation points.

[0080] As indicated above, Figure 5 are provided as examples. Other examples can be found in the Figure 5 The examples described are different.

[0081] Figure 6is a diagram illustrating an example transmit chain 600 for probability amplitude shaping according to the present disclosure.

[0082] like Figure 6 As shown, the transmission chain 600 includes a distribution matcher 610, an amplitude-to-bit mapper 612, a system FEC encoder 614, and a sign bit converter 616. The transmission chain 600 can be used, for example, for QAM modulation, where the QAM constellation has a modulation order of 2. 2M In this example, the modulation order is 2 2M The QAM constellation may include a set of constellation points {±1,±3,…,±(2 M -1)}×{±1,±3,…,±(2 M -1)}.

[0083] like Figure 6 As further shown, the distribution matcher 610 may receive the first group of k information bits and the second group of k information bits and map each group of k information bits to a corresponding group of n amplitude symbols. The transmit chain 600 may pass each group of n amplitude symbols to the amplitude-to-bit mapper 612, which may map each group of n amplitude symbols to a pair of each group of n(M-1) amplitude bits. The transmit chain 600 may map each group of n(M-1) amplitude bits to a pair of each group of γ n The additional information bits are passed to the systematic FEC encoder 614 for FEC encoding. The systematic FEC encoder 614 may have an FEC codeword length of n. c =nlog2(2 2M )=2nM. In this example, the system FEC encoder 614 receives as input a total of information bits, the input is in the form of two streams of n(M-1) amplitude bits from the information bits and two streams of additional information bits, where each stream of additional information bits includes nγ bits. The value of γ can be such that nγ = Accordingly, the total number of bits used for transmission The system FEC encoder 614 can be at rate R c Generate a set of 2nM (1-R c ) parity bits. The transmission chain 600 can transmit 2nM(1-R c ) parity bits and a pair of γ n The additional information bits are passed to the sign bit converter 616, which generates a set of 2n sign bits. The transmit chain 600 performs point-by-point multiplications to combine each set of n magnitude signs with the 2n sign bits to generate a pair of each set of n signed magnitudes.

[0084] As indicated above, Figure 6 are provided as examples. Other examples can be found in the Figure 6The examples described are different.

[0085] Figure 7 is a diagram illustrating an example transmit chain 700 for energy-based probability amplitude shaping according to the present disclosure.

[0086] like Figure 7 As shown, the transmission chain 700 includes an energy-based amplitude shaper 710, a symbol-to-bit mapper 712, a systematic FEC encoder 714, and a bit-to-symbol mapper 716. The transmission chain 700 can be used, for example, for ASK modulation, where the ASK constellation has a modulation order of 2. M In this example, the modulation order is 2 M The ASK constellation may include an ASK with an amplitude alphabet {1,3,…,(2 M A set of constellation points {±1,±3,…,±(2 M In another example, the transmission chain 700 can be used to have a modulation order of 2 2M , a set of constellation points {±1,±3,…,±(2 M -1)}×{±1,±3,…,±(2 M -1)} and the amplitude alphabet {1,3,…,2 M -1} QAM modulation.

[0087] like Figure 7 As further shown, the energy-based amplitude reshaper 710 may receive a sequence u of k information bits. k =(u1,u2,…,u k ). Sequence u k represents a set of k information bits for encoding. The energy-based amplitude reshaper 710 may determine a value with energy E(s n ) symbol sequence s n , the energy is constrained to be less than the energy threshold Symbol sequence s n may represent a set of n amplitude symbols. In some examples, using an energy-based amplitude shaper may achieve a non-uniform symbol-by-symbol edge distribution of n amplitude symbols that is closer to the capacity-achieved input distribution than when a uniform distribution is used as input. The non-uniform symbol-by-symbol edge distribution may be a MB distribution for an AWGN channel. The symbol-to-bit mapper 712 may map the sequence s n =(s1,s2,…,s n ) (which consists of a set of n amplitude symbols) is mapped to (M–1) bit sequences of length n, expressed as In other words, each of the n amplitude symbols corresponds to (M–1) bits, resulting in a total of n(M–1) amplitude bits.

[0088] The system FEC encoder 714 can receive each bit sequence and a set of additional information bits u γn (e.g., a total of n(M-1+γ)), for c =(M-1+γ) / M for FEC encoding. The system FEC encoder 714 generates an output set p of n(1-γ) parity bits (or FEC bits). n(1-γ) , the output set is mapped to the bit sequence The bit-to-symbol mapper 716 may receive each set of bit sequences. and parity bit sequence And generate a set of symbols x n For example, the bit sequence Can be converted into n sign bits, which are point-by-point with s n The resulting transmission rate R of the transmission chain 700 is t R t =R as +γ, where R as It is expected that a non-uniform distribution of the amplitude symbols can be achieved by choosing an energy threshold to achieve.

[0089] As indicated above, Figure 7 are provided as examples. Other examples can be found in the Figure 7 The examples described are different.

[0090] As described above, an amplitude alphabet with m>1 may be used when encoding a set of information bits to generate a set of symbols. Amplitude Alphabet can be sorted so that for any i∈{1,2,…,m-1}, a i i+1 (For example, a1 <a2<…<a m ). Amplitude alphabet Each symbol has a symbol energy E(a i ), the symbol energies are also sorted so that for any i∈{1,2,…,m-1}, 0≤E(a i ) <E(a i+1 ), (e.g. E(a1) <E(a2)<…<E(a m )). An example of a constellation that can be used for symbol mapping is 2 M ASK constellation in binary system where m = 2 M-1 and is based at least in part on the modulation order. Thus, a i ​=2i-1, which produces a set of symbols a1=1, a2=3..., a m =2 M -1.

[0091] Given an amplitude alphabet of size m Available in Amplitude Alphabet Construct a sequence of length n s=(s1,s2,…,s n ). In other words, each element of the sequence s belongs to the amplitude alphabet The energy of a sequence s (denoted as E(s)) is the sum of the energies of the symbols in the sequence s:

[0092]

[0093] where s l is the element of sequence s (e.g. l ranges from 1 to n). Amplitude alphabet The set of all sequences of length n on the set such that each sequence in the set has an energy equal to E. The number of sequences is the value N [m] (n, E) (e.g., the total number of distinct sequences in the set of all sequences above), which may also be denoted as "N(n, E)" or "N" depending on the context, where, for a given value m, N(n, E) is a two-variable integer-valued function of n and E. Similarly, the cumulative number of sequences (Also expressed as "N" depending on the context c (n,E)" or "N c ")express The set of all sequences of length n such that Each sequence in has an energy at most E and is represented by According to the following relationship, N may involve N c :

[0094]

[0095] Where E(a m ) represents the maximum symbol energy such that for 1≤n′≤n, 0≤E≤nE(a m ).

[0096] In some wireless communications, such as when higher-order modulation is used, a transmitter device may use fixed constellation points to encode information bits. For example, fixed constellation points may be used with 16-QAM, 64-QAM, or 256-QAM, as well as other modulation and coding schemes. The fixed constellation points may each have an equal probability of being used to encode information bits. For AWGN channels, there may be a shaping gap relative to the channel capacity, or "Shannon capacity," which may asymptotically approach approximately 1.53 decibels (dB) for uniformly distributed channel input. The shaping gap may refer to the difference between the signal-to-noise ratio (SNR) for achieving a given rate using a given MCS and the SNR at which the best capacity-achieving solution can operate (which may be the Shannon capacity or "Shannon limit").

[0097] Some techniques for reducing or narrowing the shaping gap include geometric shaping and probabilistic shaping. In geometric shaping, the transmitter device may use equally probabilistic signaling of constellation points with a non-uniform (e.g., Gaussian-like) distribution. In contrast, in probabilistic shaping, the transmitter device may use equally spaced constellation points with a non-uniform (e.g., Gaussian-like) signal distribution. To perform probabilistic shaping, the transmitter device may determine an energy threshold. This results in a non-uniform distribution over a set of amplitude symbols caused by the energy-based shaping scheme. If the non-uniform distribution is relatively different from the optimal MB distribution, the shaping gap may be too large, which may lead to poor communication performance.

[0098] In the amplitude alphabet A probability distribution with parameter v (a non-negative real number) on y (such as the MB distribution) has the form The probability distribution of elements, and Z v is a normalization constant. ASK constellations (such as reference Figure 5 and Figure 7 The optimal probability distribution on the ASK constellation described above may exhibit a relatively large shaping gain relative to the uniform distribution of the same constellation. In other words, the uniform distribution has a certain amount of shaping gap with the optimal probability distribution (eg, MB distribution).

[0099] As described above, a set of coded information bits can be expressed with the amplitude alphabet The symbol sequence s, sequence length n and total energy E are associated. Energy threshold The constraint on the total energy E can be expressed as Representable alphabet The set of all symbol sequences of length n such that the energy of each sequence is at most equal to the energy threshold The transmitter device may perform energy-based shaping and may use a direct energy-based arithmetic coding (AC) method or a two-stage stripping method for encoding. A distribution matcher of the transmitter device, such as distribution matchers 510 and 610, may implement one of the above-described example techniques. In such an example, the distribution mapper derives the energy-based ... k The set of possible information bit sequences is The result of this type of encoding is that by Imposing conditions on k guarantees unique decodability at the receiver device. However, the above encoding methods are implemented as serial processes. For example, the underlying direct energy-based AC method is a serial implementation method, which may cause excessive delays in communications that are sensitive to encoding and transmission delays.

[0100] In some aspects, the WCD may use limited-precision energy-based arithmetic coding to encode communications. In some aspects, limited precision may be used to conserve processing and power resources and improve the latency of encoding information bits. For example, if 1,000 bits are to be encoded, some aspects of energy-based arithmetic coding may become overly complex based, at least in part, on limited latency requirements, power resources, and / or processing resources. To this end, limited-precision energy-based arithmetic coding may be used in conjunction with energy-based arithmetic coding.

[0101] In the example of finite-precision energy-based arithmetic coding, given an alphabet of size m Sequence length n and maximum sequence energy Finite-precision energy-based arithmetic coding can be used to encode multiple k information bits into a sequence of length n, where each element of the sequence belongs to And the energy of the sequence is at most equal to The encoding is performed in iterations to sequentially determine the n output symbols.

[0102] Each iteration may include approximating one or more logarithms of the cumulative number of sequences and exponentiating the logarithm of the cumulative number of sequences to obtain one or more K a In these operations, the WCD may estimate the one or more logarithms of the cumulative number of sequences using limited precision. This may be based at least in part on the fact that identifying the cumulative number of sequences with perfect accuracy may not be feasible based at least in part on the computational and power resources that may be consumed and the latency of performing the computations at each iteration.

[0103] Each iteration may further include: calculating one or more partial sums (eg, cumulative partial sums of the number of sequences) to obtain one or more K s The number of bits, indicating the renormalization factor (which is K sThe number of bits), one or more intervals with interval boundaries are identified as K X The number of bits is determined, and the output sign is determined by determining the sign index as an integer such that the difference between the information integer and an interval boundary corresponding to the integer is non-negative (eg, the smallest possible value).

[0104] Each iteration may also include updating the values ​​used in the iteration. For example, the WCD may update the residual sequence counter to K s The number of bits, the update of the residual sequence length, the update of the residual maximum sequence energy and / or the update of the information integer, etc.

[0105] The WCD may continue to iterate until each member of the sequence is identified. Iterations may each be associated with the identification of a single symbol of the sequence, such that the number of iterations is equal to the length n.

[0106] As described herein, a K-bit number is a positive integer z that satisfies the following conditions: z can be written as z=a2 l In the form of , K is an integer such that K ≥ 2, a is a K-bit unsigned integer such that a is equal to 0 or the most significant bit (MSB) in the binary expansion of a is 1, and l is an integer such that l > -K. Additionally, 0 ≤ a ≤ 2 K -1. For example, z = 2503 × 2 24696 can be viewed as a 12-bit number. In this example, the binary expansion of 2503 can be written as (1,0,0,1,1,1,0,0,0,1,1,1), and the binary expansion of 24696 can be written as (0,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0). Additionally or alternatively, if K1 ≥ K2, then any k2-bit number can be exactly represented as a k1-bit number.

[0107] The WCD may perform an operation on a K-bit number based at least in part on the fact that the number is K-bit. For example, upward addition may be performed. Let and is a K-bit number; without loss of generality, we assume that z1≥z2. The upward addition operation is performed by It is a pairwise operation. It takes two k-bit numbers as its input and determines a K-bit number as its output. If but if but

[0108] In another example, downward addition can be performed. and is a K-bit number; without loss of generality, we assume that z1≥z2. KIt is a pairwise operation. It takes two K-bit numbers as its input and determines a K-bit number as its output. If but if but

[0109] In another example, both upward multiplication and downward multiplication can be performed. and is a K-digit number; if a1=0 or a2=0, the result is 0; therefore, assume that this is not the case. There exists L∈{2K-1,2K} such that 2 L-1 ≤a1a2<2 L . The upward multiplication operation is performed by It means that it is defined as Pairwise operation. Downward multiplication operation, by M K It means that it is defined as Pairwise operations.

[0110] In another example, both upward division and downward division can be performed. and is a K-digit number; assume a1≠0 or a2≠0. There exists L∈{0,1} such that The upward division operation is performed by It means that it is defined as Pairwise operation of . Downward division operation, by D K It means that it is defined as Pairwise operations.

[0111] Returning to the finite precision energy-based arithmetic coding process, parameters and / or configurations may be established between the WCD and the receiving WCD. For example, the parameters may include inputs such as an alphabet Definition, sequence length n and maximum sequence energy For finite precision configurations, an integer value parameter K can be defined a , K s , K s and K X , and the parameter η can be defined so that the coded bits are uniquely decodable. In one example, K a =12,K S =K s =K X =16 (e.g., a relatively small number compared to the size of the integer representation of the information bits to be encoded), and n =0.001.

[0112] This parameter may also include The parameter function log2U associated with two variables n and E cThe K parameters have values ​​that indicate the number of bits allowed to indicate the value.

[0113] With the parameters established, the WCD can initialize the encoding. The WCD can calculate the logarithm of the number of accumulated sequences. Approximate, and by Indicates an approximate value. The cumulative number of sequences Can be cardinality and count the total number of sequences such that 1) every element of every such sequence belongs to 2) each such sequence has length n, and 3) each such sequence has less than or equal to energy.

[0114] WCD can determine k as the largest integer such that the following conditions hold: WCD can obtain multiple k information bits u1,u2,…,u k The k bits can be interpreted as an unsigned integer x∈[0,2 k ), both of which can be used for encoding.

[0115] WCD can use finite precision coding to encode k bits u1,u2,…,u k Encoded as The symbol sequence s in n =(s1,s2,…,s n ).

[0116] Finite precision coding consists of n sequential iterations. The iteration index j is initialized to j = 0. The residual sequence length n j Associated with iteration index j and initialized to n j =n. The maximum residual sequence energy E j is associated with iteration index j and is initialized to Residual sequence counter M j is associated with iteration index j and is initialized to M j =2 k . Information integer x j is associated with iteration index j and is initialized to x j =x, every integer x j It is called the information integer or the updated information integer.

[0117] Finite precision encoding iterates the following, up to and including j = n-1. Iteration j is one or more log2N of the cumulative number of sequences. c (n j -1,E j -E(ai )) Each such cumulative number of sequences corresponds to the alphabet The corresponding symbols in (e.g., each cumulative sequence number is the same as the alphabet A m The sum of the number of sequences associated with the symbols of the alphabet. The size m (e.g., there are some cumulative sequences whose number is equal to the alphabet the number of symbols).

[0118] pass Represents the approximate value log2N c (n j -1,E j -E(a i )). Each approximation is represented as a fixed-point number with 1 sign bit, Q i The ones digit is used for the integer part and Q f The units digit is used for the fractional part. Iterate j to exponentiate one or more approximate values ​​to obtain one or more K a Each approximation corresponds to the corresponding K a The number of digits. The K a The number of digits is determined by and also represented by Considering E(a i ) <E(a i+1 ), these K a Number of digits In increasing order, e.g. For notational simplicity, the dependence on iteration index j is omitted.

[0119] During iteration j, WCD is based on K S bit and K a Number of digits Use downward addition Computes one or more partial sums. "Multiple" equals the alphabet The size is m.

[0120] WCD can initialize S0 = 0 and calculate the partial sum for i∈{1,2,…,m} Each partial sum is K s For iteration j, WCD is based at least in part on K s , sequence counter M j and part and S m , using the upward division operation Calculate the renormalization factor s′:

[0121] Also as part of iteration j, WCD is based on K X , renormalization factor s′ and partial sum S i , using upward multiplication Calculate one or more K X The number of digits X1, X2, ..., X m : The one or more K X The number of digits X1, X2, ..., X m Equal to the alphabet The size of m. In addition, 0=X0≤X1≤…≤X m .

[0122] During iteration j, the WCD is formulated as [X i-1 ,X i ) of one or more intervals. "Multiple" has an alphabet The number of members of m. Each corresponding interval corresponds to the alphabet The symbols in (for example, the interval [X i-1 ,X i ) corresponds to the symbol a i ). The interval [X i-1 ,X i ) corresponds to a length of n j -1 and the energy is at most E j -E(a i ) is an estimate of the number of uniquely decodable sequences.

[0123] Then, WCD determines the index i such that X i-1 ≤x j <X i In other words, the information integer x associated with iteration index j j In the interval [X i-1 ,X i The index i is determined at least in part based on the difference x j -X i-1 Compare with 0. Since K X Number of digits X i With a fixed width K X , so we judge x j -X i-1 Whether ≥ 0 holds for any i∈{1,2,…,m} only involves a fixed amount of computation. Then, WCD is based on K s , renormalization factor s′=a2 l For integers c ≥ 2, use upward addition. Calculate the renormalization factor s: The integer c satisfies

[0124] WCD is converted into j+1 =a i Determine the output symbol to continue iteration j, where the symbol of the sequence is the alphabet Then, WCD is based on K s , renormalization factor s and symbol a i The corresponding approximate value (where i is the determined index), using the upward multiplication operation Determine the residual sequence counter M associated with iteration index j+1 j+1 : Among them, M j+1 K s The number of digits.

[0125] WCD by n j+1 =n j -1 determines the residual sequence length n associated with iteration index j+1 j+1 , through E j+1 =E j -E(a i ) Update the residual maximum sequence energy E associated with iteration index j+1 j+1 , by calculating the subtraction x j+1 =x j -X i-1 The information integer x associated with iteration index j j Updated to the information integer x associated with iteration index j+1 j+1 In other words, for subsequent iterations, the information integer is updated to the difference between the information integer (eg, of the current iteration) and the interval boundary of the interval that includes the value of the information integer.

[0126] Then, iteration index j is incremented by 1, meaning the next iteration will begin. This completes the operation for iteration j, and the subsequent iteration is ready to begin. Finite-precision encoding advances to the next iteration and continues accordingly until j reaches n, where all symbols of the sequence have been selected to encode information bits, at which point encoding stops.

[0127] Figure 8 is a diagram of an example 800 associated with limited precision energy-based arithmetic coding according to the present disclosure. Figure 8As shown, a WCD (e.g., a UE, network node 110, CU, DU, and / or RU) can communicate with a receiver device (e.g., a UE, network node 110, CU, DU, and / or RU). In some aspects, the WCD and the receiver device can be part of a wireless network (e.g., wireless network 100). The WCD and the receiver device can be part of a wireless network (e.g., wireless network 100). Figure 8 The operations shown are performed after a wireless connection has been established.

[0128] As indicated by reference numeral 805, the WCD and receiver device may transmit and / or receive indications of parameters for limited-precision energy-based arithmetic coding. In some aspects, limited-precision energy-based arithmetic coding may be associated with probability amplitude shaping associated with maximum sequence energy.

[0129] In some aspects, the WCD and the receiver device may communicate parameters via one or more of RRC signaling, one or more MAC control elements (CEs), downlink control information (DCI), and / or sidelink control information (SCI), among others. In some aspects, the parameters may include an indication of one or more configuration parameters (e.g., known to the WCD and / or previously indicated by the receiver device) for selection by the receiver device and / or the WCD. In some aspects, the parameters may include an explicit indication of parameters to configure limited-precision energy-based arithmetic coding. For example, the indication of the parameters may include an index mapped to the parameters, an explicit indication of the parameters (e.g., an indication for each parameter), and / or an implicit indication of the parameters.

[0130] In some aspects, the parameters may include K a , K S , K s and K X and / or parameter n. These parameters may be associated with the precision of the finite-precision energy-based arithmetic coding. Additionally or alternatively, the parameters may use finite-precision energy-based arithmetic coding to generate unique decodability of the coded bits. In some aspects, the parameters may include a maximum sequence energy for a set of symbols in the amplitude symbol sequence.

[0131] As shown by reference numeral 810, the WCD may receive bits for encoding (e.g., k number of bits). For example, the bits for encoding may be referred to as information bits, which include information to be encoded by the WCD and sent to a receiver device. In some aspects, the WCD may encode these bits based at least in part on the parameters described in conjunction with reference numeral 805.

[0132] In some aspects, the WCD may perform subsequent operations to encode the bits.The WCD may encode the bits into a sequence having a length (eg, n), which may be an integer power of two.

[0133] The WCD may identify the information integer associated with the bits, as indicated by reference numeral 815. The information integer may be an unsigned integer representation of the information bits in decimal form.

[0134] As shown by reference numeral 820, the WCD may identify one or more numbers of candidate sequences based at least in part on a parameter, the one or more numbers having limited precision. For example, the WCD may identify one or more numbers of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol. The limited precision may be based at least in part on a value of the parameter.

[0135] In some aspects, the WCD may identify the one or more quantities based at least in part on approximating one or more logarithms of the one or more quantities of the candidate sequence and exponentiating the one or more logarithms of the one or more quantities of the candidate sequence (e.g., utilizing an approximation based at least in part on a parameter). The WCD may obtain one or more K values ​​corresponding to the approximations of the logarithms of the one or more quantities of the candidate sequence. a The number of digits. K a The number of bits can be a K-bit number, where the product of the first number and the second number is equal to 2 raised to a third power, where the third number is a positive integer. In some aspects, the WCD can exponentiate the approximate logarithm of the one or more quantities of the candidate sequence. In this way, limited precision is provided for the one or more quantities of the candidate sequence based at least in part on the logarithm and exponentiation operations, and computational complexity can be reduced.

[0136] The WCD may be based at least in part on the K associated with the partial sum. S The WCD may then calculate one or more K values ​​based at least in part on the value associated with the renormalization factor and the partial sum using a multiplication operation. x The number of digits.

[0137] In some aspects, each number of the number of candidate sequences is associated with a respective energy of the set of symbols.Additionally or alternatively, the number of the number of candidate sequences is based at least in part on a number of symbols of the set of symbols.

[0138] As indicated by reference numeral 825, the WCD may use the partial sum of the one or more quantities to identify interval boundaries. For example, a first interval boundary may be 0, a second interval boundary may be an estimated number of candidate sequences that, if the highest energy symbol is selected for the symbol value at position j of the sequence, may be used for the remaining elements of the sequence (e.g., based at least in part on satisfying the maximum energy). A third interval boundary may be an estimated number of candidate sequences that, if the next highest energy symbol is selected for the symbol value at position j of the sequence, may be used for the remaining elements of the sequence. Additional interval boundaries may be similarly calculated and estimated.

[0139] In some aspects, the WCD may identify one or more intervals having boundaries of the intervals, the intervals corresponding to candidate values ​​for the set of symbols for the symbol selected in the current iteration.

[0140] In some aspects, the partial sum is associated with the sum of: an approximate number of candidate sequences that satisfy the residual energy if the candidate symbol is selected, and one or more approximate numbers of candidate sequences that satisfy the residual energy if one or more additional candidate symbols having higher energy than the candidate symbol are selected. Each partial sum is K S The number of digits, where K S The number of bits is a K-bit number.

[0141] As shown by reference numeral 830, the WCD may select a symbol of the sequence to be transmitted (e.g., for iteration j, select the symbol at position j). For example, the WCD may select a symbol in the sequence of symbols based at least in part on the interval boundaries and the information integer to be encoded. The symbol may be a symbol associated with an interval formed by consecutive boundaries, where the upper boundary indicates a cumulative sum of candidate sequences that may be selected if the symbol or a symbol with higher energy is selected as the symbol at iteration j. For example, the WCD may identify an interval between a first interval boundary and a second interval boundary in the interval boundaries of the partial sum, the interval including the information integer. The WCD may select the symbol based at least in part on the symbol being associated with the interval. In some aspects, the first interval boundary and the second interval boundary include K x The number of bits (which is a number of K bits).

[0142] In some aspects, the symbol may be selected from a set of symbols (eg, a symbol alphabet) that are associated with the energy and / or amplitude of the transmitted signal.

[0143] As indicated by reference numeral 835, the WCD may update a value based at least in part on the symbol. In some aspects, the WCD may update the residual of the maximum sequence energy (used in subsequent iterations to identify candidate sequences that meet the residual of the maximum sequence energy for the remaining symbols of the sequence) (e.g., by subtracting the energy associated with the selected symbol). In some aspects, the WCD may update the length of the remaining symbols of the sequence (e.g., by subtracting 1), update the number of candidate sequences (based at least in part on the updated length and the updated residual of the maximum sequence energy), and / or update the information integer used to select a symbol in the symbol sequence (e.g., based at least in part on subtracting a lower interval boundary value of the interval associated with the selected symbol).

[0144] As indicated by reference numeral 840, the WCD may iterate until all members of the sequence are selected.

[0145] As shown by reference numeral 845, the WCD may transmit the encoded symbols for transmission. The encoded symbols may be encoded using the received bits for encoding and an iterative encoding operation (e.g., as shown in one or more of operations 815 through 835). In some aspects, the number of iterations of the operation is less than or equal to the length of the symbol sequence.

[0146] As indicated by reference numeral 850, the WCD may transmit, and the receiver device may receive, a communication including the sequence of symbols encoded using finite-precision energy-based arithmetic coding.

[0147] Based at least in part on encoding the bits into the symbol sequence using finite precision energy-based arithmetic coding, the WCD may conserve processing and power resources and improve latency for encoding information bits.

[0148] As indicated above, Figure 8 are provided as examples. Other examples can be found in the Figure 8 The examples described are different.

[0149] Figure 9 is a diagram illustrating an example process 900, performed, for example, by a WCD, in accordance with the present disclosure. Example process 900 is an example in which a WCD (eg, UE 120 or network node 110) performs operations associated with limited-precision energy-based arithmetic coding.

[0150] like Figure 9As shown, in some aspects, process 900 may include: encoding a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite precision energy-based arithmetic coding and including an iterative operation, the iterative operation including: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on a partial sum of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits (block 910). For example, a WCD (e.g., using Figure 10 The communication manager 140 or 150, or the communication manager 1006, depicted in , may encode a set of bits into a sequence of symbols, members of the sequence of symbols being included in a set of symbols, the encoding using finite precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members that are included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on a partial sum of the one or more quantities; and selecting a symbol in the sequence of symbols based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits, as described above.

[0151] like Figure 9 As further shown, in some aspects, process 900 may include sending a communication including the sequence of symbols encoded using the energy-based arithmetic coding with finite precision (block 920). Figure 10 The transmitting component 1004 and / or the communication manager 1006 depicted in FIG may transmit a communication comprising the sequence of symbols encoded using the finite precision energy-based arithmetic coding, as described above.

[0152] Process 900 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.

[0153] In a first aspect, based at least in part on selecting the symbol in the sequence of symbols, the iterative operation further comprises one or more of: updating a remaining amount of the maximum sequence energy, updating the length of remaining symbols of the sequence, updating the number of candidate sequences, or updating an information integer used to select the symbol in the sequence of symbols.

[0154] In a second aspect, alone or in combination with the first aspect, the iterative operation includes a number of iterations of the operation, the number of iterations being less than or equal to the length of the symbol sequence.

[0155] In a third aspect, either alone or in combination with one or more of the first and second aspects, each number of the number of candidate sequences is associated with a respective energy of the set of symbols, and wherein the number of the number of candidate sequences is based at least in part on the number of symbols of the set of symbols.

[0156] In a fourth aspect, alone or in combination with one or more of the first to third aspects, process 900 includes sending an indication of parameters for limited precision energy-based arithmetic coding, one of the parameters comprising a maximum sequence energy of a set of symbols in a sequence of amplitude symbols.

[0157] In a fifth aspect, alone or in combination with one or more of the first to fourth aspects, the iterative operation encodes the set of bits based at least in part on the parameter.

[0158] In a sixth aspect, either alone or in combination with one or more of aspects one to five, sending the indication of the parameter comprises one or more of: sending an index mapped to the parameter, sending an explicit indication of the parameter, or sending an implicit indication of the parameter.

[0159] In a seventh aspect, alone or in combination with one or more of the first to sixth aspects, the energy-based arithmetic coding is associated with probability amplitude shaping, which is associated with the maximum sequence energy.

[0160] In the eighth aspect, alone or in combination with one or more of the first to seventh aspects, the iterative operation further comprises one or more of the following: approximating one or more logarithms of the one or more quantities of the candidate sequence; exponentiating (e.g., exact or approximate exponentiation) the one or more logarithms of the one or more quantities of the candidate sequence; obtaining one or more K values ​​corresponding to the approximate values ​​of the logarithms of the one or more quantities of the candidate sequence. a The number of digits, where K a The number of bits is of length K aThe product of a first number and a second number of a binary expansion of , and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer; based at least in part on K associated with the partial sum S The number of bits, the sequence counter, and the partial sum, calculating a renormalization factor using a divide-up operation; and calculating one or more K using a multiplication-up operation based at least in part on a value associated with the renormalization factor and the partial sum. x or identifies one or more intervals having boundaries of the intervals, the intervals corresponding to candidate values ​​for the set of symbols of the symbol selected in the current iteration.

[0161] In a ninth aspect, alone or in combination with one or more of aspects 1 to 8, the partial sum is associated with a sum of: an approximate number of candidate sequences that satisfy the residual energy if the candidate symbol is selected, and one or more approximate numbers of candidate sequences that satisfy the residual energy if one or more additional candidate symbols having higher energy than the candidate symbol are selected, and wherein each partial sum is K S The number of digits, where K S The number of bits is of length K S The product of a first number and a second number in the binary expansion of , where the second number is equal to 2 raised to a third power, and the third number is a positive integer.

[0162] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, the length of the symbol sequence is an integer power of 2.

[0163] In the eleventh aspect, alone or in combination with one or more of the first to tenth aspects, selecting the symbol of the symbol sequence includes: identifying an interval between a first interval boundary and a second interval boundary in the interval boundary of the partial sum, the interval including the information integer; and selecting the symbol based at least in part on the symbol being associated with the interval.

[0164] In the twelfth aspect, alone or in combination with one or more of the first to eleventh aspects, the first interval boundary and the second interval boundary include K x The number of digits, where K x The number of bits is of length K x The product of a first number and a second number in a binary expansion of , and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer.

[0165] although Figure 9 Example blocks of process 900 are shown, but in some aspects, process 900 may include Figure 9900. In some embodiments, the process 900 may include additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in FIG. Additionally or alternatively, two or more blocks of the blocks of process 900 may be executed in parallel.

[0166] Figure 10 1 is a diagram of an example apparatus 1000 for wireless communication according to the present disclosure. Apparatus 1000 may be a WCD, or a WCD may include apparatus 1000. In some aspects, apparatus 1000 includes a receiving component 1002, a sending component 1004, and / or a communication manager 1006, which may communicate with each other (e.g., via one or more buses and / or one or more other components). In some aspects, communication manager 1006 is a communication manager that is configured to communicate with one another. Figure 1 The described communication manager 140 or 150. As shown, the device 1000 can communicate with another device 1008, such as a UE or a network node (such as a CU, DU, RU, or base station), using a receiving component 1002 and a sending component 1004.

[0167] In some aspects, the apparatus 1000 may be configured to perform Figure 8 Additionally or alternatively, the apparatus 1000 may be configured to perform one or more of the processes described herein, such as Figure 9 The process 900. In some aspects, Figure 10 The device 1000 and / or one or more components shown may include a combination of Figure 2 Additionally or alternatively, one or more components of the WCD described. Figure 10 One or more of the components shown may be combined Figure 2 Additionally or alternatively, one or more components in a set of components may be implemented at least in part as software stored in a memory. For example, a component (or a portion of a component) may be implemented as instructions or code that are stored in a non-transitory computer-readable medium and can be executed by a controller or processor to perform the function or operation of the component.

[0168] The receiving component 1002 may receive communications, such as reference signals, control information, data communications, or a combination thereof, from the apparatus 1008. The receiving component 1002 may provide the received communications to one or more other components of the apparatus 1000. In some aspects, the receiving component 1002 may perform signal processing (such as filtering, amplification, demodulation, analog-to-digital conversion, demultiplexing, deinterleaving, demapping, equalization, interference cancellation, or decoding, etc.) on the received communications and may provide the processed signals to one or more other components of the apparatus 1000. In some aspects, the receiving component 1002 may include processing the received communications in conjunction with one or more other components of the apparatus 1000. Figure 2One or more antennas, modems, demodulators, MIMO detectors, receive processors, controllers / processors, memories, or combinations thereof of the described WCDs.

[0169] The transmitting component 1004 may transmit communications, such as reference signals, control information, data communications, or a combination thereof, to the apparatus 1008. In some aspects, one or more other components of the apparatus 1000 may generate communications and may provide the generated communications to the transmitting component 1004 for transmission to the apparatus 1008. In some aspects, the transmitting component 1004 may perform signal processing (such as filtering, amplification, modulation, digital-to-analog conversion, multiplexing, interleaving, mapping, or encoding, etc.) on the generated communications and may transmit the processed signals to the apparatus 1008. In some aspects, the transmitting component 1004 may include a processor in conjunction with a processor. Figure 2 One or more antennas, modems, modulators, transmit MIMO processors, transmit processors, controllers / processors, memories, or combinations thereof of the described WCD. In some aspects, transmit component 1004 can be co-located with receive component 1002 in a transceiver.

[0170] The communications manager 1006 can support the operation of the receiving component 1002 and / or the sending component 1004. For example, the communications manager 1006 can receive information associated with configuring the receipt of communications by the receiving component 1002 and / or the sending of communications by the sending component 1004. Additionally or alternatively, the communications manager 1006 can generate and / or provide control information to the receiving component 1002 and / or the sending component 1004 to control the receipt and / or sending of communications.

[0171] The communication manager 1006 can encode a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more quantities of a candidate sequence having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on a partial sum of the one or more quantities; and selecting a symbol in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits. The transmitting component 1004 can transmit a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0172] Transmitting component 1004 can transmit an indication of parameters for limited precision energy-based arithmetic coding, one of the parameters comprising a maximum sequence energy for a set of symbols in the sequence of amplitude symbols.

[0173] Figure 10 The number and arrangement of components shown are provided as examples. In practice, there may be Figure 10 The components shown may include additional components, fewer components, different components, or components arranged in a different manner than those shown. Figure 10 Two or more components shown may be implemented in a single component, or Figure 10 The single component shown may be implemented as multiple distributed components. Additionally or alternatively, Figure 10 The illustrated set of components (one or more) may be described as being executable by Figure 10 Another group of components is shown performing one or more functions.

[0174] The following provides an overview of some aspects of the disclosure:

[0175] Aspect 1: A method of wireless communication performed by a wireless communication device (WCD), the method comprising: encoding a set of bits into a symbol sequence, members of the symbol sequence being included in a set of symbols, the encoding using finite-precision energy-based arithmetic coding and comprising an iterative operation, the iterative operation comprising: identifying one or more quantities of candidate sequences, the candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the symbol sequence, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on partial sums of the one or more quantities; and selecting symbols in the symbol sequence based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and sending a communication comprising the symbol sequence encoded using the finite-precision energy-based arithmetic coding.

[0176] Aspect 2: A method according to aspect 1, wherein, based at least in part on selecting the symbol in the symbol sequence, the iterative operation further includes one or more of the following: updating the remaining amount of the maximum sequence energy, updating the length of the remaining symbols of the sequence, updating the number of candidate sequences, or updating the information integer used to select the symbol in the symbol sequence.

[0177] Aspect 3: The method according to any one of aspects 1 to 2, wherein the iterative operation comprises a number of iterations of the operation, the number of iterations being less than or equal to the length of the symbol sequence.

[0178] Aspect 4: A method according to any one of aspects 1 to 3, wherein each of the numbers of candidate sequences is associated with a corresponding energy of the set of symbols, and wherein the number of candidate sequences is based at least in part on the number of symbols in the set of symbols.

[0179] Aspect 5: The method according to any one of aspects 1 to 4, further comprising: sending an indication of parameters for limited precision energy-based arithmetic coding, one of the parameters comprising a maximum sequence energy of a set of symbols in the amplitude symbol sequence.

[0180] Aspect 6: The method of aspect 5, wherein the iterative operation encodes the set of bits based at least in part on the parameter.

[0181] Aspect 7: The method according to aspect 5, wherein sending the indication of the parameter comprises one or more of: sending an index mapped to the parameter, sending an explicit indication of the parameter, or sending an implicit indication of the parameter.

[0182] Aspect 8: The method according to any one of aspects 1 to 7, wherein the energy-based arithmetic coding is associated with probability amplitude shaping, and the probability amplitude shaping is associated with the maximum sequence energy.

[0183] Aspect 9: The method according to any one of aspects 1 to 8, wherein the iterative operation further comprises one or more of the following: approximating one or more logarithms of the one or more quantities of the candidate sequence; exponentiating the one or more logarithms of the one or more quantities of the candidate sequence; obtaining one or more K values ​​corresponding to the approximations of the logarithms of the one or more quantities of the candidate sequence; a The number of digits, where K a The number of bits is of length K a The product of a first number and a second number of a binary expansion of , and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer; based at least in part on K associated with the partial sum S The number of bits, the sequence counter and the partial sum, calculating a renormalization factor using an upward division operation; and calculating one or more K using an upward multiplication operation based at least in part on a value associated with the renormalization factor and the partial sum. X or identifies one or more intervals having said interval boundaries, the intervals corresponding to candidate values ​​for the set of symbols of the symbol selected in the current iteration.

[0184] Aspect 10: A method according to any one of aspects 1 to 9, wherein the partial sum is associated with the sum of: an approximate number of candidate sequences that satisfy the residual energy if a candidate symbol is selected, and one or more approximate numbers of candidate sequences that satisfy the residual energy if one or more additional candidate symbols having higher energy than the candidate symbol are selected, and wherein each partial sum is K S The number of digits, where K S The number of bits is of length K S The product of a binary expansion of a first number and a second number, wherein the second number is equal to 2 raised to a third power, and the third number is a positive integer.

[0185] Aspect 11: The method according to any one of aspects 1 to 10, wherein the length of the symbol sequence is an integer power of 2.

[0186] Aspect 12: A method according to any one of Aspects 1 to 11, wherein selecting the symbol of the symbol sequence includes: identifying an interval between a first interval boundary and a second interval boundary in the interval boundaries of the partial sum, the interval including an information integer; and selecting the symbol at least in part based on the symbol being associated with the interval.

[0187] Aspect 13: The method according to aspect 12, wherein the first interval boundary and the second interval boundary include K x The number of digits, where K x The number of bits is of length K x The product of a binary expansion of a first number and a second number, and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer.

[0188] Aspect 14: An apparatus for wireless communication at a device, the apparatus comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform one or more of the methods described in aspects 1 to 13.

[0189] Aspect 15: A device for wireless communication, the device comprising: a memory and one or more processors, the one or more processors coupled to the memory, the one or more processors configured to perform the method according to one or more of aspects 1 to 13.

[0190] Aspect 16: A device for wireless communication, the device comprising: a memory and one or more processors, the one or more processors coupled to the memory, the memory comprising instructions, the instructions being executable by the one or more processors to cause the device to perform the method according to one or more of aspects 1 to 13.

[0191] Aspect 17: An apparatus for wireless communication, the apparatus comprising at least one component for performing the method according to one or more of aspects 1 to 13.

[0192] Aspect 18: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform the method according to one or more of aspects 1 to 13.

[0193] Aspect 19: A non-transitory computer-readable medium storing an instruction set for wireless communication, the instruction set comprising one or more instructions that, when executed by one or more processors of a device, cause the device to perform one or more of the methods described in aspects 1 to 13.

[0194] While the foregoing disclosure provides illustration and description, it is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of these aspects.

[0195] As used herein, the term "component" is intended to be broadly interpreted as a combination of hardware and / or hardware and software. Whether referred to as software, firmware, middleware, microcode, hardware description language or other names, "software" should be broadly interpreted as meaning instructions, instruction sets, codes, code segments, program codes, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, processes and / or functions, etc. As used herein, a "processor" is implemented in a combination of hardware and / or hardware and software. It will be apparent that the systems and / or methods described herein can be implemented by a combination of different forms of hardware and / or hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods does not limit various aspects. Therefore, no reference is made herein to specific software code to describe the operation and behavior of the systems and / or methods, as those skilled in the art will appreciate that software and hardware can be designed to implement the systems and / or methods based at least in part on the description herein.

[0196] As used herein, "satisfying a threshold" may mean that a value is greater than a threshold, greater than or equal to a threshold, less than a threshold, less than or equal to a threshold, equal to a threshold, not equal to a threshold, etc., depending on the context.

[0197] Although specific combinations of features are set forth in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of various aspects. Many of these features can be combined in a manner not specifically described in the claims and / or not disclosed in the specification. The disclosure of various aspects includes each dependent claim combined with each other claim in the claim set. As used herein, the phrase "at least one of" a list of items refers to any combination of these items (which includes a single member). As an example, "at least one of a, b, or c" is intended to encompass a, b, c, a+b, a+c, b+c, and a+b+c, as well as any combination of multiple identical elements (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 arrangement of a, b, and c).

[0198] The terms "determining" or "identifying" encompass a variety of actions, and thus, "determining" or "identifying" may include calculating, computing, processing, deriving, investigating, looking up (such as via looking up in a table, a database, or another data structure), ascertaining, etc. Additionally, "determining" or "identifying" may include receiving (such as receiving information or signaling, e.g., receiving information or signaling for determining, receiving information or signaling for identifying), accessing (such as accessing data in a memory or accessing information), etc. Additionally, "determining" or "identifying" may include resolving, obtaining, selecting, choosing, establishing, and other such similar actions.

[0199] Any element, action or instruction used herein should not be interpreted as key or necessary, unless explicitly described as such. In addition, as used herein, the articles "one" and "a kind of" are intended to include one or more projects and can be used interchangeably with "one or more". In addition, as used herein, the article "said" is intended to include one or more projects connected with the article "said", and can be used interchangeably with "one or more". In addition, as used herein, the terms "group" and "cluster" are intended to include one or more projects and can be used interchangeably with "one or more". If only want to refer to a project, then use the phrase "only one" or similar terms. In addition, as used herein, the terms "have", "have", "have" etc. are intended to be open terms, which do not limit the elements they modify (for example, "an element with" A can also have B). In addition, the phrase "based on" is intended to represent "at least partially based on", unless explicitly stated otherwise. Furthermore, as used herein, the term "or" when used in a series is intended to be open-ended and used interchangeably with "and / or" unless explicitly stated otherwise (e.g., if used in conjunction with "either" or "only one of").

Claims

1. A method of wireless communication performed by a wireless communication device (WCD), the method comprising: Encoding a set of bits into a symbol sequence, members of the symbol sequence being comprised in a set of symbols, the encoding using finite precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more quantities of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on the partial sums of the one or more quantities; and selecting symbols in the sequence of symbols based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and A communication is transmitted, the communication comprising the sequence of symbols encoded using the finite precision energy-based arithmetic coding.

2. The method of claim 1 , wherein based at least in part on selecting the symbol in the sequence of symbols, the iterating operation further comprises one or more of: Update the remaining amount of the maximum sequence energy, updating the length of the remaining symbols of the sequence, updating the number of candidate sequences, or An information integer used to select the symbol in the symbol sequence is updated.

3. The method of claim 1, wherein the iterative operation comprises a number of iterations of the operation, the number of iterations being less than or equal to a length of the symbol sequence.

4. The method of claim 1 , wherein each of the numbers of candidate sequences is associated with a respective energy of the set of symbols, and Wherein the number of candidate sequences is based at least in part on the number of symbols in the set of symbols.

5. The method according to claim 1, further comprising: An indication of parameters for limited precision energy-based arithmetic coding is sent, one of the parameters comprising a maximum sequence energy for a group of symbols in a sequence of magnitude symbols. The method of claim 5 , wherein the iterative operation encodes the set of bits based at least in part on the parameter.

7. The method of claim 5, wherein sending the indication of a parameter comprises one or more of: Send the index that maps to the parameter, Send an explicit indication of the parameter, or An implicit indication of the parameter is sent.

8. The method of claim 1, wherein the energy-based arithmetic coding is associated with probability amplitude shaping, the probability amplitude shaping being associated with the maximum sequence energy.

9. The method of claim 1 , wherein the iterative operation further comprises one or more of the following: approximating one or more logarithms of the one or more quantities of the candidate sequence; exponentiating the one or more logarithms of the one or more quantities of the candidate sequence; Obtain one or more K values ​​corresponding to approximate values ​​of the logarithm of the one or more quantities of the candidate sequence a The number of digits, where K a The number of bits is of length K a The product of a first number and a second number in a binary expansion of , wherein the second number is equal to 2 raised to a third power, and the third number is a positive integer; Based at least in part on K associated with the partial sum S the number of bits, the sequence counter and the partial sum, computing a renormalization factor using a divide-up operation; Based at least in part on the value associated with the renormalization factor and the partial sum, one or more K values ​​are calculated using an upward multiplication operation. X the number of digits; or One or more intervals having the interval boundaries are identified, the intervals corresponding to candidate values ​​for the set of symbols for the symbol selected in the current iteration.

10. The method of claim 1 , wherein the partial sum is associated with the sum of: an approximate number of candidate sequences that satisfy the residual energy if a candidate symbol is selected, and one or more approximate numbers of candidate sequences that satisfy the residual energy if one or more additional candidate symbols having higher energy than the candidate symbol are selected, and wherein each partial sum is K S The number of digits, where K S The number of bits is of length K S The product of a binary expansion of a first number and a second number, wherein the second number is equal to 2 raised to a third power, and the third number is a positive integer. The method according to claim 1 , wherein the length of the symbol sequence is an integer power of 2.

12. The method of claim 1 , wherein selecting the symbol of the symbol sequence comprises: identifying an interval between a first interval boundary and a second interval boundary in the interval boundaries of the partial sum, the interval including the information integer; as well as The symbol is selected based at least in part on being associated with the interval.

13. The method of claim 12, wherein the first interval boundary and the second interval boundary include K x The number of digits, where K x The number of bits is of length K x The product of a binary expansion of a first number and a second number, and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer.

14. A wireless communication device (WCD) for wireless communication, the wireless communication device (WCD) comprising: one or more processors; and a memory coupled to the one or more processors, the memory storing instructions executable by the one or more processors to cause the WCD to: Encoding a set of bits into a symbol sequence, members of the symbol sequence being comprised in a set of symbols, the encoding using finite precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more quantities of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; identifying interval boundaries based at least in part on the partial sums of the one or more quantities; and selecting symbols in the sequence of symbols based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and A communication is transmitted, the communication comprising the sequence of symbols encoded using the finite precision energy-based arithmetic coding.

15. The WCD of claim 14 , wherein based at least in part on selecting the symbol in the sequence of symbols, the iterative operation further comprises one or more of: Update the remaining amount of the maximum sequence energy, updating the length of the remaining symbols of the sequence, updating the number of candidate sequences, or An information integer used to select the symbol in the symbol sequence is updated.

16. The WCD of claim 14, wherein the iterative operation comprises a number of iterations of the operation, the number of iterations being less than or equal to a length of the symbol sequence.

17. The WCD of claim 14, wherein each of the numbers of candidate sequences is associated with a respective energy of the set of symbols, and Wherein the number of candidate sequences is based at least in part on the number of symbols in the set of symbols.

18. The WCD of claim 14, wherein the instructions are further executable by the one or more processors to cause the WCD to: An indication of parameters for limited precision energy-based arithmetic coding is sent, one of the parameters comprising a maximum sequence energy for a group of symbols in a sequence of magnitude symbols.

19. The WCD of claim 18, wherein the iterative operation encodes the set of bits based at least in part on the parameter.

20. The WCD of claim 18, wherein to send the indication of a parameter, the instructions are further executable by the one or more processors to cause the WCD to: Send the index that maps to the parameter, Send an explicit indication of the parameter, or An implicit indication of the parameter is sent.

21. The WCD of claim 14, wherein the energy-based arithmetic coding is associated with probability amplitude shaping, the probability amplitude shaping being associated with the maximum sequence energy.

22. The WCD of claim 14, wherein the iterative operation further comprises one or more of: approximating one or more logarithms of the one or more quantities of the candidate sequence; exponentiating the one or more logarithms of the one or more quantities of the candidate sequence; Obtain one or more K values ​​corresponding to approximate values ​​of the logarithm of the one or more quantities of the candidate sequence a The number of digits, where K a The number of bits is of length K a The product of a first number and a second number in a binary expansion of , wherein the second number is equal to 2 raised to a third power, and the third number is a positive integer; calculating a renormalization factor using a divide-up operation based at least in part on a number of K_S bits associated with the partial sum, a sequence counter, and the partial sum; computing one or more K_X-bit numbers using a multiply-up operation based at least in part on a value associated with the renormalization factor and the partial sum; or One or more intervals having the interval boundaries are identified, the intervals corresponding to candidate values ​​for the set of symbols for the symbol selected in the current iteration.

23. The WCD of claim 14 , wherein the partial sum is associated with a sum of: an approximate number of candidate sequences that satisfy the residual energy if a candidate symbol is selected, and one or more approximate numbers of candidate sequences that satisfy the residual energy if one or more additional candidate symbols having higher energy than the candidate symbol are selected, and wherein each partial sum is K S The number of digits, where K S The number of bits is of length K S The product of a binary expansion of a first number and a second number, wherein the second number is equal to 2 raised to a third power, and the third number is a positive integer.

24. The WCD of claim 14, wherein the length of the symbol sequence is an integer power of 2.

25. The WCD of claim 14, wherein to select the symbol of the symbol sequence, the instructions are further executable by the one or more processors to cause the WCD to: identifying an interval between a first interval boundary and a second interval boundary in the interval boundaries of the partial sum, the interval including an information integer; and The symbol is selected based at least in part on being associated with the interval.

26. The WCD of claim 25, wherein the first interval boundary and the second interval boundary comprise Kx-bit numbers, The number of Kx digits is a number with a length of K x The product of a binary expansion of a first number and a second number, and wherein the second number is equal to 2 raised to a third power, the third number being a positive integer.

27. A non-transitory computer-readable medium storing an instruction set for wireless communication, the instruction set comprising: One or more instructions that, when executed by one or more processors of a wireless communication device (WCD), cause the WCD to: Encoding a set of bits into a symbol sequence, members of the symbol sequence being comprised in a set of symbols, the encoding using finite precision energy-based arithmetic coding and comprising an iterative operation comprising: identifying one or more numbers of candidate sequences, the candidate sequences having a length of remaining symbols of the sequence after selecting a symbol in the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbols, the one or more amounts having finite precision; identifying interval boundaries based at least in part on the partial sums of the one or more quantities; and selecting symbols in the sequence of symbols based at least in part on the interval boundaries and an information integer to be encoded, the information integer being based at least in part on an integer representation of the set of bits; and A communication is transmitted, the communication comprising the sequence of symbols encoded using the finite precision energy-based arithmetic coding.

28. The non-transitory computer-readable medium of claim 27, wherein the one or more instructions further cause the WCD to perform one or more of the following based at least in part on selecting the symbol in the sequence of symbols: Update the remaining amount of the maximum sequence energy, updating the length of the remaining symbols of the sequence, updating the number of candidate sequences, or An information integer used to select the symbol in the symbol sequence is updated.

29. An apparatus for wireless communication, the apparatus comprising: Means for encoding a set of bits into a sequence of symbols, members of the sequence of symbols being comprised in a set of symbols, the encoding using finite precision energy-based arithmetic coding and comprising an iterative operation comprising: means for identifying one or more quantities of candidate sequences having a length of remaining symbols of the sequence after selecting a symbol of the sequence of symbols, having members included in the set of symbols, and satisfying a remaining amount of maximum sequence energy after using the selected symbol, the one or more quantities having finite precision; means for identifying interval boundaries based at least in part on the partial sums of the one or more quantities; and means for selecting symbols in said sequence of symbols based at least in part on said interval boundaries and an information integer to be encoded, said information integer being based at least in part on an integer representation of said set of bits; and Means for transmitting a communication comprising the sequence of symbols encoded using the finite precision energy-based arithmetic coding.

30. The apparatus of claim 29, further comprising means for, based at least in part on selecting the symbol in the sequence of symbols, doing one or more of: means for updating the remaining amount of said maximum sequence energy, means for updating said length of remaining symbols of said sequence, means for updating said number of said candidate sequences, or Means for updating an information integer used to select said symbol in said sequence of symbols.

Images