Devices configured for polar encoding and decoding, methods and computer-readable memory.

Abstract

Aspects of the present description refer to wireless communication systems configured to provide techniques for polar encoding of control information in conjunction with combined cyclic redundancy check (CRC) information. The combined CRC information may include a number of CRC bits selected to jointly decode and verify the control information to reduce CRC overhead.

Description

1 / 77 Devices configured for polar encoding and decoding, methods and computer-readable memory.

[01] This application claims priority and benefit of patent application PCT / CN2016 / 110088 filed with the China Patent Office on December 15, 2016, the entire content of which is incorporated herein by reference as if presented in its entirety below for all applicable purposes. TECHNICAL FIELD

[02] The technology discussed below refers generally to wireless communication systems and, more particularly, to a control channel design using polar codes. Modalities may provide polar coding control information techniques including combined cyclic redundancy check (CRC) information, where the combined CRC information includes a number of CRC bits selected to jointly decode and verify the control information in order to reduce CRC overhead. INTRODUCTION

[03] Block codes, or error-correcting codes, are frequently used to provide reliable transmission of digital messages over noisy channels. In a typical block code, an information message or sequence is divided into blocks, and an encoder in the transmission device then mathematically adds redundancy to the information message. Exploiting this redundancy in the encoded information message is key to reliability. Petition 870260025938, dated 03 / 19 / 2026, page 16 / 23 2 / 77 message, allowing for the correction of any bit errors that may occur due to noise. In other words, a decoder in the receiving device can take advantage of redundancy to safely recover the information message even if bit errors may occur, in part, due to the addition of noise to the channel.

[004] Many examples of block codes correcting such an error are known to those generally skilled in the art, including Hamming codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, turbo codes, and low-density parity check (LDPC) codes, among others. Many existing wireless communication networks utilize such block codes, such as 3GPP LTE networks, which use turbo codes, and IEEE 802.11n Wi-Fi networks, which use LDPC codes. However, for future networks, a new category of block codes, called polar codes, presents a potential opportunity for reliable and efficient information transfer with better performance compared to turbo codes and LDPC codes.

[005] While research into the implementation of polar codes continues to rapidly advance their capabilities and potential, further improvements are desired, particularly for the potential deployment of future wireless communication networks beyond LTE. A brief summary of some examples.

[006] The following is a simplified summary of one or more aspects of this disclosure in order to provide a basic understanding of such aspects. Petition 870190050150, dated 05 / 29 / 2019, p. 6 / 111 3 / 77 This summary is not a comprehensive overview of all anticipated disclosure features, and is not intended to identify key or critical elements of all aspects of disclosure or to delineate the scope of any or all aspects of disclosure. Its sole purpose is to introduce some concepts from one or more aspects of disclosure in a simplified manner as a prelude to the more detailed description that is presented later.

[007] Several aspects of the disclosure provide polar encoding control information in conjunction with combined cyclic redundancy check (CRC) information in a wireless transmission. The combined CRC information may include a number of CRC bits selected to jointly decode and verify the control information in order to reduce CRC overhead.

[008] In one aspect of the invention, a wireless communication method is provided. The method includes generating a block of information, including control information for a programmed entity, by selecting a total number of combined cyclic redundancy check (CRC) bits based on at least one list size used in the successive cancellation list (SCL) decoding in the programmed entity, and generating CRC information for the block of information, wherein the CRC information includes the total number of combined CRC bits. The method further includes encoding the block of information, including the CRC information, using polar coding to generate a polar code block, and transmitting the polar code block to the programmed entity via a wireless air interface.

[009] Another aspect of disclosure provides a Petition 870190050150, dated 05 / 29 / 2019, p. 7 / 111 4 / 77 Device configured for polar encoding. The device includes a transceiver, a memory, and a processor coupled in communication with the transceiver and the memory. The processor is configured to generate an information block, including control information for a programmed entity, select a total number of combined cyclic redundancy check (CRC) bits based on at least one list size used in successive cancellation list (SCL) decoding in the programmed entity, and generate CRC information for the information block, wherein the CRC information includes the total number of combined CRC bits. The processor is further configured to encode the information block, including the CRC information, using polar encoding to generate a polar code block, and transmit the polar code block to the programmed entity via a wireless air interface through the transceiver.

[0010] Examples of additional aspects of the disclosure follow. In some aspects of the present disclosure, the total number of combined CRC bits is selected to be equal to a sum of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size. In some aspects of the disclosure, the second number of CRC-assisted SCL bits is selected to be equal to a binary logarithm of the list size.

[0011] In some examples, the second number Petition 870190050150, dated 05 / 29 / 2019, page 8 / 111 5 / 77 of the CRC-assisted SCL bits includes three bits when the list size is equal to eight. In some examples, the second CRC-assisted SCL bits includes five bits when the list size is equal to thirty-two. In some examples, the first number of the integrity check bits includes sixteen bits.

[0012] In some aspects of the disclosure, the information block includes a plurality of original bit locations and the polar code block includes a plurality of encoded bit locations, wherein each of the plurality of encoded bit locations corresponds to one of a plurality of subchannels. In some aspects of the present disclosure, a reliability metric for each of the original bit locations can be determined to produce a plurality of reliability metrics. The plurality of subchannels can then be ranked based on the plurality of reliability metrics, in order from highest reliability metrics to lowest reliability metrics, and a portion of the plurality of subchannels having the highest reliability metrics can be allocated to CRC information.In some aspects of this disclosure, a portion of the plurality of subchannels distributed among the plurality of subchannels may be allocated to CRC information.

[0013] In some aspects of disclosure, an additional number of zero bits can be added to the control information to produce a first polynomial, where the additional number of zero bits is equal to the total number of CRC bits combined. The first polynomial can then be divided by a generator polynomial to produce Petition 870190050150, dated 05 / 29 / 2019, p. 9 / 111 6 / 77 a remaining polynomial including the total number of combined CRC bits, the combined CRC bits can be scrambled with an identifier associated with the entity programmed to produce the CRC information, and the CRC information can be appended to the control information in the information block.

[0014] In another aspect of the disclosure, a wireless communication method operable on a programmed entity is provided. The method includes receiving a polar code block including control information for the programmed entity and cyclic redundancy checking (CRC), including a total number of combined CRC bits selected based on at least one list size used in successive cancellation list (SCL) decoding on the programmed entity. The method further includes decoding the polar code block using SCL decoding and the CRC information to produce an information block, including the control information and the CRC information, and verifying the integrity of the control information using the CRC information.

[0015] Another aspect of the disclosure provides an apparatus configured for polar decoding. The apparatus includes a processor, a memory communicatively coupled to the processor, and a transceiver communicatively coupled to the processor. The processor is configured to receive a block of polar code including control information for the programmed entity and cyclic redundancy check (CRC), including a total number of combined CRC bits selected based on at least one list size used in list decoding. Petition 870190050150, dated 05 / 29 / 2019, page 10 / 111 7 / 77 Successive Cancellation (SCL) in the device. The processor is additionally configured to decode the polar code block using SCL decoding and CRC information to produce an information block comprising control information and CRC information, and to verify the integrity of the control information using the CRC information.

[0016] Examples of additional aspects of the disclosure follow. In some aspects of the present disclosure, the total number of combined CRC bits is selected to be equal to a sum of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size. In some aspects of the disclosure, the second number of CRC-assisted SCL bits is selected to be equal to a binary logarithm of the list size.

[0017] In some examples, the second number of CRC-assisted SCL bits includes three bits when the list size is equal to eight. In some examples, the second number of CRC-assisted SCL bits includes five bits when the list size is equal to thirty-two. In some examples, the first number of integrity check bits includes sixteen bits.

[0018] In some aspects of disclosure, the information block includes a plurality of original bit locations and the polar code block includes a plurality of encoded bit locations, where each of the plurality of encoded bit locations Petition 870190050150, dated 05 / 29 / 2019, p. 11 / 111 8 / 77 corresponds to one of a plurality of subchannels. In some aspects of this disclosure, CRC information is received within a portion of the plurality of subchannels having higher reliability metrics.

[0019] In some aspects of the invention, the CRC information can be unscrambled using an identifier associated with the programmed entity to produce the combined CRC bits, the information block, including the control information and the combined CRC bits, can then be divided by a generator polynomial to produce a remainder, and if the remainder is equal to zero, the control information can be verified as correctly received.

[0020] In some aspects of disclosure, the polar code block can be decoded to produce a plurality of information block candidates, wherein the number of the plurality of information block candidates is equal to the list size. The CRC information can then be used to select one of the plurality of information block candidates as the information block.

[0021] These and other aspects of the invention will become more fully understood after a review of the following detailed description, which follows. Other aspects, features and embodiments of the present invention will become apparent to those skilled in the art after review of the following description of exemplary embodiments specific to the present invention in conjunction with the accompanying figures. While the features of the present invention can be discussed Petition 870190050150, dated 05 / 29 / 2019, p. 12 / 111 9 / 77 with respect to certain embodiments and figures below, all embodiments of the present invention may include one or more of the advantageous features discussed herein. In other words, while one or more embodiments may be discussed as having certain advantageous features, one or more of such features may also be utilized in accordance with the various embodiments of the invention discussed herein. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 is a conceptual diagram that illustrates an example of a radio access network.

[0023] Figure 2 is a conceptual block diagram that illustrates an example of a programming entity communicating with one or more programmed entities according to some modalities.

[0024] Figure 3 is a schematic illustration of the resource structure for a radio access network showing time, frequency and space dimensions.

[0025] Figure 4 is a schematic illustration of the generation of a control information transmission according to the previous technique.

[0026] Figure 5 is a schematic illustration of a polar encoding information block.

[0027] Figure 6 is a schematic illustration of the generation of a control information transmission using polar coding.

[0028] Figure 7 is a schematic illustration of the generation of a control information transmission using polar coding and reduced cyclic redundancy check (CRC), according to some Petition 870190050150, dated 05 / 29 / 2019, page 13 / 111 10 / 77 aspects of disclosure.

[0029] Figure 8 is a block diagram that illustrates an example of a hardware implementation for a programming entity device employing a processing system.

[0030] Figure 9 is a block diagram that illustrates an example of a hardware implementation for a programmed entity device using a processing system.

[0031] Figure 10 is a flowchart that illustrates an exemplary process for polar coding of control information with a combined CRC according to some aspects of disclosure.

[0032] Figure 11 is a flowchart illustrating another exemplary process for polar coding of control information with a combined CRC according to some aspects of disclosure.

[0033] Figure 12 is a flowchart illustrating another exemplary process for polar coding of control information with a combined CRC according to some aspects of disclosure.

[0034] Figure 13 is a flowchart illustrating another exemplary process for polar coding of control information with a combined CRC according to some aspects of disclosure.

[0035] Figure 14 is a flowchart that illustrates an exemplary process for the polar reception and decoding of a transmission that includes control information and a combined CRC, according to some aspects of the broadcast.

[0036] Figure 15 is a flowchart illustrating Petition 870190050150, dated 05 / 29 / 2019, page 14 / 111 11 / 77 another exemplary process for the polar reception and decoding of a transmission that includes control information and a combined CRC, according to some aspects of the disclosure.

[0037] Figure 16 is a flowchart illustrating another exemplary process for the polar reception and decoding of a transmission that includes control information and a combined CRC, according to some aspects of the disclosure. DETAILED DESCRIPTION

[0038] The detailed description presented below in conjunction with the accompanying drawings is intended to be a description of various configurations and is not intended to represent the only configurations in which the concepts described herein can be practiced. The detailed description includes specific details for the purpose of providing a complete understanding of various concepts. However, it will be evident to those skilled in the art that these concepts can be practiced without these specific details. In some cases, well-known structures and components are shown in block diagram form in order to avoid obscuring such concepts. RADIO ACCESS NETWORK

