Rate matching scheme for polar codes

By performing rate matching on the polar code encoded bitstream, the performance loss problem caused by rate matching schemes in existing technologies is solved, thereby improving the transmission efficiency and bandwidth utilization of wireless communication systems.

CN116805895BActive Publication Date: 2026-03-24QUALCOMM INC
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2018-04-06
Publication Date
2026-03-24

AI Technical Summary

Technical Problem

Existing rate matching schemes suffer from performance loss when using polar codes, failing to efficiently match the transmission rate of polar code-encoded bit streams in wireless communication systems.

Method used

An efficient rate matching scheme is adopted to rate match the bit stream encoded with polar codes. By comparing the master code size, control information size and number of bits, the encoded bit stream is stored and sent using a circular buffer.

Benefits of technology

It improves the transmission efficiency of polar code encoded bit streams in wireless communication systems, reduces performance loss, and achieves more efficient bandwidth utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116805895B_ABST
    Figure CN116805895B_ABST
Patent Text Reader

Abstract

Certain aspects of the present disclosure generally relate to wireless communication, and more particularly to methods and apparatus for rate matching a bitstream encoded using a polar code. An example method generally includes determining a mother code size (N) for transmitting an encoded bitstream, the determination being based at least in part on a minimum supported code rate (R min ) for transmitting the encoded bitstream, a control information size (K) of the encoded bitstream, a number (E) of encoded bits for transmission, and a maximum mother code size (N max ); encoding a bitstream using a polar code of size (N, K) and storing the encoded bitstream in a circular buffer; and performing rate matching on the stored encoded bitstream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bitstream, and the number (E) of encoded bits for transmission.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of application number 201880029513.1, filed on November 04, 2019, having the title “Rate Matching Scheme for Polar Codes”.

[0002] Cross Reference to Related Applications

[0003] This application claims priority to and the benefit of Patent Cooperation Treaty Application No. PCT / CN2017 / 083365, filed May 6, 2017, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0004] Certain aspects of the present disclosure generally relate to wireless communication, and more particularly to methods and apparatus for rate matching a bitstream encoded using a polar code. BACKGROUND

[0005] Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, and broadcasts. Typical wireless communication systems can employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power). Examples of such multiple-access technologies include Long Term Evolution (LTE) systems, Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal Frequency Division Multiple Access (OFDMA) systems, Single-Carrier Frequency Division Multiple Access (SC-FDMA) systems, and Time Division Synchronous Code Division Multiple Access (TD-SCDMA) systems.

[0006] In some examples, a wireless multiple-access communication system can include a number of base stations, each simultaneously supporting communication for multiple communication devices, otherwise known as user equipments (UEs). In LTE or LTE-A network, a set of one or more base stations can define an eNodeB (eNB). In other examples (e.g., in a next generation or 5G network), a wireless multiple access communication system can include a number of distributed units (DUs) (e.g., edge units (EUs), edge nodes (ENs), radio heads (RHs), smart radio heads (SRHs), transmit receive points (TRPs), etc.), which are in communication with a number of central units (CUs) (e.g., central nodes (CNs), access node controllers (ANC), etc.), where a set of one or more distributed units, in communication with a central unit, can define an access node (e.g., a new radio base station (NR BS), a new radio node-B (NR NB), a network node, 5G NB, gNB, etc.). Base stations or DUs can communicate with a set of UEs on downlink channels (e.g., for transmissions from a base station or to a UE) and uplink channels (e.g., for transmissions from a UE to a base station or distributed unit).

[0007] These multiple access technologies have been adopted in various telecommunication standards to provide common protocols that enable different wireless devices to communicate on a municipal, national, regional, and even global level. An example of an emerging telecommunication standard is new radio (NR) (e.g., 5G radio access). NR is a set of enhancements to the LTE mobile standard promulgated by Third Generation Partnership Project (3GPP). It is designed to better support mobile broadband Internet access by improving spectral efficiency, lowering costs, improving services, making use of new spectrum, and better integrating with other open standards using OFDMA with cyclic prefix (CP) on the downlink (DL) and on the uplink (UL) as well as support beamforming, multiple-input multiple-output (MIMO) antenna technology, and carrier aggregation.

[0008] However, as the demand for mobile broadband access continues to increase, there exists a need for further improvements in NR technology. Preferably, these improvements should be applicable to other multi-access technologies and the telecommunication standards that employ these technologies. SUMMARY

[0009] The systems, methods, and devices of the disclosure each have several aspects, no single one of which is solely responsible for its desirable attributes. Some features will now be discussed briefly. In consideration of the discussion below, and particularly in view of the detailed description that follows, one will understand how features of the present disclosure provide advantages over traditional methods and devices.

[0010] A particular aspect of the disclosure provides a method for wireless communication performed by a wireless communication device using a radio access technology (RAT). The method generally includes determining a mother code size (N) for transmitting an encoded bit stream, the determination being based at least in part on a minimum supported code rate (R min ) for transmitting the encoded bit stream, a control information size (K) of the encoded bit stream, a number of encoded bits for transmission (E), and a maximum supported encoded block size (N max ). The method also generally includes encoding a bit stream using a polar code of size (N, K) and storing the encoded bit stream in a circular buffer, and performing rate matching on the stored encoded bit stream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bit stream, and the number of encoded bits for transmission (E). The method further generally includes transmitting the rate-matched encoded bit stream using the RAT.

[0011] A particular aspect of the disclosure provides an apparatus for wireless communication performed by a wireless communication device using a radio access technology (RAT). The apparatus generally includes at least one processor configured to determine a mother code size (N) for transmitting an encoded bit stream, the determination being based at least in part on a minimum supported code rate (R min ) for transmitting the encoded bit stream, a control information size (K) of the encoded bit stream, a number of encoded bits for transmission (E), and a maximum supported encoded block size (N max ). The at least one processor can also be configured to encode a bit stream using a polar code of size (N, K) and store the encoded bit stream in a circular buffer, and perform rate matching on the stored encoded bit stream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bit stream, and the number of encoded bits for transmission (E). Additionally, the apparatus generally includes a memory coupled with the at least one processor.

[0012] A particular aspect of the disclosure provides an apparatus for wireless communication performed by a wireless communication device using a radio access technology (RAT). The method generally includes determining a mother code size (N) for transmitting an encoded bit stream, the determination being based at least in part on a minimum supported code rate (R min), a control information size (K) of the encoded bitstream, a number of encoded bits for transmission (E), and a maximum supported mother code size (N max ) of the RAT; means for encoding a bitstream using a polar code of size (N, K) and storing the encoded bitstream in a circular buffer; and means for performing rate matching on the stored encoded bitstream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bitstream, and the number of encoded bits for transmission (E). The apparatus further includes means for transmitting the rate matched encoded bitstream using the RAT.

[0013] Certain aspects of the present disclosure provide a non-transitory computer- readable medium for wireless communication performed by a wireless communication device using a radio access technology (RAT). The non-transitory computer-readable medium generally includes instructions that, when executed by at least one processor, configure the at least one processor to: determine a mother code size (N) for transmitting an encoded bitstream, the determination being based at least in part on a minimum supported code rate (R min ), a control information size (K) of the encoded bitstream, a number of encoded bits for transmission (E), and a maximum supported encoded block size (N max ) of the RAT; encode a bitstream using a polar code of size (N, K) and storing the encoded bitstream in a circular buffer; and perform rate matching on the stored encoded bitstream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bitstream, and the number of encoded bits for transmission (E).

[0014] Many other aspects are provided including methods, apparatus, systems, computer program products, and processing systems.

[0015] To the accomplishment of the foregoing and related aspects, the one or more aspects comprise the features as fully described in the following description and specifically pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects can be employed, and this description is intended to include all such aspects and their equivalents. BRIEF DESCRIPTION OF DRAWINGS

[0016] So that the manner in which the above-recited features of the present disclosure can be understood in detail, a more particular description, briefly summarized above, can be had by reference to aspects, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical aspects of this disclosure and are therefore not to be considered limiting of its scope, for the description can admit to other equally effective aspects.

[0017] Figure 1 FIG. 1 is a block diagram conceptually illustrating a design of an example telecommunications system, in accordance with certain aspects of the present disclosure.

[0018] Figure 2 FIG. 4 is a block diagram illustrating an example logical architecture of a distributed RAN, in accordance with certain aspects of the present disclosure.

[0019] Figure 3 FIG. 5 is a diagram illustrating an example physical architecture of a distributed RAN, in accordance with certain aspects of the present disclosure.

[0020] Figure 4 FIG. 6 is a block diagram conceptually illustrating a design of an example BS and user equipment (UE), in accordance with certain aspects of the present disclosure.

[0021] Figure 5 FIG. 7 is a diagram illustrating an example of a communication protocol stack for implementing aspects of the present disclosure.

[0022] Figure 6 FIG. 8 shows a block diagram of one example wireless device, in accordance with certain aspects of the present disclosure.

[0023] Figure 7 FIG. 9 is a simplified block diagram illustrating an encoder, in accordance with certain aspects of the present disclosure.

