WO2018161762A1 - Conception de codage polaire pour la performance et la latence - Google Patents

Conception de codage polaire pour la performance et la latence Download PDF

Info

Publication number
WO2018161762A1
WO2018161762A1 PCT/CN2018/075588 CN2018075588W WO2018161762A1 WO 2018161762 A1 WO2018161762 A1 WO 2018161762A1 CN 2018075588 W CN2018075588 W CN 2018075588W WO 2018161762 A1 WO2018161762 A1 WO 2018161762A1
Authority
WO
WIPO (PCT)
Prior art keywords
polar
polar channels
information bits
channels
channel
Prior art date
Application number
PCT/CN2018/075588
Other languages
English (en)
Inventor
Jian Li
Changlong Xu
Chao Wei
Jilei Hou
Original Assignee
Qualcomm Incorporated
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Incorporated filed Critical Qualcomm Incorporated
Publication of WO2018161762A1 publication Critical patent/WO2018161762A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3707—Adaptive decoding and hybrid decoding, e.g. decoding methods or techniques providing more than one decoding algorithm for one code
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3723—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using means or methods for the initialisation of the decoder

Definitions

  • the following relates generally to wireless communication, and more specifically to polar coding design for performance and latency.
  • Wireless communications systems are widely deployed to provide various types of communication content such as voice, video, packet data, messaging, broadcast, and so on. These systems may be capable of supporting communication with multiple users by sharing the available system resources (e.g., time, frequency, and power) .
  • multiple-access systems include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, and orthogonal frequency division multiple access (OFDMA) systems, (e.g., a Long Term Evolution (LTE) system, or a New Radio (NR) system) .
  • CDMA code division multiple access
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • OFDMA orthogonal frequency division multiple access
  • LTE Long Term Evolution
  • NR New Radio
  • a wireless multiple-access communications system may include a number of base stations or access network nodes, each simultaneously supporting communication for multiple communication devices, which may be otherwise known as user equipment (UE) .
  • UE user equipment
  • a UE or base station may encode information bits of an input vector to obtain a codeword for transmission.
  • the encoding may be performed using a polar coding technique.
  • a polar code design e.g., a density evolution (DE) design
  • the polar encoding process may involve enhancing reliability of a successful transmission and reception of the codeword.
  • DE density evolution
  • Such techniques may be computationally complex and resource intensive, which may lead to latency issues during encoding and decoding.
  • a wireless device such as a base station or a user equipment (UE) may decode a polar encoded codeword using a successive cancelation (SC) or successive cancelation list (SCL) decoder.
  • SC successive cancelation
  • SCL successive cancelation list
  • channel indices of the decoder may be assigned a bit type (e.g., information bit, frozen bit, parity bit, etc. ) .
  • the decoder may receive an indication of the channel indices that are assigned as the information bits in the codeword and in some cases, the decoder may also determine, receiver, or otherwise obtain a default value for any assigned frozen bits.
  • the decoder may determine that the channel indices assigned as frozen bits preceding the channel index assigned as the first information bit are all the same default value, and may therefore refrain from performing decoding operations to decode these frozen bits.
  • an encoder may assign the first information bit to a channel with a higher channel index but a lower reliability. In such cases, the channel index assigned as the first information bit may have more frozen bits preceding it, and the decoder may therefore reduce the number of decoding operations to decode the codeword.
  • the encoder may select the polar channels for assigning the information bits based on performance and latency thresholds.
  • a method for wireless communication may include receiving a codeword comprising an encoded plurality of information bits, determining respective polar channels for decoding each of the encoded plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, and decoding the encoded plurality of information bits based at least in part on the determining.
  • the apparatus may include means for receiving a codeword comprising an encoded plurality of information bits, means for determining respective polar channels for decoding each of the encoded plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, and means for decoding the encoded plurality of information bits based at least in part on the determining.
  • the apparatus may include a processor, memory in electronic communication with the processor, and instructions stored in the memory.
  • the instructions may be operable to cause the processor to receive a codeword comprising an encoded plurality of information bits, determine respective polar channels for decoding each of the encoded plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, and decode the encoded plurality of information bits based at least in part on the determining.
  • a non-transitory computer readable medium for wireless communication may include instructions operable to cause a processor to receive a codeword comprising an encoded plurality of information bits, determine respective polar channels for decoding each of the encoded plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, and decode the encoded plurality of information bits based at least in part on the determining.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for skipping decoding of one or more frozen bits of the codeword based at least in part on a channel index corresponding to a first information bit of the encoded plurality of information bits.
  • a reliability metric associated with the first information bit may be less than a reliability metric associated with a frozen bit of the codeword.
  • the channel index corresponding to the first information bit may be greater than a channel index corresponding to the frozen bit.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for comparing a performance of a selected set of polar channels with the performance threshold, wherein the respective polar channels may be determined based at least in part on the comparison.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for comparing a latency of a selected set of polar channels with the latency threshold, wherein the respective polar channels may be determined based at least in part on the comparison.
  • decoding the encoded plurality of information bits comprises: mapping each information bit of the encoded plurality of information bits to a respective polar channel of the decoder.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for performing a decoding process based at least in part on the mapping.
  • determining the respective polar channels comprises: determining respective reliability metrics for each polar channel of a plurality of polar channels of the decoder.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for selecting a set of polar channels of the plurality of polar channels based at least in part on the respective reliability metrics.
  • determining the respective polar channels comprises: determining a set of polar channels of a plurality of polar channels of the decoder based at least in part on a lookup table.
  • the lookup table may be based at least in part on a length of the decoder and a number of information bits for decoding.
  • a method for wireless communication may include identifying a plurality of information bits for encoding, determining respective polar channels for encoding each of the plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, encoding the plurality of information bits based at least in part on the determining, and transmitting a codeword comprising the encoded plurality of information bits.
  • the apparatus may include means for identifying a plurality of information bits for encoding, means for determining respective polar channels for encoding each of the plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, means for encoding the plurality of information bits based at least in part on the determining, and means for transmitting a codeword comprising the encoded plurality of information bits.
  • the apparatus may include a processor, memory in electronic communication with the processor, and instructions stored in the memory.
  • the instructions may be operable to cause the processor to identify a plurality of information bits for encoding, determine respective polar channels for encoding each of the plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, encode the plurality of information bits based at least in part on the determining, and transmit a codeword comprising the encoded plurality of information bits.
  • a non-transitory computer readable medium for wireless communication may include instructions operable to cause a processor to identify a plurality of information bits for encoding, determine respective polar channels for encoding each of the plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof, encode the plurality of information bits based at least in part on the determining, and transmit a codeword comprising the encoded plurality of information bits.
  • determining the respective polar channels comprises: determining respective reliability metrics for each polar channel of a plurality of polar channels of the encoder.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for selecting a set of polar channels of the plurality of polar channels based at least in part on the respective reliability metrics.
  • a reliability metric of a polar channel of the selected set of polar channels may be less than a reliability metric of an unselected polar channel of the plurality of polar channels.
  • a channel index corresponding to the polar channel may be greater than a channel index corresponding to the unselected polar channel.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for comparing a performance of a selected set of polar channels with the performance threshold, wherein the respective polar channels may be determined based at least in part on the comparison.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for comparing a latency of a selected set of polar channels with the latency threshold, wherein the respective polar channels may be determined based at least in part on the comparison.
  • encoding the plurality of information bits comprises: mapping each information bit of the plurality of information bits to a respective polar channel of the encoder.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for performing an encoding process based at least in part on the mapping.
  • determining the respective polar channels comprises: determining a set of polar channels of a plurality of polar channels of the encoder based at least in part on a lookup table.
  • the lookup table may be based at least in part on a length of the encoder and a number of information bits for encoding.
  • FIG. 1 illustrates an example of a system for wireless communication that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 2 illustrates an example of a device that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 3 illustrates an example of a binary tree that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 4 illustrates an example of a binary tree that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 5 illustrates an example of a channel reliability plot that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 6 illustrates an example of a channel reliability plot that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 7 illustrates an example of a method flow that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIGs. 8 through 10 show block diagrams of a device that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIG. 11 illustrates a block diagram of a system including a wireless device that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • FIGs. 12 through 13 illustrate methods for polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • a wireless device may encode information bits of an input vector using polar coding techniques. Such techniques may involve calculating reliability metrics for each polar channel of the encoder and assigning information bits to respective polar channels based on the reliability metrics. Some polar channels may be assigned other bit types, such as parity bits or frozen bits and the output codeword may include more bits than the number of bits of the input vector (i.e., the output codeword has a longer bit length than the input vector. For example, the UE or base station may assign the information bits to the polar channels with the highest reliability metrics, and may assign frozen bits (or parity bits) to the other polar channels.
  • polar coding techniques may involve calculating reliability metrics for each polar channel of the encoder and assigning information bits to respective polar channels based on the reliability metrics.
  • Some polar channels may be assigned other bit types, such as parity bits or frozen bits and the output codeword may include more bits than the number of bits of the input vector (i.e., the output codeword has a longer bit length than the input vector.
  • the codeword may then be transmitted to a receiving device and a decoder of the receiving device may decode the codeword.
  • the decoder may skip decoding operations for any frozen bits of the codeword that precede the first information bit. For instance, due to the polar coding process, the frozen bits preceding the first information bit in the codeword are known to the decoder and thus, decoding of these frozen bits may be skipped. Further, the more polar channels before the first information bit assigned to frozen bits may allow for a reduced number of decoding operations to be performed.
  • decoding latency may still be high as the number of decoding operations increases the lower the channel index of the first information bit.
  • the encoder may assign information bits based on both performance (e.g., using reliability metrics) and latency. For example, the encoder may assign the information bits by shifting the first information bit to a channel with a higher channel index, which may result in a decreased overall reliability (i.e., lower performance) but the latency and complexity of the decoding may be reduced.
  • the encoder may determine a set of polar channels associated with the highest reliability metrics, and may iteratively replace the polar channel in the set with the lowest channel index with a polar channel having a higher channel index, but the next highest reliability metric, for example.
  • the encoder may determine the set of channels to use for the information bits based on a performance threshold, a latency threshold, or a combination thereof.
  • aspects of the disclosure are initially described in the context of a wireless communications system. Aspects of the disclosure are then described with regards to a device for encoding or decoding polar codes. Binary trees, channel reliability plots, and a process flow illustrate further aspects supporting polar coding design for performance and latency. Aspects of the disclosure are additionally illustrated by and described with reference to apparatus diagrams, system diagrams, and flowcharts that relate to polar coding design for performance and latency.
  • FIG. 1 illustrates an example of a wireless communications system 100 in accordance with various aspects of the present disclosure.
  • the wireless communications system 100 includes base stations 105, UEs 115, and a core network 130.
  • the wireless communications system 100 may be a Long Term Evolution (LTE) , LTE-Advanced (LTE-A) network, or a New Radio (NR) network.
  • LTE Long Term Evolution
  • LTE-A LTE-Advanced
  • NR New Radio
  • wireless communications system 100 may support enhanced broadband communications, ultra-reliable (i.e., mission critical) communications, low latency communications, and communications with low-cost and low-complexity devices.
  • Base stations 105 and UEs 115 may use a polar code design to encode information bits of an input vector to obtain a codeword for transmission.
  • the base stations 105 and UEs 115 may reduce decoding latency for these transmissions by shifting the first information bit to a higher channel index.
  • a decoder may determine all bits (e.g., frozen bits) before the first information bit without having to perform decoding operations for each of the channels assigned to frozen bits that precede first information bit.
  • Base stations 105 may wirelessly communicate with UEs 115 via one or more base station antennas. In some cases, the transmissions may be encoded using a polar code design. Each base station 105 may provide communication coverage for a respective geographic coverage area 110. Communication links 125 shown in wireless communications system 100 may include uplink transmissions from a UE 115 to a base station 105, or downlink transmissions, from a base station 105 to a UE 115. Control information and data may be multiplexed on an uplink channel or downlink according to various techniques. Control information and data may be multiplexed on a downlink channel, for example, using time division multiplexing (TDM) techniques, frequency division multiplexing (FDM) techniques, or hybrid TDM-FDM techniques. In some examples, the control information transmitted during a transmission time interval (TTI) of a downlink channel may be distributed between different control regions in a cascaded manner (e.g., between a common control region and one or more UE-specific control regions) .
  • TTI
  • UEs 115 may be dispersed throughout the wireless communications system 100, and each UE 115 may be stationary or mobile.
  • a UE 115 may also be referred to as a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a wireless communications device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a client, or some other suitable terminology.
  • a UE 115 may also be a cellular phone, a personal digital assistant (PDA) , a wireless modem, a wireless communication device, a handheld device, a tablet computer, a laptop computer, a cordless phone, a personal electronic device, a handheld device, a personal computer, a wireless local loop (WLL) station, an Internet of Things (IoT) device, an Internet of Everything (IoE) device, a machine type communication (MTC) device, an appliance, an automobile, or the like.
  • PDA personal digital assistant
  • WLL wireless local loop
  • IoT Internet of Things
  • IoE Internet of Everything
  • MTC machine type communication
  • a UE 115 may also be able to communicate directly with other UEs (e.g., using a peer-to-peer (P2P) or device-to-device (D2D) protocol) .
  • P2P peer-to-peer
  • D2D device-to-device
  • One or more of a group of UEs 115 utilizing D2D communications may be within the coverage area 110 of a cell. Other UEs 115 in such a group may be outside the coverage area 110 of a cell, or otherwise unable to receive transmissions from a base station 105.
  • groups of UEs 115 communicating via D2D communications may utilize a one-to-many (1: M) system in which each UE 115 transmits to every other UE 115 in the group.
  • a base station 105 facilitates the scheduling of resources for D2D communications.
  • D2D communications are carried out independent of a base station 105.
  • Some UEs 115 may be low cost or low complexity devices, and may provide for automated communication between machines, i.e., Machine-to-Machine (M2M) communication.
  • M2M or MTC may refer to data communication technologies that allow devices to communicate with one another or a base station without human intervention.
  • M2M or MTC may refer to communications from devices that integrate sensors or meters to measure or capture information and relay that information to a central server or application program that can make use of the information or present the information to humans interacting with the program or application.
  • Some UEs 115 may be designed to collect information or enable automated behavior of machines. Examples of applications for MTC devices include smart metering, inventory monitoring, water level monitoring, equipment monitoring, healthcare monitoring, wildlife monitoring, weather and geological event monitoring, fleet management and tracking, remote security sensing, physical access control, and transaction-based business charging.
  • an MTC device may operate using half-duplex (one-way) communications at a reduced peak rate. MTC devices may also be configured to enter a power saving “deep sleep” mode when not engaging in active communications. In some cases, MTC or IoT devices may be designed to support mission critical functions and wireless communications system may be configured to provide ultra-reliable communications for these functions.
  • Base stations 105 may communicate with the core network 130 and with one another. For example, base stations 105 may interface with the core network 130 through backhaul links 132 (e.g., S1, etc. ) . Base stations 105 may communicate with one another over backhaul links 134 (e.g., X2, etc. ) either directly or indirectly (e.g., through core network 130) . Base stations 105 may perform radio configuration and scheduling for communication with UEs 115, or may operate under the control of a base station controller (not shown) . In some examples, base stations 105 may be macro cells, small cells, hot spots, or the like. Base stations 105 may also be referred to as evolved NodeBs (eNBs) 105.
  • eNBs evolved NodeBs
  • a base station 105 may be connected by an S1 interface to the core network 130.
  • the core network may be an evolved packet core (EPC) , which may include at least one mobility management entity (MME) , at least one serving gateway (S-GW) , and at least one Packet Data Network (PDN) gateway (P-GW) .
  • the MME may be the control node that processes the signaling between the UE 115 and the EPC. All user Internet Protocol (IP) packets may be transferred through the S-GW, which itself may be connected to the P-GW.
  • the P-GW may provide IP address allocation as well as other functions.
  • the P-GW may be connected to the network operators IP services.
  • the operators IP services may include the Internet, the Intranet, an IP Multimedia Subsystem (IMS) , and a Packet-Switched (PS) Streaming Service.
  • IMS IP Multimedia Subsystem
  • PS Packet-Switched
  • the core network 130 may provide user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions.
  • IP Internet Protocol
  • At least some of the network devices, such as base station 105 may include subcomponents such as an access network entity, which may be an example of an access node controller (ANC) .
  • Each access network entity may communicate with a number of UEs 115 through a number of other access network transmission entities, each of which may be an example of a smart radio head, or a transmission/reception point (TRP) .
  • TRP transmission/reception point
  • various functions of each access network entity or base station 105 may be distributed across various network devices (e.g., radio heads and access network controllers) or consolidated into a single network device (e.g., a base station 105) .
  • Wireless communications system 100 may operate in an ultra-high frequency (UHF) frequency region using frequency bands from 700 MHz to 2600 MHz (2.6 GHz) , although some networks (e.g., a wireless local area network (WLAN) ) may use frequencies as high as 4 GHz. This region may also be known as the decimeter band, since the wavelengths range from approximately one decimeter to one meter in length.
  • UHF waves may propagate mainly by line of sight, and may be blocked by buildings and environmental features. However, the waves may penetrate walls sufficiently to provide service to UEs 115 located indoors.
  • Wireless communications system 100 may also utilize extremely high frequency (EHF) portions of the spectrum (e.g., from 30 GHz to 300 GHz) . This region may also be known as the millimeter band, since the wavelengths range from approximately one millimeter to one centimeter in length.
  • EHF antennas may be even smaller and more closely spaced than UHF antennas. In some cases, this may facilitate use of antenna arrays within a UE 115 (e.g., for directional beamforming) .
  • EHF transmissions may be subject to even greater atmospheric attenuation and shorter range than UHF transmissions.
  • wireless communications system 100 may support millimeter wave (mmW) communications between UEs 115 and base stations 105.
  • Devices operating in mmW or EHF bands may have multiple antennas to allow beamforming. That is, a base station 105 may use multiple antennas or antenna arrays to conduct beamforming operations for directional communications with a UE 115.
  • Beamforming (which may also be referred to as spatial filtering or directional transmission) is a signal processing technique that may be used at a transmitter (e.g., a base station 115) to shape and/or steer an overall antenna beam in the direction of a target receiver (e.g., a UE 115) . This may be achieved by combining elements in an antenna array in such a way that transmitted signals at particular angles experience constructive interference while others experience destructive interference.
  • MIMO wireless systems use a transmission scheme between a transmitter (e.g., a base station 105) and a receiver (e.g., a UE 115) , where both transmitter and receiver are equipped with multiple antennas.
  • Some portions of wireless communications system 100 may use beamforming.
  • base station 105 may have an antenna array with a number of rows and columns of antenna ports that the base station 105 may use for beamforming in its communication with UE 115. Signals may be transmitted multiple times in different directions (e.g., each transmission may be beamformed differently) .
  • a mmW receiver e.g., a UE 115
  • the antennas of a base station 105 or UE 115 may be located within one or more antenna arrays, which may support beamforming or MIMO operation.
  • One or more base station antennas or antenna arrays may be collocated at an antenna assembly, such as an antenna tower.
  • antennas or antenna arrays associated with a base station 105 may be located in diverse geographic locations.
  • a base station 105 may multiple use antennas or antenna arrays to conduct beamforming operations for directional communications with a UE 115.
  • wireless communications system 100 may be a packet-based network that operate according to a layered protocol stack.
  • PDCP Packet Data Convergence Protocol
  • a Radio Link Control (RLC) layer may in some cases perform packet segmentation and reassembly to communicate over logical channels.
  • RLC Radio Link Control
  • a Medium Access Control (MAC) layer may perform priority handling and multiplexing of logical channels into transport channels.
  • the MAC layer may also use Hybrid ARQ (HARQ) to provide retransmission at the MAC layer to improve link efficiency.
  • HARQ Hybrid ARQ
  • the Radio Resource Control (RRC) protocol layer may provide establishment, configuration, and maintenance of an RRC connection between a UE 115 and a network device 105-c, network device 105-b, or core network 130 supporting radio bearers for user plane data.
  • RRC Radio Resource Control
  • PHY Physical
  • a shared radio frequency spectrum band may be utilized in an NR shared spectrum system.
  • an NR shared spectrum may utilize any combination of licensed, shared, and unlicensed spectrums, among others.
  • the flexibility of eCC symbol duration and subcarrier spacing may allow for the use of eCC across multiple spectrums.
  • NR shared spectrum may increase spectrum utilization and spectral efficiency, specifically through dynamic vertical (e.g., across frequency) and horizontal (e.g., across time) sharing of resources.
  • wireless system 100 may utilize both licensed and unlicensed radio frequency spectrum bands.
  • wireless system 100 may employ LTE License Assisted Access (LTE-LAA) or LTE Unlicensed (LTE U) radio access technology or NR technology in an unlicensed band such as the 5Ghz Industrial, Scientific, and Medical (ISM) band.
  • LTE-LAA LTE License Assisted Access
  • LTE U LTE Unlicensed
  • NR NR technology
  • an unlicensed band such as the 5Ghz Industrial, Scientific, and Medical (ISM) band.
  • wireless devices such as base stations 105 and UEs 115 may employ listen-before-talk (LBT) procedures to ensure the channel is clear before transmitting data.
  • LBT listen-before-talk
  • operations in unlicensed bands may be based on a CA configuration in conjunction with CCs operating in a licensed band.
  • Operations in unlicensed spectrum may include downlink transmissions, uplink transmissions, or both.
  • Duplexing in unlicensed spectrum may be based on frequency division du
  • FIG. 2 illustrates an example of a device 200 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • the device 200 may be any device within a wireless communications system 100 that performs an encoding or decoding process.
  • the device 200 may be a UE 115 or base station 105, as described in FIG. 1.
  • device 200 includes a memory 205, an encoder/decoder 210, and a transmitter/receiver 215.
  • Bus 220 may connect memory 205 to encoder/decoder 210 and bus 225 may connect encoder/decoder 210 to transmitter/receiver 215.
  • device 200 may have data stored in memory 205 to be transmitted to another device, such as a UE 115 or base station 105.
  • the device 200 may retrieve from memory 205 data (e.g., in the form of an input vector) for transmission.
  • the data may include a number of information bits provided from memory 205 to encoder/decoder 210 via bus 220.
  • the number of information bits may be represented as a value ‘k, ’ as shown.
  • the encoder/decoder 210 may encode the number of information bits and output a codeword having a length ‘N, ’ which may be different than or the same as k.
  • the bits that are not allocated as information bits i.e., N –k bits
  • the bits that are not allocated as information bits may be assigned as frozen bits or parity bits.
  • Frozen bits may be bits of a value (0, 1, etc. ) known to both the encoder and decoder (i.e., the encoder encoding information bits at a transmitter and the decoder decoding the codeword received at a receiver) .
  • device 200 may receive encoded data via receiver 215, and decode the encoded data using decoder 210 to obtain the transmitted data.
  • the decoder 210 may be an example of a successive cancelation list (SCL) decoder.
  • a UE 115 or base station 105 may receive a transmission including a codeword at the receiver 215, and may decode the codeword (e.g., using the decoder 210) .
  • the decoder 210 may be a combination of multiple successive cancelation (SC) decoders. Due to the combination of multiple SC decoders, the the decoder 210 may calculate multiple decoding paths. For example, an SCL decoder of list size L (i.e., the SCL decoder is a combination of L SC decoders) may calculate L decoding paths, and a corresponding path metric for each decoding path.
  • SCL decoder of list size L i.e., the SCL decoder is a combination of L SC decoders
  • the path metric may represent a probability that the corresponding decoding path is represents the set of bits that were encoded and transmitted to the device 200. Therefore, the decoder 210 may select the decoding path with the greatest path metric, and may output the bits corresponding to the selected decoding path as the decoded sets of bits.
  • the decoder 210 may have a number of levels equal to the number of bits in the received codeword. At each level, the decoder 210 may select either a 0 bit or a 1 bit based on a path metric of the 0 bit or the 1 bit. For example, for a codeword of length 3, a first SC decoder may follow a decoding path (1, 0, 1) and calculate a path metric 0.34.
  • a second SC decoder may follow a decoding path (0, 1, 1) and calculate a path metric 0.23.
  • the decoder 210 containing the first and the second SC decoders may output the decoded set of bits (1, 0, 1) based on the greater path metric (i.e., 0.34) corresponding to that decoding path.
  • the decoder 210 may improve decoding latency if it does not need to perform operations to determine every bit in the decoding path. For example, if the decoder 210 includes an indication of a correct decoding path for a first number of bits, the decoder 210 may skip performing computations in order to decode the first number of bits. If a the decoder 210 determines that the first number of bits are all frozen bits, the decoder 210 may determine that the correct decoding path for the first number of bits are the default values associated with frozen bits (e.g., if the default frozen bit value is 0, the correct decoding path for the first number of bits is determined to be all zeros) .
  • the decoder 210 may begin performing operations to decode the rest of the bits of the codeword, as the decoder 210 may not be able to determine the correct decoding path from the first information bit onwards (e.g., because the first information bit may be a 0 or a 1) .
  • FIG. 3 illustrates an example of a binary tree 300 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • Binary tree 300 may represent a decoding process at an SC or SCL decoder, which may be an example of the decoder 210 as described with reference to FIG. 2.
  • Binary tree 300 may include information nodes 305, frozen nodes 310, and intermediate nodes 315. The nodes may be connected via branches 320. Each node may represent a bit or a set of bits, while each branch 320 may represent a computation or a set of computations performed by the SCL decoder.
  • Binary tree 300 may include nodes (e.g., information nodes 305, frozen nodes 310, and intermediate nodes 315) and branches 320, where each intermediate node 315 leads to two branches 320 (e.g., a left branch 320 and a right branch 320) .
  • Each intermediate node 315 may represent a set of bits that are between steps in the decoding process.
  • Each branch 320 of the binary tree may represent a computation performed by the decoder. In some cases, each left branch 320 may represent a given computation (e.g., an F operation) , while each right branch 320 may represent a second computation (e.g., a G operation) .
  • a branch 320 may represent multiple same computations performed during a same clock cycle (e.g., branch 320-a may represent multiple F operations occurring simultaneously during the same clock cycle) .
  • Both information nodes 305 and frozen nodes 310 may represent a decoded bit of a codeword. Further, both the information nodes 305 and the frozen nodes 310 may be referred to as leaf nodes (e.g., because information nodes 305 and frozen nodes 310 may be outputs of the decoding process, and may not lead to branches 320) .
  • the leaf nodes, from left to right, may represent the bits of the codeword.
  • the decoder may perform the operations depth first and then from left to right with respect to binary tree 300.
  • the decoder may perform computations represented by branch 320-a in a first clock cycle, then by branch 320-b in a second clock cycle, and then by branch 320-c in a third clock cycle to decode a first bit represented by the first node (e.g., frozen node 310-a) .
  • the decoder may next perform the computation represented by branch 320-d in a fourth clock cycle to decode a second bit represented by the second node (e.g., frozen node 310-b) .
  • the decoder may continue this process and perform the computations represented by branches 320-e, 320-f, 320-g, 320-h, 320-i, 320-j, 320-k, 320-l, 320-m, and 320-n in order to decode the entire codeword.
  • the number of clock cycles used to decode a codeword may be based on the length of the codeword.
  • An encoder may encode a set of k information bits, which may be referred to as “free” bits, into a larger set of N bits (e.g., a codeword) for transmission, where the rest of the bits in the larger set of N bits are frozen bits.
  • a decoder may receive and decode the set of N bits.
  • the decoding process may be represented by a binary tree 300 with 2 ⁇ N-2 branches 320. Each computation or set of computations represented by a branch 320 may take a clock cycle for the decoder to process. Therefore, the decoding process for the larger set of N bits may take 2 ⁇ N-2 clock cycles.
  • a decoder may receive a set of 4 information bits (e.g., the four information nodes 305-a, 305-b, 305-c, and 305-d) encoded in a larger set of 8 bits (e.g., the full codeword represented by frozen bits 310-a, 310-b, 310-c, and 310-d and information bits 305-a, 305-b, 305-c, and 305-d) .
  • the decoder may take 14 clock cycles to process a set of 8 bits (i.e., traverse the 14 branches 320 of the binary tree) .
  • the decoder may perform the computations to determine a most probable codeword.
  • a decoder may include information that may be used to reduce latency in the decoding process.
  • an encoder and decoder may both include information about information bit location (s) , frozen bit location (s) , and frozen bit value (s) .
  • the encoder and decoder may each include an indication of which bits of the codeword are the information bits or which bits of the codeword are frozen bits (e.g., the decoder may identify that a codeword of length 8 with 4 information bits may first have three frozen bits, followed by one information bit, followed by one frozen bit, followed by three information bits, as represented by information nodes 305 and frozen nodes 310) .
  • the encoder and decoder may include an indication of a default value for the frozen bits (e.g., each frozen bit may be a 0 bit) .
  • the encoder may use the indications when encoding the information in the codeword for transmission and the decoder may use the indications to more reliably decode the information bits of the codeword based on the frozen bits. Additionally, the decoder may use the information to reduce the latency involved in decoding the codeword.
  • FIG. 4 illustrates an example of a binary tree 400 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • Binary tree 400 may represent a decoding process with reduced latency at an SC or SCL decoder, which may be an example of decoder 210 as described with reference to FIG. 2.
  • Binary tree 400 may include information nodes 405, frozen nodes 410, and intermediate nodes 415. The nodes may be connected via branches 420.
  • Each information node 405 may represent an information bit
  • each frozen node 410 may represent a frozen bit
  • each intermediate node 425 may represent a set of bits between decoding steps.
  • Each branch 420 may represent a computation or a set of computations performed by the SCL decoder.
  • an SCL decoder may determine the values of all bits (e.g., represented by frozen nodes 410, not shown) before a first information bit (e.g., represented by information node 405-a) of a codeword.
  • the decoder may determine a channel index for the first information bit (i.e., the information bit transmitted at the lowest channel index, which is represented in binary tree 400 by the information node 405 farthest to the left) .
  • the SCL decoder may know the correct decoding path up to the first information node 405-a.
  • the SCL decoder may include an indication of the default value for the frozen bits.
  • the SCL decoder may determine that all channel indices lower than the first information bit contain frozen bits, and the SCL decoder may follow the decoding path corresponding to these frozen bits. For example, if the SCL decoder identifies that the first information bit, represented by information node 405-a, is at the fourth channel index (i.e., the fourth bit in the codeword) and the default value for frozen bits is a 0 bit, the SCL decoder may determine that the first three bits of the codeword are 0 bits without performing any F or G operations.
  • the SCL decoder may therefore refrain from performing computations represented by branches leading to decoding frozen nodes 410 to the left of the first information node 405-a, and may still decode the first information bit.
  • the SCL decoder may perform the computation represented by branch 420-a in a first clock cycle, the computation represented by branch 420-b in a second clock cycle, and the computation represented by branch 420-c in a third clock cycle to decode information node 405-a.
  • the decoder may reduce the number of cycles it performs to decode a codeword, and thus reduce the decoding latency. If the first information bit has a channel index of ui, the number of cycles reduced may be calculated with the following equation:
  • the number of cycles reduced may be:
  • the decoder may reduce the number of clock cycles by four by refraining from decoding bits represented by frozen nodes 410 that come before the first information bit (e.g., represented by first information node 405-a) with a channel index of four.
  • the decoder may reduce the number of clock cycles more. Therefore, the decoder may reduce the decoding latency by shifting the first information bit to a higher channel index. However, the decoder may determine the channel indices for information bit assignment based also on the reliability of the channels.
  • FIG. 5 illustrates an example of a channel reliability plot 500 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • Channel reliability plot 500 shows a channel reliability (e.g., on a scale from 0 to 10) , which may be referred to as a reliability metric, for each channel index within a 64 bit codeword.
  • Channel reliability plot 500 illustrates a polar coding technique optimizing performance, as the information bits 505 are assigned to the most reliable channels, and the frozen bits 510 are assigned to the rest of the channels.
  • an encoder may transmit a set of 8 information bits 505 in a codeword of 64 bits.
  • the decoder may receive 8 information bits 505 and 56 frozen bits 510 over 64 polar channels, each associated with respective channel indices.
  • the encoder may encode the 8 information bits 505 at the 8 most reliable channel indices (e.g., channel indices 32, 48, 56, 60, 61, 62, 63, and 64) .
  • a decoder may decode the information bits 505 within the codeword, but may refrain from decoding the frozen bits 510 with channel indices lower than the channel index for the first information bit 505 (e.g., the information bit 505 at channel index 32) .
  • the decoder may identify the first information bit 505, and may determine that the start of the decoding path must be 31 frozen bit 510 default values (e.g., the codeword may begin with 31 consecutive 0 bits before the first information bit 505) . Based on this determination, the decoder may refrain from performing the computations to determine the first 31 bits, and may reduce the number of cycles to decode the codeword by 57.
  • Channel reliability plot 500 illustrates how channels with much higher channel indices may have comparable reliability values to channels with lower channel indices. For example, channels at channel indices 55 and 59 have high reliability, and have higher channel indices than 32 and 48. Therefore, shifting the information bits to channel indices 55 and 59 from 32 and 48 may marginally reduce the reliability while providing a reduction in decoding latency and complexity.
  • FIG. 6 illustrates an example of a channel reliability plot 600 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • Channel reliability plot 600 shows a channel reliability (e.g., on a scale from 0 to 10) , which may be referred to as a reliability metric, for each channel index within a 64 bit codeword.
  • Channel reliability plot 600 illustrates a polar coding technique that balances latency and performance. For example, channel reliability plot 600 illustrates the assigned channel indices for 8 information bits 605 and 56 frozen bits 610 in a 64 bit codeword.
  • the encoder may not encode the information bits 605 at the most reliable channel indices. Instead, the encoder may encode the information bits 605 in a set of channel indices with a higher first information bit 605 channel index. For example, if the encoder is encoding 8 information bits 605 into a 64 bit codeword, the encoder may identify the 8 most reliable channel indices (e.g., channel indices 32, 48, 56, 60, 61, 62, 63, and 64) . The encoder may determine that the information bit 605 at channel index 32 has the lowest channel index of the most reliable channel indices, and may identify the next most reliable channel index (e.g., channel index 59) .
  • the encoder may identify the 8 most reliable channel indices (e.g., channel indices 32, 48, 56, 60, 61, 62, 63, and 64) .
  • the encoder may determine that the information bit 605 at channel index 32 has the lowest channel index of the most reliable channel indices, and may
  • the encoder may encode the 8 information bits 605 at channel indices 48, 56, 59, 60, 61, 62, 63, and 64 in order to shift the first information bit 605 to a higher channel index (e.g., shifting from channel index 32 to channel index 48) .
  • a decoder may decode the information bits 605 of the codeword and may refrain from decoding the frozen bits 610 with channel indices lower than the channel index for the first information bit 605 (e.g., the information bit 605 at channel index 48) .
  • the decoder may identify that the first 47 bits of the codeword may be the default value for a frozen bit 610 (e.g., the codeword may begin with 47 consecutive 0 bits before the first information bit 605) , and may reduce the number of cycles to decode the codeword by 89. In this way, the decoder may reduce the decoding latency by 32 more cycles if the first information bit 605 is at channel index 48 rather than at channel index 32. Additionally, the decoder may reduce decoding complexity when the first information bit 605 is located at a higher channel index, as less computations are used to decode the codeword.
  • FIG. 7 illustrates an example of a process flow 700 that supports a polar coding design for performance and latency in accordance with various aspects of the present disclosure.
  • Process flow 700 may represent a process an encoder may perform in order to determine channel indices for information bit assignment. The encoder may determine a tradeoff between decoding latency and performance based on latency and performance thresholds. In some cases, process flow 700 may be performed by a server or other computing device, and may determine channel indices for information bit assignment for multiple combinations of k information bits and N total bits in a codeword.
  • a decoder and encoder may reference, for example, a lookup table including the determined channel indices, and may assign channels for the information bits or decode the codeword based on the values in the lookup table.
  • the lookup table may include various N and k combinations along with corresponding information bit location (s) , frozen bit location (s) , parity bit location (s) , and/or frozen bit value (s)
  • the encoder may select k channels for the k information bits based on channel reliability. For example, the encoder may assign the information bits to the k most reliable channels for encoding the codeword.
  • the encoder may remove the selected channel with the lowest channel index, and instead select the 705most reliable channel having a higher channel index, which was not previously selected at 705. For example, if the selected channel with the lowest channel index is at index 4, the encoder may select the channel with the greatest reliability that currently has a frozen bit assigned and has a channel index greater than 4.
  • the encoder may determine a performance loss associated with switching to the new set of channels. If the performance loss is less than a performance threshold, the encoder may repeat the above process, and replace the selected channel that now has the lowest channel index with the next most reliable channel with a higher channel index not previously selected. The reselection of channels may iteratively continue until the performance loss associated with switching to the new set of channels is greater than the performance threshold.
  • the encoder may remove the channel most recently added to the set of selected channels, and may reselect the channel most recently removed from the set.
  • the set of channels currently selected may now be the set of channels with the greatest first channel index while still having a performance loss smaller than the performance threshold.
  • the encoder may calculate a latency reduction associated with the new set of selected channels compared to the set of most reliable channels, and may compare the latency reduction to a latency reduction threshold. If the latency reduction is greater than the latency reduction threshold, the encoder may encode the information bits on the new set of selected channels. If the latency reduction is less than the latency reduction threshold, the encoder may simply encode the information bits using the set of most reliable channels (i.e., without reducing latency) .
  • the decreases in latency and performance may be based on the length and number of information bits in a codeword.
  • an encoder and decoder may each include an indication of the channel indices to use for the information bits based on the number of information bits k and the total number of bits N in the codeword.
  • the encoder and decoder may each include a table of channel indices for multiple combinations of k values and N values. The table may be generated based on process flow 700. In this way, the encoder may determine the number of information bits and total bits to send, and may select the channel indices for encoding the information bits based on the table (e.g., rather than performing the full process described above) .
  • the decoder may use the table to identify the channel indices for the information bits when the decoder receives a codeword. In some cases, shifting the first information bit to a higher channel index may result in a large reduction in decoding latency (e.g., if the channel indices for a few of the most reliable bits are lower than the channel indices for the other most reliable bits) . In some cases, the performance loss for shifting the first information bit to a higher channel index may be relatively small.
  • a decoder may decode a long polar code with low decoding latency and complexity by shifting the first information bit to a higher channel index.
  • FIG. 8 shows a block diagram 800 of a wireless device 805 that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • Wireless device 805 may be an example of aspects of a base station 105 or a UE 115 as described with reference to FIG. 1.
  • Wireless device 805 may include receiver 810, coding manager 815, and transmitter 820.
  • Wireless device 805 may also include a processor. Each of these components may be in communication with one another (e.g., via one or more buses) .
  • Receiver 810 may receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to polar coding design for performance and latency, etc. ) . Information may be passed on to other components of the device.
  • the receiver 810 may be an example of aspects of the transceiver 1135 described with reference to FIG. 11.
  • the receiver 810 may utilize a single antenna or a set of antennas.
  • Coding manager 815 may be an example of aspects of the coding manager 1115 described with reference to FIG. 11.
  • Coding manager 815 and/or at least some of its various sub-components may be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions of the coding manager 815 and/or at least some of its various sub-components may be executed by a general-purpose processor, a digital signal processor (DSP) , an application-specific integrated circuit (ASIC) , an field-programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described in the present disclosure.
  • DSP digital signal processor
  • ASIC application-specific integrated circuit
  • FPGA field-programmable gate array
  • the coding manager 815 and/or at least some of its various sub-components may be physically located at various positions, including being distributed such that portions of functions are implemented at different physical locations by one or more physical devices.
  • coding manager 815 and/or at least some of its various sub-components may be a separate and distinct component in accordance with various aspects of the present disclosure.
  • coding manager 815 and/or at least some of its various sub-components may be combined with one or more other hardware components, including but not limited to an I/O component, a transceiver, a network server, another computing device, one or more other components described in the present disclosure, or a combination thereof in accordance with various aspects of the present disclosure.
  • Coding manager 815 may receive a codeword including an encoded set of information bits, determine respective polar channels for decoding each of the encoded set of information bits based on a performance threshold, a latency threshold, or a combination thereof, and decode the encoded set of information bits based on the determining.
  • the coding manager 815 may also identify a set of information bits for encoding, determine respective polar channels for encoding each of the set of information bits based on a performance threshold, a latency threshold, or a combination thereof, encode the set of information bits based on the determining, and transmit a codeword including the encoded set of information bits.
  • Transmitter 820 may transmit signals generated by other components of the device.
  • the transmitter 820 may be collocated with a receiver 810 in a transceiver module.
  • the transmitter 820 may be an example of aspects of the transceiver 1135 described with reference to FIG. 11.
  • the transmitter 820 may utilize a single antenna or a set of antennas.
  • FIG. 9 shows a block diagram 900 of a wireless device 905 that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • Wireless device 905 may be an example of aspects of a wireless device 805 or a base station 105 or a UE 115 as described with reference to FIGs. 1 and 8.
  • Wireless device 905 may include receiver 910, coding manager 915, and transmitter 920.
  • Wireless device 905 may also include a processor. Each of these components may be in communication with one another (e.g., via one or more buses) .
  • Receiver 910 may receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to polar coding design for performance and latency, etc. ) . Information may be passed on to other components of the device.
  • the receiver 910 may be an example of aspects of the transceiver 1135 described with reference to FIG. 11.
  • the receiver 910 may utilize a single antenna or a set of antennas.
  • Coding manager 915 may be an example of aspects of the coding manager 1115 described with reference to FIG. 11. Coding manager 915 may also include reception component 925, channel component 930, decoding component 935, bit identifier 940, encoding component 945, and transmission component 950.
  • Reception component 925 may receive a codeword including an encoded set of information bits.
  • Channel component 930 may determine respective polar channels for decoding each of the encoded set of information bits based on a performance threshold, a latency threshold, or a combination thereof. In some cases, channel component 930 may determine respective polar channels for encoding each of the set of information bits based on the performance threshold, the latency threshold, or a combination thereof. Channel component 930 may select a set of polar channels of a plurality of polar channels based on respective reliability metrics. In some cases, determining the respective polar channels includes: determining a set of polar channels of a plurality of polar channels of a decoder or encoder based on a lookup table. In some cases, the lookup table is based on a length of the decoder or encoder and a number of information bits for decoding or encoding.
  • Decoding component 935 may decode the encoded set of information bits based on the determining, skip decoding of one or more frozen bits of the codeword based on a channel index corresponding to a first information bit of the encoded set of information bits, and perform a decoding process based on a mapping of each information bit of the encoded plurality of information bits to a respective polar channel of the decoder.
  • a reliability metric associated with the first information bit is less than a reliability metric associated with a frozen bit of the codeword.
  • the channel index corresponding to the first information bit is greater than a channel index corresponding to the frozen bit.
  • Bit identifier 940 may identify a set of information bits for encoding.
  • Encoding component 945 may encode the set of information bits based on the determining and perform an encoding process based on mapping each information bit of the plurality of information bits to a respective polar channel of the encoder.
  • Transmission component 950 may transmit a codeword including the encoded set of information bits.
  • Transmitter 920 may transmit signals generated by other components of the device.
  • the transmitter 920 may be collocated with a receiver 910 in a transceiver module.
  • the transmitter 920 may be an example of aspects of the transceiver 1135 described with reference to FIG. 11.
  • the transmitter 920 may utilize a single antenna or a set of antennas.
  • FIG. 10 shows a block diagram 1000 of a coding manager 1015 that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • the coding manager 1015 may be an example of aspects of a coding manager 815, a coding manager 915, or a coding manager 1115 described with reference to FIGs. 8, 9, and 11.
  • the coding manager 1015 may include reception component 1020, channel component 1025, decoding component 1030, bit identifier 1035, encoding component 1040, transmission component 1045, comparator 1050, bit mapper 1055, and reliability component 1060. Each of these modules may communicate, directly or indirectly, with one another (e.g., via one or more buses) .
  • Reception component 1020 may receive a codeword including an encoded set of information bits.
  • Channel component 1025 may determine respective polar channels for decoding each of the encoded set of information bits based on a performance threshold, a latency threshold, or a combination thereof. In some cases, channel component 1025 may determine respective polar channels for encoding each of the set of information bits based on the performance threshold, the latency threshold, or a combination thereof. Channel component 1025 may select a set of polar channels of a plurality of polar channels based on respective reliability metrics. In some cases, determining the respective polar channels includes: determining a set of polar channels of a plurality of polar channels of a decoder or encoder based on a lookup table. In some cases, the lookup table is based on a length of the decoder or encoder and a number of information bits for decoding or encoding.
  • Decoding component 1030 may decode the encoded set of information bits based on the determining, skip decoding of one or more frozen bits of the codeword based on a channel index corresponding to a first information bit of the encoded set of information bits, and perform a decoding process based on a mapping of each information bit of the encoded plurality of information bits to a respective polar channel of the decoder.
  • a reliability metric associated with the first information bit is less than a reliability metric associated with a frozen bit of the codeword.
  • the channel index corresponding to the first information bit is greater than a channel index corresponding to the frozen bit.
  • Bit identifier 1035 may identify a set of information bits for encoding.
  • Encoding component 1040 may encode the set of information bits based on the determining and perform an encoding process based on mapping each information bit of the plurality of information bits to a respective polar channel of the encoder.
  • Transmission component 1045 may transmit a codeword including the encoded set of information bits.
  • Comparator 1050 may compare a performance of a selected set of polar channels with the performance threshold, where the respective polar channels are determined based on the comparison. Comparator 1050 may compare a latency of a selected set of polar channels with the latency threshold, where the respective polar channels are determined based on the comparison.
  • Bit mapper 1055 may map bits to respective polar channels.
  • decoding the encoded set of information bits includes: mapping each information bit of the encoded set of information bits to a respective polar channel of the decoder.
  • encoding the set of information bits includes: mapping each information bit of the set of information bits to a respective polar channel of the encoder.
  • Reliability component 1060 may determine reliability metrics for polar channels.
  • determining the respective polar channels includes: determining respective reliability metrics for each polar channel of a set of polar channels of the decoder.
  • determining the respective polar channels includes: determining respective reliability metrics for each polar channel of a set of polar channels of the encoder.
  • a reliability metric of a polar channel of the selected set of polar channels is less than a reliability metric of an unselected polar channel of the set of polar channels.
  • a channel index corresponding to the polar channel is greater than a channel index corresponding to the unselected polar channel.
  • FIG. 11 shows a diagram of a system 1100 including a device 1105 that supports polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • Device 1105 may be an example of or include the components of wireless device 805, wireless device 905, or a base station 105 or a UE 115 as described above, e.g., with reference to FIGs. 1, 8 and 9.
  • Device 1105 may include components for bi-directional voice and data communications including components for transmitting and receiving communications, including coding manager 1115, processor 1120, memory 1125, software 1130, transceiver 1135, antenna 1140, and I/O controller 1145. These components may be in electronic communication via one or more busses (e.g., bus 1110) .
  • busses e.g., bus 1110
  • Processor 1120 may include an intelligent hardware device, (e.g., a general-purpose processor, a DSP, a central processing unit (CPU) , a microcontroller, an ASIC, an FPGA, a programmable logic device, a discrete gate or transistor logic component, a discrete hardware component, or any combination thereof) .
  • processor 1120 may be configured to operate a memory array using a memory controller.
  • a memory controller may be integrated into processor 1120.
  • Processor 1120 may be configured to execute computer-readable instructions stored in a memory to perform various functions (e.g., functions or tasks supporting polar coding design for performance and latency) .
  • Memory 1125 may include random access memory (RAM) and read only memory (ROM) .
  • the memory 1125 may store computer-readable, computer-executable software 1130 including instructions that, when executed, cause the processor to perform various functions described herein.
  • the memory 1125 may contain, among other things, a basic input/output system (BIOS) which may control basic hardware and/or software operation such as the interaction with peripheral components or devices.
  • BIOS basic input/output system
  • Software 1130 may include code to implement aspects of the present disclosure, including code to support polar coding design for performance and latency.
  • Software 1130 may be stored in a non-transitory computer-readable medium such as system memory or other memory. In some cases, the software 1130 may not be directly executable by the processor but may cause a computer (e.g., when compiled and executed) to perform functions described herein.
  • Transceiver 1135 may communicate bi-directionally, via one or more antennas, wired, or wireless links as described above.
  • the transceiver 1135 may represent a wireless transceiver and may communicate bi-directionally with another wireless transceiver.
  • the transceiver 1135 may also include a modem to modulate the packets and provide the modulated packets to the antennas for transmission, and to demodulate packets received from the antennas.
  • the wireless device may include a single antenna 1140. However, in some cases the device may have more than one antenna 1140, which may be capable of concurrently transmitting or receiving multiple wireless transmissions.
  • I/O controller 1145 may manage input and output signals for device 1105. I/O controller 1145 may also manage peripherals not integrated into device 1105. In some cases, I/O controller 1145 may represent a physical connection or port to an external peripheral. In some cases, I/O controller 1145 may utilize an operating system such as or another known operating system. In other cases, I/O controller 1145 may represent or interact with a modem, a keyboard, a mouse, a touchscreen, or a similar device. In some cases, I/O controller 1145 may be implemented as part of a processor. In some cases, a user may interact with device 1105 via I/O controller 1145 or via hardware components controlled by I/O controller 1145.
  • FIG. 12 shows a flowchart illustrating a method 1200 for polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • the operations of method 1200 may be implemented by a base station 105 or a UE 115 or its components as described herein.
  • the operations of method 1200 may be performed by a coding manager as described with reference to FIGs. 8 through 11.
  • a base station 105 or a UE 115 may execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the base station 105 or a UE 115 may perform aspects of the functions described below using special-purpose hardware.
  • the base station 105 or a UE 115 may receive a codeword comprising an encoded plurality of information bits.
  • the operations of block 1205 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1205 may be performed by a reception component as described with reference to FIGs. 8 through 11.
  • the base station 105 or a UE 115 may determine respective polar channels for decoding each of the encoded plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof.
  • the operations of block 1210 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1210 may be performed by a channel component as described with reference to FIGs. 8 through 11.
  • the base station 105 or a UE 115 may decode the encoded plurality of information bits based at least in part on the determining.
  • the operations of block 1215 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1215 may be performed by a decoding component as described with reference to FIGs. 8 through 11.
  • FIG. 13 shows a flowchart illustrating a method 1300 for polar coding design for performance and latency in accordance with aspects of the present disclosure.
  • the operations of method 1300 may be implemented by a base station 105 or a UE 115 or its components as described herein.
  • the operations of method 1300 may be performed by a coding manager as described with reference to FIGs. 8 through 11.
  • a base station 105 or a UE 115 may execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the base station 105 or a UE 115 may perform aspects of the functions described below using special-purpose hardware.
  • the base station 105 or a UE 115 may identify a plurality of information bits for encoding.
  • the operations of block 1305 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1305 may be performed by a bit identifier as described with reference to FIGs. 8 through 11.
  • the base station 105 or a UE 115 may determine respective polar channels for encoding each of the plurality of information bits based at least in part on a performance threshold, a latency threshold, or a combination thereof.
  • the operations of block 1310 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1310 may be performed by a channel component as described with reference to FIGs. 8 through 11.
  • the base station 105 or a UE 115 may encode the plurality of information bits based at least in part on the determining.
  • the operations of block 1315 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1315 may be performed by a encoding component as described with reference to FIGs. 8 through 11.
  • the base station 105 or a UE 115 may transmit a codeword comprising the encoded plurality of information bits.
  • the operations of block 1320 may be performed according to the methods described with reference to FIGs. 1 through 5. In certain examples, aspects of the operations of block 1320 may be performed by a transmission component as described with reference to FIGs. 8 through 11.
  • CDMA code division multiple access
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • OFDMA orthogonal frequency division multiple access
  • SC-FDMA single carrier frequency division multiple access
  • CDMA2000 covers IS-2000, IS-95, and IS-856 standards.
  • IS-2000 Releases may be commonly referred to as CDMA2000 1X, 1X, etc.
  • IS-856 (TIA-856) is commonly referred to as CDMA2000 1xEV-DO, High Rate Packet Data (HRPD) , etc.
  • UTRA includes Wideband CDMA (WCDMA) and other variants of CDMA.
  • WCDMA Wideband CDMA
  • a TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM) .
  • GSM Global System for Mobile Communications
  • An OFDMA system may implement a radio technology such as Ultra Mobile Broadband (UMB) , Evolved UTRA (E-UTRA) , Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi) , IEEE 802.16 (WiMAX) , IEEE 802.20, Flash-OFDM, etc.
  • UMB Ultra Mobile Broadband
  • E-UTRA Evolved UTRA
  • IEEE Institute of Electrical and Electronics Engineers
  • Wi-Fi Institute of Electrical and Electronics Engineers
  • WiMAX IEEE 802.16
  • IEEE 802.20 Flash-OFDM
  • UTRA and E-UTRA are part of Universal Mobile Telecommunications System (UMTS) .
  • LTE and LTE-A are releases of UMTS that use E-UTRA.
  • UTRA, E-UTRA, UMTS, LTE, LTE-A, NR, and GSM are described in documents from the organization named “3rd Generation Partnership Project” (3GPP) .
  • 3GPP 3rd Generation
  • CDMA2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2) .
  • 3GPP2 3rd Generation Partnership Project 2
  • the techniques described herein may be used for the systems and radio technologies mentioned above as well as other systems and radio technologies. While aspects of an LTE or an NR system may be described for purposes of example, and LTE or NR terminology may be used in much of the description, the techniques described herein are applicable beyond LTE or NR applications.
  • the term evolved node B may be generally used to describe the base stations.
  • the wireless communications system or systems described herein may include a heterogeneous LTE/LTE-A or NR network in which different types of eNBs provide coverage for various geographical regions.
  • each eNB, next generation NodeB (gNB) , or base station may provide communication coverage for a macro cell, a small cell, or other types of cell.
  • the term “cell” may be used to describe a base station, a carrier or component carrier associated with a base station, or a coverage area (e.g., sector, etc. ) of a carrier or base station, depending on context.
  • Base stations may include or may be referred to by those skilled in the art as a base transceiver station, a radio base station, an access point, a radio transceiver, a NodeB, eNodeB (eNB) , gNB, Home NodeB, a Home eNodeB, or some other suitable terminology.
  • the geographic coverage area for a base station may be divided into sectors making up only a portion of the coverage area.
  • the wireless communications system or systems described herein may include base stations of different types (e.g., macro or small cell base stations) .
  • the UEs described herein may be able to communicate with various types of base stations and network equipment including macro eNBs, small cell eNBs, gNBs, relay base stations, and the like. There may be overlapping geographic coverage areas for different technologies.
  • a macro cell generally covers a relatively large geographic area (e.g., several kilometers in radius) and may allow unrestricted access by UEs with service subscriptions with the network provider.
  • a small cell is a lower-powered base station, as compared with a macro cell, that may operate in the same or different (e.g., licensed, unlicensed, etc. ) frequency bands as macro cells.
  • Small cells may include pico cells, femto cells, and micro cells according to various examples.
  • a pico cell for example, may cover a small geographic area and may allow unrestricted access by UEs with service subscriptions with the network provider.
  • a femto cell may also cover a small geographic area (e.g., a home) and may provide restricted access by UEs having an association with the femto cell (e.g., UEs in a closed subscriber group (CSG) , UEs for users in the home, and the like) .
  • An eNB for a macro cell may be referred to as a macro eNB.
  • An eNB for a small cell may be referred to as a small cell eNB, a pico eNB, a femto eNB, or a home eNB.
  • An eNB may support one or multiple (e.g., two, three, four, and the like) cells (e.g., component carriers) .
  • the wireless communications system or systems described herein may support synchronous or asynchronous operation.
  • the base stations may have similar frame timing, and transmissions from different base stations may be approximately aligned in time.
  • the base stations may have different frame timing, and transmissions from different base stations may not be aligned in time.
  • the techniques described herein may be used for either synchronous or asynchronous operations.
  • Each communication link described herein-including, for example, wireless communications system 100 and 200 of FIGs. 1 and 2- may include one or more carriers, where each carrier may be a signal made up of multiple sub-carriers (e.g., waveform signals of different frequencies) .
  • Information and signals described herein may be represented using any of a variety of different technologies and techniques.
  • data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
  • a general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
  • a processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration) .
  • the functions described herein may be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Other examples and implementations are within the scope of the disclosure and appended claims. For example, due to the nature of software, functions described above can be implemented using software executed by a processor, hardware, firmware, hardwiring, or combinations of any of these. Features implementing functions may also be physically located at various positions, including being distributed such that portions of functions are implemented at different physical locations.
  • Computer-readable media includes both non-transitory computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • a non-transitory storage medium may be any available medium that can be accessed by a general purpose or special purpose computer.
  • non-transitory computer-readable media may comprise RAM, ROM, electrically erasable programmable read only memory (EEPROM) , compact disk (CD) ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other non-transitory medium that can be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor.
  • RAM random access memory
  • ROM read only memory
  • EEPROM electrically erasable programmable read only memory
  • CD compact disk
  • magnetic disk storage or other magnetic storage devices or any other non-transitory medium that can be used to carry or store desired program code means in the form of instructions or
  • any connection is properly termed a computer-readable medium.
  • 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
  • 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 include 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. Combinations of the above are also included within the scope of computer-readable media.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Un dispositif sans fil selon l'invention peut décoder un mot de code à codage polaire à l'aide d'un décodeur à annulation successive (SC) ou liste d'annulation successive (SCL). Le décodeur peut comprendre une indication des indices de canal pour les bits d'informations dans le mot de code, ainsi qu'une valeur par défaut pour les bits gelés. Le décodeur peut déterminer que les bits gelés précédant le premier bit d'informations ont tous la valeur par défaut, et peut s'abstenir d'effectuer des opérations de décodage pour décoder ces bits gelés. Pour réduire davantage la latence de décodage, un codeur peut attribuer le premier bit d'informations à un canal ayant un indice de canal plus élevé, mais une fiabilité plus faible. Le nouveau premier bit d'informations peut avoir davantage de bits gelés avant lui, de sorte que le décodeur puisse en outre réduire le nombre d'opérations de décodage pour décoder le mot de code. Dans certains cas, le codeur peut sélectionner les canaux pour les bits d'informations sur la base de seuils de performance et de latence.
PCT/CN2018/075588 2017-03-08 2018-02-07 Conception de codage polaire pour la performance et la latence WO2018161762A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
PCT/CN2017/075969 WO2018161274A1 (fr) 2017-03-08 2017-03-08 Conception de codage polaire pour la performance et la latence
CNPCT/CN2017/075969 2017-03-08

Publications (1)

Publication Number Publication Date
WO2018161762A1 true WO2018161762A1 (fr) 2018-09-13

Family

ID=63447196

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/CN2017/075969 WO2018161274A1 (fr) 2017-03-08 2017-03-08 Conception de codage polaire pour la performance et la latence
PCT/CN2018/075588 WO2018161762A1 (fr) 2017-03-08 2018-02-07 Conception de codage polaire pour la performance et la latence

Family Applications Before (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/075969 WO2018161274A1 (fr) 2017-03-08 2017-03-08 Conception de codage polaire pour la performance et la latence

Country Status (2)

Country Link
TW (1) TW201843940A (fr)
WO (2) WO2018161274A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180198555A1 (en) * 2017-01-09 2018-07-12 Mediatek Inc. Broadcast Channel Enhancement with Polar Code
CN113078910A (zh) * 2020-01-06 2021-07-06 大唐移动通信设备有限公司 一种比特位字段的确定方法、装置、介质和电子设备
WO2023116544A1 (fr) * 2021-12-22 2023-06-29 Huawei Technologies Co., Ltd. Systèmes et procédés d'utilisation de nœuds spéciaux pour codage polaire dans des codes polaires
CN117933763A (zh) * 2024-03-22 2024-04-26 国网安徽省电力有限公司经济技术研究院 基于输变电工程地质分布图的评审应用分析方法

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109194338A (zh) * 2018-11-07 2019-01-11 桂林电子科技大学 一种混合节点多比特处理的极化码译码方法
US11777533B2 (en) 2018-11-27 2023-10-03 Telefonaktiebolagget LM Ericsson (Publ) Method for polar decoding with dynamic successive cancellation list size and polar decoder
CN110768680B (zh) * 2019-11-04 2024-03-29 重庆邮电大学 一种scl剪枝技术联合球型列表译码的方法及装置
KR20210081952A (ko) * 2019-12-24 2021-07-02 삼성전자주식회사 통신 시스템에서 극부호의 복호화 장치 및 방법

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150333775A1 (en) * 2014-05-15 2015-11-19 Broadcom Corporation Frozen-Bit Selection for a Polar Code Decoder
US9503126B2 (en) * 2012-07-11 2016-11-22 The Regents Of The University Of California ECC polar coding and list decoding methods and codecs
US20170047947A1 (en) * 2015-08-12 2017-02-16 Telefonaktiebolaget L M Ericsson (Publ) Rate-compatible polar codes

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9742440B2 (en) * 2015-03-25 2017-08-22 Samsung Electronics Co., Ltd HARQ rate-compatible polar codes for wireless channels

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9503126B2 (en) * 2012-07-11 2016-11-22 The Regents Of The University Of California ECC polar coding and list decoding methods and codecs
US20150333775A1 (en) * 2014-05-15 2015-11-19 Broadcom Corporation Frozen-Bit Selection for a Polar Code Decoder
US20170047947A1 (en) * 2015-08-12 2017-02-16 Telefonaktiebolaget L M Ericsson (Publ) Rate-compatible polar codes

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL.: "Evaluation of channel coding schemes for control channel", R1-1608863; 3GPP TSG RAN WG1 MEETING #86B, 9 October 2016 (2016-10-09), XP051148917 *
ZTE ET AL.: "Consideration on polar codes for NR", 3GPP TSG RAN WG1 #87 R1-1611113, 13 November 2016 (2016-11-13), Reno, US, XP051175095 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180198555A1 (en) * 2017-01-09 2018-07-12 Mediatek Inc. Broadcast Channel Enhancement with Polar Code
US10498481B2 (en) * 2017-01-09 2019-12-03 Mediatek Inc. Broadcast channel enhancement with polar code
CN113078910A (zh) * 2020-01-06 2021-07-06 大唐移动通信设备有限公司 一种比特位字段的确定方法、装置、介质和电子设备
CN113078910B (zh) * 2020-01-06 2023-07-28 大唐移动通信设备有限公司 一种比特位字段的确定方法、装置、介质和电子设备
WO2023116544A1 (fr) * 2021-12-22 2023-06-29 Huawei Technologies Co., Ltd. Systèmes et procédés d'utilisation de nœuds spéciaux pour codage polaire dans des codes polaires
US11791844B2 (en) 2021-12-22 2023-10-17 Huawei Technologies Co., Ltd. Systems and methods for using special nodes for polar encoding in polar codes
CN117933763A (zh) * 2024-03-22 2024-04-26 国网安徽省电力有限公司经济技术研究院 基于输变电工程地质分布图的评审应用分析方法

Also Published As

Publication number Publication date
WO2018161274A1 (fr) 2018-09-13
TW201843940A (zh) 2018-12-16

Similar Documents

Publication Publication Date Title
US10224966B2 (en) Parity bit channel assignment for polar coding
US10601447B2 (en) Field prioritization for polar codes
KR102594223B1 (ko) 브로드캐스트 채널 인코딩 및 디코딩
WO2018161762A1 (fr) Conception de codage polaire pour la performance et la latence
US20200099393A1 (en) Polar codes for uplink control information
US10917195B2 (en) Control channel mother code determination for multi-transmission configuration indication communication
US10498506B2 (en) Flexible comb-based reference signals
US10756846B2 (en) Distributed feedback architecture for polar decoding
EP3596859A1 (fr) Construction de code polaire basée sur des informations mutuelles
WO2018166256A1 (fr) Construction de code polaire basée sur des informations mutuelles
WO2019005692A1 (fr) Adaptation de liaison comportant une instance d'adaptation de liaison de boucle externe par ensemble de sous-trames
US20210306037A1 (en) Multiple user port loading indication
WO2020088435A1 (fr) Efficacité améliorée pour décoder de multiples tailles de bits d'informations
WO2020142980A1 (fr) Indication d'un canal de commande existant pour un équipement d'utilisateur cible
US10869332B2 (en) Transmission scheme for multiple component carriers in adjacent subframes

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18763595

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18763595

Country of ref document: EP

Kind code of ref document: A1