CN109039344A - Coded input data is method and apparatus, coding/decoding method and its equipment of polar code - Google Patents
Coded input data is method and apparatus, coding/decoding method and its equipment of polar code Download PDFInfo
- Publication number
- CN109039344A CN109039344A CN201810582490.9A CN201810582490A CN109039344A CN 109039344 A CN109039344 A CN 109039344A CN 201810582490 A CN201810582490 A CN 201810582490A CN 109039344 A CN109039344 A CN 109039344A
- Authority
- CN
- China
- Prior art keywords
- decoding
- node
- input data
- coding
- bit
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 230000008014 freezing Effects 0.000 claims abstract description 33
- 238000007710 freezing Methods 0.000 claims abstract description 33
- 230000010287 polarization Effects 0.000 claims abstract description 18
- 125000004122 cyclic group Chemical group 0.000 claims description 51
- 238000004891 communication Methods 0.000 claims description 30
- 230000005540 biological transmission Effects 0.000 claims description 27
- 230000008707 rearrangement Effects 0.000 claims description 9
- 238000004904 shortening Methods 0.000 claims description 4
- 230000003313 weakening effect Effects 0.000 claims description 4
- 108091026890 Coding region Proteins 0.000 claims description 3
- 230000004044 response Effects 0.000 claims 6
- 238000013468 resource allocation Methods 0.000 claims 1
- 238000013507 mapping Methods 0.000 description 13
- 101001093748 Homo sapiens Phosphatidylinositol N-acetylglucosaminyltransferase subunit P Proteins 0.000 description 9
- 102100035188 Phosphatidylinositol N-acetylglucosaminyltransferase subunit P Human genes 0.000 description 9
- 230000007774 longterm Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 9
- 230000007704 transition Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000002708 enhancing effect Effects 0.000 description 6
- 230000006399 behavior Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000001965 increasing effect Effects 0.000 description 3
- 238000006116 polymerization reaction Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000003786 synthesis reaction Methods 0.000 description 2
- 102000006822 Agouti Signaling Protein Human genes 0.000 description 1
- 108010072151 Agouti Signaling Protein Proteins 0.000 description 1
- 241001269238 Data Species 0.000 description 1
- 241001582888 Lobus Species 0.000 description 1
- 238000007476 Maximum Likelihood Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000023402 cell communication Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000000873 masking effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] 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
-
- 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/27—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 using interleaving techniques
-
- 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/27—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 using interleaving techniques
- H03M13/2792—Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
-
- 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
- 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
- H03M13/2927—Decoding strategies
-
- 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/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
- Error Detection And Correction (AREA)
Abstract
The present invention can provide a kind of methods that input data is encoded to polar code, include: position not being freezed to generate based on the information bit that input data generates by the way that at least one specify information position to be added to, it is assigned to by the way that position will do not freezed with freezing position compared to the higher polarization subchannel of reliability come to not freezing position and freezing position is resequenced with all known value of encoder and decoder, and the result resequenced is encoded to generate code word by polarity.At least one described specify information position may have all known value of encoder and decoder.The present invention can provide the equipment of coded input data, coding/decoding method and its equipment.
Description
Cross reference to related applications
The application requests the South Korea patent application 10-2017- submitted in Korean Intellectual Property Office on June 8th, 2017
No. 0071888 and the South Korea patent application submitted the 10-2017-0181521st priority on December 27th, 2017, the Shen
Disclosure please is incorporated herein by reference in its entirety.
Technical field
Concept of the present invention is related to data encoding and coding/decoding method, and compiles more specifically to the data based on polar code
Code and coding/decoding method.
Background technique
In a wireless communication system, channel coding can be executed to improve the reliability of data transmission.For channel coding side
The polar code of one of case may realize Shannon capacity (Shannon capacity) with low coding/decoding complexity.Polarity
Code uses channel-polarization, wherein the position channel (or subchannel) observed in input is polarized into good bit channel and bad position letter
Road by good bit channel transmission information position, while by bad position transmission to have encoder and decoder all known
Value (for example, zero) freezes position.
Summary of the invention
Concept of the present invention provides a kind of method by using predetermined information to improve efficiency progress polarity coding and decoding
And equipment.
The one side of concept according to the present invention provides a kind of method that input data is encoded to polar code, includes: passing through
At least one specify information position is added to, position is not freezed to generate based on the information bit that input data generates, by that will not freeze
Knot position assign to with all known value of encoder and decoder freeze position compared with the higher polarization subchannel of reliability
It resequences to position is not freezed with position is freezed;And code word is generated by the polarity coding result of rearrangement, wherein at least
One specify information position may have all known value of encoder and decoder.
The another aspect of concept according to the present invention provides a kind of equipment that input data is encoded to polar code, includes: depositing
Reservoir is configured to store computer-readable instruction;And one or more processors, being configured to perform computer can
Reading instruction, so that one or more processors are configured to: by the reliability based on polarization subchannel to not freezing position and tool
Have all known value of encoder and decoder freezes position rearrangement to generate bit sequence, and the position of not freezing includes at least one
A specify information position and the information bit based on input data;And code word is generated by polarity coding sequence, wherein described
At least one specify information position has all known value of encoder and decoder.
The another aspect of concept according to the present invention provides a kind of coding/decoding method, includes: receiving and passes through polarity coding sequence
Generated code word;And the list of code word is executed by the list of the L decoding paths of generation in the case where L is positive integer
Decoding, wherein bit sequence includes comprising input bit, cyclic redundancy check (cyclic redundancy check;CRC) position and
At least one specify information position does not freeze position and freezes position with all known value of encoder and decoder, and wherein institute
It states and executes the decoding comprising doing sth. in advance termination code word based on the result for decoding at least one specify information position.
The another aspect of concept according to the present invention, provides a kind of equipment of coding/decoding method, include: memory is configured
To store computer-readable instruction;And one or more processors, it is configured to perform computer-readable instruction, so as to one
A or multiple processors are configured to perform the above-mentioned coding/decoding method.
Detailed description of the invention
Fig. 1 is the wireless communication system comprising base station and user equipment for showing the example embodiment of concept according to the present invention
Block diagram.
Fig. 2 is the downlink (downlink for showing Fig. 1 of the example embodiment of concept according to the present invention;DL structure)
Example block diagram.
Fig. 3 show the example embodiment of concept according to the present invention by down link control information (downlink
control information;DCI) from the base station of Fig. 1 (base station;BS) it is transmitted to user equipment (user
equipment;UE the example of process).
The example that Fig. 4 shows the operation of the encoder of Fig. 1 of the example embodiment of concept according to the present invention.
Fig. 5 A and Fig. 5 B show the reality of the operation of the polarity decoder of Fig. 1 of the example embodiment of concept according to the present invention
Example.
Fig. 6 is the flow chart for showing the example of operation S310 of Fig. 3 of the example embodiment of concept according to the present invention.
The example that Fig. 7 shows the operation of the operation S312 of Fig. 6 of the example embodiment of concept according to the present invention.
The example that Fig. 8 shows the binary tree of the polar code of the example embodiment of concept according to the present invention.
Fig. 9 is the assignment predetermined information (predefined for showing the example embodiment of concept according to the present invention
information;PI) the pseudo-code of the example of the method for position.
Figure 10 shows the continuous bit sequence for offsetting the level in decoding of basis of the example embodiment of concept according to the present invention
Position code tree.
Figure 11 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.
Figure 12 is the flow chart for showing the example of operation S383a of Figure 11 of the example embodiment of concept according to the present invention.
Figure 13 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.
Figure 14 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.
Figure 15 is the example block diagram for showing the wireless communication device of the example embodiment of concept according to the present invention.
Drawing reference numeral explanation
5: Transmission Time Interval;
10: base station;
100: wireless communication system;
12: crc processor;
14: subchannel mappings unit;
16: encoder;
18: de-rate matching unit;
20: user equipment;
22: polarity decoder;
30: downlink;
40: uplink;
50: wireless communication device;
51: specific integrated circuit;
53: dedicated instruction set processor;
55,59: memory;
57: primary processor;
D31: down link control information;
D32: the down link control information of estimation;
DCRC: cyclic redundancy check data;
DEC: decoding data;
DIN: input data;
DOUT: output data;
Log-likelihood ratio;
PCW, PCW': polarity coding codeword;
Estimate position;
S300~S390, S310', S380a~S386a, S380b~S387b, S383a', S383_2, S383_4, S380c
~S384c: operation;
SEQ, SEQ1, SEQ2: bit sequence;
u1~u8、x1~x8、y1~y8: position;
W、W8: channel;
W2、W4: subchannel.
Specific embodiment
Fig. 1 be show the example embodiment of concept according to the present invention comprising base station (BS or eNB) 10 and user equipment
(UE) block diagram of 20 wireless communication system 100.It is wireless that wireless communication system 100 may include (but being not limited to) the 5th generation (5G)
System, long term evolution (Long Term Evolution;LTE) system, CDMA (CDMA) system, global mobile communication
(GSM) system, WLAN (WLAN) system or any other wireless communication system.
Base station 10 can be can with user equipment 20 and/or other base station communications and exchange consolidating for data and control information
Fixed station.For example, base station 10 is referred to alternatively as node B, evolution node B (eNB), sector, site, based transceiver system
(Base Transceiver System;BTS), access point (Access Point;AP), relay node, remote radio heads
(Remote Radio Head;RRH), radio unit (radio unit;RU), smaller cell etc..In present disclosure
In, base station 10 or cell can be indicated by base station controller (the Base Station Controller in CDMA;BSC),
Some regions or function of the node B in wideband code division multiple access (WCDMA), the eNB in long term evolution or sector (site) covering,
And may include various overlay areas (such as huge cell, macrocell, Microcell, picocell, femto cell) and
Relay node, remote radio heads, radio unit or smaller cell communication ranges.
It may include for the user equipment 20 of wireless communication device and can be capable of fixing or move and can be communicated with base station 10
To transmit and receive data and/or control the various devices of information.For example, user equipment 20 can be terminal device, move
Dynamic platform (mobile station;MS), mobile terminal (mobile terminal;MT), user terminal (user terminal;UT), order
Family station (subscriber station;SS), wireless device, hand-held device etc..
Cordless communication network between base station 10 and user equipment 20 can as obtained by shared Internet resources prop up
Hold the communication of multiple users.For example, within a wireless communication network, information can be transmitted by various multi-address methods, described
Method such as CDMA (code division multiple access;CDMA), frequency division multiple access (frequency
division multiple access;FDMA), time division multiple acess (time division multiple access;TDMA),
Orthogonal frequency division multiple access (orthogonal frequency division multiple access;OFDMA), single carrier frequency division
Multiple access (Single Carrier Frequency Division Multiple Access;SC-FDMA),OFDM-FDMA,
OFDM-TDMA or OFDM-CDMA.
With reference to Fig. 1, base station 10 and user equipment 20 can pass through downlink (DL) 30 and uplink (uplink;UI)
40 communicate with one another.For example, in such as long evolving system or the wireless system of long term evolution advanced system, downlink
30 and uplink 40 can pass through control channel (such as Physical Downlink Control Channel (Physical Downlink Control
Channel;PDCCH), Physical Control Format Indicator Channel (Physical Control Format Indicator
Channel;PCFICH), physical mixed ARQ indicates channel (Physical Hybrid ARQ Indicator Channel;
PHICH), Physical Uplink Control Channel (Physical Uplink Control Channel;PUCCH) or enhancing physical down
Control channel (Enhanced Physical Downlink Control Channel;EPDCCH)) transmission control information, and
Data channel (such as Physical Downlink Shared Channel (Physical Downlink Shared Channel can be passed through;PDSCH)
Or Physical Uplink Shared Channel (Physical Uplink Shared Channel;PUSCH data)) are transmitted.
In this disclosure, pass through physical control channel (such as the shared letter of Physical Uplink Control Channel, physical uplink
Road, Physical Downlink Control Channel, enhancing Physical Downlink Control Channel or Physical Downlink Shared Channel) transmission and receive signal can table
Up to for " under transmission and reception Physical Uplink Control Channel, Physical Uplink Shared Channel, Physical Downlink Control Channel, enhancing physics
Row control channel and Physical Downlink Shared Channel ".Moreover, transmitting or receiving Physical Downlink Control Channel or by under physics
The transmission of row control channel or reception signal may include transmission or receive enhancing Physical Downlink Control Channel or pass through reinforcer
It manages down control channel transmission or receives signal.That is, Physical Downlink Control Channel can be Physical Downlink Control Channel
Or enhancing Physical Downlink Control Channel, and may include Physical Downlink Control Channel and enhancing Physical Downlink Control Channel.
The downlink 30 and uplink 40 that channel coding can be used in system 100 by wireless communication improve data and pass
Defeated reliability.For example, in wireless communication system 100, polar code (or polarity mark) can be used for channel coding, and
And base station 10 and user equipment 20 can separately include the encoder and decoder for polar code.Polar code can be based on channel
Polarization, the position channel (or subchannel) observed in input, which is polarized into good and bad position by the channel-polarization, to be believed
Road.Therefore, in the polar code, the information bit based on input data DIN can be assigned to good bit channel, and can be incited somebody to action
Position of freezing with all known value of encoder and decoder assigns to bad position channel.As described below, according to the present invention
Some example embodiments of concept, can in addition will have at least one predetermined or desirable value specify information (interchangeably by
Referred to as predetermined information (PI)) position assigns to the good bit channel of polar code.In some example embodiments, predetermined information position can be with
Comprising all known value (for example, identifier of predetermined or required fixed value and/or user equipment 20) of encoder and decoder, and
And it can be assigned to the index corresponding to the good bit channel in bit sequence SEQ, institute bit sequence SEQ is based on polar code
The input for the encoder 16 that feature determines.
The coding and decoding equipment of some example embodiments of concept and/or method can enable to lead to according to the present invention
It crosses and terminates polar code decoding operate ahead of time using specify information in the coding and decoding of polar code, and therefore may be due to
The load (for example, computing resource) of the decoding operate in wireless communication system 100 is efficiently terminated and significantly reduced ahead of time.According to this
The coding and decoding device and method of some other example embodiments of concept of the invention can obtain institute by using specify information
Need false alarm rate (false alarm rate;FAR) without the position additional cycles redundancy check (CRC), while by being grasped in decoding
Give up decoding paths ahead of time during work and improvement decoding performance is provided.
With reference to Fig. 1, base station 10 may include crc processor 12, subchannel mappings unit 14, encoder 16
With de-rate matching unit 18.User equipment 20 may include polarity decoder 22.In the following, it is described that example, wherein base station 10
The coded data during the process for transferring signals to user equipment 20 by downlink 30, and user equipment 20 is passing through
Downlink 30 from base station 10 receive signal process during decoding data.However, example embodiment is without being limited thereto.According to some
Example embodiment, user equipment 20 can transfer signals to base station 10 by uplink 40, and base station 10 can pass through
Uplink 40 receives signal from user equipment 20.For example, although not showing in Fig. 1, base station 10 may include polarity
Decoder, and user equipment 20 may include polarity encoder.The component of base station 10 and user equipment 20 is real in some examples
The hardware block that may be embodied as implementing in example by logic synthesis etc. is applied, may be embodied as handling in some example embodiments
Device and the software block implemented by processor, and may be embodied as hardware block, processor and software in some example embodiments
The combination of block.
Crc processor 12 can produce position cyclic redundancy check (CRC) of input data DIN, and generate
Cyclic redundancy check data DCRC comprising input data DIN and cyclic redundancy check position.For example, at cyclic redundancy check
Reason device 12 can generate a position (K+J) by the way that the cyclic redundancy check position of J position to be added to the input data DIN of K position
Cyclic redundancy check data DCRC (K be positive integer with J).In this disclosure, cyclic redundancy check data DCRC can quilt
The referred to as information bit of the input bit comprising input data DIN and cyclic redundancy check position.Cyclic redundancy check position can be used for really
Recognizing received data in user equipment 20 whether there is mistake, and crc processor 12 can be by wireless communication
Any mode needed for system 100 generates cyclic redundancy check position.In some example embodiments, cyclic redundancy check position can be with
Use radio network temporary identifier (Radio Network Temporary Identifier;RNTI it) shelters, it is as follows
With reference to described by Fig. 2.
Subchannel mappings unit 14 can generate bit sequence SEQ from cyclic redundancy check data DCRC, be to encoder
16 input.In some example embodiments, subchannel mappings unit 14 can be by adding at least one predetermined information position
Generated to cyclic redundancy check data DCRC and do not freeze position, and can by freeze position and do not freeze position rearrangement come
Generate bit sequence SEQ.For example, by the way that the predetermined information position of J' position to be added to the cyclic redundancy check of (K+J) a
Data DCRC, subchannel mappings unit 14 can produce not freezing position and can produce (N- (K+J+ for (K+J+J') a
J')) a is freezed position (J' be positive integer with N).Then, subchannel mappings unit 14 can be by not freezing position and to freeze
It resequences to generate N number of bit sequence SEQ in position.
Bit sequence SEQ is the input to the encoder 16 for generating polarity coding codeword PCW.The index of bit sequence SEQ can be with
Polarization subchannel corresponding to polar code.Therefore, it is (or good can to recognize good subchannel based on index for subchannel mappings unit 14
Good position channel) and bad subchannel (or bad position channel), and can be by will include to freeze position to make a reservation for at least one
The position of not freezing of information bit assigns to reliability ratio and freezes the higher polarization subchannel in position to generate bit sequence SEQ.It therefore, can be with
It will include not freeze at least one predetermined information position in position to assign to the polarization subchannel with opposite high reliability.It will be
Never freeze position below with reference to Fig. 6 to Fig. 9 description and freezes some examples that position generates bit sequence SEQ.
Encoder 16 can generate polarity coding codeword PCW by processing bit sequence SEQ.For example, encoder 16
It can be as shown in following [equation 1] from N number of bit sequenceGenerate N number of polarity coding codeword
[equation 1]
In [equation 1], GN is referred to alternatively as generating matrix and can beN rank Kronecker power
(Kronecker power).For example, Fig. 4 is shown according to G8The operation of the encoder 16 of (that is, N=8).According to [equation
1], as N increases, can polarize subchannel, and each of subchannel is referred to alternatively as polarization subchannel.From cyclic redundancy
Verification data DCRC generates the subchannel mappings unit 14 of polarity coding codeword PCW and encoder 16 may be collectively referred to as polarity coding
Device.
De-rate matching unit 18 can generate output data by carrying out rate-matched to polarity coding codeword PCW
DOUT.De-rate matching unit 18 can be by weakening and/or shortening polarity coding codeword PCW needed for wireless communication system 100
Mode execute rate-matched.It can be by sequentially passing through modulation by the output data DOUT of 18 rate-matched of de-rate matching unit
The conversion such as device, frequency mixer, power amplifier, antenna, and user equipment 20 can be transmitted to by downlink 30.
User equipment 20 can receive the signal transmitted from base station 10 by downlink 30.For example, it receives
Signal can be converted into data, and the number converted by passing through antenna, filter, low-noise amplifier, analog-digital converter etc.
Polarity decoder 22 is transmitted to according to can be used as polarity coding codeword PCW'.Polarity decoder 22 can pass through decoding polarity coding
Code word PCW' generates decoding data DEC, and therefore extracts the information (for example, input data DIN) sent by base station 10.
Polarity decoder 22 can offset (successive based on continuous in some example embodiments
cancellation;SC) decoding sequentially decodes polarity coding codeword PCW' by turn.In some example embodiments, polarity decoding
Device 22 can maintain multiple candidate decoding paths based on list-decoding and decode pole when giving up decoding paths according to maximum likelihood
Property coding codeword PCW'.It is continuous to offset list (successive cancellation list;SCL) decoding is referred to alternatively as continuous
Offset decoding and the combination of list-decoding.In some example embodiments, below with reference to described by Fig. 5 B, such as simplify continuous
Offset (simplified successive cancellation;SSC) method of coding/decoding method can be used for by by node
Predetermined (or alternatively, the required) group in solution code tree is categorized into reduce computation complexity.In some example embodiments, include
The method of cascade cycle redundancy check code and polar code can be used for improving the continuous performance for offsetting list-decoding.However, should infuse
Meaning, the above coding/decoding method is merely illustrative, and the example embodiment of concept of the present invention is not limited to solution as described above
Code method.
The example embodiment of concept according to the present invention, polarity decoder 22 can be in the mistakes of decoding polarity coding codeword PCW'
Predetermined (or alternatively, required) of the predetermined information position being inserted by the subchannel mappings unit 14 of base station 10 is apprised of during journey
Value, and the result (for example, predetermined information position of estimation) of decoding predetermined information position can be used.Predetermined information based on estimation
Position, polarity decoder 22 can terminate decoding operate ahead of time in some example embodiments, and in some example embodiments
The list that list-decoding can be used is simplified.Moreover, the predetermined information position of estimation can be by executing cyclic redundancy check function
It reduces false alarm rate (FAR).
Fig. 2 is the block diagram for showing the example of the structure of the downlink 30 of Fig. 1 of example embodiment of concept of the present invention.It lifts
For example, Fig. 2 shows the Transmission Time Interval of the downlink 30 of Fig. 1 (Transmission Time Interval;TTI).
In wireless communication system 100, the data of downlink 30 can be transmitted in Transmission Time Interval unit, and a transmission
Time interval can be defined as the time interval comprising multiple symbols (for example, OFDM symbol).For example, in long term evolution
Transmission Time Interval can be the subframe with 1ms length, and the Transmission Time Interval in 5G can be expansible transmission
Time interval.Hereinafter, Fig. 2 will be described with reference to Fig. 1.
With reference to Fig. 2, the Transmission Time Interval 5 of downlink 30 be may include through time division multiplexing (Time Division
Multiplexing;TDM) two time zones being multiplexed.For example, two time zones may include for control channel
The control area of the transmission of (for example, Physical Downlink Control Channel or physical mixed ARQ indicate channel) and for sharing channel (example
Such as, Physical Downlink Shared Channel) transmission data area.For example, control area may include for control channel
Multiple symbols, and data area may include the remaining symbol for sharing channel.
Control area may include the information about downlink 30.For example, in long term evolution, downlink control
Information (down link control information processed;DCI the physical downlink control channel transmission of control area) can be passed through.Downlink control
Information processed may include the needs of user equipment 20 so as to the information communicated with base station 10, such as jump label, resource block distribution, tune
Encoding scheme (Modulation Coding Scheme processed;) and/or redundancy versions (Redundancy Version MCS;RV).
Base station 10 can transmit multiple physical control channels in control area for multiple user equipmenies.For example, it drills for a long time
Into Physical Downlink Control Channel can be in connected control channel element (the control channel element of one or more;
CCE it is transmitted in polymerization).Control channel element is referred to alternatively as providing predetermined (or substitution according to the state of radio channel
It is ground, required) logical allocation unit of the Physical Downlink Control Channel of code rate, and can correspond to multiple resource element groups
(resource element group;REG).Cyclic redundancy check can be added to control information by base station 10.It can basis
The purposes of the owner or Physical Downlink Control Channel shelters cyclic redundancy check.For example, base station 10 can be by circulation
Redundancy check shelters the unique identifier (for example, cell RNTI) of user equipment 20 to generate under the physics for user equipment 20
Row control channel.
User equipment 20 can monitor multiple physical control channels.For example, wireless communication system 100 can define control
The finite aggregate of element in channel position processed, wherein physical control channel can be positioned for user equipment 20.Control channel element
The finite aggregate of position can be the space that wherein user equipment 20 may search for the physical control channel of its own, and can be with
Referred to as search space (search space;SS).In order to omit for position described in physical control channel auxiliary information simultaneously
The resource of multiple user equipmenies, the where that base station 10 may not will be located in control area about physical control channel be preserved for
Information provide to user equipment 20.Therefore, user equipment 20 can be by attempting to decode physics control in Transmission Time Interval 5
Channel candidate processed finds its own physical control channel.By this blind decoding, user equipment 20 can be identified and is transferred to
Physical control channel.For example, in long term evolution, user equipment 20 can be in the form of unique identifier (cell RNTI)
Masking Physical Downlink Control Channel is released, and if there is no cyclic redundancy check error, then user equipment 20 can incite somebody to action
The Physical Downlink Control Channel is identified as the Physical Downlink Control Channel of its own.In some example embodiments, Ke Nengxu
It wants user equipment 20 to execute blind decoding in a Transmission Time Interval 5 to be up to 60 times.
User equipment 20 may have the decoding load aggravated due to blind decoding, this may need to have high calculated performance
User equipment 20 or the overall performance of user equipment 20 may be reduced due to re-decoding load.For example, if wirelessly
Communication system 100 is 5G, and the maximum times for the blind decoding that user equipment 20 is attempted in a Transmission Time Interval 5 can be compared
It is further increased in long term evolution, and may need to shorten and attempt the time it takes every time.It therefore, may in blind decoding
Need to terminate the decoding operate of physical control channel ahead of time.For example, for 5G, since polar code is used as channel coding
Method, it is possible that needing to terminate the blind decoding for using polar code ahead of time.
The example that Fig. 3 shows the process of the example embodiment of concept according to the present invention, in this process by downlink
It controls information D31 and is transmitted to user equipment 20 from the base station of Fig. 1 10.For example, Fig. 3 is shown is in wireless communication system 100
Down link control information D31 is transmitted to the process of user equipment 20 in the case where long term evolution from base station 10.Such as Fig. 3 institute
Show, down link control information D31 can be transferred to user equipment by executing sequence of operations S300 to S340 by base station 10
20, and user equipment 20 can execute sequence of operations S350 to S390 to generate the down link control information of estimation
(DCI')D32.Hereinafter, Fig. 3 will be described with reference to Fig. 1.
It can execute and cyclic redundancy check is inserted into down link control information D31 in operation S300 with reference to Fig. 3
In operation.In some example embodiments, base station 10 can shelter the unique identification of user equipment 20 to cyclic redundancy check
It accords with (for example, cell RNTI).
In operation s 310, channel coding can be executed.For example, channel coding may include is compiled using polar code
Code, and as do not freezed position and predetermined information position is added to down link control information above with reference to can encode described by Fig. 1
D31's freezes position.Therefore, it can produce polarity coding codeword.The example that reference Fig. 6 to Figure 10 is described into operation S310.
In operation S320, rate-matched can be executed.For example, base station 10 can weaken and/or contract by executing
It is short to execute rate-matched.Then, in operation s 330, the operation of modulation rate matching code word can be executed.In operation S340
In, it can execute and control channel element is mapped to physical resource element (resource element;RE operation).Therefore,
The signal of information comprising down link control information D31 can be transferred to user equipment 20.
In operation S350, the operation by physical resource element demapping to control channel element can be executed.It is operating
In S360, the operation of demodulation control channel element can be executed.As described above, since user equipment 20 may not defendant
Know and be used for which control channel element polymerization to receive Physical Downlink Control Channel, so user equipment 20 can demodulate each control
The polymerization of element in channel processed.Then, in operation S370, rate-matched can be executed to the data of demodulation.Similarly, due to
Family equipment 20, which may be apprised of, is used to receive control information for which down link control information pay load size, so with
Family equipment 20 can execute rate-matched to each down link control information format.
In operation S380, channel decoding can be executed.For example, include polarity decoder in user equipment 20
22 can execute decoding to rate matched data based on list-decoding is for example continuously offset, and pass through cyclic redundancy check detection
Whether mistake is occurred.In some example embodiments, during decoding process, it can be mentioned according to the decoding result of predetermined information position
The early decoding terminated to the rate matched data, and can continue or start the decoding to other rate matched datas.It will
The example for describing operation S380 below with reference to Figure 11 to Figure 14.
In operation S390, the operation of removal cyclic redundancy check can be executed.For example, user equipment 20 can be
Its Physical Downlink Control Channel is detected in operation S380 and is estimated by removing cyclic redundancy check from decoded data
Down link control information (DCI') D32.
The example that Fig. 4 shows the operation of the encoder 16 of Fig. 1 of the example embodiment of concept according to the present invention.As joined above
Fig. 1 description is examined, encoder 16 can execute channel coding based on polar code.For example, Fig. 4 is shown is being sent by channel W
From 8 position { u in device (for example, base station 10 of Fig. 1)1,...,u8Bit sequence generate 8 position { x1,...,x8Polarity coding
Code word simultaneously receives 8 position { y in receiver (for example, user equipment 20 of Fig. 1)1,...,y8Data example.
The channel W of N number of independent channel W is combined as input by using N number of bit sequenceN:XN→YNIt can be from
WN/2It combines in a recursive manner.For example, Fig. 4 shows aggregate channel W8And subchannel W4And W2.Aggregate channel WNIt can draw
It is divided into N number of binary system coordinate channelX→YN×Xi-1, 1≤i≤N, and the transition probability in each channel can
To be defined shown in [equation 2] as follows.
[equation 2]
The transition probability of [equation 2] can express in a recursive manner shown in [equation 3] as follows.
[equation 3]
In binary erasure channel (Binary Erasure Channel;BEC it in), can simply calculate according to [etc.
Formula 3] transition probability.For example, when probability of erasure ε is 0.5, channel shown in Fig. 4In it is each
The transition probability of person can calculate shown in [equation 4] as follows.
[equation 4]
[equation 4] indicates to correspond to channelTransition probability be relatively close to 1, and correspond to
In channelTransition probability be relatively close to 0.In the case where N increases, in transition probability
Each can converge to 1 or 0, and this phenomenon can be referred to as channel-polarization.To can not it freeze with variable value
Position assign to good channels, that is, with low transition probability position channel, and by with fixed value freeze position assign to it is bad
Channel, i.e., with the position channel of high transition probability.For example, in the example in figure 4, four position { u4,u6,u7,u8Can be
Do not freeze position, and four position { u of residue1,u2,u3,u5Can be and freeze position.
As described above, position { u is not freezed4,u6,u7,u8At least one of may be used as encoder and decoder all
Known predetermined information position.That is, not freezing position { u4,u6,u7,u8It may include information bit and at least one predetermined letter
Position is ceased, and information bit may include input bit and cyclic redundancy check position.Therefore, it is possible to will have predetermined (or alternatively, institute
Needing) the predetermined information position of value assigns to and does not freeze position rather than freeze position, and therefore can obtain required feature, so as to
Improve the efficiency of wireless communication system (for example, wireless communication system 100 of Fig. 1).
Fig. 5 A and Fig. 5 B show the reality of the operation of the polarity decoder 22 of Fig. 1 of the example embodiment of concept according to the present invention
Example.For example, Fig. 5 A shows the grid of polar code, wherein N=8, and Fig. 5 B shows the binary tree structure of polar code, wherein
N=8.For example, Fig. 5 A and Fig. 5 B can be corresponding with the coder structure of Fig. 4.As shown in figs. 5 a and 5b, generally, have
There is the subchannel of low index that there may be relatively low reliability, and it is relatively high that there is the subchannel of high index may have
Reliability.
With reference to Fig. 5 A, corresponding to variable node estimation position byIndicate, wherein i and j respectively indicate grid level and
Stage (1≤i≤n+1,1≤j≤N).ForLog-likelihood ratio (log likelihood ratio;It LLR), can be with
It is calculated shown in [equation 5] as follows.
[equation 5]
Based on [equation 5], the bit sequence estimated in the decoding of search spaceIt can be expressed as hereafter [equation 6].
[equation 6]
In [equation 6],It can be expressed as hereafter [equation 7].
[equation 7]
With reference to Fig. 5 B, 2nIn the case where=N, continuous counteracting decoding can be by the On Binary Tree Representation with depth n.Citing
For, as shown in Figure 5 B, the grid of Fig. 5 A can be by being 3 and 2 with depth3The On Binary Tree Representation of=8 leaf node.Two
In fork tree, each node can be according to its tagsort.For example, as shown in Figure 5 B, the node in binary tree can divide
Class is only to have to freeze rate 0 node of the position as sub- grade node, only with 1 node of rate for not freezing position as sub- grade node
And with freezing position and do not freeze rate R node of the position as sub- grade node.Son comprising the node classified in the same manner
Tree can be replaced by the individual node of same category, and therefore can simplify binary tree.For example, in figure 5B, corresponding
In estimation positionNode and its father node can be replaced by 0 node of rate, and estimate positionAnd its
Father node can be replaced by 1 node of rate.Due to y-bend tree reduction, it can simplify continuous offset and decode.
Fig. 6 is the flow chart for showing the example of operation S310 of Fig. 3 of the example embodiment of concept according to the present invention.As above
Text is with reference to described by Fig. 3, in the operation S310' of Fig. 6, can execute channel coding based on polar code.As shown in fig. 6, operation
S310' may include operation S312 and S314, and may include from the operation S300 of Fig. 3 received (K+J) a number
It encodes according to (for example, DCRC in Fig. 1) to generate N number of code word (for example, PCW in Fig. 1) and provide N number of code word
To the operation S320 of Fig. 3.For example, the operation S310' of Fig. 6 can be by the subchannel mappings unit 14 and encoder 16 of Fig. 1
It executes.Hereinafter, Fig. 6 will be described with reference to Fig. 1.
Subchannel mappings can be executed in operation S312 with reference to Fig. 6.For example, subchannel mappings unit 14 can be with
Predetermined information position by that will have J' position of predetermined (or alternatively, required) value is added to the data of (K+J) a and base
Do not freeze position in input data DIN (or from input data DIN export) come generate (K+J+J') a, and by not freezing
Position and N- (K+J+J''s) a freezes position rearrangement to generate N number of bit sequence.As described above, in bit sequence
In, it will can not freeze position and assign to the subchannel (or position channel) with relatively high reliability, and can will freeze position and refer to
It is fitted on the subchannel with relatively low reliability.Therefore, because subchannel has relatively high reliability, it can be later
(such as termination and/or list are simplified ahead of time) utilizes predetermined information in various ways at decoding operate (for example, S380 in Fig. 3)
Position.
In operation S314, polarity coding can be executed.For example, encoder 16 can come from subchannel by processing
The N position bit sequence of map unit 14 generates N number of polarity coding codeword.
The example that Fig. 7 shows the operation of the operation S312 of Fig. 6 of the example embodiment of concept according to the present invention.As joined above
It examines described by Fig. 6, in operation S312, the operation of mapping subchannels can be executed.It for example, can be by the subchannel of Fig. 1
The example of the execution of map unit 14 Fig. 7.Fig. 7 is described below with regard to Fig. 1 and Fig. 6.
With reference to Fig. 7, can be generated by the way that the predetermined information position of J' position to be added to the predetermined information position of (K+J) a
(K+J+J') a does not freeze position.Therefore, it can freeze position by insertion N- (K+J+J') a and generate N number of the
One bit sequence SEQ1.It can be directed at the first bit sequence SEQ1 according to subchannel reliability, and as shown in Figure 7, do not freeze position
It can correspond to the subchannel than freezing the higher reliability in position.
First bit sequence SEQ1 can be re-ordered into the second bit sequence SEQ2.That is, polar code can be based on
The index of polarization subchannel resequence to the first bit sequence SEQ1.For example, as shown in Figure 7, in the second bit sequence
It is most of to freeze position and can correspond to lower index in SEQ2, and some positions of freezing can correspond to higher index, and as joined
It examines described by Fig. 4, Fig. 5 A and Fig. 5 B, it can be by good bit channel and bad position channel interleaving in the second bit sequence SEQ2.Cause
This as shown in Figure 7 can be in the second bit sequence SEQ2 to freezing position and do not freeze position rearrangement, and can be by the
Two bit sequence SEQ2 are provided to encoder (for example, encoder 16 in Fig. 1).
In some example embodiments, the cyclic redundancy check position of J position may have height in the second bit sequence SEQ2
Index, as shown in Figure 7.In some example embodiments, the index of the second bit sequence SEQ2 can be assigned so that will be included in
The predetermined information position for not freezing J' position in position assigns to the subchannel with opposite high reliability.Moreover, in some examples
In embodiment, the index of the second bit sequence SEQ2 can be assigned based on the rate-matched executed in encoded.It will join below
It examines Fig. 8 and Fig. 9 and describes the example that the index of the second bit sequence SEQ2 is assigned into predetermined information position.
In some example embodiments, the cyclic redundancy check position of J position can interweave with input bit, and therefore J
Cyclic redundancy check position can be distributed in different ways as shown in Figure 7 in the second bit sequence SEQ2.It can be in polar code
It is middle that the cyclic redundancy check position of distribution is thought of as service bit.Predetermined information position can be distributed in second sequence as shown in Figure 7
It in column SEQ2 or can describe to assign to the subchannel corresponding to high reliability as Fig. 8 will be referred to, and therefore be distributed predetermined
The same or similar function in cyclic redundancy check position that information bit can be executed and is distributed.That is, making a reservation for due to distribution
Information bit and generate the identical effect in cyclic redundancy check position with distribution.Moreover, predetermined information position can be used to reduce false alarm
Rate (FAR).For example, about 2 to 16 be can be according to the false alarm rate of the cyclic redundancy check position of 16 positions.At this moment, in list
In the case that the quantity of list in decoding is 8, false alarm rate may increase to 2 to 16+3.In the feelings that required false alarm rate is 2 to 16
Under condition, cyclic redundancy check position can be increased to 19 positions to meet this demand.However, replacing increasing cyclic redundancy check
The digit of position can be obtained in the case where adding the predetermined information position of 3 positions since what predetermined information position generated is mentioned above
Function, and at the same time false alarm rate can be maintained 2 to 16.That is, can be based on the digit of cyclic redundancy check position
False alarm rate is determined with the digit of predetermined information position.
The example that Fig. 8 shows the binary tree of the polar code of the example embodiment of concept according to the present invention.For example, Fig. 8
Binary tree may have 16 leaf nodes, among the leaf node, position is not freezed in the expression of filled black node, white filling
Position is freezed in node expression, and X filling node indicates the position shortened.Moreover, the position of not freezing of 6 positions can in the example of Fig. 8
With the predetermined information position of the input bit comprising 3 positions, the cyclic redundancy check position of 2 positions and 1 position (that is, K=3, J=2, J'
=1).In the example of Fig. 8, mother tuber size N can be 16, and block size M can be 12.
In some example embodiments, predetermined information position can be indexed, so that predetermined information position is substantially uniform
Ground, which is distributed in, not to be freezed in position.For example, predetermined information position can be distributed based on the weight for generating matrix.Moreover, one
In a little example embodiments, predetermined information position can be evenly distributed and assign to the subchannel with opposite high reliability simultaneously.
For example, the subtree as a part of the binary tree of polar code may have the leaf node corresponding to power 2, and the leaf
The most lobus dexter node of Fig. 8 among node with highest index can correspond to the subchannel with high reliability.Such as institute in Fig. 8
Show, in the subtree of the leaf node comprising index 5 to index 8, the leaf node for indexing 8 can correspond to the son with high reliability
Channel.Similarly, as shown in Figure 8, the leaf node of the highest index in subtree comprising 4 leaf nodes can correspond to have
The subchannel of high reliability.Therefore, position can not freezed as the highest index in the subtree of leaf node (for example, Fig. 8 using having
In 8,12 or 16) assign to predetermined information position.In other words, as above with reference to described by Fig. 5 B, due to 1 node of rate and speed
Rate R node includes not freezing position as leaf node, it is possible to which predetermined information position is assigned to 1 node of rate or rate R node
Leaf node among with highest reliability subchannel.
In some example embodiments, it may be considered that assign predetermined information position to rate-matched.For example, such as Fig. 8
Shown in, the rate-matched that executes in encoded shortens in the case where deleting the end of sequence, and predetermined information position may not refer to
It is fitted on and shortens region.That is, can be arranged from the candidate index 8,12 and 16 of predetermined information position in the example of Fig. 8
Except 16.
In some example embodiments, predetermined information position can be assigned with low among the candidate index in bit sequence
Index.As described above, predetermined information position can be used for terminating the decoding in the decoder of receiver ahead of time, and just for example
For continuously offsetting decoded coding/decoding method, in the case where predetermined information position is placed on front (for example, having in predetermined information position
In the case where having low index), decoded termination ahead of time can be determined in the time earlier.Therefore, in the example of Fig. 8,1 position
Predetermined information position may have among candidate index 8,12 and 16 8.Moreover, being just more than 2 positions or more than two position
For predetermined information position, predetermined information position can be sequentially with the candidate index of ascending order.
Fig. 9 is the puppet for showing the example of the method for assignment predetermined information position of the example embodiment of concept according to the present invention
Code.In Fig. 9, uiIt can indicate i-th of information bit, and eiIt can indicate i-th of predetermined information position.Moreover, I (ui) can be with
The index in bit sequence is indicated, for example, the I (u in Fig. 81) it can be 6.Hereinafter, Fig. 9 will be described with reference to Fig. 8.
In the case where L indicates the quantity of decoding list, i-th of predetermined information position eiBit sequence in index can be big
InThat is, can start to terminate ahead of time after list dissipates.For example, the case where L is 4
Under,And therefore I (e1) it can be 8.Under high code rate, since multiple input bits can
To be placed in female fast front region, it may be necessary to place predetermined information position to improve the efficiency terminated ahead of time, institute as follows
Description.
It, can be as in Fig. 9 in the case where the set of the predetermined information position of J' position is E in some example embodiments
Shown acquisition set E.It, can be with the initialization of performance variable at 11 rows and 12 rows with reference to Fig. 9.At 13 rows, it can verify defeated
Enter the position of position.In the case where the index of input bit is more than N/4, at 14 rows and 15 rows, predetermined information position eiCan with it is preceding
One predetermined information position ei-1It is spaced apart 2n-iTo assign.On the other hand, the index of input bit and be no more than N/4 in the case where,
At 17 rows and 18 rows, predetermined information position eiIt can be with previous predetermined information position ei-1It is spaced apartIt assigns, and can be with
Based on input bit uKIndex I (uK) withIncrease k.For example, it will be assumed that mother tuber is sized to N=
512, n=9 and L=8.In I (u4) more than 128 in the case where, predetermined information position can be assigned with index 256 (=28)、384
(=28+27) and 448 (=28+27+26).In some example embodiments, the index of predetermined information position can be advanced optimized,
And such as in the case where determining the parameter of polar code, the index of predetermined information position can easily be led from the parameter of polar code
Out.
Figure 10 shows the continuous bit sequence for offsetting the level in decoding of basis of the example embodiment of concept according to the present invention
Position code tree.For example, the example that Figure 10 shows the code tree of N=8.
Continuous counteracting decoding can be expressed as determining the estimation bit sequence in vertical direction according to level as shown in Figure 10
Position code tree in a path process.It can sequentially be determined and be estimated from high-level to low-level in code tree according to index
The position of bit sequence.It for example, can be according to estimation bit sequence as above with reference to described by Fig. 5 BIn index according to
Sequence determines institute's rheme, and corresponds to the position for freezing position with zeroDecoding paths can be as in Figure 10
It is shown that next position (i.e. next level) is proceeded in unbranched situation.
The node of code tree can be respectively provided with LLR ratio.It can be made according to the LLR ratio in list-decoding
Candidate decoding paths are added in each of level with multiple candidate decoding paths or give up candidate decoding paths.Give up solution
Code path and decoded operation no longer is executed by decoding paths can be referred to as list and simplify.The generation that list is simplified can be with
Shorten decoding time.As later described, the predetermined information position estimated in decoding process can be not only used for terminating decoding ahead of time,
And can be used for list-decoding, to improve decoding performance due to shortening decoding time.
Figure 11 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.Such as
Above with reference to described by Fig. 3, in the operation S380a of Figure 11, the channel decoding based on polar code can be executed.Such as institute in Figure 11
Show, operation S380a may include multiple operation S381a to S386a, and can be executed by the polarity decoder 22 of such as Fig. 1.
Hereinafter, the example code tree of reference Figure 10 is described to the operation S380a of Figure 11.
In operation S381a, the operation of selection node can be executed.For example, continuous counteracting list (SCL) is being executed
In decoded situation, the node in candidate decoding paths after the node of previously processed mistake can choose, can choose another time
The node of decoding paths is selected, and can choose the node of newly added candidate decoding paths.
In operation S382a, the operation of determining node type can be executed.As above with reference to described by Fig. 7, node can be with
Corresponding to freezing position or do not freeze position.Not freezing position may include information bit and predetermined information position, and therefore node can be right
Ying Yu freezes one of position, information bit and predetermined information position.As shown in Figure 11, it can then correspond in node and freeze
Operation S385a is executed in the case where position, and operation S384a can be then executed in the case where node corresponds to information bit, and
Operation S383a can be then executed in the case where node corresponds to predetermined information position.
In operation S383a, the operation for determining and terminating ahead of time can be executed.That is, being saved in operation S382a
In the case that vertex type corresponds to predetermined information position, it can be determined according to the decoding result of predetermined information position and be terminated ahead of time.One
In a little example embodiments, it can be determined according to the decoding result for the predetermined information position for corresponding to single position and be terminated ahead of time.Some
In example embodiment, it can be determined according to the decoding result of the predetermined information position corresponding to multiple and be terminated ahead of time.It is mentioned in determination
In the case where early terminating, operation S380a can be terminated, and in the case where not determining termination ahead of time, it can then execute operation
S384a.It will be in the example for describing operation S383a later referring to Figure 12.
List can be executed in operation S384a to simplify.It for example, may be due to corresponding in the node for freezing position
Given value (for example, zero) and omit operation S384a.It is not freeze position and do not determine the case where terminating ahead of time in node type
Under, list can be executed and simplify (S384a).It, can be based on LLR ratio in each section as above with reference to described by Figure 10
List is executed at point to simplify.
In operation S385a, the operation whether determining node corresponds to most final position can be executed.It is not corresponded to most in node
In the case where final position, in operation S381a, the operation for selecting another node can be repeated, and corresponds to most final position in node
In the case of, in operation S386a, cyclic redundancy check can be executed.Mistake can be detected according to cyclic redundancy check result
Occur.
Figure 12 is the flow chart for showing the example of operation S383a of Figure 11 of the example embodiment of concept according to the present invention.
As in the operation S383a' of Figure 11, the operation for determining and terminating ahead of time can be executed above with reference to described by Figure 11.In Figure 12
Shown, operation S383a' may include operation S383_2 and operation S383_4, and hereinafter will be described with reference to FIG. 11 Figure 12.
In operation S383_2, the operation for updating and doing sth. in advance termination condition can be executed.As shown in Figure 12, in the behaviour of Figure 11
Make in S382a, due to determining that node corresponds to predetermined information position, it is possible to according to the decoding result of predetermined information position (for example,
Estimate the value of predetermined information position) it updates and does sth. in advance termination condition.It, can be for every in decoding paths in some example embodiments
One, which updates, does sth. in advance termination condition.
In operation S383_4, the operation whether determining list meets termination condition ahead of time can be executed.That is,
Meeting in the case where doing sth. in advance termination condition comprising all decoding paths in lists, the operation S380a of Figure 11 can terminate, and
In the case where being unsatisfactory for termination condition ahead of time comprising at least one of decoding paths in lists, in the operation of Figure 11
In S384a, list can be executed and simplified.That is, being to be maintained to hold in the state of candidate decoding paths according to list-decoding
During row is decoded, it can determine in the case where all candidate decoding paths meet and do sth. in advance termination condition and terminate ahead of time.
Figure 13 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.Such as
Above with reference to described by Fig. 3, in the operation S380b of Figure 13, the channel decoding based on polar code can be executed.For example,
Compared with the operation S380a of Figure 11, it can determine whether node corresponds to first and freeze position, and then determine and terminate ahead of time.?
Node can be first carried out list and simplify corresponding in the case where freezing position.As demonstrated in Figure 13, operation S380b can wrap
Containing multiple operation S381b to S387b, and can be executed by the polarity decoder 22 of such as attached drawing.It hereinafter, will omission pair
The extra description of Figure 13 and Figure 11.
In operation S381b, the operation of selection node can be executed.Then, in operation S382b, determination can be executed
Whether node corresponds to the operation for freezing position.As shown in Figure 13, in the case where node is to freeze position, behaviour can then be executed
Make S386b, and in the case where (for example, in the case where node is not freeze position) node and non-freezing position, in operation S383b
In, list can be executed and simplified.
After executing list and simplifying, in operation S384b, the behaviour whether determining node corresponds to information bit can be executed
Make.In the case where node does not correspond to information bit, i.e., in the case where node corresponds to predetermined information position, can then execute
S385b is operated, and in the case where node corresponds to information bit, it can then execute operation S386b.
In operation S385b, the operation for determining whether to terminate ahead of time can be executed.For example, such as above with reference to Figure 12
It is described, may determine whether that all candidate decoding paths meet and do sth. in advance termination condition, i.e., whether the decoding knot of predetermined information position
Fruit is different from given value.In the case where meeting termination condition ahead of time, can be unsatisfactory for ahead of time eventually with end operation S380b
Only in the case where condition, operation S386b can be then executed.
In operation S386b, the operation whether determining node corresponds to most final position can be executed.It is not corresponded to most in node
In the case where final position, in operation S381b, the operation for selecting another node can be then executed, and is corresponded in node final
In the case where position, in operation S387b, cyclic redundancy check can be executed.
Figure 14 is the flow chart for showing the example of operation S380 of Fig. 3 of the example embodiment of concept according to the present invention.Such as
Above with reference to described by Fig. 3, in the operation S380c of Figure 14, the channel decoding based on polar code can be executed.In the reality of Figure 14
In example, predetermined information position can be used for list and simplify.As shown in figure 14, operation S380c may include multiple operation (operations
S381c to S384c).Operating S380c can also be comprising operation bidirectional needed for completing decoding operate.Hereinafter, will omit with
The description of identical Figure 14 of description of Figure 11 and Figure 13.
In operation S381c, the operation of selection node can be executed.Then, in operation S382c, determination can be executed
Whether node corresponds to the operation of predetermined information position.It as shown in Figure 14, is not predetermined information position (that is, being to freeze position in node
Or information bit) in the case where, it can execute for decoded subsequent operation, and in the case where node is predetermined information position, with
After can execute operation S383c.
In operation S383c, it can execute and determine whether estimation predetermined information position has predetermined (or alternatively, required) value
Operation.As discussed above, predetermined information position may have in the encoder make a reservation for (or alternatively, required) value (such as
Fixed value (for example, zero), or the unique value of the receiver (for example, receiver 20 of Fig. 1) comprising decoder.Decoding can be passed through
Device knows predetermined (or alternatively, required) value of the predetermined information position in advance.There is predetermined (or replace in estimation predetermined information position
It is Dai Di, required) in the case where value, it can execute for decoded subsequent operation.On the other hand, have in estimation predetermined information position
Value be different from predetermined (or alternatively, required) value in the case where, current decoding paths (operation S384c) can be given up.?
That is the list that predetermined information position can be used in decoder is simplified, and it therefore can improve decoding performance.
Figure 15 is the example block diagram of the wireless communication device 50 of the example embodiment of concept according to the present invention.Such as institute in Figure 15
Show, wireless telecom equipment 50 may include specific integrated circuit (application specific integrated
circuit;ASIC) 51, dedicated instruction set processor (application specific instruction set
processor;ASIP) 53, memory 55, primary processor 57 and memory 59.Specific integrated circuit 51, special instruction set processing
The two in device 53 and primary processor 57 or both is above to communicate with one another.At specific integrated circuit 51, special instruction set
At least the two in reason device 53, memory 55, primary processor 57 and main memory 59 can be embedded in a chip.
Dedicated instruction set processor 53 is to be customized for the integrated circuit of special-purpose and can support to answer for specific
Special instruction set and execution include the instruction in instruction set.Memory 55 can be communicated with dedicated instruction set processor 53
And it can be used as non-volatile memory device and store the multiple instruction executed by dedicated instruction set processor 53.For example,
Memory 55 may include any kind of memory that (but being not limited to) can be accessed by dedicated instruction set processor 53, such as with
Machine accesses memory (random access memory;RAM), read-only memory (Read Only Memory;ROM), tape,
Disk, CD, volatile memory, nonvolatile memory with and combinations thereof.
Primary processor 57 can control wireless communication device 50 by executing multiple instruction.For example, primary processor 57
It can control specific integrated circuit 51 and dedicated instruction set processor 53, and can handle received over a wireless communication network
The user of data or processing to wireless communication device 50 inputs.Main memory 59 can communicate with primary processor 57 and can make
The multiple instruction executed by primary processor 57 is stored for non-provisional memory device.For example, main memory 59 may include
Any kind of memory that (but being not limited to) can be accessed by primary processor 57, such as random access memory (RAM), read-only deposit
Reservoir (ROM), tape, disk, CD, volatile memory, nonvolatile memory with and combinations thereof.
The coding and/or coding/decoding method of the example embodiment of concept according to the present invention as described above can be by being included in
At least one of component in the wireless communication device 50 of Figure 15 executes.It is as described above in some example embodiments
At least one of coding and/or the operation of coding/decoding method may be embodied as the multiple instruction being stored in memory 55.One
In a little example embodiments, dedicated instruction set processor 53 can be executed by executing the multiple instruction being stored in memory 55
At least one of coding and/or the operation of coding/decoding method.In some example embodiments, the behaviour of coding and/or coding/decoding method
At least one of work, which can be implemented, to be passed through logic synthesis etc. design and is including the hardware block in specific integrated circuit 51
In.In some example embodiments, at least one of coding and/or the operation of coding/decoding method may be embodied as being stored in main memory
Multiple instruction in reservoir 59, and primary processor 57 can be held by executing the multiple instruction being stored in main memory 59
At least one of row coding and/or the operation of coding/decoding method.
As described above, example embodiment is disclosed in the accompanying drawings and the description.However, it should be understood that term only goes out
In the technical concept for describing concept of the present invention purpose and use and be not used in the present invention defined in limitation claims generally
The range of thought.It therefore, can be right it is to be appreciated that those skilled in the art that in the case where not departing from the range of concept of the present invention
Disclosed example embodiment carry out various modifications and changes.Therefore, the true scope of concept of the present invention should be by appended power
The technical concept of sharp claim determines.
Claims (23)
1. a kind of method that input data is encoded to polar code, which is characterized in that the described method includes:
Do not freezed based on the information bit that the input data generates to generate by the way that at least one specify information position to be added to
Position;
By by it is described do not freeze position assign to with all known value of encoder and decoder freeze position compared with reliability
Higher polarization subchannel come to it is described do not freeze position and it is described freeze position rearrangement;And
Code word is generated by the polarity coding result of the rearrangement,
Wherein at least one described specify information position has all known described value of the encoder and the decoder.
2. the method according to claim 1 that input data is encoded to polar code, which is characterized in that
Wherein polarity code tree includes only not freezing position with described in freeze position as 1 node of rate of sub- grade node and with described
Do not freeze rate R node of both positions as sub- grade node, and
Wherein the rearrangement includes assigning at least one described specify information position in 1 node of rate or the speed
With the polarization subchannel of highest reliability among the leaf node of rate R node.
3. the method according to claim 2 that input data is encoded to polar code, which is characterized in that the assignment includes
At least one described specify information position is assigned into candidate index associated with 1 node of rate or the rate R node
Among with minimum index at least one leaf node.
4. the method according to claim 2 that input data is encoded to polar code, which is characterized in that further include:
Rate-matched is carried out by weakening or shortening the code word,
Wherein the assignment includes assigning at least one described specify information position among the polarization subchannel not corresponding to
The polarization subchannel for weakening position or shortening position in the rate-matched.
5. the method according to claim 1 that input data is encoded to polar code, which is characterized in that
Wherein the information bit includes input bit and cyclic redundancy check position, and
Wherein the rearrangement further include by the input bit and the cyclic redundancy check position assign to it is described at least one
In some polarization subchannels that specify information position does not assign to.
6. the method according to claim 5 that input data is encoded to polar code, which is characterized in that described in the assignment
Input bit and the cyclic redundancy check position include assigning the input bit and the cyclic redundancy check position with interleaving mode.
7. the method according to claim 5 that input data is encoded to polar code, which is characterized in that further include:
The quantity of at least one specify information position is determined according to the false alarm rate of the cyclic redundancy check position and quantity.
8. the method according to claim 1 that input data is encoded to polar code, which is characterized in that further include:
By on the physical control channel of the codeword transmission to wireless communication system,
The transmission includes omitting the transmission of the information of radio resource allocation of the code word.
9. the method according to claim 1 that input data is encoded to polar code, which is characterized in that it is described at least one
Specify information position has the fixed value or unique identifier of the decoder.
10. a kind of equipment that input data is encoded to polar code, which is characterized in that the equipment includes:
Memory is configured to store computer-readable instruction;And
One or more processors are configured to perform the computer-readable instruction and make one or more of processors
It is configured to:
By the reliability based on polarization subchannel to not freezing position and freeze with all known value of encoder and decoder
Position resequences to generate bit sequence, and the position of not freezing is comprising at least one specify information position and based on the input data
Information bit;And
Institute's bit sequence is encoded by polarity to generate code word.
11. the equipment according to claim 10 that input data is encoded to polar code, which is characterized in that it is one or
Multiple processors are further configured to receive the information bit and by the way that at least one described specify information position are added to institute
Information bit is stated to generate and described not freeze position.
12. the equipment according to claim 10 that input data is encoded to polar code, which is characterized in that
Wherein polarity code tree includes only not freezing position with described in freeze position as 1 node of rate of sub- grade node and with described
Do not freeze rate R node of both positions as sub- grade node with described, and
Wherein one or more of processors are further configured assigning at least one described specify information position in institute
State the polarization subchannel among the leaf node of 1 node of rate or the rate R node with highest reliability.
13. the equipment according to claim 10 that input data is encoded to polar code, which is characterized in that it is one or
Multiple processors be further configured with:
Cyclic redundancy check position is generated from the input bit of the input data, and generating includes that the input bit and the circulation are superfluous
The information bit of remaining check bit, and
The input bit and the cyclic redundancy check position are assigned to what at least one described specify information position did not assign to
Some polarization subchannels.
14. the equipment according to claim 10 that input data is encoded to polar code, which is characterized in that it is one or
Multiple processors be further configured with:
Weaken or shorten the code word, and
At least one described specify information position is assigned to and does not correspond to weakening position among the polarization subchannel or shortens position
Polarize subchannel.
15. a kind of coding/decoding method characterized by comprising
It receives through code word caused by polarity coding sequence;And
The list-decoding of the code word is executed by generating the list of L decoding paths in the case where L is positive integer,
Wherein the bit sequence includes not freezing position comprising input bit, cyclic redundancy check position and at least one specify information position
And the position of freezing with all known value of encoder and decoder, and
Wherein the execution includes the institute for doing sth. in advance to terminate the code word based on the result for decoding at least one specify information position
State list-decoding.
16. coding/decoding method according to claim 15, which is characterized in that the execution includes:
The type of node is determined based on the level of code tree according to each of described L decoding paths;And
In response to correspond at least one specify information position the node the type according to by the node decoder
Value and one of at least one specify information position value it is whether consistent and determine and terminate ahead of time.
17. coding/decoding method according to claim 16, which is characterized in that it includes in response to passing through that the determination terminates ahead of time
Decoding for all L decoding paths at least one described specify information position acquisition value not with it is described at least one refer to
Determine one of information bit described value unanimously determine the code word the list-decoding ahead of time terminate.
18. coding/decoding method according to claim 16, which is characterized in that
Not freezing position described in wherein includes multiple specify information positions, and
It includes: in response to the multiple specified by decoding among the L decoding paths that wherein the determination terminates ahead of time
The all values decoding road not occurred consistent with the described value of one of at least one specify information position that information bit obtains
Diameter determines terminating ahead of time for the list-decoding of the code word.
19. coding/decoding method according to claim 16, which is characterized in that the execution is further included in response to the node
The type is that input bit is simplified to execute list.
20. coding/decoding method according to claim 16, which is characterized in that the execution is further included in response to the node
The type is not freeze position to simplify to execute list.
21. coding/decoding method according to claim 16, which is characterized in that the execution, which further includes, gives up decoding paths,
In the decoding paths, corresponding in the solution code value of at least one specify information position and at least one described specify information position
One of described value it is inconsistent.
22. coding/decoding method according to claim 15, which is characterized in that the execution is further included in response to reaching the solution
Code path in most final position and to decoding paths execute cyclic redundancy check.
23. a kind of equipment of coding/decoding method characterized by comprising
Memory is configured to store computer-readable instruction;And
One or more processors are configured to perform the computer-readable instruction and make one or more of processors
It is configured to perform the coding/decoding method according to claim 15.
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR20170071888 | 2017-06-08 | ||
KR10-2017-0071888 | 2017-06-08 | ||
KR1020170181521A KR102452618B1 (en) | 2017-06-08 | 2017-12-27 | Polar encoding and decoding using predefined information |
KR10-2017-0181521 | 2017-12-27 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109039344A true CN109039344A (en) | 2018-12-18 |
CN109039344B CN109039344B (en) | 2023-11-10 |
Family
ID=64332545
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810582490.9A Active CN109039344B (en) | 2017-06-08 | 2018-06-07 | Method and equipment for coding input data into polar code, decoding method and equipment thereof |
Country Status (3)
Country | Link |
---|---|
US (1) | US10833706B2 (en) |
CN (1) | CN109039344B (en) |
DE (1) | DE102018113351A1 (en) |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113676190A (en) | 2013-11-11 | 2021-11-19 | 华为技术有限公司 | Polar code encoding method and device |
CN108737021B (en) * | 2017-04-25 | 2021-12-10 | 华为技术有限公司 | Polar code transmission method and device |
US10348336B2 (en) * | 2017-06-06 | 2019-07-09 | Tsofun Algorithm Ltd. | System and method for early termination of decoding in a multi user equipment environment |
CN109391343B (en) * | 2017-08-02 | 2021-09-03 | 华为技术有限公司 | Polar code encoding method and device |
CN109889310B (en) | 2017-09-18 | 2020-06-19 | 华为技术有限公司 | Polar code encoding method and encoding device |
KR102426047B1 (en) * | 2017-11-06 | 2022-07-26 | 삼성전자주식회사 | Device and method for decoding polar code |
EP3847756A1 (en) * | 2018-09-07 | 2021-07-14 | Telefonaktiebolaget LM Ericsson (publ) | Efficient polar code construction in 5g |
CN111404558B (en) * | 2019-01-03 | 2023-06-27 | 大唐移动通信设备有限公司 | Polar code decoding method, decoder and computer storage medium |
KR102293600B1 (en) * | 2020-03-16 | 2021-08-24 | 아주대학교산학협력단 | Decoding system and method for low latency bit-flipping successive-cancellation decoding for polar codes |
TWI748739B (en) * | 2020-11-10 | 2021-12-01 | 國立清華大學 | Method and polar code decoder for determining to-be-flipped bit position |
US11689218B2 (en) | 2021-02-19 | 2023-06-27 | Electronics And Telecommunications Research Institute | Decoding method and apparatus based on polar code in communication system |
US11791844B2 (en) * | 2021-12-22 | 2023-10-17 | Huawei Technologies Co., Ltd. | Systems and methods for using special nodes for polar encoding in polar codes |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130117344A1 (en) * | 2011-11-08 | 2013-05-09 | Warren GROSS | Methods and Systems for Decoding Polar Codes |
US20150092886A1 (en) * | 2013-10-01 | 2015-04-02 | Texas Instruments Incorporated | Apparatus and method for supporting polar code designs |
KR20150106270A (en) * | 2014-03-11 | 2015-09-21 | 삼성전자주식회사 | List decoding method for polar codes and memory system adopting the same |
US20150333775A1 (en) * | 2014-05-15 | 2015-11-19 | Broadcom Corporation | Frozen-Bit Selection for a Polar Code Decoder |
US20150381208A1 (en) * | 2013-03-07 | 2015-12-31 | Huawei Technologies Co., Ltd. | Polar code decoding method and decoder |
US20170155405A1 (en) * | 2015-12-01 | 2017-06-01 | Huawei Technologies Co., Ltd. | Signature-enabled polar encoder and decoder |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8913686B2 (en) | 2010-05-07 | 2014-12-16 | Yale University | Sparse superposition encoder and decoder for communications system |
CN103220001B (en) | 2012-01-20 | 2016-09-07 | 华为技术有限公司 | The interpretation method of polar code and code translator with cyclic redundancy check (CRC) cascade |
CN103368583B (en) | 2012-04-11 | 2016-08-17 | 华为技术有限公司 | The interpretation method of polar code and code translator |
KR101919934B1 (en) * | 2012-04-19 | 2018-11-20 | 삼성전자주식회사 | Operating method of controller controlling nonvolatile memory device and mapping pattern selecting method of selecting mapping pattern mapping polar coded code word with multi bit data of nonvolatile memory device |
ES2439143B1 (en) | 2012-07-18 | 2015-02-13 | Telefónica, S.A. | METHOD AND SYSTEM THAT IMPLEMENT A TURBO-DIVERSITY SCHEME FOR WIRELESS OFDM SYSTEMS |
CN103780329B (en) | 2012-10-17 | 2018-05-04 | 华为技术有限公司 | The method, apparatus and system of a kind of coding and decoding |
CN104219019B (en) | 2013-05-31 | 2021-06-22 | 华为技术有限公司 | Encoding method and encoding apparatus |
WO2015096021A1 (en) | 2013-12-24 | 2015-07-02 | 华为技术有限公司 | Polar code decoding method and decoding apparatus |
CA2972922C (en) * | 2014-03-31 | 2019-11-05 | Huawei Technologies Co., Ltd. | Polar code hybrid automatic repeat request method and apparatus, and wireless communications apparatus |
US10193578B2 (en) | 2014-07-10 | 2019-01-29 | The Royal Institution For The Advancement Of Learning / Mcgill University | Flexible polar encoders and decoders |
EP3151458B1 (en) * | 2015-10-02 | 2019-03-20 | Mitsubishi Electric R&D Centre Europe B.V. | A method for determining features of an error correcting code system |
KR101699749B1 (en) | 2015-10-06 | 2017-01-25 | 조선대학교산학협력단 | Method for improved belief propagation decoding for short polar codes and the apparatus therefor |
TW201733322A (en) * | 2015-12-14 | 2017-09-16 | Idac控股公司 | WTRU identification using polar code frozen bits |
US10361728B2 (en) * | 2016-06-17 | 2019-07-23 | Huawei Technologies Co., Ltd. | Multiple-symbol combination based decoding for general polar codes |
US10361717B2 (en) * | 2016-06-17 | 2019-07-23 | Huawei Technologies Co., Ltd. | Apparatus and methods for error detection coding |
WO2018124779A1 (en) * | 2017-01-02 | 2018-07-05 | 엘지전자 주식회사 | Method and apparatus for performing harq on basis of polar code |
US10560221B2 (en) * | 2017-01-05 | 2020-02-11 | Huawei Technologies Co., Ltd. | Apparatus and methods for training-based channel code design |
WO2018152694A1 (en) * | 2017-02-22 | 2018-08-30 | Qualcomm Incorporated | Mutual-information based recursive polar code construction |
JP2020511027A (en) * | 2017-02-03 | 2020-04-09 | アイディーエーシー ホールディングス インコーポレイテッド | Advanced Polar Code for Control Channel |
WO2018174672A2 (en) * | 2017-03-24 | 2018-09-27 | 엘지전자 주식회사 | Downlink signal reception method and user equipment, and downlink signal transmission method and base station |
-
2018
- 2018-06-05 DE DE102018113351.0A patent/DE102018113351A1/en active Pending
- 2018-06-06 US US16/001,275 patent/US10833706B2/en active Active
- 2018-06-07 CN CN201810582490.9A patent/CN109039344B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130117344A1 (en) * | 2011-11-08 | 2013-05-09 | Warren GROSS | Methods and Systems for Decoding Polar Codes |
US20150381208A1 (en) * | 2013-03-07 | 2015-12-31 | Huawei Technologies Co., Ltd. | Polar code decoding method and decoder |
US20150092886A1 (en) * | 2013-10-01 | 2015-04-02 | Texas Instruments Incorporated | Apparatus and method for supporting polar code designs |
KR20150106270A (en) * | 2014-03-11 | 2015-09-21 | 삼성전자주식회사 | List decoding method for polar codes and memory system adopting the same |
US20150333775A1 (en) * | 2014-05-15 | 2015-11-19 | Broadcom Corporation | Frozen-Bit Selection for a Polar Code Decoder |
US20170155405A1 (en) * | 2015-12-01 | 2017-06-01 | Huawei Technologies Co., Ltd. | Signature-enabled polar encoder and decoder |
Non-Patent Citations (2)
Title |
---|
YIJIN LI: "A Low-Complexity SNR Estimation Algorithm Based on Frozen Bits of Polar Codes" * |
姚树香: "极化码的一种改进的SC译码算法实现" * |
Also Published As
Publication number | Publication date |
---|---|
DE102018113351A1 (en) | 2018-12-13 |
US20180358985A1 (en) | 2018-12-13 |
CN109039344B (en) | 2023-11-10 |
US10833706B2 (en) | 2020-11-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109039344A (en) | Coded input data is method and apparatus, coding/decoding method and its equipment of polar code | |
CN109804566B (en) | Method and apparatus for encoding data using polarization codes | |
TWI648956B (en) | Polarization code rate matching method and channel encoder | |
US10979081B2 (en) | Polar code interleaving and bit selection | |
CN105164956B (en) | Speed matching method and equipment, the wireless communication device of Polar code | |
CN112583558A (en) | Resource allocation method, terminal equipment and network equipment | |
CN107124188A (en) | Coding method, interpretation method, encoding device and the decoding equipment of polarization code | |
JP6803969B2 (en) | Methods and devices for transporting identification information | |
CN109586843A (en) | The design scheme of redundancy versions in communication system | |
KR102394139B1 (en) | Method for generating a sequence for a polar code and medium therefor and method and apparatus for transmitting data using thereof | |
CN108809482B (en) | Rate matching method and device for Polar codes | |
CN109565871A (en) | Code word for nonopiate coding access is adaptive | |
WO2019095336A1 (en) | System and method for processing control information | |
CN108809486B (en) | Polar code coding and decoding method and device | |
JPWO2016067684A1 (en) | apparatus | |
CN111082812A (en) | Apparatus for decoding input data using path metric and decoding method using the same | |
KR20170108007A (en) | Method and apparatus for transmitting instruction information | |
CN110890938B (en) | Data transmission method and related equipment of channel coding scheme using Polar code | |
KR102517960B1 (en) | Method and apparatus for data transmission in wirelss cellular communication system | |
CN110519018B (en) | Method and equipment used for UE (user equipment) and base station for channel coding | |
KR102452618B1 (en) | Polar encoding and decoding using predefined information | |
CN110875815B (en) | Resource mapping method and device | |
CN104821862B (en) | A kind of method and system for improving coding efficiency in OFDM environment | |
CN109039546B (en) | Method and equipment in UE (user equipment) and base station for channel coding | |
CN108024371A (en) | A kind of method and apparatus in UE for dynamic dispatching, base station |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |