+

WO2018151545A1 - Procédé de transmission d'informations et dispositif de transmission - Google Patents

Procédé de transmission d'informations et dispositif de transmission Download PDF

Info

Publication number
WO2018151545A1
WO2018151545A1 PCT/KR2018/001960 KR2018001960W WO2018151545A1 WO 2018151545 A1 WO2018151545 A1 WO 2018151545A1 KR 2018001960 W KR2018001960 W KR 2018001960W WO 2018151545 A1 WO2018151545 A1 WO 2018151545A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
bit
output
channel
input
Prior art date
Application number
PCT/KR2018/001960
Other languages
English (en)
Korean (ko)
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 엘지전자 주식회사
Publication of WO2018151545A1 publication Critical patent/WO2018151545A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received

Definitions

  • the present invention relates to a wireless communication system, and to a method and apparatus for transmitting information.
  • M2M machine-to-machine
  • MTC machine type communication
  • smart phones tablet PCs
  • tablet PCs tablet PCs
  • Multi-antenna technology multi-base station cooperation technology, and the like are developing.
  • eMBB enhanced mobile broadband
  • RAT legacy radio access technology
  • massive machine type communication for connecting a plurality of devices and objects to provide various services anytime and anywhere is one of the major issues to be considered in next-generation communication.
  • next generation radio access technology has been discussed in consideration of eMBB communication, mMTC, ultra-reliable and low latency communication (URLLC), and the like.
  • a transmitter performs rate matching on an output bit sequence of a polar code.
  • the bit order punctured for the output bit sequence and the repeated bit order are the same.
  • a method for transmitting information by a transmitter in a wireless communication system comprises: encoding a input information using a polar code of mother code size N to generate a first output bit sequence of length N; Transmitting the second output bit sequence by rate-matching the first output bit sequence if the number of transmission bits M and the mother code size N are different. Transmitting the second output bit sequence includes: if M> N, further transmitting MN bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence, wherein M ⁇ If N, then transmitting M bits other than NM bits in the same order as the specific order of the first output bit sequence.
  • a transmitter for transmitting information in a wireless communication system includes a radio frequency (RF) unit and a processor configured to control the RF unit.
  • the processor is configured to: encode input information using a polar code of mother code size N to generate a first output bit sequence of length N; And if the number of transmit bits M and mother code size N are different, control the RF unit to rate-match the first output bit sequence to transmit a second output bit sequence.
  • the processor controls the RF unit to further transmit MN bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence if M> N, and if M ⁇ N, And control the RF unit to transmit the remaining M bits except for the NM bits in the same order as the specific order of the first output bit sequence.
  • the specific order is a descending order of reliability of the input bit positions of the polar code, wherein the MN bits are output bits having the same index as the MN input bit positions having the highest reliability.
  • the NM bits may be output bits corresponding to the NM input bit positions with the highest reliability.
  • the specific order is an ascending order of reliability of the input bit positions of the polar code, wherein the MN bits are output bits having the same index as the MN input bit positions having the lowest reliability.
  • the NM bits may be output bits corresponding to the NM input bit positions with the lowest reliability.
  • the specific order may be ascending order from the least significant bit of the first output bit sequence.
  • the specific order may be in descending order from the most significant bit of the first output bit sequence.
  • the wireless communication signal can be efficiently transmitted / received. Accordingly, the overall throughput of the wireless communication system can be high.
  • delays / delays generated in the communication process between the user equipment and the base station may be reduced.
  • Signals can also be transmitted / received efficiently and at low error rates in wireless communication systems.
  • FIG. 1 illustrates a process of a transport block in an LTE / LTE-A system.
  • FIG. 2 is a block diagram illustrating performing rate matching by separating the systematic and parity portions of an encoded code block.
  • FIG. 4 is a block diagram for a polar code encoder.
  • FIG. 6 illustrates N-th level channel combining for polar code.
  • FIG. 10 conceptually illustrates an iterative scheme and a puncturing scheme used in an IEEE 802.11n series system, which is a wireless communication system with an LTE / LTE-A system.
  • FIG. 11 conceptually illustrates an iterative method and a puncturing method according to the present invention.
  • FIG. 12 is a block diagram showing the components of the transmitter 10 and the receiver 20 for carrying out the present invention.
  • CDMA code division multiple access
  • FDMA frequency division multiple access
  • TDMA time division multiple access
  • OFDMA orthogonal frequency division multiple access
  • SC-FDMA single carrier frequency division multiple access
  • MC-FDMA multi-carrier frequency division multiple access
  • CDMA may be implemented in a radio technology such as Universal Terrestrial Radio Access (UTRA) or CDMA2000.
  • TDMA may be implemented in radio technologies such as Global System for Mobile Communication (GSM), General Packet Radio Service (GPRS), Enhanced Data Rates for GSM Evolution (EDGE) (i.e., GERAN), and the like.
  • GSM Global System for Mobile Communication
  • GPRS General Packet Radio Service
  • EDGE Enhanced Data Rates for GSM Evolution
  • OFDMA may be implemented in wireless technologies such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 (WiFi), IEEE 802.16 (WiMAX), IEEE802-20, evolved-UTRA (E-UTRA), and the like.
  • IEEE Institute of Electrical and Electronics Engineers
  • WiFi WiFi
  • WiMAX WiMAX
  • IEEE802-20 evolved-UTRA
  • UTRA is part of Universal Mobile Telecommunication System (UMTS)
  • 3GPP 3rd Generation Partnership Project
  • LTE Long Term Evolution
  • 3GPP LTE employs OFDMA in downlink (DL) and SC-FDMA in uplink (UL).
  • LTE-advanced (LTE-A) is an evolution of 3GPP LTE.
  • the present invention will be described on the assumption that the present invention is applied to a 3GPP based communication system, for example, LTE / LTE-A, NR.
  • a 3GPP based communication system for example, LTE / LTE-A, NR.
  • the technical features of the present invention are not limited thereto.
  • the following detailed description is described based on a mobile communication system corresponding to a 3GPP LTE / LTE-A / NR system, except for the matters specific to 3GPP LTE / LTE-A / NR, Applicable to any mobile communication system.
  • the expression “assuming” may mean that the subject transmitting the channel transmits the channel so as to correspond to the "assuming”.
  • the subject receiving the channel may mean that the channel is received or decoded in a form conforming to the "home", provided that the channel is transmitted to conform to the "home”.
  • the UE may be fixed or mobile, and various devices which communicate with a base station (BS) to transmit and receive user data and / or various control information belong to the same.
  • BS Base station
  • UE Terminal Equipment
  • MS Mobile Station
  • MT Mobile Terminal
  • UT User Terminal
  • SS Subscribe Station
  • wireless device PDA (Personal Digital Assistant), wireless modem
  • a BS generally refers to a fixed station communicating with the UE and / or another BS, and communicates with the UE and another BS to exchange various data and control information.
  • the BS may be referred to in other terms such as ABS (Advanced Base Station), Node-B (NB), evolved-NodeB (NB), Base Transceiver System (BTS), Access Point, and Processing Server (PS).
  • ABS Advanced Base Station
  • Node-B Node-B
  • NB evolved-NodeB
  • BTS Base Transceiver System
  • gNB Base Transceiver System
  • PS Processing Server
  • the base station of the UTRAN is called Node-B
  • the base station of the E-UTRAN is called eNB
  • gNB base station of the new radio access technology network
  • the BS is collectively referred to as eNB.
  • a node refers to a fixed point capable of transmitting / receiving a radio signal by communicating with a UE.
  • Various forms of eNBs may be used as nodes regardless of their names.
  • a node may be a BS, an NB, an eNB, a pico-cell eNB (PeNB), a home eNB (HeNB), a relay, a repeater, or the like.
  • the node may not be an eNB.
  • it may be a radio remote head (RRH), a radio remote unit (RRU).
  • RRH, RRU, etc. generally have a power level lower than the power level of the eNB.
  • RRH or RRU, RRH / RRU is generally connected to the eNB by a dedicated line such as an optical cable
  • RRH / RRU and eNB are generally compared to cooperative communication by eNBs connected by a wireless line.
  • cooperative communication can be performed smoothly.
  • At least one antenna is installed at one node.
  • the antenna may mean a physical antenna or may mean an antenna port, a virtual antenna, or an antenna group. Nodes are also called points.
  • a cell refers to a certain geographic area in which one or more nodes provide communication services. Therefore, in the present invention, communication with a specific cell may mean communication with an eNB or a node that provides a communication service to the specific cell.
  • the downlink / uplink signal of a specific cell means a downlink / uplink signal from / to an eNB or a node that provides a communication service to the specific cell.
  • the cell providing uplink / downlink communication service to the UE is particularly called a serving cell.
  • the channel state / quality of a specific cell means a channel state / quality of a channel or communication link formed between an eNB or a node providing a communication service to the specific cell and a UE.
  • a UE may transmit a downlink channel state from a specific node to a CRS (s) in which antenna port (s) of the specific node are transmitted on a Cell-specific Reference Signal (CRS) resource allocated to the specific node; / Or can be measured using the CSI-RS (s) transmitted on the Channel State Information Reference Signal (CSI-RS) resources.
  • CRS Cell-specific Reference Signal
  • the input information to the encoder is a transport block (TB) provided from the medium access control layer (TB), CRC additional TB obtained by adding a cyclic redundancy check (CRC) code to the TB
  • the CRC addition TB may be one CB when a TB is segmented into a plurality of code blocks, or a CRC addition CB when a CRC code is added to the CB.
  • the 3GPP-based communication system uses the concept of a cell to manage radio resources.
  • Cells associated with radio resources are distinguished from cells in a geographic area.
  • a "cell” in a geographic area may be understood as coverage in which a node can provide services using a carrier, and a "cell” of radio resources is a bandwidth (frequency) that is a frequency range configured by the carrier. bandwidth, BW).
  • Downlink coverage which is a range in which a node can transmit valid signals
  • uplink coverage which is a range in which a valid signal can be received from a UE, depends on a carrier carrying the signal, so that the coverage of the node is determined by the radio resources used by the node. It is also associated with the coverage of the "cell”.
  • the term "cell” can sometimes be used to mean coverage of a service by a node, sometimes a radio resource, and sometimes a range within which a signal using the radio resource can reach a valid strength.
  • a "cell" associated with a radio resource is defined as a combination of DL resources and UL resources, that is, a combination of a DL component carrier (CC) and a UL CC.
  • the cell may be configured with DL resources alone or with a combination of DL resources and UL resources.
  • the linkage between the carrier frequency of the DL resource (or DL CC) and the carrier frequency of the UL resource (or UL CC) is indicated by system information.
  • SIB2 System Information Block Type 2
  • the carrier frequency means a center frequency of each cell or CC.
  • a cell operating on a primary frequency is referred to as a primary cell (Pcell) or a PCC
  • a cell operating on a secondary frequency (or SCC) is referred to as a secondary cell.
  • cell, Scell) or SCC The carrier corresponding to the Pcell in downlink is called a DL primary CC (DL PCC), and the carrier corresponding to the Pcell in the uplink is called a UL primary CC (DL PCC).
  • Scell refers to a cell that can be configured after RRC (Radio Resource Control) connection establishment is made and can be used for providing additional radio resources.
  • RRC Radio Resource Control
  • the Scell may form a set of serving cells for the UE with the Pcell.
  • the carrier corresponding to the Scell in downlink is called a DL secondary CC (DL SCC)
  • the carrier corresponding to the Scell in the uplink is called a UL secondary CC (UL SCC).
  • DL SCC DL secondary CC
  • UL SCC UL secondary CC
  • the 3GPP-based communication standard provides downlink physical channels corresponding to resource elements carrying information originating from an upper layer and downlink corresponding to resource elements used by the physical layer but not carrying information originating from an upper layer.
  • Physical signals are defined.
  • a physical downlink shared channel (PDSCH), a physical broadcast channel (PBCH), a physical multicast channel (PMCH), a physical control format indicator channel (physical control format) indicator channel (PCFICH), physical downlink control channel (PDCCH) and physical hybrid ARQ indicator channel (PHICH) are defined as downlink physical channels, reference signal and synchronization signal It is defined as downlink physical signals.
  • a reference signal (RS) also referred to as a pilot, refers to a signal of a predetermined special waveform known to the eNB and the UE.
  • a cell specific RS, UE- UE-specific RS, positioning RS (PRS), and channel state information RS (CSI-RS) are defined as downlink reference signals.
  • the 3GPP-based communication standard includes uplink physical channels corresponding to resource elements carrying information originating from an upper layer and uplink corresponding to resource elements used by the physical layer but not carrying information originating from an upper layer. It defines physical signals. For example, a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), and a physical random access channel (PRACH) are the uplink physical channels.
  • a demodulation reference signal (DMRS) for uplink control / data signals and a sounding reference signal (SRS) used for uplink channel measurement are defined.
  • Physical Downlink Control CHannel PDCCH
  • Physical Control Format Indicator CHannel PCFICH
  • PHICH Physical Hybrid automatic retransmit request Indicator CHannel
  • PDSCH Physical Downlink Shared CHannel
  • DCI Downlink Control Information
  • CFI Control
  • Format Indicator / Downlink ACK / NACK (ACKnowlegement / Negative ACK) / Downlink Means a set of time-frequency resources or a set of resource elements that carry downlink data, and also includes a physical uplink control channel (PUCCH) and a physical uplink (PUSCH).
  • Physical Random Access CHannel means a set of time-frequency resources or a set of resource elements that carry uplink control information (UCI) / uplink data / random access signals, respectively.
  • the PDCCH / PCFICH / PHICH / PDSCH / PUCCH / PUSCH / PRACH resource is referred to below:
  • the expression that the user equipment transmits the PUCCH / PUSCH / PRACH is hereinafter referred to as uplink control information / uplink on or through PUSCH / PUCCH / PRACH, respectively. It is used in the same sense as transmitting a data / random access signal, and the expression that the eNB transmits PDCCH / PCFICH / PHICH / PDSCH is used for downlink data / control information on or through PDCCH / PCFICH / PHICH / PDSCH, respectively. It is used in the same sense as sending it.
  • 3GPP LTE / LTE-A standard document for example, 3GPP TS 36.211, 3GPP TS 36.212, 3GPP TS 36.213, 3GPP TS 36.321 and 3GPP TS 36.331 and the like, and 3GPP NR standard documents, such as 3GPP TS 38.xxx.
  • 3GPP TS 38.xxx the principles of encoding and decoding using polar codes and polar codes are described in 'E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July2009).
  • Massive MTC which connects multiple devices and objects to provide various services anytime and anywhere, is also one of the major issues to be considered in next-generation communication.
  • a communication system design considering a service / UE that is sensitive to reliability and latency has been discussed.
  • next generation RAT considering such advanced mobile broadband communication, Massive MTC, and Ultra-Reliable and Low Latency Communication (URLLC) is being discussed.
  • URLLC Ultra-Reliable and Low Latency Communication
  • 3GPP is working on the next generation mobile communication system after EPC.
  • the technology is referred to as a new RAT (new RAT, NR) or 5G RAT.
  • NR communication systems are required to support significantly better performance than existing fourth generation (4G) systems in terms of data rate, capacity, latency, energy consumption and cost.
  • 4G fourth generation
  • NR systems need to make significant advances in the area of bandwidth, spectral, energy, signaling efficiency, and cost per bit.
  • NR needs to utilize efficient waveforms to meet these needs.
  • FIG. 1 illustrates a process of a transport block in an LTE / LTE-A system.
  • information transmitted from the transmitting end is encoded and then transmitted using a forward error correction code.
  • the receiving end demodulates the received signal and then decodes the error correcting code to restore the transmission information. In this decoding process, an error in the received signal caused by the channel is corrected.
  • Data arrives at a coding block in the behavior of up to two transport blocks per TTI per DL / UL cell.
  • the following coding steps may be applied for each transport block of a DL / UL cell:
  • Turbo codes are mainly used in the existing LTE / LTE-A system.
  • the turbo code is composed of a recursive systematic convolution encoder and an interleaver.
  • an interleaver to facilitate parallel decoding, a kind of which is quadratic polynomial permutation (QPP).
  • QPP quadratic polynomial permutation
  • Such a QPP interleaver is known to maintain good performance only for certain data block sizes.
  • the performance of the turbo code is known to be good as the data block size increases.
  • the data block having a predetermined size or more is divided into several small data blocks and encoded. A small divided data block is called a code block.
  • the code blocks generally have the same size, but due to the size limitation of the QPP interleaver, one code block of several code blocks may have a different size. Interleaving is performed to reduce the effects of burst errors that occur during transmission on a wireless channel after an error correction encoding process in units of code blocks having a predetermined interleaver size. And, it is mapped to the actual radio resource and transmitted. Since the amount of radio resources used during the actual transmission is constant, rate matching must be performed on the encoded code block in order to match them. Generally, rate matching consists of puncturing or repetition.
  • the amount of radio resources that is, the number of transmission bits that can be transmitted by the corresponding radio resource
  • the coded bit sequence i.e., the number of output bits of the encoder is N
  • M and N are different.
  • Rate matching is performed to adjust the length of the coded bit sequence to match M. If M> N, then all or some of the bits of the coded bit sequence are repeated so that the length of the rate matched sequence is equal to M. If M ⁇ N, some of the bits of the coded bit sequence are punctured so that the length of the rate matched sequence is equal to M, and the punctured bits are excluded from the transmission.
  • a rate matching process consisting of puncturing and repetition is used to adjust the code rate of data to be transmitted. do.
  • a turbo code is used as a channel code in LTE / LTE-A, a process of channel coding and rate matching each code block in a transport channel processing process as shown in FIG. 1 is illustrated in FIG. 2.
  • FIG. 2 is a block diagram illustrating performing rate matching by separating the systematic and parity portions of an encoded code block.
  • the mother code rate of the LTE / LTE turbo encoder is 1/3.
  • the rate matching module comprises three so-called sub-block interleavers for the three output streams of the turbo encoder and a bit selection and pruning (realized) by a circular buffer. pruning).
  • the sub-block interleaver is based on a classic row-column interleaver with 32 rows and a length-32 intra-column permutation.
  • the bits of each of the three streams are written in a matrix of 32 columns, row-by-row (the number of rows depends on the stream size). Dummy bits are padded in front of each stream to completely fill the matrix. After column permutation bits are read from the matrix in column-by-column.
  • the circular buffer is the most important part of the rate matching module, which enables puncturing and repetition of mother code.
  • interleaved systematic bits are written to the circular buffer in sequence, with the first bit of the interleaved systematic bit streams at the beginning of the circular buffer.
  • Interleaved and interlaced parity bit streams are sequentially written to the circular buffer, putting the first bit of the stream after the last bit of the interleaved systematic bit stream.
  • Coded bits are read sequentially from any start point specified by redundancy version (RV) points in the circular buffer (depending on the code rate). If the end of the circular buffer is reached and more coded bits are needed for transmission (e.g., for code rates less than one third), the transmitter wraps around and continues from the beginning of the circular buffer. continue).
  • RV redundancy version
  • HARQ which stands for hybrid ARQ, is an error correction mechanism based on retransmission of packets detected as being in error.
  • the transmitted packet arrives after some propagation delay at the receiving device.
  • the receiver produces an ACK in the case of an error-free transmission and produces a NACK when an error is detected.
  • the ACK / NACK is produced after some processing time and sent to the transmitter, and reaches the transmitter after a propagation delay. In the case of NACK, after some processing delay at the transmitter, the desired packet will be sent again.
  • the bits read from the circular buffer and sent in each retransmission are different and depend on the location of the RV. There are four RVs (0, 1, 2, 3) that define the location of the starting point at which bits are read from the circular buffer. Referring to FIG. 3, as the number of retransmissions progresses, the RV increases, so fewer systematic bits and more parity bits are read from the circular buffer for retransmission.
  • NR currently offers better speed and coverage than 4G, operates in high frequency bands, speeds up to 1 Gb / s for dozens of connections, or speeds up to tens of Mb / s for tens of thousands of connections. It is required to do In order to meet the requirements of the NR system, the introduction of an advanced coding scheme is being discussed. Since data communication occurs in an inverted channel environment, channel coding plays an important role in achieving higher data rates for fast, error-free communication.
  • the selected channel code should have excellent block error ratio (BLER) performance over a certain range of block lengths and code rates.
  • BLER is defined as the ratio of the number of erroneous receiving blocks to the total number of blocks sent.
  • eMBB Massive IoT
  • URLLC Ultra-high reliability and low latency, such as industrial automation, driverless cars, remote surgery, and smart grids.
  • Polar code is a code that provides a new framework to solve the problems of existing channel codes and was invented by Arikan of Bikent University (see E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, "in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July2009).
  • Polar codes are mathematically proven, first capacity-achieving codes with low encoding and decoding complexity. Polar code outperforms turbo code at large block lengths without any error flow.
  • channel coding using a polar code is called polar coding.
  • Polar codes are known as achieve number codes in a given binary discrete memoryless channel. This can only be done when the block size is large enough. That is, a polar code is a code that can achieve channel capacity if the code size N is infinitely large. Polar codes are less complex to encode and decode and can be successfully decoded. Polar code is a type of linear block error correcting code, and a number of recursive concatenations are the basic building blocks for polar code and the basis for code construction. A physical transformation of the channel occurs that transforms the physical channels into virtual channels, which is based on a recursive multiple concatenation. When multiple channels are multiplied and accumulated, most of the channels get better or worse, and the idea behind the polar code is to use good channels. For example, sending data at rate 1 on good channels and rate 0 on bad channels. In other words, through channel polarization, channels enter a polarized state from a normal state.
  • FIG. 4 is a block diagram for a polar code encoder.
  • W 2 denotes an entire equivalent channel obtained by combining two binary discrete memory channels (B-DMC) and W.
  • B-DMC binary discrete memory channels
  • u 1 and u 2 are binary-input source bits
  • y 1 and y 2 are output coded bits.
  • Channel combining is a process of parallel concatenating B-DMC channels.
  • Channel W 2 may achieve symmetric capacity I (W), which is the highest rate.
  • Symmetric capacity is an important parameter in the B-DMC W, which is used for the measurement of rate, and is the highest rate at which reliable communication can occur across the channel W.
  • B-DMC may be defined as follows.
  • channel polarization is the process of creating a second set of N channels ⁇ W N (i) : 1 ⁇ i ⁇ N ⁇ using N independent copies of a given B-DMC W, where the channel polarization effect is N
  • N all symmetric capacity terms ⁇ I (W N (i) ) ⁇ tend to be zero or one except for the vanishing fraction of the indices i.
  • the concept behind channel polarization in polar codes is that N copies (i.e., N transmissions) of a channel (eg, additive white Gaussian noise channel) with symmetric capacity of I (W). S) to extreme channels of close capacity of one or zero.
  • Channel polarization consists of two phases: the channel combining phase and the channel splitting phase.
  • FIG. 5 illustrates the concept of channel combining and channel splitting for channel polarization.
  • Bits passing through the in-channel cannot transmit information, so it is better to transmit frozen bits, which are meaningless bits.
  • N 2 n and n is an integer greater than or equal to 0.
  • n 1 means the first level of regression where two independent copies of W 1 combine together.
  • Combining the two copies yields channel W 2 : X 2 ⁇ Y 2 .
  • the transitional probability of this new channel W 2 can be expressed by the following equation.
  • channel W 2 Once the channel W 2 is obtained, a single copy of channel W 4 can be obtained by combining two copies of W 2 .
  • This regression can be represented by W 4 : X 4 ⁇ Y 4 with the next transition probability.
  • G N is a generator matrix of size N.
  • G 2 corresponds to the base matrix F shown in FIG. 4 (b).
  • G 4 may be represented by the following matrix.
  • x N 1 u N 1 G N.
  • x N 1 ⁇ x 1 , ..., x N ⁇
  • u N 1 ⁇ u 1 , ..., u N ⁇ .
  • each B-DMC may be expressed in a recursive form. That is, G N may be expressed by the following equation.
  • R N first expands to Basic-2. The bit-reversing interleaver may not be included in the transmitting end. The relationship of equation (6) is shown in FIG.
  • FIG. 6 illustrates N-th level channel combining for polar code.
  • Channel splitting may be expressed as a channel transition probability as shown in the following equation.
  • channels ⁇ W N (i) ⁇ are polarized in the following sense.
  • indices of I (W N (i) ) ⁇ (1- ⁇ , 1] as N goes to infinity through a power of 2
  • the fraction of i ⁇ ⁇ 1, ..., N ⁇ goes to I (W)
  • the fraction of I (W N (i) ) ⁇ [0, ⁇ ) goes to 1-I (W). Therefore, if N ⁇ ⁇ , the channels are completely noisy or are freely polarized in noise, and these channels are exactly known at the transmitting end. Thus, it is possible to fix bad channels and to send the unsolidified bits on the good channels.
  • the channel becomes a noisy or noisy channel for a specific input bit.
  • the equivalent channel capacity for a particular input bit is divided by 0 or I (W).
  • An input of a polar encoder is divided into a bit channel to which information data is mapped and a bit channel not to it.
  • input bit channels may be divided into a noiseless channel and a noise channel as the codeword of the polar code becomes infinity. Therefore, by allocating information to a noiseless bit channel, channel capacity can be obtained.
  • the reliability of the input bit channel is calculated and the data bits are allocated in that order.
  • a bit channel to which data bits are allocated is referred to as a good bit channel.
  • a good bit channel is an input bit channel to which data bits are mapped.
  • the bit channel to which data is not mapped is called a frozen bit channel, and encoding is performed by inputting a known value (eg, 0) to the frozen bit channel. Any value known to the transmitter and receiver can be mapped to the frozen bit channel.
  • a codeword bit (ie, output bit) location corresponding to an input bit location that is not assigned to an information bit may be punctured.
  • the decoding method of the polar code is a successive cancellation (SC) decoding method.
  • SC decoding is a method of obtaining a channel transition probability and calculating a likelihood ratio (LLR) for an input bit.
  • the channel transition probability may be calculated in a recursive manner by using a characteristic in which the channel combining and channel splitting processes are recursive.
  • the LLR value can also be calculated in a recursive fashion.
  • u 1 ) for the input bit u i can be obtained as follows.
  • u 1 i is divided into an odd index and an even index, It can be expressed as u 1, o i , u 1, e i .
  • the channel transition probability may be expressed as the following equations.
  • the polar decoder retrieves the information and generates an estimate u ⁇ N 1 of u N 1 with values known to the polar code (eg, received bits, frozen bits, etc.).
  • LLR is defined as follows.
  • LLR can be calculated recursively as follows.
  • LLR L (1) 1 (y i ) W (y i
  • L (1) 1 (y i ) is the soft information observed from the channel.
  • d min (C) min i ⁇ I 2 wt (i) .
  • SC List (SCL) decoding is an extension of the basic SC decoder.
  • the L decoding paths are considered simultaneously in each stage of decoding.
  • L is an integer.
  • the list-L decoding algorithm is an algorithm that simultaneously tracks L paths in the decoding process.
  • FIG. 7 illustrates the evolution of decoding paths in the List-L decoding process.
  • the number of bits to be determined is n and not all bits are frozen.
  • CRC aided SCL decoding is SCL decoding using CRC, which improves the performance of the polar code.
  • CRC assisted SCL decoding aims to detect an error-free path while checking a cyclic redundancy check (CRC) code for each path at a receiver.
  • the SCL decoder outputs candidate sequences to the CRC detector which feeds back the check result to aid in codeword determination.
  • CRC cyclic redundancy check
  • SCL decoding or CRC assisted SCL decoding is more complex than SC algorithm, but has the advantage of superior decoding performance.
  • List-X decoding algorithm for polar codes, see 'I. Tal and A. Vardy, "List decoding of polar codes," in Proc. IEEE Int. Symp. Inf. Theory, pp. 1-5, Jul. 2011 '.
  • Polar code has the disadvantage that the code design is independent of the channel, so that there is no flexibility in the mobile fading channels, and since it is a relatively recently introduced code, it is not yet mature and is only limitedly applied.
  • the polar coding proposed up to now is not defined in many applications. Accordingly, the present invention is to propose a polar coding method suitable for a wireless communication system.
  • C (W i ) is the capacity of channel W i , which corresponds to the reliability of the channels that the input bits of the polar code will experience. If the channel capacities corresponding to the input bit positions of the polar code are as shown in FIG. 8, the reliability of the input bit positions can be ranked as shown in FIG. 8. In this case, in order to transmit data at the code rate 1/2, the transmitter transmits the four bits constituting the data to four input bit positions having a high channel capacity among eight input bit positions of the polar code. Input bit positions u 4 , u 6 , u 7 and u 4 of input bit positions u 1 to u 8 of 8 ) and frozen the remaining input bit positions.
  • the generator matrix G 8 corresponding to the polar code of FIG. 8 is as follows. The generator matrix G 8 may be obtained based on Equation 6.
  • the input bit positions indicated by u 1 to u 8 in FIG. 8 correspond one-to-one to rows from the lowest row to the highest row of G 8 .
  • an input bit corresponding to u 8 affects all output coded bits.
  • the input bit corresponding to u 1 only affects y 1 (ie, x 1 ) of the output coded bits.
  • Equation 12 when the binary-input source bits u 1 to u 8 and G 8 are multiplied, a row that causes the corresponding input bit to appear in all the output bits is represented by all elements of the rows of G 8 . Lowest row [1, 1, 1, 1, 1, 1, 1].
  • a row that causes the corresponding binary-input source bit to appear in only one output bit is a row where one element of the rows of G 8 is 1, that is, the row weight is 1 [1, 0, 0, 0 , 0, 0, 0, 0].
  • a row having a row weight of 2 reflects the input bits corresponding to the rows in the two output bits. Referring to FIG. 8) and (12, u 1 ⁇ u 8 corresponds one-to-one to the rows of the G 8, u 1 ⁇ input position u. 8, that is, to distinguish between the input position to the rows of the G 8 Bit indexes may be given.
  • bit indices are sequentially assigned from N to N-1, starting from the highest row having the smallest row weight, for the N input bits to G N.
  • the input position of u 1 that is, to be a bit index 0 given to the first row of the G 8
  • the input of u 8-position that is, the bits in the last row of G 8 index 7 Is given.
  • bit indices are used to indicate the input positions of the polar code, they may be allocated differently. For example, bit indexes 0 to N-1 may be allocated starting from the lowest row having the largest row weight.
  • bit indices may distinguish input or output positions of the polar code.
  • a sequence obtained by arranging in ascending or descending order of reliability of bit positions is referred to as a bit index sequence. That is, the bit index sequence indicates the reliability of the input or output bit positions of the polar code in ascending or descending order.
  • the transmitter inputs information bits into highly reliable input bits based on the input bit index sequence and performs encoding using a polar code
  • the receiving apparatus allocates information bits using the same or corresponding input bit index sequence.
  • the input bit sequence is predetermined so that the information bit (s) can be assigned to the input bit position (s) of high reliability.
  • the present invention proposes a rate matching technique utilizing the same.
  • FIG. 10 conceptually illustrates an iterative scheme and a puncturing scheme used in an IEEE 802.11n series system, which is a wireless communication system with an LTE / LTE-A system.
  • FIG. 10 conceptually illustrates the selection order of the bit (s) to be repeated for rate matching and the selection order of the bit (s) to be punctured.
  • a low density parity check (LDPC) code is used for channel coding.
  • An order in which iteration for rate matching is performed and puncturing is performed on a bit sequence coded by the LDPC code. The order is reversed as shown in FIG.
  • the end bit that is the least significant bit (LSB) among the bits of the output sequence is excluded from the transmission target.
  • the punctuation for rate matching is repeatedly transmitted from the first bit, which is the most significant bit (MSB) of bits of the output sequence. If the total amount of radio resources used for transmission of the output sequence is larger than the entire output sequence is repeated by a positive integer multiple, the output sequence is cyclically repeated from the beginning of the output sequence.
  • the present invention proposes a rate matching method in which the order of selecting the bit (s) to be repeated and the order of selecting the bit (s) to be punctured are the same.
  • FIG. 11 conceptually illustrates an iterative method and a puncturing method according to the present invention.
  • FIG. 11 conceptually illustrates the bit (s) selection order to be repeated and the bit (s) selection order to be punctured according to the present invention.
  • bit selection order for repetition and the bit selection order for puncturing the same according to the purpose of use (eg, BLER performance).
  • 11A shows puncturing in descending order from the most significant bit of the output bit sequence when puncturing is to be performed on the output bit sequence (that is, when the number of bits that can be transmitted is smaller than the number of output bits of the encoder).
  • 11B illustrates puncturing in ascending order from the least significant bit of the output bit sequence when puncturing is to be performed on an output bit sequence, and when iteration is to be performed on the output bit sequence. It illustrates a rate matching method of performing repetition in ascending order from the least significant bit.
  • 8 shows a connection between input bits included in each coded bit. Since x 8 contains only u 8 , it only affects the performance for u 8 . On the other hand, x 1 is connected to all input bits, which affects the performance of all input bits.
  • the puncturing on the output bit may have the following characteristics according to the puncturing method.
  • 8 x from punctured from the coded bit reliability to low reliability bits of the input are connected to a high input-bit is punctured sequentially.
  • the reliability order of the input bit indices is ⁇ u 8 , u 7 , x 6 , x 4 , x 5 , x 3 , x 2 , x 1 ⁇ in descending order
  • x 8 , x 7 , x 6 The puncturing may be performed in the order of x 4 , x 5 ,... That is, the input bit index sequence arranged in descending order based on the reliability may be the same as the output bit index sequence listing the order of the output bit index punctured.
  • bit index sequence according to a bit-reversal scheme such as a quasi-uniform puncturing (QUP) algorithm may be utilized as a sequence indicating an order in which output bits of a polar code are punctured.
  • Bit-reversal is an algorithm that reverses the order of the most significant bit (MSB) and the least significant bit (LSB).
  • MSB most significant bit
  • LSB least significant bit
  • the decoder of the receiving apparatus uses another coded bit even if the corresponding coded bit is not transmitted.
  • the corresponding input bits of the untransmitted coded bits may be recovered.
  • Method 2 Puncture from x 1 : This is a method of using the opposite (input bit) index order from Method 1.
  • they are punctured sequentially from coded bits connected to input bits of low reliability.
  • the input bit index sequence arranged in ascending order based on the reliability and the output bit index sequence listing the order of the output bit index punctured may be the same.
  • the output bits associated with the various input bits contain information of the various input bits coupled with them, but the input bits in the coded bits can act as interference.
  • Method 2 may puncture from coded bit (s) with high interference between input bits or from coded bit (s) with low reliability input bits. Method 2 may have the effect of lowering interference of the frozen bit with each input bit, in particular with the information bit.
  • Repeating the output bits for rate matching can also have features similar to puncturing.
  • bit-reversal scheme such as a QUP algorithm may be utilized.
  • polar code the more reliable input bits are connected to more coded bits than the lower input bits.
  • Method a repeats from the output bit (s) corresponding to the high-reliability input bit (s), thus allowing the high-reliability input bits to be recovered better, due to the iteration over the coded bits connected to the high-reliability input bits. Since the reliability of the corresponding input bit (s) can be further increased, the performance of other bits that interfere with the input bits having high reliability can be improved.
  • Method b Repeat from x 1 : This is the opposite of (a) index order.
  • index order In other words, in ascending order of reliability of the input bits, they are punctured sequentially from coded bits connected to input bits of low reliability.
  • the input bit index sequence arranged in ascending order based on the reliability may be the same as the output bit index sequence enumerating the order of repeated output bit indexes.
  • Method b may repeat from coded bit (s) with high interference between input bits or from coded bit (s) with high reliability input bits.
  • Method b may improve the overall block error ratio (BLER) by improving performance for low reliability input bits.
  • BLER block error ratio
  • Method 1 and Method a have the same or similar purpose or effect
  • Method and Method b have the same or similar purpose or effect.
  • the order of repeat bit selection and puncturing selection for rate matching in a polar code is the same.
  • the bit index is repeated or punctured from the large output bit or the bit index is repeated or punctured from the small output bit can be determined differently depending on the purpose of use.
  • N 8 in polar for code output bits x 1 ⁇ x 8 of Figure 11 (a) and the FIG. 11 (b) in the x 1 located at the left side x 8 on the right side in each position
  • the rate matching of FIG. 11 (a) is determined to be used, and when the effects according to the method 1 and the method a are required, the rate matching of FIG. Can be arranged to use.
  • the puncturing by using a circular buffer such as performing a random puncturing (e. G., Implementation complexity surface
  • the iterative order and puncturing order may be applied to rate matching (rather than the same rate matching scheme) where the iteration order and puncturing order are the same.
  • mother code size is smaller than the desired coded bit size or if the bit size coded by the encoder is smaller than the transmit bit size that can be transmitted, iteration is applied to the coded bits. If the mother code size is larger than the desired coded bit size or if the bit size coded by the encoder is larger than the transmit bit size that can be transmitted, puncturing is performed on the coded bits.
  • FIG. 12 is a block diagram showing the components of the transmitter 10 and the receiver 20 for carrying out the present invention.
  • the transmitter 10 and the receiver 20 are radio frequency (RF) units 13 and 23 capable of transmitting or receiving radio signals carrying information and / or data, signals, messages, and the like, and in a wireless communication system.
  • the device is operatively connected to components such as the memory 12 and 22, the RF unit 13 and 23, and the memory 12 and 22, which store various types of information related to communication, and controls the components.
  • a processor (11, 21) configured to control the memory (12, 22) and / or the RF unit (13, 23), respectively, to perform at least one of the embodiments of the invention described above.
  • the memories 12 and 22 may store a program for processing and controlling the processors 11 and 21, and may temporarily store input / output information.
  • the memories 12 and 22 may be utilized as buffers.
  • the processors 11 and 21 typically control the overall operation of the various modules in the transmitter or receiver. In particular, the processors 11 and 21 may perform various control functions for carrying out the present invention.
  • the processors 11 and 21 may also be called controllers, microcontrollers, microprocessors, microcomputers, or the like.
  • the processors 11 and 21 may be implemented by hardware or firmware, software, or a combination thereof.
  • application specific integrated circuits ASICs
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • the firmware or software when implementing the present invention using firmware or software, may be configured to include a module, a procedure, or a function for performing the functions or operations of the present invention, and configured to perform the present invention.
  • the firmware or software may be provided in the processors 11 and 21 or stored in the memory 12 and 22 to be driven by the processors 11 and 21.
  • the processor 11 of the transmission apparatus 10 is predetermined from the processor 11 or a scheduler connected to the processor 11 and has a predetermined encoding and modulation on a signal and / or data to be transmitted to the outside. After performing the transmission to the RF unit 13. For example, the processor 11 converts the data sequence to be transmitted into K layers through demultiplexing, channel encoding, scrambling, and modulation.
  • the coded data string is also called a codeword and is equivalent to a transport block, which is a data block provided by the MAC layer.
  • One transport block (TB) is encoded into one codeword, and each codeword is transmitted to a receiving device in the form of one or more layers.
  • the RF unit 13 may include an oscillator for frequency upconversion.
  • the RF unit 13 may include N t transmit antennas, where N t is a positive integer of 1 or more.
  • the signal processing of the receiver 20 is the reverse of the signal processing of the transmitter 10.
  • the RF unit 23 of the receiving device 20 receives a radio signal transmitted by the transmitting device 10.
  • the RF unit 23 may include N r receive antennas, and the RF unit 23 frequency down-converts each of the signals received through the receive antennas to restore the baseband signal. .
  • the RF unit 23 may include an oscillator for frequency downconversion.
  • the processor 21 may decode and demodulate a radio signal received through a reception antenna to restore data originally transmitted by the transmission apparatus 10.
  • the RF units 13, 23 have one or more antennas.
  • the antenna transmits a signal processed by the RF units 13 and 23 to the outside under the control of the processors 11 and 21, or receives a radio signal from the outside to receive the RF unit 13. , 23).
  • Antennas are also called antenna ports.
  • Each antenna may correspond to one physical antenna or may be configured by a combination of more than one physical antenna elements.
  • the signal transmitted from each antenna can no longer be decomposed by the receiver 20.
  • a reference signal (RS) transmitted in correspondence with the corresponding antenna defines the antenna as viewed from the perspective of the receiver 20, and whether the channel is a single radio channel from one physical antenna or includes the antenna.
  • RS reference signal
  • the receiver 20 enables channel estimation for the antenna. That is, the antenna is defined such that a channel carrying a symbol on the antenna can be derived from the channel through which another symbol on the same antenna is delivered.
  • the antenna In the case of an RF unit that supports a multi-input multi-output (MIMO) function for transmitting and receiving data using a plurality of antennas, two or more antennas may be connected.
  • MIMO multi-input multi-output
  • the transmitter 10 may be configured to include a polar encoder according to the present invention
  • the receiver 20 may be configured to include a polar decoder according to the present invention.
  • processor 11 of transmitter 10 may be configured to perform polar encoding according to the present invention
  • processor 21 of receiver 20 is configured to perform polar decoding according to the present invention.
  • the processor 11 of the transmitter 10 may apply rate matching to the output bit sequence of the polar code, that is, the output bit sequence of the polar encoder.
  • the processor 11 may be configured to apply a direction in which repetition for rate matching is performed and a direction in which puncturing for rate matching is performed with respect to the output bit sequence.
  • the processor 11 may generate a first output bit sequence having a length N by encoding the input information using a polar code having a mother code size N.
  • the processor unit rate-matches the first output bit sequence if the number of transmission bits M and the mother code size N are different, and transmits the second output bit sequence obtained by rate matching the first input sequence. To control.
  • the second output bit sequence may correspond to a sequence in which some or all of the first output bit sequence is added to the first output bit sequence.
  • the processor 11 further transmits MN bits in a specific order of bits of the first output bit sequence together with the first output bit sequence, that is, in a sequence direction, when M> N.
  • the RF unit 13 can be controlled to If M ⁇ N, the second output bit sequence may correspond to a sequence in which some of the first output bit sequences are excluded. That is, if M> N, the processor 11 is configured to exclude NM bits in the same order as the specific order of the first output bit sequence, that is, in the same direction, and to transmit the remaining M bits.
  • the RF unit 13 may be controlled.
  • the RF unit 23 of the receiving device 20 receives a signal from the transmitting device 10 and transmits the signal to the processor 21 of the receiving device 20.
  • the processor 21 restores the original signal by decoding the received signal using a polar code having a mother code size N. Since the processor 21 knows the punctured bit portion and the repeated bit portion since the processor 21 knows the specific order used by the transmission apparatus 10, the processor 21 may provide information about the punctured bit portion or the repeated bit portion. It can be used to decode the received signal.
  • Embodiments of the present invention may be used in a base station or user equipment or other equipment in a wireless communication system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Dans un système de communication sans fil, un dispositif de transmission effectue une adaptation de débit par rapport à la séquence de bits de sortie d'un code polaire. Dans l'adaptation de débit de la présente invention, l'ordre des bits à poinçonner et l'ordre des bits à répéter par rapport à la séquence de bits de sortie sont les mêmes.
PCT/KR2018/001960 2017-02-17 2018-02-14 Procédé de transmission d'informations et dispositif de transmission WO2018151545A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762460737P 2017-02-17 2017-02-17
US62/460,737 2017-02-17

Publications (1)

Publication Number Publication Date
WO2018151545A1 true WO2018151545A1 (fr) 2018-08-23

Family

ID=63169534

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/001960 WO2018151545A1 (fr) 2017-02-17 2018-02-14 Procédé de transmission d'informations et dispositif de transmission

Country Status (1)

Country Link
WO (1) WO2018151545A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343121A (zh) * 2020-02-11 2020-06-26 北京邮电大学 极化多载波序号调制系统的信号发送、接收方法和装置
CN111343122A (zh) * 2020-02-11 2020-06-26 北京邮电大学 极化多载波正交序号调制系统的编、解码方法和装置

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015026148A1 (fr) * 2013-08-20 2015-02-26 엘지전자 주식회사 Procédé de transmission de données à l'aide d'un codage polaire dans un système d'accès sans fil

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015026148A1 (fr) * 2013-08-20 2015-02-26 엘지전자 주식회사 Procédé de transmission de données à l'aide d'un codage polaire dans un système d'accès sans fil

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: "Tradeoffs in Polar coding for control channels", RI-1702713, 3GPP TSG RAN WG1 MEETING #88, 7 February 2017 (2017-02-07), Athens, Greece, XP051209860 *
INTERDIGITAL COMMUNICATIONS: "Repetition and shortening for polar codes", R1-1702355, 3GPP TSG RAN WG1 MEETING #88, 7 February 2017 (2017-02-07), XP051209509 *
MEDIATEK INC.: "Polar Code Size and Rate-Matching Design for NR Control Channels", RI-1702735, 3GPP TSG RAN WG1 MEETING #88, 7 February 2017 (2017-02-07), Athens, Greece, XP051209882 *
NTT DOCOMO: "Discussion on construction of Polar codes", RI-1702850, 3GPP TSG RAN WG1 MEETING #88, 7 February 2017 (2017-02-07), Athens, Greece, XP051209882 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343121A (zh) * 2020-02-11 2020-06-26 北京邮电大学 极化多载波序号调制系统的信号发送、接收方法和装置
CN111343122A (zh) * 2020-02-11 2020-06-26 北京邮电大学 极化多载波正交序号调制系统的编、解码方法和装置
CN111343121B (zh) * 2020-02-11 2021-05-11 北京邮电大学 极化多载波序号调制系统的信号发送、接收方法和装置

Similar Documents

Publication Publication Date Title
KR102031098B1 (ko) Pbch 전송 방법 및 전송 장치, 및 pbch 수신 방법 및 수신 장치
WO2018174672A2 (fr) Procédé de réception de signaux descendants et équipement d'utilisateur et procédé de transmission de signaux descendants et station de base
WO2018231026A1 (fr) Procédé et appareil destinés à la transmission d'informations
WO2019194635A1 (fr) Appareil et procédé de codage et de décodage au moyen d'un code polaire dans un système de communication sans fil et dans un système de diffusion
RU2435297C2 (ru) Способы и устройство для вычисления crc для множества кодовых блоков в системе связи
US11139836B2 (en) Information transmission method and transmission device, and information reception method and reception device
WO2018151555A1 (fr) Procédé de transmission d'informations, et dispositif de transmission
WO2019139412A1 (fr) Procédé et appareil de transmission d'informations et procédé et appareil de réception d'informations
WO2017018859A1 (fr) Procédé et appareil de codage de canal et de décodage de canal dans un système de communication sans fil
WO2017023079A1 (fr) Procédé de détermination de bits de données en codage polaire, et dispositif associé
US11343018B2 (en) Polar code interleaving processing method and apparatus
WO2018143772A1 (fr) Procédé de transmission de blocs de transport et dispositif de transmission
WO2019098689A1 (fr) Procédé et appareil pour effectuer un codage et un décodage dans un système de communication sans fil
WO2018143773A1 (fr) Procédé de transmission d'informations et dispositif de transmission
WO2018151545A1 (fr) Procédé de transmission d'informations et dispositif de transmission
WO2018128367A1 (fr) Procédé de codage de canal utilisant un code polaire et terminal
KR102570190B1 (ko) 무선 통신 시스템에서 폴라 코드에 기반한 정보 전송 방법 및 이를 위한 장치
KR20250052372A (ko) 인코딩을 수행하는 방법, 통신 기기, 프로세싱 장치, 및 저장 매체
WO2024147363A1 (fr) Procédé, dispositif de communication, dispositif de traitement et support de stockage pour effectuer un codage et procédé et dispositif de communication pour effectuer un décodage
WO2025018457A1 (fr) Procédé, dispositif de communication, dispositif de traitement et support de stockage permettant de transmettre un bloc d'informations, et procédé, dispositif de communication, dispositif de traitement et support de stockage përmettant de recevoir un bloc d'informations
WO2024147389A1 (fr) Procédé, dispositif de communication, dispositif de traitement et support de stockage permettant d'effectuer un décodage
WO2022260469A1 (fr) Procédé, dispositif de communication, dispositif de traitement et support de stockage permettant d'effectuer un codage de canal et procédé et dispositif de communication permettant d'effectuer un décodage de canal
CN119817040A (zh) 发送信息块的方法、通信装置、处理装置和存储介质及接收信息块的方法、通信装置、处理装置和存储介质
WO2024228412A1 (fr) Procédé, dispositif de communication, dispositif de traitement et support de stockage pour émettre un bloc d'informations, et procédé, dispositif de communication, dispositif de traitement et support de stockage pour recevoir un bloc d'informations
WO2023038304A1 (fr) Procédé et dispositif d'émission ou de réception de signal dans un système de communication

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

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

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载