Sign bit shaping for polar codes

Abstract

The process involves shaping the sign bits for the polar codes, where the shaped bits are placed on the sign bits corresponding to the bit level of the sub-channel with the highest reliability. Information bits and freeze bits can be placed on the remaining sub-channels. Each bit level can be fed into a corresponding polarization transform (e.g., a polarization subkernel), which encodes the corresponding bit level to produce the corresponding polar code subkernel output. The polar code subkernel output can be fed into a set partitioned Gray-labeled transform to produce a transformed polar code subkernel output corresponding to the polar-decoded codeword.

Description

Technical Field

[0001] The techniques discussed below generally relate to wireless communication networks, and more specifically to polarization decoding in wireless communication networks. Background Technology

[0002] Block codes, or error-correcting codes, are frequently used to provide reliable transmission of digital messages over noisy channels. In a typical block code, the information message or sequence is broken down into blocks, and the encoder at the transmitting device then mathematically adds redundancy to the information message. Utilizing this redundancy in the encoded information message is crucial for message reliability, enabling the correction of any bit errors that may occur due to noise. That is, the decoder at the receiving device can use the redundancy to reliably recover the information message, even if bit errors may occur partially due to the addition of noise to the channel.

[0003] Many examples of such error-correcting block codes are known to those skilled in the art, including Hamming codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, turbo codes, and low-density parity-check (LDPC) codes. Many existing wireless communication networks utilize such block codes, such as the 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) network using turbo codes, and the IEEE 802.11n Wi-Fi network using LDPC codes. In the 3GPP New Radio (NR) network specification, quasi-cyclic LDPC is used to decode user data, while polarization decoding is used to decode control information and the Physical Broadcast Channel (PBCH).

[0004] While research into the specific implementation of polar codes continues to advance rapidly in terms of their capabilities and potential, additional enhancements are expected, particularly for potential deployments in wireless communication networks beyond NR. Summary of the Invention

[0005] The following provides an overview of one or more aspects of this disclosure to provide a basic understanding of those aspects. This summary is not an exhaustive overview of all the intended features of this disclosure, nor is it intended to identify key or essential elements of all aspects of this disclosure, nor to define the scope of any or all aspects of this disclosure. Its sole purpose is to present some concepts of one or more aspects of this disclosure in one form as a prelude to the more detailed description that follows.

[0006] In one example, an apparatus configured for wireless communication at a wireless communication device is provided. The apparatus includes one or more memories and one or more processors coupled to the one or more memories. The one or more processors are configured to: assign a plurality of information bits and a plurality of frozen bits to a plurality of sub-channels associated with a plurality of bit levels; and place a plurality of shaped bits on a selected sub-channel among the plurality of sub-channels. The selected sub-channel can be associated with a first bit level among the plurality of bit levels, where the first bit level is a sign bit level. The one or more processors are further configured to: encode the plurality of information bits, the plurality of frozen bits, and the plurality of shaped bits into a plurality of polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among the plurality of bit levels; apply a set partitioning to Gray label transform to the plurality of polar code sub-core outputs to produce a plurality of transformed polar code sub-core outputs corresponding to polar-decoded codewords; and transmit the polar-decoded codewords.

[0007] Another example provides a method for wireless communication at a wireless communication device. The method includes: assigning multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; and placing multiple shaped bits on a selected sub-channel among the multiple sub-channels. The selected sub-channel can be associated with the first bit level among the multiple bit levels, where the first bit level is the sign bit level. The method further includes: encoding the multiple information bits, multiple frozen bits, and multiple shaped bits into multiple polar code sub-core outputs, each polar code sub-core output associated with a corresponding bit level among the multiple bit levels; applying a set partitioning to Gray label transform to the multiple polar code sub-core outputs to generate multiple transformed polar code sub-core outputs corresponding to polar-decoded codewords; and transmitting the polar-decoded codewords.

[0008] Another example provides an apparatus comprising: means for assigning a plurality of information bits and a plurality of frozen bits to a plurality of sub-channels associated with a plurality of bit levels; and means for placing a plurality of shaped bits on a selected sub-channel among the plurality of sub-channels. The selected sub-channel can be associated with a first bit level among the plurality of bit levels, wherein the first bit level is a sign bit level. The apparatus further comprises: means for encoding the plurality of information bits, the plurality of frozen bits, and the plurality of shaped bits into a plurality of polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among the plurality of bit levels; means for applying a set partitioning to Gray label transform to the plurality of polar code sub-core outputs to produce a plurality of transformed polar code sub-core outputs corresponding to polar-decoded codewords; and means for transmitting the polar-decoded codewords.

[0009] Another example provides a non-transitory computer-readable medium storing instructions executable by one or more processors of a wireless communication device to: assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; and place multiple shaped bits on a selected sub-channel among the multiple sub-channels. The selected sub-channel can be associated with the first bit level among the multiple bit levels, where the first bit level is the sign bit level. The non-transitory computer-readable medium also includes instructions executable by one or more processors of a wireless communication device to: encode multiple information bits, multiple frozen bits, and multiple shaped bits into multiple polar code sub-core outputs, each polar code sub-core output associated with a corresponding bit level among the multiple bit levels; apply a set partitioning to Gray label transformation to the multiple polar code sub-core outputs to produce multiple transformed polar code sub-core outputs corresponding to polar-decoded codewords; and transmit the polar-decoded codewords.

[0010] These and other aspects will be more fully understood after reading the following detailed description. Other aspects, features, and examples will become apparent to those skilled in the art after reading the following description of specific exemplary examples in conjunction with the accompanying drawings. While features may be discussed below with respect to certain examples and drawings, all examples may include one or more advantageous features discussed herein. In other words, while one or more examples may be discussed as having certain advantageous features, one or more such features may also be used according to the various examples discussed herein. Similarly, although exemplary examples may be discussed below as examples of devices, systems, or methods, such exemplary examples can be implemented in a variety of devices, systems, and methods. Attached Figure Description

[0011] Figure 1 This is a diagram illustrating examples of wireless communication systems and access networks based on certain aspects.

[0012] Figure 2A , Figure 2B , Figure 2C and Figure 2D These are illustrations illustrating examples of the DL channel in the first 5G / NR frame, the second 5G / NR frame, and the UL channel in the 5G / NR subframe, respectively.

[0013] Figure 3 This is a high-level illustration of an example of a decomposed base station configuration based on several aspects.

[0014] Figure 4 This is a schematic example of wireless communication between a first wireless communication device and a second wireless communication device, based on the use of decoding in some aspects.

[0015] Figure 5 It is a schematic example of information blocks to be polarized and decoded based on some aspects.

[0016] Figure 6 This is a diagram illustrating a modulation (PCM) scheme based on polarization decoding in some aspects.

[0017] Figure 7 This is a diagram illustrating an example of Gray label mapping based on some aspects.

[0018] Figure 8 This is an illustration of an example of a transmitter configured for combined decoding and shaping based on certain aspects.

[0019] Figure 9 This is a diagram illustrating an example of a polar code circuit configured for a PCM with joint decoding and shaping, based on some aspects.

[0020] Figure 10 This is a diagram illustrating an example of a polar code circuit configured to perform joint decoding and shaping using positive and negative bits, based on certain aspects.

[0021] Figure 11 This is a diagram illustrating an example of a polar code circuit configured to perform joint decoding and shaping using interleaving, based on certain aspects.

[0022] Figure 12 This is a diagram illustrating another example of a polar code circuit configured to utilize interleaving for joint decoding and shaping, based on certain aspects.

[0023] Figure 13 This is a block diagram illustrating an example of a hardware implementation of a wireless communication device employing a processing system based on some aspects.

[0024] Figure 14 It is a flowchart of an exemplary process for shaping the sign bits of polar codes, based on some aspects.

[0025] Figure 15 This is a flowchart of another exemplary process for shaping the sign bits of polar codes, based on some aspects. Detailed Implementation

[0026] The detailed description below, illustrated with reference to the accompanying drawings, is intended as a description of various configurations and not as representing only the configurations in which the concepts described herein can be practiced. To provide a thorough understanding of the various concepts, the detailed description includes specific details. However, it will be apparent to those skilled in the art that these concepts can be practiced without these specific details. In some instances, well-known structures and components are shown in block diagram form to avoid obscuring such concepts.

[0027] While aspects and examples are described herein by way of illustration, those skilled in the art will understand that additional specific implementations and use cases may arise in many different arrangements and scenarios. The innovations described herein can be implemented across many different platform types, devices, systems, shapes, sizes, and package arrangements. For example, aspects and / or uses may arise via integrated chip examples and other devices based on non-modular components (e.g., end-user devices, vehicles, communication devices, computing devices, industrial equipment, retail / shopping devices, medical devices, AI-enabled devices, etc.). While some examples may or may not specifically point to a use case or application, the applicability of various types of the described innovations may emerge. Implementations may range from chip-level or modular components to non-modular, non-chip-level implementations, and further to aggregated, distributed, or OEM devices or systems incorporating one or more aspects of the described innovations. In some practical settings, devices incorporating the described aspects and features may also necessarily include additional components and features for the implementation and execution of the claimed and described examples. For example, the transmission and reception of wireless signals necessarily involve multiple components for analog and digital purposes (e.g., hardware components including antennas, RF chains, power amplifiers, modulators, buffers, processors, interleavers, adders / summers, etc.). The innovations described herein are intended to be implemented in a variety of devices, chip-level components, systems, distributed layouts, decomposed layouts (e.g., base stations or UEs), end-user equipment, etc., of varying sizes, shapes, and constructions.

[0028] Polar decoding is a channel decoding scheme that can be used, for example, when decoding 5G control channels. Polar decoding has a built-in channel polarization structure that divides (or “polarizes”) polar code subchannels into reliable subchannels and unreliable subchannels. Reliable subchannels carry information bits and unreliable channels carry “frozen” or “fixed” bits (e.g., “0” bits).

[0029] Polar codes are suitable for transmissions with higher-order modulation, for example, because they enable joint decoding and modulation (e.g., polar-code-modulated modulation (PCM)). However, PCM schemes with uniformly distributed symbols can lead to shaping losses. Recently, signal shaping for higher-order modulation has been introduced to provide joint decoding and shaping (e.g., probabilistic amplitude shaping (PAS)) within a single polar code. For example, joint decoding and shaping can use a single polar code with information bits, freeze bits, and shaping bits, designed to shape the transmitted symbols to lower transmit power and thus improve capacity efficiency. However, previous joint decoding and shaping designs suffered from poor forward error correction (FEC) performance for the shaping bits or required decoding based on multi-level decoding, resulting in large demodulation delays and complexity.

[0030] Various aspects involve sign bit shaping for polar codes, where shaped bits are placed on the sign bit level corresponding to the bit level with the highest reliability sub-channel. For example, for three bit levels, the sign bit level could be the first level, where the second and third levels include less reliable bits. Each bit level can be fed into a corresponding polarization transform (e.g., a polarization subkernel), which performs polarization decoding on the corresponding bit level to produce a polar code subkernel output. The output of the polarization transform can be fed into a set partitioned Gray-labeled transform to produce a Gray-labeled subkernel output corresponding to the polar-decoded codeword, which can then be mapped to a symbol. In some examples, a bit-level interleaver may be included before or after the set partitioned Gray-labeled transform to interleave the subkernel outputs of each bit level.

[0031] This PCM scheme is a bit-interleaved PCM (BICM) scheme, which avoids the latency and complexity problems of multi-level decoding. Furthermore, by placing the integer bits in the first stage of the polarized subkernel via set partitioning to Gray label transformation, improved FEC performance for the integer bits can be achieved.

[0032] In some examples, the set partitioning to the Gray label transformation may include an XOR gate configured to perform an XOR operation on adjacent bit levels. For example, a first XOR operation may be applied to the subkernel output of the second bit level and the subkernel output of the first bit level (e.g., the sign bit level), and a second XOR operation may be applied to the subkernel output of the third bit level and the subkernel output of the second bit level.

[0033] In some examples, the average conditional entropy of the Gray-labeled subkernel output can be used to identify the integer bit payload (e.g., payload size or number of integer bits). The integer bits can then be constructed using density evolution or a Gaussian approximation of the Gray-labeled subkernel output. For example, the most reliable... Each sub-channel can be located at the sign level and is reserved for shaping bits. Each subchannel can initially be left empty to generate an initial polar-decoded codeword based on the set of information bits and frozen bits in the remaining subchannels. The initial polar-decoded codeword is then fed to a pre-decoder to obtain the shaped bits. For example, the pre-decoder can be configured as a polar decoder to search for polar codewords representing the set of information bits and frozen bits and distributing the final polar-decoded codeword according to a target probability distribution. In one example, the pre-decoder can compute a power-saving function based on the initial polar-decoded codeword and use this power-saving function to initialize the decoder's log-likelihood ratio (LLR) to obtain the shaped bits.

[0034] The various concepts presented in this disclosure can be implemented across a wide variety of telecommunications systems, network architectures, and communication standards. Reference is now made to... Figure 1 This illustration, by way of example and not limitation, provides a schematic representation of a wireless communication network including a radio access network (RAN) 100 and a core network 160. RAN 100 can implement any one or more suitable wireless communication technologies to provide radio access. As an example, RAN 100 may operate according to the 3rd Generation Partnership Project (3GPP) New Radio (NR) specification (commonly referred to as 5G). As another example, RAN 100 may operate according to a hybrid of 5G NR and the Evolved Universal Terrestrial Radio Access Network (eUTRAN) standard (commonly referred to as LTE). 3GPP refers to such a hybrid RAN as a Next Generation RAN or NG-RAN. In other examples, RAN 100 may operate according to a hybrid of 5G NR and 6G, may operate according to 6G, or may operate according to other future radio access technologies (RATs). Of course, many other examples can be utilized within the scope of this disclosure.

