Techniques for reducing peak-to-average power ratio via rateless codes

Abstract

Techniques and apparatus for reducing peak-to-average power ratio (PAPR) via rateless codes are disclosed. In some aspects, a transmitter may generate sets of rateless code packets from sets of source packets, each rateless code packet corresponding to a different combination of one or more of the sets of source packets. The transmitter may select, from each subset of consecutive packets in the set of rateless code packets, one or more packets having the lowest PAPR among respective PAPRs associated with each packet included in the respective subset of consecutive packets. The transmitter may transmit a set of output packets including the one or more packets selected from each subset of consecutive packets in the set of rateless code packets. Numerous other aspects are described.

Description

[0001] Cross - Reference to Related Applications

[0002] This patent application claims priority to Patent Cooperation Treaty (PCT) Application No. PCT / CN2022 / 135291, entitled "TECHNIQUES FOR REDUCING PEAK - TO - AVERAGE POWER RATIO VIA RATELESS CODES", filed on November 30, 2022 and assigned to the assignee of the present application. The disclosure of the prior application is considered to be a part of this patent application and is incorporated herein by reference. Field of Technology

[0003] Aspects of the present disclosure generally relate to wireless communication and relate to techniques and apparatuses for reducing peak - to - average power ratio (PAPR) via rateless codes.

[0004] Description of Related Technology

[0005] Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, and broadcasting. A typical wireless communication system may employ multiple access techniques capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access techniques 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 / Advanced LTE is an enhanced collection of Universal Mobile Telecommunications System (UMTS) mobile standards promulgated by the 3rd Generation Partnership Project (3GPP).

[0006] 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. A UE may communicate with a network node via downlink communication and uplink communication. "Downlink" (or "DL") refers to the communication link from the network node to the UE, and "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., sidelink (SL), wireless local area network (WLAN) link, and / or wireless personal area network (WPAN) link, etc.).

[0007] These multiple access techniques have been adopted in various telecommunication standards to provide a common protocol that enables different UEs to communicate at the urban, national, regional, or global level. New Radio (NR), which may also be referred to as 5G, is an enhanced collection of LTE mobile standards promulgated by 3GPP. NR is designed to better support mobile broadband Internet access by using Orthogonal Frequency Division Multiplexing (OFDM) with Cyclic Prefix (CP) (CP-OFDM) on the downlink, CP-OFDM or Single Carrier Frequency Division Multiplexing (SC-FDM) (also known as Discrete Fourier Transform Spread OFDM (DFT-s-OFDM)) on the uplink, and supporting beamforming, Multiple-Input Multiple-Output (MIMO) antenna techniques, and carrier aggregation to improve spectral efficiency, reduce costs, improve services, utilize new spectra, and better integrate with other open standards. Summary of the Invention

[0008] Some aspects described herein relate to a method of wireless communication performed by a transmitter. The method may include generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets. The method may include selecting, from each consecutive packet subset of the set of rateless code packets, one or more packets having the lowest Peak-to-Average Power Ratio (PAPR) among the respective PAPRs associated with each packet included in the respective consecutive packet subset. The method may include transmitting a set of output packets, the set of output packets including the one or more packets selected from each consecutive packet subset of the set of rateless code packets.

[0009] Some aspects described herein relate to a transmitter for wireless communication. The transmitter may include a memory and one or more processors coupled to the memory. The one or more processors may be configured to generate a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets. The one or more processors may be configured to select, from each consecutive packet subset of the set of rateless code packets, one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive packet subset. The one or more processors may be configured to transmit a set of output packets, the set of output packets including the one or more packets selected from each consecutive packet subset of the set of rateless code packets.

[0010] Some aspects described herein relate to a non - transitory computer - readable medium that stores a set of instructions for wireless communication by a transmitter. The set of instructions, when executed by one or more processors of the transmitter, can cause the transmitter to generate a set of rateless - code packets from a set of source packets, each rateless - code packet corresponding to a different combination of one or more of the source packets. The set of instructions, when executed by one or more processors of the transmitter, can cause the transmitter to select, from each consecutive subset of packets in the set of rateless - code packets, one or more packets having the lowest peak - to - average power ratio (PAPR) among the respective PAPRs associated with each packet included in the consecutive subset of packets. The set of instructions, when executed by one or more processors of the transmitter, can cause the transmitter to transmit a set of output packets that includes the one or more packets selected from each consecutive subset of packets in the set of rateless - code packets.

[0011] Some aspects described herein relate to an apparatus for wireless communication. The apparatus can include means for generating a set of rateless - code packets from a set of source packets, each rateless - code packet corresponding to a different combination of one or more of the source packets. The apparatus can include means for selecting, from each consecutive subset of packets in the set of rateless - code packets, one or more packets having the lowest peak - to - average power ratio (PAPR) among the respective PAPRs associated with each packet included in the consecutive subset of packets. The apparatus can include means for transmitting a set of output packets that includes the one or more packets selected from each consecutive subset of packets in the set of rateless - code packets.

[0012] Aspects generally include methods, apparatuses, 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 figures and the specification and illustrated in the figures and the specification.

[0013] The features and technical advantages of examples in accordance with the present disclosure have been outlined rather broadly above so that the detailed description that follows may be better understood. Additional features and advantages will be described hereinafter. The disclosed concepts and specific examples can be readily used 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. When considered in conjunction with the accompanying figures, the characteristics (both the organization and method of operation) of the concepts disclosed herein, as well as the associated advantages, will be better understood. Each of the figures provided is for the purpose of illustration and description and not as a definition of the limits of the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] To gain a detailed understanding of the above features of the present disclosure, a more specific description of what was briefly outlined above can be obtained by referring to the various aspects, some of which are illustrated in the accompanying drawings. It should be noted, however, that the drawings only illustrate certain typical aspects of the present disclosure and are therefore not considered to limit its scope, as the specification may admit other equally valid aspects. The same reference numerals in different drawings may identify the same or similar elements.

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

[0016] Figure 2 is a diagram illustrating an example of a network node communicating with a user equipment (UE) in a wireless network according to the present disclosure.

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

[0018] Figure 4 and Figure 5 is a diagram illustrating an example of network decoding according to the present disclosure.

[0019] Figure 6 is a diagram illustrating an example of rateless code generation according to the present disclosure.

[0020] Figures 7A to 7D is a diagram illustrating an example associated with reducing the peak-to-average power ratio (PAPR) via a rateless code according to the present disclosure.

[0021] Figure 8 is a diagram illustrating an example process associated with reducing PAPR via a rateless code according to the present disclosure.

[0022] Figure 9 is a diagram of an example apparatus for wireless communication according to the present disclosure. Detailed Description

[0023] Aspects of the present disclosure are more fully described below with reference to the accompanying drawings. However, the present disclosure may be embodied in many different forms and should not be construed as limited to any specific structure or function presented throughout this disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Those skilled in the art should understand that the scope of the present disclosure is intended to cover any aspect of the disclosure disclosed herein, whether implemented independently of or in combination with any other aspect of the disclosure. For example, any number of the aspects set forth herein may be used to implement an apparatus or practice a method. In addition, the scope of the present disclosure is intended to cover such an apparatus or method practiced using other structures, functionality, or a combination of structures 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 invention.

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

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

