WO2019041109A1 - Bits codés de dépendance pour codes polaires - Google Patents

Bits codés de dépendance pour codes polaires Download PDF

Info

Publication number
WO2019041109A1
WO2019041109A1 PCT/CN2017/099356 CN2017099356W WO2019041109A1 WO 2019041109 A1 WO2019041109 A1 WO 2019041109A1 CN 2017099356 W CN2017099356 W CN 2017099356W WO 2019041109 A1 WO2019041109 A1 WO 2019041109A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
information
information stream
decoding
bit
Prior art date
Application number
PCT/CN2017/099356
Other languages
English (en)
Inventor
Liangming WU
Changlong Xu
Jing Jiang
Hao Xu
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/099356 priority Critical patent/WO2019041109A1/fr
Publication of WO2019041109A1 publication Critical patent/WO2019041109A1/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/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using 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
    • 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
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit

Definitions

  • Certain aspects of the present disclosure generally relate to encoding bits of information and, more particularly, to dependency encoded bits for polar codes.
  • Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, and broadcasts.
  • Typical wireless communication systems may employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power) .
  • multiple-access technologies include Long Term Evolution (LTE) systems, code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, and time division synchronous code division multiple access (TD-SCDMA) systems.
  • LTE Long Term Evolution
  • 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
  • TD-SCDMA time division synchronous code division multiple access
  • a wireless multiple-access communication system may include a number of base stations, each simultaneously supporting communication for multiple communication devices, otherwise known as user equipment (UEs) .
  • UEs user equipment
  • a set of one or more base stations may define an e NodeB (eNB) .
  • eNB e NodeB
  • a wireless multiple access communication system may include a number of distributed units (DUs) (e.g., edge units (EUs) , edge nodes (ENs) , radio heads (RHs) , smart radio heads (SRHs) , transmission reception points (TRPs) , etc.
  • DUs distributed units
  • EUs edge units
  • ENs edge nodes
  • RHs radio heads
  • SSRHs smart radio heads
  • TRPs transmission reception points
  • CUs central units
  • CUs central units
  • CNs central nodes
  • ANCs access node controllers
  • a set of one or more distributed units, in communication with a central unit may define an access node (e.g., a new radio base station (NR BS) , a new radio node-B (NR NB) , a network node, 5G NB, gNB, etc. ) .
  • NR BS new radio base station
  • NR NB new radio node-B
  • 5G NB 5G NB
  • gNB network node
  • a base station or DU may communicate with a set of UEs on downlink channels (e.g., for transmissions from a base station or to a UE) and uplink channels (e.g., for transmissions from a UE to a base station or distributed unit) .
  • downlink channels e.g., for transmissions from a base station or to a UE
  • uplink channels e.g., for transmissions from a UE to a base station or distributed unit
  • NR new radio
  • 3GPP Third Generation Partnership Project
  • NR is expected to introduce new encoding and decoding schemes that improve transmission and reception of data.
  • Polar codes are currently being considered as a candidate for error-correction in next-generation wireless systems such as NR.
  • Polar codes are a relatively recent breakthrough in coding theory, which have been proven to asymptotically (for code size N approaching infinity) achieve the Shannon capacity.
  • SCL successive cancellation list
  • Certain aspects of the present disclosure provide a method for encoding bits of information, according to certain aspects of the present disclosure.
  • the method generally includes determining a location in an information stream for a first one or more bits, wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream, assigning the first one or more bits to bit indices in the information stream corresponding to the determined location, and inputting the information stream, including the first one or more bits and second one or more bits, into a Polar encoder and generating a codeword by encoding the information stream using a Polar code.
  • the apparatus generally includes at least one processor configured to determine a location in an information stream for a first one or more bits, wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream, assign the first one or more bits to bit indices in the information stream corresponding to the determined location, and input the information stream, including the first one or more bits and second one or more bits, into a Polar encoder and generate a codeword by encoding the information stream using a Polar code.
  • the apparatus also generally includes a memory coupled with the at least one processor.
  • the method generally includes means for determining a location in an information stream for a first one or more bits , wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream, means for assigning the first one or more bits to bit indices in the information stream corresponding to the determined location, and inputting the information stream, means for including the first one or more bits and second one or more bits, into a Polar encoder and generating a codeword by encoding the information stream using a Polar code.
  • the non-transitory computer-readable medium generally includes instructions that, when executed by at least one processor, configure the at least one processor to determine a location in an information stream for a first one or more bits, wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream, assign the first one or more bits to bit indices in the information stream corresponding to the determined location, and input the information stream, including the first one or more bits and second one or more bits, into a Polar encoder and generate a codeword by encoding the information stream using a Polar code.
  • Certain aspects of the present disclosure provide a method for decoding bits of information, according to certain aspects of the present disclosure.
  • the method generally includes receiving a codeword corresponding to an information stream encoded with a Polar code, decoding a first portion of the codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first number of bits are assigned, wherein the first number of bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream, determining the bit value of the one or more second bits based, at least in part, on the first one or more bits, and decoding a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • the apparatus generally includes at least one processor configured to receive a codeword corresponding to an information stream encoded with a Polar code, decode a first portion of the codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first number of bits are assigned, wherein the first number of bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream, determine the bit value of the one or more second bits based, at least in part, on the first one or more bits, and decode a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • the apparatus also generally includes a memory coupled with the at least one processor.
  • the method generally includes means for receiving a codeword corresponding to an information stream encoded with a Polar code, means for decoding a first portion of the codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first number of bits are assigned, wherein the first number of bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream, means for determining the bit value of the one or more second bits based, at least in part, on the first one or more bits, and means for decode a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • the non-transitory computer-readable medium generally includes instructions that, when executed by at least one processor, configure the at least one processor to receive a codeword corresponding to an information stream encoded with a Polar code, decode a first portion of the codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first number of bits are assigned, wherein the first number of bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream, determine the bit value of the one or more second bits based, at least in part, on the first one or more bits, and decode a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • FIG. 1 is a block diagram conceptually illustrating an example telecommunications system, in accordance with certain aspects of the present disclosure.
  • FIG. 2 is a block diagram illustrating an example logical architecture of a distributed RAN, in accordance with certain aspects of the present disclosure.
  • FIG. 3 is a diagram illustrating an example physical architecture of a distributed RAN, in accordance with certain aspects of the present disclosure.
  • FIG. 4 is a block diagram conceptually illustrating a design of an example BS and user equipment (UE) , in accordance with certain aspects of the present disclosure.
  • FIG. 5 is a diagram showing examples for implementing a communication protocol stack, in accordance with certain aspects of the present disclosure.
  • FIG. 6 illustrates a block diagram of an example wireless device in accordance with certain aspects of the present disclosure.
  • FIG. 7 is a simplified block diagram illustrating a encoder, in accordance with certain aspects of the present disclosure.
  • FIG. 8 is a simplified block diagram illustrating a decoder, in accordance with certain aspects of the present disclosure.
  • FIG. 9 illustrates an example of a DL-centric subframe, in accordance with certain aspects of the present disclosure.
  • FIG. 10 illustrates an example of an UL-centric subframe, in accordance with certain aspects of the present disclosure.
  • FIG. 11A illustrates example operations for encoding bits of information, in accordance with certain aspects of the present disclosure.
  • FIG. 11B illustrates example operations for decoding bits of information, in accordance with certain aspects of the present disclosure.
  • FIGs. 12 illustrates an example information stream including special (SP) bits and undetermined (UD) bits, in accordance with certain aspects of the present disclosure.
  • SP special
  • UD undetermined
  • FIG. 13 illustrates an example process of protecting SP bits using a short-block encoder, in accordance with certain aspects of the present disclosure.
  • FIG. 14 illustrates an example location of SP bits in an information stream, in accordance with certain aspects of the present disclosure.
  • FIG. 15 illustrates determining a location for SP bits in an information stream based on a bit error rate performance metric, in accordance with certain aspects of the present disclosure.
  • FIGs. 16 illustrates determining a location for SP bits in an information stream based on reliability of information bits in a Polar code, in accordance with certain aspects of the present disclosure.
  • FIG. 17A illustrates an example decoding process of an encoded information stream that includes SP and UD bits, in accordance with certain aspects of the present disclosure.
  • FIG. 17B illustrates an example decoding process of an encoded information stream that includes SP and UD bits, in accordance with certain aspects of the present disclosure.
  • aspects of the present disclosure provide apparatus, methods, processing systems, and computer readable mediums for encoding bits of information.
  • Such encoding can be used, for example, for compression or storage, or for transmission in networks, including wireless networks.
  • encoding may be adopted for new radio (NR) (new radio access technology or 5G technology) wireless communication systems.
  • NR new radio
  • 5G technology new radio access technology
  • aspects of the present disclosure are proposed in relation to a wireless communication system, the techniques presented herein are not limited to such wireless communication system.
  • the techniques presented herein may equally apply to compression or storage, or to other communication systems such as fiber communication systems, hard-wire copper communication systems, and the like. In other words, the techniques presented herein may be applied to any system using an encoder.
  • NR may support various wireless communication services, such as Enhanced mobile broadband (eMBB) targeting wide bandwidth (e.g. 80 MHz beyond) , millimeter wave (mmW) targeting high carrier frequency (e.g. 60 GHz) , massive MTC (mMTC) targeting non-backward compatible MTC techniques, and/or mission critical targeting ultra reliable low latency communications (URLLC) .
  • eMBB Enhanced mobile broadband
  • mmW millimeter wave
  • mMTC massive MTC
  • URLLC ultra reliable low latency communications
  • These services may include latency and reliability requirements.
  • These services may also have different transmission time intervals (TTI) to meet respective quality of service (QoS) requirements.
  • TTI transmission time intervals
  • QoS quality of service
  • these services may co-exist in the same subframe.
  • aspects of the present disclosure relate to encoding bits of information for transmission, and more particularly, to determining locations within an information stream to assign dependency bits.
  • the dependency bits may be used by a decoder for determining a packet size associated with the information stream.
  • a CDMA network may implement a radio technology such as universal terrestrial radio access (UTRA) , cdma2000, etc.
  • UTRA includes wideband CDMA (WCDMA) , time division synchronous CDMA (TD-SCDMA) , and other variants of CDMA.
  • cdma2000 covers IS-2000, IS-95 and IS-856 standards.
  • a TDMA network may implement a radio technology such as global system for mobile communications (GSM) .
  • GSM global system for mobile communications
  • An OFDMA network may implement a radio technology such as evolved UTRA (E-UTRA) , ultra mobile broadband (UMB) , IEEE 802.11 (Wi-Fi) , IEEE 802.16 (WiMAX) , IEEE 802.20, etc.
  • E-UTRA evolved UTRA
  • UMB ultra mobile broadband
  • IEEE 802.11 Wi-Fi
  • WiMAX IEEE 802.16
  • IEEE 802.20 etc.
  • UTRA and E-UTRA are part of universal mobile telecommunication system (UMTS) .
  • 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) in both frequency division duplex (FDD) and time division duplex (TDD) , are new releases of UMTS that use E-UTRA, which employs OFDMA on the downlink and SC-FDMA on the uplink.
  • LTE Long Term Evolution
  • LTE-A LTE-Advanced
  • FDD frequency division duplex
  • TDD time division duplex
  • UTRA, E-UTRA, UMTS, LTE, LTE-Aand GSM are described in documents from an organization named “3rd Generation Partnership Project” (3GPP) .
  • cdma2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2) .
  • the techniques described herein may be used for the wireless networks and radio technologies Additionally, the techniques presented herein may be used in various other non-wireless communication networks, such as fiber network, hard-wire “copper” networks, and the like, or in digital storage or compression. In other words, the techniques presented herein may be used in any system which includes an encoder.
  • FIG. 1 illustrates an example wireless network 100, such as a new radio (NR) or 5G network, in which aspects of the present disclosure may be performed, for example, for reducing the search space of maximum-likelihood (ML) decoding for polar codes.
  • the network 100 may be a fiber network, a hard-wire “copper” network, or the like.
  • the wireless network 100 may include a number of BSs 110 and other network entities.
  • a BS may be a station that communicates with UEs.
  • Each BS 110 may provide communication coverage for a particular geographic area.
  • the term “cell” can refer to a coverage area of a Node B and/or a Node B subsystem serving this coverage area, depending on the context in which the term is used.
  • the term “cell” and eNB, Node B, 5G NB, AP, NR BS, NR BS, BS, or TRP may be interchangeable.
  • a cell may not necessarily be stationary, and the geographic area of the cell may move according to the location of a mobile base station.
  • the base stations may be interconnected to one another and/or to one or more other base stations or network nodes (not shown) in the wireless network 100 through various types of backhaul interfaces such as a direct physical connection, a virtual network, or the like using any suitable transport network.
  • any number of wireless networks may be deployed in a given geographic area.
  • Each wireless network may support a particular radio access technology (RAT) and may operate on one or more frequencies.
  • a RAT may also be referred to as a radio technology, an air interface, etc.
  • a frequency may also be referred to as a carrier, a frequency channel, etc.
  • Each frequency may support a single RAT in a given geographic area in order to avoid interference between wireless networks of different RATs.
  • NR or 5G RAT networks may be deployed, employing a multi-slice network architecture.
  • a BS may provide communication coverage for a macro cell, a pico cell, a femto cell, and/or other types of cell.
  • a macro cell may cover a relatively large geographic area (e.g., several kilometers in radius) and may allow unrestricted access by UEs with service subscription.
  • a pico cell may cover a relatively small geographic area and may allow unrestricted access by UEs with service subscription.
  • a femto cell may cover a relatively small geographic area (e.g., a home) and may allow restricted access by UEs having association with the femto cell (e.g., UEs in a Closed Subscriber Group (CSG) , UEs for users in the home, etc. ) .
  • CSG Closed Subscriber Group
  • a BS for a macro cell may be referred to as a macro BS.
  • a BS for a pico cell may be referred to as a pico BS.
  • a BS for a femto cell may be referred to as a femto BS or a home BS.
  • the BSs 110a, 110b and 110c may be macro BSs for the macro cells 102a, 102b and 102c, respectively.
  • the BS 110x may be a pico BS for a pico cell 102x.
  • the BSs 110y and 110z may be femto BS for the femto cells 102y and 102z, respectively.
  • a BS may support one or multiple (e.g., three) cells.
  • the wireless network 100 may also include relay stations.
  • a relay station is a station that receives a transmission of data and/or other information from an upstream station (e.g., a BS or a UE) and sends a transmission of the data and/or other information to a downstream station (e.g., a UE or a BS) .
  • a relay station may also be a UE that relays transmissions for other UEs.
  • a relay station 110r may communicate with the BS 110a and a UE 120r in order to facilitate communication between the BS 110a and the UE 120r.
  • a relay station may also be referred to as a relay BS, a relay, etc.
  • the wireless network 100 may be a heterogeneous network that includes BSs of different types, e.g., macro BS, pico BS, femto BS, relays, etc. These different types of BSs may have different transmit power levels, different coverage areas, and different impact on interference in the wireless network 100.
  • macro BS may have a high transmit power level (e.g., 20 Watts) whereas pico BS, femto BS, and relays may have a lower transmit power level (e.g., 1 Watt) .
  • the wireless network 100 may support synchronous or asynchronous operation.
  • the BSs may have similar frame timing, and transmissions from different BSs may be approximately aligned in time.
  • the BSs may have different frame timing, and transmissions from different BSs may not be aligned in time.
  • the techniques described herein may be used for both synchronous and asynchronous operation.
  • a network controller 130 may couple to a set of BSs and provide coordination and control for these BSs.
  • the network controller 130 may communicate with the BSs 110 via a backhaul.
  • the BSs 110 may also communicate with one another, e.g., directly or indirectly via wireless or wireline backhaul.
  • the UEs 120 may be dispersed throughout the wireless network 100, and each UE may be stationary or mobile.
  • a UE may also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, a Customer Premises Equipment (CPE) , a cellular phone, a smart phone, a personal digital assistant (PDA) , a wireless modem, a wireless communications device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device or medical equipment, a biometric sensor/device, a wearable device such as a smart watch, smart clothing, smart glasses, a smart wrist band, smart jewelry (e.g., a smart ring, a smart bracelet, etc.
  • CPE Customer Premises Equipment
  • PDA personal digital assistant
  • WLL wireless local loop
  • MTC machine-type communication
  • eMTC evolved MTC
  • MTC and eMTC UEs include, for example, robots, drones, remote devices, sensors, meters, monitors, location tags, etc., that may communicate with a BS, another device (e.g., remote device) , or some other entity.
  • a wireless node may provide, for example, connectivity for or to a network (e.g., a wide area network such as Internet or a cellular network) via a wired or wireless communication link.
  • a network e.g., a wide area network such as Internet or a cellular network
  • Some UEs may be considered Internet-of-Things (IoT) devices.
  • IoT Internet-of-Things
  • a solid line with double arrows indicates desired transmissions between a UE and a serving BS, which is a BS designated to serve the UE on the downlink and/or uplink.
  • a dashed line with double arrows indicates interfering transmissions between a UE and a BS.
  • Certain wireless networks utilize orthogonal frequency division multiplexing (OFDM) on the downlink and single-carrier frequency division multiplexing (SC-FDM) on the uplink.
  • OFDM and SC-FDM partition the system bandwidth into multiple (K) orthogonal subcarriers, which are also commonly referred to as tones, bins, etc.
  • K orthogonal subcarriers
  • Each subcarrier may be modulated with data.
  • modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM.
  • the spacing between adjacent subcarriers may be fixed, and the total number of subcarriers (K) may be dependent on the system bandwidth.
  • the spacing of the subcarriers may be 15 kHz and the minimum resource allocation (called a ‘resource block’ ) may be 12 subcarriers (or 180 kHz) . Consequently, the nominal FFT size may be equal to 128, 256, 512, 1024 or 2048 for system bandwidth of 1.25, 2.5, 5, 10 or 20 megahertz (MHz) , respectively.
  • the system bandwidth may also be partitioned into subbands. For example, a subband may cover 1.08 MHz (i.e., 6 resource blocks) , and there may be 1, 2, 4, 8 or 16 subbands for system bandwidth of 1.25, 2.5, 5, 10 or 20 MHz, respectively.
  • aspects of the examples described herein may be associated with LTE technologies, aspects of the present disclosure may be applicable with other wireless communications systems, such as NR/5G.
  • NR may utilize OFDM with a CP on the uplink and downlink and include support for half-duplex operation using TDD.
  • a single component carrier bandwidth of 100 MHz may be supported.
  • NR resource blocks may span 12 sub-carriers with a sub-carrier bandwidth of 75 kHz over a 0.1ms duration.
  • Each radio frame may consist of 50 subframes with a length of 10ms. Consequently, each subframe may have a length of 0.2ms.
  • Each subframe may indicate a link direction (i.e., DL or UL) for data transmission and the link direction for each subframe may be dynamically switched.
  • Each subframe may include DL/UL data as well as DL/UL control data.
  • UL and DL subframes for NR may be as described in more detail below with respect to FIGs. 6 and 7.
  • Beamforming may be supported and beam direction may be dynamically configured.
  • MIMO transmissions with precoding may also be supported.
  • MIMO configurations in the DL may support up to 8 transmit antennas with multi-layer DL transmissions up to 8 streams and up to 2 streams per UE.
  • Multi-layer transmissions with up to 2 streams per UE may be supported.
  • Aggregation of multiple cells may be supported with up to 8 serving cells.
  • NR may support a different air interface, other than an OFDM-based.
  • NR networks may include entities such CUs and/or DUs.
  • a scheduling entity e.g., a base station
  • the scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources for one or more subordinate entities. That is, for scheduled communication, subordinate entities utilize resources allocated by the scheduling entity.
  • Base stations are not the only entities that may function as a scheduling entity. That is, in some examples, a UE may function as a scheduling entity, scheduling resources for one or more subordinate entities (e.g., one or more other UEs) .
  • the UE is functioning as a scheduling entity, and other UEs utilize resources scheduled by the UE for wireless communication.
  • a UE may function as a scheduling entity in a peer-to-peer (P2P) network, and/or in a mesh network.
  • P2P peer-to-peer
  • UEs may optionally communicate directly with one another in addition to communicating with the scheduling entity.
  • a scheduling entity and one or more subordinate entities may communicate utilizing the scheduled resources.
  • a RAN may include a CU and DUs.
  • a NR BS e.g., gNB, 5G Node B, Node B, transmission reception point (TRP) , access point (AP)
  • NR cells can be configured as access cell (ACells) or data only cells (DCells) .
  • the RAN e.g., a central unit or distributed unit
  • DCells may be cells used for carrier aggregation or dual connectivity, but not used for initial access, cell selection/reselection, or handover. In some cases DCells may not transmit synchronization signals—in some case cases DCells may transmit SS.
  • NR BSs may transmit downlink signals to UEs indicating the cell type. Based on the cell type indication, the UE may communicate with the NR BS. For example, the UE may determine NR BSs to consider for cell selection, access, handover, and/or measurement based on the indicated cell type.
  • FIG. 2 illustrates an example logical architecture of a distributed radio access network (RAN) 200, which may be implemented in the wireless communication system illustrated in FIG. 1.
  • a 5G access node 206 may include an access node controller (ANC) 202.
  • the ANC may be a central unit (CU) of the distributed RAN 200.
  • the backhaul interface to the next generation core network (NG-CN) 204 may terminate at the ANC.
  • the backhaul interface to neighboring next generation access nodes (NG-ANs) may terminate at the ANC.
  • the ANC may include one or more TRPs 208 (which may also be referred to as BSs, NR BSs, Node Bs, 5G NBs, APs, or some other term) .
  • TRPs 208 which may also be referred to as BSs, NR BSs, Node Bs, 5G NBs, APs, or some other term.
  • TRP may be used interchangeably with “cell. ”
  • the TRPs 208 may be a DU.
  • the TRPs may be connected to one ANC (ANC 202) or more than one ANC (not illustrated) .
  • ANC ANC
  • RaaS radio as a service
  • a TRP may include one or more antenna ports.
  • the TRPs may be configured to individually (e.g., dynamic selection) or jointly (e.g., joint transmission) serve traffic to a UE.
  • the local architecture 200 may be used to illustrate fronthaul definition.
  • the architecture may be defined that support fronthauling solutions across different deployment types.
  • the architecture may be based on transmit network capabilities (e.g., bandwidth, latency, and/or jitter) .
  • the architecture may share features and/or components with LTE.
  • the next generation AN (NG-AN) 210 may support dual connectivity with NR.
  • the NG-AN may share a common fronthaul for LTE and NR.
  • the architecture may enable cooperation between and among TRPs 208. For example, cooperation may be preset within a TRP and/or across TRPs via the ANC 202. According to aspects, no inter-TRP interface may be needed/present.
  • a dynamic configuration of split logical functions may be present within the architecture 200.
  • the Radio Resource Control (RRC) layer, Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, Medium Access Control (MAC) layer, and a Physical (PHY) layers may be adaptably placed at the DU or CU (e.g., TRP or ANC, respectively) .
  • a BS may include a central unit (CU) (e.g., ANC 202) and/or one or more distributed units (e.g., one or more TRPs 208) .
  • CU central unit
  • distributed units e.g., one or more TRPs 208 .
  • FIG. 3 illustrates an example physical architecture of a distributed RAN 300, according to aspects of the present disclosure.
  • a centralized core network unit (C-CU) 302 may host core network functions.
  • the C-CU may be centrally deployed.
  • C-CU functionality may be offloaded (e.g., to advanced wireless services (AWS) ) , in an effort to handle peak capacity.
  • AWS advanced wireless services
  • a centralized RAN unit (C-RU) 304 may host one or more ANC functions.
  • the C-RU may host core network functions locally.
  • the C-RU may have distributed deployment.
  • the C-RU may be closer to the network edge.
  • a DU 306 may host one or more TRPs (edge node (EN) , an edge unit (EU) , a radio head (RH) , a smart radio head (SRH) , or the like) .
  • the DU may be located at edges of the network with radio frequency (RF) functionality.
  • RF radio frequency
  • FIG. 4 illustrates example components of the BS 110 and UE 120 illustrated in FIG. 1, which may be used to implement aspects of the present disclosure.
  • the BS may include a TRP.
  • One or more components of the BS 110 and UE 120 may be used to practice aspects of the present disclosure.
  • antennas 452, Tx/Rx 222, processors 466, 458, 464, and/or controller/processor 480 of the UE 120 and/or antennas 434, processors 460, 420, 438, and/or controller/processor 440 of the BS 110 may be used to perform the operations described herein and illustrated with reference to FIG. 11.
  • the base station 110 may be the macro BS 110c in FIG. 1, and the UE 120 may be the UE 120y.
  • the base station 110 may also be a base station of some other type.
  • the base station 110 may be equipped with antennas 434a through 434t, and the UE 120 may be equipped with antennas 452a through 452r.
  • a transmit processor 420 may receive data from a data source 412 and control information from a controller/processor 440.
  • the control information may be for the Physical Broadcast Channel (PBCH) , Physical Control Format Indicator Channel (PCFICH) , Physical Hybrid ARQ Indicator Channel (PHICH) , Physical Downlink Control Channel (PDCCH) , etc.
  • the data may be for the Physical Downlink Shared Channel (PDSCH) , etc.
  • the processor 420 may process (e.g., encode and symbol map) the data and control information to obtain data symbols and control symbols, respectively.
  • the processor 420 may also generate reference symbols, e.g., for the PSS, SSS, and cell-specific reference signal.
  • a transmit (TX) multiple-input multiple-output (MIMO) processor 430 may perform spatial processing (e.g., precoding) on the data symbols, the control symbols, and/or the reference symbols, if applicable, and may provide output symbol streams to the modulators (MODs) 432a through 432t.
  • Each modulator 432 may process a respective output symbol stream (e.g., for OFDM, etc. ) to obtain an output sample stream.
  • Each modulator 432 may further process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal.
  • Downlink signals from modulators 432a through 432t may be transmitted via the antennas 434a through 434t, respectively.
  • the antennas 452a through 452r may receive the downlink signals from the base station 110 and may provide received signals to the demodulators (DEMODs) 454a through 454r, respectively.
  • Each demodulator 454 may condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain input samples.
  • Each demodulator 454 may further process the input samples (e.g., for OFDM, etc. ) to obtain received symbols.
  • a MIMO detector 456 may obtain received symbols from all the demodulators 454a through 454r, perform MIMO detection on the received symbols if applicable, and provide detected symbols.
  • a receive processor 458 may process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data for the UE 120 to a data sink 460, and provide decoded control information to a controller/processor 480.
  • a transmit processor 464 may receive and process data (e.g., for the Physical Uplink Shared Channel (PUSCH) ) from a data source 462 and control information (e.g., for the Physical Uplink Control Channel (PUCCH) from the controller/processor 480.
  • the transmit processor 464 may also generate reference symbols for a reference signal.
  • the symbols from the transmit processor 464 may be precoded by a TX MIMO processor 466 if applicable, further processed by the demodulators 454a through 454r (e.g., for SC-FDM, etc. ) , and transmitted to the base station 110.
  • the uplink signals from the UE 120 may be received by the antennas 434, processed by the modulators 432, detected by a MIMO detector 436 if applicable, and further processed by a receive processor 438 to obtain decoded data and control information sent by the UE 120.
  • the receive processor 438 may provide the decoded data to a data sink 439 and the decoded control information to the controller/processor 440.
  • the controllers/processors 440 and 480 may direct the operation at the base station 110 and the UE 120, respectively.
  • the processor 440 and/or other processors and modules at the base station 110 may perform or direct, e.g., the execution of the functional blocks illustrated in FIG. 6, and/or other processes for the techniques described herein.
  • the processor 480 and/or other processors and modules at the UE 120 may also perform or direct, e.g., the execution of the functional blocks illustrated in FIG. 7, and/or other processes for the techniques described herein.
  • the memories 442 and 482 may store data and program codes for the BS 110 and the UE 120, respectively.
  • a scheduler 444 may schedule UEs for data transmission on the downlink and/or uplink.
  • FIG. 5 illustrates a diagram 500 showing examples for implementing a communications protocol stack, according to aspects of the present disclosure.
  • the illustrated communications protocol stacks may be implemented by devices operating in a in a 5G system (e.g., a system that supports uplink-based mobility) .
  • Diagram 500 illustrates a communications protocol stack including a Radio Resource Control (RRC) layer 510, a Packet Data Convergence Protocol (PDCP) layer 515, a Radio Link Control (RLC) layer 520, a Medium Access Control (MAC) layer 525, and a Physical (PHY) layer 530.
  • RRC Radio Resource Control
  • PDCP Packet Data Convergence Protocol
  • RLC Radio Link Control
  • MAC Medium Access Control
  • PHY Physical
  • the layers of a protocol stack may be implemented as separate modules of software, portions of a processor or ASIC, portions of non-collocated devices connected by a communications link, or various combinations thereof. Collocated and non-collocated implementations may be used, for example, in a protocol stack for a network access device (e.g., ANs, CUs, and/or DUs) or a UE.
  • a network access device e.g., ANs, CUs, and/or DUs
  • a first option 505-a shows a split implementation of a protocol stack, in which implementation of the protocol stack is split between a centralized network access device (e.g., an ANC 202 in FIG. 2) and distributed network access device (e.g., DU 208 in FIG. 2) .
  • a centralized network access device e.g., an ANC 202 in FIG. 2
  • distributed network access device e.g., DU 208 in FIG. 2
  • an RRC layer 510 and a PDCP layer 515 may be implemented by the central unit
  • an RLC layer 520, a MAC layer 525, and a PHY layer 530 may be implemented by the DU.
  • the CU and the DU may be collocated or non-collocated.
  • the first option 505-a may be useful in a macro cell, micro cell, or pico cell deployment.
  • a second option 505-b shows a unified implementation of a protocol stack, in which the protocol stack is implemented in a single network access device (e.g., access node (AN) , new radio base station (NR BS) , a new radio Node-B (NR NB) , a network node (NN) , or the like. ) .
  • the RRC layer 510, the PDCP layer 515, the RLC layer 520, the MAC layer 525, and the PHY layer 530 may each be implemented by the AN.
  • the second option 505-b may be useful in a femto cell deployment.
  • a UE may implement an entire protocol stack (e.g., the RRC layer 510, the PDCP layer 515, the RLC layer 520, the MAC layer 525, and the PHY layer 530) .
  • an entire protocol stack e.g., the RRC layer 510, the PDCP layer 515, the RLC layer 520, the MAC layer 525, and the PHY layer 530.
  • FIG. 6 illustrates various components that may be utilized in a wireless communications device 602 that may be employed within the wireless communication system from FIG. 1.
  • the wireless communications device 602 is an example of a device that may be configured to implement the various methods described herein, for example, for reducing the search space of ML decoding for polar codes.
  • the wireless communications device 602 may be an BS 110 from FIG. 1 or any of user equipments 120.
  • the wireless communications device 602 may include a processor 604 which controls operation of the wireless communications device 602.
  • the processor 604 may also be referred to as a central processing unit (CPU) .
  • a portion of the memory 606 may also include non-volatile random access memory (NVRAM) .
  • the processor 604 typically performs logical and arithmetic operations based on program instructions stored within the memory 606.
  • the instructions in the memory 606 may be executable to implement the methods described herein.
  • the wireless communications device 602 may also include a housing 608 that may include a transmitter 610 and a receiver 612 to allow transmission and reception of data between the wireless communications device 602 and a remote location.
  • the transmitter 610 and receiver 612 may be combined into a transceiver 614.
  • a single or a plurality of transmit antennas 616 may be attached to the housing 608 and electrically coupled to the transceiver 614.
  • the wireless communications device 602 may also include (not shown) multiple transmitters, multiple receivers, and multiple transceivers.
  • the wireless communications device 602 may also include a signal detector 618 that may be used in an effort to detect and quantify the level of signals received by the transceiver 614.
  • the signal detector 618 may detect such signals as total energy, energy per subcarrier per symbol, power spectral density and other signals.
  • the wireless communications device 602 may also include a digital signal processor (DSP) 620 for use in processing signals.
  • DSP digital signal processor
  • the wireless communications device 602 may also include an encoder 622 for use in encoding signals for transmission.
  • the encoder 622 may be configured to distribute/assign a first one or more bits into a location of an information stream, wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream.
  • the encoder 622 may be configured to perform operations presented herein, for example, with reference to FIG. 11A. While encoder 622 is shown as a single encoder, it should be understood that encoder 622 may include one or more encoders (e.g., an outer-code encoder and an inner-code encoder) configured to perform techniques presented herein.
  • the wireless communications device 602 may include a decoder 624 for use in decoding received signals encoded using techniques presented herein.
  • the decoder 624 may be configured to decode a first portion of a codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first one or more bits are assigned, wherein the first one or more bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream, determine the bit value of the one or more second bits based, at least in part, on the first one or more bits, and decode a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • the decoder 624 may be configured to perform operations presented herein, for example, with reference to FIG. 11B. While decoder 624 is shown as a single decoder, it should be understood that decoder 624 may include one or more decoders (e.g., an outer-code decoder and an inner-code decoder) configured to perform techniques presented herein.
  • decoder 624 may include one or more decoders (e.g., an outer-code decoder and an inner-code decoder) configured to perform techniques presented herein.
  • the various components of the wireless communications device 602 may be coupled together by a bus system 626, which may include a power bus, a control signal bus, and a status signal bus in addition to a data bus.
  • the processor 604 may be configured to access instructions stored in the memory 606 to perform connectionless access, in accordance with aspects of the present disclosure discussed below.
  • FIG. 7 is a simplified block diagram illustrating an encoder, in accordance with certain aspects of the present disclosure.
  • FIG. 7 illustrates a portion of a radio frequency (RF) modem 704 that may be configured to provide an encoded message for wireless transmission (e.g., using polar codes described below) .
  • RF radio frequency
  • an encoder 706 e.g., a polar encoder
  • a base station e.g., BS 110
  • the message 702 may contain data and/or encoded voice or other content directed to the receiving device.
  • the encoder 706 encodes the message using a suitable modulation and coding scheme (MCS) , typically selected based on a configuration defined by the BS 110 or another network entity.
  • MCS modulation and coding scheme
  • the encoder 706 may be configured to encode the message 702 using techniques presented herein, for example, with reference to FIG. 11.
  • the encoded bitstream 708 (e.g., representing to the encoded message 702) may then be provided to a mapper 710 that generates a sequence of Tx symbols 712 that are modulated, amplified and otherwise processed by Tx chain 714 to produce an RF signal 716 for transmission through antenna 718.
  • FIG. 8 is a simplified block diagram illustrating a decoder, in accordance with certain aspects of the present disclosure.
  • FIG. 8 illustrates a portion of a RF modem 810 that may be configured to receive and decode a wirelessly transmitted signal including an encoded message (e.g., a message encoded using techniques presented herein) .
  • the modem 810 receiving the signal may reside at the access terminal, at the base station, or at any other suitable apparatus or means for carrying out the described functions.
  • An antenna 802 provides an RF signal 716 (i.e., the RF signal produced in FIG. 4) to an access terminal (e.g., UE 120) .
  • An Rx chain 806 processes and demodulates the RF signal 716 and may provide a sequence of symbols 808 to a demapper 812, which produces a sequence of a-priori probabilities 814, often represented as log-likelihood ratios (LLRs) corresponding to the encoded message.
  • LLRs log-likelihood ratios
  • a decoder 816 may then be used to decode m-bit information strings from a bitstream that has been encoded using a coding scheme (e.g., as described herein) .
  • the decoder 816 may comprise a polar decoder, an LDPC decoder, a Viterbi decoder, an algebraic decoder, a butterfly decoder, or another suitable decoder.
  • a Polar decoder employs the successive cancellation (SC) or successive cancellation list (SCL) decoding algorithm.
  • An SC decoding algorithm essentially operates by performing a recursive depth-first traversal of a decoding tree, to convert the bitstream 814 (e.g., a sequence of LLRs) into the message 818 corresponding to the message 702 (e.g., when the decoding is successful) .
  • bitstream 814 e.g., a sequence of LLRs
  • the encoder 706 e.g., which may be a polar encoder
  • the root of the tree corresponds to the received vector of N log likelihood ratios (LLRs) to be decoded, and the leaves of the tree correspond to each of the decoded bits, so that N-K of the leaves correspond to the N-K frozen bits (which should decode to the frozen value (zero) ) , while the remaining K leaves correspond to the K information bits.
  • LLRs log likelihood ratios
  • converting the 2 d LLRs corresponding to any node v into the 2 d decoded bits corresponding to the 2 d leaves of that node is performed via a recursive depth-first traversal of the decoding tree, as follows.
  • the decoder 816 may first use the 2 d LLRs corresponding to this node v to calculate the 2 d-1 LLRs corresponding to node v's left child.
  • the decoder 816 may then decode the subcode corresponding to node v's left child.
  • the decoder 816 may then re-encode the length 2 d-1 codeword corresponding to the left child.
  • This partial codeword is referred to as a (left) partial sum.
  • the decoder 816 may then use the partial sum from node v's left child along with the 2 d LLRs corresponding to node v to calculate the 2 d-1 LLRs corresponding to v's right child. Thereafter, the decoder 816 may decode the subcode corresponding to node v's right child. Additionally, the decoder 816 may re-encode the length 2 d codeword corresponding to the right child and this partial codeword is referred to as a (right) partial sum. Thereafter, the decoder 816 may combine the left and right partial sums to get the partial sum (codeword) corresponding to v.
  • an outer code such as a CRC
  • an outer code decoder such as a CRC decoder
  • SC decoding a single bit, corresponding to a single data leaf node, is decoded at a time; the vector of bits that have already been decoded will be referred to as the “decoder history. ”
  • SCL decoding a list of the “best” L paths is maintained, where a path is defined as a decoder history, and the notion of “best” is based off computing a path metric corresponding to a given decoder history.
  • the basic SCL algorithm is similar to SC, and the decoding tree and tree traversal are identical, except that the tree traversal algorithm described for SC above occurs in parallel for all L paths.
  • each of the incoming L paths is split into 2 paths, resulting in 2L paths.
  • the first L of those 2L paths are derived by decoding according to the sign of the LLR corresponding to each incoming path, as would be done in SC decoding; these L paths are therefore referred to as SC paths.
  • the remaining L paths are copies of the first L paths, but with the last bit of the decoder history inverted, so that these paths decode according to the inverse of the sign of the LLR corresponding to each incoming path. Therefore, these L paths may be referred to as inverted paths.
  • the path metrics of the L SC paths are unchanged, but the path metrics of the inverted paths are penalized by the magnitude of the corresponding LLR (which has been inverted) .
  • the 2L path metrics are then sorted, and the tree traversal resumes with the best L paths.
  • message 818 corresponds to the decoded bits corresponding to the path having the best path metric.
  • an outer code decoder for example a CRC decoder
  • message 818 is the set of decoded bits which satisfy the outer code decoder (for example, the vector of decoded bits that pass the CRC check) .
  • FIG. 9 is a diagram 900 showing an example of a DL-centric subframe, which may be used by one or more devices (e.g., BS 110 and/or UE 120) to communicate in the wireless network 100.
  • the DL-centric subframe may include a control portion 902.
  • the control portion 902 may exist in the initial or beginning portion of the DL-centric subframe.
  • the control portion 902 may include various scheduling information and/or control information corresponding to various portions of the DL-centric subframe.
  • the control portion 902 may be a physical DL control channel (PDCCH) , as indicated in FIG. 9.
  • the DL-centric subframe may also include a DL data portion 904.
  • PDCH physical DL control channel
  • the DL data portion 904 may sometimes be referred to as the payload of the DL-centric subframe.
  • the DL data portion 904 may include the communication resources utilized to communicate DL data from the scheduling entity (e.g., UE or BS) to the subordinate entity (e.g., UE) .
  • the DL data portion 904 may be a physical DL shared channel (PDSCH) .
  • PDSCH physical DL shared channel
  • the DL-centric subframe may also include a common UL portion 906.
  • the common UL portion 906 may sometimes be referred to as an UL burst, a common UL burst, and/or various other suitable terms.
  • the common UL portion 906 may include feedback information corresponding to various other portions of the DL-centric subframe.
  • the common UL portion 906 may include feedback information corresponding to the control portion 902.
  • Non-limiting examples of feedback information may include an ACK signal, a NACK signal, a HARQ indicator, and/or various other suitable types of information.
  • the common UL portion 906 may include additional or alternative information, such as information pertaining to random access channel (RACH) procedures, scheduling requests (SRs) , and various other suitable types of information.
  • RACH random access channel
  • SRs scheduling requests
  • the end of the DL data portion 904 may be separated in time from the beginning of the common UL portion 906.
  • This time separation may sometimes be referred to as a gap, a guard period, a guard interval, and/or various other suitable terms.
  • This separation provides time for the switch-over from DL communication (e.g., reception operation by the subordinate entity (e.g., UE)) to UL communication (e.g., transmission by the subordinate entity (e.g., UE) ) .
  • DL communication e.g., reception operation by the subordinate entity (e.g., UE)
  • UL communication e.g., transmission by the subordinate entity (e.g., UE)
  • FIG. 10 is a diagram 1000 showing an example of an UL-centric subframe, which may be used by one or more devices (e.g., BS 110 and/or UE 120) to communicate in the wireless network 100.
  • the UL -centric subframe may include a control portion 1002.
  • the control portion 1002 may exist in the initial or beginning portion of the UL-centric subframe.
  • the control portion 1002 in FIG. 10 may be similar to the control portion described above with reference to FIG. 9.
  • the UL-centric subframe may also include an UL data portion 1004.
  • the UL data portion 1004 may sometimes be referred to as the payload of the UL-centric subframe.
  • the UL portion may refer to the communication resources utilized to communicate UL data from the subordinate entity (e.g., UE) to the scheduling entity (e.g., UE or BS) .
  • the control portion 1002 may be a physical DL control channel (PDCCH) .
  • the end of the control portion 1002 may be separated in time from the beginning of the UL data portion 1004. This time separation may sometimes be referred to as a gap, guard period, guard interval, and/or various other suitable terms. This separation provides time for the switch-over from DL communication (e.g., reception operation by the scheduling entity) to UL communication (e.g., transmission by the scheduling entity) .
  • the UL-centric subframe may also include a common UL portion 1006.
  • the common UL portion 1006 in FIG. 10 may be similar to the common UL portion 1006 described above with reference to FIG. 10.
  • the common UL portion 1006 may additional or alternative include information pertaining to channel quality indicator (CQI) , sounding reference signals (SRSs) , and various other suitable types of information.
  • CQI channel quality indicator
  • SRSs sounding reference signals
  • One of ordinary skill in the art will understand that the foregoing is merely one example of an UL-centric subframe and alternative structures having similar features may exist without necessarily deviating from the aspects described herein.
  • two or more subordinate entities may communicate with each other using sidelink signals.
  • Real-world applications of such sidelink communications may include public safety, proximity services, UE-to-network relaying, vehicle-to-vehicle (V2V) communications, Internet of Everything (IoE) communications, IoT communications, mission-critical mesh, and/or various other suitable applications.
  • a sidelink signal may refer to a signal communicated from one subordinate entity (e.g., UE1) to another subordinate entity (e.g., UE2) without relaying that communication through the scheduling entity (e.g., UE or BS) , even though the scheduling entity may be utilized for scheduling and/or control purposes.
  • the sidelink signals may be communicated using a licensed spectrum (unlike wireless local area networks, which typically use an unlicensed spectrum) .
  • a UE may operate in various radio resource configurations, including a configuration associated with transmitting pilots using a dedicated set of resources (e.g., a radio resource control (RRC) dedicated state, etc. ) or a configuration associated with transmitting pilots using a common set of resources (e.g., an RRC common state, etc. ) .
  • RRC radio resource control
  • the UE may select a dedicated set of resources for transmitting a pilot signal to a network.
  • the UE may select a common set of resources for transmitting a pilot signal to the network.
  • a pilot signal transmitted by the UE may be received by one or more network access devices, such as an AN, or a DU, or portions thereof.
  • Each receiving network access device may be configured to receive and measure pilot signals transmitted on the common set of resources, and also receive and measure pilot signals transmitted on dedicated sets of resources allocated to the UEs for which the network access device is a member of a monitoring set of network access devices for the UE.
  • One or more of the receiving network access devices, or a CU to which receiving network access device (s) transmit the measurements of the pilot signals may use the measurements to identify serving cells for the UEs, or to initiate a change of serving cell for one or more of the UEs.
  • Polar codes are a relatively recent breakthrough in coding theory which have been proven to asymptotically (for code size N approaching infinity) achieve the Shannon capacity.
  • Polar codes have many desirable properties such as deterministic construction (e.g., based on a fast Hadamard transform) , very low and predictable error floors, and simple successive-cancellation (SC) based decoding. They are currently being considered as a candidate for error-correction in next-generation wireless systems such as NR.
  • a Successive Cancellation (SC) decoder e.g., decoder 8166
  • every estimated bit has a predetermined error probability given that bits u 0 i-1 were correctly decoded, that, for extremely large codesize N, tends towards either 0 or 0.5.
  • the proportion of estimated bits with a low error probability tends towards the capacity of the underlying channel.
  • Polar codes exploit this phenomenon, called channel polarization, by using the most reliable K bits to transmit information, while setting to a predetermined value (such as 0) , also referred to as freezing, the remaining (N-K) bits, for example as explained below.
  • Polar codes transform the channel into N parallel “virtual” channels for the N information and frozen bits. If C is the capacity of the channel, then, for sufficiently large values of N, there are almost N*C channels which are extremely reliable and there are almost N (1 –C) channels which are extremely unreliable.
  • the basic polar coding scheme then involves freezing (i.e., setting to a known value, such as zero) the input bits in u corresponding to the unreliable channels, while placing information bits only in the bits of u corresponding to reliable channels. For short-to-medium N, this polarization may not be complete in the sense there could be several channels which are neither completely unreliable nor completely reliable (i.e., channels that are marginally reliable) . Depending on the rate of transmission, bits corresponding to these marginally reliable channels may be either frozen or used for information bits.
  • Polar codes are a relatively recent breakthrough in coding theory and have been proven to achieve Shannon capacity for large values of a codeblock size N.
  • a typical usage of Polar codes is in 5G eMBB control information coding, such as uplink control information (UCI) used to carry channel state information (CSI) reporting.
  • UCI uplink control information
  • CSI channel state information
  • a bit-length of the CSI reporting may vary depending on the content of the CSI, which may include information such as a channel resource indicator (CRI) , a rank indicator (RI) , a precoding matrix indicator (PMI) , and/or a channel quality indicator (CQI) .
  • CRI channel resource indicator
  • RI rank indicator
  • PMI precoding matrix indicator
  • CQI channel quality indicator
  • the CRI determines the available RI/PMI/CQI bits and the RI determines the PMI bits and CQI bits.
  • the payload size of a UCI packet may have some ambiguity.
  • aspects of the present disclosure propose techniques for reducing the ambiguity in packet size associated with packets encoded using polar codes.
  • reducing the ambiguity in packet size may involve assigning a first one or more bits to a location determined in an information stream (to be input into a Polar encoder) that indicate at least one of a bit value of a second number of bits in the information stream or a size of the information stream.
  • FIG. 11A illustrates example operations for encoding bits of information, for example, for reducing an ambiguity of packet size of Polar-encoded packets at a decoder, in accordance with certain aspects of the present disclosure.
  • operations 1100A may, for example, be performed by any suitable encoding device, such as a base station (e.g., 110) , user equipment (e.g., UE 120) , and/or wireless communications device 602.
  • a base station e.g., 110
  • user equipment e.g., UE 120
  • the encoding device may include one or more components as illustrated in FIGs. 4 and 6 which may be configured to perform the operations described herein.
  • the antenna 434, modulator/demodulator 432, transmit processor 420, controller/processor 440, and/or memory 442 of the base station 110, as illustrated in FIG. 4 may perform the operations described herein.
  • the antenna 452, demodulator/modulator 454, transmit processor 464, controller/processor 480, and/or memory 482 of the user equipment 120, as illustrated in FIG. 4, may perform the operations described herein.
  • processor 604, memory 606, transceiver 614, DSP 320, encoder 622, decoder 620, and/or antenna (s) 616 as illustrated in FIG. 6 may be configured to perform the operations described herein.
  • Operations 1100A begin at 1102A by determining a location in an information stream for a first one or more bits , wherein the first one or more bits indicate at least one of a bit value of one or more second bits in the information stream or a size of the information stream.
  • the encoding device assigns the first one or more bits to bit indices in the information stream corresponding to the determined location.
  • the encoding device inputs the information stream, including the first one or more bits and second one or more bits, into a Polar encoder and generates a codeword by encoding the information stream using a Polar code. While not illustrated, operations 1100A may also include transmitting the codeword.
  • FIG. 11B illustrates example operations for decoding bits of information, in accordance with certain aspects of the present disclosure.
  • operations 1100B may, for example, be performed by any suitable decoding device, such as a base station (e.g., 110) , user equipment (e.g., UE 120) , and/or wireless communications device 602.
  • a base station e.g., 110
  • user equipment e.g., UE 120
  • the decoding device may include one or more components as illustrated in FIGs. 4 and 6 which may be configured to perform the operations described herein.
  • the antenna 434, modulator/demodulator 432, transmit processor 420, controller/processor 440, and/or memory 442 of the base station 110, as illustrated in FIG. 4 may perform the operations described herein.
  • the antenna 452, demodulator/modulator 454, transmit processor 464, controller/processor 480, and/or memory 482 of the user equipment 120, as illustrated in FIG. 4, may perform the operations described herein.
  • processor 604, memory 606, transceiver 614, DSP 320, encoder 622, decoder 620, and/or antenna (s) 616 as illustrated in FIG. 6 may be configured to perform the operations described herein.
  • Operations 1100B begin at 1102B by receiving a codeword corresponding to an information stream encoded with a Polar code.
  • the decoding device decodes a first portion of the codeword, wherein the first portion of the codeword corresponds to a location in the information stream where a first number of bits are assigned, wherein the first number of bits indicate at least one of bit value of one or more second bits in the information stream or a size of the information stream.
  • the decoding device determines the bit value of the one or more second bits based, at least in part, on the first one or more bits.
  • the decoding device decodes a remaining portion of the codeword based on the determined bit value of the one or more second bits.
  • reducing the ambiguity in packet size may involve assigning a first one or more bits, known as “special bits” , to a location determined in an information stream (to be input into a Polar encoder) that indicate at least one of a bit value of a second number of bits in the information stream (e.g., “undetermined bits” ) or a size of the information stream.
  • the special bits e.g., “SP” bits
  • a bit value of the special bits may determine a bit value of the undetermined bits (e.g., “UD” bits) in a second portion of the information stream.
  • FIG. 12 illustrates an information stream 1200 including SP and UD bits, according to aspects of the present disclosure.
  • the information stream 1200 may include a number of information bits 1202 (e.g., K) and a number of frozen bits 1204 (e.g., N-K) corresponding to a Polar code of size N, as described above.
  • locations of the information bits 1202 and the frozen bits 1204 in the information stream may correspond to the locations of these types of bits within the Polar code of size N (e.g., in some cases determined from a standards document) .
  • a subset of the information bits 1202 may be reserved for SP bits 1206 and UD bits 1208.
  • a bit value of the UD bits 1208 may depend on a bit value of the SP bits 1206. That is, in some cases, depending on a bit value of the of the SP bits 1206, the bit value of the UD bits 1208 may change. For example, in some cases, if the SP bits 1206 are set to zero, the UD bits 1208 may be considered frozen bits (e.g., no data) with a bit value equal to zero, whereas if the SP bits 1206 are set to one, the UD bits 1208 may be considered information bits with a bit value equal to zero or one.
  • the SP bits 1208 may be protected by first encoding the SP bits 1208 using another encoding scheme (e.g., in addition to a Polar code) , such as a short-block encoding scheme.
  • another encoding scheme e.g., in addition to a Polar code
  • the short-block encoding scheme may comprise repetition or simplex codes.
  • FIG. 13 illustrates an example process of protecting SP bits using a short-block encoding scheme, according to aspects of the present disclosure.
  • a number of unprotected SP bits 1306 may be encoded using a short-block encoder 1312.
  • the short-block encoder 1312 may be configured to take as an input the unprotected SP bits 1306, encode the unprotected SP bits 1306 using a short-block code, and output a number of protected SP bits 1308.
  • the protected SP bits 1308 may then be mapped to a location in the information stream 1300.
  • the information stream 1300 (e.g., including information bits 1302, frozen bits 1304, protected SP bits 1308, and UD bits 1310) may then be encoded with a Polar code using a Polar encoder to generate a Polar encoded codeword. According to aspects, the codeword may then be transmitted.
  • a decoding device may receive the codeword and decode the codeword.
  • Decoding the codeword may first comprise processing the codeword through a Polar decoder, for example, to determine an estimate of the protected SP bits 1306.
  • the estimate of the protected SP bits 1306 may then be processed by a short-block decoder to determine an estimate of the unprotected SP bits 1306.
  • the estimate of the unprotected SP bits 1306 may then be used by the decoding device, for example, to determine a bit value of one or more UD bits and/or an overall size of a packet associated with the information stream.
  • the SP bits may be assigned to different locations within the information stream.
  • the encoding device may determine and assign the SP bits to a location in the information stream that is decoded early on in the decoding process of the codeword.
  • assigning SP bits to a location that is early on in the decoding process may allow the decoder to quickly decode the SP bits and determine an overall size of the information stream.
  • the encoding device may assign the SP bits to the earliest location in the information stream corresponding to information bits in a Polar code used to encode the information stream.
  • a Polar code used to encode the information stream.
  • a certain number of bits of the information stream will correspond to information bits (e.g., K) and a certain number of bits will correspond to frozen bits (e.g., N-K) .
  • the locations of information bits and frozen bits within a Polar code may be standardized. Therefore, aspects of the present disclosure propose assigning the SP bits to a location of a corresponding number of information bits that occur first in the information stream corresponding to the Polar code.
  • assigning the SP bits to the earliest location of information bits in the information stream may allow the decoder, receiving the Polar encoded information stream (e.g., a codeword) , to quickly decode the SP bits at the beginning of the decoding process and bit values of one or more UD in the information stream.
  • the decoder receiving the Polar encoded information stream (e.g., a codeword) , to quickly decode the SP bits at the beginning of the decoding process and bit values of one or more UD in the information stream.
  • FIG. 15 shows an example table illustrating determining a location for the SP bits based on a bit error rate performance metric, according to certain aspects of the present disclosure.
  • the row 1502 of the table illustrated in FIG. 15 shows the bit-order value, i, of information bits in the information stream.
  • Row 1504 shows the reliability, p, and row 1506 shows the metric, m, for a given information bit, i, in the information stream.
  • the encoding device may determine the location to assign the SP bits based on the information bits having a minimal bit error rate performance metrics, m, at low bit-order values in the information stream. For example, as illustrated in FIG.
  • the encoding device may assign the SP bits to bit indices in the information stream corresponding to the bit-order values 7 and 11.
  • the encoding device may determine the location to assign the SP bits in the information stream based on a highest reliability and/or block error ratio (BLER) of information bits in the information stream (e.g., according to their corresponding bit order value) occurring before the first UD bit in the information stream. For example, as illustrated in FIG. 16, the encoding device may select the information bit with bit-order value 11 as the location to assign the SP bit (s) as this information bit location has the highest reliability (e.g., 3.871) of any of the other information bits preceding the first UD bit at bit-order value 12. According to aspects, assigning the SP bits to the information bits having the highest reliability may help ensure that the SP bits will be correctly decoded at the decoding device.
  • BLER block error ratio
  • the encoding device may encode the information stream with a Polar code, for example, using a Polar encoder (e.g., encoder 706) .
  • the encoding device may then transmit the encoded information stream (e.g., a codeword of size N) to a decoding device.
  • the decoding device may receive an input with N values corresponding to the N bits of the codeword.
  • the input may then be decoded by the decoding device (e.g., using a polar decoder) to obtain an estimated information stream of the information stream corresponding to the codeword.
  • the decoding device may begin by decoding a first portion of the codeword that contains the SP bits, for example, using techniques described above.
  • the decoding device may determine the bit values of the UD bits based on decoding paths (e.g., a decoding path with a best path metric) for the SP bits in a decoding list used to decode the codeword.
  • the decoding device may decode a first portion of the codeword comprising the SP bits and estimate a bit value associated with the SP bits (e.g., based on a decoding path for the SP bits with the best decoding metric) .
  • the decoder may treat the UD bits (e.g., in a second portion of the codeword) either as information bits or frozen bits, for example, as illustrated in FIG. 17.
  • the decoding device may treat the UD bits in the second potion of the codeword (e.g., occurring after the first portion) as frozen bits during decoding, whereas when the estimated bit value of the SP bits equals one, the decoding device may treat the UD bits in the second portion of the codeword as information bits during decoding.
  • the decoding device may derive the size of a packet associated with information stream and decode a remaining portion of the codeword (e.g., based on the bit value of the UD bits) .
  • the decoding device may first decode the UD bits 1704 as information bits.
  • the bits of UD can be derived based on the decoded SP bits.
  • decoding paths in the decoding list that contain mismatched UD bits and SP bits e.g., the decoded UD bits do not match the decoded SP bits are removed from list.
  • the decoding device may re-start the decoding process at time t+1, treating the SP bits and corresponding UD bits for the decoding path with the best path metric as known bits.
  • the decoding device may use the known bits to decode a remaining portion of the codeword.
  • a phrase referring to “at least one of” a list of items refers to any combination of those items, including single members.
  • “at least one of: a, b, or c” is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c, as well as any combination with multiples of the same element (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b, b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b, and c) .
  • determining encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure) , ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information) , accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing and the like.
  • a device may have an interface to output a frame for transmission.
  • a processor may output a frame, via a bus interface, to an RF front end for transmission.
  • a device may have an interface to obtain a frame received from another device.
  • a processor may obtain (or receive) a frame, via a bus interface, from an RF front end for transmission.
  • the various operations of methods described above may be performed by any suitable means capable of performing the corresponding functions.
  • the means may include various hardware and/or software component (s) and/or module (s) , including, but not limited to a circuit, an application specific integrated circuit (ASIC) , or processor.
  • ASIC application specific integrated circuit
  • means for transmitting, means for receiving, means for determining, means for encoding, means for generating, means for assigning, means for inputting, and/or means for decoding may comprise one or more processors or antennas at the BS 110 or UE 120, such as the transmit processor 420, controller/processor 440, receive processor 438, or antennas 434 at the BS 110 and/or the transmit processor 464, controller/processor 480, receive processor 458, or antennas 452 at the UE 120.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • PLD programmable logic device
  • a general-purpose processor may be a microprocessor, but in the alternative, the processor may be any commercially available 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, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
  • an example hardware configuration may comprise a processing system in a wireless node.
  • the processing system may be implemented with a bus architecture.
  • the bus may include any number of interconnecting buses and bridges depending on the specific application of the processing system and the overall design constraints.
  • the bus may link together various circuits including a processor, machine-readable media, and a bus interface.
  • the bus interface may be used to connect a network adapter, among other things, to the processing system via the bus.
  • the network adapter may be used to implement the signal processing functions of the PHY layer.
  • a user interface e.g., keypad, display, mouse, joystick, etc.
  • a user interface e.g., keypad, display, mouse, joystick, etc.
  • the bus may also link various other circuits such as timing sources, peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further.
  • the processor may be implemented with one or more general-purpose and/or special-purpose processors. Examples include microprocessors, microcontrollers, DSP processors, and other circuitry that can execute software. Those skilled in the art will recognize how best to implement the described functionality for the processing system depending on the particular application and the overall design constraints imposed on the overall system.
  • the functions may be stored or transmitted over as one or more instructions or code on a computer-readable medium.
  • Software shall be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
  • Computer-readable media include both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • the processor may be responsible for managing the bus and general processing, including the execution of software modules stored on the machine-readable storage media.
  • a computer-readable storage medium may be coupled to a processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor.
  • the machine-readable media may include a transmission line, a carrier wave modulated by data, and/or a computer readable storage medium with instructions stored thereon separate from the wireless node, all of which may be accessed by the processor through the bus interface.
  • the machine-readable media, or any portion thereof may be integrated into the processor, such as the case may be with cache and/or general register files.
  • machine-readable storage media may include, by way of example, RAM (Random Access Memory) , flash memory, ROM (Read Only Memory) , PROM (Programmable Read-Only Memory) , EPROM (Erasable Programmable Read-Only Memory) , EEPROM (Electrically Erasable Programmable Read-Only Memory) , registers, magnetic disks, optical disks, hard drives, or any other suitable storage medium, or any combination thereof.
  • RAM Random Access Memory
  • ROM Read Only Memory
  • PROM Programmable Read-Only Memory
  • EPROM Erasable Programmable Read-Only Memory
  • EEPROM Electrical Erasable Programmable Read-Only Memory
  • registers magnetic disks, optical disks, hard drives, or any other suitable storage medium, or any combination thereof.
  • the machine-readable media may be embodied in a computer-program product.
  • a software module may comprise a single instruction, or many instructions, and may be distributed over several different code segments, among different programs, and across multiple storage media.
  • the computer-readable media may comprise a number of software modules.
  • the software modules include instructions that, when executed by an apparatus such as a processor, cause the processing system to perform various functions.
  • the software modules may include a transmission module and a receiving module. Each software module may reside in a single storage device or be distributed across multiple storage devices.
  • a software module may be loaded into RAM from a hard drive when a triggering event occurs.
  • the processor may load some of the instructions into cache to increase access speed.
  • One or more cache lines may then be loaded into a general register file for execution by the processor.
  • 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 (IR) , radio, and microwave
  • the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium.
  • Disk and disc include compact disc (CD) , laser disc, optical disc, digital versatile disc (DVD) , floppy disk, and disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers.
  • computer-readable media may comprise non-transitory computer-readable media (e.g., tangible media) .
  • computer-readable media may comprise transitory computer-readable media (e.g., a signal) . Combinations of the above should also be included within the scope of computer-readable media.
  • modules and/or other appropriate means for performing the methods and techniques described herein can be downloaded and/or otherwise obtained by a user terminal and/or base station as applicable.
  • a user terminal and/or base station can be coupled to a server to facilitate the transfer of means for performing the methods described herein.
  • various methods described herein can be provided via storage means (e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc. ) , such that a user terminal and/or base station can obtain the various methods upon coupling or providing the storage means to the device.
  • storage means e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc.
  • CD compact disc
  • floppy disk etc.
  • any other suitable technique for providing the methods and techniques described herein to a device can be utilized.