[0035] The geographic area covered by RAN 100 can be divided into multiple cellular areas (cells), and user equipment (UE) can uniquely identify these cellular areas (cells) based on an identifier broadcast from an access point or network entity within the geographic area. Figure 1 Cells 102, 104, 106, 108, and 110 are illustrated, each of which may include one or more sectors (not shown). A sector is a sub-area of ​​a cell. All sectors within a cell are served by the same network entity. Radio links within a sector can be identified by a single logical identifier belonging to that sector. In a cell divided into sectors, multiple sectors within the cell can be formed using multiple sets of antennas, each responsible for communicating with UEs within a portion of the cell.

[0036] Typically, a network entity serves each cell. Broadly speaking, a network entity is responsible for radio transmissions to and from a UE in one or more cells. Those skilled in the art may also refer to a network entity as a base station (e.g., an aggregated or decomposed base station), a base transceiver unit (BTS), a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), an access point (AP), a node B (NB), an evolved NB (eNB), a 5G NB (gNB), a transmit / receive point (TRP), or some other suitable term. In some examples, a network entity may include two or more TRPs that may be co-located or non-co-located. Each TRP may communicate on the same or different carrier frequencies within the same or different frequency bands. In an example where RAN 100 operates according to both the LTE and 5G NR standards, one network entity may be an LTE network entity, while the other may be a 5G NR network entity.

[0037] In some examples, RAN 100 may employ an Open RAN (O-RAN) to provide standardized radio interfaces to facilitate interoperability between component radio equipment. For example, in an O-RAN, the RAN may be decomposed into Centralized Units (CUs), Distributed Units (DUs), and Radio Units (RUs). RUs are configured to transmit (RF) signals to one or more UEs and / or receive (RF) signals from one or more UEs. The RU may be located at, near, or integrated with an antenna. The DU and CU provide computing functionality and facilitate the transmission of digitized radio signals within RAN 100. In some examples, the DU may be physically located at or near an RU. In some examples, the CU may be located near the core network 160.

[0038] The DU provides downlink and uplink baseband processing, a supply system synchronization clock, signal processing, and an interface with the CU. The RU provides downlink baseband signal conversion to RF signal and uplink RF signal conversion to baseband signal. The O-RAN may include an open fronthaul (FH) interface between the DU and the RU. Aspects of this disclosure are applicable to converged RANs and / or decomposed RANs (e.g., O-RANs).

[0039] It can be deployed using various network entities. For example, in Figure 1 In this example, network entities 114, 116, and 118 are shown in cells 102, 104, and 106; and another network entity 122 is shown as a remote radio head (RRH) 122 controlling cell 110. That is, network entities may have integrated antennas or may be connected to antennas or RRHs via feed cables. In the illustrated example, cells 102, 104, 106, and 110 may be referred to as macro cells because network entities 114, 116, 118, and 122 support cells with relatively large sizes. Furthermore, network entity 120 is shown in cell 108, which may overlap with one or more macro cells. In this example, cell 108 may be referred to as a small cell (e.g., microcell, picocell, femtocell, home base station, home node B, home eNodeB, etc.) because network entity 120 supports cells with relatively small sizes. Cell size settings can be made according to system design and component constraints.

[0040] It should be understood that RAN 100 can include any number of network entities and cells. Furthermore, relay nodes can be deployed to extend the size or coverage area of ​​a given cell. In some examples, the cell may not necessarily be stationary, and the geographical area of ​​the cell may move depending on the location of the mobile network entity.

[0041] Figure 1 It also includes an unmanned aerial vehicle (UAV) 156, which can be a drone or a quadcopter. The UAV 156 can be configured to act as a network entity, or more specifically, as a mobile network entity. That is, in some examples, the cell may not necessarily be stationary, and the geographic area of ​​the cell may move depending on the location of a mobile network entity such as the UAV 156.

[0042] In addition to other functions, network entities 114, 116, 118, 120, and 122a / 122b may perform one or more of the following functions: user data delivery, radio channel encryption and decryption, integrity protection, header compression, mobility control functions (e.g., handover, dual connectivity), inter-cell interference coordination, connection establishment and release, load balancing, distribution of non-access stratum (NAS) messages, NAS node selection, synchronization, radio access network (RAN) sharing, multimedia broadcast multicast service (MBMS), subscriber and equipment tracking, RAN information management (RIM), paging, location, and delivery of warning messages. Network entities 114, 116, 118, 120, and 122a / 122b may communicate directly or indirectly (e.g., via core network 170) through backhaul link 152 (e.g., X2 interface). Backhaul link 152 may be wired or wireless.

[0043] RAN 100 is exemplified as supporting wireless communication for multiple mobile devices. Mobile devices are generally referred to as User Equipment (UE) in standards and specifications issued by the 3rd Generation Partnership Project (3GPP), but may also be referred to by those skilled in the art as mobile station (MS), subscriber station, mobile unit, subscriber unit, radio unit, remote unit, mobile device, radio device, wireless communication device, remote device, mobile subscriber station, access terminal (AT), mobile terminal, radio terminal, remote terminal, handphone, terminal, user agent, mobile client, client, or any other suitable term. A UE can be a device that provides users with access to network services.