[0026] Figure 1FIG. is a diagram illustrating an example of a wireless network 100. The wireless network 100 can be a 5G (e.g., NR) network or a 4G (e.g., Long Term Evolution (LTE)) network, or can include elements of a 5G (e.g., NR) network or elements of a 4G (e.g., Long Term Evolution (LTE)) network, and so on. The wireless network 100 can include one or more network nodes 110 (shown as network node 110a, network node 110b, network node 110c, and network node 110d), user equipment (UE) 120 or multiple UEs 120 (shown as UE 120a, UE 120b, UE 120c, UE 120d, and UE 120e), or other entities. The network node 110 is an example of a network node that communicates with the UE 120. As shown, the network node 110 can include one or more network nodes. For example, the network node 110 can be an aggregated network node, which means that the aggregated network node is 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). Another example is that the network node 110 can be a disaggregated network node (sometimes referred to as a disaggregated base station), which means that the network node 110 is configured to utilize a protocol stack that is physically or logically distributed among 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 a network node that communicates with UE 120 via a radio access link, such as a RU, or includes a network node that communicates with UE 120 via a radio access link, such as a RU. In some examples, network node 110 is a network node that communicates with other network nodes 110 via a fronthaul link or a midhaul link, such as a DU, or includes a network node that communicates with other network nodes 110 via a fronthaul link or a midhaul link, such as a DU. In some examples, network node 110 is a network node that communicates with other network nodes 110 via a midhaul link or communicates with a core network via a backhaul link, such as a CU, or includes a network node that communicates with other network nodes 110 via a midhaul link or communicates with a core network via a backhaul link, such as a CU. In some examples, network node 110 (such as an aggregated network node 110 or a disaggregated 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, or a transmit receive point (TRP), a DU, a RU, a CU, a mobility element of the network, a core network node, a network element, network equipment, a RAN node, or a combination thereof. In some examples, network node 110 may be interconnected with each other or with one or more other network nodes 110 in wireless network 100 via various types of fronthaul interfaces, midhaul interfaces, and / or backhaul interfaces (such as direct physical connections, air interfaces, or virtual networks, using any suitable transport network).

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

[0029] In some aspects, the term "base station" or "network node" can refer to an aggregated base station, a disaggregated base station, an integrated access and backhaul (IAB) node, a relay node, or one or more components thereof. For example, in some aspects, the "base station" or "network node" can refer to a CU, a DU, an 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" can refer to a single device configured to perform one or more functions, such as those described herein in connection with network node 110. In some aspects, the term "base station" or "network node" can refer to multiple devices configured to perform one or more functions. For example, in some distributed systems, each of multiple different devices (which can be located at the same geographical location or different geographical locations) can be configured to perform at least a portion of a function, or to repeat at least a portion of the function, and the term "base station" or "network node" can refer to any one or more of these different devices. In some aspects, the term "base station" or "network node" can 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 can be instantiated on a single device. In some aspects, the term "base station" or "network node" can refer to one base station function among base station functions, rather than another base station function. In this way, a single device can include more than one base station.

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

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

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

[0033] UEs 120 can be dispersed throughout the wireless network 100, and each UE 120 can be stationary or mobile. A UE 120 can include, for example, an access terminal, a terminal, a mobile station, or a subscriber unit. A UE 120 can be a cellular phone (e.g., a smart phone), 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 device, a camera, a gaming device, a netbook, a smartbook, a superbook, 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 a smart bracelet)), an entertainment device (e.g., a music device, a video device, 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, 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. The MTC UE or eMTC UE may include, for example, robots, drones, remote devices, sensors, meters, monitors, or location tags, which may 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, or may be implemented as narrowband IoT (NB-IoT) devices. Some UEs 120 may be considered customer premise equipment. The UE 120 may be included inside a housing that houses components of the UE 120, such as a processor component 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., a memory) may be operatively coupled, communicatively coupled, electronically coupled, or electrically coupled.

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

[0036] In some examples, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) may communicate directly using one or more sidelink channels (e.g., without using the network node 110 as an intermediary for communicating with each other). For example, the UE 120 may 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), or a mesh network. In such examples, the UE 120 may perform scheduling operations, resource selection operations, or other operations described elsewhere herein as being performed by the network node 110.

[0037] Devices of the wireless network 100 can communicate using the electromagnetic spectrum, which can be subdivided into various categories, bands, or channels by frequency or wavelength. For example, 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 Designation FR1 (410 MHz to 7.125 GHz) and FR2 (24.25 GHz to 52.6 GHz). Although a part of FR1 is greater than 6 GHz, in various documents and articles, FR1 is typically (interchangeably) referred to as the "sub-6 GHz" band. Regarding FR2, a similar naming issue sometimes occurs, which is typically (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 by the International Telecommunication Union (ITU) as the "millimeter wave" band.

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

[0039] Considering these examples, unless otherwise specifically stated, if the term "sub-6 GHz" is used herein, it can generally represent frequencies that can be less than 6 GHz, frequencies that can be within FR1, or frequencies that can include mid-band frequencies. In addition, unless otherwise specifically stated, if the term "millimeter wave" is used herein, it can broadly represent frequencies that can include mid-band frequencies, frequencies that can be within FR2, FR4, FR4-a, or FR4-1, or FR5, or frequencies that can be within the EHF band. It is conceivable that the frequencies included in these operating bands (e.g., FR1, FR2, FR3, FR4, FR4-a, FR4-1, or FR5) can be modified, and the techniques described herein apply to those modified frequency ranges.

[0040] In some aspects, the UE 120 may include a communication manager 140, and the network node 110 may include a communication manager 150. As described in more detail elsewhere herein, the communication manager 140 and / or the communication manager 150 may generate a set of rateless code packets from a source packet set, each rateless code packet corresponding to a different combination of one or more of the source packet set; select one or more packets having the lowest peak-to-average power ratio (PAPR) among the respective PAPRs associated with each packet included in each consecutive packet subset of the set of rateless code packets; and transmit an output packet set that includes the one or more packets selected from each consecutive packet subset of the set of rateless code packets. Additionally or alternatively, the communication manager 140 and / or 150 may perform one or more other operations described herein.

[0041] As indicated above, Figure 1 is provided as an example. Other examples may be different from the example(s) described with respect to Figure 1 the example(s) described.

[0042] Figure 2 is a diagram illustrating example 200 in which the network node 110 communicates with the UE 120 in the wireless network 100. 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 that facilitate direct communication with the UE 120, such as one or more CUs or one or more DUs.

[0043] At network node 110, transmit processor 220 may receive data destined for UE 120 (or a set of UEs 120) from data source 212. Transmit processor 220 may use one or more channel quality indicators (CQIs) received from UE 120 to select one or more modulation and coding schemes (MCSs) for UE 120. Network node 110 may process (e.g., encode and modulate) the data for UE 120 using the selected MCS for UE 120 and may provide data symbols to 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, 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 signal (CRS) or demodulation reference signal (DMRS)) and synchronization signals (e.g., primary synchronization signal (PSS) or secondary synchronization signal (SSS)). Transmit (TX) multiple-input multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on the data symbols, control symbols, overhead symbols, or reference symbols, if 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 the modulator component (shown as MOD) of modem 232. Each modem 232 may process the corresponding output symbol stream (e.g., for OFDM) using the corresponding modulator component to obtain an output sample stream. Each modem 232 may also process (e.g., convert to analog, amplify, filter, or up-convert) the output sample stream using the corresponding modulator component to obtain a downlink signal. 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 to 252r) may receive downlink signals from the network node 110 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 to 254r). For example, each received signal may be provided to a demodulator component (shown as DEMOD) of the modem 254. Each modem 254 may condition (e.g., filter, amplify, down-convert, or digitize) the received signal using the corresponding demodulator component to obtain input samples. Each modem 254 may further process the input samples (e.g., for OFDM) using the demodulator component to obtain received symbols. The MIMO detector 256 may obtain the received symbols from the modems 254, may perform MIMO detection on the received symbols if applicable, and may provide the detected symbols. The receive processor 258 may process (e.g., demodulate and decode) the detected symbols, may provide the decoded data for the UE 120 to the data sink 260, and may provide the 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 reference signal received power (RSRP) parameters, received signal strength indicator (RSSI) parameters, reference signal received quality (RSRQ) parameters, or CQI parameters, etc. In some examples, one or more components of the UE 120 may be included in the 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 or antennas 252a to 252r) may include or may be included within one or more of the following: one or more antenna panels, one or more antenna groups, one or more sets of antenna elements, or one or more antenna arrays, etc. The antenna panel, antenna group, set of antenna elements, or antenna array may include one or more antenna elements (within a single housing or multiple housings), a coplanar set of antenna elements, a non-coplanar set of antenna elements, or one or more antenna elements coupled to one or more transmit or receive components (such as Figure 2 one or more components) of