[0039] The various concepts presented throughout this publication can be implemented through a wide variety of telecommunications systems, network architectures, and communication standards. Referring now to Figure 1, as an illustrative example, without limitation, a schematic illustration of a 100 radio access network is provided. The 100 radio access network can be Petition 870190050150, dated 05 / 29 / 2019, page 15 / 111 12 / 77 a next-generation access network (e.g., fifth generation (5G)) or a legacy access network (e.g., 3G or 4G). Furthermore, one or more nodes in the 100 radio access network may be next-generation nodes or legacy nodes.

[0040] As used herein, the term legacy access network refers to a network employing third-generation (3G) wireless communication technology based on a set of standards that conform to the International Mobile Telecommunications-2000 (IMT-2000) specification or fourth-generation (4G) wireless communication technology based on a set of standards that conform to the International Advanced Mobile Telecommunications (ITU-Advanced) specification. For example, some of the standards promulgated by the 3rd Generation Partnership Project (3GPP) and the 3rd Generation Partnership Project 2 (3GPP2) may comply with IMT2000 and / or ITU-Advanced. Examples of such legacy standards defined by the 3rd Generation Partnership Project (3GPP) include, but are not limited to, Long Term Evolution (LTE), LTE-Advanced, Evolved Packet System (EPS), and Universal System for Mobile Telecommunications (UMTS).Additional examples of various radio access technologies based on one or more of the 3GPP standards listed above include, but are not limited to, Universal Terrestrial Radio Access (UTRA), Universal Terrestrial Radio Access Evolved (EUTRA), General Packet Radio Service (GPRS), and Enhanced Data Rates for GSM Evolution (EDGE). Examples of such legacy standards defined by the 3rd Generation Partnership Project 2 (3GPP2) include, but are not limited to, CDMA2000 and Ultra Mobile Wideband (UMB). Petition 870190050150, dated 05 / 29 / 2019, page 16 / 111 13 / 77 Other examples of standards that employ 3G / 4G wireless communication technology include the IEEE 802 (WiMAX) standard and other suitable standards.

[0041] As still used herein, the term next-generation access network generally refers to a network employing continuously evolving wireless communication technologies. This may include, for example, a fifth-generation (5G) wireless communication technology based on a set of standards. The standards may comply with the guidelines set out in the 5G White Paper published by The Next Generation Mobile Networks (NGMN) Alliance on February 17, 2015. For example, standards that may be defined by 3GPP followed by LTE-Advanced or by 3GPP2 followed by CDMA2000 may comply with the NGMN Alliance 5G White Paper. Standards may also include pre-3GPP efforts specified by the Verizon Technical Forum (www.vstgf) and Korea Telecom SIG (www.Kt5g.org).

[0042] The geographic region covered by the 100 radio access network can be divided into a number of cellular regions (cells) that can be uniquely identified by a user equipment (UE) based on the radio-broadcast identification along a geographic line from an access point or base station. Figure 1 illustrates macrocells 102, 104, and 106, and a small cell 108, each of which may include one or more sectors. A sector is a sub-area of ​​a cell. All sectors within a cell are served by the same base station. A radiolink within a sector can be identified by a unique logical identification belonging to that sector. In a cell that is divided into sectors, the various sectors within Petition 870190050150, dated 05 / 29 / 2019, page 17 / 111 14 / 77 of a cell can be formed by groups of antennas, with each antenna responsible for communication with UEs in a portion of the cell.

[0043] In general, a base station (BS) serves each cell. Broadly speaking, a base station is a network element in a radio access network responsible for radio transmission and reception in one or more cells to or from a UE. The BS may also be referred to by those skilled in the art as a base transceiver station (BTS), a base radio station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), an access point (AP), a B Node (NB), an eNB Node (eNB), a GNob, or some other appropriate terminology.

[0044] In Figure 1, two high-power base stations 110 and 112 are shown in cells 102 and 104, and a third high-power base station 114 is shown controlling a remote radio head (RRH) 116 in cell 106. That is, a base station may have an integrated antenna or may be connected to an antenna or RRH by power cables. In the illustrated example, cells 102, 104, and 106 may be referred to as macrocells, as the high-power base stations 110, 112, and 114 supporting cells have a large size. Additionally, a low-power base station 118 is shown in the small cell 108 (e.g., a microcell, picocell, femtocell, domestic base station, domestic Node B, eDomestic Node B, etc.), which may overlap with one or more macrocells. In this example, cell 108 can be referred to as a small cell, just like the low-power base station 118. Petition 870190050150, dated 05 / 29 / 2019, page 18 / 111 15 / 77 supports a cell having a relatively small size. Cell sizing can be done according to the system design as well as component constraints. It should be understood that the 100 radio access network can include any number of wireless base stations and cells. Furthermore, a relay node can be deployed to extend the size or coverage area of ​​a given cell. Base stations 110, 112, 114, and 118 provide wireless access points for a core network to any number of mobile devices.

[0045] Figure 1 also includes a quadcopter or drone 120, which can be configured to function as a base station. That is, in some examples, a cell may not necessarily be stationary, and the geographic area of ​​the cell may move according to the location of a cellular base station, such as the quadcopter 120.

[0046] In general, base stations may include a return transport channel interface for communication with a return transport channel portion of the network. The return transport channel may provide a link between a base station and a core network and, in some examples, the return transport channel may provide interconnection between the respective base stations. The core network is a part of a wireless communication system that is generally independent of the radio access technology used in the radio access network. Various types of return transport channel interfaces may be employed, such as a direct physical connection, a virtual network, or similar, using any network of Petition 870190050150, dated 05 / 29 / 2019, page 19 / 111 16 / 77 Suitable transport. Some base stations can be configured as integrated access and return transport channel (IAB) nodes, where wireless spectrum can be used for both access links (i.e., wireless links with UEs) and return transport channel links. This scheme is often referred to as wireless self-return transport channel. Using wireless self-return transport channel, instead of requiring each new base station deployment to be equipped with its own wired return transport channel connection, the wireless spectrum used for communication between the base station and the UE can be leveraged for return transport channel communication, allowing for quick and easy deployment of highly dense small cell networks.

[0047] The 100 radio access network is illustrated supporting wireless communication for various mobile devices. A mobile device is commonly referred to as a user equipment (UE) in standards and specifications promulgated by the 3rd Generation Partnership Project (3GPP), but may also be referred to by those skilled in the art as a mobile station (MS), a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a wireless communication device, a remote device, a mobile subscriber station, an access terminal (AT), a mobile terminal, a wireless terminal, a remote terminal, a telephone handset, a terminal, a user agent, a mobile client, a client, or some other suitable terminology. The UE may Petition 870190050150, dated 05 / 29 / 2019, page 20 / 111 17 / 77 is a device that provides a user with access to network services.

[0048] Within the present document, a “mobile” device does not necessarily need to have the ability to move, and may be stationary. The term mobile device or mobile appliance refers generically to a diverse set of devices and technologies. For example, some non-limiting examples of a mobile device include a mobile phone, a cell phone (cellular phone), a smartphone, a Session Initiation Protocol (SIP) phone, a laptop, a personal computer (PC), a notebook, a netbook, a smartbook, a tablet, a personal digital assistant (PDA), and a wide range of embedded systems, for example, corresponding to an “Internet of Things” (IoT).A mobile device may additionally be a motor vehicle or other means of transport, a remote sensor or actuator, a robot or robotic device, a satellite radio, a global positioning system (GPS) device, an object tracking device, a drone, a multicopter, a quadcopter, a remote control device, a consumer and / or wearable device such as eyeglasses, a wearable camera, a virtual reality device, a smartwatch, a health or fitness tracker, a digital audio player (e.g., MP3), a camera, a game console, etc. A mobile device may additionally be a digital home or smart home device, such as a home audio system, a video and / or multimedia device, an appliance, a vending machine, smart lighting, etc. Petition 870190050150, dated 05 / 29 / 2019, page 21 / 111 18 / 77 Home security system, a smart meter, etc. A mobile device can additionally be a smart energy device, a security device, a solar panel or solar array, a municipal infrastructure device that controls electricity (e.g., a smart grid), lighting, water, etc.; industrial automation and enterprise device; logistics controller; agricultural equipment; military defense equipment, vehicles, aircraft, ships, and weaponry, etc. Additionally, a mobile device can provide connected medical support or telemedicine, i.e., remote healthcare.Telehealth devices may include telehealth monitoring devices and telehealth administration devices, whose communication may receive preferential treatment or prioritized access to other types of information, for example, in terms of prioritized access for transporting critical user data traffic and / or relevant QoS for transporting critical service user data traffic.

[0049] Within the 100 radio access network, cells may include UEs that may be in communication with one or more sectors of each cell. For example, UEs 122 and 124 may be in communication with base station 110; UEs 126 and 128 may be in communication with base station 112; UEs 130 and 132 may be in communication with base station 114 via RRH 116; UE 134 may be in communication with low-power base station 118, and UE 136 may be in communication with cellular base station 120. Here, each base station 110, 112, 114, 118, and 120 may Petition 870190050150, dated 05 / 29 / 2019, page 22 / 111 19 / 77 should be configured to provide an access point to a core network (not shown) for all UEs in their respective cells.

[0050] In another example, a mobile network node (e.g., quadcopter 120) can be configured to function as a UE. For example, quadcopter 120 can operate within cell 102 by communicating with base station 110. In some aspects of the broadcast, two or more UEs (e.g., UEs 126 and 128) can communicate with each other using point-to-point (P2P) or side-link signals 127 without relaying that communication through a base station (e.g., base station 112).

[0051] Unicast or broadcast transmission of control information and / or user data traffic from a base station (e.g., base station 110) to one or more UEs (e.g., UEs 122 and 124) may be referred to as downlink (DL) transmission, while transmissions of control information and / or user data traffic originating from a UE (e.g., UE 122) may be referred to as uplink (UL) transmissions. Furthermore, uplink and / or downlink control information and / or traffic information may be temporally divided into frames, subframes, partitions, mini-partitions, and / or symbols. As used herein, a symbol may refer to a unit of time that, in an orthogonal frequency-division multiplexed (OFDM) waveform, carries one feature element (RE) per subcarrier. A partition may carry 7 or 14 OFDM symbols. A mini-partition may carry fewer than 7. Petition 870190050150, dated 05 / 29 / 2019, p. 23 / 111 20 / 77 OFDM symbols or fewer than 14 OFDM symbols. A subframe can refer to a duration of 1 ms. Multiple subframes or partitions can be grouped together to form a single frame or radio frame. Of course, these definitions are not necessary, and any suitable scheme for organizing waveforms can be used, and multiple time divisions of the waveform can have any suitable duration.

[0052] The air interface in the 100 radio access network may utilize one or more multiplexing and multiple access algorithms to enable simultaneous communication of multiple devices. For example, multiple access for uplink (UL) or reverse link transmissions from UEs 122 and 124 to base station 110 may be provided using time-division multiple access (TDMA), code-division multiple access (CDMA), frequency-division multiple access (FDMA), orthogonal frequency-division multiple access (OFDMA), code-sparse multiple access (SCMA), single-carrier frequency-division multiple access (FDMA-SC), resource-spreading multiple access (RSMA), or other suitable multiple access schemes.Additionally, multiplexing downlink (DL) or direct link transmissions from base station 110 to UEs 122 and 124 can be provided using time-division multiplexing (TDM), code-division multiplexing (CDM), frequency-division multiplexing (FDM), orthogonal frequency-division multiplexing (OFDM), code-sparse multiplexing (SCMA), single-carrier frequency-division multiplexing (FDMA-SC), or... Petition 870190050150, dated 05 / 29 / 2019, page 24 / 111 21 / 77 other suitable multiplexing schemes.