[0024] Figure 8 FIG. 10 is a simplified block diagram illustrating a decoder, in accordance with certain aspects of the present disclosure.

[0025] Figure 9 FIG. 11 illustrates one example of a DL-centric subframe, in accordance with certain aspects of the present disclosure.

[0026] Figure 10 FIG. 12 illustrates one example of an UL-centric subframe, in accordance with certain aspects of the present disclosure.

[0027] Figure 11 FIG. 13 illustrates one example cyclic buffer and rate matching in LTE, in accordance with certain aspects of the present disclosure.

[0028] Figure 12FIG. 8 is a flow chart illustrating example operations for wireless communication in a network, in accordance with particular aspects of the present disclosure.

[0029] Figure 13 An example circular buffer and rate matching using polar codes is shown in accordance with particular aspects of the present disclosure.

[0030] Figures 14A-14C An example of rate matching is shown in accordance with particular aspects of the present disclosure.

[0031] Figure 15 Rate matching in a circular buffer is shown in accordance with particular aspects of the present disclosure.

[0032] Figure 16 An example of rate matching in a circular buffer where encoded bits are punctured is shown in accordance with particular aspects of the present disclosure.

[0033] Figure 17 An example of rate matching in a circular buffer where encoded bits are repeated is shown in accordance with particular aspects of the present disclosure.

[0034] To facilitate an understanding of this description, like reference characters are used throughout the disclosure. It is contemplated that elements disclosed in one embodiment can be beneficially utilized on other embodiments without specific recitation below. DETAILED DESCRIPTION

[0035] Aspects of the present disclosure provide apparatus, methods, processing systems, and computer readable media for multi-layer networks, such as New Radio (NR) (New Radio Access Technology or 5G technology).

[0036] NR can support various wireless communication services such as Enhanced Mobile Broadband (eMBB) targeting wide bandwidth (e.g. 80 MHz beyond), Millimeter Wave (mmW) targeting high carrier frequency (e.g. 60 GHz), massive MTC (mMTC) targeting non-backward compatible MTC techniques, and / or critical tasks targeting ultra-reliable low-latency communications (URLLC). These services can include latency and reliability requirements. These services can also have different transmission time intervals (TTIs) for meeting respective quality of service (QoS) requirements. In addition, these services can co-exist in the same subframe.

[0037] Aspects of the disclosure relate to a rate matching scheme for control channels using polar codes. Rate matching is a process by which the number of bits to be transmitted is matched to the available bandwidth that allows the number of bits to be transmitted. In certain cases, the amount of data to be transmitted is less than the available bandwidth. In such cases, the entire data will be transmitted and one or more copies of the data will be transmitted - a technique known as repetition. In other cases, the amount of data to be transmitted can exceed the available bandwidth. In such cases, a portion of the data to be transmitted can be omitted from transmission - a technique known as puncturing.

[0038] In NR, polar codes can be used to encode a bit stream for transmission. However, in some cases, using a conventional rate matching scheme (e.g., for TBCC codes) when used with polar codes can result in performance loss. Accordingly, aspects of the disclosure propose an efficient rate matching scheme to be used to rate match a bit stream encoded using polar codes.

[0039] Various aspects of the disclosure are described in detail below. The disclosure may, however, be embodied in many different forms and should not be construed as limited to any specific structure or function presented throughout this disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Based on the teachings herein one skilled in the art should appreciate that the scope of the disclosure is intended to cover any aspect of the disclosure disclosed herein, whether implemented independently of or combined with any other aspect of the disclosure. For example, an apparatus can be implemented or a method can be practiced using any number of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover such an apparatus or method which is practiced using, in addition to or in place of the aspects set forth herein, other structures, functionalities or structures and functions disclosed herein. It is understood that any aspect of the disclosure disclosed herein can be embodied by one or more elements of a claim.

[0040] The term "exemplary" is used herein to mean "serving as an example, instance, or illustration." Any aspect described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other aspects.

[0041] Although specific aspects are described herein, many variations and permutations of these aspects fall within the scope of the disclosure. Although some benefits and advantages of the preferred aspects are described herein, the scope of the disclosure is not intended to be limited to particular benefits, uses, or objectives. Rather, aspects of the disclosure are intended to be broadly applicable to different wireless technologies, system configurations, networks, and transmission protocols, some of which are illustrated by way of example in the accompanying drawings and description below. The following detailed description is directed to certain implementations for the purposes of demonstrating the aspects of the disclosure. However, the teachings herein can be applied in a multitude of different ways. The described implementations can be implemented in conjunction with any other appropriate types of systems, methods, or implementations.

[0042] The techniques described herein can be used for various wireless communication networks such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA, and other networks. The terms "network" and "system" are often used interchangeably. A CDMA network can implement a radio technology such as Universal Terrestrial Radio Access (UTRA), cdma2000, etc. UTRA includes Wideband-CDMA (WCDMA), Time Division Synchronous CDMA (TD-SCDMA), and other variants of CDMA. cdma2000 covers IS-2000, IS-95, and IS-856 standards. A TDMA network can implement a radio technology such as Global System for Mobile Communications (GSM). An OFDMA network can implement a radio technology such as Evolved UTRA (E-UTRA), Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDMA, etc. UTRA and E-UTRA are part of Universal Mobile Telecommunication System (UMTS). 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) are new releases of UMTS that use E-UTRA, which employs OFDMA on the downlink and SC-FDMA on the uplink. UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from an organization named "3rd Generation Partnership Project" (3GPP). cdma2000 and UMB are described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2). The techniques described herein can be used for the wireless networks and radio technologies mentioned above as well as other wireless networks and radio technologies, such as 5G New Radio / NR networks. UTRA and E-UTRA are part of Universal Mobile Telecommunication System (UMTS). 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) are new releases of UMTS that use E-UTRA, which employs OFDMA on the downlink and SC-FDMA on the uplink. UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from an organization named "3rd Generation Partnership Project" (3GPP). cdma2000 and UMB are described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2). The techniques described herein can be used for the wireless networks and radio technologies mentioned above as well as other wireless networks and radio technologies, such as 5G New Radio / NR networks.

[0043] Example wireless communication system

[0044] Figure 1One example wireless network 100, such as a New Radio (NR) or 5G network, in which aspects of the present disclosure, for example, for performing rate matching of a bitstream encoded using a polar code, can be performed is shown.

[0045] As Figure 1 As shown in FIG. 1, the wireless network 100 can include a number of BSs 110 and other network entities. A BS can be a station that communicates with UEs. Each BS 110 can provide communication coverage for a particular geographic area. In 3GPP, the term "cell" can refer to a coverage area of a Node B and / or a Node B subsystem serving the coverage area, depending on the context in which the term is used. In NR systems, the term "cell" and eNB, Node B, 5G NB, AP, NR BS, BS, or TRP can be interchangeable. In some examples, a cell can not necessarily be stationary, and the geographic area of the cell can move as the base station moves. In some examples, base stations can be interconnected to one another and / or to one or more other base stations or network nodes (not shown) in the wireless network 100 through various types of backhaul interfaces such as a direct physical connection, a virtual network, or the like using any suitable transport network.

[0046] In general, any number of wireless networks can be deployed in a given geographic area. Each wireless network can support a particular radio access technology (RAT) and can operate on one or more frequencies. A RAT can also be referred to as a radio technology, an air interface, etc. A frequency can also be referred to as a carrier, a frequency channel, etc. Each frequency can support a single RAT in a given geographic area in order to avoid

[0047] A BS can be a macro cell, a pico cell, a femto cell, and / or other types of cell. A macro cell can cover a relatively large geographic area (e.g., 5-10 miles in radius) and can allow unrestricted access by UEs with service subscriptions appropriate for the macro cell (e.g., capacity can be based on subscription levels and / or other factors). A pico cell can cover a relatively small geographic area and can allow unrestricted access by UEs with service subscriptions appropriate for the pico cell. A femto cell can cover a relatively small geographic area (e.g., a home) and can allow restricted access by UEs with service subscriptions appropriate for the femto cell. A BS for a macro cell can be referred to as a macro BS. A BS for a pico cell can be referred to as a pico BS. A BS for a femto cell can be referred to as a femto BS or a home BS. In the example shown in FIG. 1, the BSs 110a and 110b can be macro BSs for the macro cells 102a and 102b, respectively. The BS 110c can be a pico BS for a pico cell 102c. The BSs 110e and 110f can be femto BSs for the femto cells 102e and 102f, respectively. A femto BS 110e can be owned by a UE 120e and can be used exclusively by the UE 120e or shared by a group of UEs. Other Figure 1In the example shown in FIG. 1, the BSs 110a, 110b and 110c can be macro BSs for the macro cells 102a, 102b and 102c, respectively. The BS 1 lOx can be a pico BS for a pico cell 102x. The BSs 1 lOy and 1 lOz can be femto BSs for the femto cells 102y and 102z, respectively. A BS can support one or multiple (e.g., three) cells.