[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 from a controller / processor 280 (e.g., for reports including RSRP, RSSI, RSRQ, or CQI). The transmit processor 264 may generate reference symbols for one or more reference signals. Symbols from the transmit processor 264 may be precoded by a TX MIMO processor 266 when applicable, further processed by a 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, an MIMO detector 256, a receive processor 258, a transmit processor 264, or a TX MIMO processor 266. The transceiver may be used by a processor (e.g., the controller / processor 280) and a memory 282 to perform aspects of any of the processes described herein (e.g., with reference to Figures 7A to 7D , Figure 8 and / or Figure 9 ).

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

[0049] In some aspects, the controller / processor 280 can be a component of a processing system. A processing system can generally be a system or series of machines or components that receive inputs and process the inputs to produce outputs (which can be passed to other systems or components such as, for example, UE 120). For example, the processing system of UE 120 can be a system that includes various other components or sub-components of UE 120.

[0050] The processing system of UE 120 can interface with one or more other components of UE 120, process information (such as inputs or signals) received from one or more other components, or output information to one or more other components. For example, a chip or modem of UE 120 can include: a processing system, a first interface for receiving or obtaining information, and a second interface for outputting, transmitting, or providing information. In some examples, the first interface can be an interface between the processing system of the chip or modem and a receiver such that UE 120 can receive information or signal inputs and can pass the information to the processing system. In some examples, the second interface can be an interface between the processing system of the chip or modem and a transmitter such that UE 120 can transmit information output from the chip or modem. Those of ordinary skill in the art will readily recognize that the second interface can also obtain or receive information or signal inputs and that the first interface can also output, transmit, or provide information.

[0051] In some aspects, the controller / processor 240 can be a component of a processing system. A processing system can generally be a system or series of machines or components that receive inputs and process the inputs to produce outputs (which can be passed to other systems or components such as, for example, network node 110). For example, the processing system of network node 110 can be a system that includes various other components or sub-components of network node 110.

[0052] The processing system of network node 110 can interface with one or more other components of network node 110, process information (such as inputs or signals) received from one or more other components, or output information to one or more other components. For example, a chip or modem of network node 110 can include: a processing system, a first interface for receiving or obtaining information, and a second interface for outputting, transmitting, or providing information. In some examples, the first interface can be an interface between the processing system of the chip or modem and a receiver, such that network node 110 can receive information or signal inputs and pass the information to the processing system. In some examples, the second interface can be an interface between the processing system of the chip or modem and a transmitter, such that network node 110 can transmit the information output from the chip or modem. One of ordinary skill in the art will readily recognize that the second interface can also obtain or receive information or signal inputs, and the first interface can also output, transmit, or provide information.

[0053] The controller / processor 240 of network node 110, the controller / processor 280 of UE 120, or Figure 2 any other component therein can perform one or more techniques associated with reducing PAPR via rateless codes, as described in more detail elsewhere herein. In some aspects, the transmitter described herein is UE 120 and / or network node 110, is included in UE 120 and / or network node 110, or includes Figure 2 one or more components of UE 120 and / or network node 110 as shown. For example, the controller / processor 240 of network node 110, the controller / processor 280 of UE 120, or Figure 2 any other component (or combination of components) can perform or direct the operation of, for example, Figure 8 process 800 and / or other processes as described herein. Memories 242 and 282 can store data and program code for network node 110 and UE 120, respectively. In some examples, memories 242 and 282 can include non-transitory computer-readable media storing one or more instructions (e.g., code or program code) for wireless communication. For example, when the one or more instructions are executed (e.g., directly executed, or after compilation, conversion, or interpretation) by one or more processors of network node 110 or UE 120, the one or more processors, UE 120, or network node 110 can perform or direct the operation of, for example, Figure 8 process 800 and / or other processes as described herein. In some examples, executing the instructions can include running the instructions, converting the instructions, compiling the instructions, and / or interpreting the instructions, etc.

[0054] In some aspects, a transmitter includes: components for generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets; components for selecting, from each consecutive subset of the set of rateless code packets, one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive subset; and / or components for transmitting an output packet set that includes the one or more packets selected from each consecutive subset of the set of rateless code packets. In some aspects, the components for the transmitter to perform the operations described herein may include, for example, one or more of 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. Additionally or alternatively, the components for the transmitter to perform the operations described herein may include, for example, one or more of the following: 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.

[0055] Although Figure 2 the blocks in are illustrated as different components, the functions described above for these blocks may be implemented in a single hardware, software, or combined component or in various combinations of components. For example, the functions described for transmit processor 264, receive processor 258, and / or TX MIMO processor 266 may be performed by controller / processor 280 or under the control of the controller / processor.

[0056] As indicated above, Figure 2 is provided as an example. Other examples may be different from the example described with respect to Figure 2 described.

[0057] The deployment of a communication system (such as a 5G NR system) can be arranged with various components or constituent parts in various ways. In a 5G NR system or network, network nodes, network entities, mobility elements of the network, RAN nodes, core network nodes, network elements, base stations, or network equipment can be implemented in a centralized or decomposed architecture. For example, a base station (such as a Node B (NB), evolved NB (eNB), NR base station, 5G NB, access point (AP), TRP, or cell, etc.) or one or more units (or one or more components) performing base station functionality can be implemented as a centralized base station (also referred to as a stand-alone base station or a monolithic base station) or a decomposed base station. A "network entity" or "network node" can 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).

[0058] A centralized base station (e.g., a centralized network node) can be configured to utilize a radio protocol stack 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) can be configured to utilize a protocol stack physically or logically distributed among two or more units (such as one or more CUs, one or more DUs, or one or more RUs). In some examples, a CU can be implemented within a network node, and one or more DUs can be co-located with the CU, or alternatively, can be geographically or virtually spread across one or more other network nodes. A DU can be implemented to communicate with one or more RUs. Each of the CU, DU, and RU can 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), etc.

[0059] Base station type operations or network designs can consider the aggregation characteristics of base station functionality. For example, a decomposed base station can 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 the scaling of a communication system by separating base station functionality into one or more units that can be deployed independently. A decomposed base station can include functionality implemented across two or more units at various physical locations, as well as functionality implemented virtually for at least one unit, which can achieve flexibility in network design. The individual units of a decomposed base station can be configured for wired or wireless communication with at least one other unit of the decomposed base station.

[0060] Figure 3FIG. is an illustration of an example disaggregated base station architecture 300 in accordance with the present disclosure. The disaggregated 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 disaggregated control units (such as a near RT RIC 325 via an E2 link, or 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 DU in the DUs 330 may communicate with one or more RUs 340 via a respective fronthaul link. Each RU in the RUs 340 may communicate with one or more UEs 120 via a respective radio frequency (RF) access link. In some embodiments, a UE 120 may be served simultaneously by multiple RUs 340.

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

[0062] 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 embodiments, 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 units may communicate bi - directionally with the CU - CP units via an interface such as the E1 interface. As needed, the CU 310 may be implemented to communicate with the DU 330 for network control and signaling.

[0063] 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 at least part of the radio link control (RLC) layer, the medium access control (MAC) layer, and one or more of the higher physical (PHY) layers, at least in part according to a functional split (such as the functional split defined by 3GPP). In some aspects, one or more of the higher PHY layers may be implemented by one or more modules for forward error correction (FEC) encoding and decoding, scrambling, and modulation and demodulation, among others. In some aspects, the DU 330 may further 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, among others. Each layer (which may also be referred to as a module) may be implemented using an interface that is configured to communicate signals with other layers (and modules) hosted by the DU 330 or with control functions hosted by the CU 310.

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

[0065] The SMO framework 305 can be configured to support the RAN deployment and orchestration of non-virtualized network elements 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, and these dedicated physical resources can be managed via an operation 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 embodiments, the SMO framework 305 can communicate with the hardware aspect of the 4G RAN (such as the Open eNB (O-eNB) 311) via the O1 interface. Additionally, in some embodiments, the SMO framework 305 can communicate directly with each RU in one or more RUs 340 via the 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.

[0066] The non-RT RIC 315 can be configured to include logic functions that can implement 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 communicate with the near-RT RIC 325 (such as via the A1 interface). The near-RT RIC 325 can be configured to include logic functions that can implement near-real-time control and optimization of RAN elements and resources via an interface (such as via the E2 interface) through data collection and actions, and this interface (such as via the E2 interface) connects one or more CUs 310, one or more DUs 330, or both, and the O-eNB to the near-RT RIC 325.

[0067] In some specific implementations, in order to generate an AI / ML model to be deployed in the near-RT RIC 325, the non-RT RIC 315 can receive parameters or external enrichment information from an external server. 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 of performance and employ an AI / ML model to perform corrective actions through the SMO framework 305 (such as reconfiguration via the O1 interface) or via the creation of RAN management policies (such as A1 interface policies).

[0068] As indicated above, Figure 3 is provided as an example. Other examples may be different from the examples Figure 3 described.

[0069] Figure 4 is a diagram illustrating Example 400 of network decoding according to the present disclosure. Network decoding can also be referred to as erasure decoding and recovery. As Figure 4 shown, the encoder (or transmitter) can communicate with the decoder (or receiver). The encoder is sometimes also referred to as the transmitter, encoder node, or transmitter node. The encoder can include the UE 120, the network node 110, and / or the IAB device, etc. The decoder is sometimes also referred to as the receiver, decoder node, or receiver node. The decoder can include the UE 120, the network node 110, and / or the IAB device, etc.

[0070] As Figure 4 shown, the encoder (or transmitter) can use network decoding to encode data shown as a set of source packets or a set of original packets (S1, S2, and S3) into a set of encoded packets. AlthoughFigure 4 Using "packets" as example data, it should be understood that the data can include any type of communication (e.g., transport blocks) and is not limited to packets. The encoded packets can be the same as the source packets, can be a redundant version of the source packets, can include a combination of multiple source packets (e.g., a subset of the source packets), and / or can include a redundant version of a combination of multiple source packets. The number of encoded packets can be the same as or different from the number of source packets. In some aspects, the number of encoded packets can be unrestricted (e.g., the encoder can generate any number of encoded packets), such as when using a rateless network coding scheme. In Example 400, the encoder encodes K source packets (where K = 4) into N encoded packets (where N = 4). The encoder sends the encoded packets to the decoder (or receiver). The decoder uses network coding to decode the encoded packets and recover the source packets. As used herein, network coding can be performed using any type of network coding scheme, such as fountain coding, linear network coding, random linear network coding, Luby Transform (LT) network coding, and / or Raptor network coding, etc.

[0071] In Example 400, the encoder encodes three source packets (S1, S2, and S3) into four encoded packets: P1 (e.g., the packet carrying S2), P2 (e.g., the packet carrying S1 + S2), P3 (e.g., the packet carrying S1 + S3), and P4 (e.g., the packet carrying S2 + S3). The encoder can send the four encoded packets to the decoder. In this example, the decoder does not successfully receive packet P2 (carrying S1 + S2). In a first operation 405, the decoder decodes packet P1 (carrying S2). In a second operation 410, the decoder obtains S3 from packet P4 (carrying S2 + S3) because the decoder has decoded S2 and can use the combination to obtain S3 from S2 + S3. In a third operation 415, the decoder obtains S1 from packet P3 (carrying S1 + S3) because the decoder has decoded S3 and can use the combination to obtain S1 from S1 + S3. In some aspects, the encoded packets can include an indication (e.g., in the header of the encoded packet) that indicates the source packets included in the encoded packet. Thus, even though P2 fails, the decoder can still obtain S1, S2, and S3 and use less overhead than PDCP duplication. For example, PDCP duplication may duplicate all source packets for a total of six transmissions, while Figure 4 the example network coding shown uses only four transmissions.

[0072] In some cases, the encoder may continue to send encoded packets (e.g., the same combination of encoded packets or a different combination of encoded packets) to the decoder until the encoder receives a notification from the decoder. For example, the decoder may successfully receive the source packets or may abort decoding, which may trigger the decoder to transmit a notification to the encoder. The notification may include, for example, an acknowledgment (ACK) and / or a stop message. In some cases, the decoder may send an ACK for each original packet that is successfully received. Additionally or alternatively, the decoder may send an ACK upon successful receipt of all source packets. Upon receiving the notification, the encoder may encode additional data (e.g., a new set of source packets such as S4, S5, and S6) and may send the encoded packets to the decoder in a manner similar to that described above until all data has been sent and / or successfully received. Alternatively, to conserve network resources and reduce overhead, the encoder may not send an ACK or negative acknowledgment (NACK) for received packets.

[0073] In some cases, such as when using a Raptor network coding scheme, the encoder may perform internal coding or pre-coding to generate a set of intermediate packets from the source packets, the set of intermediate packets including a set of redundant packets. The redundant packets may be copies of the source packets or redundant versions of the source packets. In some aspects, the redundant packets may be low-density parity-check (LDPC) packets. For example, the encoder may apply internal coding to generate K' intermediate packets (e.g., original plus redundant packets from K source packets). The encoder may then perform external coding (e.g., fountain coding and / or LT network coding) to generate N encoded packets from the K' intermediate packets in a manner similar to that described above. Thus, the coding and / or decoding complexity of the Raptor network coding scheme may be linear. The encoded packets may include a set of systematic packets and a set of repair packets. In some aspects, the decoder may choose not to decode packets included in the set of systematic symbols that have a high decoding complexity (e.g., are associated with a high coding degree and / or are associated with a large number of source packets). The decoder may recover the source packets associated with the undecoded packets from one or more packets included in the set of repair packets. The one or more packets included in the set of repair packets may be associated with a lower decoding complexity. Thus, the decoding complexity may be reduced.

[0074] In some examples, network decoding can be considered a linear system with three variables and four linearly independent constraints (e.g., over a Galois field). For example, the three variables can correspond to source packets (e.g., S1, S2, and S3), and the four linearly independent constraints can correspond to four encoded packets. Using the linear system, any of the three variables that have been erased (e.g., transmission errors) can be recovered based at least in part on a portion of the three original packets and at least in part on a portion of the four encoded packets. Network decoding (e.g., erasure decoding and recovery) can enable a receiver to recover communications that have been erased (e.g., lost or corrupted) during transmission. Recovery of erased communications can reduce the total number of retransmissions by the transmitter and / or the total load on the network without requiring retransmission by the transmitter.

[0075] As indicated above, Figure 4 is provided as an example. Other examples may differ from the examples described with respect to Figure 4 the examples described.

[0076] Figure 5 is a diagram illustrating example 500 of network decoding according to the present disclosure. The operations described in connection with Figure 5 can be performed by a transmitter (also referred to as an encoder) such as UE 120 or network node 110.

[0077] As indicated by reference numeral 505, the transmitter can generate RLC service data units (SDUs) from one or more PDCP protocol data units (PDUs). In some aspects, a single PDCP PDU is included in an RLC SDU. In some aspects, multiple PDCP PDUs are included in an RLC SDU (e.g., by concatenating multiple PDCP PDUs). In some aspects, the transmitter determines whether to include a single PDCP PDU in a single RLC SDU or to concatenate multiple PDCP PDUs in a single RLC SDU based at least in part on the size of the PDCP PDU. For example, if the size of the PDCP PDU meets (e.g., is greater than or equal to) a threshold, the transmitter can include only the PDCP PDU (e.g., a single PDCP PDU) in a single RLC SDU. If the size of the PDCP PDU does not meet (e.g., is less than or equal to) the threshold, the transmitter can concatenate multiple PDCP PDUs (e.g., a set of PDCP PDUs having a total size less than or equal to the threshold) into a single RLC SDU.

[0078] As indicated by reference numeral 510, the transmitter can divide the RLC SDU into multiple data blocks. For example, the transmitter can divide the RLC SDU into K data blocks (shown as s1 to s K)。In some aspects, the network decoding parameter set specifies the value of K for a particular subset of parameters (such as the payload size of the RLC SDU and / or the size of the sequence number field in the RLC PDU header of the RLC SDU). In some aspects, the transmitter determines the value of K for the subset of parameters.

[0079] In some aspects, the operations associated with reference numerals 505 and 510 may be performed at the PDCP layer of the transmitter. The PDCP layer may provide these data blocks to the RLC layer of the transmitter. As shown by reference numeral 515, the transmitter may use network decoding to encode K data blocks into N FEC packets. For example, the transmitter may encode K data blocks into N FEC packets (shown as p1 to p n ) at least in part based on rateless codes such as network codes, fountain codes, LT codes, and / or Raptor codes, etc. Specifically, the transmitter may encode K data blocks into N FEC packets such that the N FEC packets include additional information or bits for FEC purposes. For example, regardless of which FEC packets are received, if the number of received FEC packets is greater than the number of K data blocks, then this allows the receiver to recover the FEC packets.

[0080] In some aspects, the number of RLC packets (e.g., the value of N) is at least in part based on the network decoding parameter set. In some aspects, the network decoding parameter set specifies: the value of N for a particular subset of parameters, the delay budget for the RLC SDU, the available encoding and decoding computational resources of the transmitter, the value of K (e.g., the number of data blocks), the target error probability for one or more RLC PDU packets for the N FEC packets, the channel conditions for transmitting the RLC PDU packets, and / or the type of network code to be used to encode K data blocks into N FEC packets, etc. In some aspects, the transmitter may determine the value of N for the subset of parameters.

[0081] As shown by reference numeral 520, the transmitter may map the N FEC packets to the corresponding M RLC PDU packets. For example, the transmitter may map the N FEC packets to M RLC PDU packets (shown as PDU1 to PDU m ) such that each RLC PDU includes multiple FEC packets (e.g., two FEC packets per RLC PDU packet, four FEC packets per RLC PDU packet, or another number of FEC packets per RLCPDU packet). In some aspects, the operations associated with reference numerals 515 and 520 are performed at the RLC layer of the transmitter. The RLC layer may receive an indication of the network decoding parameter set from the RRC layer and may perform the operations associated with reference numerals 515 and 520 at least in part based on the network decoding parameter set.

[0082] The RLC layer may provide M RLC PDU packets to the MAC layer of the transmitter. As shown by reference numeral 525, the transmitter may generate a MAC PDU for the M RLC PDU packets. In some aspects, the MAC PDU includes an RLC PDU header or a MAC PDU header, and the RLC PDU header or the MAC PDU header may include information associated with each of the M RLC PDUs. For example, the RLC PDU header or the MAC PDU header may include a sequence number field, and the sequence number field may indicate the sequence number associated with each of the M RLC PDUs. In some aspects, the operations associated with reference numeral 525 are performed at the MAC layer of the transmitter.

[0083] The MAC layer of the transmitter may provide the MAC PDU to the PHY layer of the transmitter. As shown by reference numeral 530, the transmitter may send M RLC PDU packets (e.g., in the MAC PDU) to a receiver (also referred to as a decoder), such as UE 120 or network node 110. In some aspects, the PHY layer of the transmitter may send the M RLC PDU packets (e.g., in the MAC PDU) on a wireless physical channel, such as a physical downlink shared channel (PDSCH), a physical downlink control channel (PDCCH), a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), a physical sidelink control channel (PSCCH), and / or a physical sidelink shared channel (PSSCH).