[0053] In addition, the air interface in the 100 radio access network can use one or more duplex algorithms. Duplex refers to a point-to-point communication link where both endpoints can communicate with each other in both directions. Full duplex means that both endpoints can communicate simultaneously with each other. Half duplex means that only one endpoint can send information to the other at the same time. In a wireless link, a full duplex channel generally relies on physical isolation of a transmitter and receiver, and appropriate interference cancellation technologies. Full duplex emulation is often implemented for wireless links, using Frequency Division Duplex (FDD) or Time Division Duplex (TDD). In FDD, transmissions in different directions operate at different carrier frequencies.In TDD, transmissions in different directions over a given channel are separated from each other using time-division multiplexing. That is, at certain times the channel is dedicated to transmissions in one direction, while at other times the channel is dedicated to transmissions in the other direction, where the direction can change very quickly, for example, several times per subframe.

[0054] In the 100 radio access network, the ability of an UE to communicate while in motion, regardless of its location, is referred to as mobility. The various physical channels between the UE and the radio access network are generally established, maintained, and released under the control of a management entity. Petition 870190050150, dated 05 / 29 / 2019, page 25 / 111 22 / 77 Mobility (MME). In various aspects of dissemination, a 100 radio access network can utilize DL-based mobility or UL-based mobility to enable mobility and handovers (i.e., the transfer of a UE connection from one radio channel to another). In a network configured for DL-based mobility, during a call with a scheduling entity, or at any other time, the UE can monitor various signal parameters from its service cell, as well as various parameters from neighboring cells. Depending on the quality of these parameters, the UE can maintain communication with one or more of the neighboring cells. During this time, if the UE moves from one cell to another, or if the signal quality from a neighboring cell exceeds that of the service cell for a given period of time, the UE can perform a handoff or handover from the service cell to the neighboring (target) cell.For example, UE 124 can move from the geographic area corresponding to its service cell 102 to the geographic area corresponding to a neighboring cell 106. When the signal strength or quality of the neighboring cell 106 exceeds that of its service cell 102 for a given amount of time, UE 124 can transmit a report message to its service base station 110 indicating this condition. In response, UE 124 can receive a handover command, and UE can submit to cell 106.

[0055] In a network configured for UL-based mobility, UL reference signals from each UE can be used by the network to select a service cell for each UE. In some examples, the stations Petition 870190050150, dated 05 / 29 / 2019, page 26 / 111 Base stations 110, 112, and 114 / 116 (UEs 23 / 77) can broadcast unified synchronization signals (e.g., unified Primary Synchronization Signals (PSS), unified Secondary Synchronization Signals (SSSs), and unified Physical Broadcast Channels (PBCH)). UEs 122, 124, 126, 128, 130, and 132 can receive the unified synchronization signals, derive the carrier frequency and subframe timing from the synchronization signals, and in response to the timing derivation, transmit an uplink or reference pilot signal. The uplink pilot signal transmitted by a UE (e.g., UE 124) can be simultaneously received by two or more cells (e.g., base stations 110 and 114 / 116) within the 100 radio access network. Each of the cells can measure a pilot signal strength, and the access network (e.g., one or more of the base stations 110 and 114 / 116 and / or a central node within the core network) can determine a server cell for UE 124.As UE 124 travels through the 100 radio access network, the network can continue to monitor the uplink pilot signal transmitted by UE 124. When the signal strength or quality of the pilot signal measured by a neighboring cell exceeds the signal strength or quality of the pilot signal measured by the serving cell, the 100 network can transfer UE 124 from the serving cell to the neighboring cell, with or without informing UE 124.

[0056] Although the synchronization signal transmitted by base stations 110, 112, 114 / 116 may be unified, the synchronization signal may not identify a particular cell, but rather may Petition 870190050150, dated 05 / 29 / 2019, page 27 / 111 24 / 77 identifies a multi-cell zone operating at the same frequency and / or time. The use of zones in 5G or other next-generation communication networks enables uplink-based mobility infrastructure and improves the efficiency of both the UE and the network, as the number of mobility messages that need to be exchanged between the UE and the network can be reduced.

[0057] In various implementations, the air interface in the 100 radio access network may utilize licensed spectrum, unlicensed spectrum, or shared spectrum. Licensed spectrum provides exclusive use of a portion of the spectrum, usually by virtue of a mobile network operator purchasing a license from a government regulatory body. Unlicensed spectrum provides for shared use of a portion of the spectrum without the need for a government-granted license. While compliance with some technical rules is generally still required to access unlicensed spectrum, in general, any operator or device can have access. Shared spectrum may fall between licensed and unlicensed spectrum, in which technical rules or limitations may be required to access the spectrum, but the spectrum may still be shared by multiple operators and / or multiple RATs.For example, the holder of a license for a portion of the licensed spectrum may provide Licensed Shared Access (LSA) to share that spectrum with other parties, for example, with conditions determined by the licensee to obtain access. Petition 870190050150, dated 05 / 29 / 2019, p. 28 / 111 25 / 77 SIGNAGE ENTITIES

[0058] In some examples, air interface access can be scheduled, where a scheduling entity (e.g., a base station) assigns resources (e.g., time-frequency resources) for communication between some or all devices and equipment within its service area or cell. Within this disclosure, as discussed further below, the scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources from one or more scheduled entities. That is, for scheduled communication, UEs or scheduled entities utilize the resources allocated by the scheduling entity.

[0059] Base stations are not the only entities that can function as a scheduling entity. That is, in some examples, the UE can function as a scheduling entity, scheduling resources for one or more scheduled entities (e.g., one or more UEs). In other examples, side-link signals can be used between UEs without necessarily relying on scheduling or control information from a base station. For example, UE 138 is illustrated communicating with UEs 140 and 142. In some examples, UE 138 is functioning as a primary side-link scheduling entity or device, and UEs 140 and 142 can function as a scheduled entity or a non-primary (e.g., secondary) side-link device. In yet another example, a UE can function as a scheduling entity in a device-to-device (D2D), point-to-point (P2P) network, Petition 870190050150, dated 05 / 29 / 2019, page 29 / 111 26 / 77 or vehicle-to-vehicle (V2V), and / or in a mesh network. In an exemplary mesh network, UEs 140 and 142 may optionally communicate directly with each other in addition to communicating with the programming entity 138.

[0060] Thus, in a wireless communication network with programmed access to time-frequency resources and having a cellular configuration, a P2P configuration, or a mesh configuration, a programming entity and one or more programmed entities can communicate using the programmed resources. Referring now to Figure 2, a block diagram illustrating a programming entity 202 and a plurality of programmed entities 204 (e.g., 204a and 204b). Here, programming entity 202 can correspond to a base station 110, 112, 114, and / or 118. In additional examples, programming entity 202 can correspond to a UE 138, the quadcopter 120, or any other suitable node in the 100 radio access network. Similarly, in several examples, programmed entity 204 can correspond to UE 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, and 142, or any other suitable node in the 100 radio access network.

[0061] As illustrated in Figure 2, programming entity 202 can transmit user data traffic 206 to one or more programmed entities 204 (user data traffic may be referred to as downlink user data traffic). According to certain aspects of this disclosure, the term downlink may refer to a point-to-multipoint transmission originating at programming entity 202. In general terms, programming entity 202 is a node or Petition 870190050150, dated 05 / 29 / 2019, page 30 / 111 27 / 77 device responsible for scheduling user data traffic on a wireless communication network, including downlink transmissions and, in some examples, uplink user data traffic 210 from one or more scheduled entities to the scheduling entity 202. Another way to describe the system may be to use the term broadcast channel multiplexing. According to aspects of this disclosure, the term uplink may refer to a point-to-point transmission originating from a scheduled entity 204. Generally, the scheduled entity 204 is a node or device that receives scheduling control information, including but not limited to scheduling grants, synchronization or timing information, or other control information from another entity on the wireless communication network, such as the scheduling entity 202.

[0062] The programming entity 202 can transmit control information 208 including one or more control channels, such as a PBCH; a PSS; an SSS; a Physical Control Format Indicator channel (PCFICH); a Physical Hybrid Automatic Repeat Request (HARQ) Indicator channel (PHICH); and / or a Physical Downlink Control channel (PDCCH), etc., to one or more programmed entities 204. The PHICH port transmits HARQ return messages, such as an acknowledgment (ACK) or negative acknowledgment (NACK). HARQ is a technique well known to those versed in the common technique, in which packet transmissions can be checked on the receiving side for accuracy, and if acknowledged, an ACK can be transmitted, while if not acknowledged, a NACK can be transmitted. Petition 870190050150, dated 05 / 29 / 2019, page 31 / 111 28 / 77 transmitted. In response to a NACK, the transmitting device can send a HARQ retransmission, which can implement combination seek, incremental redundancy, etc.

[0063] Uplink user data traffic 210 and / or downlink user data traffic 206 including one or more traffic channels, such as a physical downlink shared channel (PDSCH) or a physical uplink shared channel (PUSCH) (and, in some examples, system information blocks (SIBs)), may additionally be transmitted between the programming entity 202 and the programmed entity 204. The transmission of control information and user data traffic may be organized by subdividing a carrier, in time, into appropriate partitions.

[0064] In addition, programmed entities 204 may transmit uplink control information 212, including one or more uplink control channels to programming entity 202. Uplink control information may include a variety of packet types and categories, including pilot signals, reference signals, and information configured to enable or assist in the decoding of uplink traffic transmissions. In some examples, control information 212 may include a scheduling request (SR), i.e., a request to programming entity 202 to schedule uplink transmissions. Here, in response to the SR transmitted on control channel 212, programming entity 202 may transmit downlink control information 208 which may schedule the partition for packet transmissions of Petition 870190050150, dated 05 / 29 / 2019, page 32 / 111 29 / 77 uplink.

[0065] Uplink and downlink transmissions in general can use a suitable error-correcting block code. In a typical block code, an information message or sequence is divided into information blocks, and an encoder in the transmitting device then mathematically adds redundancy to the information message. Exploiting this redundancy in the encoded information message can improve message reliability by allowing the correction of any bit errors that may occur due to noise. Some examples of error-correcting codes include Hamming codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, turbo codes, low-density parity check (LDPC) codes, Walsh codes, and polar codes.Various implementations of programming entities 202 and programmed entities 204 may include suitable hardware and capabilities (e.g., encoder and / or decoder) to utilize any one or more of these error correction codes for wireless communication.

[0066] In some examples, programmed entities, such as a first programmed entity 204a and a second programmed entity 204b, may use side-link signals for direct D2D communication. Side-link signals may include side-link data 214 and side-link control 216. Side-link control information 216 may include a transmit signal source (STS), a direction selection signal (DSS), a destination reception signal (DRS), and a physical side-link HARQ indicator channel (PSHICH). The DSS / STS may Petition 870190050150, dated 05 / 29 / 2019, page 33 / 111 30 / 77 provide a programmed entity 204 to request a duration of time to keep a side-link channel available for a side-link signal; and the DRS may provide the programmed entity 204 to indicate the availability of the side-link channel, for example, for a requested period of time. An exchange of DSS / STS and DRS signals (e.g., handshake) may allow different programmed entities to perform side-link communications to negotiate side-link channel availability prior to communicating side-link data information (traffic) 214. The PSHICH may include HARQ confirmation information and / or a HARQ indicator from a destination device, so that the destination can confirm data received from a source device.

[0067] The channels or carriers illustrated in Figure 2 are not necessarily all the channels or carriers that can be used between a programming entity 202 and programmed entities 204, and those skilled in the art will recognize that other channels or carriers may be used in addition to those illustrated, such as other traffic, control and return channels. RESOURCE STRUCTURE