[0048] Wireless network 100 can also include relay stations. A relay station is a station that receives a transmission of data and / or other information from an upstream station (e.g., a BS or a UE) and sends a transmission of the data and / or other information to a downstream station (e.g., a UE or a BS). A relay station can also be a UE that can relay transmissions for other UEs. In Figure 1 In the example shown in FIG. 1, a relay station 1 lOr can communicate with the BS 1 lOa and a UE 120r in order to facilitate communications between the BS 1 lOa and the UE 120r. A relay station can also be referred to as a relay BS, a relay, and / or the like.

[0049] Wireless network 100 can be a heterogeneous network that includes BSs of different types, e.g., macro BSs, pico BSs, femto BSs, relays, etc. These different types of BSs can have different transmit power levels, different coverage areas, and different impacts on interference in wireless network 100. For example, macro BSs can have a high transmit power level (e.g., 20 Watts) whereas pico BSs, femto BSs and relays can have a lower transmit power level (e.g., 1 Watt).

[0050] Wireless network 100 can support synchronous or asynchronous operation. For synchronous operation, the BSs can have similar frame timing, and transmissions from different BSs can be approximately aligned in time. For asynchronous operation, the BSs can have different frame timing, and transmissions from different BSs can not be aligned in time. The techniques described herein can be used for both synchronous and asynchronous operation.

[0051] A network controller 130 can couple to a set of BSs and provide coordination and control for these BSs. Network controller 130 can be in communication with the BSs 110 via a backhaul. The BSs 110 can also communicate with one another, e.g., directly or indirectly via wireless or wireline backhaul.

[0052] The UEs 120 (e.g., 120x, 120y, etc.) can be dispersed throughout the wireless network 100, and each UE can be stationary or mobile. A UE can also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, a Customer Premises Equipment (CPE), a cellular phone, a smart phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet computer, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device or equipment, a biometric sensor / device, a wearable device such as a smart watch, smart clothing, smart glasses, a smart wrist band, smart jewelry (e.g., a smart ring, a smart bracelet, etc.), an entertainment device (e.g., a music device, a video device, a satellite radio, etc.), a vehicular component or sensor, a smart meter / sensor, industrial manufacturing equipment, a global positioning system device, or any other suitable device that is configured to communicate via a wireless or wired medium. Some UEs can be considered evolved or machine-type communication (MTC) devices or evolved MTC (eMTC) devices. MTC and eMTC UEs include, for example, robots, drones, remote devices, sensors, meters, monitors, location tags, etc., that can communicate with a BS, another device (e.g., remote device), or some other entity. A wireless node can provide, for example, connectivity for or to a network (e.g., a wide area network such as the Internet or a cellular network) via a wired or wireless communication link. Some UEs can be considered Internet-of-Things (IoT) devices.

[0053] In Figure 1 In

[0054] A particular wireless network (e.g., LTE) utilizes orthogonal frequency division multiplexing (OFDM) with a cyclic prefix on the downlink and single-carrier frequency division multiplexing (SC-FDM) on the uplink. OFDM and SC-FDM partition the system bandwidth into multiple (K) orthogonal subcarriers, which are also commonly referred to as tones, bins, or the like. Each subcarrier can be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing of adjacent subcarriers can be fixed, and the total number of subcarriers (K) can be dependent on the system bandwidth. For example, the spacing of the subcarriers can be 15 kHz and the total number of subcarriers (K) can be 1200 for a system bandwidth of 20 megahertz (MHz). The resource allocation can be expressed in the number of resource blocks (RBs), which can be determined based on the number of subcarriers. For example, one RB can cover 12 subcarriers, which can span 180 kHz. Therefore, the nominal FFT size can be equal to 1200 or 2048 for a 1.25 MHz or 2.5 MHz system bandwidth, respectively. The system bandwidth can be partitioned into sub-bands. For example, a sub-band can cover 1.08 MHz (i.e., 6 RBs), and there can be 1, 2, 4, 8, or 16 sub-bands for system bandwidth of 1.25, 2.5, 5, 10, or 20 MHz, respectively.

[0055] Although aspects of the examples described herein can be associated with LTE technologies, aspects of the present disclosure can be applicable with other wireless communication systems such as NR / 5G.

[0056] NR can utilize OFDM with a CP on the uplink and downlink and include support for half-duplex operation using TDD. A single component carrier bandwidth of 100 MHz can be supported. An NR resource block can span 12 subcarriers with a subcarrier bandwidth of 75 kHz across a 0.1 ms duration. Each radio frame can consist of 50 subframes with a length of 10 ms. Consequently, each subframe can have a length of 0.2 ms. Each subframe can indicate the link direction (i.e., DL or UL) for data transmission and the link direction for each subframe can be switched Figure 9 and 10As described in detail above. Beamforming can be supported, and beam direction can be dynamically configured. MIMO transmissions with precoding can also be supported. MIMO configuration in the DL can support up to 8 transmit antennas with multi-layer DL transmissions up to 2 layers per UE. Multi-layer transmissions with up to 2 layers per UE can be supported. Aggregation of multiple cells can be supported with up to 8 serving cells. Alternatively, NR can support a different air interface other than one that is OFDM-based. NR networks can include entities such as CUs and / or DUs.

[0057] In some examples, access to the air interface can be scheduled, where a scheduling entity (e.g., a base station) allocates resources for communication among some or all devices and equipment within its service area or cell. Within the present disclosure, scheduling entities can be responsible for scheduling, allocating, reconfiguring, and releasing resources for one or more subordinate entities as discussed further below. That is, for scheduled communication, subordinate entities utilize resources allocated by the scheduling entity. Base stations are not the only entities that can function as a scheduling entity. That is, in some examples, a UE can function as a scheduling entity, scheduling resources for one or more subordinate entities (e.g., one or more other UEs). In that example, the UE is functioning as a scheduling entity, and the other UEs utilize resources scheduled by the UE. A UE can function as a scheduling entity in a peer-to-peer (P2P) network and / or mesh network. In a mesh network example, UEs can optionally communicate directly with one another in addition to communicating with the scheduling entity.

[0058] Thus, in a wireless communication network with scheduled access to time- frequency resources, and with a cellular configuration, a P2P configuration, and a mesh configuration, a scheduling entity and one or more subordinate entities can utilize the scheduled resources for communication.

[0059] As noted above, a RAN can include CUs and DUs. One NR BS (e.g., gNB, 5G Node B, Node B, transmit receive point (TRP), access point (AP)) can correspond to one or multiple BSs. NR cells can be configured as access cells (A-cells) or data only cells (D-cells). For example, a RAN (e.g., central unit or distributed unit) can configure a cell. A D-cell can be a cell used for carrier aggregation or dual connectivity but not for initial access, cell selection / reselection, or handover. In some cases, a D-cell can not transmit synchronization signals - in some cases, a D-cell can transmit an SS. An NR BS can transmit a downlink signal to a UE indicating a cell type. Based on the cell type indication, the UE can communicate with the NR BS. For example, the UE can determine, based on the indicated cell type, the NR BS to consider for cell selection, access, handover, and / or measurement.

[0060] Figure 2 An example logical architecture of a distributed radio access network (RAN) 200 that can be implemented in a wireless communication system is shown. Figure 1 A 5G access node 206 can include an access node controller (ANC) 202. The ANC can be a central unit (CU) of the distributed RAN 200. The backhaul interface to the next generation core network (NG-CN) 204 can terminate at the ANC. The backhaul interface to neighboring next generation access nodes (NG-ANs) can terminate at the ANC. The ANC can include one or more TRPs 208 (which can also be referred to as BSs, NR BSs, Node Bs, 5G NBs, APs, or some other term). As described above, a TRP can be used interchangeably with "cell."

[0061] The TRPs 208 can be DUs. The TRPs can be connected to one ANC (ANC 202) or more than one ANC (not shown). For example, for radio as a service (RaaS) and AND deployments dedicated to service, the RAN, the TRPs can be connected to more than one ANC. The TRPs can include one or more antenna ports. The TRPs can be configured to individually (e.g., dynamically selected) or jointly (e.g., jointly transmitting) provide traffic to a UE.

[0062] The logical architecture 200 of the distributed RAN 200 can be used to illustrate fronthaul definition. The architecture can be defined such that fronthaul solutions across different deployment

[0063] The architecture can share features and / or components with LTE. According to aspects, the next generation AN (NG-AN) 210 can support dual connectivity with NR. The NG-AN can share a common fronthaul for LTE and NR.

[0064] The architecture can enable cooperation between TRPs 208. For example, cooperation can be preset within a TRP and / or across TRPs via the ANC 202. According to aspects, any inter-TRP interface can not be needed / present.

[0065] According to aspects, dynamic configuration of split logical functions can be present within the distributed RAN 200. As will be described with reference to FIG. 2B, the logical functions can be dynamically configured to be located in the TRP (e.g., gNB-DU), the ANC (e.g., gNB-CU- DU), or a combination thereof. Figure 5More specifically, the Radio Resource Control (RRC) layer, Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, Media Access Control (MAC) layer, and Physical (PHY) layer can be adapted to be placed at the DU or CU (e.g., TRP or ANC, respectively). Depending on a particular aspect, the BS may include a Central Unit (CU) (e.g., ANC 202) and / or one or more Distributed Units (e.g., one or more TRPs 208).