Landscapes

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

Abstract

Selon certains aspects, la présente invention concerne globalement des procédés et un appareil pour coder des bits d'informations. Un procédé donné à titre d'exemple comprend d'une manière générale les étapes consistant à déterminer un emplacement dans un flux d'informations pour un ou plusieurs premiers bits, le ou les premiers bits indiquant une valeur de bit d'un ou de plusieurs seconds bits dans le flux d'informations et/ou une taille du flux d'informations, à attribuer le ou les premiers bits à des indices de bits dans le flux d'informations correspondant à l'emplacement déterminé, et à entrer le flux d'informations, comprenant le ou les premiers bits et le ou les seconds bits, dans un codeur polaire et à générer un mot de code par codage du flux d'informations à l'aide d'un code polaire.
PCT/CN2017/099356 2017-08-28 2017-08-28 Bits codés de dépendance pour codes polaires WO2019041109A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/099356 WO2019041109A1 (fr) 2017-08-28 2017-08-28 Bits codés de dépendance pour codes polaires

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/099356 WO2019041109A1 (fr) 2017-08-28 2017-08-28 Bits codés de dépendance pour codes polaires

Publications (1)

Publication Number Publication Date
WO2019041109A1 true WO2019041109A1 (fr) 2019-03-07

Family

ID=65524654

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/099356 WO2019041109A1 (fr) 2017-08-28 2017-08-28 Bits codés de dépendance pour codes polaires