[0068] Figure 3 is a schematic illustration of the structure of resource 300 for a radio access network, such as RAN 100 illustrated in Figure 1. In some examples, this illustration may represent wireless downlink or uplink resources, as they may be allocated in an OFDM system that uses multiple input and multiple output (MIMO). In some examples, in an access network Petition 870190050150, dated 05 / 29 / 2019, page 34 / 111 31 / 77 5G NR radio, it is anticipated that OFDM can be used for DL ​​transmissions, UL (OFDMA) transmissions, and / or side-link transmissions. Furthermore, in a 5G NR radio access network, a waveform other than OFDM may be used for UL and / or side-link transmissions, such as SCFDMA or DFT-s-OFDMA. It should also be understood that the various aspects of this disclosure may be applied to an OFDMA-DFT-s or SC-FDMA waveform substantially in the same manner as described below.

[0069] MIMO is a multi-antenna technology that exploits multipath signal propagation so that the information carrying capacity of a wireless link can be multiplied by using multiple antennas at the transmitter and receiver to send multiple simultaneous streams. At the multi-antenna transmitter, a suitable pre-coding algorithm (scaling the respective amplitude and phase of the stream) is applied (in some examples, based on known channel state information). At the multi-antenna receiver, the different spatial signatures of the respective streams (and, in some examples, known channel state information) can allow these streams to be separated from each other.

[0070] Massive MIMO is a MIMO system with a very large number of antennas (e.g., larger than an 8x8 array). Furthermore, in a multi-user MIMO (MU-MIMO) system, a base station communicating with a large number of UEs can exploit multipath signal propagation to increase the overall network capacity, increasing throughput and spectral efficiency, and reducing the transmission power required. Petition 870190050150, dated 05 / 29 / 2019, page 35 / 111 32 / 77

[0071] Referring again to Figure 3, the features of a wireless channel can be characterized according to three dimensions: frequency, space, and time. The frequency and time dimensions of an OFDM system can be represented by a two-dimensional grid 302 of feature elements (REs) 304. The REs 304 are defined by the separation of frequency features into closely spaced frequency band tones or subcarriers and the separation of time features into a sequence of OFDM symbols having a given duration. In the example shown in Figure 3, each RE 304 is represented by a rectangle having the dimensions of a subcarrier (e.g., 15 kHz bandwidth) of an OFDM symbol. Thus, each RE 304 represents a modulated subcarrier, for the OFDM symbol period, by an OFDM data symbol, and contains a single complex value representative of data from a physical channel or signal.Depending on the modulation used in a particular application, each RE can represent one or more bits of information. Each OFDM symbol can be modulated using, for example, quadrature phase-shift keying (QPSK), quadrature amplitude modulation (QAM), or QAM 64. Furthermore, through the use of spatial multiplexing (e.g., with MIMO), a plurality of OFDM streams is represented by separate OFDM feature grids intersecting in the spatial dimension of Figure 3.

[0072] REs 304 can also be grouped into resource blocks (RB). Each RB can contain any suitable number of consecutive subcarriers in the frequency domain and, in some examples, depending on the length Petition 870190050150, dated 05 / 29 / 2019, page 36 / 111 33 / 77 of a cyclic prefix (CP) used in each OFDM symbol, any appropriate number of consecutive OFDM symbols in the time domain. An RB can be the smallest unit of resources that can be allocated to a UE. Thus, the more RBs programmed for a UE, and the larger the modulation scheme chosen for the air interface, the higher the data rate for the UE. For example, in LTE networks, an RB includes 12 consecutive subcarriers in the frequency domain and, for a normal cyclic prefix in each OFDM symbol, 7 consecutive OFDM symbols in the time domain, or 84 resource elements. However, it should be understood that any appropriate number of Res 304 can be grouped into a resource block.

[0073] Furthermore, any number of resource blocks (e.g., subcarrier groups and OFDM symbols) can be used within a partition or minipartition. In the illustrated example shown in Figure 3, the 300 resource structure represents a portion of a 306 partition, which could be, for example, a centered downlink partition or a centered uplink partition. A centered DL partition is referred to as a centered DL partition because a majority (or, in some examples, a substantial portion) of the partition includes DL data. A centered UL partition is referred to as a centered UL partition because a majority (or, in some examples, a substantial portion) of the partition includes UL data.

[0074] In a given DL-centered or UL-centered 306 partition, the transmission of one or more downlink control channels may be followed by the transmission of one or more downlink or uplink traffic channels, in Petition 870190050150, dated 05 / 29 / 2019, page 37 / 111 34 / 77 temporal dimension. In general, the first N OFDM symbols in a DL-centered or UL-centered partition typically correspond to a downlink control region (DL burst) of the partition that carries downlink reference control signals (control RSs), such as the cell-specific reference signal (C-RS) and channel state information reference signal (CSI-RS), which aids in downlink channel estimation, and downlink control information (Control Information), such as the Physical Control Format Indicator Channel (PCFICH), which carries the Control Format Indicator (CFI), the Hybrid Automatic Repeat Request (HARQ) Physical Indicator Channel (PHICH), and the Physical Downlink Control Channel (PDCCH), which carries Downlink Control Information (DCI).

[0075] In the non-limiting example illustrated in Figure 3, the first two symbols include downlink control reference signals and downlink control information, which may be the same as the control information 208 and / or 216 described above. Accordingly, these symbols may be referred to as a DL burst. Any suitable region of the resources in the time, frequency, and space dimensions may be used as a DL burst, not necessarily limited to the first two symbols. Furthermore, a DL burst does not necessarily have to be contiguous, and may be included in one, two, or any suitable number of separate regions.

[0076] After the DL burst, partition 306 may include a traffic region carrying signals from Petition 870190050150, dated 05 / 29 / 2019, p. 38 / 111 35 / 77 downlink or uplink traffic reference (traffic RSs) and traffic (User Data Traffic), which may be the same as the user data traffic 206, 210 and / or 214 described above. Thus, within the traffic region, REs carrying reference signals (RSs) may be interleaved with REs carrying user data traffic. For example, within the traffic region of a centered uplink partition, one of the RSs may include a sound reference signal (SRS). The SRS is transmitted from the programmed entity to the programming entity to allow the programming entity to estimate the uplink channel quality. The SRS may also be used by the programming entity for uplink timing estimation.

[0077] In addition, one or more of the RSs in the traffic region of a centered uplink partition or a centered downlink partition may include a demodulation reference signal (DMRS), which may be used to enable coherent signal demodulation at the receiver. In some examples, the DMRS may be transmitted from a programmed entity to a programming entity at the beginning of the traffic region in a centered UL partition to enable the programming entity to demodulate subsequently transmitted uplink user data traffic.

[0078] At the end of the traffic region, partition 306 may include an uplink burst (UL), which carries uplink control information. For example, the uplink burst may include a physical uplink control channel (PUCCH), a physical random access channel. Petition 870190050150, dated 05 / 29 / 2019, page 39 / 111 36 / 77 (PRACH) or other appropriate uplink control information. In the non-limiting example illustrated in Figure 3, the last symbol in the partition includes the uplink control information, which may be the same as the control information 212 and / or 216 described above. While the above description only refers to the front-end resource network (i.e., not considering the spatial dimension), it should be understood that control and traffic information for a plurality of users can be multiplexed in space, frequency, and time. GENERATION OF CONTROL INFORMATION

[0079] Figure 4 is a schematic illustration of the generation of a prior technique control information 400 transmission. Control information 400 may include common control information 410 and / or dedicated control information 412. Here, common control information 410 may include control information that can be shared among a group (e.g., a plurality) of UEs, while dedicated control information 412 may include control information intended for a single UE (e.g., one from UE 1, UE 2, ... UE N). As illustrated here, both common control information 410 for a plurality of UEs and dedicated control information 412 for a given UE may include various fields for different types of information relating to control over user data traffic and RS traffic.For example, as illustrated in Figure 4, the common control information 410 or dedicated control information of a given UE 412 may include a modulation order and coding scheme (MCS) 402, the allocation of. Petition 870190050150, dated 05 / 29 / 2019, page 40 / 111 37 / 77 resources 404 (e.g., time-frequency resources), a transmission scheme 406, an RS configuration 408, etc. Naturally, this is just an example and any appropriate set of control information 400 can be included. In some examples, each of the common control information 410 and dedicated control information 412 corresponds to the respective downlink control information (DCI) transmitted within a respective physical downlink control channel (PDCCH).

[0080] Each of the common control information 410 and dedicated control information 412 for each UE is subjected to a cyclic redundancy check (CRC) calculation block 420 to produce respective CRCs (also referred to herein as CRC information), which in some instances may be scrambled with a group identity (for common control information) or the destination UE identity (for dedicated control information). For example, a UE may have a temporary radio network identifier (RNTI) or other suitable UE-specific identifier that may be known to the programming entity to generate the CRCs. The RNTI may be used by the receiving UE to determine whether the control information is intended for that receiving UE or another UE.

[0081] The CRC is generated by processing the information bits of control information 400 as a polynomial in GF(2) (Galois field with two elements) and calculating the remainder by dividing the information bits by a generator polynomial in GF(2). A polynomial in GF(2) is a polynomial in a single variable x whose coefficients are 0 or 1. For example, the generator polynomial x¹⁶ + x¹² + x⁵ + 1 is Petition 870190050150, dated 05 / 29 / 2019, page 41 / 111 38 / 77 is widely used to calculate a 16-bit CRC. In general, to calculate an M-bit CRC, M “0” bits are added to an N-bit information message (e.g., N-bit control information) and the resulting polynomial of degree N + M - 1 is divided by a generator polynomial of degree M. This produces a remainder polynomial of degree M-1, which has M coefficients (or M bits). These M bits can then be scrambled with UE RNTI (or group RNTI) and appended to the N-bit control information bits. Typically, the CRC includes eight, sixteen, or thirty-two bits.

[0082] A receiving UE can perform an integrity check or CRC calculation considering its own RNTI, so that the CRC would only be checked for control information that includes a CRC scrambled with that UE's RNTI. Similarly, for common control information 410, a known RNTI group for the UE group and the programming entity can be used to perform an integrity check or CRC calculation. For example, the UE receiver can decode the M CRC bits using the RNTI, divide all the N + M (unscrambled) received bits by the generator polynomial, and verify that the remaining M bits are 0. If the remainder is equal to 0, the control information can be verified as correctly received. If the remainder is not equal to 0, the UE can determine that the control information was not correctly received.

[0083] As further illustrated, control information 400 (e.g., common control information 410 and / or dedicated control information 412 for a Petition 870190050150, dated 05 / 29 / 2019, page 42 / 111 39 / 77 plurality of UE) can be multiplexed for a given control information transmission. That is, as described above, a downlink transmission from a programming entity can include common control information 410 and / or dedicated control information 412 for a plurality of programmed entities. After adding the CRC to the control information 400, it is encoded by an encoder 422, and then subjected to modulation, encryption, and block mapping 424 to modulate, scramble, and / or map the encoded control information to resources on the wireless air interface (e.g., see Figure 3). In some examples, the encoder 422 may be a polar encoder for polar encoding of the control information block to produce a polar code block that can then be modulated, scrambled, and / or mapped to appropriate resources via the wireless air interface. POLAR CODES

[0084] Polar error codes are linear block error correction codes invented in 2007 by Erdal Arikan, and currently known to those skilled in the art. In general terms, channel polarization is generated with a recursive algorithm that defines polar codes. Polar codes are the first explicit codes that achieve channel capacity from symmetric binary input discrete memoryless channels. That is, polar codes achieve channel capacity (the Shannon limit) or the theoretical upper limit of the amount of error-free information that can be transmitted in a discrete memoryless channel of a given bandwidth, in the presence of noise. Petition 870190050150, dated 05 / 29 / 2019, p. 43 / 111 40 / 77