[0066] Figure 3 An example physical architecture of a distributed RAN 300 according to aspects of this disclosure is shown. A centralized core network unit (C-CU) 302 can manage core network functions. The C-CU can be deployed centrally. To handle peak capacity, C-CU functions can be offloaded (e.g., offloaded to Advanced Radio Services (AWS)).

[0067] The Centralized RAN Unit (C-RU) 304 can manage one or more ANC functions. Optionally, the C-RU can manage core network functions locally. The C-RU can be deployed in a distributed manner. The C-RU can be located closer to the network edge.

[0068] The DU 306 can manage one or more TRPs (Edge Nodes (EN), Edge Units (EU), Radio Headers (RH), Smart Radio Headers (SRH), etc.). The DU can be placed at the edge of a network with radio frequency (RF) capabilities.

[0069] Figure 4 This illustrates aspects that can be used to implement the contents of this disclosure. Figure 1 Example components of BS 110 and UE 120 are shown. As described above, the BS may include a TRP. One or more components of BS 110 and UE 120 may be used to practice aspects of this disclosure. For example, antenna 452, Tx / Rx 222, processors 466, 458, 464 and / or controller / processor 480 of UE 120 and / or antenna 434, processors 440, 420, 438 and / or controller / processor 440 of BS 110 may be used to perform the functions described herein and referenced. Figure 12 The operation shown.

[0070] According to the relevant parties, for restricted association scenarios, base station 110 can be... Figure 1 The base station 110 can be BS110c, and the UE 120 can be UE 120y. The base station 110 can also be some other type of base station. The base station 110 can be equipped with antennas 434a to 434t, and the UE 120 can be equipped with antennas 452a to 452r.

[0071] At the base station 110, a transmit processor 420 can receive data from a data source 412 and control information from a controller / processor 440. The control information can be for the physical broadcast channel (PBCH), physical control format indicator channel (PCFICH), physical hybrid ARQ indicator channel (PHICH), physical downlink control channel (PDCCH), etc. The data can be for the physical downlink shared channel (PDSCH), etc. The processor 420 can process (e.g., encode and symbol map) the data and control information to obtain data symbols and control symbols, respectively. The processor 420 can also generate reference symbols, e.g., for the PSS, SSS, and cell-specific reference signal. A transmit (TX) multiple-input multiple-output (MIMO) processor 430 can perform spatial processing (e.g., precoding) on the data symbols, the control symbols, and / or the reference symbols, if applicable, and can provide output symbol streams to the modulators (MODs) 432a through 432t. Each modulator 432 can process a respective output symbol stream (e.g., for OFDM, etc.) to obtain an output sample stream. Each modulator 432 can further process the output sample stream (e.g., conversion to analog, amplification, filtering, and upconversion) to obtain a downlink signal. The downlink signals from modulators 432a through 432t can be transmitted via the antennas 434a through 434t, respectively.

[0072] At the UE 120, the antennas 452a through 452r can receive the downlink signals from the base station 110 and can provide received signals to the demodulators (DEMODs) 454a through 454r, respectively. Each demodulator 454 can condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain input samples. Each demodulator 454 can further process the input samples (e.g., for OFDM, etc.) to obtain received symbols. A MIMO detector 456 can obtain received symbols from all the demodulators 454a through 454r, perform MIMO detection on the received symbols if applicable, and provide detected symbols. A receive processor 458 can process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data to a data sink 460, and provide decoded control information to the controller / processor 480.