[0044] Within this document, a “mobile” device does not necessarily need to be mobile and may be stationary. The term mobile device or mobile device refers to a wide variety of devices and technologies. For example, some non-limiting examples of mobile devices include mobile phones, cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptops, personal computers (PCs), notebooks, netbooks, smartbooks, tablets, personal digital assistants (PDAs), and a broad array of embedded systems, for example, corresponding to the “Internet of Things” (IoT). Mobile devices may additionally include automobiles or other transportation vehicles, remote sensors or actuators, robots or robotic devices, satellite radios, Global Positioning System (GPS) devices, object tracking devices, drones, multi-rotor aircraft, quadcopters, remote control devices, consumer and / or wearable devices (such as glasses, wearable cameras, virtual reality devices, smartwatches, health or fitness trackers, digital audio players (e.g., MP3 players), cameras, game consoles, etc. Mobile devices may additionally include digital home or smart home devices (such as home audio, video, and / or multimedia devices), appliances, vending machines, smart lighting devices, home security systems, etc. Mobile devices can also include smart meters, etc. Additional mobile devices may include smart energy equipment, security equipment, solar panels or solar arrays, municipal infrastructure equipment for controlling electrical power (e.g., smart grids), lighting, water supply, etc., industrial automation and enterprise equipment, logistics controllers, and / or agricultural equipment. Furthermore, mobile devices can provide connected medical or telemedicine support, such as healthcare at a distance. Remote healthcare devices may include remote healthcare monitoring devices and remote healthcare supervision devices, whose communications may be given priority access over other types of information, for example, in the form of priority access for critical service data transmission and / or relevant QoS for critical service data transmission.

[0045] Within RAN 100, a cell may include UEs capable of communicating with one or more sectors of each cell. For example, UEs 124, 126, and 144 may communicate with network entity 114; UEs 128 and 130 may communicate with network entity 116; UEs 132 and 138 may communicate with network entity 118; UE 140 may communicate with network entity 120; UE 142 may communicate with network entity 122a via RRH122b; and UE 158 may communicate with mobile network entity 156. Here, each network entity 114, 116, 118, 120, 122a / 122b, and 156 may be configured to provide an access point to core network 170 (not shown) to all UEs in the respective cell. In another example, a mobile network node (e.g., UAV 156) may be configured to act as a UE. For example, UAV 156 may operate within cell 104 by communicating with network entity 116. The UE can be located anywhere within the serving cell. A UE located closer to the cell center (e.g., UE 132) can be referred to as a cell center UE, while a UE located closer to the cell edge (e.g., UE 134) can be referred to as a cell edge UE. Compared to a cell edge UE, a cell center UE may have higher signal quality (e.g., higher reference signal received power (RSRP) or signal-to-interference-plus-noise ratio (SINR)).

[0046] In RAN 100, the ability of a UE to communicate while moving (independent of its location) is referred to as mobility. Various physical channels between the UE and the RAN are generally established, maintained, and released under the control of the Access and Mobility Management Function (AMF), which may include the Security Context Management Function (SCMF) for managing the security context of both the control plane and user plane functionalities, and the Security Anchor Function (SEAF) for performing authentication. In some examples, during a call facilitated by a network entity or at any other time, the UE may monitor various parameters of the signal from its serving cell and various parameters of neighboring cells. Based on the quality of these parameters, the UE may maintain communication with one or more neighboring cells. During this time, if the UE moves from one cell to another, or if the signal quality from a neighboring cell exceeds the signal quality from the serving cell for a given amount of time, the UE may perform a handover or transfer from the serving cell to a neighboring (target) cell. For example, UE 126 may move from a geographic area corresponding to its serving cell 102 to a geographic area corresponding to a neighboring cell 106. When the signal strength or quality from neighboring cell 106 exceeds the signal strength and quality of its serving cell 102 for a given amount of time, UE 126 may send a report message indicating this condition to its serving network entity 114. In response, UE 126 may receive a handover command, and UE may perform a handover to cell 106.

[0047] Wireless communication between RAN 100 and a UE (e.g., UE 124, 126, or 144) can be described as utilizing a communication link 148 via an air interface. Transmissions on communication link 148 between the network entity and the UE may include uplink (UL) (also referred to as reverse link) transmission from the UE to the network entity and / or downlink (DL) (also referred to as forward link) transmission from the network entity to the UE. For example, DL transmission may include unicast or broadcast transmission of control information and / or data (e.g., user data services or other types of services) from the network entity (e.g., network entity 114) to one or more UEs (e.g., UE 124, 126, and 144), while UL transmission may include transmission of control information and / or service information originating at the UE (e.g., UE 124). Furthermore, uplink and / or downlink control information and / or service information may be time-divided into frames, subframes, time slots, and / or symbols. As used herein, a symbol can refer to a time unit in an Orthogonal Frequency Division Multiplexing (OFDM) waveform where each subcarrier carries a resource element (RE). A time slot can carry 7 or 14 OFDM symbols. A subframe can refer to a duration of 1 ms. Multiple subframes or time slots can be grouped together to form a single frame or radio frame. Within this disclosure, a frame can refer to a predetermined duration (e.g., 10 ms) for wireless transmission, where each frame consists, for example, of 10 subframes, each 1 ms in length. Of course, these definitions are not mandatory, and any suitable scheme for organizing the waveform can be used, and various time divisions of the waveform can have any suitable duration.

[0048] Communication link 148 may use multiple-input multiple-output (MIMO) antenna techniques, including spatial multiplexing, beamforming, and / or transmit diversity. For example, such as Figure 1 As shown, network entities 122a / 122b can transmit beamformed signals to UE 142 via one or more beams 174 in one or more transmit directions. UE 142 can also receive beamformed signals from network entities 122a / 122b via one or more beams 174' in one or more receive directions. Network entities 122a / 122b and UE 142 can perform beamforming training to determine the optimal transmit and receive beams 174 / 174' for communication between network entities 122a / 122b and UE 142. The transmit and receive beams of network entities 122a / 122b can be the same or different. The sending and receiving directions of UE 142 can be the same or different.

[0049] Communication link 148 may utilize one or more carriers. For the total number of carriers used for transmission in each direction, up to [number missing] are [number missing]. Yx MHz ( x For each carrier allocated in carrier aggregation (containing component carriers), the network entity and the UE can use up to [number] carriers. Y A spectrum with a bandwidth of MHz (e.g., 5MHz, 10MHz, 15MHz, 20MHz, 100MHz, 400MHz, etc.). Carriers may be adjacent to each other or may not be adjacent to each other. Carrier allocation may be asymmetric for DL ​​and UL (e.g., more or fewer carriers may be allocated to DL compared to UL). Component carriers may include primary component carriers and one or more secondary component carriers. The primary component carrier may be referred to as the primary cell (PCell) and the secondary component carrier may be referred to as the secondary cell (SCell).

[0050] Communication link 148 in RAN 100 can further utilize one or more multiplexing and multiple access algorithms to enable simultaneous communication of various devices. For example, the 5G NR specification provides multiple access for UL or reverse link transmissions from UEs 124, 126, and 144 to network entity 114, and multiplexing DL or forward link transmissions from network entity 114 to UEs 124, 126, and 144 using Orthogonal Frequency Division Multiplexing (OFDM) with a Cyclic Prefix (CP). Furthermore, for UL transmissions, the 5G NR specification provides support for Discrete Fourier Transform Extended OFDM (DFT-s-OFDM) with CP (also known as Single-Carrier FDMA (SC-FDMA)). However, within the scope of this disclosure, multiplexing and multiple access are not limited to the schemes described above and can be provided using Time Division Multiple Access (TDMA), Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Sparse Code Multiple Access (SCMA), Resource Extended Multiple Access (RSMA), or other suitable multiple access schemes. In addition, Time Division Multiplexing (TDM), Code Division Multiplexing (CDM), Frequency Division Multiplexing (FDM), Orthogonal Frequency Division Multiplexing (OFDM), Sparse Code Multiplexing (SCM) or other suitable multiplexing schemes can be used to provide multiplexing of DL transmissions from network entity 114 to UEs 124, 126 and 144.

[0051] Furthermore, communication link 148 in RAN 100 can utilize one or more duplex algorithms. Duplex refers to a point-to-point communication link where two endpoints can communicate with each other in both directions. Full-duplex means that two endpoints can communicate with each other simultaneously. Half-duplex means that only one endpoint can transmit information to the other endpoint at a time. Half-duplex simulations often utilize Time Division Duplex (TDD) for wireless links. In TDD, transmissions in different directions on a given channel are separated from each other using time-division multiplexing. That is, at some times, the channel is dedicated to transmission in one direction, and at other times, the channel is dedicated to transmission in the other direction, where the direction can change very rapidly, for example, several times per time slot. In wireless links, full-duplex channels generally rely on physical isolation between the transmitter and receiver, as well as appropriate interference cancellation techniques. Full-duplex simulations are often implemented for wireless links using Frequency Division Duplex (FDD) or Space Division Duplex (SDD). In FDD, transmissions in different directions can operate at different carrier frequencies (e.g., within paired spectrum). In SDD, spatial division multiplexing (SDM) is used to separate transmissions in different directions on a given channel from each other. In other examples, full-duplex communication can be implemented in unpaired spectrum (e.g., within a single carrier bandwidth), where transmissions in different directions occur in different subbands of the carrier bandwidth. This type of full-duplex communication may be referred to herein as subband full-duplex (SBFD), also known as flexible duplex (FD).

[0052] In various specific implementations, communication links 148 in RAN 100 can utilize licensed spectrum, unlicensed spectrum, or shared spectrum. Licensed spectrum typically provides exclusive use of a portion of the spectrum by means of a license purchased by the mobile network operator from a government regulatory agency. Unlicensed spectrum provides shared use of a portion of the spectrum without requiring a government-granted license. While some technical rules are generally still required to access unlicensed spectrum, access is usually available to any operator or device. Shared spectrum may fall between licensed and unlicensed spectrum, where some technical rules or restrictions may be required to access the spectrum, but the spectrum can still be shared by multiple operators and / or multiple RATs. For example, a licensee of a portion of licensed spectrum may provide Licensed Shared Access (LSA) to share the spectrum with other parties (e.g., those with appropriate licensee-defined conditions for access).

[0053] The electromagnetic spectrum is typically subdivided into various categories, bands, channels, etc., based on frequency / wavelength. In 5G NR, two initial operating bands have been designated as frequency ranges FR1 (410MHz to 7.125GHz) and FR2 (24.25GHz to 52.6GHz). Although a portion of FR1 is greater than 6GHz, FR1 is generally (interchangeably) referred to as the "sub-6GHz" band in various documents and articles. Similar naming issues sometimes occur with FR2, which is generally (interchangeably) referred to as the "millimeter wave" band in documents and articles, although this is distinct from the Extremely High Frequency (EHF) band (30GHz to 300GHz) designated as "millimeter wave" by the International Telecommunication Union (ITU).

[0054] The frequencies between FR1 and FR2 are generally referred to as mid-band frequencies. Recent 5G NR studies have designated the operating bands for these mid-band frequencies as the frequency range designation FR3 (7.125 GHz to 24.25 GHz). Bands falling within FR3 can inherit FR1 and / or FR2 characteristics, thus effectively extending the features of FR1 and / or FR2 to mid-band frequencies. Additionally, higher frequency bands are currently being explored to extend 5G NR operation beyond 52.6 GHz. For example, three higher operating bands have been designated as the frequency range designations FR2-2 (52.6 GHz to 71 GHz), FR4 (71 GHz to 114.25 GHz), and FR5 (114.25 GHz to 300 GHz). Each of these higher bands falls within the EHF band.

[0055] In light of the foregoing, unless otherwise specifically stated, it should be understood that, as used herein, the term "below 6 GHz" and the like can broadly refer to frequencies less than 6 GHz, within FR1, or including intermediate frequency band frequencies. Furthermore, unless otherwise specifically stated, it should be understood that, as used herein, the term "millimeter wave" and the like can broadly refer to frequencies that can include intermediate frequency band frequencies, within FR2, FR4, FR2-2 and / or FR5, or within the EHF band.

[0056] In some examples, access to the air interface can be scheduled, where a scheduling entity (e.g., network entity 114) allocates resources for communication among some or all devices and equipment within its service area or cell. Within this disclosure, as further discussed below, the scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources for one or more scheduled entities. That is, for scheduled communication, a UE (e.g., UE 124) (which may be a scheduled entity) may utilize resources allocated by scheduling entity 114.

[0057] Network entities are not the only entities that can act as scheduling entities. That is, in some examples, a UE can act as a scheduling entity, scheduling resources for one or more scheduled entities (e.g., one or more other UEs). For example, two or more UEs (e.g., UE 144 and UE 146) can communicate with each other via sidelink 150 using peer-to-peer (P2P) or sidelink signaling without relaying that communication through a network entity (e.g., network entity 114). In some examples, UEs 144 and 146 can each act as a scheduling entity or transmitting sidelink device and / or a scheduled entity or receiving sidelink device to transmit sidelink signaling between them without relying on scheduling or control information from a network entity (e.g., network entity 114). In other examples, network entity 114 can allocate resources to UEs 144 and 146 for sidelink communication. For example, UEs 144 and 146 can use sidelink signaling to communicate in P2P networks, device-to-device (D2D) networks, vehicle-to-vehicle (V2V) networks, vehicle-to-everything (V2X) networks, mesh networks, or other suitable networks.

[0058] In some examples, a D2D relay framework may be included within a cellular network to facilitate the relay of communications to / from network entity 114 via a D2D link (e.g., side link 150). For example, one or more UEs (e.g., UE 144) within the coverage area of ​​network entity 114 may operate as relay UEs to extend the coverage of network entity 114, improve transmission reliability for one or more UEs (e.g., UE 146), and / or allow the network entity to recover from failed UE links due to, for example, blocking or fading.

[0059] The wireless communication system may also include a Wi-Fi access point (AP) 176 that communicates with a Wi-Fi station (STA) 178 via a communication link 180 in the 5 GHz unlicensed spectrum. When communicating in the unlicensed spectrum, the STA 170 / AP 176 may perform a free channel assessment (CCA) to determine the availability of a channel before communication.

[0060] In some examples, the UE may correspond to IoT device 182. IoT device 182 may include, for example, passive IoT devices, such as RFID-type sensors / actuators (SA), semi-passive IoT devices, or active IoT devices. Active and semi-passive IoT devices may include batteries or power supplies that may be charged, for example, using wireless power transfer (WPT) or more generally using ambient energy harvesting, while passive IoT devices lack internal power and therefore use ambient energy harvesting to power the device. Semi-passive IoT devices may include capacitors or other storage devices that provide hot-start for energy harvesting within the device. IoT device 182 may communicate with network entities (e.g., network entity 114 or an RFID reader). In some examples, network entity 114 may communicate with the IoT device via a cellular (Uu) link. For example, network entity 114 may provide power transmission on the downlink to power the IoT device. The power transmission may also be modulated and backscattered by IoT device 182 as an information-bearing signal on the uplink. Furthermore, network entity 114 can send control information and / or data to IoT device 182 on the downlink, which can detect the control information and / or data using, for example, envelope detection. In this way, network entity 114 can read information from and write information to IoT device 182.

[0061] Network entities 114, 116, 118, 120, and 122a / 122b provide radio access points to the core network 160 for any number of UEs or other mobile devices via core network backhaul link 154. Core network backhaul link 154 provides connectivity between network entities 114, 116, 118, 120, and 122a / 122b and the core network 170. In some examples, core network backhaul link 154 may include backhaul link 152 providing interconnection between the respective network entities. The core network may be part of a wireless communication system and may be independent of the radio access technology used in RAN 100. Various types of backhaul interfaces may be employed, such as direct physical connections (wired or wireless) using any suitable transport network, virtual networks, etc.

[0062] The core network 160 may include Access and Mobility Management Functions (AMF) 162, other AMFs 168, Session Management Functions (SMF) 164, and User Plane Functions (UPF) 166. AMF 162 can communicate with Unified Data Management (UDM) 170. AMF 162 is the control node that handles signaling between the UE and the core network 160. Generally, AMF 162 provides QoS flow and session management. All user Internet Protocol (IP) packets are delivered through UPF 166. UPF 166 provides UE IP address allocation and other functions. UPF 166 is configured to be coupled to IP Service 172. IP Service 172 may include the Internet, intranet, IP Multimedia Subsystem (IMS), PS streaming service, and / or other IP services.

[0063] Figure 2A Figure 200 illustrates an example of the first subframe within a 5G / NR frame structure. Figure 2B Figure 230 illustrates an example of a DL channel within a 5G / NR subframe. Figure 2C Figure 250 illustrates an example of the second subframe within a 5G / NR frame structure. Figure 2D Figure 280 illustrates an example of a UL channel within a 5G / NR subframe. The 5G / NR frame structure can be FDD, where for a specific set of subcarriers (carrier system bandwidth), subframes within that set are dedicated to either DL or UL, or it can be TDD, where for a specific set of subcarriers (carrier system bandwidth), subframes within that set are dedicated to both DL and UL. Figure 2A , Figure 2C In the provided example, the 5G / NR frame structure is assumed to be TDD, where subframe 4 is configured using slot format 28 (primarily DL), where D is DL and U is UL, and X is flexibly used between DL and UL, and subframe 3 is configured using slot format 34 (mostly UL). Although subframes 3 and 4 are shown as having slot formats 34 and 28 respectively, any particular subframe can be configured with any of the various available slot formats 0-61. Slot formats 0 and 1 are both DL and UL, respectively. Other slot formats 2-61 include a mixture of DL, UL, and flexible symbols. The UE is configured using the slot format via the received Slot Format Indicator (SFI) (dynamically configured via DL Control Information (DCI) or semi-statically / statically configured via Radio Resource Control (RRC) signaling). Note that the following description also applies to 5G / NR frame structures for TDD.

[0064] Other wireless communication technologies may have different frame structures and / or different channels. A frame (10 ms) can be divided into 10 equal-sized subframes (1 ms). Each subframe may include one or more time slots. Subframes may also include micro-time slots, which may include 7, 4, or 2 symbols. Each time slot may include 7 or 14 symbols, depending on the time slot configuration. For time slot configuration 0, each time slot may include 14 symbols, and for time slot configuration 1, each time slot may include 7 symbols. Symbols on the DL can be Cyclic Prefix (CP) OFDM (CP-OFDM) symbols. Symbols on the UL can be CP-OFDM symbols (for high-throughput scenarios) or Discrete Fourier Transform (DFT) Extended OFDM (DFT-s-OFDM) symbols (also known as Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols) (for power-constrained scenarios; limited to single-stream transmission). The number of time slots within a subframe is based on the time slot configuration and parameter set (numerology). For slot configuration 0, different parameter sets µ 0 through 5 allow each subframe to have 1, 2, 4, 8, 16, and 32 slots, respectively. For slot configuration 1, different parameter sets 0 through 2 allow each subframe to have 2, 4, and 8 slots, respectively. Therefore, for slot configuration 0 and parameter set µ, there are 14 symbols per slot and 2 per subframe. µ Each time slot. Subcarrier spacing and symbol length / duration are functions of the parameter set. Subcarrier spacing can be equal to... ,in The parameter sets are 0 to 5. Therefore, the subcarrier spacing is 15 kHz for parameter set µ=0 and 480 kHz for parameter set µ=5. The symbol length / duration is negatively correlated with the subcarrier spacing. Figures 2A to 2D Examples are provided for slot configuration 0 with 14 symbols per slot and parameter set µ=0 with 1 slot per subframe. The subcarrier spacing is 15 kHz and the symbol duration is approximately 66.7 seconds. s.

[0065] A resource grid can be used to represent the frame structure. Each time slot consists of a resource block (RB) extending for 12 consecutive subcarriers (also known as a physical RB (PRB)). The resource grid is divided into multiple resource elements (REs). The number of bits carried by each RE depends on the modulation scheme.

[0066] like Figure 2A As illustrated, some of the REs carry reference (pilot) signals (RS) for the UE. The RS may include a demodulated RS (DM-RS) for channel estimation at the UE (indicated as R for a particular configuration). x(where 100x is the port number, but other DM-RS configurations are possible) and Channel State Information Reference Signal (CSI-RS). RS may also include Beam Measurement RS (BRS), Beam Refinement RS (BRRS), and Phase Tracking RS (PT-RS).

[0067] Figure 2B Examples of various DL channels within a subframe of a frame are illustrated. The Physical Downlink Control Channel (PDCCH) carries the DCI within one or more Control Channel Elements (CCEs), each CCE comprising nine RE groups (REGs), each REG comprising four consecutive REs in an OFDM symbol. The Primary Synchronization Signal (PSS) is located within symbol 2 of a specific subframe of the frame. The PSS is used by the UE 104 to determine subframe / symbol timing and physical layer identification. The Secondary Synchronization Signal (SSS) is located within symbol 4 of a specific subframe of the frame. The SSS is used by the UE to determine the Physical Layer Cell Identifier Group Number and radio frame timing. Based on the Physical Layer Identifier and Physical Layer Cell Identifier Group Number, the UE can determine the Physical Cell Identifier (PCI). Based on the PCI, the UE can determine the location of the aforementioned DM-RS. The Physical Broadcast Channel (PBCH) carrying the Primary Information Block (MIB) can logically group with the PSS and SSS to form a Synchronization Signal (SS) / PBCH block (SSB). The MIB provides the number of RBs in the system bandwidth and the System Frame Number (SFN). The Physical Downlink Shared Channel (PDSCH) carries user data, broadcast system information (such as System Information Blocks (SIBs)) not transmitted via the PBCH, and paging messages.

[0068] like Figure 2C As illustrated, some REs in the REs carry DM-RS (indicated as R for one particular configuration, but other DM-RS configurations are possible) for channel estimation at the base station. The UE may transmit DM-RS for the Physical Uplink Control Channel (PUCCH) and DM-RS for the Physical Uplink Shared Channel (PUSCH). The PUSCH DM-RS may be transmitted in the first or first two symbols of the PUSCH. Depending on whether a short or long PUCCH is transmitted and depending on the specific PUCCH format used, the PUCCH DM-RS may be transmitted in different configurations. Although not shown, the UE may transmit a Sounding Reference Signal (SRS). The SRS can be used by the base station for channel quality estimation to enable frequency-dependent scheduling of the UL.

[0069] Figure 2DExamples of various UL channels within a subframe of a frame are illustrated. The PUCCH can be located as indicated in one configuration. The PUCCH carries uplink control information (UCI), such as scheduling requests, channel quality indicators (CQI), pre-decoding matrix indicators (PMI), rank indicators (RI), and hybrid automatic repeat request (HARQ) ACK / NACK feedback. The PUCCH carries data and may additionally be used to carry buffer status reports (BSR), power clearance reports (PHR), and / or UCI.

[0070] Communication systems, such as 5G New Radio (NR) systems, can be deployed with various components or parts in multiple ways. In a 5G NR system or network, network nodes, network entities, network mobility elements, radio access network (RAN) nodes, core network nodes, network elements or network equipment (such as base stations (BS)), or one or more units (or components) performing base station functionality, can be implemented in aggregated or decomposed architectures. For example, BSs (such as Node B (NB), evolved NB (eNB), NR BS, 5G NB (gNB), access point (AP), transmit / receive point (TRP), or cell, etc.) can be implemented as aggregated base stations (also known as standalone BS or monolithic BS) or decomposed base stations.

[0071] Aggregated base stations can be configured to utilize a radio protocol stack that is physically or logically integrated within a single RAN node. Decentralized base stations can be configured to utilize a protocol stack that is physically or logically distributed across two or more units, such as one or more central or centralized units (CUs), one or more distributed units (DUs), or one or more radio units (RUs). In some respects, the CU may be implemented within a RAN node, and one or more DUs may co-located with the CU, or alternatively, may be geographically or virtually distributed across one or more other RAN nodes. DUs may be implemented to communicate with one or more RUs. Each of the CUs, DUs, and RUs may also be implemented as a virtual unit, namely a virtual central unit (VCU), a virtual distributed unit (VDU), or a virtual radio unit (VRU).

[0072] Base station type operation or network design can take into account the aggregation characteristics of base station functionality. For example, decomposed base stations can be utilized in Integrated Access Backhaul (IAB) networks, Open Radio Access Networks (O-RAN (such as network configurations initiated by the O-RAN Alliance)), or Virtualized Radio Access Networks (vRAN, also known as Cloud Radio Access Networks (C-RAN)). Decomposition can include distributing functionality across two or more units in various physical locations, as well as virtually distributing the functionality of at least one unit, which enables flexibility in network design. The various units in a decomposed base station or decomposed RAN architecture can be configured for wired or wireless communication with at least one other unit.

[0073] Figure 3 A diagram illustrating an example decomposed base station 300 architecture is shown. The decomposed base station 300 architecture may include one or more central units (CUs) 310, which may communicate directly with the core network 320 via a backhaul link, or indirectly with the core network 320 via one or more decomposed base station units, such as a near real-time (near-RT) RAN Intelligent Controller (RIC) 325 via an E3 link, or a non-real-time (non-RT) RIC 315 associated with a Service Management and Orchestration (SMO) framework 305, or both. CUs 310 may communicate with one or more distributed units (DUs) 330 via corresponding midhaul links (such as F1 interfaces). DUs 330 may communicate with one or more radio units (RUs) 340 via corresponding fronthaul links. RUs 340 may communicate with corresponding UEs 350 via one or more radio frequency (RF) access links. In some implementations, a UE 350 may be served simultaneously by multiple RUs 340.

[0074] Each of the units (i.e., CU 310, DU 330, RU 340, and near-RT RIC 325, non-RT RIC 315, and SMO frame 305) may include or be coupled to one or more interfaces configured to receive or transmit signals, data, or information (collectively, signals) via wired or wireless transmission media. Each of the units, or an associated processor or controller providing instructions to the communication interfaces of these units, may be configured to communicate with one or more other units via transmission media. For example, these units may include wired interfaces configured to receive signals or transmit signals to one or more other units via wired transmission media. Additionally, these units may include wireless interfaces that may include receivers, transmitters, or transceivers (such as radio frequency (RF) transceivers) configured to receive signals or transmit signals to one or more other units via wireless transmission media, or both.

[0075] In some aspects, the CU 310 can host one or more higher-level control functions. Such control functions may include Radio Resource Control (RRC), Packet Data Convergence Protocol (PDCP), Serving Data Adaptation Protocol (SDAP), etc. Each control function can be implemented using an interface configured to signal to other control functions hosted by the CU 310. The CU 310 can be configured to handle user plane functionality (i.e., Central Unit-User Plane (CU-UP)), control plane functionality (i.e., Central Unit-Control Plane (CU-CP)), or a combination thereof. In some specific implementations, the CU 310 can be logically divided 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 can communicate bidirectionally with the CU-CP units via an interface such as an E1 interface. The CU 310 can be implemented to communicate with the DU 330 for network control and signaling, as needed.

[0076] DU 330 may correspond to a logical unit comprising one or more base station functions for controlling the operation of one or more RU 340s. In some aspects, DU 330 may at least partially host one or more of the Radio Link Control (RLC) layer, Medium Access Control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, etc.) according to functional splits (such as those defined by the 3rd Generation Partnership Project (3GPP). In some aspects, DU 330 may further host one or more low PHY layers. Each layer (or module) may be implemented using an interface configured to communicate signals with other layers (and modules) hosted by DU 330 or with control functions hosted by CU 310.

[0077] Lower-layer functionality can be implemented by one or more RU 340s. In some deployments, an RU340 controlled by a DU 330 may correspond to a logical node that hosts RF processing functions or low-PHY layer functions (such as performing Fast Fourier Transform (FFT), Inverse FFT (iFFT), digital beamforming, or Physical Random Access Channel (PRACH) extraction and filtering, or both, at least in part based on functional decomposition (such as lower-layer functional decomposition). In such architectures, the RU 340 may be implemented to handle over-the-air (OTA) communications with one or more UE 350s. In some specific implementations, the real-time and non-real-time aspects of control plane and user plane communications with the RU 340 may be controlled by the corresponding DU 330. In some scenarios, this configuration enables the implementation of the DU 330 and CU 310 in cloud-based RAN architectures such as vRAN architectures.

[0078] The SMO framework 305 can be configured to support RAN deployment and provisioning of both non-virtualized and virtualized network elements. For non-virtualized network elements, the SMO framework 305 can be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which can be managed via operation and maintenance interfaces 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) 390 to perform network element lifecycle management (such as instantiating virtualized network elements) via a cloud computing platform interface such as the O3 interface. Such virtualized network elements may include, but are not limited to, CU 310, DU 330, RU 340, and near-RT RIC 325. In some implementations, the SMO framework 305 can communicate with the hardware aspects of the 5G RAN (such as the Open eNB (O-eNB) 311) via the O1 interface. Additionally, in some implementations, the SMO framework 305 can communicate directly with one or more RU 340s via the O1 interface. SMO framework 305 may also include a non-RT RIC 315 configured to support the functionality of SMO framework 305.

[0079] The non-RT RIC 315 can be configured to include logical functions that enable non-real-time control and optimization of RAN elements and resources, including artificial intelligence / machine learning (AI / ML) workflows for model training and updates, or policy-based guidance for 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 an A1 interface. The near-RT RIC 325 can be configured to include logical functions that enable near real-time control and optimization of RAN elements and resources via an interface, such as via an E3 interface, through data collection and action, connecting one or more CU 310s, one or more DU 330s, or both, and O-eNBs to the near-RT RIC 325.

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

[0081] Figure 4 This is a schematic illustration of wireless communication between a first wireless communication device 402 and a second wireless communication device 404, using decoding in various aspects. Each wireless communication device 402 and 404 can be a user equipment (UE), a network entity (e.g., an aggregated or decentralized base station), or any other suitable means or component for wireless communication. In the illustrated example, a source 422 within the first wireless communication device 402 transmits a digital message to a destination 444 in the second wireless communication device 404 via a communication channel 406 (e.g., a wireless channel). In practice, noise 408 on the communication channel 406 may affect the reliability of the message.

[0082] Block codes, or error-correcting codes, are frequently used to provide reliable transmission of digital messages over such channels. In a typical block code, the information message or sequence is divided into blocks, each with a length of K bits. Then, the encoder 424 at the first (transmitting) wireless communication device 402 mathematically adds redundancy to the information message, thereby producing a codeword of length N, where N > K. Here, the code rate R is the ratio between the message length and the block length: i.e., R = K / N. Utilizing this redundancy in the encoded information message is crucial for message reliability and can potentially correct bit errors that may occur due to noise 408 or other signal propagation. That is, the decoder 442 at the second (receiving) wireless communication device 404 can utilize the redundancy to attempt to recover the information message, even if bit errors may occur partially due to noise added to the channel, etc.

[0083] An example of a linear block error-correcting code is a polar code. Generally, channel polarization is generated using a recursive algorithm that defines polar codes. Polar codes are the first explicit codes to achieve the channel capacity of a symmetric binary-input discrete memoryless channel. That is, polar codes achieve the channel capacity (Shannon limit) or the theoretical upper bound on the amount of error-free information that can be transmitted on a discrete memoryless channel of a given bandwidth in the presence of noise. For polar codes, the codeword length... NIt is usually a power of 2 (e.g., 256, 512, 1024, etc.) because the original construction of the polarization matrix is ​​based on The Kronecker product. For example, used to generate a product with a block length of... N The generator matrix of the polar code (e.g., the polarization matrix). G N This can be expressed as:

[0084] here, B N It is a bit-inverted permutation matrix used for sequential elimination (SC) decoding (operating in some way similar to the interleaver function used in turbo decoders in LTE networks), and yes F of n The second-order Kronecker power. Fundamental matrix. F for .matrix It is achieved by using the basic 2×2 matrix F Multiply n This matrix is ​​generated by exponentiation of Kronecker. It is a lower triangular matrix because all entries above the main diagonal are zero. Since bit reversal only changes the row indices, the matrix... An alternative analysis can be performed. Matrix This can be expressed as:

[0085] The polar decoder can then generate polar code blocks, as follows: , in It is the encoded bit sequence (e.g., the bit sequence of a polar code block), and It is the encoded bit sequence (e.g., the bit sequence of an information block).

[0086] Therefore, the information bit vector u can include information that can be generated by the generator matrix. Multiple polarization decoding processes ( N (Number) original bits to generate the corresponding number of ( ) in the polar codeword x N (Number) decoded bits. In some examples, the information bit vector u may include representations as... K Multiple information bits and their representation as Multiple freeze bits. Freeze bits are bits set to appropriate predetermined values ​​(such as 0 or 1). Therefore, the values ​​of the freeze bits are usually known at both the transmitting and receiving devices. Polarization decoders (such as...) Figure 4 The polarization decoder 424 shown can be based on the decoding rate. RThis determines the number of information bits and the number of freeze bits. For example, the polarized decoder 424 can select a decoding rate from a set of one or more decoding rates. R And select in the information block K = N x R The last digit is used to send the information. Then, the remaining digits in the information block ( N - K (One) position can be fixed as a frozen position. .

[0087] To determine which information block bits should be set as frozen bits, the polar decoder 424 can further analyze the radio channels on which polar codewords can be transmitted. For example, the radio channels used to transmit polar codewords can be divided into a set of sub-channels, such that each encoded bit in the polar codeword is transmitted on one of the sub-channels. Thus, each sub-channel can correspond to a specific decoded bit position in the polar codeword (e.g., sub-channel -1 can correspond to a position containing the decoded bit). (The position of the decoded bits). The polarization decoder 424 can identify the bits used to transmit information. K Find the optimal sub-channel and determine the information block for... K The original bit positions that contribute (or correspond to) the optimal sub-channel. For example, based on the generator matrix, one or more original bits in the original bits of the information block can contribute to each decoded bit in the decoded bits of the polar codeword. Therefore, based on the generator matrix, the polar decoder 424 can determine the corresponding original bit positions in the information block. K The best sub-channel K Each original bit position is used to specify the information bits. K The original bit positions are specified, and the remaining original bit positions in the information block are specified for the frozen bits.

[0088] In some examples, the polarization decoder 424 can be determined by performing density evolution or Gaussian approximation. K The optimal sub-channels. Density evolution is generally known to those skilled in the art, and therefore its details will not be described further in this document. For example, the construction of polar codes based on density evolution is described in... R. Mori and T. Tanaka IEEE Commun. Lett., Vol. 13, No. 7, pp. 519-521, July 2009. The Gaussian approximation is a lower-complexity version of density evolution and is generally known to those skilled in the art. For example, the construction of polar codes based on the Gaussian approximation is described in... V. Miloslavskaya , , IEEE Trans. on Information Theory, June 2015.

[0089] The polarization decoder 424 can perform density evolution or Gaussian approximation to calculate the corresponding reliability metric, such as bit error probability (BEP) and / or log-likelihood ratio (LLR), for each original bit position in the original bit positions. For example, the LLR of the decoded bit positions is known from the sub-channel conditions (e.g., based on the corresponding SNR of the sub-channel). Therefore, since one or more original bits in the original bits of the information block can contribute to each decoded bit in the decoded bits of the codeword, the LLR of each original bit position in the original bit positions can be derived from the known LLR of the decoded bit positions by performing density evolution or Gaussian approximation. Based on the calculated LLR of the original bit positions, the polarization decoder 424 can sort the sub-channels and select... K The polarization decoder 424 then uses an optimal sub-channel (e.g., a "good" sub-channel) to transmit information bits. The polarization decoder 424 can then convert the information block corresponding to... K The original bit positions of each optimal sub-channel are set to include information bits, and the corresponding bits are... N - K The remaining original bit positions of each subchannel (e.g., a "bad" subchannel) are set to include the freeze bit.

[0090] The receiving wireless communication device 404 can receive x The noisy version, and must be... x or equivalent u Decoding is then performed. Polar codes can be decoded using a simple successive elimination (SC) decoder, which has O(n log n) capability. N log N The decoding complexity of ) and when N Shannon capacity is achievable with very large block sizes. However, for short and medium block lengths, the error rate performance of polar codes degrades significantly. Therefore, SC list (SCL) decoding can be used to improve the error rate performance of polar decoding. In the case of SC list decoding, instead of retaining only one decoding path (as in a simple SC decoder), the error rate performance is maintained... L There are 1 decoding path, among which L >1 and L Indicates the list size. At each decoding stage, the decoder at the receiving wireless communication device 404 (e.g., polarization decoder 442) discards the least likely (worst) decoding path and retains only the least likely path. L An optimal decoding path. For example, instead of selecting a value at each decoding stage. u i , create corresponding u i Two decoding paths for any possible value, and in two parallel decoding threads (2 LDecoding continues in the next step. To avoid an exponential increase in the number of decoding paths, only [the relevant data] is retained at each decoding stage. L The most likely path. Finally, the decoder will have a target for of L The decoder is given a list of candidates, from which the most likely candidate is selected. Therefore, when the decoder completes the SC list decoding algorithm, it returns a single codeword.

[0091] Figure 5 This is a schematic illustration of an information block 500 to be polarized decoded according to some aspects. Information block 500 includes multiple information bits 502 and multiple freeze bits 504. Information block 500 also includes CRC information 506 (e.g., CRC bits), which can be used by a receiving wireless communication device to verify the integrity of information bits 502. In some examples, the polarization decoder (e.g., Figure 4 The polarization decoder 424 shown can determine the positions of the K original bits in the information block 500 corresponding to the K best sub-channels for both CRC and information bits, and specify the remaining original bit positions in the information block for freezing bit 504.

[0092] In use with 2 m In the polarization-decoded modulation (PCM) of a constellation with signal points, a continuous demapper (e.g., a polarization demapper) will... m A binary polar code is connected to the channel input. m Unit-level (e.g., QAM symbols). An example of PCM is bit-interleaved PCM (BICM). In BICM, polarization decoding and modulation are connected via an interleaver, and Gray symbols can be used for mapping between decoded bits and constellation symbols. At the receiver, the polar demapper can first compute the bit-by-bit LLR, which is then processed independently. However, the LLR computed from the same channel output is correlated. Therefore, such demappers are considered mismatched (e.g., these polar demappers apply mismatched decoding).

[0093] Figure 6 This is a diagram illustrating a PCM scheme based on some aspects. Figure 6 The PCM scheme shown is used for 2 m -ASK constellation, and indicates the BICM scheme. In Figure 6 The example shown includes the lengths of the information bits and the freeze bits. mn vector u Split into m vectors Each of these vectors corresponds to a specific bit level. u j It can then be mapped to a vector through corresponding polarization transformations 702a, 702b, ... 702M. cj Each of the polarization transformations 702a, 702b, ..., 702M is configured to implement the corresponding vector. u j Polar coding. For example, polar transformations 702a, 702b, ..., 702M can convert information vectors... u j Mapped to the polarized decoded vector c j ,as follows:

[0094] Polarization mappers 704a, 704b, ..., 704N are configured to implement the polarization mapping... m Units digit Mapped to The i ASK symbol sent x i Therefore, for , No. j The output of polar coordinate transformation c j The first one mapped to the marking function j Units level. Polarization labels can be defined as: For example, such as Figure 7 As shown, polarization label b 702 can first be mapped to binary reflected Gray code (BRGC) 704 (e.g., after Gray marking), and then mapped to 8-ASK notation 706. Gray marking is an encoding where adjacent binary numbers differ by a single bit. Figure 7 In the example shown, the most significant bit (MSB) is flipped so that the 8-ASK symbol switches between pairs of (-7, 1), (-5, 3), (-3, 1), and (-1, 7), which maximizes energy efficiency.

[0095] Joint decoding and shaping (e.g., Probability Amplitude Shaping (PAS)) can perform FEC decoding and shaping within a single code. For example, joint decoding and shaping can use a single polar code with both freeze bits and shaping bits. For example, joint decoding and shaping can implement the placement of both shaping bits and information bits within a transmission. Shaping bits can be used to shape transmitted symbols to lower transmission power and thus improve efficiency.

[0096] Joint decoding and shaping can be applied to short-block-length packets, such as control information (e.g., Physical Downlink Control Channel (PDCCH)). Using joint decoding and shaping, information bits can be decoded only once, achieving lower complexity than separate decoding and PAS.

[0097] Figure 8 This is an illustration of an example of a transmitter configured for joint decoding and shaping, based on some aspects. As shown by box 802 labeled "CRC Append", transmitter 800 (e.g., a transmitting wireless communication device) can be configured to append Cyclic Redundancy Check (CRC) bits to the payload vector. a To generate vectors The transmitter sets the vector at polarization interleaving block 804. Perform polarization interleaving to generate vectors And an integer bit is inserted at integer bit insertion block 806 to generate a vector. The transmitter can also perform polar decoding at polar decoder block 808 to generate vectors (or codewords). Using the sub-block interleaver 810 to interleave vectors Reordered into vectors And bit selection is performed at bit selection block 812 to generate a rate matching vector. The transmitter can then be configured to interleave vectors at code bit interleaving block 814. Generate vectors The vector is scrambled at scrambling block 816. Generate vectors And at QAM mapping block 818, the vector Mapped to channel input symbols .

[0098] Figure 9 This is a diagram illustrating an example of a polar code circuit 900 configured for a PCM with joint decoding and shaping, based on some aspects. Figure 9 In the example shown, vector length N It can include both information bits and freeze bits. Vector Divided into three vectors These three vectors each correspond to a specific bit level. Figure 9 In the example shown, Indicates the sign level (e.g., the highest sign level). Indicates the second degree, and This represents the third bit level, which includes significant bits lower than those of the second bit level. (Vector) It can be fed into generating integer bits to construct vectors. [D] The pre-decoder 902.

[0099] vector It can be fed into the vector Perform the corresponding polarization transformations (e.g., polarization subkernels) 904a, 904b, and 904c of the polarization decoding operation to produce the respective polarization code subkernel outputs (e.g., vectors) associated with the bit level. B 1 , B 2 , B 3 ).exist Figure 9 In the example shown, polarization transform 904c is associated with the sign level, polarization transform 904b with the second level, and polarization transform 904a with the third level. The tag transform 906 can then be applied to the polar codec kernel output. B 1 , B 2 , B 3 To produce the transformed polar codeword kernel output (e.g., vector) corresponding to the polarized decoded codeword. ).vector The bit-sign mapping block 912 maps to the sign. In some examples, transform 906 and bit-sign mapping block 912 may correspond to... Figure 6 The polarization mapper shown is similar to the polarization mapper.

[0100] exist Figure 9 In the example shown, the tagging transformation 906 is a set partitioning to Gray tagging transformation 906. Set partitioning tags and Gray tags traditionally have different designs. For example, with set partitioning tags for each bit level, the set of signal points corresponding to the next bit level is selected such that the minimum Euclidean distance within the subset is maximized. Therefore, the mutual information increment from one level to the next is designed to be large. In contrast, in the case of Gray tags, as independent of each other as possible is generated.

[0101] In one example, those with the SP tag M The meta-ASP / PSK constellation can be represented as ( M , m binary matrix This binary matrix contains a dual representation of numbers. As rows, the leftmost column represents the least significant bit. Binary reflective Gray marking can also be represented by binary matrices of equal size. Provided. Regarding The following are examples: According to various aspects, M -ASK / PSK constellation set division markers can be obtained via ( m , mTransformation of a binary matrix into binary reflection Gray notation: Make Keep.

[0102] Similar to the ASK / PSK constellation chart, in a square In the case of a -QAM constellation diagram, SP labels can be converted to Gray labels through a linear transformation, such that: in G 2 It is a generator matrix of polar codes with a length of 2.

[0103] exist Figure 9 In the example shown, the set partitioning to Gray label transformation 906 includes various XOR operations (such as those by XOR gates). (As indicated), these XOR operations affect the output of the polar code subkernel. B 1 , B 2 , B 3 Perform operations to produce a transformed polar codeword kernel output (e.g., a vector) corresponding to the polarized decoded codeword. For example, the set partitioning to Gray label transformation 906 may include a first XOR gate 908, which outputs a polar code subkernel. B 2 Output of the polarization code kernel with positive and negative signs B 3 The first XOR operation is applied. Furthermore, the set partitioning to the Gray label transformation 906 may include a second XOR gate 910, which outputs the polar code subkernel. B 1 With polar code subkernel output B 2 Apply the second XOR operation. By using this transformation 906, the sign level ( Only affects ,and Bit flips can maximize energy flip gain, as in Gray mappings.

[0104] In one example The most reliable Each index can be left blank to be filled with integer bits, with the most reliable remaining index filled with information bits and the rest filled with zeros as freeze bits. Here, the indexes correspond to sub-channels. Most reliable... Each subchannel can be located at the sign level, corresponding to... u 3By assigning the most reliable sign level to the positive and negative sign levels. Each subchannel is used to shape the bits (which do not carry any information) and can achieve the desired target probability distribution of the symbols.

[0105] For example, the pre-decoder 902 can be based on average conditional entropy. This identifies the payload size (e.g., number) of the integer bits. The pre-decoder 902 can then output the transformed polar codec kernel. Density evolution or Gaussian approximation is used to construct the shaping bits to determine the shaping bits. For example, pre-decoder 902 can be configured as a polarization decoder to search for representations. And the polar codewords are polar codewords that are distributed according to the target probability distribution.

[0106] In one example, polarization transformations 904a, 904b, and 904c can be used to adjust the sign and negative bit levels. superior The most reliable A bit-level vector with indices left blank (e.g., to be subsequently filled with integer bits). Encode to produce the initial polar code subkernel output Then, the set can be partitioned into Gray-labeled transform 906 applied to the initial polar code subkernel output to obtain the Gray-labeled subkernel output that co-forms the codeword after initial polar decoding. The pre-decoder 902 can also be configured to output a subkernel based on Gray flags. To calculate the power saving function. For example, the power saving function. It can be calculated as: The pre-decoder 902 can then use a power-saving function to initialize the LLR and decode the codeword after initial polarization decoding to obtain the integer bits.

[0107] Figure 9 An example of a polar code circuit 900 for three bit levels is shown. However, Figure 9 The polar code circuit 900 shown can be extended to any number of bit levels, wherein the transform 906 includes additional XOR gates to XOR adjacent bit levels.

[0108] Figure 10 This is a diagram illustrating an example of a polar code circuit 1000 configured to perform joint decoding and shaping using positive and negative sign bits, based on certain aspects. (See diagram in...) Figure 9 In the example shown, Figure 10In the example shown, the polar code circuit 1000 includes multiple polarization transformations (e.g., polarization subkernels) 1004a, 1004b, and 1004c, which perform polarization decoding operations on corresponding bit sets to produce corresponding polarization subkernel outputs (e.g., vectors). B 1 , B 2 , B 3 The label transformation 1006 can then be applied to the polar codeson kernel output. B 1 , B 2 , B 3 To produce the transformed polar codeword kernel output (e.g., vector) corresponding to the polarized decoded codeword. ).vector The bit-sign mapping block 1012 maps to the sign. In some examples, transformation 1006 and bit-sign mapping block 1012 may correspond to... Figure 6 The polarization mapper shown is similar to the polarization mapper.

[0109] Furthermore, transformation 1006 can be a set partitioning to Gray label transformation 1006, which includes various XOR operations (such as those by XOR gates). (As indicated), these XOR operations affect the output of the polar code subkernel. B 1 , B 2 , B 3 Perform operations to produce a transformed polar codeword kernel output (e.g., a vector) corresponding to the polarized decoded codeword. For example, the set partitioning to Gray label transformation 1006 may include a first XOR gate 1008, which outputs a polar code subkernel. B 2 Output of the polarization code kernel with positive and negative signs B 3 The first XOR operation is applied. Furthermore, the set partitioning to the Gray label transformation 1006 may include a second XOR gate 1010, which outputs the polar code subkernel. B 1 With polar code subkernel output B 2 Apply the first XOR operation.

[0110] Each of the polarization transformations 1004a, 1004b, and 1004c is associated with a corresponding bit level 1014a, 1014b, and 1014c. Each bit level 1014a, 1014b, and 1014c includes a length... N The corresponding set of indices for the information block, where the information block of this length includes both information bits 1016 and freeze bits 1018. For example, the first level 1014c represents the sign level (e.g., the highest level) and may include the index {0 … x-1}, the second level 1014b includes significant bits lower than the sign level 1014c and may include the index {x … y-1}, and the third level 1014a includes significant bits lower than the second level 1014b and may include the index {y … N-1}. Figure 10 As shown, each index in the index corresponds to the corresponding sub-channel 1002 (e.g., frequency). Most reliable Each sub-channel 1002 can be located in the sign level 1014c. These Sub-channels are reserved for use as Figure 9 The generated integer bit value is shown as 1020. This is called... I The set of 1016 information bits (including CRC bits) can be placed in the exclusion... The most reliable subchannel 1002 of the integer-bit subchannel 1002. The remaining subchannels 1002 (e.g., the least reliable subchannels) may include a set of frozen bits. .

[0111] For relatively high-order modulated polar codes, interleavers can be used to improve wireless communication by reducing bit error rates and increasing transmission efficiency in fading channels. For example, interleaving the polar-decoded bits can distribute the transmitted bits over time to achieve the desired bit error distribution, thereby combating the effects of fading channels. Interleavers can change the arrangement of the signal bit stream without altering the information content. Therefore, interleavers can maximize the dispersion of consecutive error bits caused by bursts during transmission. In this way, the error correction and detection capabilities of the receiver can be improved. To further randomize the inter-symbol bit-level LLR at the receiver, different interleavers can be used at different bit levels.

[0112] Figure 11 This is a diagram illustrating an example of a polar code circuit 1100 configured to perform joint decoding and shaping using interleaving, based on certain aspects. (See diagram in...) Figure 9 In the example shown, Figure 11 In the example shown, the polar code circuit 1100 includes multiple polarization transformations (e.g., polarization subkernels) 1102a, 1102b, and 1102c, each polarization transformation performing a polarization decoding operation on a corresponding bit set associated with a bit level to produce a corresponding polar code subkernel output (e.g., a vector). B1 , B 2 , B 3 The label transformation 1106 can then be applied to the polar codeson kernel output. B 1 , B 2 , B 3 To produce the transformed polar codeword kernel output (e.g., vector) corresponding to the polarized decoded codeword. ).vector The bit-sign mapping block 1112 maps to the sign. In some examples, transformation 1106 and bit-sign mapping block 1112 may correspond to... Figure 6 The polarization mapper shown is similar to the polarization mapper.

[0113] Furthermore, transformation 1106 can be a set partitioning to Gray label transformation 1106, which includes various XOR operations (such as those by XOR gates). (As indicated), these XOR operations affect the output of the polar code subkernel. B 1 , B 2 , B 3 Perform operations to produce a transformed polar codeword kernel output (e.g., a vector) corresponding to the polarized decoded codeword. For example, the set partitioning to Gray label transformation 1106 may include a first XOR gate 1108, which outputs a polar code subkernel. B 2 Output of the polarization code kernel with positive and negative signs B 3 The first XOR operation is applied. Furthermore, the set partitioning to the Gray label transformation 1106 may include a second XOR gate 1110, which outputs the polar code subkernel. B 1 With polar code subkernel output B 2 Apply the first XOR operation.

[0114] like Figure 11 As further shown, the polar code circuit 1100 may include a plurality of bit-level interleavers 1104a, 1104b, and 1104c positioned after polar transformations 1102a, 1102b, and 1102c and before the set partitioning to Gray label transformation 1106 (e.g., Bit-level interleavers 1104a, 1104b, and 1104c can be configured to output to multiple polar codesub kernels. B1 , B 2 , B 3 Each polar code subkernel output in the process is subjected to a corresponding interleaving operation to produce the corresponding interleaved polar code subkernel output.

[0115] In some examples, each bit-level interleaver 1104a, 1104b, and 1104c may be defined by one or more of an interleaver pattern and / or a shift pattern. For example, an interleaver pattern may include a triangular interleaver, a rectangular interleaver, or any other suitable shape. An interleaver shift pattern may include a cyclic shift of the bits input to each interleaver 1104a, 1104b, or 1104c.

[0116] Figure 12 This is a diagram illustrating another example of a polar code circuit 1200 configured to perform joint decoding and shaping using interleaving, based on certain aspects. (See diagram in...) Figure 9 In the example shown, Figure 12 In the example shown, the polar code circuit 1200 includes multiple polarization transformations (e.g., polarization subkernels) 1202a, 1202b, and 1202c, each polarization transformation performing a polarization decoding operation on a corresponding bit set associated with a bit level to produce a corresponding polar code subkernel output (e.g., a vector). B 1 , B 2 , B 3 The label transformation 1206 can then be applied to the polar codeson kernel output. B 1 , B 2 , B 3 To produce the transformed polar codeword kernel output (e.g., vector) corresponding to the polarized decoded codeword. ).vector The bit-sign mapping block 1212 maps to the sign. In some examples, transformation 1206 and bit-sign mapping block 1212 may correspond to... Figure 6 The polarization mapper shown is similar to the polarization mapper.

[0117] Furthermore, transformation 1206 can be a set partitioning to Gray label transformation 1206, which includes various XOR operations (such as those by XOR gates). (As indicated), these XOR operations affect the output of the polar code subkernel. B 1 , B 2 , B3 Perform operations to produce a transformed polar codeword kernel output (e.g., a vector) corresponding to the polarized decoded codeword. For example, the set partitioning to Gray label transformation 1206 may include a first XOR gate 1208, which outputs a polar code subkernel. B 2 Output of the polarization code kernel with positive and negative signs B 3 The first XOR operation is applied. Furthermore, the set partitioning to the Gray label transformation 1206 may include a second XOR gate 1210, which outputs the polar code subkernel. B 1 With polar code subkernel output B 2 Apply the first XOR operation.

[0118] like Figure 12 As further shown, the polar code circuit 1200 may include a plurality of bit-level interleavers 1204a, 1204b, and 1204c positioned after the set is partitioned to the Gray label transform 1206 (e.g., Bit-level interleavers 1204a, 1204b, and 1204c can be configured to output multiple transformed polar codeson kernels. Each transformed polar codeword kernel output is subjected to a corresponding interleaving operation to produce the corresponding interleaved polar codeword kernel output that together form the polar decoded codeword.

[0119] In some examples, each bit-level interleaver 1204a, 1204b, and 1204c may be defined by one or more of an interleaver pattern and / or a shift pattern. For example, an interleaver pattern may include a triangular interleaver, a rectangular interleaver, or any other suitable shape. An interleaver shift pattern may include a cyclic shift of the bits input to each interleaver 1204a, 1204b, or 1204c.

[0120] exist Figure 11 and 12 In each of the examples shown, the LLR of the integer bits can be determined based on the output of the interleaved polar codeword kernel. For example, the power saving function can be calculated as: in It is the deinterleaver function.

[0121] In examples where the polar code circuit does not include an interleaver (e.g., as...), Figure 9 As shown), code construction based on mismatch decoding can be applied. For example, using... Figure 7 The mismatch mapper shown, the mismatch mapper from polarization labels b To BRGC The label transformation can be represented as:

[0122] Decoding involves demapping, followed by decoding the first polarization level, then demapping, then decoding the second polarization level, and so on, until the final (the) polarization level. m Level ). In one example, the polarization demapper passes soft information. To the j A polarization decoder that returns an estimate Then, the polar demapper is continuously computed: . . . Should It can be calculated as follows: , in Then use the combination of boxplus operations defined below. : . in , Output from the same channel Y It is computed and therefore stochastically correlated. This is ignored by the boxplus operation, which assumes independence. Therefore, in Therefore, the demapper is mismatched.

[0123] Figure 13 This is a block diagram illustrating an example of a specific hardware implementation of a wireless communication device employing processing system 1314. For example, wireless communication device 1300 may correspond to the above reference. Figure 1 , Figure 3 and / or Figure 4 Any of the UEs or network entities shown and described.

[0124] The wireless communication device 1300 may be implemented using a processing system 1314 including one or more processors 1304. Examples of processors 1304 include microprocessors, microcontrollers, digital signal processors (DSPs), field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic components, discrete hardware circuitry, and other suitable hardware configured to perform the various functionalities described throughout this disclosure. In various examples, the wireless communication device 1300 may be configured to perform any one or more of the functions described herein. That is, the processor 1304 utilized in the wireless communication device 1300 may be used to implement any one or more processes and procedures described below.

[0125] In some cases, processor 1304 may be implemented via a baseband or modem chip, and in other implementations, processor 1304 may include multiple devices that are distinct from and different from the baseband or modem chip (e.g., in scenarios such as those that can work together to implement the examples discussed herein). Furthermore, as mentioned above, various hardware arrangements and components beyond the baseband modem processor may be used in implementations, including RF chains, power amplifiers, modulators, buffers, interleavers, adders / summers, etc.

[0126] In this example, a bus architecture (typically represented by bus 1302) can be used to implement the processing system 1314. Bus 1302 may include any number of interconnect buses and bridges, depending on the specific application of the processing system 1314 and the overall design constraints. Bus 1302 links together various circuits including one or more processors (typically represented by processor 1304), memory 1305, and computer-readable media (typically represented by computer-readable media 1306). Bus 1302 may also link various other circuits such as timing sources, peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further. Bus interface 1308 provides an interface between bus 1302 and at least one communication interface 1310 (e.g., a transceiver and one or more antenna arrays). Communication interface 1310 provides components for communicating with various other devices via a transmission medium (e.g., an air interface). Bus interface 1438 may also provide an interface between bus 1302 and optional user interface 1312 (e.g., keypad, display, speaker, microphone, joystick).

[0127] Processor 1304 is responsible for managing bus 1302 and general processing, including executing software stored on computer-readable medium 1306. Software should be broadly interpreted as instructions, instruction sets, code, code segments, program code, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description languages, or others. When executed by processor 1304, the software causes processing system 1314 to perform the various functions described below for any particular device. Computer-readable medium 1306 and memory 1305 may also be used to store data utilized by processor 1304 during software execution. For example, memory 1305 may store one or more of information bits 1316 and integer bits 1318.

[0128] Computer-readable medium 1306 may be a non-transitory computer-readable medium. Non-transitory computer-readable media include, for example, magnetic storage devices (e.g., hard disks, floppy disks, magnetic stripes), optical disks (e.g., compact discs (CDs) or digital versatile discs (DVDs)), smart cards, flash memory devices (e.g., card, stick, or key drives), random access memory (RAM), read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), registers, removable disks, and any other suitable medium for storing software and / or instructions accessible and readable by a computer. Computer-readable medium 1306 may reside in processing system 1314, be located outside processing system 1314, or be distributed across multiple entities including processing system 1314. Computer-readable medium 1306 may be embodied in a computer program product. For example, a computer program product may include a computer-readable medium in encapsulation material. In some examples, computer-readable medium 1306 may be part of memory 1305. Those skilled in the art will recognize that the optimal implementation of the functions described throughout this disclosure depends on the specific application and the overall design constraints imposed on the system as a whole.

[0129] In some aspects of this disclosure, processor 1304 may include circuitry configured for various functions. For example, processor 1304 may include communication and processing circuitry 1342 configured to communicate with a receiving wireless communication device (e.g., a UE or network entity). In some examples, communication and processing circuitry 1342 may include one or more hardware components providing a physical structure that performs processes related to wireless communication (e.g., signal reception and / or signal transmission) and signal processing (e.g., processing received signals and / or processing signals for transmission). In some examples, communication and processing circuitry 1342 may include low-complexity circuitry for baseband or near-baseband processing with minimal RF processing.

[0130] In some specific implementations of communication involving the reception of information, communication and processing circuitry 1342 may receive signals from components of wireless communication device 1300 (e.g., from communication interface 1310, which receives information via radio frequency signaling or some other type of signaling suitable for the applicable communication medium), process (e.g., decode) the information, and output the processed information. For example, communication and processing circuitry 1342 may output information to another component of processor 1304, memory 1305, or bus interface 1308. In some examples, communication and processing circuitry 1342 may receive one or more of signals, messages, other information, or any combination thereof. In some examples, communication and processing circuitry 1342 may receive information via one or more channels. In some examples, communication and processing circuitry 1342 may include functionality for receiving components. In some examples, communication and processing circuitry 1342 may include functionality for processing components, including demodulation components, decoding components, etc.

[0131] In some specific implementations of communication involving the transmission (e.g., transmission) of information, communication and processing circuitry 1342 may acquire information (e.g., from another component of processor 1304, memory 1305, or bus interface 1308), process (e.g., modulate, encode, etc.) the information, and output the processed information. For example, communication and processing circuitry 1342 may output information to communication interface 1310 (e.g., which transmits information via radio frequency signaling or some other type of signaling suitable for the applicable communication medium). In some examples, communication and processing circuitry 1342 may transmit one or more of signals, messages, other information, or any combination thereof. In some examples, communication and processing circuitry 1342 may transmit information via one or more channels. In some examples, communication and processing circuitry 1342 may include functionality for components used for transmission (e.g., components used for sending). In some examples, communication and processing circuitry 1342 may include functionality for components used for generation, including components for modulation, components for encoding, etc.

[0132] In some examples, the communication and processing circuitry 1342 may be configured to transmit polarized-decoded codewords to a receiving wireless communication device (e.g., a UE or network entity). The communication and processing circuitry 1342 may also be configured to execute communication and processing instructions (software) 1352 stored in a computer-readable medium 1306 to perform one or more of the functions described herein.

[0133] The processor 1304 may also include a polar code circuit 1344 configured to generate polar-decoded codewords. In some examples, the polar code circuit 1344 may include... Figure 9 , Figure 10 , Figure 11 and / or Figure 12 The polar code circuit shown is illustrated. For example, polar code circuit 1344 can be configured to assign multiple information bits and multiple freeze bits to multiple sub-channels associated with multiple bit levels. Polar code circuit 1344 can also be configured to place multiple shaping bits on selected sub-channels among the multiple sub-channels. The selected sub-channel can be associated with the first bit level among multiple bit levels corresponding to the sign bit level. Polar code circuit 1344 can also be configured to: encode multiple information bits, multiple freeze bits, and multiple shaping bits into multiple polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among the multiple bit levels; and apply a set partitioning to Gray label transformation to the polar code sub-core output to produce multiple transformed polar code sub-core outputs corresponding to the polar decoded codeword.

[0134] In some examples, the polar code circuit 1344 can be configured to: apply a first XOR operation to a second polar code subcore output among a plurality of polar code subcore outputs using the output of a first polar code subcore; and apply a second XOR operation to a third polar code subcore output among a plurality of polar code subcore outputs using the output of the second polar code subcore. The second polar code subcore output may be associated with a second bit level among the plurality of bit levels, and the third polar code subcore output may be associated with a third bit level among the plurality of bit levels. The third bit level may include significant bits lower than the second bit level.

[0135] In some examples, the polar code circuit 1344 can be configured to identify the payload size of multiple integer bits based on average conditional entropy, and to construct multiple integer bits using density evolution or Gaussian approximation on multiple transformed polar code sub-kernel outputs. In one example, the polar code circuit 1344 can be configured to place multiple information bits on information bit sub-channels and multiple frozen bits on frozen bit sub-channels in multiple sub-channels, while leaving a selected sub-channel empty. The polar code circuit 1344 can also be configured to encode multiple information bits and multiple frozen bits to generate multiple initial polar code sub-kernel outputs. The polar code circuit 1344 can then be configured to apply a set partitioning to Gray label transformation to the multiple initial polar code sub-kernel outputs to obtain multiple Gray labeled sub-kernel outputs that together form the codeword after initial polar decoding. The polar code circuit 1344 can then be configured to: compute a power saving function based on the multiple Gray labeled sub-kernel outputs; and perform a polar decoding operation on the codeword after initial polar decoding using the power saving function to obtain multiple integer bits. In some examples, the polar code circuit 1344 can be configured to apply a corresponding interleaving operation to each of the multiple initial polar code sub-core outputs or each of the Gray-marked sub-core outputs to produce a corresponding interleaved polar code sub-core output. In this example, the power saving function is calculated based on the corresponding interleaved polar code sub-core output.

[0136] In some examples, the polar code circuit 1344 may be configured to apply a corresponding interleaving operation to each of a plurality of polar code subkernel outputs to produce a corresponding interleaved polar code subkernel output. In this example, a set partitioning to Gray label transformation is applied to the corresponding interleaved polar code subkernel output. In some examples, the polar code circuit 1344 may be configured to apply a corresponding interleaving operation to each of a plurality of transformed polar code subkernel outputs to produce a corresponding interleaved polar code subkernel output that together form a codeword after polar decoding. In some examples, the polar code circuit 1344 may also be configured to map a corresponding bit from each of a plurality of transformed polar code subkernel outputs to a plurality of symbols. The polar code circuit 1344 may also be configured to execute polar code instructions (software) 1354 stored in computer-readable medium 1306 to implement one or more of the functions described herein.

[0137] Figure 14 This is a flowchart of an exemplary process 1400 according to some aspects. As described below, in certain specific embodiments within the scope of this disclosure, some or all of the exemplary features may be omitted, and some exemplary features may not be necessary for all specific embodiments of the examples. In some examples, the method may be as described above and Figure 13 The wireless communication device 1300 illustrated herein is executed by a processor or processing system, or by any suitable component for performing the described functions.

[0138] At box 1402, the wireless communication device can assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described provides components for assigning information bits and freeze bits to sub-channels.

[0139] At box 1404, the wireless communication device can place multiple shaped bits on selected sub-channels among multiple sub-channels. The selected sub-channel can be associated with the first bit level among multiple bit levels. The first bit level can be a sign bit level. In some examples, the wireless communication device can identify the payload size of the multiple shaped bits based on average conditional entropy and construct the multiple shaped bits using density evolution or Gaussian approximation on the outputs of multiple transformed polar code sub-kernels. For example, the above combined... Figure 13 The polar code circuit 1344 shown and described can provide components for placing shaping bits on selected sub-channels.

[0140] At box 1406, the wireless communication device can encode multiple information bits, multiple freeze bits, and multiple shape bits into multiple polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among multiple bit levels. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described provides components for encoding information bits, freeze bits, and shape bits.

[0141] At box 1408, the wireless communication device may apply a set partitioning to Gray-labeled transform to the multiple polar codec kernel outputs to produce multiple transformed polar codec kernel outputs corresponding to the polar-decoded codewords. In some examples, the wireless communication device may apply a first XOR operation to a second polar codec kernel output among the multiple polar codec kernel outputs using a first polar codec kernel output associated with a first bit level, wherein the second polar codec kernel output is associated with a second bit level among the multiple bit levels. The wireless communication device may then apply a second XOR operation to a third polar codec kernel output among the multiple polar codec kernel outputs and the second polar codec kernel output, wherein the third polar codec kernel output is associated with a third bit level among the multiple bit levels, and the third bit level includes significant bits lower than the second bit level. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described can provide components for the application set partitioning to Gray label transformation.

[0142] At box 1410, the wireless communication device may transmit the polarized decoded codeword (e.g., to the receiving wireless communication device). For example, in conjunction with the above... Figure 13 The communication and processing circuitry 1342 shown and described, together with the communication interface 1310, provides components for transmitting polarized decoded codewords.

[0143] In some examples, the wireless communication device may apply a corresponding interleaving operation to each of a plurality of polar codec kernel outputs to produce a corresponding interleaved polar codec kernel output. In this example, a set partitioning to Gray label transform is applied to the corresponding interleaved polar codec kernel output. In some examples, the wireless communication device may apply a corresponding interleaving operation to each of a plurality of transformed polar codec kernel outputs to produce a corresponding interleaved polar codec kernel output that together form the codeword after polar decoding.

[0144] Figure 15 This is a flowchart of an exemplary process 1500 according to some aspects. As described below, in certain specific embodiments within the scope of this disclosure, some or all of the exemplary features may be omitted, and some exemplary features may not be necessary for all specific embodiments of the examples. In some examples, the method may be as described above and Figure 13 The wireless communication device 1300 illustrated herein is executed by a processor or processing system, or by any suitable component for performing the described functions.

[0145] At box 1502, the wireless communication device may place multiple information bits on the information bit sub-channel of multiple sub-channels and place multiple frozen bits on the frozen bit sub-channel of multiple sub-channels, wherein the selected sub-channels reserved for multiple shaping bits in the multiple sub-channels are empty. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described can provide components for placing information bits and freeze bits on subchannels.

[0146] At box 1504, the wireless communication device can encode multiple information bits and multiple freeze bits to generate multiple initial polar code sub-kernel outputs. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described provides components for encoding information bits and freeze bits.

[0147] At box 1506, the wireless communication device can apply a set partitioning to the Gray label transformation to the multiple initial polarization code sub-kernel outputs to obtain multiple Gray label sub-kernel outputs that together form the codeword after initial polarization decoding. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described can provide components for the application set partitioning to Gray label transformation.

[0148] At box 1508, the wireless communication device can compute a power saving function based on multiple Gray-marked subkernel outputs. In some examples, the wireless communication device can apply a corresponding interleaving operation to each of the multiple initial polar code subkernel outputs or each of the multiple Gray-marked subkernel outputs to produce a corresponding interleaved polar code subkernel output. In this example, the power saving function can be computed based on the corresponding interleaved polar code subkernel outputs. For example, the above combined with... Figure 13 The polar code circuit 1344 shown and described, and / or in combination with the above, is shown and described. Figure 9 The pre-decoder 902 shown and described provides components for calculating the power saving function.

[0149] At box 1510, the wireless communication device can use a power-saving function to perform polarization decoding on the codeword after initial polarization decoding to obtain multiple integer bits. For example, in conjunction with the above... Figure 13 The polar code circuit 1344 shown and described, and / or in combination with the above, is shown and described. Figure 9 The pre-decoder 902 shown and described can provide components for performing polarization decoding operations.

[0150] In one configuration, the wireless communication device 1300 includes: means for assigning a plurality of information bits and a plurality of frozen bits to a plurality of sub-channels associated with a plurality of bit levels; means for placing a plurality of shaped bits on a selected sub-channel among the plurality of sub-channels, the selected sub-channel being associated with a first bit level among the plurality of bit levels, the first bit level being a sign bit level; means for encoding the plurality of information bits, the plurality of frozen bits, and the plurality of shaped bits into a plurality of polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among the plurality of bit levels; means for applying a set partitioning to Gray label transformation to the polar code sub-core outputs to generate a plurality of transformed polar code sub-core outputs corresponding to polar-decoded codewords; and means for transmitting the polar-decoded codewords, as described in this disclosure. In one aspect, the aforementioned means may be... Figure 13 The processor 1304 shown is configured to perform the functions described by the aforementioned components. Alternatively, the aforementioned components may be circuits or any devices configured to perform the functions described by the aforementioned components.

[0151] Of course, in the above example, the circuitry included in processor 1304 is provided merely as an example, and other components for performing the described functions may be included within various aspects of this disclosure, including but not limited to those stored in computer-readable storage medium 1306 or Figure 6 and / or Figures 8 to 13 In any of the other suitable devices or components described herein, utilizing, for example, those described herein... Figure 14and / or Figure 15 Instructions for the described process and / or algorithm.

[0152] Figure 14 and Figure 15 The processes shown may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere in this document.

[0153] Aspect 1: A method for performing wireless communication at a wireless communication device, the method comprising: assigning a plurality of information bits and a plurality of frozen bits to a plurality of sub-channels associated with a plurality of bit levels; and placing a plurality of shaped bits on a selected sub-channel among the plurality of sub-channels, the selected sub-channel being associatable with a first bit level among the plurality of bit levels, the first bit level being a sign bit level; encoding the plurality of information bits, the plurality of frozen bits, and the plurality of shaped bits into a plurality of polar code sub-core outputs, each polar code sub-core output being associated with a corresponding bit level among the plurality of bit levels; applying a set partitioning to Gray label transform to the plurality of polar code sub-core outputs to generate a plurality of transformed polar code sub-core outputs corresponding to a polar-decoded codeword; and transmitting the polar-decoded codeword.

[0154] Aspect 2: According to the method of Aspect 1, wherein applying the set partition to the Gray label transformation comprises: applying a first XOR operation to a second polar code sub-kernel output among the plurality of polar code sub-kernel outputs using a first polar code sub-kernel output associated with the first bit level, the second polar code sub-kernel output being associated with a second bit level among the plurality of bit levels; and applying a second XOR operation to a third polar code sub-kernel output among the plurality of polar code sub-kernel outputs and the second polar code sub-kernel output, the third polar code sub-kernel output being associated with a third bit level among the plurality of bit levels, the third bit level including a lower significant bit than the second bit level.

[0155] Aspect 3: The method according to aspect 1 or 2, wherein placing the plurality of integer bits includes: identifying the payload size of the plurality of integer bits based on average conditional entropy; and constructing the plurality of integer bits using density evolution or Gaussian approximation on the output of the plurality of transformed polar codeword kernels.

[0156] Aspect 4: According to the method of Aspect 3, wherein constructing the plurality of integer bits further includes: placing the plurality of information bits on an information bit sub-channel and placing the plurality of frozen bits on a frozen bit sub-channel, wherein the selected sub-channel is empty; encoding the plurality of information bits and the plurality of frozen bits to generate a plurality of initial polarization code sub-kernel outputs; applying the set partitioning to Gray label transformation to the plurality of initial polarization code sub-kernel outputs to obtain a plurality of Gray label sub-kernel outputs that together form the codeword after initial polarization decoding; calculating a power saving function based on the plurality of Gray label sub-kernel outputs; and performing a polarization decoding operation on the codeword after initial polarization decoding using the power saving function to obtain the plurality of integer bits.

[0157] Aspect 5: According to the method of aspect 4, the method further includes: applying a corresponding interleaving operation to each of the plurality of initial polar code sub-kernel outputs or each of the plurality of Gray-marked sub-kernel outputs to generate a corresponding interleaved polar code sub-kernel output, wherein the power saving function is calculated based on the corresponding interleaved polar code sub-kernel output.

[0158] Aspect 6: The method according to any one of Aspects 1 to 5, the method further comprising: applying a corresponding interleaving operation to each of the plurality of polar code sub-kernel outputs to produce a corresponding interleaved polar code sub-kernel output, wherein the set partitioning to Gray label transformation is applied to the corresponding interleaved polar code sub-kernel output.

[0159] Aspect 7: The method according to any one of Aspects 1 to 5, the method further comprising: applying a corresponding interleaving operation to each of the plurality of transformed polar code sub-kernel outputs to generate corresponding interleaved polar code sub-kernel outputs that together form the polar decoded codeword.

[0160] Aspect 8: The method according to any one of Aspects 1 to 7, the method further comprising: mapping a corresponding bit from each of the plurality of transformed polar code sub-kernel outputs to a plurality of symbols.

[0161] Aspect 9: The method according to any one of Aspects 1 to 8, wherein the wireless communication device is a user equipment (UE).

[0162] Aspect 10: The method according to any one of Aspects 1 to 8, wherein the wireless communication device is a network entity.

[0163] Aspect 11: An apparatus configured for wireless communication at a wireless communication device, the apparatus comprising: one or more memories; and one or more processors coupled to the one or more memories, the one or more processors being configured to perform the method according to any one of aspects 1 to 10.

[0164] Aspect 12: An apparatus comprising at least one component for performing the method according to any one of aspects 1 to 10.

[0165] Aspect 13: A non-transitory computer-readable medium wherein instructions are stored, the instructions being executable by one or more processors of a wireless communication device to perform the method according to any one of aspects 1 to 10.

[0166] Several aspects of wireless communication networks have been presented with reference to exemplary embodiments. As will be readily understood by those skilled in the art, the various aspects described herein can be extended to other telecommunications systems, network architectures, and communication standards.

[0167] As examples, various aspects can be implemented within other systems defined by 3GPP, such as Long Term Evolution (LTE), Evolved Packet System (EPS), Universal Mobile Telecommunications System (UMTS), and / or Global System for Mobile Communications (GSM). These aspects can also be extended to systems defined by 3GPP2, such as CDMA2000 and / or Evolved Data Optimized (EV-DO). Other examples can be implemented within systems employing IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Ultra Wideband (UWB), Bluetooth, and / or other suitable systems. The actual telecommunications standards, network architecture, and / or communication standards adopted will depend on the specific application and the overall design constraints imposed on the system.

[0168] Within this disclosure, the term "exemplary" is used to mean "serving as an example, instance, or illustration." Any specific implementation or aspect described herein as "exemplary" is not necessarily to be construed as superior to or better than other aspects of this disclosure. Similarly, the term "aspect" does not require that all aspects of this disclosure include the features, advantages, or modes of operation discussed. The term "coupled" is used herein to refer to direct or indirect coupling between two objects. For example, if object A physically contacts object B, and object B contacts object C, objects A and C can still be considered coupled to each other, even if they are not in direct physical contact. For example, a first object can be coupled to a second object, even if the first object never has direct physical contact with the second object. The term "circuit" is used broadly, and it is intended to include both hardware implementations of electronic devices and conductors (where these electronic devices and conductors, when connected and configured, perform the functions described in this disclosure, without limitation on the type of electronic circuit) and software implementations of information and instructions (where these information and instructions, when executed by a processor, perform the functions described in this disclosure).

[0169] Figures 1 to 15 One or more of the components, steps, features, and / or functions illustrated herein may be rearranged and / or combined into a single component, step, feature, or function, or embodied in multiple components, steps, or functions. Additional elements, components, steps, and / or functions may be added without departing from the novel features disclosed herein. Figure 1 , Figures 3 to 6 and Figures 8 to 13 The apparatuses, devices, and / or components illustrated herein may be configured to perform one or more of the methods, features, or steps described herein. The novel algorithms described herein may also be efficiently implemented in software and / or embedded in hardware.

[0170] It should be understood that the specific order or hierarchy of steps in the disclosed methods is an example of an exemplary process. It should be understood that the specific order or hierarchy of steps in these methods may be rearranged based on design preferences. The appended method claims present the elements of various steps in a sample order and are not intended to be limited to the specific order or hierarchy presented, unless specifically stated herein.

[0171] The foregoing description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. Therefore, the claims are not intended to be limited to the aspects shown herein, but are to be consistent with the full scope of the claims, wherein references to elements in the singular form are not intended to mean “one and only one,” but rather “one or more,” unless specifically stated otherwise. The term “some” refers to one or more unless specifically stated otherwise. The phrase “at least one of” referring to a list of items means any combination of those items, including individual members. As an example, “at least one of a, b, or c” is intended to cover: a; b; c; a and b; a and c; b and c; and a, b, and c. All structural and functional equivalents of the elements throughout the various aspects described herein that are currently or hereafter known to a person skilled in the art are expressly incorporated herein by reference and are intended to be covered by the claims. Furthermore, nothing disclosed herein is intended to be offered to the public, whether or not such disclosure is explicitly stated in the claims.

Claims

1. An apparatus configured to perform wireless communication at a wireless communication device, the apparatus comprising: One or more memory units; and One or more processors, said one or more processors coupled to said one or more memories, said one or more processors being configured to: Assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; Multiple integer bits are placed on a selected sub-channel among the multiple sub-channels, and the selected sub-channel is associated with the first bit level among the multiple bit levels, where the first bit level is the sign bit level; The plurality of information bits, the plurality of frozen bits, and the plurality of integer bits are encoded into a plurality of polar code sub-kernel outputs, and each polar code sub-kernel output is associated with a corresponding bit level among the plurality of bit levels; The set of polar code sub-kernel outputs is partitioned into Gray label transforms to generate multiple transformed polar code sub-kernel outputs corresponding to the codewords after polar decoding; as well as Send the codeword after polarization decoding.

2. The apparatus of claim 1, wherein the one or more processors are further configured to: A first XOR operation is applied to the output of a second polar code sub-kernel among the plurality of polar code sub-kernel outputs using the first polar code sub-kernel output associated with the first bit level, the second polar code sub-kernel output being associated with a second bit level among the plurality of bit levels; and A second XOR operation is applied to the third polar code sub-core output among the plurality of polar code sub-core outputs and the second polar code sub-core output. The third polar code sub-core output is associated with the third bit level among the plurality of bit levels. The third bit level includes a lower significant bit than the second bit level.

3. The apparatus of claim 1, wherein the one or more processors are further configured to: The effective payload size of the multiple integer bits is identified based on the average conditional entropy; and The multiple transformed polar code kernel outputs are used to construct the multiple integer bits using density evolution or Gaussian approximation.

4. The apparatus of claim 3, wherein the one or more processors are further configured to: The plurality of information bits are placed on the information bit sub-channel of the plurality of sub-channels and the plurality of frozen bits are placed on the frozen bit sub-channel of the plurality of sub-channels, wherein the selected sub-channel is empty; The plurality of information bits and the plurality of frozen bits are encoded to generate a plurality of initial polar code sub-kernel outputs; The set of outputs of the multiple initial polarization code sub-kernels is divided into Gray label transformations to obtain multiple Gray label sub-kernel outputs that together form the codewords after initial polarization decoding; The power saving function is calculated based on the sub-kernel output after the multiple Gray tags are defined. as well as The power-saving function is used to perform polarization decoding on the codeword after initial polarization decoding to obtain the plurality of integer bits.

5. The apparatus of claim 4, wherein the one or more processors are further configured to: Apply a corresponding interleaving operation to each of the plurality of initial polar code subkernel outputs or each of the plurality of Gray-marked subkernel outputs to generate a corresponding interleaved polar code subkernel output. The power saving function is calculated based on the corresponding interleaved polar code sub-kernel output.

6. The apparatus of claim 1, wherein the one or more processors are further configured to: Apply a corresponding interleaving operation to each of the plurality of polar code sub-kernel outputs to generate the corresponding interleaved polar code sub-kernel output. The set partitioning to Gray label transformation is applied to the corresponding interleaved polar code subkernel output.

7. The apparatus of claim 1, wherein the one or more processors are further configured to: Apply a corresponding interleaving operation to each of the multiple transformed polar code sub-kernel outputs to generate corresponding interleaved polar code sub-kernel outputs that together form the codeword after polar decoding.

8. The apparatus of claim 1, wherein the one or more processors are further configured to: The corresponding bit of each of the multiple transformed polar code sub-kernel outputs is mapped to multiple symbols.

9. The apparatus of claim 1, wherein the wireless communication device is a user equipment (UE).

10. The apparatus of claim 1, wherein the wireless communication device is a network entity.

11. A method for performing wireless communication at a wireless communication device, the method comprising: Assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; Multiple integer bits are placed on a selected sub-channel among the multiple sub-channels, and the selected sub-channel is associated with the first bit level among the multiple bit levels, where the first bit level is the sign bit level; The plurality of information bits, the plurality of frozen bits, and the plurality of integer bits are encoded into a plurality of polar code sub-kernel outputs, and each polar code sub-kernel output is associated with a corresponding bit level among the plurality of bit levels; The set of polar code sub-kernel outputs is partitioned into Gray label transforms to generate multiple transformed polar code sub-kernel outputs corresponding to the codewords after polar decoding; as well as Send the codeword after polarization decoding.

12. The method of claim 11, wherein applying the set partitioning to the Gray label transformation comprises: A first XOR operation is applied to the second polar code kernel output among the plurality of polar code kernel outputs using the first polar code sub-kernel output associated with the first bit level, wherein the second polar code kernel output is associated with the second bit level among the plurality of bit levels; as well as A second XOR operation is applied to the third polar code sub-core output among the plurality of polar code sub-core outputs and the second polar code sub-core output. The third polar code sub-core output is associated with the third bit level among the plurality of bit levels. The third bit level includes a lower significant bit than the second bit level.

13. The method of claim 11, wherein placing the plurality of shaping bits comprises: The effective payload size of the multiple integer bits is identified based on the average conditional entropy. as well as The multiple transformed polar code kernel outputs are used to construct the multiple integer bits using density evolution or Gaussian approximation.

14. The method of claim 13, wherein constructing the plurality of shaping bits further comprises: The plurality of information bits are placed on the information bit sub-channel of the plurality of sub-channels and the plurality of frozen bits are placed on the frozen bit sub-channel of the plurality of sub-channels, wherein the selected sub-channel is empty; The plurality of information bits and the plurality of frozen bits are encoded to generate a plurality of initial polar code sub-kernel outputs; The set of outputs of the multiple initial polarization code sub-kernels is divided into Gray label transformations to obtain multiple Gray label sub-kernel outputs that together form the codewords after initial polarization decoding; The power saving function is calculated based on the sub-kernel output after the multiple Gray tags are defined. as well as The power-saving function is used to perform polarization decoding on the codeword after initial polarization decoding to obtain the plurality of integer bits.

15. The method according to claim 14, further comprising: Apply a corresponding interleaving operation to each of the plurality of initial polar code subkernel outputs or each of the plurality of Gray-marked subkernel outputs to generate a corresponding interleaved polar code subkernel output. The power saving function is calculated based on the corresponding interleaved polar code sub-kernel output.

16. The method according to claim 11, further comprising: Apply a corresponding interleaving operation to each of the plurality of polar code sub-kernel outputs to generate the corresponding interleaved polar code sub-kernel output. The set partitioning to Gray label transformation is applied to the corresponding interleaved polar code subkernel output.

17. The method according to claim 11, further comprising: Apply a corresponding interleaving operation to each of the multiple transformed polar code sub-kernel outputs to generate corresponding interleaved polar code sub-kernel outputs that together form the codeword after polar decoding.

18. The method according to claim 11, further comprising: The corresponding bit of each of the multiple transformed polar code sub-kernel outputs is mapped to multiple symbols.

19. The method of claim 11, wherein the wireless communication device is a user equipment (UE).

20. The method of claim 11, wherein the wireless communication device is a network entity.

21. An apparatus comprising: A component used to assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; A component for placing multiple shaped bits on a selected sub-channel of the plurality of sub-channels, the selected sub-channel being associated with the first bit level of the plurality of bit levels, the first bit level being the sign bit level; A component for encoding the plurality of information bits, the plurality of frozen bits and the plurality of shaped bits into a plurality of polar code sub-core outputs, wherein each polar code sub-core output is associated with a corresponding bit level among the plurality of bit levels; A component for applying a set partitioning to the Gray label transformation to the multiple polar code sub-kernel outputs to generate multiple transformed polar code sub-kernel outputs corresponding to the polar decoded codewords; and A component used to transmit the polarized decoded codeword.

22. The apparatus of claim 21, wherein the component for applying the set partitioning to the Gray label transformation comprises: A component for applying a first XOR operation to a second polar code kernel output among the plurality of polar code kernel outputs using a first polar code sub-kernel output associated with the first bit level, the second polar code kernel output being associated with a second bit level among the plurality of bit levels; and A component for applying a second XOR operation to the third polar code sub-core output and the second polar code sub-core output among the plurality of polar code sub-core outputs, wherein the third polar code sub-core output is associated with a third bit level among the plurality of bit levels, and the third bit level includes a lower significant bit than the second bit level.

23. The apparatus of claim 21, wherein the component for placing the plurality of shaping positions comprises: A component used to identify the payload size of the plurality of shaped bits based on average conditional entropy; and The component used to construct the plurality of integer bits from the output of the plurality of transformed polar codec kernels using density evolution or Gaussian approximation.

24. The apparatus of claim 23, wherein the component for constructing the plurality of shaping positions further comprises: A component for placing the plurality of information bits on the information bit sub-channel of the plurality of sub-channels and placing the plurality of frozen bits on the frozen bit sub-channel of the plurality of sub-channels, wherein the selected sub-channel is empty; A component used to encode the plurality of information bits and the plurality of frozen bits to generate a plurality of initial polar code sub-kernel outputs; A component for applying the set partitioning to the Gray label transformation to the multiple initial polarization code sub-kernel outputs to obtain multiple Gray label sub-kernel outputs that together form the codewords after initial polarization decoding; A component for calculating a power-saving function based on the sub-kernel output after the multiple Gray tags; and A component for performing polarization decoding on the codeword after initial polarization decoding using the power-saving function to obtain the plurality of integer bits.

25. The apparatus of claim 24, further comprising: A component for applying a corresponding interleaving operation to each of the plurality of initial polar code subkernel outputs or each of the plurality of Gray-marked subkernel outputs to generate a corresponding interleaved polar code subkernel output. The power saving function is calculated based on the corresponding interleaved polar code sub-kernel output.

26. The apparatus of claim 21, further comprising: A component for applying a corresponding interleaving operation to each of the plurality of polar code sub-kernel outputs to produce a corresponding interleaved polar code sub-kernel output. The set partitioning to Gray label transformation is applied to the corresponding interleaved polar code subkernel output.

27. The apparatus of claim 21, further comprising: A component for applying a corresponding interleaving operation to each of the plurality of transformed polar codec kernel outputs to produce corresponding interleaved polar codec kernel outputs that together form the polar decoded codeword.

28. The apparatus of claim 21, further comprising: A component for mapping the corresponding bit of each of the multiple transformed polar code sub-kernel outputs to multiple symbols.

29. A non-transitory computer-readable medium storing instructions executable by one or more processors of a wireless communication device to: Assign multiple information bits and multiple frozen bits to multiple sub-channels associated with multiple bit levels; Multiple integer bits are placed on a selected sub-channel among the multiple sub-channels, and the selected sub-channel is associated with the first bit level among the multiple bit levels, where the first bit level is the sign bit level; The plurality of information bits, the plurality of frozen bits, and the plurality of integer bits are encoded into a plurality of polar code sub-kernel outputs, and each polar code sub-kernel output is associated with a corresponding bit level among the plurality of bit levels; The set of polar code sub-kernel outputs is partitioned into Gray label transforms to generate multiple transformed polar code sub-kernel outputs corresponding to the codewords after polar decoding; as well as Send the codeword after polarization decoding.

30. The non-transitory computer-readable medium of claim 29, further comprising instructions executable by the one or more processors of the wireless communication device to perform the following operations: A first XOR operation is applied to the output of a second polar code sub-kernel among the plurality of polar code sub-kernel outputs using the first polar code sub-kernel output associated with the first bit level, the second polar code sub-kernel output being associated with a second bit level among the plurality of bit levels; and A second XOR operation is applied to the third polar code sub-core output among the plurality of polar code sub-core outputs and the second polar code sub-core output. The third polar code sub-core output is associated with the third bit level among the plurality of bit levels. The third bit level includes a lower significant bit than the second bit level.

Images