[0085] Polar codes can be considered as block codes. In a typical block code, an information message or sequence is divided into blocks of information, each block having a length of K bits. An encoder in the transmitting device (programming entity) then mathematically adds redundancy to the information message, resulting in codewords that have a length of N, where N > K. Here, the code rate R is the ratio between the message length and the block length: that is, R = K / N. With polar codes, the codeword length N is typically a power of 2 (e.g., 256, 512, 1024, etc.) because the original construction of a polarization matrix is ​​based on the Kronecker product of For example, a matrix generator (e.g., a polarization matrix) GN to generate a polar code with a block length of N can be expressed as: GN

[0086] Here, BN is the bit permutation matrix for successive cancellation (SC) decoding (functioning in some respects similarly to the interleaving function used by a turbo-encoder in networks). LTE), and is the nth Kronecker feed of F. The basic F is J. The matrix 1J is generated by raising the basic 2x2 matrix F to the nth Kronecker power. This matrix is ​​a lower triangular matrix, in which all entries above the main diagonal are equal to zero. Petition 870190050150, dated 05 / 29 / 2019, page 44 / 111 41 / 77 Because reverse bit permutation only changes the row index, the matrix of It can be analyzed instead. The matrix expressed as: it can be

[0087] encoder Polar can then generate a polar code like: block where represents the encoded bit sequence (e.g., bit sequence of the block — Cu uu 1 , iv 1' 2>—> nj is the encoding bit sequence (e.g., bit sequence of the information block).

[0088] Thus, the information bit vector u may include a number (N) of original bits, which may be polar encoded by the generator matrix GN to produce a corresponding number (N) of bits encoded in the polar codeword x. In some examples, the information bit vector u may include a number of information bits, denoted K, and a number of frozen bits, F. Frozen bits are bits that are fixed at an appropriate predetermined value, such as 0 or 1. Petition 870190050150, dated 05 / 29 / 2019, p. 45 / 111 42 / 77 Thus, the value of the frozen bits can generally be known by both the transmitting and receiving devices. The polar encoder, such as the 422 polar encoder shown in Figure 4, can determine the number of information bits and the number of frozen bits based on the encoding rate R. For example, the 422 polar encoder can select an encoding rate R from a set of one or more encoding rates and select K = NR bits in the information block to transmit information. The remaining bits (N - K) in the information block can then be fixed as frozen bits T7.

[0089] In order to determine which bits of the information block to define as frozen bits, the 422 polar encoder can further analyze the wireless channel over which the polar codeword can be sent. For example, the wireless channel for transmitting the polar codeword can be divided into a set of subchannels, such that each bit encoded in the polar codeword is transmitted over one of the subchannels. Thus, each subchannel can correspond to a location of the encoded bit, in particular, the polar codeword (e.g., subchannel-1 can correspond to the location of encoded bits containing encoded bits 1). The 422 polar encoder can identify the best K subchannels to transmit the information bits and determine the original bit locations in the information block contributing to (or corresponding to) the best K subchannels. For example, based on the generator matrix, one or more of the original bits of the information block can Petition 870190050150, dated 05 / 29 / 2019, p. 46 / 111 43 / 77 contribute to each of the encoded bits of the polar codeword. Thus, based on the generator matrix, the 422 polar encoder can determine the original K-bit locations of the information block corresponding to the best K subchannels, assign the original K-bit locations to information bits, and assign the remaining original bit locations in the information block to frozen bits.

[0090] In some examples, the 422 polar encoder can determine the best K subchannels by performing density evolution or Gaussian approximation. Density evolution is generally known to those skilled in the art, and therefore its details will not be described here. For example, the construction of polar codes based on density evolution is described in R. Mori and T. Tanaka, PERFORMANCE OF POLAR CODES WITH THE CONSTRUCTION USING DENSITY EVOLUTION, IEEE Commun. Lett., Vol. 13, no. 7, pp. 519-521, July 2009. Gaussian approximation is a less complex version of density evolution, and is also generally known to those skilled in the art. For example, the construction of polar codes based on Gaussian approximation is described in V. Miloslavskaya, SHORTENED POLAR CODES, IEEE Trans. In Information Theory, June 2015.

[0091] The 422 polar encoder can perform density evolution or Gaussian approximation to calculate a respective reliability metric, such as a bit error probability (BEP) and / or log likelihood ratio (LLR), for each of the original bit locations. For example, the LLRs of the encoded bit locations are known from the conditions of Petition 870190050150, dated 05 / 29 / 2019, page 47 / 111 44 / 77 subchannels (e.g., based on the respective SNRs of the subchannels). Thus, since one or more of the original bits of the information block can contribute to each of the encoded bits of the codeword, the LLRs of each of the original bit locations can be derived from the known LLRs of the encoded bit locations by performing density evolution or Gaussian approximation. Based on the calculated original bit location LLRs, the 422 polar encoder can classify the subchannels and select the best K subchannels (e.g., good subchannels) to transmit the information bits. The 422 polar encoder can then define the original bit locations of the information block corresponding to the best K subchannels as including information bits and the remaining original bit locations corresponding to the NK subchannels (e.g., bad subchannels) as including frozen bits.

[0092] The UE (programmed entity) may receive a noisy version of , and have to decode or, equivalently, u. Polar codes can be decoded with a simple successive cancellation (SC) decoder, which has a decoding complexity of O(N log N) and can achieve a Shannon capability when N is large. However, for short and moderate block lengths, the error rate performance of polar codes degrades significantly. Therefore, SC list decoding (SCL) can be used to improve polar error rate coding performance. With SC list decoding, instead of just maintaining one decoding path (as in simple SC decoders), Petition 870190050150, dated 05 / 29 / 2019, page 48 / 111 45 / 77 decoding paths L are maintained, where L > 1 and L represents the list size. In each decoding phase, the decoder in the UE discards the least likely (worst) decoding paths and keeps only the best L decoding paths. For example, instead of selecting a value of ui in each decoding phase, two decoding paths corresponding to any possible value of ui are created and decoding proceeds in two parallel decoding lines (2*L). To avoid exponential growth in the number of decoding paths, in each decoding phase, only the most likely L paths are retained. In the end, the decoder in the UE will have a list of IUN1' from which the most likely candidate is selected. Thus, when the decoder completes the SC list decoding algorithm, the decoder returns a single codeword.

[0093] Figure 5 is a schematic illustration of a 500-block information to be polar encoded that includes a plurality of 502 information bits and a plurality of 504 freeze bits. The 500-block information further includes 506 CRC information (e.g., CRC bits) that can be used by the programmed entity (e.g., UE) to perform CRC-assisted Successive Cancellation List Decoding (CA-SCL). In CA-SCL, CRC is used to select the output codeword from the L candidates (also referred to here as information block candidates). For example, the programming entity (transmission device), the polar encoder (e.g., the Petition 870190050150, dated 05 / 29 / 2019, p. 49 / 111 The 46 / 77 polar encoder 422 shown in Figure 4) can compute CRC 506 bits, as described above, and append the CRC 506 bits to the information bits 502. In the programmed entity (receiving device), a polar decoder can use the CRC 506 information to test each of the L candidate information blocks for errors. If more than one candidate information block passes (e.g., produces a residue of 0), the polar decoder can select the most likely candidate among those that pass as the information block.

[0094] In some examples, the polar encoder may place the 506 CRC information within the best subchannels (subchannels of superior reliability) to increase the probability that the correct output codeword will be selected at the receiver. For example, as indicated above, the polar encoder may determine the locations of k original bits in the 500 block information corresponding to the best K subchannels for both CRC and information bits. The polar encoder may then determine the best M subchannels from the best K subchannels, assign the locations of M original bits to 506 CRC bits, assign the locations of KM original bits to 502 information bits, and assign the remaining original bit locations in the information block to 504 frozen bits. In this example, instead of having K bits of information, the 500 information block may only include KM bits of 502 information.To maintain the same number of information bits, K can be increased, thus decreasing the number of frozen 504 bits, which may decrease the error correction capability of the code. Petition 870190050150, dated 05 / 29 / 2019, page 50 / 111 47 / 77 polar.

[0095] In addition to the 506 CRC information used for polar decoding (list CRC decoding), the 502 information bits may also include a CRC (e.g., an integrity CRC, not shown) to verify the integrity of the information bits. In various aspects of the disclosure, the 502 information bits may correspond to control information, and the CRC integrity may be scrambled with an RNTI (group or UE-specific) to allow the receiving UE to determine if the control information is intended for that receiving UE. POLAR CODING CONTROL INFORMATION AND INFORMATION CRC

[0096] Figure 6 is a schematic illustration of the generation of a transmission for CA-SCL decoding of polar codes that includes control information 400. As indicated above, control information 400 may include common control information 410 and / or dedicated control information 412. Many of the aspects and features of the example shown in Figure 6 are the same as those described above in relation to Figure 4. These aspects that are the same are not detailed below for brevity.

[0097] As illustrated in Figure 6, each of the common control information 410 and the dedicated control information for each UE 412 (e.g., UE 1, UE 2, ..., UE N) is subjected to two blocks of cyclic redundancy check (CRC) calculations. A first CRC calculation block 602 (integrity CRC) calculates the integrity of CRC bits, which in some examples may Petition 870190050150, dated 05 / 29 / 2019, page 51 / 111 48 / 77 can be scrambled with a group identity (for common control information 410) or the destination UE identity (for dedicated control information 412), as described above. The CRC integrity bits can be used to verify the integrity of the control information for the receiving UE and to verify that the control information is intended for that receiving UE. A second CRC calculation block 604 (list decoding CRC) calculates list decoding CRC bits, which can be used by the receiving UE in CA-SCL decoding of polar codes.

[0098] After adding the integrity CRC bits and list decoding CRC bits to the control information 400, each control information 400 (together with integrity CRC bits and list decoding CRC bits) is separately polar encoded by a respective polar encoder 606 to produce respective polar code blocks, which can then be subjected to a modulation, scrambling, and mapping block 608 to modulate, scrambling, and / or mapping the polar code blocks to features on the wireless air interface. In some examples, each integrity CRC may include sixteen bits, and each list CRC may also include sixteen bits, which may increase the overhead of the control information and decrease the error correction capability of the polar code (e.g., if the number of freeze bits is reduced to accommodate the additional information bits in the information block).

[0099] Various aspects of this disclosure Petition 870190050150, dated 05 / 29 / 2019, page 52 / 111 49 / 77 provides a transmission device (e.g., programming entity) to generate a single combined CRC for the polar-encoded control information to be used for both CA-SCL decoding of the polar-encoded control information and verification of the control information. In this way, the total number of CRC bits can be reduced, thus reducing CRC overhead. Furthermore, performance (e.g., Error Block Rate) can be improved (increased) by increasing the number of information bits and freeze bits in the polar-encoded control information block. Additionally, the encoding process can be simplified, requiring only one CRC calculation from the control information.

[00100] Figure 7 is a schematic illustration of the generation of a control information transmission 400 for CA-SCL decoding of polar codes according to some aspects of the disclosure. As illustrated in Figure 7, each of the common control information 410 and the dedicated control information 412 for each UE (e.g., UE 1, UE 2, ... UE N) is subjected to only a single combined cyclic redundancy check (CRC) calculation block 702 (combined CRC block). The combined CRC block 702 calculates a number of selected CRC bits to jointly decode and verify the integrity of the control information 400 at the receiver (programmed entity). For example, the programmed entity may use the entire number of CRC bits to perform CA-SCL decoding and may then use the same integer number of CRC bits to perform a check of Petition 870190050150, dated 05 / 29 / 2019, page 53 / 111 50 / 77 integrity in decoded control information.

[00101] In several aspects of disclosure, the number of CRC bits can be selected based on at least the list size L used by the receiving UE (programmed entity) for CA-SCL decoding of polar-encoded control information. In some examples, the number of CRC bits may be equal to the sum of a number of integrity check CRC bits (M) and a number of CA-SCL CRC bits (J), where the number of CA-SCL CRC bits (J) is selected based on the list size. For example, the number of CA-SCL CRC bits may be equal to the binary logarithm of the list size (e.g., J = log2L). Thus, the number of CA-SCL CRC bits may be reduced from the normal 16 CA-SCL CRC bits to 3 CRC bits for L = 8 and 5 CRC bits for L = 32.Therefore, if the number of CRC integrity check bits remains 16, the total number of CRC bits can be reduced from 32 CRC bits to 19 CRC bits for L = 8 and to 21 CRC bits for L = 32.

[00102] By selecting the number of CRC CA-SCL bits as the binary logarithm of the list size, the false positive rate can remain the same. Here, the false positive rate refers to the ratio between the number of incorrect CRC check passes (e.g., CRC checks that pass in error) to the total number of CRC checks. For example, the false positive rate (Pf) for an M-bit CRC added to a control information block when the decoding list is not used for the receiver can be expressed as: Pf = 2M. For a random list decoder, the words Petition 870190050150, dated 05 / 29 / 2019, p. 54 / 111 In a 51 / 77 code, where L is randomly chosen and checked against the M-bit CRC, the false positive rate can be expressed as: = 1 -- (1 -- Pff « Lx2~m. The number of effective left CRC bits for pruning (e.g., for CA-SCL implementation) then becomes: loQ2py (p) Therefore, to maintain the same false positive rate when using CRC bits for CA-SCL, an additional log2U CA-SCL CRC bits must be added to the integrity check CRC bits.

[00103] Based on the number of selected CRC bits (e.g., M + J) relative to a given N-bit control information message, the combined CRC block 7 02 can calculate an M + J bit CRC by adding M + J bits to the N-bit control information message, and the resulting polynomial of degree N + (M + J) - 1 can be divided by a generator polynomial of degree M + J. This produces a remainder polynomial of degree (M + J) - 1, which has coefficients M + J (or M + J bits). These M + J bits (e.g., the combined CRC bits) can then be mixed with UE RNTI (or RNTI group) and appended to the n-bit control information bits.

[00104] After adding the combined CRC bits to the control information, each control information 400 (along with the combined CRC bits) is separately polar encoded by the respective polar encoder 606, and then modulated, Petition 870190050150, dated 05 / 29 / 2019, p. 55 / 11152 / 77 scrambled, and / or mapped to resources on the wireless air interface, by the 608 modulation, scrambling, and mapping block. In some examples, the combined CRC information can be placed within the best subchannels for the information block, as described above. For example, as indicated above, the 606 polar encoder can determine a reliability metric (e.g., LLR) for each of the original bit locations and allocate the subchannels having the highest reliability metrics for the combined CRC information. For example, the polar encoder can identify the K original bit locations of the information block corresponding to the best K subchannels for both the CRC bits and the information bits.The 606 polar encoder can then determine the best M+J subchannels from K subchannels, assign the original M+J bit locations to the CRC bits, assign the original K-(M+J) bit locations to information bits, and assign the remaining original bit locations in the information block to freeze bits.

[00105] In other examples, the combined CRC information can be distributed among the subchannels to support early termination. For example, the 606 polar encoder can allocate CRC information to a portion of the subchannels, where the subchannel portion is distributed across the N subchannels or the best K subchannels. PROGRAMMING ENTITY

[00106] Figure 8 is a block diagram illustrating an example of a hardware implementation for an 800 programming entity employing a system of Petition 870190050150, dated 05 / 29 / 2019, p. 56 / 111 53 / 77 processing 814. For example, the programming entity 800 can be a user equipment (UE), as illustrated in any one or more of Figures 1 and / or 2. In another example, the programming entity 800 can be a base station as illustrated in any one or more of Figures 1 and / or 2.

[00107] The 800 programming entity can be implemented with an 814 processing system, which includes one or more 804 processors. Examples of 804 processors include microprocessors, microcontrollers, digital signal processors (DSPs), field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, closed logic, discrete hardware circuits, and other suitable hardware configured to perform the various functionalities described throughout this disclosure. In many examples, the 800 programming entity can be configured to perform any one or more of the functions described herein. That is, the 804 processor, as used in an 800 programming entity, can be used to implement any one or more of the processes and procedures described below.

[00108] In this example, the 814 processing system can be implemented with a bus architecture, generally represented by the 802 bus. The 802 bus can include any number of interconnect buses and bridges, depending on the specific application of the 814 processing system and the overall design limitations. The 802 bus communicatively couples to various circuits, including one or more Petition 870190050150, dated 05 / 29 / 2019, page 57 / 111 54 / 77 processors (generally represented by the 804 processor), a 805 memory, and computer-readable media (generally represented by the 806 computer-readable media). The 802 bus can also connect various other circuits such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be described further. An 808 bus interface provides an interface between the 802 bus and a 810 transceiver. The 810 transceiver provides a communication interface or means of communication with various other devices through a transmission medium. Depending on the nature of the device, a 812 user interface (e.g., keyboard, display, speaker, microphone, joystick) may also be provided.

[00109] The 804 processor is responsible for managing 802 bus processing and, in general, including the execution of software stored on the 806 computer-readable medium. The software, when executed by the 804 processor, causes the 814 processing system to perform the various functions described below for any particular device. The 806 computer-readable medium and 805 memory can also be used to store data that is manipulated by the 804 processor during software execution.

[00110] One or more 804 processors in the processing system can execute the software. Software should be interpreted broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, modules of Petition 870190050150, dated 05 / 29 / 2019, page 58 / 111 55 / 77 software, applications, application software, software packages, routines, subroutines, objects, executables, execution tasks, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.

[00111] Software may reside on an 806 computer-readable medium. An 806 computer-readable medium may be a non-transient computer-readable medium. A non-transient computer-readable medium includes, by way of example, a magnetic storage device (e.g., hard disk, floppy disk, magnetic tape), an optical disc (e.g., a compact disc (CD) or a digital versatile disc (DVD)), a smart card, a flash memory device (e.g., a card, a stick, or a master drive), random access memory (RAM), read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), registers, a removable disk, and any other medium suitable for storing software and / or instructions that can be accessed and read by a computer.The computer-readable medium may also include, by way of example, a carrier wave, a transmission line, and any other medium suitable for transmitting software and / or instructions that can be accessed and read by a computer. The computer-readable medium 806 may reside in the processing system 814, external to the processing system 814, or distributed across multiple entities, including the processing system 814. The computer-readable medium. Petition 870190050150, dated 05 / 29 / 2019, page 59 / 111 56 / 77 6. It can be incorporated into a computer program product. By way of example, a computer program product might include a computer-readable medium in packaging materials. Those skilled in the art will recognize the best way to implement the described functionality presented throughout this disclosure, depending on the particular application and the overall design constraints imposed on the overall system.

[00112] In some aspects of the disclosure, the 804 processor may include a set of circuits configured for various functions. For example, the 804 processor may include a set of control information generation circuits 840 configured for various functions, including, for example, generating an information block containing control information (e.g., common or dedicated downlink control information (DCI)) for a programmed entity. For example, the control information generation circuit 840 may be configured to implement one or more of the functions described in relation to Figures 4-7 and / or 10. The control information generation circuit 840 may operate in coordination with control information generation software 860.

[00113] The 804 processor may also include an 842 CRC generation circuitry configured for various functions, including, for example, selecting a number of CRC bits to decode and jointly verifying the integrity of the control information in the programmed entity. In some examples, the number of CRC bits is selected based on at least one list size L used in cancellation list decoding. Petition 870190050150, dated 05 / 29 / 2019, pages 60 / 111 57 / 77 successive (SCL) in the programmed entity. The 842 CRC generation circuitry can also be configured to generate combined CRC information, including the selected number of CRC bits, for the information block. For example, the 842 CRC generation circuitry can be configured to implement one or more of the functions described in relation to Figures 4-7 and / or 10. The 842 CRC generation circuitry can operate in coordination with 862 control information generation software.

[00114] The 804 processor may also include an 844 polar encoder circuit set configured for various functions, including, for example, polar encoding a block of information containing combined control and CRC information for wireless transmission. For example, the 844 polar encoder circuit set may be configured to implement one or more of the functions described below in relation to Figures 4-7 and / or 10. The 844 polar encoder circuit set may operate in coordination with the 864 polar encoding software. SCHEDULED ENTITY

[00115] Figure 9 is a conceptual diagram illustrating an example of a hardware implementation for an exemplary programmed entity 900 employing a processing system 914. According to various aspects of the disclosure, an element, or any portion of an element, or any combination of elements may be implemented with a processing system 914 that includes one or more processors 904. For example, programmed entity 900 may be a user device. Petition 870190050150, dated 05 / 29 / 2019, pp. 61 / 111 58 / 77 (EU), as illustrated in any one or more of figures 1 and / or 2.

[00116] The processing system 914 may be substantially the same as the processing system 814 illustrated in Figure 8, including a bus interface 908, a bus 902, memory 905, a processor 904, and a computer-readable medium 906. Furthermore, the programmed entity 900 may include a user interface 912 and a transceiver 910 substantially similar to those described above in Figure 8. That is, the processor 904, as used in a programmed entity 900, may be used to implement any one or more of the processes described below.

[00117] In some aspects of the disclosure, the 904 processor may include a 940 decoder circuit set configured for various functions, including, for example, polar decoding of a polar code block containing combined control and CRC information for the programmed entity received through a wireless communication interface. In some examples, the 940 decoder circuit set may use the combined CRC information to polar decode the polar code block during the implementation of a CA-SCL decoding algorithm. For example, the 940 polar decoder circuit set may be configured to implement one or more of the functions described in relation to Figures 5-7 and / or 11. The 940 decoder circuit set may operate in coordination with the 960 decoder software.

[00118] The 904 processor may also include the Petition 870190050150, dated 05 / 29 / 2019, pp. 62 / 111 59 / 77 control information verification circuit set 942 configured for various functions, including, for example, verifying the integrity of decoded control information using the same combined CRC information as used during decoding. For example, the control information verification circuit set 942 can be configured to implement one or more of the functions described in relation to Figures 4-7 and / or 11. The control information verification circuit 942 can operate in coordination with the verification program control information 962. Polar Coding with Combined CRC

[00119] Figure 10 is a flowchart illustrating an exemplary process 1000 for polar encoding of control information with a combined CRC according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, process 1000 may be performed by the programming entity 800 illustrated in Figure 8. In some examples, process 1000 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00120] In block 1002, the scheduling entity can generate an information block, including control information for a scheduled entity (for example, common or dedicated control information). By Petition 870190050150, dated 05 / 29 / 2019, pp. 63 / 111 60 / 77 For example, the control information may correspond to the control information described above and illustrated in Figures 4, 6 and / or 7. For example, the control information generation circuitry set 840 shown and described previously in connection with Figure 8 may generate the control information.