[0084] As indicated above, Figure 5 is provided as an example. Other examples may be different from the examples described with respect to Figure 5 those described.

[0085] Figure 6 FIG. 600 is a diagram illustrating an example 600 of rateless code generation according to the present disclosure. Rateless codes use a potentially infinite sequence of coded symbols. Thus, as long as the size of the subset is equal to or only slightly larger than the number of source symbols, the transmitted packet can be recovered from any subset of the coded symbols. Thus, rateless codes have a relatively low reception overhead (e.g., less than 2%) and a relatively high probability (e.g., up to and including 99.9999%). Some examples of rateless codes include fountain codes, such as LT codes and / or Raptor codes, and so on.

[0086] As Figure 6 shown, the rateless code uses a generator matrix G having K rows and an infinite number of columns. For example, K may depend on the size of the content to be encoded. The generator matrix G may be used to generate packets for transmission. For example, the packets for transmission may be encoded according to the following:

[0087]

[0088] where p j is the packet j for transmission, s k is part of the content to be encoded (e.g., the source packet), and G kj is the corresponding element of the generator matrix G. This equation is provided as an example. Other examples may be different from the equation described above.

[0089] As Figure 6 shown, only a subset of the transmitted packets is needed to recover the content. For example, the recovered packet can be decoded according to the following:

[0090]

[0091] where d k is part of the content to be recovered, p n is the received packet n, and is the corresponding element of the inverse of the generator matrix G. Therefore, as long as enough packets are received to estimate the generator matrix G to order K, and as long as the estimated matrix is invertible, the content can be recovered. This equation is provided as an example. Other examples may be different from the equation described above.

[0092] As indicated above, Figure 6 is provided as an example. Other examples may be different from the example described with respect to Figure 6 above.

[0093] Figures 7A to 7D is a diagram illustrating Example 700 associated with reducing PAPR via rateless codes according to the present disclosure. The operations described in connection with Figures 7A to 7D can be performed by a transmitter (also referred to as an encoder) such as UE 120 or network node 110 to reduce the PAPR associated with one or more OFDM signals transmitted over a wireless channel.

[0094] Specifically, OFDM is a multicarrier modulation technique that divides the available bandwidth into several orthogonal subcarriers transmitted at equal intervals. OFDM is generally considered an efficient multicarrier modulation technique that offers advantages such as resilience to RF interference, low multipath distortion, and increased spectral efficiency (e.g., due to ease of integration with MIMO). However, a transmitted OFDM signal (or OFDM waveform), where the output is a superposition of multiple subcarriers via an inverse fast Fourier transform (IFFT) operation, may sometimes have a high PAPR. For example, a transmitted OFDM signal is generally not associated with a constant analog transmit power. Instead, the instantaneous output of an OFDM signal can have large peaks, whereby the PAPR of a baseband OFDM signal that is continuous in time can be defined as the ratio between the maximum instantaneous power and the average power of the OFDM signal over a period of time. In some cases, the peaks in an OFDM signal can have detrimental effects such as spectral spreading and / or changes in the constellation signal (such as cloud shaping, attenuation, rotation, and / or warping). Generally speaking, in the case where the transmitter has a high PAPR, the average power can be significantly reduced relative to the constant saturation power. For example, the transmitter may need to operate the power amplifier in a linear manner to avoid signal distortion, where the PAPR of the transmitted signal typically determines the power back-off that can affect the efficiency of the power amplifier.

[0095] Accordingly, some aspects described herein relate to PAPR reduction techniques that may be implemented via rateless decoding techniques. For example, some aspects described herein relate to techniques that may use selective mapping (sometimes abbreviated as SLM) to reduce the PAPR associated with a transmitted signal. For example, the selective mapping technique may use u hypotheses to mask an original bit sequence to be transmitted, where the u hypotheses may each generate a candidate bit sequence associated with a PAPR value. Accordingly, a transmitter may select a mask associated with one or more of the u hypotheses that generate a candidate bit sequence having the lowest PAPR value, and may select the candidate bit sequence having the lowest PAPR value for transmission. In this example, a larger value of u generally may result in a larger performance improvement (e.g., because a larger number of hypotheses may generate more candidate bit sequences having lower PAPR values). However, one challenge that may arise when using the selective mapping technique to reduce the PAPR of a transmitted signal is the need for signaling to indicate which of the u hypotheses is used to mask the original bit sequence. For example, in a case where the transmitted bit sequence is generated by a particular mask sequence (e.g., a Gold sequence) having a particular random start number, the random start number may be signaled explicitly. Additionally or alternatively, the hypothesis used to mask the original bit sequence may be signaled implicitly, in which case signaling overhead is borne by sacrificing one or more information bits (e.g., in conjunction with a channel code) to indicate the hypothesis used to mask the original bit sequence. For example, a payload of log2(u) bits may be required to generate u sequences (e.g., two bits are required to carry an indication of which of four sequences is used to mask the original bit sequence in a transmitted signal).

[0096] Accordingly, some aspects described herein may be used to reduce the PAPR associated with a transmitted signal via a rateless code (e.g., based on the selective mapping technique described above). For example, as described herein, rateless decoding techniques generally may receive a set of source packets to be transmitted (e.g., a set of k source packets) and use a linear combination technique based on exclusive OR (XOR) relationships to generate a set of rateless code packets. For example, in the presence of ten (10) source packets (or source symbols), a rateless encoder may generate a set of rateless code packets, where the first rateless code packet corresponds to the first source packet, the second rateless code packet corresponds to the first source packet XORed with the second source packet, the third rateless code packet corresponds to the first source packet XORed with the third source packet, the fourth rateless code packet corresponds to the first source packet XORed with the fifth source packet, and so on.

[0097] In other words, given a set of k source packets, a rateless encoder may generate a set of up to 2 kA set of rateless code packets grouped, which can correspond to any suitable linear combination of source packets. In this case, if k is large enough, rateless codes can be used to construct transmitted packets with infinite transmission redundancy (e.g., for practical purposes, because the number of combinations 2 k will accordingly become large). In some aspects, the transmitter can then generate a set of output packets to be transmitted, where the output packets can be selected to have a low PAPR. For example, the set of rateless code packets can be partitioned or otherwise split into different subsets, and the transmitter can select a configured number of packets associated with the lowest PAPR in each subset. For example, in some aspects, the transmitter can select one packet associated with the lowest PAPR in each subset, or the transmitter can select multiple packets associated with the lowest PAPR in each subset. Thus, the transmitter can selectively transmit only the rateless code packets with the lowest PAPR value to reduce the PAPR associated with the transmitted signal. Additionally, because each rateless code packet is associated with a rateless code symbol index that defines an XOR relationship with one or more source packets, some aspects described herein can address issues related to the need to otherwise signal which sequence to use in the transmitted signal in selective mapping.

[0098] For example, as Figure 7A shown, reference numeral 702 depicts a set of source packets to be transmitted by a transmitter, where the set of source packets includes k source packets. As shown by reference numeral 704, in a first operation, the transmitter can generate a set of rateless code packets from the set of k source packets, where each rateless code packet corresponds to a different linear combination of one or more of the packets included in the set of source packets. For example, in some aspects, the set of rateless code packets can be generated in a manner similar to that described above with reference Figure 6 to. For example, given a set of k source packets, the generator matrix can include k rows and an infinite number of columns, which are indexed by one (1) to indicate which of the k source packets are selected and XORed in the set of rateless code packets, which typically includes more combinations than the set of source packets. As shown by reference numeral 706, in a second operation, the transmitter can perform an IFFT operation and a PAPR calculation on each rateless code packet. Thus, as shown by reference numeral 708, in a third operation, the transmitter can partition the set of rateless code packets into multiple subsets each including u consecutive packets, and the transmitter can select one or more packets with the lowest PAPR from each subset of u consecutive packets.

[0099] For example, as Figure 7AAs shown, u can have a value of four (4), whereby the transmitter can select one packet with the lowest PAPR from every four candidates and include the selected packet in the set of output packets to be transmitted. Additionally or alternatively, the selection based on PAPR can be configured to select multiple packets from a subset of candidate packets, such as selecting three packets with the lowest PAPR values from every twelve consecutive candidate packets. As shown by reference numeral 710, the transmitter can then transmit the set of output packets via a wireless channel to a receiver, where the set of output packets includes a reduced selection subset of rate - less code packets associated with low PAPR values (e.g., for each consecutive subset of packets within the set of rate - less code packets, the set of output packets includes one or more packets with the lowest PAPR value). Additionally or alternatively, as Figure 7B shown by reference numeral 712 in Figure 7B FIG. 4 depicts a usage scenario where u has a value of four (4), and the transmitter selects two packets with the lowest PAPR from every four candidates. Thus, the transmitter can generally select n packets with the lowest PAPR values from each group of u candidates, where n is an integer having a value in the range from 1 to u - 1. As Figure 7B shown by reference numeral 714 in

