[go: up one dir, main page]

WO2018141080A1 - Réduction du taux de fausses alarmes pour codes polaires - Google Patents

Réduction du taux de fausses alarmes pour codes polaires Download PDF

Info

Publication number
WO2018141080A1
WO2018141080A1 PCT/CN2017/072800 CN2017072800W WO2018141080A1 WO 2018141080 A1 WO2018141080 A1 WO 2018141080A1 CN 2017072800 W CN2017072800 W CN 2017072800W WO 2018141080 A1 WO2018141080 A1 WO 2018141080A1
Authority
WO
WIPO (PCT)
Prior art keywords
paths
candidate paths
error detection
subset
candidate
Prior art date
Application number
PCT/CN2017/072800
Other languages
English (en)
Inventor
Changlong Xu
Gaojin Wu
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
Priority to PCT/CN2017/072800 priority Critical patent/WO2018141080A1/fr
Publication of WO2018141080A1 publication Critical patent/WO2018141080A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Definitions

  • the following relates generally to wireless communication, and more specifically to false alarm rate reduction for polar codes.
  • 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 transmitter may encode code blocks using error correcting codes to introduce redundancy in the code block so that transmission errors may be detected and corrected.
  • error correcting codes include convolutional codes (CCs) , low-density parity-check (LDPC) codes, and polar codes.
  • CCs convolutional codes
  • LDPC low-density parity-check
  • polar codes A polar code is an example of a linear block error correcting code and is the first coding technique to provably achieve channel capacity.
  • a false alarm may occur when a receiver decodes a received signal to determine that a particular bit sequence was transmitted, when a different bit sequence or no bit sequence was actually sent.
  • Existing implementations do not adequately address false alarm rates.
  • the described techniques relate to improved methods, systems, devices, or apparatuses that support false alarm rate reduction for polar codes.
  • the described techniques provide for selecting a subset of candidate paths though a code tree and iteratively performing an error detection algorithm on bit sequences associated with the candidate path subset.
  • a conventional transmitter appends a cyclic redundancy check (CRC) to information bits in a message being transmitted.
  • CRC cyclic redundancy check
  • a receiver uses the CRC for detecting an error in a received message, thereby lowering a false alarm rate.
  • the ability of the CRC to suppress false alarms is a function of the number of bits in the CRC. Increasing the number of bits in the CRC decreases the false alarm rate (FAR) . In some instances, the FAR is function of the number of CRC bits (e.g., ) .
  • Non-list decoders such as a maximum likelihood (ML) decoder
  • ML maximum likelihood
  • BLER block error rate
  • Non-list decoders consider every possible path through a code tree and hence are very computationally expensive to implement.
  • list decoders only consider selected paths through a code tree and thus are less computationally expensive to implement.
  • List decoders can also reduce the BLER by way of checking more paths, but also increase the FAR.
  • an encoding parameter e.g., number of CRC bits
  • a decoding parameter e.g., list size
  • a receiver such as a base station or UE, may include a list decoder, a false alarm reducer, and an error detector.
  • the list decoder may identify a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths.
  • a false alarm reducer may select a subset of the candidate paths for performing an error detection algorithm, where a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword.
  • An error detector may iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the examples described herein decouple list size from the number of paths run through the error detector and hence decouple FAR from the detection rate (or BLER) to allow for a decrease in the BLER without an increase in FAR.
  • a method of wireless communication may include identifying, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword, selecting a subset of the candidate paths for performing an error detection algorithm, wherein a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword, and iteratively performing the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the apparatus may include means for identifying, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword, means for selecting a subset of the candidate paths for performing an error detection algorithm, wherein a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword, and means for iteratively performing the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • 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, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword, select a subset of the candidate paths for performing an error detection algorithm, wherein a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword, and iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • a non-transitory computer readable medium for wireless communication may include instructions operable to cause a processor to identify, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword, select a subset of the candidate paths for performing an error detection algorithm, wherein a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword, and iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for determining whether a code rate associated with the polar-encoded codeword satisfies a code rate threshold. Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for determining that the code rate equals or is below the code rate threshold.
  • selecting the subset of the candidate paths includes selecting a predetermined number of the candidate paths having a best of the respective path metrics.
  • the best of the respective path metrics may be determined based at least on a probability metric or a distance metric.
  • selecting the subset of the candidate paths includes sorting the candidate paths according to the respective path metrics.
  • 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 first predetermined number of the sorted candidate paths having a best of the respective path metrics and selecting a second predetermined number of the sorted candidate paths using a path selection algorithm.
  • the path selection algorithm randomly selects from a remaining of the sorted candidate paths.
  • the path selection algorithm evenly selects from a remaining of the sorted candidate paths.
  • selecting the subset of the candidate paths includes selecting a predetermined number of the candidate paths having a best of the respective path metrics.
  • the best of the respective path metrics may be determined based at least on a probability metric or a distance metric.
  • the number of bits in the error detection code includes a first number of bits and a second number of bits.
  • Some examples of the method, apparatus, and non-transitory computer-readable medium described above may further include processes, features, means, or instructions for determining the number of the candidate paths to include in the subset as a function of the second number of bits.
  • the list decoder may be a successive cancellation list (SCL) decoder or a cyclic redundancy check (CRC) -aided SCL decoder.
  • SCL successive cancellation list
  • CRC cyclic redundancy check
  • the error detection algorithm may be a cyclic redundancy check (CRC) algorithm.
  • CRC cyclic redundancy check
  • FIG. 1 illustrates an example of a system for wireless communication that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 2 illustrates an example of a wireless communication system that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 3 illustrates an example of a decoder that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 4 illustrates an example of a flow diagram that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 5 illustrates an example of a code tree that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 6 illustrates an example of a code tree that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 7 illustrates an example of a code tree that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 8 illustrates an example of a code tree that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 9 illustrates an example of a flow diagram that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIGs. 10 through 12 show block diagrams of a device that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 13 illustrates a block diagram of a system including a UE that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIG. 14 illustrates a block diagram of a system including a base station that supports false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • FIGs. 15 through 16 illustrate methods for false alarm rate reduction for polar codes in accordance with aspects of the present disclosure.
  • the described techniques relate to false alarm rate reduction for polar codes.
  • the described techniques provide for selecting a subset of candidate paths determined by a list decoder from a code tree and iteratively performing an error detection algorithm on bit sequences associated with the candidate path subset.
  • a conventional transmitter appends a cyclic redundancy check (CRC) to information bits in a message being transmitted to a receiver.
  • CRC cyclic redundancy check
  • a receiver uses the CRC for detecting an error in a received message, thereby lowering a false alarm rate.
  • Conventional receivers are problematic for a number of reasons. For instance, a conventional receiver that includes a non-list decoder, such as a maximum likelihood (ML) decoder, has a certain FAR and a certain block error rate (BLER) .
  • ML maximum likelihood
  • BLER block error rate
  • Non-list decoders however, consider every possible path through a code tree and hence are very computationally expensive to implement. In contrast, list decoders only consider selected paths through a code tree and thus are less computationally expensive to implement. List decoders can also reduce the block error rate (BLER) by way of checking more paths, but also increase the FAR. Conventional list decoders are also problematic as an encoding parameter (e.g., number of CRC bits) is determined by a decoding parameter (e.g., list size) , and thus require additional signaling between a transmitter and a receiver to agree on what encoding and decoding parameters to use prior to transmission.
  • BLER block error rate
  • Conventional list decoders are also problematic as an encoding parameter (e.g., number of CRC bits) is determined by a decoding parameter (e.g., list size) , and thus require additional signaling between a transmitter and a receiver to agree on what encoding and decoding parameters to use prior to transmission.
  • the ability of the CRC bits to suppress false alarms is a function of the number of bits in the CRC. For example, let s be the number of information bits, m be the number of CRC bits for a desired signal detection rate (or desired BLER) , and J be the number of CRC bits for a desired false alarm rate for CRC-aided successive cancellation list (CA-SCL) decoding.
  • s be the number of information bits
  • m be the number of CRC bits for a desired signal detection rate (or desired BLER)
  • J the number of CRC bits for a desired false alarm rate for CRC-aided successive cancellation list (CA-SCL) decoding.
  • CA-SCL CRC-aided successive cancellation list
  • the conventional solution is to link the number of CRC bits to the list size L.
  • L is the list size for CA-SCL decoding (e.g., the number of candidate paths retained in the decoding process of a code tree) .
  • the number of CRC bits is related to the list size L.
  • an encoding parameter e.g., number of CRC bits
  • a decoding parameter e.g., list size
  • the examples described herein overcome the problems with conventional systems by having a transmitter use a constant number of bits for an error detecting code (e.g., a CRC) that is independent of the list size used by a list decoder in the receiver, while the receiver performs error detection on a subset of the list size number of candidate paths output by the list decoder.
  • reducing the number of candidate paths to less than the list size number reduces the false alarm rate.
  • the examples described herein beneficially decouple list size from the number of paths run through an error detector and hence decouple FAR from the detection rate (or BLER) to allow for a decrease in the BLER without an increase in FAR.
  • the wireless communications system may reduce a FAR for polar codes by utilizing a constant number of CRC bits that is independent of the list size used by a list decoder and selecting a subset of candidate paths through a code tree output by the list decoder. Aspects of the disclosure are further illustrated by and described with reference to apparatus diagrams, system diagrams, and flowcharts that relate to false alarm rate reduction for polar codes.
  • 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 LTE (or LTE-Advanced) network, or a New Radio (NR) network.
  • LTE Long Term Evolution
  • 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.
  • ultra-reliable i.e., mission critical
  • Transmitters such as base stations 105 and UEs 115, may apply an error detection algorithm to information bits to generate an error detection code having a constant number of bits and may generate a payload that includes the error detection code appended to the information bits.
  • a transmitter may perform a polar encoding algorithm on the payload to generate a polar-encoded codeword that is transmitted via a communication channel.
  • Receivers such as base stations 105 and UEs 115, may receive a signal that includes the polar-encoded codeword, perform a list decoding algorithm to generate a list size number of candidate paths through a code tree, and select a subset of the list size number L of candidate paths for performing error detection.
  • the selected number of candidate paths Z may be a function of the number of bits in the error detection code.
  • the receiver may then iteratively perform an error detection algorithm on a bit sequence associated with a respective candidate path in the subset. The iteration may end when a bit sequence passes the error detection algorithm or all bit sequences fail.
  • the base station 105 may be the transmitter and the UE 115 may be the receiver. In other instances, the UE 115 may be the transmitter and the base station 105 may be the receiver. In further instances, a first base station 105 may be the transmitter and a second base station 105 may be the receiver. In additional instances, a first UE 115 may be the transmitter and a second UE 115 may be the receiver. Devices other than a base station and a receiver may also be one or both of the transmitter and receiver.
  • Base stations 105 may wirelessly communicate with UEs 115 via one or more base station antennas. 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 (UL) transmissions from a UE 115 to a base station 105, or downlink (DL) 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.
  • TDM time division multiplexing
  • FDM frequency division multiplexing
  • hybrid TDM-FDM techniques hybrid TDM-FDM techniques.
  • the control information transmitted during a TTI of a downlink channel may be distributed between different control regions in a cascaded manner (e.g., between a common
  • 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 eNodeBs (eNBs) 105.
  • eNodeBs eNodeBs
  • 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 MME, at least one S-GW, and at least one P-GW.
  • the MME may be the control node that processes the signaling between the UE 115 and the EPC. All user 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 (PSS) .
  • IMS IP Multimedia Subsystem
  • PSS 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 in some cases WLAN networks 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. Transmission of UHF waves is characterized by smaller antennas and shorter range (e.g., less than 100 km) compared to transmission using the smaller frequencies (and longer waves) of the high frequency (HF) or very high frequency (VHF) portion of the spectrum.
  • UHF high frequency
  • VHF very high frequency
  • 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 105) 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) and a receiver (e.g. a UE) , 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
  • SFN system frame number
  • Each frame may include ten 1ms subframes numbered from 0 to 9.
  • a subframe may be further divided into two . 5ms slots, each of which contains 6 or 7 modulation symbol periods (depending on the length of the cyclic prefix prepended to each symbol) . Excluding the cyclic prefix, each symbol contains 2048 sample periods.
  • the subframe may be the smallest scheduling unit, also known as a TTI.
  • a TTI may be shorter than a subframe or may be dynamically selected (e.g., in short TTI bursts or in selected component carriers using short TTIs) .
  • a resource element may consist of one symbol period and one subcarrier (e.g., a 15 KHz frequency range) .
  • a resource block may contain 12 consecutive subcarriers in the frequency domain and, for a normal cyclic prefix in each OFDM symbol, 7 consecutive OFDM symbols in the time domain (1 slot) , or 84 resource elements.
  • the number of bits carried by each resource element may depend on the modulation scheme (the configuration of symbols that may be selected during each symbol period) . Thus, the more resource blocks that a UE receives and the higher the modulation scheme, the higher the data rate may be.
  • Wireless communications system 100 may support operation on multiple cells or carriers, a feature which may be referred to as carrier aggregation (CA) or multi-carrier operation.
  • a carrier may also be referred to as a component carrier (CC) , a layer, a channel, etc.
  • CC component carrier
  • the terms “carrier, ” “component carrier, ” “cell, ” and “channel” may be used interchangeably herein.
  • a UE 115 may be configured with multiple downlink CCs and one or more uplink CCs for carrier aggregation.
  • Carrier aggregation may be used with both FDD and TDD component carriers.
  • wireless communications system 100 may utilize enhanced component carriers (eCCs) .
  • eCC may be characterized by one or more features including: wider bandwidth, shorter symbol duration, shorter transmission time interval (TTIs) , and modified control channel configuration.
  • an eCC may be associated with a carrier aggregation configuration or a dual connectivity configuration (e.g., when multiple serving cells have a suboptimal or non-ideal backhaul link) .
  • An eCC may also be configured for use in unlicensed spectrum or shared spectrum (where more than one operator is allowed to use the spectrum) .
  • An eCC characterized by wide bandwidth may include one or more segments that may be utilized by UEs 115 that are not capable of monitoring the whole bandwidth or prefer to use a limited bandwidth (e.g., to conserve power) .
  • an eCC may utilize a different symbol duration than other CCs, which may include use of a reduced symbol duration as compared with symbol durations of the other CCs. A shorter symbol duration may be associated with increased subcarrier spacing.
  • a TTI in an eCC may consist of one or multiple symbols. In some cases, the TTI duration (that is, the number of symbols in a TTI) may be variable. In some cases, an eCC may utilize a different symbol duration than other CCs, which may include use of a reduced symbol duration as compared with symbol durations of the other CCs. A shorter symbol duration is associated with increased subcarrier spacing.
  • a device such as a UE 115 or base station 105, utilizing eCCs may transmit wideband signals (e.g., 20, 40, 60, 80 MHz, etc. ) at reduced symbol durations (e.g., 16.67 microseconds) .
  • a TTI in eCC may consist of one or multiple symbols. In some cases, the TTI duration (that is, the number of symbols in a TTI) may be variable.
  • 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 New Radio
  • LBT listen-before-talk
  • operations in unlicensed bands may be based on a carrier aggregation (CA) configuration in conjunction with component carriers (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 duplexing (FDD) , time division duplexing (TDD) or a combination of both.
  • FDD frequency division duplexing
  • TDD time division duplexing
  • the wireless communications system 100 may reduce a FAR for polar codes by utilizing a constant number of CRC bits and selecting a subset of candidate paths through a code tree. Beneficially, reducing the number of candidate paths to less that the list size number reduces the false alarm rate.
  • FIG. 2 illustrates an example of a wireless communication system 200 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Wireless communication system 200 may include a base station 105-a and a UE 115-a.
  • Base station 105-a is an example of base station 105 of FIG. 1
  • user equipment 115-a is an example of user equipment 115 of FIG. 1.
  • Base station 105-a may use polar encoding to encode information bits for transmission to UE 115-a via a communication channel 225.
  • user equipment 115-a may encode data for transmission to base station 105-a or another UE using these same techniques.
  • base station 105-a may encode data for transmission to another base station 105-a using these same techniques.
  • devices other than base station 105-a and user equipment 115-a may use the techniques described herein.
  • base station 105-a may include a data source 205, an error detecting code (EDC) encoder 210, a polar encoder 215, and a modulator 220.
  • the data source 205 may provide an information vector of s information bits to be encoded and transmitted to the UE 115-a.
  • the data source 205 may be coupled to a network, a storage device, or the like.
  • the data source 205 may output the information vector to the EDC encoder 210.
  • the EDC encoder 210 may apply an error detecting algorithm to the information vector to generate an EDC.
  • the EDC may be a code to enable the UE 115-a to detect an error in the information vector due to, for example, corruption due to noise in a transmission channel 225.
  • the EDC algorithm may be a cyclic redundancy check (CRC) algorithm and the EDC may be a CRC.
  • CRC cyclic redundancy check
  • the length of the EDC in bits may be selected to enable the UE 115-a to identify errors in a received message that includes the information vector and to suppress a false alarm rate. Increasing the length of the EDC in bits improves the ability to identify errors and reduces the false alarm rate.
  • the EDC may have a length of m+c bits, where m is the number of bits in the EDC for error detection and c is the number of bits in the EDC for false alarm suppression.
  • the length m may be a fixed number (e.g., 16 bits) and the length c may be a function of a false alarm rate.
  • each of the base station 105-a and the UE 115-a may be aware of length m, and may derive length c from the number of bits in the EDC and length m. Having a length of m+c bits may serve dual purposes of maintaining an acceptable rate of signal detection and for suppressing the false alarm rate.
  • the EDC encoder 210 may append the EDC to the information vector to generate a payload having s + m + c bits.
  • the EDC encoder 210 may output the payload to the polar encoder 215.
  • the polar encoder 215 may perform a polar encoding technique on the payload to generate a polar-encoded codeword (e.g., of N bits) .
  • the modulator 220 may modulate the polar-encoded codeword for transmission via wireless communication channel 225 which may distort the signal carrying the polar-encoded codeword with noise.
  • the UE 115-a may receive a signal that includes the polar-encoded codeword.
  • the UE 115-a may include a demodulator 230, a decoder 235, and a data sink 240.
  • the demodulator 230 may receive the signal including the polar-encoded codeword and input the demodulated signal into decoder 235 for decoding of the polar-encoded codeword.
  • the demodulated signal may be, for example, a sequence of logarithmic-likelihood ratio (LLR) values representing a probability value of a received bit being a ‘0’ or a ‘1’ .
  • the decoder 235 may perform a list decoding algorithm on the LLR values and may provide an output.
  • the decoder 235 may output a bit sequence of the information vector (e.g., the s information bits input to the EDC encoder 210) to a data sink 240 for use, storage, communication to another device, communication via a network, or the like. Otherwise, the decoder 235 may indicate that decoding was unsuccessful.
  • the decoder 235 may indicate that decoding was unsuccessful.
  • FIG. 2 describes the base station 105-a performing the encoding and user equipment 115-a performing the decoding, the roles may be reversed. Moreover, devices other than the base station 105-a and the user equipment 115-a may perform the encoding and decoding.
  • a conventional decoder may incorrectly output a bit sequence when in fact a different bit sequence was transmitted or no bit sequence was transmitted (i.e., the received signal is random or noise) . This is referred to as a false alarm.
  • the decoder 235 may reduce a false alarm rate by intelligently selecting a subset of candidate paths output by a list decoder for error checking, as described below.
  • FIG. 3 illustrates an example of a decoder 235-a that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the decoder 235-a is an example of a decoder 235 of FIG. 2.
  • the decoder 235-a may include a list decoder 305, a false alarm reducer 310, and an error detector 315.
  • the list decoder 305 may perform a path search algorithm to search a code tree for decoding a received polar-encoded codeword. As explained below in further detail, the list decoder 305 may identify the L best candidate paths through the code tree.
  • the false alarm reducer 310 may select a subset of the L best paths through the code tree on which to perform an error detection algorithm.
  • the false alarm reducer 310 may intelligently select Z of the L paths on which to perform error detection to reduce the false alarm rate.
  • the error detector 315 may iteratively perform an error detection algorithm on bit sequences corresponding to the selected Z paths. The error detector 315 may stop as soon as one of the bit sequences passes the error detection algorithm, or all of the bit sequences have been checked and none passed the error detection algorithm.
  • FIG. 4 illustrates an example of a flow diagram 400 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the decoder 235-a may receive a polar-encoded codeword for decoding.
  • the flow diagram 400 also refers to FIGs. 5-8 to illustrate aspects of the decoding process.
  • the flow diagram may begin at 405 and proceed to block 410.
  • the list decoder 305 of decoder 235-a may perform a list decoding algorithm and identify L candidate paths through a code tree.
  • the list decoder 305 may be, for example, a successive cancellation list (SCL) decoder or the like.
  • the list decoder 305 may search for the L best candidate paths through a code tree. To do so, the list decoder 305 may determine a path metric for identifying which of the possible candidate paths through a code tree are the L best candidate paths.
  • FIGs. 5-7, described below, provide examples on how to identify the L best candidate paths through a code tree.
  • FIG. 5 illustrates an example of a code tree 500 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Code tree 500 is a graphical representation of how list decoder 305 performs the list decoding process.
  • the code tree 500 includes multiple nodes 505 and a line between pairs of nodes is referred to herein as a branch 550 (e.g., branch 550-a connects node 505-a to node 505-b, and branch 550-b connects node 505-a to node 505-i) .
  • Each branch 550 is associated with a possible value for a bit, which may be a ‘1’ or a ‘0’ .
  • Branch 550-a is associated with a bit being a ‘0’
  • branch 550-b is associated with a bit being a ‘1’
  • Each branch 550 is also associated with a value for a metric.
  • the metric value may represent a cost for proceeding from one node to the next.
  • the metric may be, for example, a distance metric (e.g., LLR converted to a distance) or a probability metric (e.g., LLR, etc. ) .
  • the metric may represent a likelihood of moving from one node to the next based on whether the next bit in the sequence is a 1 or a 0. In some instances, the metric may represent a distance value between nodes.
  • the list decoder 305 may process demapped symbols output by the demodulator 230 and determine the probability (e.g., LLR value) of whether bits corresponding to the demapped symbols are ‘0s’ or ‘1s’ .
  • the determination of the probability of whether a particular bit value is a ‘0’ or a ‘1’ may also be a function of prior decoding decisions. This process is reflected in the code tree 500.
  • the list decoder 305 may initially begin at node 505-a and process the LLR values to determine along which branch to procced. At node 505-a, the list decoder 305 may determine the likelihood of whether a LLR value is a ‘0’ or a ‘1’ , and hence may proceed to either node 505-b or node 505-i. Node 505-b may be associated with the first bit being a ‘0’ , and node 505-i may be associated with the first bit being a ‘1’ .
  • Each branch 550-a, 550-b is associated with a value for a metric and the list decoder 305 accumulates the metric values as it traverses branches 550 in the code tree 500 to generate a path metric. Accumulation to form the path metric may involve, for example, adding the metric value of each branch along a path.
  • a path may refer to a particular route between nodes 505 through the code tree 500.
  • the list decoder 305 selects which of the paths is the best using path metrics.
  • the list decoder 305 may maintain a respective path metric for every possible path through code tree 500. Retaining path metrics for all possible paths may be computationally expensive and, in other instances, the list decoder 305 may use the path metrics to prune selected paths.
  • node 505-a to node 505-b there are two possible paths (e.g., node 505-a to node 505-b, and node 505-a to node 505-i) , and hence the list decoder 305 may maintain both paths.
  • there are four possible paths e.g., node 505-a to node 505-b to node 505-c, node 505-a to node 505-b to node 505-f, node 505-a to node 505-i to node 505-j, and node 505-a to node 505-i to node 505-m) , and hence the list decoder 305 may maintain all 4 paths.
  • FIGs. 6-7 depict the process for pruning paths when proceeding from level two to level three.
  • FIG. 6 illustrates an example of a code tree 600 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the list decoder 305 is extending the paths 610 from the nodes at level 2 to the nodes at level 3.
  • path 610-a includes node 505-a, 505-b, and 505-c, and may be extended to either node 505-d or 505-e.
  • Path 610-b includes node 505-a, 505-b, and 505-f, and may be extended to either node 505-g or 505-h.
  • Path 610-c includes node 505-a, 505-i, and 505-j, and may be extended to either node 505-k or 505-l.
  • Path 610-d includes node 505-a, 505-i, and 505-m, and may be extended to either node 505-n or 505-o.
  • the list decoder 305 may retain L paths having the best path metrics.
  • the list decoder 305 may use the path metrics, which are accumulated metric values, for determining which paths to keep (e.g., minimum accumulated distance, highest accumulated probability, etc. ) .
  • the list decoder 305 may add a metric value for the branch proceeding from node 505-c to node 505-d to an accumulated value for path 610-a to determine a path metric to extend path 610-a to node 505-d.
  • the list decoder 305 may make a similar determination for extending all of the paths 610 to any of the nodes in level 3.
  • the path metrics e.g., from highest to lowest, from lowest to highest, etc.
  • select 4 of the 8 paths that have the best path metric e.g., minimum accumulated distance, highest accumulated probability, etc.
  • FIG. 7 illustrates an example of a code tree 700 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • list decoder 305 retains four of the possible paths.
  • paths 720-a, 720-b, 720-c, and 720-d have the best path metrics and hence are maintained.
  • path 720-a includes node 505-a, 505-b, 505-f, and 505-g.
  • Path 720-b includes node 505-a, 505-i, 505-j, and 505-k.
  • Path 720-c includes node 505-a, 505-i, 505-m, and 505-n.
  • Path 720-d includes node 505-a, 505-i, 505-m, and 505-o.
  • the other paths may be discarded and not used in subsequent analysis.
  • the principles described with respect to FIGs. 5-7 may be extended to a code tree having any number of levels, and the list decoder 305 may select a list size number of candidate paths having the best path metrics through such a code tree.
  • the decoder 235-a may intelligently select a subset of the candidate paths to reduce the false alarm rate.
  • the decoder 235-a may have the option of utilizing a larger list size number to improve BLER, but may cull the list size number to reduce the FAR.
  • the decoder 235-a may desire to have a predetermined detection probability and may select the list size to achieve that probability.
  • the decoder 235-a may include a false alarm reducer 310 to intelligently select a subset of the candidate paths to reduce the false alarm rate. Thus, the decoder 235-a may increase signal detection rate and suppress the false alarm rate.
  • the false alarm reducer 310 may select a subset of the candidate paths having the best path metrics.
  • the number of candidate paths to select in the subset may be a function of the number of bits in the EDC.
  • the EDC may be composed of two sets of bits, with one set being of length m and the other being of length c.
  • the set of bits of length m may be the number of bits of the EDC for signal detection at a desired BLER and the set of bits of length c may be used for false alarm suppression.
  • length c may be a constant integer and may be, for example, the number of EDC bits for list decoding (e.g., number of CRC bits for CA-SCL decoding) .
  • the number of paths Z to include in the subset may be a function of length c.
  • false alarm reducer 310 may order the L candidate paths 720-a, 720-b, 720-c, and 720-c using their respective path metrics and select a subset Z of the L candidate paths that have the best path metrics. Selection of a subset of paths is shown in FIG. 8.
  • FIG. 8 illustrates an example of a code tree 800 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the false alarm reducer 310 may sort the path metrics from a highest accumulated probability value to a lowest accumulated probability value. In this example, false alarm reducer 310 thus selects the Z paths having the highest accumulated probability values. In the example depicted in FIGs.
  • path 720-b that includes bits ‘1’ , ‘0’ , ‘0’ may have a path metric of 0.36
  • path 720-d that includes bits ‘1’ , ‘1’ , ‘1’ may have a path metric of 0.25
  • path 720-a that includes bits ‘0’ , ‘1’ , ‘0’ may have a path metric of 0.16
  • path 720-c that includes bits ‘1’ , ‘1’ , ‘0’ may have a path metric of 0.11.
  • false alarm reducer 310 selects the Z paths having the highest accumulated probability values.
  • false alarm reducer 310 selects two paths (e.g., path 720-b, 720-d) having the higher path metrics and discards the other two paths (e.g., 720-a, 720-c) having the lower path metrics.
  • the false alarm reducer 310 may sort the path metrics from a lowest accumulated distance value to a highest accumulated distance value. In this example, false alarm reducer 310 thus selects the Z paths having the lowest accumulated distance values.
  • path 720-b that includes bits ‘1’ , ‘0’ , ‘0’ may have a path metric of 0.11
  • path 720-d that includes bits ‘1’ , ‘1’ , ‘1’ may have a path metric of 0.15
  • path 720-a that includes bits ‘0’ , ‘1’ , ‘0’ may have a path metric of 0.16
  • path 720-c that includes bits ‘1’ , ‘1’ , ‘0’ may have a path metric of 0.20.
  • false alarm reducer 310 selects the Z paths having the lowest accumulated distance values.
  • false alarm reducer 310 selects two paths (e.g., path 720-b, 720-d) having the lower path metrics and discards the other two paths (e.g., 720-a, 720-c) having the higher path metrics. False alarm reducer 310 may then pass bit sequences corresponding to the selected Z candidates to the error detector 315.
  • false alarm reducer 310 may get a bit sequence of a particular path of the Z candidate paths having the best path metric that has not yet been checked by the error detector 315 at 420.
  • the decoder 235-a may get a bit sequence of a particular path of the Z candidate paths having a next best path metric that has not yet been checked.
  • the decoder 235-a may get the bit sequence ‘1’ , ‘0’ , ‘0’ of path 720-b with the path metric having the highest accumulated probability value.
  • the decoder 235-a may get the bit sequence ‘1’ , ‘1’ , ‘1’ of path 720-d with the path metric having the next highest accumulated probability value.
  • the error detector 315 may perform an error detecting algorithm for determining whether a bit sequence passes (e.g., a CRC algorithm) .
  • the polar-encoded codeword may be generated by polar encoding a payload that includes an information vector and an EDC. If the bit sequence of a particular path is the same as the bit sequence of the payload, the error detector 315 should be able to parse the bit sequence to recover the information vector and the received EDC. The error detector 315 may then generate a calculated EDC using the parsed information vector by applying the same algorithm to the parsed information vector as applied by the EDC encoder 210.
  • the error detector 315 determines that it was able to successfully able to decode the polar-encoded codeword and outputs, at 430, the bit sequence of the information vector, with or without the EDC. If not the same, the error detector 315 informs the false alarm reducer 310 of the decoding failure, and the flow diagram 400 proceeds to 435.
  • the false alarm reducer 310 determines whether there are any additional of the Z candidate paths that have not been checked. If all paths have been checked, the false alarm reducer 310 and/or the error detector 315 indicates a decoding failure at 440. If not all paths of the Z candidate paths have been checked, the flow diagram 400 may return to 420 to get and check a bit sequence associated with a next candidate path of the Z candidate paths having a next highest path metric. The flow diagram 400 may continue until a bit sequence passes the error detection algorithm or bit sequences associated with all Z candidate paths have failed the error detection algorithm. The operations of the flow diagram 400 may be performed in other orders and/or by other components that those described herein.
  • a code rate may impact the probability of successfully decoding a polar-encoded codeword.
  • the code rate may refer to the number of transmitted information bits divided by the total number of transmitted bits. For example, a code rate of 1/3 means that one out of every three transmitted bits is an information bit.
  • a code rate of 1/3 means that one out of every three transmitted bits is an information bit.
  • the Polar codes may be similar to Reed-Muller codes and thus a satisfactory detection rate is achieved by selecting a subset Z of the L candidate paths having the best path metrics.
  • code rate > 1/2 the minimum hamming distance is less large because rows in a generated matrix corresponding to information bits have a comparatively smaller weight.
  • the Polar codes may perform less like Reed-Muller codes and thus a may not achieve a satisfactory detection rate by selecting a subset Z of the L candidate paths having the best path metric.
  • selection of a subset of the candidate paths may be performed in another manner, as described below.
  • FIG. 9 illustrates an example of a flow diagram 900 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the decoder 235-a may receive a polar-encoded codeword for decoding. The flow diagram may begin at 905 and proceed to block 910.
  • list decoder 305 may perform a decoding algorithm and identify L candidate paths through a code tree, in a manner similar to or the same as described above at 410 in Fig. 4.
  • false alarm reducer 310 may determine whether a code rate satisfies a threshold. In an example, false alarm reducer 310 may determine whether a code rate is above a threshold (e.g., code rate > 1/2) . If above the threshold, the flow diagram may proceed to 920. If equal to or below the threshold, the flow diagram 900 may proceed to 925.
  • a threshold e.g., code rate > 1/2
  • false alarm reducer 310 may apply a path selection function to select Z of the L candidate paths.
  • the path selection function may select a predetermined number of the Z candidate paths that have the best path metrics, and apply a path selection algorithm to select a remainder of the L candidate paths.
  • the false alarm reducer 310 may sort the remainder of the L candidate paths prior to applying the path selection function and/or path selection algorithm.
  • false alarm reducer 310 may apply a path selection algorithm to select 3Z/4 paths.
  • the path selection algorithm may randomly select paths from the remaining L –Z/4 candidate paths output by list decoder 305.
  • the path selection algorithm may evenly select paths from the remaining L –Z/4 paths.
  • An example of evenly selecting paths includes selecting a path from the remaining L –Z/4 paths at periodic intervals (e.g., every other path, every third path, etc. ) until 3Z/4 paths have been selected.
  • Another example of evenly selecting paths includes applying a formula to determine which paths to select.
  • Other path selection algorithms may also be used.
  • false alarm reducer 310 may select Z of the L candidate paths that have the best path metrics at 925, as described above at 415 of FIG. 4. Via either 920 or 925, the flow diagram 900 may proceed to 930. Operations, 930, 935, 940, 945, and 950 of flow diagram 900 are similar to or the same as operations 420, 425, 430, 435, and 440 of flow diagram 400. The operations of the flow diagram 900 may be performed in other orders and/or by other components that those described herein.
  • a receiver may intelligently select a subset of the list size number of candidate paths output by a list decoder to reduce the false alarm rate. Further, the intelligent selection of the candidate path subset may consider a code rate to de-couple path metric from which candidate paths are selected for the subset. Moreover, the receiver has the option to expand a list size L to increase the likelihood that the list decoder 305 does not discard the path of the bit sequence corresponding to the transmitted information vector, without a corresponding increase in the false alarm rate. Additionally, the decoding parameter of the list size number of candidate paths is advantageously independent of the encoding parameter of the number of bits of the EDC.
  • an encoder at a transmitter may generate an EDC having a constant number of bits while permitting a list decoder at a receiver to decode with a variable list size.
  • the false alarm rate is kept unchanged even with an increasing list size for list decoding, while permitting a receiver to increase the list size beyond the conventional relationship to the number of CRC bits to improve BLER.
  • FIG. 10 shows a block diagram 1000 of a wireless device 1005 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Wireless device 1005 may be an example of aspects of a user equipment (UE) 115 or base station 105 as described with reference to FIG. 1.
  • Wireless device 1005 may include receiver 1010, communications manager 1015, and transmitter 1020.
  • Wireless device 1005 may also include a processor. Each of these components may be in communication with one another (e.g., via one or more buses) .
  • Receiver 1010 may receive a signal that includes a polar-encoded codeword.
  • the receiver 1010 may include components such as amplifiers, filters, downconverters, analog-to-digital converters, and the like, for receiving waveforms via one or more antennas.
  • the receiver 1010 may be an example of aspects of the transceiver 1335 described with reference to FIG. 13.
  • Communications manager 1015 may be an example of aspects of the communications manager 1315 described with reference to FIG. 13.
  • Communications manager 1015 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 communications manager 1015 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 communications manager 1015 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.
  • communications manager 1015 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.
  • communications manager 1015 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.
  • Communications manager 1015 may identify, by a list decoder, a list size number of paths through a code tree as candidate paths based on respective path metrics for each of the paths during decoding of a polar-encoded codeword, select a subset of the candidate paths for performing an error detection algorithm, where a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword, and iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • Transmitter 1020 may transmit signals generated by other components of the device.
  • the transmitter 1020 may be collocated with a receiver 1010 in a transceiver module.
  • the transmitter 1020 may be an example of aspects of the transceiver 1335 described with reference to FIG. 13.
  • the transmitter 1020 may include a single antenna, or it may include a set of antennas.
  • FIG. 11 shows a block diagram 1100 of a wireless device 1105 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Wireless device 1105 may be an example of aspects of a wireless device 1005 or a UE 115 or base station 105 as described with reference to FIGs. 1 and 10.
  • wireless device 1105 may include receiver 1110, communications manager 1115, and transmitter 1120.
  • wireless device 1105 may also include a processor. Each of these components may be in communication with one another (e.g., via one or more buses) .
  • Receiver 1110 may receive a signal that includes a polar-encoded codeword.
  • the receiver 1110 may be an example of aspects of the receiver 1010 or transceiver 1335 described with reference to FIGs. 10 or 13.
  • Communications manager 1115 may be an example of aspects of the communications manager 1315 described with reference to FIG. 13.
  • Communications manager 1115 may also include list decoder 1125, false alarm reducer 1130, and error detector 1135.
  • List decoder 1125 may identify a list size number of paths through a code tree as candidate paths based on respective path metrics for each of the paths during decoding of a polar-encoded codeword. In some cases, list decoder 1125 may be a successive cancellation list (SCL) decoder.
  • SCL successive cancellation list
  • False alarm reducer 1130 may select a subset of the candidate paths for performing an error detection algorithm, where a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword. In some cases, selecting the subset of the candidate paths includes sorting the candidate paths according to the respective path metrics. In some cases, selecting the subset of the candidate paths includes selecting a predetermined number of the candidate paths having a best of the respective path metrics. In some cases, the best of the respective path metrics is determined based at least on a probability metric or a distance metric. In some cases, the number of bits in the error detection code includes a first number of bits and a second number of bits. In some cases, false alarm reducer 1130 may determine the number of the candidate paths to include in the subset as a function of the second number of bits.
  • False alarm reducer 1130 may determine whether a code rate associated with the polar-encoded codeword satisfies a code rate threshold. In some cases, false alarm reducer 1130 may select a predetermined number of the candidate paths having a best of the respective path metrics based at least in part on determining that the code rate satisfies the code rate threshold. In some cases, the best of the respective path metrics is determined based at least on a probability metric or a distance metric. In some cases, satisfying the code rate threshold may be a determination that the code rate equals or is below the code rate threshold.
  • False alarm reducer 1130 may select a first predetermined number of the sorted candidate paths having a best of the respective path metrics and a second predetermined number of the sorted candidate paths using a path selection algorithm.
  • the path selection algorithm randomly selects from a remaining of the sorted candidate paths. In some cases, the path selection algorithm evenly selects from a remaining of the sorted candidate paths.
  • Error detector 1135 may iteratively perform an error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the error detection algorithm is a CRC algorithm.
  • Transmitter 1120 may transmit signals generated by other components of the device.
  • the transmitter 1120 may be collocated with a receiver 1110 in a transceiver module.
  • the transmitter 1120 may be an example of aspects of the transceiver 1335 described with reference to FIG. 13.
  • the transmitter 1120 may include a single antenna, or it may include a set of antennas.
  • FIG. 12 shows a block diagram 1200 of a communications manager 1215 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the communications manager 1215 may be an example of aspects of a communications manager 1015, a communications manager 1115, or a communications manager 1315 described with reference to FIGs. 10, 11, and 13.
  • the communications manager 1215 may include list decoder 1220, false alarm reducer 1225, and error detector 1230. Each of these modules may communicate, directly or indirectly, with one another (e.g., via one or more buses) .
  • List decoder 1220 may identify a list size number of paths through a code tree as candidate paths based on respective path metrics for each of the paths during decoding of a polar-encoded codeword.
  • list decoder 1220 is a successive cancellation list (SCL) decoder or a CRC-aided SCL decoder.
  • False alarm reducer 1225 may select a subset of the candidate paths for performing an error detection algorithm, where a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword.
  • the number of bits in the error detection code includes a first number of bits and a second number of bits.
  • determining the number of the candidate paths to include in the subset is a function of the second number of bits.
  • False alarm reducer 1225 may determine whether a code rate associated with the polar-encoded codeword satisfies a code rate threshold. In some cases, satisfying the code rate threshold is a determination that the code rate equals or is below the code rate threshold.
  • False alarm reducer 1225 may select a first predetermined number of the sorted candidate paths having a best of the respective path metrics and a second predetermined number of the sorted candidate paths using a path selection algorithm.
  • the path selection algorithm randomly selects from a remaining of the sorted candidate paths.
  • the path selection algorithm evenly selects from a remaining of the sorted candidate paths.
  • selecting the subset of the candidate paths includes selecting a predetermined number of the candidate paths having a best of the respective path metrics.
  • the best of the respective path metrics is determined based at least on a probability metric or a distance metric.
  • selecting the subset of the candidate paths further includes sorting the candidate paths according to the respective path metrics.
  • Error detector 1230 may iteratively perform an error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the error detection algorithm is a CRC algorithm.
  • FIG. 13 shows a diagram of a system 1300 including a device 1305 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Device 1305 may be an example of or include the components of wireless device 1005, wireless device 1105, or a UE 115 as described above, e.g., with reference to FIGs. 1, 10 and 11.
  • Device 1305 may include components for bi-directional voice and data communications including components for transmitting and receiving communications, including UE communications manager 1315, processor 1320, memory 1325, software 1330, transceiver 1335, antenna 1340, and I/O controller 1345. These components may be in electronic communication via one or more busses (e.g., bus 1310) .
  • Device 1305 may communicate wirelessly with one or more base stations 105.
  • Processor 1320 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 1320 may be configured to operate a memory array using a memory controller.
  • a memory controller may be integrated into processor 1320.
  • Processor 1320 may be configured to execute computer-readable instructions stored in a memory to perform various functions (e.g., functions or tasks supporting false alarm rate reduction for polar codes) .
  • Memory 1325 may include random access memory (RAM) and read only memory (ROM) .
  • the memory 1325 may store computer-readable, computer-executable software 1330 including instructions that, when executed, cause the processor to perform various functions described herein.
  • the memory 1325 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 1330 may include code to implement aspects of the present disclosure, including code to support false alarm rate reduction for polar codes.
  • Software 1330 may be stored in a non-transitory computer-readable medium such as system memory or other memory. In some cases, the software 1330 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 1335 may communicate bi-directionally, via one or more antennas, wired, or wireless links as described above.
  • the transceiver 1335 may represent a wireless transceiver and may communicate bi-directionally with another wireless transceiver.
  • the transceiver 1335 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 1340. However, in some cases the device may have more than one antenna 1340, which may be capable of concurrently transmitting or receiving multiple wireless transmissions.
  • I/O controller 1345 may manage input and output signals for device 1305. I/O controller 1345 may also manage peripherals not integrated into device 1305. In some cases, I/O controller 1345 may represent a physical connection or port to an external peripheral. In some cases, I/O controller 1345 may utilize an operating system such as or another known operating system. In other cases, I/O controller 1345 may represent or interact with a modem, a keyboard, a mouse, a touchscreen, or a similar device. In some cases, I/O controller 1345 may be implemented as part of a processor. In some cases, a user may interact with device 1305 via I/O controller 1345 or via hardware components controlled by I/O controller 1345.
  • FIG. 14 shows a diagram of a system 1400 including a device 1405 that supports false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • Device 1405 may be an example of or include the components of wireless device 1105, wireless device 1205, or a base station 105 as described above, e.g., with reference to FIGs. 1, 11 and 12.
  • Device 1405 may include components for bi-directional voice and data communications including components for transmitting and receiving communications, including base station communications manager 1415, processor 1420, memory 1425, software 1430, transceiver 1435, antenna 1440, network communications manager 1445, and base station controller 1450. These components may be in electronic communication via one or more busses (e.g., bus 1410) .
  • Device 1405 may communicate wirelessly with one or more UEs 115.
  • Base station communications manager 1415 may manage communications with other base station 105, and may include a controller or scheduler for controlling communications with UEs 115 in cooperation with other base stations 105. For example, the base station communications manager 1415 may coordinate scheduling for transmissions to UEs 115 for various interference mitigation techniques such as beamforming or joint transmission. In some examples, base station communications manager 1415 may provide an X2 interface within an Long Term Evolution (LTE) /LTE-Awireless communication network technology to provide communication between base stations 105.
  • LTE Long Term Evolution
  • LTE-Awireless communication network technology to provide communication between base stations 105.
  • Processor 1420 may include an intelligent hardware device, (e.g., a general-purpose processor, a DSP, a 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 1420 may be configured to operate a memory array using a memory controller.
  • a memory controller may be integrated into processor 1420.
  • Processor 1420 may be configured to execute computer-readable instructions stored in a memory to perform various functions (e.g., functions or tasks supporting false alarm rate reduction for polar codes) .
  • Memory 1425 may include RAM and ROM.
  • the memory 1425 may store computer-readable, computer-executable software 1430 including instructions that, when executed, cause the processor to perform various functions described herein.
  • the memory 1425 may contain, among other things, a BIOS which may control basic hardware and/or software operation such as the interaction with peripheral components or devices.
  • Software 1430 may include code to implement aspects of the present disclosure, including code to support false alarm rate reduction for polar codes.
  • Software 1430 may be stored in a non-transitory computer-readable medium such as system memory or other memory. In some cases, the software 1430 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 1435 may communicate bi-directionally, via one or more antennas, wired, or wireless links as described above.
  • the transceiver 1435 may represent a wireless transceiver and may communicate bi-directionally with another wireless transceiver.
  • the transceiver 1435 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 1440. However, in some cases the device may have more than one antenna 1440, which may be capable of concurrently transmitting or receiving multiple wireless transmissions.
  • Network communications manager 1445 may manage communications with the core network (e.g., via one or more wired backhaul links) .
  • the network communications manager 1445 may manage the transfer of data communications for client devices, such as one or more UEs 115.
  • Base station controller 1450 may manage communications with other base station 105, and may include a controller or scheduler for controlling communications with UEs 115 in cooperation with other base stations 105. For example, the base station controller 1450 may coordinate scheduling for transmissions to UEs 115 for various interference mitigation techniques such as beamforming or joint transmission. In some examples, base station controller 1450 may provide an X2 interface within an LTE/LTE-Awireless communication network technology to provide communication between base stations 105.
  • FIG. 15 shows a flowchart illustrating a method 1500 for false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the operations of method 1500 may be implemented by a UE 115 or base station 105 or its components as described herein.
  • the operations of method 1500 may be performed by a communications manager as described with reference to FIGs. 10 through 12.
  • a UE 115 or base station 105 may execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the UE 115 or base station 105 may perform aspects of the functions described below using special-purpose hardware.
  • the UE 115 or base station 105 may identify, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword.
  • the operations of block 1505 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1505 may be performed by a list decoder as described with reference to FIGs. 10 through 12.
  • the UE 115 or base station 105 may select a subset of the candidate paths for performing an error detection algorithm, wherein a number of the candidate paths to include in the subset is a function of a number of bits in an error detection code associated with the polar-encoded codeword.
  • the operations of block 1510 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1510 may be performed by a false alarm reducer as described with reference to FIGs. 10 through 12.
  • the UE 115 or base station 105 may iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the operations of block 1515 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1515 may be performed by an error detector as described with reference to FIGs. 10 through 12.
  • FIG. 16 shows a flowchart illustrating a method 1600 for false alarm rate reduction for polar codes in accordance with various aspects of the present disclosure.
  • the operations of method 1600 may be implemented by a UE 115 or base station 105 or its components as described herein.
  • the operations of method 1600 may be performed by a communications manager as described with reference to FIGs. 10 through 12.
  • a UE 115 or base station 105 may execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the UE 115 or base station 105 may perform aspects of the functions described below using special-purpose hardware.
  • the UE 115 or base station 105 may determine whether a code rate associated with the polar-encoded codeword satisfies a code rate threshold.
  • the operations of block 1605 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1605 may be performed by a false alarm reducer as described with reference to FIGs. 10 through 12.
  • the UE 115 or base station 105 may identify, by a list decoder, a list size number of paths through a code tree as candidate paths based at least in part on respective path metrics for each of the paths during decoding of a polar-encoded codeword.
  • the operations of block 1610 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1610 may be performed by a list decoder as described with reference to FIGs. 10 through 12.
  • the UE 115 or base station 105 may select a subset of the candidate paths for performing an error detection algorithm by selecting a first predetermined number of the sorted candidate paths having a best of the respective path metrics and a second predetermined number of the sorted candidate paths using a path selection algorithm. In some cases, selecting the subset of the candidate paths includes sorting the candidate paths according to the respective path metrics.
  • the operations of block 1615 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1615 may be performed by a false alarm reducer as described with reference to FIGs. 10 through 12.
  • the UE 115 or base station 105 may iteratively perform the error detection algorithm on a bit sequence corresponding to a respective candidate path in the candidate path subset until a particular bit sequence of the bit sequences passes the error detection algorithm or all of the bit sequences fail the error detection algorithm.
  • the operations of block 1620 may be performed according to the methods described with reference to FIGs. 1 through 9. In certain examples, aspects of the operations of block 1620 may be performed by an error detector as described with reference to FIGs. 10 through 12.
  • 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 time division multiple access (TDMA) system may implement a radio technology such as Global System for Mobile Communications (GSM) .
  • GSM Global System for Mobile Communications
  • An orthogonal frequency division multiple access (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 802.11 Wi-Fi
  • IEEE 802.16 WiMAX
  • IEEE 802.20 WiMAX
  • Flash-OFDM Flash-OFDM
  • UTRA and E-UTRA are part of Universal Mobile Telecommunications system (UMTS) .
  • 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) are releases of Universal Mobile Telecommunications System (UMTS) that use E-UTRA.
  • UTRA, E-UTRA, UMTS, LTE, LTE-A, NR, and Global System for Mobile communications are described in documents from the organization named “3rd Generation Partnership Project” (3GPP) .
  • CDMA2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2) .
  • the techniques described herein may be used for the systems and radio technologies mentioned above as well as other systems and radio technologies. While aspects 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 evolved node B (eNBs) provide coverage for various geographical regions.
  • eNBs evolved node B
  • each eNB, 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) , next generation NodeB (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, digital subscriber line (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

  • Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne des procédés, des systèmes et des dispositifs pour une réduction du taux de fausses alarmes pour des codes polaires. Un décodeur de liste peut identifier un nombre de chemins de taille de liste à travers un arbre de code en tant que trajets candidats sur la base, au moins en partie, de métriques de trajet respectives pour chacun des trajets pendant le décodage d'un mot de code codé en codage polaire. Un réducteur de fausse alarme peut sélectionner un sous-ensemble des trajets candidats pour effectuer un algorithme de détection d'erreur, un nombre de chemins candidats à inclure dans le sous-ensemble étant une fonction d'un nombre de bits dans un code de détection d'erreur associé au mot codé en codage polaire. Un détecteur d'erreur peut effectuer de manière itérative l'algorithme de détection d'erreur sur une séquence de bits correspondant à un trajet candidat respectif dans le sous-ensemble de trajets candidats jusqu'à ce qu'une séquence de bits particulière des séquences de bits passe l'algorithme de détection d'erreur ou toutes les séquences de bits échouent lors de l'algorithme de détection d'erreur.
PCT/CN2017/072800 2017-02-02 2017-02-02 Réduction du taux de fausses alarmes pour codes polaires WO2018141080A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/072800 WO2018141080A1 (fr) 2017-02-02 2017-02-02 Réduction du taux de fausses alarmes pour codes polaires

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/072800 WO2018141080A1 (fr) 2017-02-02 2017-02-02 Réduction du taux de fausses alarmes pour codes polaires

Publications (1)

Publication Number Publication Date
WO2018141080A1 true WO2018141080A1 (fr) 2018-08-09

Family

ID=63039344

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/072800 WO2018141080A1 (fr) 2017-02-02 2017-02-02 Réduction du taux de fausses alarmes pour codes polaires

Country Status (1)

Country Link
WO (1) WO2018141080A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110830166A (zh) * 2019-10-31 2020-02-21 哈尔滨工业大学（深圳） 联合检测译码方法、装置、计算机设备及存储介质
WO2020062061A1 (fr) * 2018-09-28 2020-04-02 Qualcomm Incorporated Réduction de complexité pour décodage de liste d'annulation séquentielle de codes polaires

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104539393A (zh) * 2015-01-07 2015-04-22 北京邮电大学 一种基于极化码的信源编码方法
CN105075163A (zh) * 2013-11-20 2015-11-18 华为技术有限公司 极化码的处理方法和设备
WO2016172940A1 (fr) * 2015-04-30 2016-11-03 华为技术有限公司 Procédé de décodage et dispositif de décodage pour code polaire

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105075163A (zh) * 2013-11-20 2015-11-18 华为技术有限公司 极化码的处理方法和设备
CN104539393A (zh) * 2015-01-07 2015-04-22 北京邮电大学 一种基于极化码的信源编码方法
WO2016172940A1 (fr) * 2015-04-30 2016-11-03 华为技术有限公司 Procédé de décodage et dispositif de décodage pour code polaire

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020062061A1 (fr) * 2018-09-28 2020-04-02 Qualcomm Incorporated Réduction de complexité pour décodage de liste d'annulation séquentielle de codes polaires
CN110830166A (zh) * 2019-10-31 2020-02-21 哈尔滨工业大学（深圳） 联合检测译码方法、装置、计算机设备及存储介质

Similar Documents

Publication Publication Date Title
US12034534B2 (en) Dynamic frozen bits and error detection for polar codes
KR102683466B1 (ko) 업링크 제어 정보에 대한 폴라 코드들
EP3619813B1 (fr) Décodage par list de codes polaires avec termination précoce
US11695505B2 (en) Reduced overhead error detection code design for decoding a codeword
WO2018209486A1 (fr) Fin anticipée de décodage de liste d'annulation successive
US11646828B2 (en) HARQ of polar codes with parity check bits
WO2018191908A1 (fr) Bits gelés dynamiques et détection d'erreur destinés à des codes polaires
WO2020088435A1 (fr) Efficacité améliorée pour décoder de multiples tailles de bits d'informations
WO2018141080A1 (fr) Réduction du taux de fausses alarmes pour codes polaires
WO2018148866A1 (fr) Suppression du taux de fausses alarmes de codes polaires
WO2020062061A1 (fr) Réduction de complexité pour décodage de liste d'annulation séquentielle de codes polaires

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: 17895383

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: 17895383

Country of ref document: EP

Kind code of ref document: A1