[0073] On the uplink, at the UE 120, a transmit processor 464 can receive and process data (e.g., for the physical uplink shared channel (PUSCH)) from a data source 462 and control information (e.g., for the physical uplink control channel (PUCCH) from the controller / processor 480. The transmit processor 464 can also generate reference symbols for a reference signal. The symbols from the transmit processor 464 can be precoded by a TX MIMO processor 466 if applicable, further processed by the demodulators 454a through 454r (e.g., for SC-FDM, etc.), and transmitted to the base station 110. At the BS 110, the uplink signals from the UE 120 can be received by the antennas 434, processed by the modulators 432, detected by a MIMO detector 436 if applicable, and further processed by a receive processor 438 to obtain decoded data and control information sent by the UE 120. The receive processor 438 can provide the decoded data to a data sink 439 and to the controller / processor 440.

[0074] The controller / processors 440 and 480 can direct the operation at the base station 110 and the UE 120, respectively. The processor 440 and / or other processors and modules at the base station 110 can perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The processor 480 and / or other processors and modules at the UE 120 can also perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A scheduler 444 can schedule UEs for data transmission on the downlink and / or uplink. Figure 6 The controller / processors 440 and 480 can direct the operation at the base station 110 and the UE 120, respectively. The processor 440 and / or other processors and modules at the base station 110 can perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The processor 480 and / or other processors and modules at the UE 120 can also perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A scheduler 444 can schedule UEs for data transmission on the downlink and / or uplink. Figure 7 The controller / processors 440 and 480 can direct the operation at the base station 110 and the UE 120, respectively. The processor 440 and / or other processors and modules at the base station 110 can perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The processor 480 and / or other processors and modules at the UE 120 can also perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A scheduler 444 can schedule UEs for data transmission on the downlink and / or uplink. The controller / processors 440 and 480 can direct the operation at the base station 110 and the UE 120, respectively. The processor 440 and / or other processors and modules at the base station 110 can perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The processor 480 and / or other processors and modules at the UE 120 can also perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A scheduler 444 can schedule UEs for data transmission on the downlink and / or uplink.

[0075] The controller / processors 440 and 480 can direct the operation at the base station 110 and the UE 120, respectively. The processor 440 and / or other processors and modules at the base station 110 can perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The processor 480 and / or other processors and modules at the UE 120 can also perform or direct the execution of the functions illustrated in FIGs. 1, 2, 3, 4, 5, and / or 6, for example, and / or other processes for the techniques described herein. The memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A scheduler 444 can schedule UEs for data transmission on the downlink and / or uplink. Figure 5 A diagram illustrating an example of a communication protocol stack for implementing aspects consistent with the present disclosure is shown. The illustrated communication protocol stack can be implemented by devices operating in a 5G system (e.g., a system supporting uplink-based mobility). Figure 5 A communication protocol stack including a radio resource control (RRC) layer 510, a packet data convergence protocol (PDCP) layer 515, a radio link control (RLC) layer 520, a medium access control (MAC) layer 525, and a physical (PHY) layer 530 is shown. In various examples, the layers of the protocol stack can be implemented as separate modules of software, portions of a processor or ASIC, portions of non-colocated devices connected by a communication link, or various combinations thereof. Colocated and non-colocated implementations can be used, for example, in protocol stacks for network access devices (e.g., ANs, CUs, and / or DUs) or UEs.

[0076] The first option 505-a illustrates a split implementation of the protocol stack in which the implementation of the protocol stack is split between a centralized network access device (e.g., the ANC 202 in Figure 2 , and a distributed network access device (e.g., the TRP / DU 208 in Figure 2 ). In the first option 505-a, the RRC layer 510 and the PDCP layer 515 can be implemented by the central unit, and the RLC layer 520, the MAC layer 525, and the PHY layer 530 can be implemented by the DU. In various examples, the CU and the DU can be co-located or non-co-located. The first option 505-a can be useful in macrocell, microcell, or pico cell deployments.

[0077] The second option 505-b illustrates a unified implementation of the protocol stack in which the protocol stack is implemented in a single network access device (e.g., an access node (AN), a new radio base station (NR BS), a new radio node-B (NR NB), a network node (NN), etc.). In the second option, the RRC layer 510, the PDCP layer 515, the RLC layer 520, the MAC layer 525, and the PHY layer 530 can each be implemented by the AN. The second option 505-b can be useful in femtocell deployments.

[0078] Regardless of whether the network access device implements part or all of the protocol stack, the UE can implement the entire protocol stack (e.g., the RRC layer 510, the PDCP layer 515, the RLC layer 520, the MAC layer 525, and the PHY layer 530).

[0079] Figure 6 Various components that can be utilized in a wireless communication device 602 that can be used within a wireless communication system from Figure 1 are illustrated. The wireless communication device 602 is one example of a device that can be configured to implement the various methods described herein. The wireless communication device 602 can be a BS 110 from or any of the user devices 120. Figure 1

[0080] ​The wireless communication device 602 can include a processor 604 which controls operation of the wireless communication device 602. The processor 604 can also be referred to as a central processing unit (CPU). Memory 606, which can include both read-only memory (ROM) and random access memory (RAM), provides instructions and data to the processor 604. A portion of the memory 606 can also include non-volatile random access memory (NVRAM). The processor 604 typically performs logical and arithmetic operations based on program instructions stored within the memory 606. The instructions in the memory 606 can be executable to implement the methods described herein.

[0081] The wireless communication device 602 can also include a housing 608 that can include a transmitter 610 and a receiver 612 to allow transmission and reception of data between the wireless communication device 602 and a remote location. The transmitter 610 and receiver 612 can be combined into a transceiver 614. A single or a plurality of transmit antennas 616 can be attached to the housing 608 and electrically coupled to the transceiver 614. The wireless communication device 602 can also include (not shown) multiple transmitters, multiple receivers, and multiple transceivers.

[0082] The wireless communication device 602 can also include a signal detector 618 that can be used in attempting to detect and quantify the level of signals received by the transceiver 614. The signal detector 618 can detect such signals as total energy, energy per subcarrier per symbol, power spectral density and other signals. The wireless communication device 602 can also include a digital signal processor (DSP) 620 for use in processing signals. The wireless communication device 602 can further comprise a user interface 622 including a keypad 624, speakers 626, a display 628, a

[0083] Additionally, the wireless communication device 602 can include a coder 622 for use in encoding signals for transmission. The coder can also store the encoded signals in a circular buffer (not shown) and perform rate matching on the encoded signals (e.g., by implementing operations 1200). Further, the wireless communication device 602 can include a decoder 624 for use in decoding received signals.

[0084] The various components of the wireless communication device 602 can be coupled together by a bus system 626, which can include a power bus, a control signal bus and a status signal bus in addition to a data bus. The processor 604 can be configured to access the instructions and data stored in the memory 606 to perform connectionless access in accordance with aspects of the present disclosure discussed below.

[0085] Figure 7 is a simplified block diagram illustrating an encoder in accordance with certain aspects of the present disclosure. Figure 7Portions of a radio frequency (RF) modem 704 that can be configured to provide an encoded message for wireless transmission (e.g., using a polar code described below) are shown. In one example, an encoder 706 in a base station (e.g., BS 110) (or a UE 120 on the reverse path) receives a message 702 for transmission. The message 702 can contain data and / or encoded voice or other content directed to a receiving device. The encoder 706 encodes the message using a suitable modulation and coding scheme (MCS) that is typically selected based on a configuration defined by the BS 110 or another network entity. The encoded bit stream 708 can then be stored in a circular buffer, for example, and rate matching can be performed on the stored encoded bit stream. After rate matching the encoded bit stream 708, the encoded bit stream 708 can then be provided to a mapper 710 that generates a sequence of Tx symbols 712 that are modulated, amplified, and otherwise processed by a Tx chain 714 to produce an RF signal 716 for transmission by an antenna 718.

[0086] Figure 8 is a simplified block diagram illustrating a decoder in accordance with certain aspects of the disclosure. Figure 8 Portions of a RF modem 810 that can be configured to receive and decode a wirelessly transmitted signal that includes an encoded message (e.g., a message encoded using a polar code as described below) are shown. In various examples, the modem 810 that receives the signal can reside at an access terminal, a base station, or any other suitable apparatus or unit for implementing the described functionality. An antenna 802 provides a RF signal 716 (i.e., a RF signal produced in Figure 4

[0087] ​The decoder 816 can thus be used to decode an m-bit information string from a bit stream that has been encoded using an encoding scheme (e.g., a polar code). The decoder 816 can include a Viterbi decoder, an algebraic decoder, a turbo decoder, or another suitable decoder. In one example, the Viterbi decoder uses the well-known Viterbi algorithm to find the most likely sequence of signaling states (Viterbi path) that corresponds to the received bit stream 814. The bit stream 814 can be decoded based on a statistical analysis of the LLRs computed for the bit stream 814. In one example, the Viterbi decoder can use a likelihood ratio test to compare and select the correct Viterbi path of sequences of signaling states to generate LLRs from the bit stream 814. The likelihood ratio can be used to statistically compare the suitability of multiple candidate Viterbi paths using a likelihood ratio test that compares the log of the likelihood ratio (i.e., the LLR) for each candidate Viterbi path to determine which path is more likely to explain the sequence of symbols that produced the bit stream 814. The decoder 816 can then decode the bit stream 814 based on the LLRs to determine a message 818 containing data and / or encoded speech or other content that was transmitted from a base station (e.g., BS 110).

[0088] Figure 9 FIG. 13 is a diagram illustrating one example of a DL-centric subframe that can be used for communication in the wireless network 100 by one or more devices, such as BSs 110 and / or UEs 120. The DL-centric subframe can include a control portion 902. The control portion 902 can exist in the initial or beginning portion of the DL-centric subframe. The control portion 902 can include various scheduling information and / or control information corresponding to various portions of the DL-centric subframe. In some configurations, the control portion 902 can be a physical DL control channel (PDCCH) as Figure 9 indicated in FIG. 13. The DL-centric subframe can also include a DL data portion 904. The DL data portion 904 can sometimes be referred to as the payload of the DL-centric subframe. The DL data portion 904 can include the communication resources used to transmit DL data from a scheduling entity (e.g., a BS) to one or more subordinate entities (e.g., UEs). In some configurations, the DL data portion 904 can be a physical DL shared channel (PDSCH).

[0089] The DL-centered subframe may also include a common UL section 906. The common UL section 906 may sometimes be referred to as a UL burst, common UL burst, and / or various other suitable terms. The common UL section 906 may include feedback information corresponding to various other sections of the DL-centered subframe. For example, the common UL section 906 may include feedback information corresponding to the control section 902. Non-limiting examples of feedback information may include ACK signals, NACK signals, HARQ indicators, and / or various other suitable types of information. The common UL section 906 may include additional or alternative information (such as information related to the Random Access Channel (RACH) procedure, scheduling requests (SR), and various other suitable types of information). Figure 9 As shown, the end of the DL data portion 904 may be time-separated from the start of the common UL portion 906. This time interval may sometimes be referred to as a gap, guard period, guard interval, and / or various other suitable terms. This interval provides time for the switch from DL communication (e.g., a receiving operation performed by a lower-level entity (e.g., a UE)) to UL communication (e.g., a transmission performed by a lower-level entity (e.g., a UE)). Those skilled in the art will understand that the foregoing is only one example of a DL-centric subframe, and alternative structures with similar features may exist without necessarily departing from the aspects described herein.

[0090] Figure 10 This diagram illustrates an example of a UL-centered subframe that can be used by one or more devices (e.g., BS110 and / or UE 120) to communicate in a wireless network 100. The UL-centered subframe may include a control portion 1002. The control portion 1002 may be present in the initial or beginning portion of the UL-centered subframe. Figure 10 The control section 1002 in the above reference can be the same as the one mentioned above. Figure 9 The control portion is described similarly. The UL-centric subframe may also include a UL data portion 1004. The UL data portion 1004 may sometimes be referred to as the payload of the UL-centric subframe. The UL portion may refer to the communication resources used to transmit UL data from a lower-level entity (e.g., the UE) to a scheduling entity (e.g., the UE or the BS). In some configurations, the control portion 1002 may be the Physical DL Control Channel (PDCCH).

[0091] like Figure 10As shown in FIG. 10B, an end of the control portion 1002 can be separated in time from a start of the UL data portion 1004. This time interval can sometimes be referred to as a gap, a guard period, a guard interval, and / or various other suitable terminology. This interval provides time for switching from DL communication (e.g., reception operations by the scheduling entity) to UL communication (e.g., transmission by the scheduling entity). The UL-centric subframe can also include a common UL portion 1006. Figure 10 The common UL portion 1006 in FIG. 10B can be similar to the common UL portion 1006 described above with reference to FIG. 10A. The common UL portion 1006 can additionally or alternatively include information related to channel quality indicators (CQI), sounding reference signals (SRS), and various other suitable types of information. One having ordinary skill in the art will understand that the foregoing is merely one example of an UL-centric subframe, and alternative structures having similar features can exist without necessarily departing from the aspects described herein. Figure 10

[0092] In some cases, two or more subordinate entities (e.g., UEs) can communicate with each other using sidelink signals. Real-world applications of such sidelink communications can include public safety, proximity services, UE-to-network relaying, vehicle-to-vehicle (V2V) communications, Internet of Everything (IoE) communications, IoT communications, mission-critical mesh, and / or various other suitable applications. Generally, a sidelink signal can refer to a signal communicated from one subordinate entity (e.g., UE1) to another subordinate entity (e.g., UE2) without relaying that communication through the scheduling entity (e.g., a UE or BS), even though the scheduling entity can be utilized for scheduling and / or control purposes. In some examples, the sidelink signals can be communicated using a licensed spectrum (unlike wireless local area networks, which typically use an unlicensed spectrum).

[0093] ​A UE can operate in various radio resource configurations, including a configuration associated with transmitting pilots using a dedicated set of resources (e.g., in a radio resource control (RRC) dedicated state, etc.) or a configuration associated with transmitting pilots using a common set of resources (e.g., in an RRC common state, etc.). While operating in the RRC dedicated state, the UE can select the dedicated set of resources for transmitting a pilot signal to a network. While operating in the RRC common state, the UE can select the common set of resources for transmitting a pilot signal to the network. In either case, a pilot signal transmitted by the UE can be received by one or more network access devices, such as an AN or a DU, or portions thereof. Each receiving network access device can be configured to receive and measure pilot signals transmitted on the common set of resources, and also receive and measure pilot signals transmitted on dedicated sets of resources allocated to UEs for which the network access device is a member of a monitoring set of network access devices for the UE. One or more of the receiving network access devices, or a CU to which receiving network access devices transmit measurements of pilot signals, can use the measurements to identify serving cells for UEs, or initiate a change of serving cell for one or more of the UEs.

[0094] Example polar codes

[0095] As noted above, polar codes can be used to encode a bit stream for transmission. Polar codes are the first provably capacity-achieving coding schemes with near-linear (in block length) encoding and decoding complexity. Polar codes are widely seen as a candidate for error correction in next generation wireless systems. Polar codes have many desirable properties, such as deterministic construction (e.g., based on fast Hadamard transform), very low and predictable error floor, and simple successive cancellation (SC)-based decoding.

[0096] Polar codes are linear block codes of length N = 2 n , where their generator matrix is constructed using the n-th Kronecker power of the matrix , denoted as G n . For example, equation (1) shows the generator matrix resulting for n = 3.

[0097]

[0098] According to certain aspects, a code word can be generated (e.g., by a BS) by encoding a number of input bits (e.g., information bits) using a generator matrix. For example, given a number of input bits u = (u0, u1,..., uN-1), a code word x = (x0, x1,..., xN-1) can be generated according to equation (2) as follows: N-1The codeword vector x = (x0, x1, ..., xn) can be generated by encoding the input bits using a generator matrix G. N-1 The generated codeword can then be rate-matched (e.g., using the techniques described herein) and transmitted by the base station over the wireless medium, and received by the UE.

[0099] When the received vector is decoded (e.g. by the UE) using a sequential cancellation (SC) decoder (e.g., decoder 816), it is assumed that bit u0 i-1 If correctly decoded, then each estimated bit It has a predetermined error probability tending towards 0 or 0.5. Furthermore, the proportion of bits with a low error probability tends towards the capacity of the underlying channel. For example, as illustrated below, polar codes utilize a phenomenon known as channel polarization by sending information using the most reliable K bits while setting or freezing the remaining (NK) bits to predetermined values ​​(such as 0).

[0100] For very large N, polar coding transforms the channel into N parallel "virtual" channels for N information bits. If C is the channel capacity, there are approximately N*C completely noise-free channels and N(1–C) completely noisy channels. The basic polar coding scheme thus involves freezing (i.e., not transmitting) the information bits that would be transmitted along the completely noisy channels and transmitting information only along the perfect channels. For short to medium N, the polarization may not be complete in the sense that there may be several channels that are neither completely useless nor completely noise-free (i.e., channels in transition). Depending on the transmission rate, these channels in transition are either frozen or used for transmission.

[0101] Example rate matching schemes for control channels using polar codes

[0102] This disclosure relates to rate matching schemes for control channels using polar codes. Rate matching is the process of matching the number of bits to be transmitted to the available bandwidth that allows that number of bits to be transmitted. In certain cases, the amount of data to be transmitted is less than the available bandwidth. In this case, all data will be transmitted, and one or more copies of the data may be transmitted—a technique known as duplication. In other cases, the amount of data to be transmitted exceeds the available bandwidth. In this case, portions of the data to be transmitted can be omitted from the transmission—a technique known as puncturing.

[0103] In LTE, 1 / 3 rate tail-biting convolutional codes (TBCC) are used for rate matching of the control channel. Typically, codes such as... Figure 11The circular buffer 1100 shown in FIG. 11 performs rate matching in LTE. For example, after encoding a bit stream, the encoded bits produced from three polynomials (e.g., required for a rate-1 / 3 TBCC) are put into the circular buffer one by one. For example, referring to Figure 11 , code bits from the first polynomial are put into the circular buffer in the range of [0, K). Further, code bits from the second polynomial are put into the circular buffer in the range of [K, 2K), and code bits from the third polynomial are put into the circular buffer in the range of [2K, 3K).

[0104] Once the encoded bits are stored in the circular buffer, rate matching can be performed. For example, assuming the number of encoded bits for transmission is E (e.g., the allocated block size), if E = 3K, no repetition or puncturing (i.e., rate matching) is performed. However, if E > 3K, repetition can be performed clockwise around the circular buffer from 3K. Additionally, if E < 3K, puncturing can be performed counterclockwise around the circular buffer from 3K.

[0105] In NR, a polar code of size (N, K) can be used to encode a bit stream for transmission. However, in some cases, such as when the size of the circular buffer is not a power of two (i.e., the block length constraint of the polar code), using the rate matching scheme described above when used with a polar code (e.g., for a TBCC code) can result in performance loss. Accordingly, aspects of the present disclosure propose an efficient rate matching scheme for a bit stream encoded using a polar code. For example, in some cases, the techniques propose an efficient rate matching scheme for a polar code that involves selecting a suitable integer power of two for the polar mother code size (e.g., N, which is also the circular buffer size).

[0106] Figure 12 Example operations 1200 for wireless communication, such as for performing rate matching of a bit stream encoded using a polar code, are shown. In some cases, the operations 1200 can be applied to information transmission on a control channel using a polar code. The operations 1200 can be performed by a wireless communication device, such as a base station (BS 110), user equipment 120, and / or wireless communication device 602 using a radio access technology (RAT) (e.g., LTE, 5G NR, etc.).

[0107] According to aspects, a UE can include one or more means for performing the operations described herein, as described with respect to FIG. 6. For example, the UE 120 can include the one or more memory devices 612, transceiver 610, processor 604, and / or polar encoder 616, which can be means for performing one or more operations described herein. Additionally or alternatively, the UE 120 can include one or more components of the apparatus 600, which can be means for performing one or more operations described herein. Figure 4 Figure 4 ​The antenna 452, demodulator / modulator 454, controller / processor 480, and / or memory 482 illustrated in FIG. 13 can perform the operations described herein. Further, the base station can include one or more components illustrated in FIG. 13 that can be configured to perform the operations described herein. Figure 4 For example, the antenna 434, demodulator / modulator 432, controller / processor 440, and / or memory 442 illustrated in FIG. 14 can perform the operations described herein. Figure 4 For example, the antenna 434, demodulator / modulator 432, controller / processor 440, and / or memory 442 illustrated in FIG. 14 can perform the operations described herein.

[0108] The operations 1200 begin, at 1202, by determining a mother code size (N) for transmitting an encoded bit stream, the determination being based at least in part on a minimum supported code rate (R min ) for transmitting the encoded bit stream, a control information size (K) of the encoded bit stream, a number of encoded bits (E) for transmission, and a maximum supported encoded block size (N max ) supported by the wireless communication network. According to aspects, the mother code size can also be referred to as a target encoded block size. Similarly, the number of encoded bits for transmission can also be referred to as an allocated encoded block size.

[0109] At 1204, the wireless communication device encodes the bit stream using a polar code of size (N, K) and stores the encoded bit stream in a circular buffer.

[0110] At 1206, the wireless communication device performs rate matching on the stored encoded bit stream based at least in part on a comparison between the mother code size (N), the control information size (K) of the encoded bit stream, and the number of encoded bits (E) for transmission. Additionally, although not shown, the operations 1200 can further include transmitting the rate matched encoded bits, e.g., using one or more antennas.

[0111] As noted, in preparing a bit stream for transmission in a wireless communication network, a wireless communication device can determine a mother code size (N) for transmitting the bit stream. According to aspects, the mother code size (N) can be determined based at least in part on a minimum supported code rate (R min ) for transmitting the encoded bit stream, a control information size (K) of the encoded bit stream, a number of encoded bits (E) for transmission allocated to the wireless communication device (e.g., by the wireless communication network) to transmit data, and a maximum supported mother code size (N max ) supported by the wireless communication network (e.g., 512, 1024, etc.).

[0112] For example, the mother code size N can be determined as the minimum of: a minimum power of two that is not less than K / R min , e.g., 2 Xgenerated) (e.g., N R ) that is not less than N E (e.g., E or E / 2) (e.g., represented by 2 X ) that is not less than N E ) and a maximum mother code size (N max ) supported for transmitting data. In other words, the mother code size can be determined according to the following equation: N = min(N R , N E , N max ).

[0113] For example, assume K = 32, R = 1 / 6, E = 384, and N max = 512. In such a case, since 256 is the minimum among (N R = 256, N E = 512, N max = 512), the wireless communication device can determine the target encoded block size N to be 256 (i.e., 2 8 ).

[0114] According to aspects, the wireless communication device can then encode the bitstream using a polar code of size (N, K) at a first encoding rate (e.g., 1 / 3) and store the encoded bits in a circular buffer of size N, for example, as shown in Figure 13 .

[0115] According to particular aspects, the wireless communication device can then perform rate matching on the encoded bitstream stored in the circular buffer. According to particular aspects, the rate matching can involve one of puncturing, repeating, or shortening certain bits in the stored encoded bits, for example, as shown in Figure 14A -C.

[0116] Figure 14A Puncturing of a block is shown according to particular aspects of the disclosure. For example, as shown, the wireless communication device can determine that P bits of the stored encoded bits need to be punctured (e.g., when N > E). Thus, starting from the zeroth position of the circular buffer, the wireless communication device can puncture bits in the circular buffer up to the P - 1 position in the circular buffer. According to particular aspects, at the receiving end (e.g., in a decoder of a receiving device), the values of the log-likelihood ratios (LLRs) in the punctured positions can be set to zero. Further, since the decoder does not have any operations to perform on the first P punctured encoded bits, the effective decoding block size in the decoder can be reduced to N - P. Thus, the decoding latency and complexity can be reduced accordingly.

[0117] Figure 14B Puncturing, repetition, or shortening of certain bits of the encoded bits stored in the circular buffer can be performed by the wireless communication device, for example, as shown in

[0118] Figure 14C Repetition of R bits of the stored encoded bits can be determined by the wireless communication device, for example, as shown in Figure 14C

[0119] As noted above, rate matching can involve puncturing, repetition, or shortening of certain bits of the encoded bits stored in the circular buffer, for example, as shown in Figure 15 Whether to use puncturing, repetition, or shortening can be determined by the wireless communication device based at least in part on the mother code size N, the control information size K of the encoded bit stream, and the number E of encoded bits for transmission.

[0120] For example, if E > N, the wireless communication device can puncture E - N (E minus N) encoded bits from the circular buffer, for example, as shown in Figure 15 For example, if E < N, the wireless communication device can repeat E - N (E minus N) encoded bits from the circular buffer, for example, as shown in bits bits ​​) to perform rate matching. According to a particular aspect, the N - E encoded bits (e.g., P bits .

[0121] According to a particular aspect, if E < N, the wireless communication device can perform rate matching by puncturing or shortening particular bits of the stored encoded bits. For example, if E < N and K / E <= β (where β is a real value whose value is less than 1 and greater than 0), the wireless communication device starts at the zeroth position in the circular buffer and proceeds clockwise around the circular buffer to puncture N - E encoded bits (e.g., P Figure 15 ) based on the polar code (N, K) as shown in bits FIG. 8B. According to aspects, a typical value of β is 7 / 16.

[0122] According to aspects, if E < N and K / E > β, the wireless communication device starts at position N - 1 in the circular buffer and proceeds counterclockwise around the circular buffer to shorten N - E encoded bits (e.g., P Figure 15 ) based on the polar code (N, K) as shown in bits FIG. 8C.

[0123] Figure 16 FIG. 8A shows one example of rate matching in which a wireless communication device punctures bits in a circular buffer according to a particular aspect of the disclosure. According to aspects, the example shown in Figure 16 assumes K = 32, R min = 1 / 6, E = 120, β = 7 / 16, and N max = 512.

[0124] As noted above, the wireless communication device can first determine the mother code size N. To determine N, the wireless communication device can first determine N R to be 256 because 256 represents an integer that is not less than the smallest power of 2 that is not less than 192 (i.e., K / R min or 32*6). Additionally, the wireless communication device can determine N E to be 128 because 128 represents an integer that is not less than the smallest power of 2 that is not less than E (i.e., 120). Thus, the wireless communication device can determine the mother code size N to be equal to 128 because 128 is the smallest value among (N R , N E , N max ).

[0125] According to certain aspects, the wireless communication device can then determine that a number of encoded bits need to be punctured in the circular buffer. For example, since E < N (i.e., 120 < 128) and K / E < 7 / 16 (i.e., 32 / 120 < 7 / 16), the wireless communication device can determine that 8 bits (e.g., N - E) need to be punctured. Thus, as shown in Figure 16

[0126] Figure 17 One example of rate matching of bits in a circular buffer in which a wireless communication device repeats is shown according to certain aspects of the disclosure. According to aspects, Figure 17 the example shown in min max assumes K = 32, R R = 1 / 6, E = 384, β = 7 / 16, and N min = 512.

[0127] As noted above, the wireless communication device can first determine the mother code size (N). To determine N, the wireless communication device can first determine N R to be 256, since 256 represents an integer that is not smaller than the smallest power of 2 that is not smaller than 192 (i.e., K / R min or 32*6). Additionally, the wireless communication device can determine N E to be 512, since 512 represents an integer that is not smaller than the smallest power of 2 that is not smaller than E (i.e., 384). Thus, the wireless communication device can determine the mother code size N to be equal to 256, since 256 is the smallest value in (256, 512, 512) (i.e., min(N R ,N E ,N max )).

[0128] According to certain aspects, the wireless communication device can then determine that a number of encoded bits need to be repeated in the circular buffer. For example, since E > N (i.e., 384 > 256), the wireless communication device can determine that 128 bits (e.g., E - N) starting from the zeroth position in the circular buffer and proceeding clockwise around the circular buffer up to position 127 need to be repeated based on the polar code (256, 32). According to certain aspects, the wireless communication device can repeat these 128 bits at the end of the stream of encoded bits stored in the circular buffer.

[0129] The methods disclosed herein comprise one or more steps or actions for achieving the described method. The method steps and / or actions can be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of steps or actions is specified, the order and / or use of specific steps and / or actions can be modified without departing from the scope of the claims.

[0130] According to an aspect, the techniques described above provide an efficient rate matching algorithm with a good trade-off between decoding complexity and decoding performance. For example, by puncturing, repeating, or shortening encoded bits using the techniques described above before transmission, the decoding complexity and latency at a receiving device can be reduced because the bits do not need to be decoded, which in turn saves processing resources and power at the receiving device.

[0131] As used herein, a phrase referring to "at least one of a list of items means any combination of those items, including single members. As an example, "at least one of a, b, or c" is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c, as well as any combination of items from a, b, and c (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b, b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b, and c).

[0132] As used herein, the term "determining" encompasses a wide variety of actions. For example, "determining" can include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like. Also, "determining" can include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like. Also, "determining" can include resolving, selecting, choosing, establishing and the like.

[0133] In some cases, rather than actually transmitting frames, a device can have an interface for outputting frames for transmission. For example, a processor can output frames for transmission to an RF front end via a bus interface. Similarly, rather than actually receiving frames, a device can have an interface for obtaining frames received from another device. For example, a processor can obtain (or receive) frames for transmission from an RF front end via a bus interface.

[0134] The various operations of methods described above can be performed by any suitable unit capable of performing the corresponding functions. A unit can include various hardware and / or software components and / or modules, including but not limited to a circuit, an application-specific integrated circuit (ASIC), or a processor. As an overview, where operations are illustrated in the figures, those operations can have corresponding counterpart means-plus-function components with similar numbering.

[0135] For example, the means for transmitting, the means for receiving, the means for determining, the means for performing (e.g., rate matching), the means for encoding, the means for puncturing, the means for repeating, the means for shortening, and / or the means for generating can include one or more processors or antennas at the BS 110 or the UE 120, such as the transmit processor 220, the controller / processor 240, the receive processor 238, or the antenna 234 at the BS 110 or the transmit processor 264, the controller / processor 280, the receive processor 258, or the antenna 252 at the UE 120.

[0136] The various illustrative logical blocks, modules, and circuits described in connection with the disclosure can be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor can be a microprocessor, but in the alternative, the processor can be any commercially available processor, controller, microcontroller, or state machine. A processor can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0137] If implemented in hardware, an example hardware configuration can include a processing system in a wireless node. The processing system can be implemented with a bus architecture. There can be various buses, such as an address bus, a data bus, a control bus, and the like, that are interconnected to one another via various busses and bridges. The buses can link various circuits of the processing system, including processors, machine-readable media, and bus interfaces. The bus interfaces can be used to connect the network adapter to the processing system via the buses, in particular. The network adapter can be used to implement the PHY layer signal processing functions. In the case of the user equipment 120 (see Figure 1 ) a user interface (e.g., keypad, display, mouse, joystick, etc.) can also be connected to the bus. The bus can further link various other circuits, such as timing sources, peripherals, voltage regulators, power management circuits, and the like, which are well-known in the art, and thus will not be described any further. The processor can be implemented with one or more general-purpose and / or special-purpose processors. Examples include microprocessors, microcontrollers, DSP processors, and other circuitry that can execute software. Those skilled in the art will recognize how to best implement the described functionality for the processing system, depending on the particular application and general design constraints imposed on the overall system.