[0100] FIG. 5, the transmitter can then generate a set of output packets to be transmitted, where the set of output packets includes n packets selected from each group of u candidates.

[0100] Thus, referring to Figure 7C FIG. 6, reference numeral 720 depicts an example PAPR reduction that can be achieved using the rate - less decoding techniques described herein. For example, Figure 7C FIG. 7 illustrates a first graph and a second graph, each graph including PAPR values on the x - axis and the complementary cumulative distribution function (CCDF) on the y - axis, where the first graph and the second graph indicate the PAPR reduction that can be achieved with different values of u (e.g., using different values for the size of the consecutive subset of packets from which the transmitter selects the one or more packets associated with the lowest PAPR value). For example, the first (left - most) graph indicates the PAPR reduction that can be achieved for different values of u when the number of transmit sub - carriers N has a value of 1024 (meaning the transmitter performs 1024 IFFT operations). In the example illustrated, u values of 1, 2, 4, 8, and 16 are used, where the PAPR reduction generally increases as the value of u increases. Additionally, a similar PAPR reduction is shown in the second (right - most) graph, where the number of transmit sub - carriers N is 2048, and the PAPR reduction increases as the value of u increases.

[0101] In some aspects, as described herein, rateless code symbol indices can generally be used to determine the XOR relationship between the original (source) packets and the rateless code packets. For example, in a case where the set of source packets includes k source packets and the set of output packets sent to the receiver includes n output packets (e.g., in a case where the set of rateless code packets is partitioned into n groups, each group includes u consecutive packets and one packet with the lowest PAPR is selected from each of the n groups), the rateless code symbol index can indicate which columns in the generator matrix correspond to the output packets. In this context, it may be necessary to satisfy the rateless code recovery condition to ensure that the receiver can properly recover the rateless code. For example, if the set of source packets includes k source packets and the rateless code symbol index includes n bits, then if the number of consecutive packets u in each group satisfies the following rateless code recovery condition, the rateless code packets can be recovered by the receiver:

[0102]

[0103] where σ is a small fraction. For example, if the number of received packets includes n bits, then there are 2 n possible combinations, which defines an upper limit on the number of packets sent. Additionally, since selective mapping is performed to select the rateless code packet with the lowest PAPR, the actual number of hypotheses associated with the packets actually sent will be less than the upper limit, which is thus divided by the value of u. Therefore, to ensure successful reception, the transmitter may need to guarantee that the number of packets received by the receiver is at least greater than k multiplied by 1 plus σ, which can place a constraint on the possible values of u. For example, if the set of source packets includes 256 packets (k = 256) and the rateless code symbol index has 16 bits (n = 16, or two bytes), then the transmitter can support up to 2 7 values of u and does not need to expand the size of the rateless code symbol index because actual deployments generally constrain u to have a value no greater than 32 (or 2 5 ). However, if the set of source packets includes 64 packets (k = 64) and the rateless code symbol index has 8 bits (n = 8, or one byte), then the transmitter can support up to 2 values of u, in which case the number of bits in the rateless code symbol index may need to be increased to support values of u greater than 2. Additionally, in general, the value selected for u can be the maximum value that satisfies the rateless code recovery condition (e.g., up to 2 5 ), because PAPR reduction generally increases as the value of u increases.

[0104] In some aspects, as Figure 7DAs shown, the transmitter may be configured to modify the degree distribution for a set of output packets based on performing selective mapping (or selective block transmission) to transmit a set of output packets with the lowest PAPR value. For example, reference numeral 730 depicts a degree distribution in a typical scenario without selective mapping or selective block transmission, where the degree distribution includes a relatively high percentage of degree-one nodes to reduce receiver complexity. For example, given k source packets and n output packets, the "degree" of a node generally refers to the number of output packets that are directly connected to or otherwise associated with an input packet (e.g., indicating how many are activated in each column of the received matrix). Typically, the degree distribution is configured such that the (transmitted) output packets include more degree-one nodes, which can reduce receiver-side complexity because the receiver can use a simpler technique such as belief propagation (BP) to compute or recover the transmitted packets rather than a more complex algorithm such as Gaussian elimination. However, in the case of selective mapping or selective block transmission (e.g., in the case of selecting one packet with the lowest PAPR value out of every u packets for transmission), puncturing of degree-one nodes may be required during transmission, which can complicate receiver processing. Thus, as shown by reference numeral 732, the transmitter may be configured to modify the degree distribution of the set of output packets to increase the percentage of nodes (or transmitted packets) with a degree greater than one in the case of performing selective mapping or selective block transmission. For example, the degree distribution may be associated with the value of u, where a larger value of u may be associated with a larger percentage of nodes with a lower degree, and the degree distribution includes a relatively large number of packets with a degree of two or higher to balance decoder complexity and retain the benefits of the selective mapping technique.

[0105] As indicated above, Figures 7A to 7D is provided as an example. Other examples may be different from the example Figures 7A to 7D described.

[0106] Figure 8 is a diagram illustrating an example process 800 performed, for example, by a transmitter in accordance with the present disclosure. Example process 800 is an example where a transmitter (e.g., UE 120 and / or network node 110) performs operations associated with reducing PAPR via rateless codes.

[0107] As Figure 8 shown, in some aspects, process 800 may include generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets (block 810). For example, the transmitter (e.g., using Figure 9The communication manager 140 and / or 150 and / or the rateless coding component 908) depicted therein can generate a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets in the set of source packets, as described above.

[0108] As Figure 8 Further shown therein, in some aspects, process 800 may include selecting, from each consecutive subset of packets in the set of rateless code packets, one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive subset of packets (block 820). For example, a transmitter (e.g., using Figure 9 the communication manager 140 and / or 150 and / or the selective mapping component 910) depicted therein can select, from each consecutive subset of packets in the set of rateless code packets, one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive subset of packets, as described above.

[0109] As Figure 8 Further shown therein, in some aspects, process 800 may include transmitting a set of output packets that includes the one or more packets selected from each consecutive subset of packets in the set of rateless code packets (block 830). For example, a transmitter (e.g., using Figure 9 the communication manager 140 and / or 150 and / or the transmission component 904) depicted therein can transmit a set of output packets that includes the one or more packets selected from each consecutive subset of packets in the set of rateless code packets, as described above.

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

[0111] In a first aspect, the set of source packets includes k source packets, and the set of rateless code packets includes up to 2 k packets, each packet corresponding to a different combination of one or more of the k source packets.

[0112] In a second aspect, either alone or in combination with the first aspect, each packet in the set of rateless code packets is associated with a rateless code symbol index that defines an XOR relationship with one or more of the source packets in the set of source packets.

[0113] In a third aspect, either alone or in combination with one or more of the first and second aspects, the number of packets included in each consecutive packet subset satisfies a rateless code recovery condition that is at least partially based on the number of packets included in the source packet set and the number of bits associated with the rateless code symbol index.

[0114] In a fourth aspect, either alone or in combination with one or more of the first to third aspects, the number of packets included in each consecutive packet subset is the maximum value that satisfies the rateless code recovery condition.

[0115] In a fifth aspect, either alone or in combination with one or more of the first to fourth aspects, the percentage of packets in the output packet set having a degree greater than one is at least partially based on selecting the one or more packets having the lowest PAPR from each consecutive packet subset.

[0116] In a sixth aspect, either alone or in combination with one or more of the first to fifth aspects, the output packet set is associated with a degree distribution that is at least partially based on the number of packets included in each consecutive packet subset.

[0117] In a seventh aspect, either alone or in combination with one or more of the first to sixth aspects, selecting the one or more packets having the lowest PAPR from each consecutive packet subset includes selecting a single packet having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive packet subset from each consecutive packet subset in the rateless code packet set.

[0118] In an eighth aspect, either alone or in combination with one or more of the first to seventh aspects, selecting the one or more packets having the lowest PAPR from each consecutive packet subset includes selecting a plurality of packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive packet subset from each consecutive packet subset in the rateless code packet set.

[0119] Although Figure 8 example blocks of process 800 are shown, in some aspects, process 800 may include additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner compared to those depicted. Additionally or alternatively, two or more blocks of process 800 may be executed in parallel. Figure 8

[0120] Figure 9 ​FIG. 0 is a diagram of an example apparatus 900 for wireless communication in accordance with the present disclosure. The apparatus 900 may be a transmitter, or the transmitter may include the apparatus 900. In some aspects, the apparatus 900 includes a receiving component 902 and a transmitting component 904, which may communicate with each other (e.g., via one or more buses and / or one or more other components). As shown, the apparatus 900 may communicate with another apparatus 906 (such as a UE, a base station, or another wireless communication device) using the receiving component 902 and the transmitting component 904. As further shown, the apparatus 900 may include a communication manager 140 and / or a communication manager 150. The communication manager 140 and / or 150 may include one or more of a rateless coding component 908 or a selective mapping component 910, etc.

[0121] In some aspects, the apparatus 900 may be configured to perform one or more operations described herein in connection with Figures 7A to 7D Additional or alternatively, the apparatus 900 may be configured to perform one or more processes described herein, such as Figure 8 process 800. In some aspects, Figure 9 The apparatus 900 and / or one or more components shown in Figure 2 may include one or more components of a UE and / or a network node described in connection with Figure 9 Additional or alternatively, Figure 2 one or more of the components shown may be implemented within one or more of the components described in connection with

[0122] The receiving component 902 may receive communications from the apparatus 906, such as reference signals, control information, data communications, or combinations thereof. The receiving component 902 may provide the received communications to one or more other components of the apparatus 900. In some aspects, the receiving component 902 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 the one or more other components of the apparatus 900. In some aspects, the receiving component 902 may include one or more antennas, modems, demodulators, MIMO detectors, receiving processors, controllers / processors, memories, or combinations thereof of a transmitter described in connection with Figure 2

[0123] The transmitting component 904 may send communications to the device 906, such as reference signals, control information, data communications, or combinations thereof. In some aspects, one or more other components of the device 900 may generate the communications and may provide the generated communications to the transmitting component 904 for transmission to the device 906. In some aspects, the transmitting component 904 may perform signal processing (such as filtering, amplification, modulation, digital-to-analog conversion, multiplexing, interleaving, mapping, or coding, etc.) on the generated communications, and may send the processed signals to the device 906. In some aspects, the transmitting component 904 may include one or more antennas, modems, modulators, transmit MIMO processors, transmit processors, controllers / processors, memories, or combinations thereof of the transmitter described in conjunction with Figure 2 the one or more antennas, modems, modulators, transmit MIMO processors, transmit processors, controllers / processors, memories, or combinations thereof of the transmitter described in conjunction with

[0124] The rateless coding component 908 may generate a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets in the set. The selective mapping component 910 may select one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in each consecutive packet subset from the set of rateless code packets. The transmitting component 904 may send an output packet set that includes the one or more packets selected from each consecutive packet subset of the set of rateless code packets.

[0125] Figure 9 The number and arrangement of the components shown are provided as an example. In an implementation, there may be additional components, fewer components, different components, or components arranged in a different manner compared to those shown. Additionally, Figure 9 compared to those shown. Additionally, Figure 9 two or more of the components shown may be implemented within a single component, or Figure 9 a single component shown may be implemented as multiple distributed components. Additionally or alternatively, Figure 9 a set of the (one or more) components shown may perform one or more functions described as being performed by another set of components shown in Figure 9 a set of the components shown.

[0126] An overview of some aspects of the present disclosure is provided below:

[0127] Aspect 1: A wireless communication method performed by a transmitter, the method comprising: generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets in the set of source packets; selecting, from each consecutive subset of the set of rateless code packets, one or more packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive subset; and transmitting a set of output packets, the set of output packets including the one or more packets selected from each consecutive subset of the set of rateless code packets.

[0128] Aspect 2: The method according to aspect 1, wherein the set of source packets includes k source packets, and wherein the set of rateless code packets includes up to 2 k packets, each packet corresponding to a different combination of one or more of the k source packets.

[0129] Aspect 3: The method according to any one of aspects 1 and 2, wherein each packet in the set of rateless code packets is associated with a rateless code symbol index defining an XOR relationship with one or more of the source packets in the set of source packets.

[0130] Aspect 4: The method according to aspect 3, wherein the number of packets included in each consecutive subset satisfies a rateless code recovery condition, the rateless code recovery condition being at least partially based on the number of packets included in the set of source packets and the number of bits associated with the rateless code symbol index.

[0131] Aspect 5: The method according to aspect 4, wherein the number of packets included in each consecutive subset is the maximum value that satisfies the rateless code recovery condition.

[0132] Aspect 6: The method according to any one of aspects 1 to 5, wherein the percentage of packets having a degree greater than one in the set of output packets is at least partially based on selecting the one or more packets having the lowest PAPR from each consecutive subset.

[0133] Aspect 7: The method according to any one of aspects 1 to 6, wherein the set of output packets is associated with a degree distribution, the degree distribution being at least partially based on the number of packets included in each consecutive subset.

[0134] Aspect 8: The method according to any one of aspects 1 to 7, wherein selecting the one or more packets having the lowest PAPR from each consecutive subset includes selecting a single packet having the lowest PAPR among the respective PAPRs associated with each packet included in each consecutive subset of the set of rateless code packets.

[0135] Aspect 9: The method according to any one of Aspects 1 to 7, wherein selecting the one or more packets having the lowest PAPR from each consecutive subset of packets comprises selecting, from each consecutive subset of packets in the rateless code packet set, a plurality of packets having the lowest PAPR among the respective PAPRs associated with each packet included in the consecutive subset of packets.

[0136] Aspect 10: 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 the method according to one or more of Aspects 1 to 9.

[0137] Aspect 11: A device for wireless communication, the device comprising: a memory and 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 9.

[0138] Aspect 12: 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 9.

[0139] Aspect 13: 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 9.

[0140] Aspect 14: 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 the method according to one or more of Aspects 1 to 9.

[0141] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations may be made in light of the above disclosure, or may be obtained from practice of the aspects.

[0142] As used herein, the term "component" is intended to be broadly construed as hardware, firmware, or a combination of hardware and software. As used herein, a processor is implemented as hardware, firmware, or a combination of hardware and software. As used herein, the phrase "based on" is intended to be broadly construed as "at least partially based on". As used herein, depending on the context, "meeting a threshold" may mean a value greater than the threshold, greater than or equal to the threshold, less than the threshold, less than or equal to the threshold, equal to the threshold, not equal to the threshold, and so on. As used herein, the phrase referring to "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 cover: a, b, c, a + b, a + c, b + c, and a + b + c.

[0143] In addition, as used herein, the article "a" is intended to include one or more items and may be used interchangeably with "one or more". Additionally, as used herein, the article "the" is intended to include the one or more items mentioned in connection with the article "the" and may be used interchangeably with "one or more". Further, as used herein, the terms "set" and "group" are intended to include one or more entries (e.g., related entries, unrelated entries, or a combination of related and unrelated entries) and may be used interchangeably with "one or more". If one merely wishes to refer to a single item, the phrase "only one" or similar terminology will be used. Moreover, as used herein, terms such as "having" and similar terms are intended to be open-ended terms that do not limit the elements they modify (e.g., an element that "includes" A may also contain B). Additionally, as used herein, the term "or" when used in a sequence is intended to be inclusive and may be used interchangeably with "and / or" unless otherwise expressly stated (e.g., when used in conjunction with "any one of" or "only one of").

[0144] The various illustrative logical, logical block, modules, circuits, and algorithmic processes described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or a combination of both. The interchangeability of hardware and software has been generally described in terms of functionality and illustrated in various illustrative components, blocks, modules, circuits, and processes described herein. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.

[0145] The hardware and data processing apparatus for implementing or performing the various illustrative logics, logic blocks, modules, and circuits described in connection with the aspects disclosed herein can be implemented or performed using a general-purpose single-chip or multi-chip processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic components, discrete hardware components, or any combination thereof that are designed to perform the functions described herein. The general-purpose processor can be a microprocessor, or any conventional processor, controller, microcontroller, or state machine. The processor can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. In some aspects, the specific processes and methods can be performed by circuitry dedicated to a given function.

[0146] In one or more aspects, the described functions can be implemented in hardware, digital electronic circuits, computer software, firmware, including the structures disclosed in this specification and their structural equivalents, or any combination thereof. Aspects of the subject matter described in this specification can also be implemented as one or more computer programs (such as one or more modules of computer program instructions) encoded on a computer storage medium for execution by, or to control the operation of, a data processing apparatus.

[0147] If implemented in software, the functions can be stored on or transmitted via a computer-readable medium as one or more instructions or code. The processes of the methods or algorithms disclosed herein can be implemented in a processor-executable software module that can reside on a computer-readable medium. The computer-readable medium includes both computer storage media and communication media, and the communication media includes any medium that can be used to transfer a computer program from one place to another. The storage media can be any available medium accessible by a computer. By way of example and not limitation, such computer-readable media can include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired program code in the form of instructions or data structures and that can be accessed by a computer. Additionally, any connection can be properly termed a computer-readable medium. As used herein, disk and optical disk include compact disk (CD), laser disk, optical disk, digital versatile disk (DVD), floppy disk, and Blu-ray disk, where disks typically reproduce data magnetically, while optical disks reproduce data optically with lasers. Combinations of the media described herein should also be included within the scope of computer-readable media. Additionally, the operations of a method or algorithm can be as a code and instruction set or any combination of a code and instruction set that resides on a machine-readable medium and a computer-readable medium, which can be incorporated into a computer program product.

