Processing

Please wait...

Settings

Settings

Goto Application

1. WO2018146629 - CIRCULAR BUFFER RATE MATCHING FOR POLAR CODES

Publication Number WO/2018/146629
Publication Date 16.08.2018
International Application No. PCT/IB2018/050813
International Filing Date 09.02.2018
IPC
H03M 13/13 2006.1
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
H03M 13/00 2006.1
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
CPC
H03M 13/13
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
H03M 13/2792
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
27using interleaving techniques
2792Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
H03M 13/6306
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
63Joint error correction and other techniques
6306Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
H03M 13/6356
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
63Joint error correction and other techniques
635Error control coding in combination with rate matching
6356by repetition or insertion of dummy data, i.e. rate reduction
H03M 13/6362
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
63Joint error correction and other techniques
635Error control coding in combination with rate matching
6362by puncturing
H03M 13/6368
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
63Joint error correction and other techniques
635Error control coding in combination with rate matching
6362by puncturing
6368using rate compatible puncturing or complementary puncturing
Applicants
  • TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) [SE]/[SE]
Inventors
  • HUI, Dennis
  • BLANKENSHIP, Yufei
Agents
  • STANLEY, Michael P.
  • WESTOVER, Ben
  • BURLEIGH, Roger
Priority Data
62/457,66510.02.2017US
Publication Language English (en)
Filing Language English (EN)
Designated States
Title
(EN) CIRCULAR BUFFER RATE MATCHING FOR POLAR CODES
(FR) ADAPTATION DE DÉBIT DE TAMPON CIRCULAIRE POUR CODES POLAIRES
Abstract
(EN) Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length NB to thereby generate NB coded bits. The method can further include interleaving the coded bits to thereby provide an interleaved coded bit sequence, and storing the interleaved coded bit sequence into a circular buffer of length NB. According to certain embodiments, the method can further include extracting N coded bits for transmission from the circular buffer. N can be greater than, equal to, or less than NB.
(FR) La présente invention concerne des procédés permettant d'effectuer une adaptation de débit pour des codes polaires par l'intermédiaire d'un tamponnage circulaire des bits polaires codés. Des modes de réalisation concernent des procédés de fonctionnement d'un nœud de transmission dans un système sans fil consistant à réaliser un codage polaire d'un ensemble de bits d'information conformément à une séquence polaire de longueur N B pour générer ainsi N B bits codés B. Le procédé peut en outre consister à entrelacer les bits codés pour ainsi fournir une séquence de bits codés entrelacés, et à stocker la séquence de bits codés entrelacés dans un tampon circulaire de longueur N B . Selon certains modes de réalisation, le procédé peut en outre consister à extraire N bits codés pour une transmission à partir du tampon circulaire. N peut être supérieur, égal ou inférieur à N B .
Latest bibliographic data on file with the International Bureau