[0138] If implemented in software, the functions can be stored or transmitted over as one or more instructions or code on a computer-readable medium. Software shall be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Computer-readable media include both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. The processor can be responsible for managing the bus and general processing, including the execution of software modules stored on the machine-readable storage media. A computer-readable storage medium can be coupled with the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral with the processor. By way of example, the machine-readable media can include a transmission line, a carrier wave modulated by data, and / or a computer readable storage medium with instructions stored thereon separate from the wireless node, all of which can be accessed via the bus. Alternatively, or in addition, the machine-readable media, or magnetic storage devices including the computer-readable storage media, can be integrated in the processor, such as the case can be with cache and / or general register files. Examples of machine- readable storage media can include RAM (random access memory), flash memory, ROM (read only memory), PROM (programmable read only memory), EPROM (erasable programmable read only memory), EEPROM (electrically erasable programmable read only memory), registers, magnetic disks, optical disks, hard drives, or any other suitable storage medium, or any combination thereof. The machine-readable media can be embodied in a computer-program product.

[0139] A software module can comprise a single instruction, or many instructions, and can be distributed over several different code segments, among different programs, and across multiple storage media. The computer-readable media can comprise a number of software modules. The software modules include instructions that, when executed by an apparatus such as a processor, cause the processing system to perform various functions. The software modules can include a transmission module and a receiving module. Each software module can reside in a single storage device or be distributed across multiple storage devices. By way of example, a software module can be loaded into RAM from a hard drive when a triggering event occurs. During execution of the software module, the processor can load some of the instructions into cache to increase access speed. One or more cache lines can then be loaded into a general register file for execution by the processor. When referring to the functionality of a software module below, it will be understood that such functionality is implemented by the processor when executing instructions from that software module.

