WO2018220857A1 - Dispositif de communication, procédé de codage et procédé de décodage - Google Patents

Dispositif de communication, procédé de codage et procédé de décodage Download PDF

Info

Publication number
WO2018220857A1
WO2018220857A1 PCT/JP2017/020725 JP2017020725W WO2018220857A1 WO 2018220857 A1 WO2018220857 A1 WO 2018220857A1 JP 2017020725 W JP2017020725 W JP 2017020725W WO 2018220857 A1 WO2018220857 A1 WO 2018220857A1
Authority
WO
WIPO (PCT)
Prior art keywords
parity check
information
bit
decoding
encoding
Prior art date
Application number
PCT/JP2017/020725
Other languages
English (en)
Japanese (ja)
Inventor
洋介 佐野
聡 永田
ジュンシン ワン
スウネイ ナ
ホイリン ジャン
Original Assignee
株式会社Ｎｔｔドコモ
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社Ｎｔｔドコモ filed Critical 株式会社Ｎｔｔドコモ
Priority to PCT/JP2017/020725 priority Critical patent/WO2018220857A1/fr
Publication of WO2018220857A1 publication Critical patent/WO2018220857A1/fr

Links

Images

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/11—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 using multiple parity bits
    • 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

Definitions

  • the present invention relates to a communication apparatus used as a user apparatus or a base station in a wireless communication system.
  • a wireless communication system called 5G is being studied to achieve further increases in system capacity, higher data transmission speed, lower delay in the wireless section, etc. Is progressing.
  • 5G various wireless technologies are being studied in order to satisfy the requirement to achieve a delay of 1 ms or less while achieving a throughput of 10 Gbps or more. Since there is a high possibility that a wireless technology different from LTE will be adopted in 5G, in 3GPP, a wireless network supporting 5G is referred to as a new wireless network (NR: New Radio). Distinguish.
  • NR New Radio
  • eMBB extended Mobile Broadband
  • mMTC massive Machine Type Communication
  • URLLC Ultra Reliability and Low Latency Communication
  • eMBB requires higher speed and larger capacity
  • mMTC requires a large number of terminals and low power consumption
  • URLLC requires high reliability and low delay.
  • Non-Patent Document 1 There is a Polar code as a candidate that can realize the above requirement (Non-Patent Document 1).
  • the Polar code is an error correction code capable of realizing a characteristic asymptotic to the Shannon limit based on the concept of channel polarization.
  • SCD successive removal decoding method
  • SCLD sequential removal list decoding method
  • CRC Cyclic Redundancy Check
  • a Polar code is applied to a downlink control channel (Downlink Control Channel).
  • the base station may use CRC (hereinafter referred to as “CRC” as a check value in the downlink control information) in the same way as the transmission / reception method of the downlink control channel in the existing LTE. ) Is encoded, and the information is assumed to be transmitted to the user apparatus. The user apparatus that has received the information determines whether the received information is correct information addressed to the user apparatus by performing determination using CRC in the decoding process of the information.
  • CRC hereinafter referred to as “CRC” as a check value in the downlink control information
  • the Polar code is assumed to be used not only for downlink communication from the base station to the user apparatus, but also for uplink communication from the user apparatus to the base station and for side link communication between the user apparatuses. . That is, the above problems may occur not only in downlink communication from the base station to the user apparatus, but also in uplink communication from the user apparatus to the base station and side link communication between the user apparatuses. Moreover, the above problems are problems that may occur even with codes other than the Polar code.
  • User devices and devices such as base stations are collectively referred to as communication devices.
  • the present invention has been made in view of the above points, and is relatively simple in a wireless communication system in which encoded information is transmitted from a transmission side and information is detected by decoding the encoded information on the reception side. It is an object of the present invention to provide a technique capable of obtaining a good false detection rate through simple processing.
  • a communication device used in a wireless communication system
  • An encoding unit for generating encoded information by adding a parity check bit to each of a plurality of partial blocks in the information block and encoding the information block to which the parity check bit is added
  • a transmission unit that creates a transmission signal from the encoding information generated by the encoding unit and transmits the transmission signal
  • the communication apparatus is characterized in that the parity check bit is used for parity check for each of a plurality of candidate sequences obtained by the decoding process of the encoded information on the reception side of the transmission signal.
  • FIG. It is a block diagram of the radio
  • FIG. It is a block diagram of the radio
  • FIG. It is a figure for demonstrating the example of encoding of a Polar code
  • FIG. 10 is a diagram illustrating the positions of parity check bits in Example 2-5.
  • FIG. 10 is a diagram illustrating the positions of parity check bits in Example 2-7.
  • FIG. 3 is a diagram illustrating an example of a functional configuration of a user device 10.
  • FIG. 2 is a diagram illustrating an example of a functional configuration of a base station 20.
  • FIG. 2 It is a figure which shows an example of the hardware constitutions of the user apparatus 10 and the base station 20.
  • existing technology can be used as appropriate.
  • the existing technology is, for example, existing LTE, but is not limited to existing LTE.
  • PDCCH PUCCH
  • DCI used in existing LTE are used for convenience of description, and channels similar to these are used. Signals, functions, etc. may be called by other names.
  • a Polar code is used, but this is only an example.
  • the present invention can be applied to codes other than the Polar code as long as the code performs list decoding in which a plurality of candidate sequences are calculated and decoded on the receiving side.
  • the present invention can be applied to each of an LDPC (LOW DENCITY PARITY CHECK) code and a convolutional code.
  • the Polar code used in the present embodiment may be called by another name.
  • the target of encoding / decoding is control information, but the present invention can also be applied to information other than control information.
  • downlink communication is shown as a main example, but the present invention can be similarly applied to uplink communication and side link communication.
  • FIG. 1A and 1B are configuration diagrams of a radio communication system according to the present embodiment.
  • the radio communication system according to the present embodiment illustrated in FIG. 1A includes a user apparatus 10 and a base station 20.
  • FIG. 1A one user apparatus 10 and one base station 20 are shown, but this is an example, and there may be a plurality of each.
  • the user device 10 is a communication device having a wireless communication function such as a smartphone, a mobile phone, a tablet, a wearable terminal, a communication module for M2M (Machine-to-Machine), and a communication module for IoT, and is wirelessly connected to the base station 20
  • a wireless communication function such as a smartphone, a mobile phone, a tablet, a wearable terminal, a communication module for M2M (Machine-to-Machine), and a communication module for IoT
  • M2M Machine-to-Machine
  • IoT communication module for IoT
  • the base station 20 is a communication device that provides one or more cells and wirelessly communicates with the user device 10.
  • the duplex method may be a TDD (Time Division Duplex) method or an FDD (Frequency Division Duplex) method.
  • the base station 20 encodes information obtained by adding CRC to downlink control information (DCI: Downlink Control Information) using a Polar code, and performs downlink control on the encoded information. It transmits using a channel (example: PDCCH (Physical Downlink Control Channel)).
  • DCI Downlink Control Information
  • PDCCH Physical Downlink Control Channel
  • the user apparatus 10 decodes information encoded by the Polar code by a sequential removal decoding method (SCD: Successive Canceling Decoding) or the like.
  • SCD Successive Canceling Decoding
  • a Polar code may be applied to the uplink control information.
  • the user apparatus 10 encodes information obtained by adding CRC to uplink control information (UCI: Uplink Control Information) using a Polar code, and encodes the encoded information to an uplink control channel (example: It transmits using PUCCH (Physical Uplink Control Channel).
  • the base station 20 decodes information encoded by the Polar code by, for example, a sequential removal decoding method (SCD: Successive Canceling Decoding) or the like.
  • FIG. 1B shows a case where side link communication is performed between user apparatuses as another example of the wireless communication system according to the present embodiment.
  • the user apparatus 10 encodes information obtained by adding CRC to control information (SCI: Sidelink Control Information) using the Polar code, and encodes the encoded information. It transmits using a control channel (example: PSCCH (Physical Sidelink Control Channel)).
  • the user apparatus 15 decodes the information encoded by the Polar code by, for example, a sequential removal decoding method (SCD: Successive Canceling Decoding) or the like. The same applies to communication from the user device 15 to the user device 10.
  • SCI Sidelink Control Information
  • PSCCH Physical Sidelink Control Channel
  • FIG. 2 shows a Polar code encoder in the case of three repetitions. As shown in FIG. 2, the encoder has a configuration in which communication paths are coupled by exclusive OR.
  • the encoded bits output from the encoder are N bits (x 0 ,..., X N ⁇ 1 ).
  • Polar encoding can be expressed by the following equation, and the following matrix G corresponds to the encoder portion of FIG.
  • the frozen bit may be any bit as long as it is a known bit on the transmission side and the reception side, but 0 is often used.
  • the likelihood (specifically, for example, log-likelihood ratio (LLR)) obtained by demodulation for each bit is input to the decoder on the receiving side, and the likelihood is calculated.
  • LLR log-likelihood ratio
  • the likelihood of each transmission bit is calculated, and the bit value is determined based on the likelihood.
  • the decoding result is the value of the frozen bit.
  • U 0 and u 1 are decoded by the steps shown in FIGS.
  • f is a calculation that does not directly use known information (bit values for which decoding results have already been obtained, frozen bit values)
  • g is a calculation that uses known information.
  • u 0 to decode the u i, ..., u i- 1 is required to be known. Therefore, u 0 , u 1 , u 2. It is necessary to decrypt in this order.
  • CA-Polar CRC aided
  • PC Paraity check
  • DSimpleP-Polar Distributed simple parity check Polar
  • DS SimpleP-Polar is a method according to the present invention, but it is possible to combine any one or more of CA-Polar, Distributed CRC Polar, and PC-Polar with DSimpleP-Polar. -Outlines of Polar, Distributed CRC Polar and PC-Polar are also explained.
  • target information information to be encoded such as downlink control information
  • info abbreviation of information
  • information to be encoded may be referred to as an “information block”.
  • CA-Polar An encoding process in CA-Polar will be described with reference to FIGS. 5A and 5B.
  • the base station 20 adds CRC to the target information as shown in FIG. 5B (step S1 in FIG. 5A).
  • the bit length of the target information is K
  • the CRC bit length is J + J ′.
  • J is the CRC bit length in the existing LTE
  • J ′ is the bit length added to improve FAR.
  • J ′ is a value approximately equal to log 2 L.
  • the base station 20 performs Polar encoding on the information obtained in Step S1 (Step S2), calculates N-bit encoded information, and performs rate matching on the encoded information by puncturing or the like. (Step S3).
  • a transmission signal is created from the M-bit encoded information that has undergone the rate matching, and the transmission signal is transmitted wirelessly.
  • SCD sequential removal decoding
  • SCLD CRC-aided SCLD
  • the cumulative likelihood value is, for example, the sum of the likelihood sizes of the bits. In the example of FIG. 6, “0100”, “0110”, “0111”, and “1111” are obtained as four series.
  • CA-Polar CRC determination is performed on the surviving L sequences, and from the most probable L sequences, a sequence for which the CRC determination is OK is selected as a final decoding result.
  • FIG. 7 is a diagram for explaining CA-Polar decryption processing in the user apparatus 10.
  • the user apparatus 10 performs a sequential decoding process for each bit on the encoded information received from the base station 20 via the PDCCH (step S11), so that L sequences with high likelihood (List 1 to (List L) is acquired (step S12).
  • the user apparatus 10 performs a CRC check for each sequence, and selects a sequence that has been successfully CRC checked as a final decoding result. Then, for example, the subsequent processing (for example, reception of a data channel) is executed according to the downlink control information included in the sequence.
  • the base station 20 applies Permutation 1 which is a predetermined rearrangement rule to the target information of K bits (step S21), and adds a J + J′-bit CRC (step S22).
  • the base station 20 applies Permutation 2 to the information obtained in step S22 to rearrange the bits (step S23), and distributes the CRC bits in the target information.
  • the base station 20 performs Polar encoding on the information obtained in Step S23 (Step S24), calculates N-bit encoded information, and performs rate matching on the encoded information by puncturing or the like. (Step S25).
  • a transmission signal is created from the M-bit encoded information that has undergone the rate matching, and the transmission signal is transmitted wirelessly.
  • PC Polar The encoding process in PC Polar will be described with reference to FIG.
  • the base station 20 adds a J-bit CRC to the K-bit target information (step S31).
  • the base station 20 generates a PC-Frozen set for the information obtained in step S31, sets up a PC-Functions, and generates a PC-Frozen bits (J 'bit) based on the PC-Frozen set and PC-Functions.
  • Polar encoding is performed on the information in which the PC-Frozen bits are set (step S32).
  • the base station 20 performs rate matching on the N-bit encoded information by puncturing or the like (step S33).
  • a transmission signal is created from the M-bit encoded information that has undergone the rate matching, and the transmission signal is transmitted wirelessly.
  • PC-Polar In decoding of PC-Polar, as in the case of CA-Polar, L sequences are left as surviving paths each time a bit is decoded. At this time, a parity check is used to select a surviving path. PC-Polar cannot be used for early termination.
  • FIG. 10 shows an example of the PC-Polar decoding process in the user apparatus 10.
  • the user apparatus 10 sequentially selects a surviving path by performing a parity check while performing a bit-by-bit sequential decoding process (step S41), and finally acquires L sequences that survive (step S42). ).
  • the user apparatus 10 selects a sequence having the highest likelihood (reliability) among the L sequences (step S43), performs a CRC check (step S44), and if the CRC check is successful, Is selected as the final decoding result. Then, for example, the subsequent processing (for example, reception of a data channel) is executed according to the downlink control information included in the sequence.
  • DSimpleP-Polar a simple parity check code is applied as an error check code.
  • a single parity check bit is used as a simple parity check code.
  • an error check code other than a single parity check bit may be applied.
  • FIG. 11 shows an example in which parity check bits are inserted into an information block having a size of 30 bits.
  • an exclusive OR symbol (a symbol in which + is included in the circle) shown in the drawing is described as “XOR” in the specification.
  • the exclusive OR may be expressed as “+”.
  • parity check bits p 1 for the information bits u 1 ⁇ u 10 parity check bits p 2 for the information bits u 11 ⁇ u 20, and, parity check bits p 3 for the information bits u 21 ⁇ u 30 Each is calculated by the following formula.
  • the information bits u 1 to u 30 may be composed only of information bits to be transmitted, or may be composed of information bits to be transmitted and CRC (J bit or J + J ′ bit).
  • p 1 is inserted after u 10
  • p 2 is inserted after u 20
  • p 3 is inserted after u 30 .
  • early termination can be determined by performing a parity check on a surviving path in the middle of decoding before all bits are decoded.
  • K parity check bits may be inserted as parity check bits.
  • the parity calculation formula is as follows. In this case, p 1 is inserted after u 6 , p 2 is inserted after u 12 , p 3 is inserted after u 18 , p 4 is inserted after u 24 , and p 5 is after u 30 . Inserted.
  • the number of information bits included in each parity check bit may not be the same.
  • the number of information bits included in the final parity check bit is changed, but the number of information bits of the head parity check bit may be changed.
  • the parity check bit may be XOR of all information bits up to a certain information bit as in the following equation.
  • p 1 u 1 XOR u 2 XOR ... XOR u 10
  • p 2 u 1 XOR u 2 XOR .... .
  • XOR u 30 Again, p 1 is inserted after u 10 , p 2 is inserted after u 20 , and p 3 is inserted after u 30 .
  • the encoding process in DSimpleP-Polar will be described with reference to FIGS. 12A and 12B.
  • the process illustrated in FIG. 12A is an example of a process executed in an encoding unit 111 and an encoding unit 211 described later.
  • the base station 20 adds a CRC to the target information (step S51 in FIG. 12A).
  • the number of CRC bits is 16 or 8 as in LTE, for example. However, the number of CRC bits may be a number other than 16 or 8. In DSimpleP-Polar, it is not essential to add a CRC. It is good also as not adding CRC.
  • the bit length of the target information is K
  • the CRC bit length is J
  • J is, for example, the CRC bit length in the existing LTE.
  • the base station 20 adds a J′-bit parity check bit to the information obtained in step S51, for example, as shown in FIG. 12B.
  • the base station 20 adds a parity check bit to the target information before adding a CRC to the target information, and performs CRC on the target information to which the parity check bit is added (that is, “parity check bit + target information”). May be calculated and added.
  • target information + CRC may be regarded as the information block shown in FIG. 11 and the parity check bit may be added to the information block.
  • the frozen bit may be added before the parity check bit is added, or may be added after the parity check bit is added.
  • Information regarding the position of the parity check bit in the information block is known by the user apparatus 10 and the base station 20.
  • the information regarding the position of the parity check bit may be defined in the specification.
  • the base station 20 may notify the user apparatus 10 of information regarding the position of the parity check bit by broadcast information or upper layer signaling specific to the user apparatus.
  • the base station 20 performs Polar encoding on the information obtained in Step S52 (Step S53), calculates N-bit encoded information, and performs rate matching on the encoded information by puncturing or the like. (Step S54).
  • a transmission signal is created from the M-bit encoded information that has undergone the rate matching, and the transmission signal is transmitted wirelessly.
  • the number of additional bits (number of parity check bits) and its position can be determined in advance. That is, in an encoding apparatus, it is not necessary to calculate the number of additional bits and their position each time encoding is performed, and fixed values (eg, values determined by specifications) can be used as these values. .
  • the parity check bit can be calculated by simple calculation. Therefore, by using DSimpleP-Polar, the processing load can be reduced as compared with Distributed CRC Polar, PC-Polar, and the like.
  • the base station 20 divides the information block (not including the CRC) of the target information into three parts (step S101). As an example, if N is divisible by 3, assuming that the information block is N bits long, the information block can be divided into three parts of the same length as follows.
  • N is not divisible by 3, for example, the remainder (1 or 2) of bits obtained by dividing N by 3 is arranged in the last part or the last two parts.
  • the information block can be divided as follows.
  • the information block can be divided as follows.
  • the base station 20 calculates a single parity check bit for each part according to the following equation.
  • the decoding process is performed by a method based on SCLD. That is, when decoding each bit, the L sequence with a high likelihood is left as a surviving path, and decoding is performed sequentially.
  • FIG. 14 is a diagram for explaining the DSimpleP-Polar decoding process in the user apparatus 10. Note that the processing illustrated in FIG. 14 is an example of processing executed by the decoding unit 112 and the decoding unit 212 described later.
  • the user apparatus 10 obtains L sequences (List 1 to List L) with high likelihood by performing sequential bit-by-bit decoding processing on encoded information received from the base station 20 via the PDCCH, for example. (Step S61).
  • the decoding target is the information block to which the parity check bit shown in FIG. 11 is added.
  • decoding of bits from u 1 to p 1 is completed at the time of step S61 in FIG. 14, and L sequences having a bit length of u 1 to p 1 are obtained.
  • the base station 20 performs a parity check of u 1 to p 1 for each path sequence (step S62). Specifically, for example, it is determined whether or not the following parity check equation holds.
  • the base station 20 continues the path growth (sequential decoding for each bit), and when the decoding up to the next parity check bit is completed, the base station 20 again Perform a parity check.
  • step S63 of FIG. 14 decoding of bits from u 1 to p 2 is completed, and L sequences having a bit length of u 1 to p 2 are obtained.
  • the user apparatus 10 performs a parity check of u 1 to p 2 on each path sequence (step S64). Specifically, for example, it is determined whether or not the following parity check equation holds.
  • the user apparatus 10 repeats the above process, and when early termination does not occur, obtains L sequences decoded up to the last bit (step S65). Then, the user apparatus 10 performs a CRC check and a parity check of all bits (u 1 to p 3 in the example of FIG. 11) for each of the L sequences (step S66). The user apparatus 10 selects a sequence that has succeeded in the CRC check and the parity check as a final decoding result. Then, for example, the subsequent processing (for example, reception of a data channel) is executed according to the downlink control information included in the sequence. In addition, when CRC is not added in encoding, only a parity check is performed.
  • the parity check for determining the early termination may not be performed, and only the final parity check for the L sequences decoded up to the last bit may be performed.
  • FIG. 15 is a diagram for explaining a decoding process including a selection process (example) of L survival paths.
  • step S71 for example, it is assumed that the user apparatus 10 has completed decoding up to i bits out of N bits and has obtained L i-bit length sequences without occurrence of early termination.
  • step S72 the user apparatus 10 performs a decoding process on the (i + 1) th bit to obtain the likelihood of the bit.
  • the user apparatus 10 creates a sequence in which the (i + 1) -th bit is 0 and a sequence in which the (i + 1) -bit is 1 from each i-bit length sequence, and obtains 2L sequences in total.
  • L sequences with high likelihood (reliability) are selected from 2L sequences (steps S73 and S74).
  • the selection may be performed by parity check in the PC-Polar.
  • step S75 the user apparatus 10 performs the parity check described in FIG. 14 (step S75). After that, if early termination does not occur, L sequences decoded up to the last bit are obtained (step S76).
  • parity check bit calculation method and position variation in DSimpleP-Polar ⁇ Overview of variations> So far, several types of parity check bit calculation methods and examples of positions where they are inserted have been described, but the present invention is not limited to these. Below, the further example about the calculation method and position of a parity check bit is demonstrated. In the description here, exclusive OR is represented by “+”.
  • parity check bit described so far and the parity check bit described below can be calculated by, for example, the following equations.
  • the matrix G DSPC in the above equation is a binary matrix (a matrix whose elements are 0 or 1) corresponding to the parity check bits to be calculated.
  • the matrix G DSPC is not limited to a specific type of matrix, for example, an upper triangular matrix can be used as the matrix G DSPC .
  • the upper triangular matrix as a matrix G DSPC, sequentially b 1 a (total 0 below which) the last position of the first column, b 2, ..., When b J ', b 1 ⁇ b 2 ⁇ ... ⁇ b J ′ .
  • the position of the parity check bit is inserted immediately after the last information bit among the information bits used for calculating the parity check bit, for example, as shown in FIG. Further, the present invention is not limited to this, and as will be described later, the position of the parity check bit may be basically any position in the information block. The position of the parity check bit may be immediately before or after the information block.
  • the parity check bit calculation method (encoding method) and position may be fixed regardless of the information block size, or may be changed depending on the information block size.
  • Examples 1-1 to 1-46 will be described as variations of the parity check bit calculation method
  • Examples 2-1 to 2-11 will be described as variations of the parity check bit position. These examples may be combined as appropriate.
  • Example 1-1 ⁇ Parity Check Bit Calculation Method: Example 1-1>
  • a parity check bit is calculated by exclusive OR of information bits every m bits.
  • p 1 is the first information bit
  • j 1 m + 1 is calculated from the 1st information bit. The same applies to the other parity check bits.
  • each parity check bit is as follows.
  • Example 1-2 ⁇ Parity check bit calculation method: Example 1-2>
  • the parity check bit is calculated by exclusive OR of information bits starting from information bits at arbitrary positions in the information block. An example is shown below.
  • p 1 is calculated from information bits from g 1st information bit to j 1st information bit
  • p 2 is information from g 2nd information bit to j 2nd information bit. Calculated by bits.
  • Example 1-3 is a combination of Example 1-1 and Example 1-2 as described below. That is, parity check bits are calculated from information bits at arbitrary positions in the information block using information bits every m bits.
  • Example 1-4> Use a reliable position.
  • An example of calculation is as follows.
  • p 1 is calculated by the information bits from the first information bit to the first information bit S
  • p 2 is calculated by the information bits from the first information bit to S 2 th information bits
  • P J ′ is calculated from information bits from the first information bit to the S J′th information bit.
  • S 1 , S 2 ,..., S J ′ indicate positions where the reliability is highest.
  • the position is selected by simulation, for example.
  • the position may be selected by a density evolution or a specific sequence.
  • Example 1-5 ⁇ Parity check bit calculation method: Example 1-5>
  • the parity check bit is calculated using the first half of the information block. It should be noted that the part after the first half of the information block can be checked using a CRC, for example.
  • K ′ is defined as follows.
  • the first formula corresponds to the case where K is divisible by two.
  • the second expression corresponds to a case where a value obtained by rounding down the decimal point of K / 2 is used as K ′ when K is not divisible by 2.
  • Example 1-6 ⁇ Parity check bit calculation method: Example 1-6>
  • the parity check bit is calculated by exclusive OR of information bits at fixed positions in the information block. Examples where K is 12, 13, 14, 15, 30 are shown below.
  • Example 1-7 ⁇ Parity check bit calculation method: Example 1-7>
  • the parity check bit is calculated by exclusive OR of specific information bits in the information block, as shown by the following equation.
  • Example 1-9 to 1-46 will be further described below.
  • [a / b] indicates that the fraction of a / b (number after the decimal point) is rounded to an integer.
  • the rounding method is not limited to a specific method, and any method may be used.
  • [a / b] is
  • round (a / b) is indicated.
  • round means rounding off.
  • Example 1-9 to Example 1-46 [a / b] may be replaced with any of the above three notations.
  • this example when [a / b] is used, this example includes at least three different examples corresponding to the above three types of notation of [a / b]. Show.
  • floor (), ceil (), or round () can be used as the entire rounding method. For example,
  • b is classified as follows depending on whether 3K / 4 is odd or even.
  • Example 1-11> Example 1-11 is shown below.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • Example 1-15 ⁇ Parity Check Bit Calculation Method: Example 1-15> Example 1-15 is shown below.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value. The same applies to [K / 8].
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • [K ′ / 4] in the above formula may be floor (K ′ / 4), ceil (K ′ / 4), round (K ′ / 4), or other rounding.
  • a value using a method may be used. The same applies to [K / 2].
  • [K ′ / 4] in the above formula may be floor (K ′ / 4), ceil (K ′ / 4), round (K ′ / 4), or other rounding.
  • a value using a method may be used. The same applies to [3K / 4].
  • [K / 4] in the above equation may be floor (K / 4), ceil (K / 4), round (K / 4), or another rounding method. It may be a value.
  • Example 1-21> Example 1-21 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-23 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-26 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-27 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-28> Example 1-28 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-29 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-31 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-32 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-33 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-34 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-35 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-36 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-37 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value.
  • Example 1-38 is shown below.
  • [K / 8] in the above formula may be floor (K / 8), ceil (K / 8), round (K / 8), or another rounding method. It may be a value. Further, a and b may be arbitrary values.
  • Example 1-39 is shown below.
  • Each of a, b, and c in the above formula may be an arbitrary value.
  • [K / a] in the above formula may be floor (K / a), ceil (K / a), round (K / a), or another rounding method. It may be a value. Moreover, a, b, and c may each be arbitrary values.
  • Example 1-41 is shown below.
  • [K / a] in the above formula may be floor (K / a), ceil (K / a), round (K / a), or another rounding method. It may be a value. Moreover, a, b, and c may each be arbitrary values.
  • Example 1-42 is shown below.
  • [K / a] in the above formula may be floor (K / a), ceil (K / a), round (K / a), or another rounding method. It may be a value. Further, a, b, c and d may be arbitrary values.
  • Example 1-43 is shown below.
  • [K / a] in the above formula may be floor (K / a), ceil (K / a), round (K / a), or another rounding method. It may be a value. Further, a, b, c and d may be arbitrary values.
  • Example 1-44 ⁇ Parity check bit calculation method: Example 1-44>
  • Example 1-44 is shown below.
  • [K / a] in the above formula may be floor (K / a), ceil (K / a), round (K / a), or another rounding method. It may be a value. Moreover, a, b, c, d, e, and f may each be arbitrary values.
  • parity check bits are calculated using any combination of the parity check bit calculation methods in DSimpleP-Polar as described above.
  • examples 2-1 to 2-11 will be described as variations of the insertion position of the parity check bit into the information block.
  • b i may be any value that satisfies b 1 ⁇ b 2 ⁇ ... ⁇ b J ′
  • p i is, for example, (b (i ⁇ 1) +1) th It is the information bit calculated by the exclusive OR of the information bits up to b i-th information bit.
  • p i may be calculated by exclusive OR of information bits from the first information bit to the b i th information bit.
  • the calculation method of p i in Examples 2-1 to 2-11 is not limited to these, and p i may be calculated by other methods.
  • the decoding methods described so far can be applied.
  • the user apparatus 10 determines that the parity check bit is Decoding is performed, the information bit is decoded, and then the information bit is checked using the parity check bit.
  • Example 2-1> FIG. 17 shows Example 2-1.
  • p i is inserted immediately after u bi .
  • Example 2-2> FIG. 18 shows Example 2-2.
  • p i may be inserted anywhere after u bi .
  • p 1 is inserted immediately after the (b 1 +1) th information bit.
  • FIG. 19 shows Example 2-3.
  • p i are collectively arranged after (for example, immediately after) the b J′- th information bit.
  • p 1 to p 3 are arranged together after u b3 .
  • Example 2-4 Example 2-5>
  • Examples 2-4 and 2-5 show variations of b i calculation examples in the case where p i is inserted immediately after u bi .
  • Example 2-6 also shows a variation of the b i calculation method when p i is inserted immediately after u bi .
  • K ′ 3M (M is an element of a natural number N)
  • K ′ 3M + 1
  • K ′ 3M + 2
  • b 1 , b 2 , and b 3 are calculated as follows.
  • Example 2-9 ⁇ Position of parity check bit: Example 2-9>
  • p 1, .... , P J ′ are arranged together immediately before the information block.
  • the decoding-side user device 10 can perform a check using the parity check bit after decoding the information bit corresponding to the parity check bit.
  • p 1 ,. , P J ′ may be placed anywhere in the information block.
  • FIG. 24 shows an example of the arrangement.
  • the decoding-side user device 10 can perform a check using the parity check bit after decoding the information bit corresponding to the parity check bit.
  • the base station 20 may combine the Distributed CRC Polar and / or the PC-Polar in the DSimpleP-Polar encoding process.
  • the base station 20 adds a parity check bit of DSimpleP-Polar to the information obtained after the process of adding the Distributed CRC bit / PC Frozen bit.
  • the processing of adding the Distributed CRC bit and / or adding the PC Frozen bit may be performed after adding the parity check bit of DSimpleP-Polar.
  • the parity check of DSimpleP-Polar is performed at the time of decoding. It is possible to check the Distributed CRC bit and / or the PC Frozen bit with respect to the series that has succeeded.
  • FIG. 25 shows the characteristics of each method.
  • DSimpleP-Polar can fix the position of the additional bit (parity check bit) (predetermined position), and the encoding process of the additional bit is a simple process of single parity check. It becomes. Therefore, there is an advantage that the processing load during encoding is low. Further, FAR (false detection rate) is as good as other methods.
  • FAR false detection rate
  • FIG. 26 is a diagram illustrating an example of a functional configuration of the user device 10.
  • the user apparatus 10 includes a signal transmission unit 101, a signal reception unit 102, and a setting information management unit 103.
  • the functional configuration shown in FIG. 26 is merely an example. As long as the operation according to the present embodiment can be executed, the function classification and the name of the function unit may be anything.
  • the signal transmission unit 101 creates a transmission from the transmission data and transmits the transmission signal wirelessly.
  • the signal receiving unit 102 wirelessly receives various signals, and acquires higher layer signals from the received physical layer signals.
  • the setting information management unit 103 stores various setting information received from the base station 20 by the signal receiving unit 102, and preset setting information.
  • the content of the setting information is, for example, information on the parity check bit calculation method and position in DSimple-Polar (eg, information on the bit position itself, information on the number of divisions, the number of parity check bits, etc.).
  • the signal transmission unit 101 includes an encoding unit 111 and a transmission unit 121.
  • the encoding unit 111 performs DSimpleP-Polar encoding processing. For example, the encoding unit 111 adds parity check bits to each of a plurality of partial blocks in the information block, and generates encoded information by encoding the information block to which the parity check bits are added. Composed. Encoding is performed using, for example, a Polar code.
  • the encoding unit 111 includes a function of calculating a CRC and adding the CRC to the information block. Also, the encoding unit 111 may perform a Distributed CRC Polar and / or a PC-Polar encoding process in addition to the DSimpleP-Polar encoding process.
  • the transmission unit 121 is configured to create a transmission signal from the encoded information generated by the encoding unit 111 and transmit the transmission signal wirelessly. For example, the transmission unit 121 punctures part of the bit values in the encoded information by rate matching, modulates the encoded information that has been punctured, and generates modulation symbols (complex-valued modulation symbols). Is generated. Also, the transmitter 121 maps modulation symbols to resource elements, generates a transmission signal (eg, OFDM signal, SC-FDMA signal), and transmits it from an antenna provided in the transmitter 121. The transmission signal is received by, for example, another communication device (eg, base station 20 or user device 15).
  • another communication device eg, base station 20 or user device 15.
  • the signal receiving unit 102 includes a decoding unit 112 and a receiving unit 122.
  • the receiving unit 122 adds a parity check bit to each of the plurality of partial blocks in the information block, and receives the encoded information generated by encoding the information block to which the parity check bit is added. Composed. A plurality of parity check bits corresponding to a plurality of partial blocks in the information block may be collectively added to the information block.
  • the reception unit 122 acquires the likelihood of each bit of encoded information encoded by, for example, a Polar code by demodulating the received signal. For example, the receiving unit 122 performs FFT on the received signal obtained by the detection, acquires the signal component of each subcarrier, and obtains the log likelihood ratio for each bit using the QRM-MLD method or the like.
  • the decoding unit 112 performs decoding of the encoded information using the likelihood of each bit, information on known frozen bits, information on the position of parity check bits, and the like. Also, the decoding unit 112 is configured to acquire a plurality of candidate sequences by decoding the encoded information and perform a parity check for each of the plurality of candidate sequences using the above-described parity check bits. In addition, the decoding unit 112 can determine whether or not to interrupt the decoding process by performing a parity check while performing the bit-by-bit sequential decoding process on the encoded information.
  • FIG. 27 is a diagram illustrating an example of a functional configuration of the base station 20.
  • the base station 20 includes a signal transmission unit 201, a signal reception unit 202, a setting information management unit 203, and a scheduling unit 204.
  • the functional configuration shown in FIG. 27 is merely an example. As long as the operation according to the present embodiment can be executed, the function classification and the name of the function unit may be anything.
  • the signal transmission unit 201 includes a function of generating a signal to be transmitted to the user apparatus 10 and transmitting the signal wirelessly.
  • the signal receiving unit 202 includes a function of receiving various signals transmitted from the user apparatus 10 and acquiring, for example, higher layer information from the received signals.
  • the setting information management unit 203 stores setting information, for example.
  • the contents of the setting information are, for example, information on the parity check bit calculation method and / or parity check bit position in DSimple-Polar (eg, information on the bit position itself, information on the number of divisions, the number of parity check bits, etc.) is there.
  • the scheduling unit 204 for example, allocates resources (UL communication resource, DL communication resource, or SL communication resource) used by the user apparatus 10, passes the allocation information to the signal transmission unit 201, and the signal transmission unit 201 Downlink control information including the allocation information is transmitted to the user apparatus 10.
  • resources UL communication resource, DL communication resource, or SL communication resource
  • the signal transmission unit 201 includes an encoding unit 211 and a transmission unit 221.
  • the encoding unit 211 performs DSimpleP-Polar encoding processing. For example, the encoding unit 211 adds parity check bits to each of a plurality of partial blocks in the information block, and generates encoded information by encoding the information block to which the parity check bits are added. Composed. A plurality of parity check bits corresponding to a plurality of partial blocks in the information block may be collectively added to the information block. Encoding is performed using, for example, a Polar code.
  • the encoding unit 211 includes a function of calculating a CRC and adding the CRC to the information block. Also, the encoding unit 211 may perform a distributed CRC Polar and / or a PC-Polar encoding process in addition to the DSimpleP-Polar encoding process.
  • the transmission unit 221 is configured to create a transmission signal from the encoded information generated by the encoding unit 211 and transmit the transmission signal wirelessly. For example, the transmission unit 221 punctures a part of bit values in the encoded information by rate matching, modulates the punctured encoded information, and modulates (modulated-valued modulation symbols). Is generated. Also, the transmission unit 221 maps modulation symbols to resource elements, generates a transmission signal (eg, OFDM signal, SC-FDMA signal), and transmits it from an antenna provided in the transmission unit 221.
  • a transmission signal eg, OFDM signal, SC-FDMA signal
  • the signal receiving unit 202 includes a decoding unit 212 and a receiving unit 222.
  • the receiving unit 222 adds a parity check bit to each of a plurality of partial blocks in the information block, and receives encoded information generated by encoding the information block to which the parity check bit is added. Composed.
  • the receiving unit 222 acquires the likelihood of each bit of the encoded information encoded by, for example, a Polar code by demodulating the received signal.
  • the reception unit 222 performs FFT on the reception signal obtained by detection, acquires the signal component of each subcarrier, and obtains the log likelihood ratio for each bit using the QRM-MLD method or the like.
  • the decoding unit 212 decodes the encoded information by using the likelihood of each bit, information on known frozen bits, information on the position of parity check bits, and the like. Also, the decoding unit 212 is configured to acquire a plurality of candidate sequences by decoding the encoded information, and to perform a parity check for each of the plurality of candidate sequences using the above-described parity check bits. In addition, the decoding unit 212 can determine whether or not to interrupt the decoding process by the parity check while performing the bit-by-bit sequential decoding process on the encoded information.
  • each functional block may be realized by one device in which a plurality of elements are physically and / or logically combined, or two or more devices physically and / or logically separated may be directly and directly. It may be realized by a plurality of these devices connected indirectly (for example, wired and / or wirelessly).
  • both the user apparatus 10 and the base station 20 in the embodiment of the present invention may function as a computer that performs processing according to the present embodiment.
  • FIG. 28 is a diagram illustrating an example of a hardware configuration of the user apparatus 10 and the base station 20 according to the present embodiment.
  • Each of the above-described user apparatus 10 and base station 20 may be physically configured as a computer apparatus including a processor 1001, a memory 1002, a storage 1003, a communication apparatus 1004, an input apparatus 1005, an output apparatus 1006, a bus 1007, and the like. Good.
  • the term “apparatus” can be read as a circuit, a device, a unit, or the like.
  • the hardware configurations of the user apparatus 10 and the base station 20 may be configured to include one or a plurality of apparatuses indicated by 1001 to 1006 shown in the figure, or may be configured not to include some apparatuses. May be.
  • Each function in the user apparatus 10 and the base station 20 is performed by causing the processor 1001 to perform computation by reading predetermined software (program) on hardware such as the processor 1001 and the memory 1002, and performing communication by the communication apparatus 1004 and memory 1002. This is realized by controlling reading and / or writing of data in the storage 1003.
  • the processor 1001 controls the entire computer by operating an operating system, for example.
  • the processor 1001 may be configured by a central processing unit (CPU) including an interface with a peripheral device, a control device, an arithmetic device, a register, and the like.
  • CPU central processing unit
  • the processor 1001 reads a program (program code), software module, or data from the storage 1003 and / or the communication device 1004 to the memory 1002, and executes various processes according to these.
  • a program program that causes a computer to execute at least a part of the operations described in the above embodiments is used.
  • the signal transmission unit 101, the signal reception unit 102, and the setting information management unit 103 of the user apparatus 10 illustrated in FIG. 26 may be realized by a control program stored in the memory 1002 and operating on the processor 1001.
  • the memory 1002 is a computer-readable recording medium, for example, ROM (Read Only Memory), EPROM (Erasable Programmable ROM), EEPROM (Electrically Erasable Programmable ROM), RAM (Random Access Memory), etc. May be.
  • the memory 1002 may be called a register, a cache, a main memory (main storage device), or the like.
  • the memory 1002 can store a program (program code), a software module, and the like that can be executed to perform the processing according to the embodiment of the present invention.
  • the storage 1003 is a computer-readable recording medium such as an optical disk such as a CD-ROM (Compact Disc ROM), a hard disk drive, a flexible disk, a magneto-optical disk (for example, a compact disk, a digital versatile disk, a Blu-ray). (Registered trademark) disk, smart card, flash memory (for example, card, stick, key drive), floppy (registered trademark) disk, magnetic strip, and the like.
  • the storage 1003 may be referred to as an auxiliary storage device.
  • the storage medium described above may be, for example, a database, server, or other suitable medium including the memory 1002 and / or the storage 1003.
  • the communication device 1004 is hardware (transmission / reception device) for performing communication between computers via a wired and / or wireless network, and is also referred to as a network device, a network controller, a network card, a communication module, or the like.
  • the signal transmission unit 101 and the signal reception unit 102 of the user device 10 may be realized by the communication device 1004.
  • the signal transmission unit 201 and the signal reception unit 202 of the base station 20 may be realized by the communication device 1004.
  • the input device 1005 is an input device (for example, a keyboard, a mouse, a microphone, a switch, a button, a sensor, etc.) that accepts an input from the outside.
  • the output device 1006 is an output device (for example, a display, a speaker, an LED lamp, etc.) that performs output to the outside.
  • the input device 1005 and the output device 1006 may have an integrated configuration (for example, a touch panel).
  • each device such as the processor 1001 and the memory 1002 is connected by a bus 1007 for communicating information.
  • the bus 1007 may be configured with a single bus or may be configured with different buses between apparatuses.
  • the user apparatus 10 and the base station 20 are respectively a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device (PLD), an ASIC (Fragable Logic Device), a PLD (Programmable Logic Device), an AFP It may be configured including hardware, and a part or all of each functional block may be realized by the hardware.
  • the processor 1001 may be implemented by at least one of these hardware.
  • a communication device used in a wireless communication system a parity check bit is added to each of a plurality of partial blocks in an information block, and the parity check bit is An encoding unit that generates encoded information by encoding the added information block, and a transmission unit that generates a transmission signal from the encoded information generated by the encoding unit and transmits the transmission signal.
  • the parity check bit is used for parity check for each of a plurality of candidate sequences obtained by the decoding process of the encoded information on the reception side of the transmission signal.
  • the encoding unit encodes the information block using a Polar code
  • the parity check is a decoding process in a sequential decoding process for each bit of the encoded information. Used to determine interruption. With this configuration, useless decoding processing can be reduced.
  • a communication device used in a wireless communication system a parity check bit is added to each of a plurality of partial blocks in an information block, and the information block to which the parity check bit is added
  • a receiving unit that receives encoded information generated by encoding, and obtaining a plurality of candidate sequences by decoding the encoded information, and using each of the plurality of candidate sequences using the parity check bits
  • a decoding unit that performs a parity check on the communication device.
  • the encoded information is, for example, encoded information obtained by encoding the information block using a Polar code, and the decoding unit sequentially decodes the encoded information bit by bit. During the process, it is determined by the parity check whether or not the decoding process is interrupted. With this configuration, useless decoding processing can be reduced.
  • an encoding method executed by a communication apparatus used in a wireless communication system in which a parity check bit is added to each of a plurality of partial blocks in an information block, and the parity check bit is added
  • An encoding step for generating encoded information by encoding the information block a transmission step for generating a transmission signal from the encoded information generated by the encoding step, and transmitting the transmission signal;
  • the parity check bit is used for parity check for each of a plurality of candidate sequences obtained by the decoding process of the encoded information on the reception side of the transmission signal.
  • a decoding method executed by a communication device used in a wireless communication system includes adding a parity check bit to each of a plurality of partial blocks in an information block, and adding the parity check bit.
  • the operations of a plurality of functional units may be physically performed by one component, or the operations of one functional unit may be physically performed by a plurality of components.
  • the processing order may be changed as long as there is no contradiction.
  • the user apparatus 10 and the base station 20 have been described using functional block diagrams. However, such an apparatus may be realized by hardware, software, or a combination thereof.
  • the software operated by the processor of the user apparatus 10 according to the embodiment of the present invention and the software operated by the processor of the base station 20 according to the embodiment of the present invention are random access memory (RAM), flash memory, and read-only, respectively. It may be stored in any appropriate storage medium such as a memory (ROM), EPROM, EEPROM, register, hard disk (HDD), removable disk, CD-ROM, database, server or the like.
  • the notification of information is not limited to the aspect / embodiment described in the present specification, and may be performed by other methods.
  • the notification of information includes physical layer signaling (for example, DCI (Downlink Control Information), UCI (Uplink Control Information)), upper layer signaling (for example, RRC (Radio Resource Control) signaling, MAC (Medium Accu), signaling (MediaColl). It may be implemented by broadcast information (MIB (Master Information Block), SIB (System Information Block)), other signals, or a combination thereof, and RRC signaling may be referred to as an RRC message, for example, RRC Connection setup (RRC Con ection Setup) message, RRC connection reconfiguration (it may be a RRC Connection Reconfiguration) message.
  • RRC message for example, RRC Connection setup (RRC Con ection Setup) message, RRC connection reconfiguration (it may be a RRC Connection Reconfiguration) message.
  • Each aspect / embodiment described in this specification includes LTE (Long Term Evolution), LTE-A (LTE-Advanced), SUPER 3G, IMT-Advanced, 4G, 5G, FRA (Fure Radio Access), and W-CDMA.
  • LTE Long Term Evolution
  • LTE-A Long Term Evolution-Advanced
  • SUPER 3G IMT-Advanced
  • 4G 5G
  • FRA Full Radio Access
  • W-CDMA Wideband
  • GSM registered trademark
  • CDMA2000 Code Division Multiple Access 2000
  • UMB User Mobile Broadband
  • IEEE 802.11 Wi-Fi
  • IEEE 802.16 WiMAX
  • IEEE 802.20 UWB (Ultra-WideBand
  • the present invention may be applied to a Bluetooth (registered trademark), a system using other appropriate systems, and / or a next generation system extended based on these systems.
  • the specific operation assumed to be performed by the base station 20 in the present specification may be performed by the upper node in some cases.
  • various operations performed for communication with the user apparatus 10 may be performed in a manner other than the base station 20 and / or other than the base station 20.
  • a network node for example, but not limited to MME or S-GW.
  • MME and S-GW network nodes
  • User equipment 10 can be used by those skilled in the art to subscriber stations, mobile units, subscriber units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile subscriber stations, access terminals, mobile terminals, It may also be referred to as a wireless terminal, remote terminal, handset, user agent, mobile client, client, or some other appropriate terminology.
  • Base station 20 may also be referred to by those skilled in the art as NB (NodeB), eNB (enhanced NodeB), base station (Base Station), gNB, or some other appropriate terminology.
  • NB NodeB
  • eNB enhanced NodeB
  • Base Station Base Station
  • gNB Base Station
  • determining may encompass a wide variety of actions.
  • “Judgment” and “determination” are, for example, judgment (judging), calculation (calculating), calculation (computing), processing (processing), derivation (investigation), investigation (investigating), search (loking up) (for example, table , Searching in a database or another data structure), considering ascertaining “determining”, “determining”, and the like.
  • “determination” and “determination” are reception (for example, receiving information), transmission (for example, transmitting information), input (input), output (output), and access. (Accessing) (for example, accessing data in a memory) may be considered as “determining” or “determining”.
  • determination and “determination” means that “resolving”, selection (selecting), selection (choosing), establishment (establishing), comparison (comparing), etc. are regarded as “determination” and “determination”. May be included. In other words, “determination” and “determination” may include considering some operation as “determination” and “determination”.
  • the phrase “based on” does not mean “based only on”, unless expressly specified otherwise. In other words, the phrase “based on” means both “based only on” and “based at least on.”

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

La présente invention concerne un dispositif de communication, qui est utilisé dans un système de communication sans fil, et qui comprend : une unité de codage qui génère des informations codées par la fixation d'un bit de contrôle de parité à chaque bloc partiel d'une pluralité de blocs partiels dans un bloc d'informations et le codage du bloc d'informations auquel les bits de contrôle de parité ont été fixés ; et une unité de transmission qui crée un signal de transmission à partir des informations codées générées par l'unité de codage, et transmet le signal de transmission. Les bits de contrôle de parité sont utilisés pour un contrôle de parité, sur le côté réception du signal de transmission, sur une pluralité de séquences candidates obtenues par décodage des informations codées.
PCT/JP2017/020725 2017-06-02 2017-06-02 Dispositif de communication, procédé de codage et procédé de décodage WO2018220857A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2017/020725 WO2018220857A1 (fr) 2017-06-02 2017-06-02 Dispositif de communication, procédé de codage et procédé de décodage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2017/020725 WO2018220857A1 (fr) 2017-06-02 2017-06-02 Dispositif de communication, procédé de codage et procédé de décodage

Publications (1)

Publication Number Publication Date
WO2018220857A1 true WO2018220857A1 (fr) 2018-12-06

Family

ID=64456033

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2017/020725 WO2018220857A1 (fr) 2017-06-02 2017-06-02 Dispositif de communication, procédé de codage et procédé de décodage

Country Status (1)

Country Link
WO (1) WO2018220857A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010068083A (ja) * 2008-09-09 2010-03-25 Toshiba Corp 復号装置、および復号方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010068083A (ja) * 2008-09-09 2010-03-25 Toshiba Corp 復号装置、および復号方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NOKIA ET AL.: "Details of CRC distribution of Polar design", 3GPP R1-1703497, no. R1-1703497, 15 February 2017 (2017-02-15), XP051222045 *
NTT DOCOMO: "Distributed simple parity check Polar codes", 3GPP R1-1705757, no. R1-1705757, 7 April 2017 (2017-04-07), XP051243872 *
TAO WANG: "Parity-check-concatenated Polar Codes", IEEE COMMUNICATIONS LETTERS, vol. 20, no. 12, pages 2342 - 2345, XP055607890, DOI: 10.1109/LCOMM.2016.2607169 *

Similar Documents

Publication Publication Date Title
US11309997B2 (en) Generation of polar codes with a variable block length utilizing puncturing
US11689220B2 (en) Method and device for interleaving data
KR102533307B1 (ko) 밀도 진화를 사용한 폴라 코드 구성을 위한 네스팅된 구조
US10924210B2 (en) Method, apparatus, and device for determining polar code encoding and decoding
US10637617B2 (en) User apparatus, base station, and communication method
JP2020516157A (ja) 符号化方法、復号方法、装置、および装置
CN109565288B (zh) 用于块编码的速率匹配
CN109792298B (zh) 子信道映射
WO2018130185A1 (fr) Perforation et répétition pour codage d'informations
WO2018203417A1 (fr) Dispositif de station de base, dispositif utilisateur et procédé de communication
WO2019024594A1 (fr) Procédés, appareils et dispositifs permettant de coder et décoder un code de polarisation
US11936402B2 (en) Puncturing of polar codes with complementary sequences
JP7028891B2 (ja) 通信装置及び通信方法
JP2020537379A (ja) Ｐｏｌａｒ符号性能を向上させるためのＮＲ ＰＢＣＨペイロードのビット順序
WO2018143124A1 (fr) Dispositif de communication et procédé de sélection de séquence
US11057154B2 (en) Method and apparatus for rate matching interleaving for polar codes
WO2018163433A1 (fr) Dispositif de communication et procédé de décodage
WO2018167980A1 (fr) Dispositif de communication, procédé de codage et procédé de décodage
WO2018220857A1 (fr) Dispositif de communication, procédé de codage et procédé de décodage
WO2018207377A1 (fr) Dispositif de communication, procédé de codage, et procédé de décodage

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17912020

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17912020

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP