EP3622646B1 - Enhanced polarization weighting to enable scalability in polar code bit distribution - Google Patents

Enhanced polarization weighting to enable scalability in polar code bit distribution Download PDF

Info

Publication number
EP3622646B1
EP3622646B1 EP18733373.7A EP18733373A EP3622646B1 EP 3622646 B1 EP3622646 B1 EP 3622646B1 EP 18733373 A EP18733373 A EP 18733373A EP 3622646 B1 EP3622646 B1 EP 3622646B1
Authority
EP
European Patent Office
Prior art keywords
polar
polar code
bit
exponential
bits
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP18733373.7A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP3622646A1 (en
Inventor
Kevin A. Shelby
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Coherent Logix Inc
Original Assignee
Coherent Logix Inc
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 Coherent Logix Inc filed Critical Coherent Logix Inc
Publication of EP3622646A1 publication Critical patent/EP3622646A1/en
Application granted granted Critical
Publication of EP3622646B1 publication Critical patent/EP3622646B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • 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/033—Theoretical methods to calculate these checking 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/13—Linear 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
    • 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/007—Unequal error protection

Definitions

  • the field of the invention generally relates to polar code construction.
  • Polar codes are used in a wide variety of technological applications. When constructing a polar code, frozen bits and information bits are allocated to specific bit locations within the polar code. Existing algorithms for polar code construction may be inefficient computationally, or may otherwise introduce undesirable features into the polar code. Accordingly, improvements in the field are desired.
  • EP 2 899 911 A1 discloses a method and an apparatus for generating a hybrid Polar code.
  • the method includes: obtaining a first matrix of NxN and a sequence that includes N bits, where N is a code length of a hybrid Polar code, N rows of the first matrix correspond to the N bits in the sequence in a one-to-one manner, and N is a positive integer; determining reliability of the N bits, and determining the weight of each row in the N rows of the first matrix; selecting, according to the reliability of the N bits and the weight of the N rows of the first matrix, K bits among the N bits as information bits, or selecting, according to the reliability of the N bits and the weight of the N rows of the first matrix, K rows of the first matrix to construct a second matrix of KxN used for encoding, so as to encode an information bit sequence according to positions of the information bits or according to the second matrix to generate the hybrid Polar code, where K is the length of a to-be-encoded information bit sequence and is not greater than N.
  • US 2016/0079999 A1 discloses a coding method and a coding device.
  • the coding method includes: coding information bits a to be coded via cyclic redundancy check CRC, then inputting the bits coded via the CRC into an interleaver determined by a construction parameter of a Polar code, where the interleaver is configured to interleave the bits coded via the CRC and output interleaved bits; and coding the output interleaved bits via the Polar code to obtain a coded Polar code.
  • the above method is used to solve a problem in the prior art that minimum code distance of a Polar code is not large enough when the Polar code is relatively short or is of a medium length.
  • some embodiments are described of systems and methods for determining reliabilities of bit positions in construction of a polar code.
  • some embodiments may relate to a user equipment (UE) or a base station (BS) that comprises at least one radio, a memory, and one or more processing elements, and which is configured to perform a subset or all of the operations described herein.
  • UE user equipment
  • BS base station
  • a UE constructs and transmits polar encoded data.
  • the data to be polar encoded may be stored, and a coding rate for polar encoding the data may be determined.
  • a reliability associated with each bit position in a bit sequence may be determined by calculating a sequence of weighted summations corresponding to each of the bit positions. The reliability of each bit position may be determined from its respective weighted summation, wherein the weighted summation corresponding to each respective bit position is a weighted summation over a binary expansion of the respective bit position.
  • the weighted summation may be weighted by a first multiplicative factor, and the first multiplicative factor may be selected based at least in part on the coding rate.
  • the bit positions may be rank ordered based on their respective reliabilities, and the data may be allocated as information bits in the most reliable bit positions of a polar code based on the rank ordering.
  • the remaining portion of bit positions may be allocated as frozen bits of the polar code.
  • the information bits and the frozen bits may be polar encoded, and the UE may then transmit the polar encoded information bits and frozen bits.
  • Memory Medium Any of various types of memory devices or storage devices.
  • the term "memory medium” is intended to include an installation medium, e.g., a CD-ROM, floppy disks, or tape device; a computer system memory or random access memory such as DRAM, DDR RAM, SRAM, EDO RAM, Rambus RAM, etc.; or a non-volatile memory such as a magnetic media, e.g., a hard drive, optical storage, or ROM, EPROM, FLASH, etc.
  • the memory medium may comprise other types of memory as well, or combinations thereof.
  • the memory medium may be located in a first computer in which the programs are executed, and/or may be located in a second different computer which connects to the first computer over a network, such as the Internet. In the latter instance, the second computer may provide program instructions to the first computer for execution.
  • the term "memory medium" may include two or more memory mediums which may reside in different locations, e.g., in different computers that are connected over a network.
  • Carrier Medium a memory medium as described above, as well as a physical transmission medium, such as a bus, network, and/or other physical transmission medium that conveys signals such as electrical or optical signals.
  • Programmable Hardware Element - includes various hardware devices comprising multiple programmable function blocks connected via a programmable or hardwired interconnect. Examples include FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), FPOAs (Field Programmable Object Arrays), and CPLDs (Complex PLDs).
  • the programmable function blocks may range from fine grained (combinatorial logic or look up tables) to coarse grained (arithmetic logic units or processor cores).
  • a programmable hardware element may also be referred to as "reconfigurable logic”.
  • ASIC Application Specific Integrated Circuit
  • program is intended to have the full breadth of its ordinary meaning.
  • program includes 1) a software program which may be stored in a memory and is executable by a processor or 2) a hardware configuration program useable for configuring a programmable hardware element or ASIC.
  • Software Program is intended to have the full breadth of its ordinary meaning, and includes any type of program instructions, code, script and/or data, or combinations thereof, that may be stored in a memory medium and executed by a processor.
  • Exemplary software programs include programs written in text-based programming languages, e.g., imperative or procedural languages, such as C, C++, PASCAL, FORTRAN, COBOL, JAVA, assembly language, etc.; graphical programs (programs written in graphical programming languages); assembly language programs; programs that have been compiled to machine language; scripts; and other types of executable software.
  • a software program may comprise two or more software programs that interoperate in some manner.
  • Hardware Configuration Program - a program, e.g., a netlist or bit file, that can be used to program or configure a programmable hardware element or ASIC.
  • Computer System any of various types of computing or processing systems, including a personal computer system (PC), mainframe computer system, workstation, network appliance, Internet appliance, personal digital assistant (PDA), grid computing system, or other device or combinations of devices.
  • PC personal computer system
  • mainframe computer system workstation
  • network appliance Internet appliance
  • PDA personal digital assistant
  • grid computing system or other device or combinations of devices.
  • computer system can be broadly defined to encompass any device (or combination of devices) having at least one processor that executes instructions from a memory medium.
  • Automatically - refers to an action or operation performed by a computer system (e.g., software executed by the computer system) or device (e.g., circuitry, programmable hardware elements, ASICs, etc.), without user input directly specifying or performing the action or operation.
  • a computer system e.g., software executed by the computer system
  • device e.g., circuitry, programmable hardware elements, ASICs, etc.
  • An automatic procedure may be initiated by input provided by the user, but the subsequent actions that are performed "automatically” are not specified by the user, i.e., are not performed "manually", where the user specifies each action to perform.
  • a user filling out an electronic form by selecting each field and providing input specifying information is filling out the form manually, even though the computer system must update the form in response to the user actions.
  • the form may be automatically filled out by the computer system where the computer system (e.g., software executing on the computer system) analyzes the fields of the form and fills in the form without any user input specifying the answers to the fields.
  • the user may invoke the automatic filling of the form, but is not involved in the actual filling of the form (e.g., the user is not manually specifying answers to fields but rather they are being automatically completed).
  • the present specification provides various examples of operations being automatically performed in response to actions the user has taken.
  • Figure 1 illustrates an exemplary (and simplified) wireless environment that includes multiple communication systems.
  • Figure 1 shows an example communication system involving a base station (BS) 102 communicating with a plurality of user equipment devices (UEs) 106A-C.
  • the base station 102 may be a cellular base station which performs cellular communications with a plurality of wireless communication devices.
  • the base station 102 may be a wireless access point for performing Wi-Fi communications, such as according to the 802.11 standard or related standards.
  • the UEs 106 may be any of various devices such as a smart phone, tablet device, computer system, etc.
  • One or both of the base station 102 and the wireless communication device 106 may include polar encoding logic as described herein.
  • different UEs and the base station are configured to communicate via a broadcast network and/or a packet-switched cellular network. It is noted that the system of Figure 1 is merely one example of possible systems, and embodiments may be implemented in any of various systems, as desired.
  • Cellular base station 102 may be a base transceiver station (BTS) or cell site, and may include hardware that enables wireless communication with the UEs 106A-C.
  • the base station 102 may also be configured to communicate with a core network.
  • the core network may be coupled to one or more external networks, which may include the Internet, a Public Switched Telephone Network (PSTN), and/or any other network.
  • PSTN Public Switched Telephone Network
  • the base station 102 may facilitate communication between the UE devices 106A-C and a network.
  • Base station 102 and other base stations operating according to the same or different radio access technologies (RATs) or cellular communication standards may be provided as a network of cells, which may provide continuous or nearly continuous overlapping service to UEs 106A-C and similar devices over a wide geographic area via one or more RATs.
  • RATs radio access technologies
  • cellular communication standards may be provided as a network of cells, which may provide continuous or nearly continuous overlapping service to UEs 106A-C and similar devices over a wide geographic area via one or more RATs.
  • the base station 102 may be configured to broadcast communications to the UEs 106A-C.
  • broadcast herein may refer to one-to-many transmissions that are transmitted for receiving devices in a broadcast area rather than being addressed to a particular device. Further, broadcast transmissions are typically unidirectional (from transmitter to receiver). In some situations, control signaling (e.g., ratings information) may be passed back to a broadcast transmitter from the receivers, but the content data is transmitted in only one direction. In contrast, cellular communication is typically bi-directional. "Cellular" communications also may involve handoff between cells.
  • UE 106A when UE 106A (and/or UEs 106B-C) moves out of the cell served by cellular base station 102, it may be handed over to another cellular base station (and the handover may be handled by the network, including operations performed by base station 102 and the other cellular base station).
  • a user when a user moves from the range covered by a first broadcast base station to the range covered by a second broadcast base station, it may switch to receiving content from the second broadcast base station, but the base stations do not need to facilitate handover (e.g., they simply continue broadcasting and do not care which base station a particular UE is using).
  • a broadcast base station is configured to relinquish one or more frequency bands during scheduled time intervals for use by a cellular base station for packet-switched communications.
  • control signaling transmitted by a broadcast or cellular base station may allow end user devices to maintain full signaling connectivity (which may eliminate network churn), extend battery life (e.g., by determining when to remain in a low power mode when a base station is not transmitting), and/or actively manage coverage detection (e.g., rather than perceiving spectrum sharing periods as spotty coverage or a temporary network outage).
  • the base station 102 and the UEs 106A, 106B, and 106C may be configured to communicate over the transmission medium using any of various RATs (also referred to as wireless communication technologies or telecommunication standards), such as LTE, 5G New Radio (NR), Next Generation Broadcast Platform (NGBP), W-CDMA, TD-SCDMA, and GSM, among possible others such as UMTS, LTE-A, CDMA2000 (e.g., 1xRTT, 1xEV-DO, HRPD, eHRPD), Advanced Television Systems Committee (ATSC) standards, Digital Video Broadcasting (DVB), etc.
  • any of the transmissions between the base station 102 and the UEs 106A, 106B, and 106C may utilize the methods of enhanced PW for polar code construction to polar encode the transmitted data, according to embodiments described herein.
  • Broadcast and cellular networks are discussed herein to facilitate illustration, but these technologies are not intended to limit the scope of the present disclosure and the disclosed spectrum sharing techniques may be used between any of various types of wireless networks, in other embodiments.
  • Figure 2 illustrates an exemplary wireless communication system that includes base stations 102A and 102B which communicate over a transmission medium with one or more user equipment (UE) devices, represented as UEs 106A-106C.
  • UE user equipment
  • the communication environment in Figure 2 may function similarly to that described in Figure 1 , above.
  • Figure 2 illustrates that the center UE 106B may operate within range of both of the base stations 102A and 102B. In these embodiments, UE 106B may mistakenly receive a communication from base station 102B when it was intending to receive communications from base station 102A.
  • FIG 3 illustrates an exemplary block diagram of a base station 102.
  • base station 102 may be a broadcast base station such as base station 102A of Figure 2 and/or a cellular base station such as base station 102B of Figure 2 . It is noted that the base station of Figure 3 is merely one example of a possible base station.
  • the base station 102 may include processor(s) 304 which may execute program instructions for the base station 102.
  • the processor(s) 304 may also be coupled to memory management unit (MMU) 340, which may be configured to receive addresses from the processor(s) 304 and translate those addresses to locations in memory (e.g., memory 360 and read-only memory (ROM) 350) or to other circuits or devices.
  • MMU memory management unit
  • the base station 102 may include at least one network port 370.
  • the network port 370 may be configured to couple to a telephone network and provide a plurality of devices, such as UE devices 106, access to the telephone network as described above.
  • the network port 370 (or an additional network port) may be coupled to a television network and configured to receive content for broadcasting.
  • the network port 370 (or an additional network port) may also or alternatively be configured to couple to a cellular network, e.g., a core network of a cellular service provider.
  • the core network may provide mobility related services and/or other services to a plurality of devices, such as UE devices 106.
  • the network port 370 may couple to a telephone network via the core network, and/or the core network may provide a telephone network (e.g., among other UE devices 106 serviced by the cellular service provider).
  • the base station 102 may include at least one antenna 334.
  • the at least one antenna 334 may be configured to operate as a wireless transceiver and may be further configured to communicate with UE devices 106 via radio 330.
  • the antenna 334 communicates with the radio 330 via communication chain 332 in the illustrated embodiment.
  • Communication chain 332 may be a receive chain, a transmit chain or both.
  • the radio 330 may be configured to communicate via various RATs.
  • the processor(s) 304 of the base station 102 may be configured to implement part or all of the methods described herein, e.g., by executing program instructions stored on a memory medium (e.g., a non-transitory computer-readable memory medium).
  • the processor 304 may be configured as a programmable hardware element, such as an FPGA (Field Programmable Gate Array), or as an ASIC (Application Specific Integrated Circuit), or a combination thereof.
  • the processor, MMU, and memory may be a distributed multiprocessor system.
  • the processor system may comprise a plurality of interspersed processors and memories, where processing elements (also called functional units) are each connected to a plurality of memories, also referred to as data memory routers.
  • the processor system may be programmed to implement the methods described herein.
  • base station 102 is configured to perform both broadcast and bi-directional packet-switched communications.
  • base station 102 may include multiple radios 330, communication chains 332, and/or antennas 334, for example.
  • the disclosed spectrum sharing techniques may be performed by different base stations configured to perform only broadcast transmissions or only packet-switched communications.
  • FIG. 4 illustrates an example simplified block diagram of a UE 106.
  • the UE 106 may be any of various devices as defined above.
  • UE device 106 may include a housing which may be constructed from any of various materials.
  • the UE 106 may include a system on chip (SOC) 400, which may include portions for various purposes.
  • the SOC 400 may be coupled to various other circuits of the UE 106.
  • the UE 106 may include various types of memory (e.g., including NAND flash 410), a connector interface 420 (e.g., for coupling to a computer system, dock, charging station, etc.), the display 460, wireless communication circuitry 430 such as for LTE, 5G New Radio (NR), GSM, Bluetooth (BT), WLAN, and/or broadcast, etc.
  • the UE 106 may further comprise one or more smart cards that implement SIM (Subscriber Identity Module) functionality.
  • the wireless communication circuitry 430 may couple to one or more antennas, such as antenna 435.
  • the SOC 400 may include processor(s) 402 which may execute program instructions for the UE 106 and display circuitry 404 which may perform graphics processing and provide display signals to the display 460.
  • the processor(s) 402 may also be coupled to memory management unit (MMU) 440, which may be configured to receive addresses from the processor(s) 402 and translate those addresses to locations in memory (e.g., memory (e.g., read only memory (ROM) or another type of memory) 406, NAND flash memory 410) and/or to other circuits or devices, such as the display circuitry 404, wireless communication circuitry 430, connector I/F 420, and/or display 460.
  • the MMU 440 may be configured to perform memory protection and page table translation or set up.
  • the MMU 440 may be included as a portion of the processor(s) 402.
  • the processor, MMU, and memory may be a distributed multiprocessor system.
  • the processor system may comprise a plurality of interspersed processors and memories, where processing elements (also called functional units) are each connected to a plurality of memories, also referred to as data memory routers.
  • the processor system may be programmed to implement the methods described herein.
  • UE 106 is configured to receive wireless broadcasts, e.g., from broadcast base station 102A of Figure 2 .
  • UE 106 may include a broadcast radio receiver.
  • UE 106 is configured to receive broadcast data and perform packet-switched cellular communications (e.g., LTE) at the same time using different frequency bands and/or the same frequency resources during different time slices. This may allow users to view TV broadcasts while performing other tasks such as browsing the internet (e.g., in a split-screen mode), using web applications, or listening to streaming audio.
  • the disclosed techniques may be used in systems with devices that are configured as broadcast receivers or for cellular communications, but not both.
  • the processor(s) 402 of the UE device 106 may be configured to implement part or all of the features described herein, e.g., by executing program instructions stored on a memory medium (e.g., a non-transitory computer-readable memory medium).
  • the processor(s) 402 may comprise a multiprocessor array of a plurality of parallelized processing elements.
  • the processor(s) 402 may be designed in accordance with the HyperX architecture described in detail in Reference 6, or another parallel processor architecture.
  • separate ones of the parallelized processing elements may be configured to perform decoding procedures on separate respective bit paths of a successive cancellation list (SCL) decoding procedure, or they may be configured to perform decoding procedures on separate encoded messages in parallel, for example.
  • SCL successive cancellation list
  • processor(s) 402 may be configured as a programmable hardware element, such as an FPGA (Field Programmable Gate Array), or as an ASIC (Application Specific Integrated Circuit).
  • processor(s) 402 of the UE device 106 in conjunction with one or more of the other components 400, 404, 406, 410, 420, 430, 435, 440, 460 may be configured to implement part or all of the features described herein.
  • UE 106 may have a display 460, which may be a touch screen that incorporates capacitive touch electrodes. Display 460 may be based on any of various display technologies.
  • the housing of the UE 106 may contain or comprise openings for any of various elements, such as buttons, speaker ports, and other elements (not shown), such as microphone, data port, and possibly various types of buttons, e.g., volume buttons, ringer button, etc.
  • the UE 106 may support multiple radio access technologies (RATs).
  • RATs radio access technologies
  • UE 106 may be configured to communicate using any of various RATs such as two or more of Global System for Mobile Communications (GSM), Universal Mobile Telecommunications System (UMTS), Code Division Multiple Access (CDMA) (e.g., CDMA2000 1XRTT or other CDMA radio access technologies), Long Term Evolution (LTE), LTE Advanced (LTE-A), 5G NR, and/or other RATs.
  • GSM Global System for Mobile Communications
  • UMTS Universal Mobile Telecommunications System
  • CDMA Code Division Multiple Access
  • LTE Long Term Evolution
  • LTE-A LTE Advanced
  • 5G NR 5G NR
  • the UE 106 may support at least two radio access technologies such as LTE and GSM.
  • Various different or other RATs may be supported as desired.
  • UE 106 is also configured to receive broadcast radio transmissions which may convey audio and/or video content.
  • a UE 106 may be configured to receive broadcast radio transmissions and may not be configured to perform bi-directional communications with a base station (e.g., UE 106 may be a media playback device).
  • Polar codes are being increasingly used in a variety of technological applications. For example, it is anticipated that 5G NR communications between a UE (such as UE 106) and a base station (such as BS 102) may employ polar codes. Polar codes are a specific type of forward error correction (FEC) codes.
  • FEC forward error correction
  • the resulting polar codes leverage a phenomenon known as channel polarization which transforms a physical channel W into an arrangement of synthetic channels W N i , the respective capacities of which, i.e. maximum mutual information between channel input and output, tend toward 1 (highly reliable) or 0 (highly unreliable).
  • Data may be transferred by placing information on bits on the most reliable channels, and these bits may be referred to as information bits.
  • Bits placed on the least reliable channels may be set to a fixed value, e.g. 0 or another known value or set of values that is known to both the transmitter and receiver, and these bits may be referred to as frozen bits.
  • Frozen bits and their mapping to the code matrix may be known by both the transmitter and receiver. As a result, frozen bit positions are set to their known values by a decoding algorithm at a receiver as part of the decoding process.
  • Constructing a polar code of block length N may entail identifying an ordered sequence that reflects the synthetic channel reliabilities, assigning user information in the most reliable channel positions, and assigning the frozen bit pattern (not precluding the all-zeros dataset) in the least reliable channel positions.
  • Polar codes form a class of linear block codes described by a generator matrix, G.
  • a polar code is defined by the location of k information bits and (N-k) frozen bits in a block of length, N .
  • the code rate can be adjusted linearly by varying the number of non-frozen bits per block.
  • channel polarization splits a binary memoryless symmetric (BMS) channel W :X ⁇ Y into a pair of synthetic channels W 0 :X ⁇ Y 2 and W 1 :X ⁇ Y 2
  • x 1 1 2 ⁇ x 2 ⁇ X W y 1
  • x 2 1 2 W y 1
  • x 2 1 2 W y 1
  • ⁇ indicates an exclusive-OR (XOR) operation.
  • MI mutual information
  • the encoder begins with inputs, u i , which are encoded into outputs, x i . Information bits are shown in bold. The remaining inputs may be assigned frozen bit values, 0. At each stage, s, the encoder combines pairs of bits according to the encoding tree shown to the right.
  • Polar code construction involves a permutation in bit position to reflect a rank ordering of the synthetic channel reliabilities.
  • N the information bit set is mapped to the K most reliable channel positions while the frozen bit set is placed in the remaining N-K channel positions.
  • PW Polarization Weight
  • FRANK FRActally eNhanced Kernel
  • Embodiments herein improve upon legacy PW and FRANK polar code construction by implementing an enhanced PW polar code construction, to improve computational efficiency and information bit allocation.
  • Some embodiments herein present novel means for efficient computation of the ordered sequence and assignment of bit positions as implemented in a finite precision Memory in Network Processor (MiNP) architecture such as that described in Reference [3], above.
  • MiNP Memory in Network Processor
  • Embodiments herein describe an enhanced PW methodology for allocating information bits in a polar code.
  • Enhanced PW utilizes a technique known as ⁇ -expansion, which provides a theoretical framework to enable fast determination of the ordered sequence used in polar code construction.
  • Enhanced PW utilizes a generalized ⁇ -expansion, the procedure for which can be summarized as follows:
  • Figure 7 is a flowchart diagram illustrating a method for transmitting polar coded data, wherein the polar code has been constructed using enhanced PW, according to some embodiments.
  • the method shown in Figure 7 may be used in conjunction with any of the systems or devices shown in the above Figures, among other devices.
  • the method shown in Figure 7 may be used by a UE 106 in communication with another UE or a base station 102, or by a base station in communication with a UE or another base station. More generally, the method may be employed by any wired or wireless polar encoded transmission from one device to another.
  • some of the method elements shown may be performed concurrently, in a different order than shown, or may be omitted. Additional method elements may also be performed as desired. As shown, this method may operate as follows.
  • data to be polar encoded may be stored.
  • the data may be stored in a memory of a UE device, or another type of device configured to transmit polar coded data.
  • a coding rate for polar encoding the data may be determined.
  • the coding rate K may be determined based on a variety of factors, including signal strength, channel conditions, transmission power, battery level of the device, etc. For example, under good channel conditions a higher coding rate may be used to transmit data with a more efficient throughput. In contrast, under poor channel conditions a lower coding rate may be used to ensure that data is only transmitted on very reliable bits, to reduce the likelihood of transmission errors.
  • a reliability associated with each bit position in a bit sequence may be determined.
  • the reliabilities may be determined by calculating a sequence of weighted summations corresponding to each of the bit positions.
  • the reliability of each bit position may be determined from its respective weighted summation, wherein the weighted summation corresponding to each respective bit position is a weighted summation over a binary expansion of the respective bit position.
  • the weighted summation may be performed according to enhanced PW utilizing a generalized ⁇ -expansion, as variously described above.
  • the summation may be weighted based on the determined coding rate for polar encoding the data.
  • the weighted summation may be weighted by a first multiplicative factor, wherein the first multiplicative factor is selected based at least in part on the coding rate.
  • the multiplicative factor may be an exponential quantity (e.g., 2 x for some value of x , or another exponential quantity), and the exponential quantity may comprise a first exponential factor, wherein the first exponential factor is the exponential power of each term in the binary expansion being summed over.
  • the exponential quantity may further comprise a second exponential factor, 1/ m, wherein the second exponential factor comprises an adjustable parameter that is tunable based at least in part on the coding rate.
  • the exact channel reliabilities at higher code rates may be more closely approximated by enhanced PW if larger values of m are used.
  • K 16 (top left of Figure 18 )
  • IDX the exact channel reliability
  • larger values of m produce an information bit allocation with more information bits at earlier bit positions than smaller values of m .
  • the second exponential factor is further selected to spread a distribution of the information bits of the polar code to earlier bit positions relative to that obtained from selecting a first exponential factor of 1 ⁇ 4.
  • the summation may be weighted further based on a block size of the polar code (e.g., the multiplicative factor may be further selected based on the block size of the polar code). For example, as described in greater detail below in reference to Table 4, an error magnitude may be determined for various values of m for each value of block size and coding rate employed by the polar code. A value of m may be selected that minimizes the discrepancy between the determined reliabilities and the exact channel reliabilities.
  • the multiplicative factor is further selected such that the polar code approximates a corresponding polar code, wherein the corresponding polar code implements the determined coding rate and is constructed using an alternative polar code construction methodology.
  • the polar code may be constructed according to an enhanced polarization weighting methodology, and the alternative polar code construction methodology may comprise a FRANK polar code construction methodology.
  • altering the value of m depending on the value of the coding rate K may result in identical information bit allocation in the K011[192,255] block for enhanced PW and FRANK polar code construction.
  • FRANK may result in a more desirable information bit allocation (e.g., FRANK tends to allocate more information bits earlier in the polar code, leading to faster reception of information bits by the receiver and resulting in a closer approximation to the exact channel reliabilities).
  • FRANK may be subject to adverse finite precision effects, whereas finite precision effects are negligible with PW.
  • Enhanced PW which may be used to approximate the information bit allocation of FRANK while avoiding the finite precision effects of FRANK, may therefore offer substantial improvement over existing methods for polar code construction.
  • the bit positions may be rank ordered based on their respective reliabilities.
  • the bit positions may be rank ordered in ascending order of their respective determined reliabilities.
  • the data may be allocated as information bits in the most reliable bit positions of the polar code based on the rank ordering.
  • the remaining bit positions may be allocated as frozen bits of the polar code.
  • the information bits and the frozen bits may be encoded.
  • the information bits and the frozen bits may be processed through a polar encoding algorithm to obtain polar encoded information bits and frozen bits.
  • the polar encoded information bits and frozen bits may be transmitted.
  • a UE may wirelessly transmit the polar encoded information bits and frozen bits as a polar encoded message to another remote UE or to a base station.
  • the method described in reference to steps 702-714 may be repeated for second data to be polar encoded according to a second coding rate.
  • second data to be polar encoded may be stored, and a second coding rate for polar encoding the second data may be determined.
  • second reliabilities may be determined using weighted summations, wherein the weighted summation is weighted by a second multiplicative factor that is selected based on the second coding rate.
  • the UE may adapt the reliability determination based on the coding rate used for each particular data transmission.
  • the UE may correspondingly perform second rank ordering of the bit positions based on their respective second reliabilities, encode the second data in the most reliable bit positions as information bits of a second polar code based on the second rank ordering, allocate the remaining portion of bit positions as frozen bits of the second polar code, and transmit the information bits and the frozen bits of the second polar code.
  • a partial order of reliability measure exists for any binary symmetric channel. This reliability measure may be insufficient to form a fully ordered sequence over N bit positions, each corresponding to an index of the synthetic channel, and is therefore deemed partial.
  • Left-Swap Given a so-called left-swap such that "0..1 ⁇ 1..0" where the pattern can occur multiple times and the bit positions need not be adjacent: 2 0,1 _ 0 ⁇ 4 1,0 _ 0 , 12 0 , _ 1 , 1 , _ 0,0 ⁇ 24 1 , _ 1 , 0 , _ 0,0 .
  • the UPO is referred to as "universal" because the approach holds for any binary symmetric channel.
  • PW polar code construction is a method based in Binary Expansion (BE), and aimed at addressing the reliability order issue.
  • BE Binary Expansion
  • the procedure for deriving the ordered sequence and info/frozen bit positions using PW polar code construction may be summarized as follows:
  • a signal-to-noise ratio (SNR)-independent reliability estimation is performed by computing the reliability of each sub-channel (offline operation), and storing the ordered index sequence, Q 0 Nmax ⁇ 1 , for the polar code of maximum code length N max .
  • the reliability order of sub-channels is estimated through a weight sequence W 0 Nmax ⁇ 1 , calculated as follows:
  • the PW method of code construction involves two sets of computations: (i) accumulating the weighted sum of each x-domain index; (ii) rank ordering the weighted sums to determine the u -domain mapping.
  • This calculation may be parallelized along dimensions, i or j , as needed to reduce latency.
  • Figure 8 is a plot of PW ordered sequence latency as a function of clock speed for a variety of values of code sizes, N .
  • the latency for the ordered sequence computation is less than 20 ⁇ s given a minimum of a 1GHz clock and assuming no parallelism. With a minimum 500MHz clock, the latency remains below 50 ⁇ s for even the largest block size. Taking opportunities to parallelize the weighted sum calculation into account, the latency may be further reduced below that illustrated in Figure 8 .
  • Figure 9 is a graph of the power of the signal (
  • W max 19.8556.
  • the relative mean-squared error is shown in Figure 9 for a range of bit representations assuming 5 bits to the left of the decimal point with the remaining bits used to represent the fractional portion.
  • the quantization noise power is reduced below 75dB for modest bit widths.
  • the MiNP architecture being used for the evaluation illustrated in Figure 9 is based on 16-bit data. As illustrated, quantization error is negligible for the PW method.
  • FRANK polar code construction was introduced to provide a theoretically justifiable framework for scalable polar code sequence construction with low description complexity to enable online construction.
  • the procedure for deriving the ordered sequence and info/frozen bit positions using FRANK may be summarized as follows:
  • FIG 10 illustrates a typical mutual information (MI) recursion method employed according to FRANK polar code construction.
  • Recursive calculation of the rate allocation for each group, e.g. R0, R1, and subsequently, R00, R01, R10, R11, etc. is carried out as depicted in Figure 10 .
  • the precision requirements for polar codes constructed using FRANK are determined by R-R M terms which, for low code rates and long block sizes, may cause an underflow in fixed-point representation resulting in fewer assigned bit indices than required for the selected code rate.
  • R-R M terms which, for low code rates and long block sizes, may cause an underflow in fixed-point representation resulting in fewer assigned bit indices than required for the selected code rate.
  • the precision requirements may be relaxed.
  • a heuristic approach suggests that 13 or 14 fixed-point bits may suffice for accurate computation.
  • Embodiments herein analyze PW code construction alongside FRANK code construction to obtain a modified PW code that offers improved efficiency for polar code construction.
  • the two methods were examined to identify any substantive differences from an implementation standpoint.
  • PW latency is small ( ⁇ 50 ⁇ s) which is comparable to anticipated slot times for NR. Consequently, the latency for code construction may be hidden in the previous block decoding period.
  • the K -distribution for enhanced PW may be tuned to approximate that for FRANK providing a similar starting point for rate matching considerations, but without the limitation of the finite precision effects of FRANK
  • Figure 12 is a tree diagram illustrating an ordered sequence of terms in ⁇ -expansion for a particular value of m. Note that the ordered sequence may be tuned by altering ⁇ (i.e., by altering m ) to resemble the UPO reliabilities.
  • the UPO with regard to channel reliabilities is preserved provided certain conditions are met. For example:
  • Error! Reference source not found. illustrates where one or more of these basic conditions is not met for m ⁇ 2.5.
  • the chosen value of m may be governed by other considerations including the distribution of information bits to lower K -positions as well as the resulting error performance.
  • FIG. 15 is a schematic diagram illustrating the recursive bit allocation process employed by FRANK. As illustrated, FRANK prescribes a recursive procedure for distributing information bits according to the assigned code rate such that:
  • K0 R0 / R ⁇ K / 2.
  • K1 R1 / R ⁇ K / 2.
  • FRANK aims to break the bit assignments into fixed-length sub-blocks.
  • lower K -positions may be defined as those having a lower index in a given stage.
  • K000 represents a lower K -position as compared to K001, K000-K001 occupy lower K -positions than do K010-K011 , and so on.
  • the approach may result in information bit distribution to lower K -positions in proportion to the intended code rate.
  • the PW bit distribution is relatively flat in the lower K -positions as a function of code rate Error! Reference source not found. For example, see K011 [192, 255], highlighted in bold in Table 2 below.
  • Table 3 illustrates that the allocation of bits in K011[192, 255] was tuned using ⁇ -expansion with enhanced PW to match that delivered by FRANK..
  • Figure 16 is a scatterplot diagram of information bit allocation using enhanced PW for various values of m.
  • the ordered sequence may be interpreted as the result of a permutation, translating input indices to assigned bit positions.
  • the resulting channel assignments show considerably more whitespace at higher channel indices, indicating a more widespread distribution of information bits to the lower K-positions.
  • Figures 17a-17b illustrate how larger values of m may lead to information bit allocation earlier in the polar code, which may more accurately approximate the exact channel reliabilities depending on the values of the block size and the coding rate.
  • Figure 18 illustrates assigned bit position (i.e., information bit allocation) for four different values of the coding rate, K, and for various values of m, as compared to the exact channel reliabilities ("IDX").
  • IDX exact channel reliabilities
  • ⁇ - expansion and FRANK for that matter
  • the error in channel assignment is relatively small independent of the assigned ⁇ value.
  • the error rates climb steadily with K .
  • multiple crossover points exist where some values in ⁇ yield a closer match on average in assigned bit position than others. For example, the average error in asserted channel reliability is illustrated in Error! Reference source not found., where the smallest error indicates the best choice in ⁇ for a given block size and code rate.
  • Table 4 lists the values m which yield the smallest average error in assigned channel reliability for various values of code rate and various block sizes.
  • a revised approach may be implemented whereby m is determined offline based on the value that minimizes the error in channel reliability for a given code rate and block size configuration.
  • a modified ⁇ -expansion procedure may be performed as follows:
  • This modified approach may preserve the computational efficiency of ⁇ -expansion in assessing channel reliabilities at run-time while incorporating a means to tune the bit assignments for a better match in channel reliability as a function of code rate.
  • Embodiments of the present disclosure may be realized in any of various forms.
  • the present invention may be realized as a computer-implemented method, a computer-readable memory medium, or a computer system.
  • the present invention may be realized using one or more custom-designed hardware devices such as ASICs.
  • the present invention may be realized using one or more programmable hardware elements such as FPGAs.
  • a non-transitory computer-readable memory medium may be configured so that it stores program instructions and/or data, where the program instructions, if executed by a computer system, cause the computer system to perform a method, e.g., any of the method embodiments described herein, or, any combination of the method embodiments described herein, or, any subset of any of the method embodiments described herein, or, any combination of such subsets.
  • a computing device may be configured to include a processor (or a set of processors) and a memory medium, where the memory medium stores program instructions, where the processor is configured to read and execute the program instructions from the memory medium, where the program instructions are executable to implement any of the various method embodiments described herein (or, any combination of the method embodiments described herein, or, any subset of any of the method embodiments described herein, or, any combination of such subsets).
  • the device may be realized in any of various forms.

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)
  • Error Detection And Correction (AREA)
  • Dc Digital Transmission (AREA)
EP18733373.7A 2017-05-08 2018-05-07 Enhanced polarization weighting to enable scalability in polar code bit distribution Active EP3622646B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762503172P 2017-05-08 2017-05-08
PCT/US2018/031389 WO2018208672A1 (en) 2017-05-08 2018-05-07 Enhanced polarization weighting to enable scalability in polar code bit distribution

Publications (2)

Publication Number Publication Date
EP3622646A1 EP3622646A1 (en) 2020-03-18
EP3622646B1 true EP3622646B1 (en) 2020-10-21

Family

ID=62705651

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18733373.7A Active EP3622646B1 (en) 2017-05-08 2018-05-07 Enhanced polarization weighting to enable scalability in polar code bit distribution

Country Status (6)

Country Link
US (3) US10594438B2 (zh)
EP (1) EP3622646B1 (zh)
JP (1) JP7210079B2 (zh)
CN (1) CN110612681B (zh)
TW (1) TWI750372B (zh)
WO (1) WO2018208672A1 (zh)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10686556B2 (en) * 2017-01-17 2020-06-16 Qualcomm Incorporated Robust and universal polar codes
CN109391343B (zh) * 2017-08-02 2021-09-03 华为技术有限公司 一种Polar码编码方法及装置
CN111183589A (zh) * 2017-09-29 2020-05-19 中兴通讯股份有限公司 极化码编码的方法和系统
KR102438982B1 (ko) * 2017-11-16 2022-09-01 삼성전자주식회사 무선 통신 시스템에서 부호화 및 복호화를 위한 방법 및 장치
US10651972B2 (en) * 2017-12-11 2020-05-12 Qualcomm Incorporated Adjusted fractally enhanced kernel polar codes for achievable signal-to-noise ratio spike mitigation
US10873345B2 (en) * 2018-02-05 2020-12-22 Qualcomm Incorporated Enhanced polar code construction
US10447436B2 (en) * 2018-02-07 2019-10-15 Macronix International Co., Ltd. Polar code generating method, and electronic device and non-transitory computer-readable storage medium therefor
EP3570442A1 (en) * 2018-05-17 2019-11-20 Industrial Technology Research Institute Compact transmission of polar encoded dci with repetition for 5g communication systems
US11057051B2 (en) * 2018-08-13 2021-07-06 Qualcomm Incorporated Fractally enhanced kernel polar coding
CN111200439B (zh) * 2018-11-16 2022-05-06 华为技术有限公司 译码方法、装置及设备
CN109361495B (zh) 2018-12-07 2020-05-08 北京邮电大学 一种极化码构造方法、装置、电子设备及可读存储介质
CN114499743B (zh) * 2020-10-26 2024-05-28 深圳市中兴微电子技术有限公司 通信数据的处理方法、装置、设备及存储介质
WO2023204328A1 (ko) * 2022-04-22 2023-10-26 엘지전자 주식회사 채널 인코딩을 수행하는 방법, 통신 기기, 프로세싱 장치, 및 저장 매체, 그리고 채널 디코딩을 수행하는 방법, 통신 기기, 프로세싱 장치, 및 저장 매체
CN114884520A (zh) * 2022-05-07 2022-08-09 重庆邮电大学 一种基于普适偏序的松弛极化编码方法
CN117333945B (zh) * 2023-10-16 2024-06-18 中金育能科技集团有限公司 蛇形跑运动检测方法、装置、设备及存储介质

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20080073624A (ko) * 2007-02-06 2008-08-11 삼성전자주식회사 다중 편파 다중 입출력 시스템을 위한 코드북 생성 방법 및그 장치
US8345794B2 (en) * 2008-04-29 2013-01-01 Qualcomm Incorporated Encoded control channel information interleaving
KR101481435B1 (ko) * 2008-12-18 2015-01-12 삼성전자주식회사 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서 신호매핑 방법 및 이를 위한 장치
CN106899311B (zh) * 2012-09-24 2023-11-03 华为技术有限公司 混合极性码的生成方法和生成装置
CN109361402B (zh) * 2013-05-31 2019-09-20 华为技术有限公司 编码方法及编码设备
CN105164959B (zh) * 2014-02-21 2019-06-21 华为技术有限公司 用于极化码的速率匹配的方法和装置
CN105900365B (zh) * 2014-03-31 2019-09-20 华为技术有限公司 极化码的混合自动重传方法及装置、无线通信装置
US10461779B2 (en) * 2015-08-12 2019-10-29 Telefonaktiebolaget Lm Ericsson (Publ) Rate-compatible polar codes
US10171204B2 (en) * 2016-05-13 2019-01-01 Mediatek Inc. Coded bit puncturing for polar codes
US10432234B2 (en) * 2016-07-19 2019-10-01 Mediatek Inc. Low complexity rate matching for polar codes
CN107666370B (zh) * 2016-07-29 2023-09-22 华为技术有限公司 编码方法和设备
US10637607B2 (en) * 2016-09-15 2020-04-28 Huawei Technologies Co., Ltd. Method and apparatus for encoding data using a polar code
US10383106B2 (en) * 2017-01-04 2019-08-13 Coherent Logix, Incorporated Scrambling sequence design for embedding UE ID into frozen bits for DCI blind detection

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
US20200195378A1 (en) 2020-06-18
US11063697B2 (en) 2021-07-13
US11356200B2 (en) 2022-06-07
CN110612681A (zh) 2019-12-24
TW201902146A (zh) 2019-01-01
WO2018208672A1 (en) 2018-11-15
US10594438B2 (en) 2020-03-17
US20210306096A1 (en) 2021-09-30
EP3622646A1 (en) 2020-03-18
US20180323905A1 (en) 2018-11-08
TWI750372B (zh) 2021-12-21
JP7210079B2 (ja) 2023-01-23
JP2020521364A (ja) 2020-07-16
CN110612681B (zh) 2022-09-06

Similar Documents

Publication Publication Date Title
EP3622646B1 (en) Enhanced polarization weighting to enable scalability in polar code bit distribution
US10887879B2 (en) Scrambling sequence design for embedding receiver ID into frozen bits for blind detection
Calderbank et al. CHIRRUP: A practical algorithm for unsourced multiple access
EP3688908B1 (en) Scrambling sequence design for multi-mode block discrimination on dci blind detection
US20200274644A1 (en) Generation of polar codes with a variable block length utilizing puncturing
CN108365850B (zh) 编码方法、编码装置和通信装置
US7746827B2 (en) Methods and arrangements for selection of a wireless transmission method based upon signal to noise ratios
US11228321B2 (en) System and method for processing polar code
EP4191911A1 (en) Coding method and apparatus and decoding method and apparatus
US11115054B2 (en) Polar code encoding method and apparatus
EP3635870B1 (en) Distributed crc-assisted polar code construction
KR102656609B1 (ko) 극 부호를 이용한 신호 송수신 방법 및 그에 따른 장치
EP3734873A1 (en) Channel encoding method and encoding device
Vellambi et al. Lossy broadcasting with common transmitter-receiver reconstructions

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20191125

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
INTG Intention to grant announced

Effective date: 20200623

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602018008986

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1326913

Country of ref document: AT

Kind code of ref document: T

Effective date: 20201115

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1326913

Country of ref document: AT

Kind code of ref document: T

Effective date: 20201021

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20201021

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210222

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210121

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210122

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210221

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210121

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602018008986

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

26N No opposition filed

Effective date: 20210722

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210531

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210507

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210531

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20210531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210507

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210221

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20180507

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230525

Year of fee payment: 6

Ref country code: DE

Payment date: 20230530

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230529

Year of fee payment: 6

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201021