[0140] Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray® disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Thus, in some aspects computer-readable media can comprise non-transitory computer-readable media (e.g., tangible media). In addition, for other aspects computer-readable media can comprise transitory computer- readable media (e.g., signals). Combinations of the above should also be included within the scope of computer-readable media.

[0141] Further, it should be appreciated that modules and / or other appropriate means for performing the methods and techniques described herein can be downloaded and / or otherwise obtained by a user terminal and / or base station as applicable. For example, such a device can be coupled to a server for performing such methods, passing the method information over a storage medium as indicated above, such as on a diskette, on a memory stick, etc. Alternatively, methods described herein can be provided via storage means (e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc.), such that a user terminal and / or base station can obtain the methods via coupling or providing the storage means to the device.

[0142] It should be understood that the claims are not limited to the precise arrangements and instrumentalities described above. Various modifications, changes, and variations can be made in the arrangements, operations, and details of the methods and apparatus described above without departing from the scope of the claims.​

Claims

1. A method of wireless communication performed by a wireless communication device using a radio access technology (RAT), comprising: The mother code size N for transmitting the encoded bit stream is determined, the determination being at least in part based on the minimum supported code rate R for transmitting the encoded bit stream. min The control information size K of the encoded bit stream, the number E of encoded bits used for transmission, and the maximum supported master code size N. max Wherein, the size N of the mother code is determined according to N = min(N R N E N max To determine N R Not less than K / R min The smallest power of 2 integer, N E It is the smallest power of 2 that is not less than E; Encoding a bit stream using a polar code of size (N, K); Performing rate matching on the encoded bit stream based on a cyclic buffer, at least partially based on a comparison between the mother code size N and the number E of encoded bits to be transmitted, wherein performing the rate matching includes puncturing a second number of encoded bits if E < N and K / E <= 7 / 16, and shortening a third number of encoded bits if E < N and K / E > 7 / 16; and Transmitting the rate-matched encoded bit stream using the RAT.

2. The method according to claim 1, wherein, Performing rate matching on the encoded bit stream includes: repeating a first number of encoded bits if E >= N.

3. The method according to claim 2, wherein, The first number of encoded bits is equal to E - N bits starting from the zero position in the cyclic buffer and advancing clockwise around the cyclic buffer.

4. The method according to claim 2, wherein, The first number of encoded bits is repeated at the end of the encoded bit stream in the cyclic buffer.

5. The method according to claim 1, wherein, The second number of encoded bits is equal to N - E bits starting from the zero position in the cyclic buffer and advancing clockwise around the cyclic buffer.

6. The method according to claim 1, wherein, The third number of encoded bits is equal to N - E bits starting from the position N - 1 in the cyclic buffer and advancing counterclockwise around the cyclic buffer.

7. The method according to claim 1, wherein, The minimum supported code rate is 1 / 6.

8. An apparatus for wireless communication performed by a wireless communication device using a radio access technology (RAT), comprising: At least one processor configured to cause the apparatus to perform the following operations: The mother code size N for transmitting the encoded bit stream is determined, the determination being at least in part based on the minimum supported code rate R for transmitting the encoded bit stream. min The control information size K of the encoded bit stream, the number E of encoded bits used for transmission, and the maximum supported master code size N. max The mother code size N is determined according to N = min(N R N E N max To determine N R Not less than K / R min The smallest power of 2 integer, N E It is the smallest power of 2 that is not less than E; Encoding a bit stream using a polar code of size (N, K); Performing rate matching on the encoded bit stream based on a cyclic buffer, at least partially based on a comparison between the mother code size N and the number E of encoded bits to be transmitted, wherein, for performing the rate matching, the at least one processor is configured to cause the apparatus to puncture a second number of encoded bits if E < N and K / E <= 7 / 16, and shorten a third number of encoded bits if E < N and K / E > 7 / 16; and Transmitting the rate-matched encoded bit stream using the RAT.

9. The apparatus according to claim 8, wherein, The at least one processor is configured to cause the apparatus to perform the following operation: performing the rate matching on the encoded bit stream by repeating a first number of encoded bits if E >= N.

10. The apparatus according to claim 9, wherein, The first number of encoded bits is equal to E - N bits starting from the zero position in the cyclic buffer and advancing clockwise around the cyclic buffer.

11. The apparatus according to claim 9, wherein, The at least one processor is configured to cause the apparatus to perform the following operation: repeating the first number of encoded bits at the end of the encoded bit stream in the cyclic buffer.

12. The apparatus according to claim 8, wherein, The second number of encoded bits is equal to N - E bits starting from the zero position in the cyclic buffer and advancing clockwise around the cyclic buffer.

13. The apparatus according to claim 8, wherein, The third quantity of encoded bits is equal to N - E bits starting from position N - 1 in the circular buffer and proceeding counterclockwise around the circular buffer.

14. The apparatus according to claim 8, wherein, The minimum supported code rate is 1 / 6.

15. An apparatus for wireless communication performed by a wireless communication device using a radio access technology (RAT), comprising: A unit for determining the mother code size N for transmitting the encoded bit stream, the determination being at least in part based on the minimum support code rate R for transmitting the encoded bit stream. min The control information size K of the encoded bit stream, the number E of encoded bits used for transmission, and the maximum supported master code size N. max The mother code size N is determined according to N = min(N R N E N max To determine N R Not less than K / R min The smallest power of 2 integer, N E It is the smallest power of 2 that is not less than E; a unit for encoding a bit stream using a polar code of size (N, K); a unit for performing rate matching on the encoded bit stream based on a circular buffer, at least partially based on a comparison between the mother code size N and the quantity E of encoded bits to be transmitted, wherein the unit for performing rate matching includes a unit for puncturing a second quantity of encoded bits if E < N and K / E <= 7 / 16 and shortening a third quantity of encoded bits if E < N and K / E > 7 / 16; and a unit for transmitting the rate - matched encoded bit stream using the RAT.

16. The apparatus according to claim 15, wherein, The unit for performing rate matching on the encoded bit stream is configured to: repeat a first quantity of encoded bits if E ≥ N.

17. The apparatus according to claim 16, wherein, The first quantity of encoded bits is equal to E - N bits starting from the zero position in the circular buffer and proceeding clockwise around the circular buffer.

18. A non - transitory computer - readable medium for wireless communication performed by a wireless communication device using a radio access technology (RAT), comprising: instructions that, when executed by at least one processor, configure the at least one processor to cause the wireless communication device to perform the following operations: The mother code size N for transmitting the encoded bit stream is determined, the determination being at least in part based on the minimum supported code rate R for transmitting the encoded bit stream. min The control information size K of the encoded bit stream, the number E of encoded bits used for transmission, and the maximum supported master code size N. max Wherein, the size N of the mother code is determined according to N = min(N R N E N max To determine N R Not less than K / R min The smallest power of 2 integer, N E It is the smallest power of 2 that is not less than E; encode a bit stream using a polar code of size (N, K); perform rate matching on the encoded bit stream based on a circular buffer, at least partially based on a comparison between the mother code size N and the quantity E of encoded bits to be transmitted, wherein, for performing the rate matching, the instructions configure the at least one processor to puncture a second quantity of encoded bits if E < N and K / E <= 7 / 16, and shorten a third quantity of encoded bits if E < N and K / E > 7 / 16; and transmit the rate - matched encoded bit stream using the RAT.

19. The non-transitory computer-readable medium according to claim 18, wherein, The instructions that configure the at least one processor to cause the wireless communication device to perform rate matching on the encoded bit stream configure the at least one processor to cause the wireless communication device to perform the following operations: repeat a first quantity of encoded bits if E ≥ N.

20. The non-transitory computer-readable medium according to claim 19, wherein, The first quantity of encoded bits is equal to E - N bits starting from the zero position in the circular buffer and proceeding clockwise around the circular buffer.