[0148] Various modifications to the aspects described in this disclosure may be apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the spirit or scope of the disclosure. Thus, the claims are not intended to be limited to the aspects shown herein but are to be accorded the broadest scope consistent with the disclosure, the principles disclosed herein, and the novel features.

[0149] Additionally, those of ordinary skill in the art will readily recognize that the terms "upper" and "lower" are sometimes used for ease of describing the figures and indicate relative positions corresponding to the orientation of the figures on a properly oriented page and may not reflect the correct orientation of any device as implemented.

[0150] Certain features described in the context of separate aspects in this specification may also be implemented in combination in a single aspect. Conversely, the various features described in the context of a single aspect may also be implemented separately or in any suitable sub-combination in multiple aspects. Additionally, although features may be described as acting in certain combinations and even initially claimed as such, one or more features from the claimed combination may in some cases be excluded from the combination, and the claimed combination may be directed to a sub-combination or a variation of a sub-combination.

[0151] Similarly, although operations are depicted in the figures in a particular order, this should not be construed as requiring that such operations be performed in the particular order shown or in a sequential order, or that all of the illustrated operations be performed to achieve the desired result. Additionally, the figures may schematically depict one or more example processes in the form of a flowchart. However, other operations not depicted may be incorporated into the example processes schematically illustrated. For example, one or more additional operations may be performed before, after, simultaneously with, or between any of the illustrated operations. In certain environments, multitasking and parallel processing are advantageous. Additionally, the separation of the various system components in the aspects described should not be understood as requiring such separation in all aspects, and it should be understood that the described program components and systems may generally be integrated together in a single software product or packaged into multiple software products. Additionally, other aspects also fall within the scope of the appended claims. In some cases, the acts recited in the claims may be performed in a different order and still achieve the desired result.

Claims

1. A wireless communication method performed by a transmitter, the method comprising: generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets; selecting, from each consecutive subset of packets in the set of rateless code packets, one or more packets having the lowest peak-to-average power ratio (PAPR) among the respective PAPRs associated with each packet included in the consecutive subset of packets; and transmitting a set of output packets, the set of output packets including the one or more packets selected from each consecutive subset of packets in the set of rateless code packets.

2. The method according to claim 1, wherein the set of source packets comprises k source packets, and wherein the set of rateless code packets comprises up to 2 k packets, each corresponding to a different combination of one or more of the k source packets.

3. The method according to claim 1, wherein each packet in the set of rateless code packets is associated with a rateless code symbol index that defines an exclusive OR (XOR) relationship with one or more of the source packets.

4. The method according to claim 3, wherein the number of packets included in each consecutive subset of packets satisfies a rateless code recovery condition, the rateless code recovery condition being at least partially based on the number of packets included in the set of source packets and the number of bits associated with the rateless code symbol index.

5. The method according to claim 4, wherein the number of packets included in each consecutive subset of packets is the maximum value that satisfies the rateless code recovery condition.

6. The method according to claim 1, wherein the percentage of packets having a degree greater than one in the set of output packets is at least partially based on selecting the one or more packets having the lowest PAPR from each consecutive subset of packets.

7. The method according to claim 1, wherein the set of output packets is associated with a degree distribution, the degree distribution being at least partially based on the number of packets included in each consecutive subset of packets.

8. The method according to claim 1, wherein selecting the one or more packets having the lowest PAPR from each consecutive subset of packets comprises: selecting a single packet having the lowest PAPR among the respective PAPRs associated with each packet included in each consecutive subset of packets in the set of rateless code packets.

9. The method according to claim 1, wherein selecting the one or more packets having the lowest PAPR from each consecutive subset of packets comprises: selecting a plurality of packets having the lowest PAPR among the respective PAPRs associated with each packet included in each consecutive subset of packets in the set of rateless code packets.

10. A transmitter for wireless communication, the transmitter comprising: a memory; and one or more processors coupled to the memory, the one or more processors being configured to: generate a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the source packets; Select one or more packets having the lowest peak-to-average power ratio (PAPR) among the respective peak-to-average power ratios (PAPRs) associated with each packet included in each consecutive packet subset from the set of rateless code packets; and Transmit a set of output packets, the set of output packets including the one or more packets selected from each consecutive packet subset from the set of rateless code packets.

11. The transmitter according to claim 10, wherein the set of source packets includes k source packets, and wherein the set of rateless code packets includes up to 2k packets, each packet corresponding to a different combination of one or more of the k source packets.

12. The transmitter according to claim 10, wherein each packet in the set of rateless code packets is associated with a rateless code symbol index defining an exclusive-or (XOR) relationship with one or more of the set of source packets.

13. The transmitter according to claim 12, wherein the number of packets included in each consecutive packet subset satisfies a rateless code recovery condition, the rateless code recovery condition being at least partially based on the number of packets included in the set of source packets and the number of bits associated with the rateless code symbol index.

14. The transmitter according to claim 13, wherein the number of packets included in each consecutive packet subset is the maximum value that satisfies the rateless code recovery condition.

15. The transmitter according to claim 10, wherein the percentage of packets having a degree greater than one in the set of output packets is at least partially based on selecting the one or more packets having the lowest PAPR from each consecutive packet subset.

16. The transmitter according to claim 10, wherein the set of output packets is associated with a degree distribution, the degree distribution being at least partially based on the number of packets included in each consecutive packet subset.

17. A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including: One or more instructions that, when executed by one or more processors of a transmitter, cause the transmitter to: Generate a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the set of source packets; Select one or more packets having the lowest peak-to-average power ratio (PAPR) among the respective peak-to-average power ratios (PAPRs) associated with each packet included in each consecutive packet subset from the set of rateless code packets; and Transmit a set of output packets, the set of output packets including the one or more packets selected from each consecutive packet subset from the set of rateless code packets.

18. The non-transitory computer-readable medium according to claim 17, wherein the set of source packets includes k source packets, and wherein the set of rateless code packets includes up to 2k packets, each packet corresponding to a different combination of one or more of the k source packets.

19. The non-transitory computer-readable medium according to claim 17, wherein each packet in the set of rateless code packets is associated with a rateless code symbol index that defines an exclusive-or (XOR) relationship with one or more of the packets in the set of source packets.

20. The non-transitory computer-readable medium according to claim 19, wherein the number of packets included in each consecutive subset of packets satisfies a rateless code recovery condition that is at least partially based on the number of packets included in the set of source packets and the number of bits associated with the rateless code symbol index.

21. The non-transitory computer-readable medium according to claim 20, wherein the number of the packets included in each consecutive subset of packets is the maximum value that satisfies the rateless code recovery condition.

22. The non-transitory computer-readable medium according to claim 17, wherein the percentage of packets in the set of output packets having a degree greater than one is at least partially based on selecting the one or more packets having the lowest peak-to-average power ratio (PAPR) from each consecutive subset of packets.

23. The non-transitory computer-readable medium according to claim 17, wherein the set of output packets is associated with a degree distribution that is at least partially based on the number of packets included in each consecutive subset of packets.

24. An apparatus for wireless communication, the apparatus comprising: means for generating a set of rateless code packets from a set of source packets, each rateless code packet corresponding to a different combination of one or more of the packets in the set of source packets; means for selecting, from each consecutive subset of packets in the set of rateless code packets, one or more packets having the lowest peak-to-average power ratio (PAPR) among the respective peak-to-average power ratios associated with each packet included in the respective consecutive subset of packets; and means for transmitting a set of output packets that includes the one or more packets selected from each consecutive subset of packets in the set of rateless code packets.

25. The apparatus according to claim 24, wherein the set of source packets includes k source packets, and wherein the set of rateless code packets includes up to 2k packets, each packet corresponding to a different combination of one or more of the k source packets.

26. The apparatus according to claim 24, wherein each packet in the set of rateless code packets is associated with a rateless code symbol index that defines an exclusive-or (XOR) relationship with one or more of the packets in the set of source packets.

27. The apparatus according to claim 26, wherein the number of packets included in each consecutive subset of packets satisfies a rateless code recovery condition that is at least partially based on the number of packets included in the set of source packets and the number of bits associated with the rateless code symbol index.

28. The apparatus according to claim 27, wherein the number of the packets included in each consecutive subset of packets is the maximum value that satisfies the rateless code recovery condition.

29. The apparatus according to claim 24, wherein a percentage of packets in the output packet set having a degree greater than one is at least partially based on selecting the one or more packets having the lowest PAPR from each consecutive packet subset.

30. The apparatus according to claim 24, wherein the output packet set is associated with a degree distribution that is at least partially based on the number of packets included in each consecutive packet subset.

Images