[00121] In block 1004, the programming entity can select a number of cyclic redundancy check (CRC) bits for the information block based on at least one list size L used in successive cancellation list (SCL) decoding in the programmed entity. For example, the number of CRC bits can be equal to the sum of a number of integrity check CRC bits (M) and a number of CRC-assisted SCL (CA-SCL) CRC bits (J), where the number of CA-SCL CRC bits (J) is selected based on the list size. In some examples, the number of CA-SCL CRC bits can be equal to the binary logarithm of the list size (e.g., J = log2L). In block 1006, the programming entity can generate CRC information containing the selected number of CRC bits (e.g., combined CRC bits) for the information block and appended to the combined CRC bits of the information block.Here, the CRC information can be based on control information, and additionally, based on a specific UE group or identifier (e.g., an RNTI). For example, the CRC 842 generation circuit set shown and described earlier in connection with Figure 8 can generate the combined CRC.

[00122] In block 1008, the entity of Petition 870190050150, dated 05 / 29 / 2019, pp. 64 / 111 61 / 77 programming can polarize the information block, including the combined CRC bits. For example, the 844 polar encoder circuit shown and described earlier in connection with Figure 8 can polarize the block information to produce a polar code block containing the control information and combined CRC bits. In block 1010, the programming entity can transmit the polar code block through the air interface. For example, the programming entity can use the 810 transceiver shown in Figure 8 to transmit the polar code block through the air interface.

[00123] Figure 11 is a flowchart illustrating another exemplary process 1100 for polar encoding of control information with a combined CRC according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, process 1100 may be performed by the programming entity 800 illustrated in Figure 8. In some examples, process 1100 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00124] In block 1102, the scheduling entity can generate an information block, including control information for a scheduled entity (for example, common or dedicated control information). By Petition 870190050150, dated 05 / 29 / 2019, pages 65 / 111 62 / 77 For example, the control information may correspond to the control information described above and illustrated in Figures 4, 6 and / or 7. For example, the control information generation circuitry set 840 shown and described previously in connection with Figure 8 may generate the control information.

[00125] In block 1104, the programming entity can determine a list size used by the programmed entity for SCL polar decoding. In some examples, the programmed entity can provide the list size to the programming entity during connection establishment or in response to a request by the programming entity. In other examples, the list size can be defined for the cell or network and can be transmitted from the programming entity to the programmed entity. For example, the CRC 842 generation circuit set shown and described earlier in connection with Figure 8 can determine the list size.

[00126] In block 1106, the programming entity can select a first number of integrity check bits for use by the programmed entity in verifying the integrity of the received control information. In some examples, the number of integrity check bits may include eight, sixteen, or thirty-two bits. In block 1108, the programming entity can select a second number of CRC-assisted SCL bits based on the list size. In some examples, the second number of CRC-assisted SCL bits is equal to the binary logarithm of the list size. In block 1110, the programming entity can then, Petition 870190050150, dated 05 / 29 / 2019, pp. 66 / 111 63 / 77 calculate a total number of combined CRC bits as a sum of the first number of integrity check bits and the second number of CRC-assisted SCL bits. For example, the 842 CRC generation circuit set shown and described earlier in connection with Figure 8 can determine the first number of integrity check bits, the second number of CRC-assisted SCL bits, and the total number of combined CRC bits.

[00127] In block 1112, the programming entity can generate CRC information containing the total number of combined CRC bits for the information block and append the combined CRC bits to the information block. Here, the CRC information can be based on control information, and additionally, based on a specific UE group or identifier (e.g., an RNTI). For example, the 842 CRC generation circuit set shown and described earlier in connection with Figure 8 can generate the combined CRC.

[00128] In block 1114, the programming entity can polar encode the information block, including the combined CRC bits. For example, the 844 polar encoder circuit shown and described earlier in connection with Figure 8 can polar encode the block information to produce a polar code block containing the control information and combined CRC bits. In block 1116, the programming entity can transmit the polar code block over the air interface. For example, the programming entity can use the 810 transceiver shown in Petition 870190050150, dated 05 / 29 / 2019, pp. 67 / 111 64 / 77 figure 8 to transmit the polar code block through the air interface.

[00129] Figure 12 is a flowchart illustrating another exemplary process 1200 for polar encoding of control information with a combined CRC according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, process 1200 may be performed by the programming entity 800 illustrated in Figure 8. In some examples, process 1200 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00130] In block 1202, the programming entity can generate a block of information, including control information for a programmed entity (e.g., common or dedicated control information). For example, the control information may correspond to the control information described above and illustrated in Figures 4, 6, and / or 7. For example, the control information generation circuitry set 840 shown and described earlier in connection with Figure 8 can generate the control information.

[00131] In block 1204, the programming entity can select a number of cyclic redundancy check (CRC) bits for the information block based on at least one list size L Petition 870190050150, dated 05 / 29 / 2019, pp. 68 / 111 65 / 77 used in the decoding of successive cancellation lists (SCL) in the programmed entity. For example, the number of CRC bits can be equal to the sum of a number of integrity check CRC bits (M) and a number of CRC-assisted SCL (CA-SCL) CRC bits (J), where the number of CA-SCL CRC bits (J) is selected based on the list size. In some examples, the number of CA-SCL CRC bits can be equal to the binary logarithm of the list size (e.g., J = log2L). In block 1206, the programming entity can generate CRC information containing the selected number of CRC bits (e.g., combined CRC bits) for the information block and append the combined CRC bits to the information block. Here, the CRC information can be based on the control information, and additionally, based on a specific UE group or identifier (e.g., an RNTI).For example, the CRC 842 generation circuit set shown and described earlier in connection with Figure 8 can generate the combined CRC.

[00132] In block 1208, the programming entity can determine a respective reliability metric, such as a bit error probability (BEP) and / or log likelihood ratio (LLR), for each of the original bit locations of the information block. For example, the LLRs of encoded bit locations can be known from subchannel conditions (e.g., based on the respective subchannel SNRs). Thus, provided that one or more of the original bits of the information block can contribute to each of the encoded bits of the codeword, the LLRs of each of the Petition 870190050150, dated 05 / 29 / 2019, pp. 69 / 111 66 / 77 original bit locations can be derived from the known LLRs of the encoded bit locations by performing density evolution or Gaussian approximation. Based on the calculated original bit location LLRs, in block 1210, the programming entity can rank the subchannels in order of highest reliability metrics to lowest reliability metrics. In block 1212, the programming entity can allocate the subchannels having the highest reliability metrics to the CRC information and then define the original bit locations of the information block corresponding to the highest reliability subchannels as including the CRC information.For example, the CRC 842 generation circuitry shown and described earlier in connection with Figure 8 can determine reliability metrics, classify subchannels based on reliability metrics, and allocate subchannels with the highest reliability metrics to CRC information.

[00133] In block 1214, the programming entity can polar encode the information block, including combined CRC bits. For example, the 844 polar encoder circuit shown and described earlier in connection with Figure 8 can polar encode the block information to produce a polar code block containing the control information and combined CRC bits. In block 1216, the programming entity can transmit the polar code block over the air interface. For example, the programming entity can use the 810 transceiver shown in Petition 870190050150, dated 05 / 29 / 2019, pp. 70 / 111 67 / 77 figure 8 to transmit the polar code block through the air interface.

[00134] Figure 13 is a flowchart illustrating another exemplary process 1300 for polar encoding of control information with a combined CRC according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, process 1300 may be performed by the programming entity 800 illustrated in Figure 8. In some examples, process 1300 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00135] In block 1302, the programming entity can generate a block of information, including control information for a programmed entity (e.g., common or dedicated control information). For example, the control information may correspond to the control information described above and illustrated in Figures 4, 6, and / or 7. For example, the control information generation circuitry set 840 shown and described earlier in connection with Figure 8 can generate the control information.

[00136] In block 1304, the programming entity can select a number of cyclic redundancy check (CRC) bits for the information block based on at least one list size L Petition 870190050150, dated 05 / 29 / 2019, pp. 71 / 111 68 / 77 used in the decoding of successive cancellation lists (SCL) in the programmed entity. For example, the number of CRC bits can be equal to the sum of a number of integrity check CRC bits (M) and a number of CRC-assisted SCL (CA-SCL) CRC bits (J), where the number of CA-SCL CRC bits (J) is selected based on the list size. In some examples, the number of CA-SCL CRC bits can be equal to the binary logarithm of the list size (e.g., J = log2L). For example, the 842 CRC generation circuit set shown and described earlier in connection with Figure 8 can select the combined number of CRC bits for CRC information.

[00137] In block 1306, the programming entity can add an additional number of zero bits ('0') to the control information to produce a first polynomial. In various aspects of disclosure, the additional number of '0' bits can be equal to the total number of combined CRC bits. In block 1308, the programming entity can divide the first polynomial by a generator polynomial to produce a remainder polynomial that includes the total number of combined CRC bits. In block 1310, the programming entity can scramble the combined CRC bits with an identifier associated with the programmed entity (e.g., a group identifier or a UE-specific identifier) ​​to produce CRC information. Then, in block 1312, the programming entity can append the CRC information to the control information in the information block.For example, the CRC 842 generation circuit set shown and described earlier in connection with Figure 8 can generate CRC information. Petition 870190050150, dated 05 / 29 / 2019, pp. 72 / 111 69 / 77

[00138] In block 1314, the programming entity can polar encode the information block, including the combined CRC bits. For example, the polar encoder circuit 844 shown and described earlier in connection with Figure 8 can polar encode the block information to produce a polar code block containing the control information and combined CRC bits. In block 1316, the programming entity can transmit the polar code block over the air interface. For example, the programming entity can use the transceiver 810 shown in Figure 8 to transmit the polar code block over the air interface. Polar decoding with combined CRC

[00139] Figure 14 is a flowchart illustrating an exemplary process 1400 for receiving and polar-decoding a polar code block that includes control information and a combined CRC, according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, process 1400 may be performed by the programmed entity 900 illustrated in Figure 9. In some examples, process 1400 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00140] In block 1402, the programmed entity can receive a polar code block containing information Petition 870190050150, dated 05 / 29 / 2019, pp. 73 / 111 70 / 77 control for the programmed entity together with combined CRC information. In some examples, the combined CRC information includes a number of CRC bits selected based on a list size used in successive cancellation list (SCL) decoding in the programmed entity to jointly decode and verify the control information. In block 1404, the programmed entity can polarize the polar code block. In some examples, the programmed entity can use SCL decoding and the combined CRC information to decode the polar code block. For example, the 940 polar decoder circuit set shown and described earlier in connection with Figure 9 can polarize the polar code block.

[00141] In block 1406, the programmed entity can query or verify the integrity of the decoded control information. In some examples, the programmed entity can verify the control information using the combined CRC information. For example, the control information verification circuit set 942 shown and described earlier in connection with Figure 9 can verify the integrity of the decoded control information.

[00142] Figure 15 is a flowchart illustrating another exemplary process for receiving 1500 and polar-decoding a polar code block that includes control information and a combined CRC, according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope. Petition 870190050150, dated 05 / 29 / 2019, pp. 74 / 111 71 / 77 of this disclosure, and some illustrated features may not be necessary for the execution of all modalities. In some examples, process 1500 may be performed by programmed entity 900 illustrated in figure 9. In some examples, process 1500 may be performed by any appropriate apparatus or means for performing the functions or algorithm described below.

[00143] In block 1502, the programmed entity can receive a polar code block containing control information for the programmed entity along with combined CRC information. In some examples, the combined CRC information includes a number of combined CRC bits selected based on a list size used in successive cancellation list (SCL) decoding in the programmed entity to jointly decode and verify the control information. In block 1504, the programmed entity can polarize the polar code block. In some examples, the programmed entity can use SCL decoding and the combined CRC information to decode the polar code block. For example, the 940 polar decoder circuit set shown and described earlier in connection with Figure 9 can polarize the polar code block.

[00144] In block 1506, the programmed entity can unscramble the CRC information using an identifier associated with the programmed entity (for example, a group identifier or a specific EU identifier), to produce the combined CRC bits. In block 1508, the programmed entity can split the block Petition 870190050150, dated 05 / 29 / 2019, pp. 75 / 111 72 / 77 of information, including control information and CRC bits, is combined by a generator polynomial to produce a remainder (e.g., a remainder polynomial). In block 1510, the programmed entity can determine if the remainder is equal to zero (e.g., if all bits of the remainder polynomial are zero). If the remainder is equal to zero (Y branch of block 1510), in block 1512, the programmed entity can verify that the decoded control information was correctly received. However, if the remainder is not equal to zero (N branch of block 1510), in block 1514, the programmed entity can determine that the decoded control information was not correctly received. For example, the 942 control information verification circuit set shown and described earlier in connection with Figure 9 can decode the CRC information, calculate the remainder, and verify the integrity of the decoded control information based on the remainder value.