Country Status (1)

Country Link
WO (1) WO2019041109A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020190882A1 (fr) * 2019-03-18 2020-09-24 Qualcomm Incorporated Techniques de rapport d'informations d'état de canal dans des communications sans fil de liaison latérale
WO2021196054A1 (fr) * 2020-03-31 2021-10-07 华为技术有限公司 Procédé et appareil de codage et de décodage de code polaire

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013101123A1 (fr) * 2011-12-29 2013-07-04 Intel Corporation Reprise sur erreurs utilisant une redondance implicite
WO2014117837A1 (fr) * 2013-01-31 2014-08-07 Intracom S.A. Telecom Solutions Conception de codes ldpc et appareil de codage pour leur application
WO2016123372A1 (fr) * 2015-01-28 2016-08-04 Interdigital Patent Holdings, Inc. Procédés de rétroaction de liaison montante permettant d'utiliser un grand nombre de porteuses

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013101123A1 (fr) * 2011-12-29 2013-07-04 Intel Corporation Reprise sur erreurs utilisant une redondance implicite
WO2014117837A1 (fr) * 2013-01-31 2014-08-07 Intracom S.A. Telecom Solutions Conception de codes ldpc et appareil de codage pour leur application
WO2016123372A1 (fr) * 2015-01-28 2016-08-04 Interdigital Patent Holdings, Inc. Procédés de rétroaction de liaison montante permettant d'utiliser un grand nombre de porteuses

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020190882A1 (fr) * 2019-03-18 2020-09-24 Qualcomm Incorporated Techniques de rapport d'informations d'état de canal dans des communications sans fil de liaison latérale
US11190248B2 (en) 2019-03-18 2021-11-30 Qualcomm Incorporated Channel state information reporting techniques in sidelink wireless communications
US11632156B2 (en) 2019-03-18 2023-04-18 Qualcomm Incorporated Channel state information reporting techniques in sidelink wireless communications
WO2021196054A1 (fr) * 2020-03-31 2021-10-07 华为技术有限公司 Procédé et appareil de codage et de décodage de code polaire

Similar Documents

Publication Publication Date Title
US11388731B2 (en) Control channel code rate selection
EP3673595B1 (fr) Réduction de l'espace de recherche de décodage par maximum de vraisemblance pour codes polaires
WO2018127172A1 (fr) Schéma de correspondance de débit destiné à des canaux de commande utilisant des codes polaires
US11171672B2 (en) Dynamic frozen polar codes
WO2019090468A1 (fr) Procédés et appareil de codage polaire concaténé par contrôle de redondance cyclique
US10700829B2 (en) Combining decision metrics of a scrambled payload
WO2018205777A1 (fr) Schéma d'adaptation de débit de codes polaires
WO2019096168A1 (fr) Segmentation d'informations de commande de liaison montante pour codes polaires
WO2019033227A1 (fr) Motif unifié de perforation et raccourcissement de codes polaires
WO2019101057A1 (fr) Demande de retransmission automatique hybride à base de tampon circulaire destinée à des codes polaires
WO2019041109A1 (fr) Bits codés de dépendance pour codes polaires
WO2019136705A1 (fr) Construction sensible au canal de codes polaires
WO2020210936A1 (fr) Ajustement de m pour une conception de mise en correspondance de taux de codes polaires
WO2019071382A1 (fr) Codage polaire spécifique à l'utilisateur

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

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

Country of ref document: EP

Kind code of ref document: A1