[00145] Figure 16 is a flowchart illustrating another exemplary 1600 process for receiving and polar-decoding a polar code block that includes control information and a combined CRC, according to some aspects of the disclosure. As described below, some or all of the illustrated features may be omitted in a particular implementation within the scope of this disclosure, and some illustrated features may not be necessary for the execution of all embodiments. In some examples, the 1600 process may be performed by the programmed entity 900 illustrated in Figure 9. In some examples, the 1600 process may be performed Petition 870190050150, dated 05 / 29 / 2019, pp. 76 / 111 73 / 77 by any appropriate device or means for performing the functions or algorithm described below.

[00146] In block 1602, the programmed entity may receive a polar code block containing control information for the programmed entity along with combined CRC information. In some examples, the combined CRC information includes a number of CRC bits selected based on a list size used in successive cancellation list (SCL) decoding in the programmed entity to jointly decode and verify the control information. For example, the 910 transceiver shown and described earlier in connection with Figure 9 may receive the polar code block.

[00147] In block 1604, the programmed entity can polar decode the polar code block using SCL decoding to produce a number of information block candidates equal to the list size. In block 1606, the programmed entity can then use the combined CRC bits to select one of the information block candidates as the information block. In some examples, the programmed entity can use the combined CRC bits to test each of the information block candidates for errors. If more than one information block candidate passes (e.g., produces a remainder of 0), the programmed entity can select the most likely candidate among those that pass as the information block. For example, the 940 polar decoder circuit set shown and described earlier in connection with Figure 9 can decode from Petition 870190050150, dated 05 / 29 / 2019, pp. 77 / 111 74 / 77 forms the polar code block.

[00148] In block 1608, the programmed entity can query or verify the integrity of the decoded control information. In some examples, the programmed entity can verify the control information using the combined CRC information. For example, the control information verification circuitry set 942 shown and described earlier in connection with Figure 9 can verify the integrity of the decoded control information.

[00149] Several aspects of a wireless communications network have been presented with reference to an exemplary embodiment. As those skilled in the art will readily understand, several aspects described throughout this disclosure can be extended to other telecommunications systems, network architectures, and communication standards.

[00150] By way of example, several aspects can be implemented within other systems defined by 3GPP, such as Long-Term Evolution (LTE), Evolved Packet System (EPS), Universal System for Mobile Telecommunications (UMTS), and / or Global System for Mobile (GSM). Several aspects can also be extended to systems defined by the 3rd Generation Partnership Project 2 (3GPP2), such as CDMA2000 and / or Evolution-Optimized Data (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 current telecommunications standard, network architecture, and / or communication Petition 870190050150, dated 05 / 29 / 2019, pp. 78 / 111 The 75 / 77 standard employed will depend on the specific application and the overall design constraints imposed on the system.

[00151] Within this disclosure, the word “exemplary” is used to mean “to serve as an example, case, or illustration.” Any implementation or aspect described herein as “exemplary” should not necessarily be interpreted as preferred or advantageous in relation to other aspects of the disclosure. Similarly, the term “aspects” does not require that all aspects of the invention include the feature, advantage, or mode of operation discussed. The term “coupled” is used herein to refer to the direct or indirect coupling between two objects. For example, if object A physically touches object B, and object B touches object C, then objects A and C can still be considered coupled to each other, even if they do not directly and physically touch. For example, a first object can be coupled to a second object, even if the first object is not directly and physically touching the second object.The terms “circuit” and “circuit assembly” are widely used and are intended to include both hardware implementations of electrical devices and conductors that, when connected and configured, enable the performance of the functions described in this disclosure, without limitation as to the type of electronic circuits, as well as software implementations of information and instructions that, when executed by a processor, enable the performance of the functions described in this description.

[00152] One or more of the components, stages, features and / or functions illustrated in figures 1-16 Petition 870190050150, dated 05 / 29 / 2019, pp. 79 / 111 76 / 77 can be rearranged and / or combined into a single component, step, feature, or function, or incorporated into multiple components, steps, or functions. Additional elements, components, steps, and / or functions can also be added without departing from the new features presented here. The devices, appliances, and / or components illustrated in Figures 1-9 can be configured to perform one or more of the methods, features, or steps described here. The new algorithms described here can also be effectively implemented in software and / or incorporated into hardware.

[00153] It should be understood that the specific order or hierarchy of steps in the disclosed methods is an illustration of exemplary processes. Based on design preferences, it is understood that the order or hierarchy of steps in the specific methods may be rearranged. The tracking method claims elements present from the various steps in a sample order, and are not intended to be limited to the specific order or hierarchy presented, unless specifically stated.

[00154] The preceding 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 readily apparent to those versed in the art, and the general principles set forth herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but should be given the full scope consistent with the language of the claims, wherein Petition 870190050150, dated 05 / 29 / 2019, pp. 80 / 111 77 / 77 Reference to a singular element is not intended to mean “one and only one” unless specifically stated otherwise, but rather “one or more.” Unless specifically indicated otherwise, the term “one” refers to one or more. A phrase referring to “at least one of” a list of items refers to 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; aeb; aec; bec; and a, b, c. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure, which are known or may hereafter become known to those commonly skilled in the art, are expressly incorporated herein by reference and are intended to be encompassed by the claims. Furthermore, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is expressly stated in the claims.No element of a claim shall be construed in accordance with the provisions of 35 U.S.C. § 112(f) unless the element is expressly recited using the phrase “means to” or, in the case of a method according to the claim, the element is recited using the phrase “step to”. Petition 870190050150, dated 05 / 29 / 2019, pages 81 / 111

Claims

1 / 6 CLAIMS 1. Wireless communication method characterized in that it comprises: generating (1002) an information block (500) comprising control information (400) for a programmed entity (900); selecting (1004) a total number of cyclic redundancy check bits, CRC, combined based on at least one list size used in successive cancellation list decoding, SCL, in the programmed entity; generating (1006) CRC information (506) for the information block, the CRC information comprising the total number of combined CRC bits, wherein the CRC information is generated in a single combined CRC calculation such that the total number of combined CRC bits is used to perform SCL decoding, and the same total number of combined CRC bits is used to perform an integrity check on the decoded control information of the SCL decoding;encode (1008) the information block, including the CRC information, using polar coding to generate a polar code block, wherein a number of higher reliability subchannels of the polar code is allocated to the information block, the number of higher reliability subchannels including the CRC information and the control information, wherein the combined CRC bits are distributed throughout the control information among the number of higher reliability subchannels;and transmit (1010) the polar code block to the programmed entity via a wireless air interface, wherein selecting the number of CRC bits further comprises selecting the total number of CRC bits combined to be equal to a sum Petition 870260025938, dated 03 / 19 / 2026, page 17 / 23 2 / 6 of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size.; 2. Method according to claim 1, characterized in that selecting the number of CRC-assisted bits further comprises: selecting the second number of CRC-assisted SCL bits to be equal to a binary logarithm of the list size.

3. Method according to claim 2, characterized in that: the second number of CRC-assisted SCL bits comprises three bits when the list size is equal to eight; and the second number of CRC-assisted SCL bits comprises five bits when the list size is equal to thirty-two; wherein the first number of integrity check bits comprises sixteen bits.

4. Apparatus configured for polar encoding characterized in that it comprises: a processor (804); a memory (805) communicatively coupled to the processor; and a transceiver (810) communicatively coupled to the processor, wherein the processor is configured to: generate an information block (500) comprising control information (400) for a programmed entity (900); select a total number of cyclic redundancy check bits, CRC, combined based on at least one list size used in successive cancellation list decoding, SCL, in the programmed entity Petition 870260025938, dated 19 / 03 / 2026, page 18 / 23 3 / 6 (900);generate CRC (506) information for the information block, the CRC information comprising the total number of combined CRC bits, wherein the CRC information is generated in a single combined CRC calculation such that the total number of combined CRC bits must be used to perform SCL decoding, and the same total number of combined CRC bits must be used to perform an integrity check on the decoded control information of the SCL decoding; encode the information block, including the CRC information, using polar coding to generate a polar code block, wherein a number of higher reliability subchannels of the polar code is allocated to the information block, the number of higher reliability subchannels including the CRC information and the control information, wherein the combined CRC bits are distributed throughout the control information among the number of higher reliability subchannels;and transmit the polar code block to the programmed entity via a wireless air interface through the transceiver, wherein the processor is additionally configured to select the total number of combined CRC bits to be equal to a sum of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size.

5. Apparatus, according to claim 4, characterized in that the processor is additionally configured to: select the second number of CRC-assisted SCL bits to be equal to a binary logarithm of the list size.

6. Wireless communication method operable in a programmed entity Petition 870260025938, dated 03 / 19 / 2026, page 19 / 23 4 / 6 characterized in that it comprises: receiving (1402) a polar code block comprising control information (400) for the programmed entity and cyclic redundancy check information, CRC, (506) comprising a total number of combined CRC bits selected based on at least one list size used in successive cancellation list decoding, SCL, in the programmed entity; decode (1404) the polar code block using SCL decoding and CRC information, wherein a number of higher reliability subchannels of the polar code is allocated to the information block, the number of higher reliability subchannels including the CRC information and the control information, wherein the combined CRC bits are distributed along the control information among the number of higher reliability subchannels;and verify (1406) the integrity of the decoded control information from the SCL decoding using the same total number of combined CRC bits as the CRC information, wherein the total number of combined CRC bits is equal to a sum of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size.; 7. Method according to claim 6, characterized in that the second number of CRC-assisted SCL bits is equal to a binary logarithm of the list size.

8. Method according to claim 7, characterized in that: the second number of CRC-assisted SCL bits comprises three bits, Petition 870260025938, dated 03 / 19 / 2026, page 20 / 23 5 / 6 when the list size is equal to eight; and the second number of CRC-assisted SCL bits comprises five bits when the list size is equal to thirty-two; wherein the first number of integrity check bits comprises sixteen bits.

9. Apparatus configured for polar decoding characterized in that it comprises: a processor (904); a memory (905) communicatively coupled to the processor; and a transceiver communicatively coupled to the processor, wherein the processor is configured to: receive, by means of the transceiver (910), a block of polar code comprising control information (400) for the programmed entity and cyclic redundancy check, CRC, information (506) comprising a total number of combined CRC bits selected based on at least one list size used in successive cancellation list, SCL, decoding in the apparatus;Decode the polar code block using SCL decoding and CRC information, wherein a number of higher reliability subchannels of the polar code is allocated to the information block, the number of higher reliability subchannels including the CRC information and the control information, wherein the combined CRC bits are distributed throughout the control information among the number of higher reliability subchannels; and verify the integrity of the control information decoded from the SCL decoding using the same total number of combined CRC bits as the CRC information, wherein the total number of combined CRC bits is equal to a sum of a first number of integrity check bits and a second number of CRC-assisted SCL bits, wherein the second number of CRC-assisted SCL bits is selected based on the list size.

10. Apparatus, according to claim 9, characterized in that the second number of CRC-assisted SCL bits is equal to a binary logarithm of the list size.

11. Computer-readable memory characterized in that it comprises instructions stored therein, the instructions being executable by a computer to perform the method steps defined in any one of claims 1 to 3 or 6 to 8. Petition 870260025938, dated 03 / 19 / 2026, pp. 22 / 23

Images