WO2019042370A1 - Procédé et dispositif de transmission de données - Google Patents

Procédé et dispositif de transmission de données Download PDF

Info

Publication number
WO2019042370A1
WO2019042370A1 PCT/CN2018/103305 CN2018103305W WO2019042370A1 WO 2019042370 A1 WO2019042370 A1 WO 2019042370A1 CN 2018103305 W CN2018103305 W CN 2018103305W WO 2019042370 A1 WO2019042370 A1 WO 2019042370A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
bits
group
sequence
bit sequence
Prior art date
Application number
PCT/CN2018/103305
Other languages
English (en)
Chinese (zh)
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 WO2019042370A1 publication Critical patent/WO2019042370A1/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
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a data transmission method and apparatus.
  • Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication.
  • Industry-leading codes include Polar (Polarization) codes and Low Density Parity Check (LDPC) codes.
  • the Polar code is the first channel coding method that can theoretically be said to "reach" the channel capacity.
  • the Polar code is a linear block code whose generating matrix is G N and its encoding process is Is a binary line vector of length N (ie code length);
  • B N is an N ⁇ N transposed matrix, such as a bit reverse transposed matrix;
  • the multiplied by the generator matrix G N gives the encoded bits, and the process of multiplication is the process of encoding.
  • LDPC code is a kind of linear block code with sparse check matrix. It not only has good performance close to Shannon limit, but also has low decoding complexity and flexible structure.
  • the fifth generation, 5G has a good application in coding the data channel of the Enhanced Mobile Broadband (eMBB) service in the mobile communication system.
  • the encoding process of the LDPC code is: according to the number K of information bits to be encoded and the parity check matrix H corresponding to the Quasi-Cyclic Low Density Parity Check (QC-LDPC) code based on the base matrix structure, to be coded
  • the information bits are encoded to obtain the encoded bits.
  • FIG. 1 is a schematic diagram of an LDPC check matrix in which the positions of system bits, punctured bits, padding bits, parity bits, and extended parity bits are respectively shown in FIG. 1, and the positions of black squares have non-zero values.
  • the white position indicates that the position value is a 0 matrix.
  • the length of the coded mother code of the LDPC code is an integer multiple of Z
  • Z is the size of the cyclic shift matrix.
  • the bits are rate matched, and the rate matching methods of the Polar code and the LDPC code are punctured and shortened.
  • the encoded bits need to be interleaved before modulation, and the bits are scattered as much as possible to counter the decoding failure caused by packet loss caused by channel fading.
  • An existing interleaving and rate matching process of a Polar code and an LDPC code is as follows: first, the K pieces of information to be encoded are subjected to polar or LDPC encoding to obtain a coded bit having a length of N, and the encoded bit having a length of N is performed. Rate matching, obtain a rate matched bit sequence of length M, and then interleave the rate matched bit sequence.
  • rate matching and interleaving are performed first, and each time a Hybrid Automatic Repeat reQuest (HARQ) retransmission or repeated transmission is performed, the rate matching + interleaving operation needs to be performed again.
  • the delay is larger.
  • the present application provides a data transmission method and apparatus, which does not need to perform multiple rate matching and interleaving each time for performing HARQ retransmission or repeated transmission, and reduces transmission delay.
  • the present application provides a data transmission method, including: encoding an information bit to be encoded to obtain a coded bit sequence of length N, the coded bit sequence includes a G group bit sequence, and the G group bit sequence is according to a preset rule. Divided into G, N is a positive integer, each group of bit sequences are interleaved to obtain a G group interleaved bit sequence, G group interleaved bit sequences are stored in the order of the corresponding G group bit sequence, from the stored In the G-interleaved bit sequence, P bits are sequentially read as bits to be transmitted, and P is a positive integer.
  • the encoded bit group is interleaved, and the interleaved bit sequence is stored in the order of the corresponding grouped bit sequence, and a corresponding number of bits are read according to the number of bits to be transmitted during transmission.
  • Transmitted bits for rate matching, so that only interleaving and storing the interleaved bit sequence before the first transmission, the stored bits can be used directly every time HARQ retransmission or repeated transmission is performed, without multiple rate matching And interleaving to reduce transmission delay.
  • the G-interleaved bit sequences are sequentially stored in the circular buffer in the order of the corresponding G-group bit sequences.
  • the cyclic buffer is used to facilitate HARQ retransmission or repeated transmission, for example, K bits of N bits are transmitted for the first time, and when the cyclic buffer is used, when the HARQ retransmission or repeated transmission is performed, the Kth +1 bit is used as a starting point to transmit a required number of bits, that is, a coded bit that is not transmitted when the first transmission is transmitted, so that the equivalent code rate after HARQ retransmission or repeated transmission is lower than the code rate at the time of first transmission, Additional coding gain improves decoding performance.
  • a set of bit sequences in the G group bit sequence is to divide the encoded bit sequence according to a preset rule, and cross-order and sort the bits in at least two sets of bit sequences in the divided bit sequence. It is obtained that at least two sets of bit sequences are at least two sets of bit sequences whose reliability is greater than a first threshold and less than a second threshold, or at least two sets of bit sequences are adjacent at least two sets of bit sequences.
  • the bits with similar reliability are scattered, which is equivalent to performing one interleaving, so as to obtain a better interleaving effect.
  • the preset rule is to group according to the bit types included in the encoded bit sequence, and each type corresponds to a set of bit sequences.
  • P bits are sequentially read from the stored G-group interleaved bit sequence as bits to be transmitted, including: the first bit in the interleaved bit sequence corresponding to the first systematic bit As a starting point, P bits are sequentially read from the stored G-group interleaved bit sequence as bits to be transmitted.
  • P bits are sequentially read from the stored G-group interleaved bit sequences as bits to be transmitted, including: The first bit in the interleaved bit sequence is a starting point, and P bits are sequentially read from the stored G-group interleaved bit sequence as bits to be transmitted.
  • the preset rule is: grouping in bit order; or, according to the reliability sequence in the encoding process; or, in reverse order of bits Sequential grouping.
  • the present application provides a data transmission apparatus, including: an encoding module, configured to encode a coded information bit to obtain a coded bit sequence of length N, and the coded bit sequence includes a G group bit sequence, and a G group bit
  • the sequence is divided according to a preset rule, G and N are positive integers
  • the interleaving module is configured to respectively interleave each group of bit sequences to obtain a bit sequence of the G group interleaved, and the bit sequence of the G group interleaved is corresponding to G
  • the sequence of the group bit sequence is stored
  • the reading module is configured to sequentially read P bits from the stored G group interleaved bit sequence as bits to be transmitted, and P is a positive integer.
  • the G-interleaved bit sequences are sequentially stored in the circular buffer in the order of the corresponding G-group bit sequences.
  • a group of bit sequences in the G group bit sequence is to divide the coded bit sequence according to a preset rule, and the bit sequence in the division will be And at least two sets of bit sequences are at least two sets of bit sequences whose reliability is greater than a first threshold and less than a second threshold, or at least two sets of bit sequences are adjacent. At least two sets of bit sequences.
  • the preset rule is to group according to the bit types included in the encoded bit sequence, and each type corresponds to a set of bit sequences.
  • the reading module is configured to: sequentially read P pieces from the stored G group interleaved bit sequence starting from the first bit in the interleaved bit sequence corresponding to the first systematic bit The bit is the bit to be transmitted.
  • the reading module when the encoding information bit is encoded in the manner of Polar encoding, the reading module is configured to: start from the first bit in the first group of interleaved bit sequences, from the stored G group. P bits are sequentially read in the interleaved bit sequence as bits to be transmitted.
  • the preset rule is: grouping in bit order; or, according to the reliability sequence in the encoding process; or, in reverse order of bits Sequential grouping.
  • the present application provides a data transmission method, including: performing de-rate matching on information bits to be decoded, and obtaining a de-rate matched bit sequence of length N, and the bit sequence includes a G-group bit sequence after de-rate matching, G
  • the group bit sequence is divided according to a preset rule, G and N are positive integers, and each group of bit sequences is deinterleaved to obtain a bit sequence of the G group deinterleaved, and bits of the bit sequence deinterleaved by the G group are formed.
  • the sequence is decoded.
  • the data transmission method provided by the third aspect performs de-rate matching on the information bits to be decoded.
  • the bit sequence includes a G-group bit sequence, and each group of bit sequences is deinterleaved to obtain a G-group deinterleaved.
  • the bit sequence decodes the bit sequence composed of the de-interleaved bit sequences of the G group, so that the coding only needs to interleave and store the interleaved bit sequence before the first transmission, and perform HARQ retransmission or repeated transmission each time.
  • the stored bits can be used directly without multiple rate matching and interleaving, reducing transmission delay.
  • a set of bit sequences in the G group bit sequence is to divide the bit sequence after the de-rate matching according to a preset rule, and to deinterlerate bits in at least two groups of bit sequences in the divided bit sequence.
  • the at least two sets of bit sequences are at least two sets of bit sequences whose reliability is greater than the first threshold and less than the second threshold, or at least two sets of bit sequences are adjacent at least two sets of bit sequences.
  • the preset rule is the bit sequence included in the de-rate matching. Bit type grouping, each type corresponding to a set of bit sequences.
  • the preset rule is: grouping according to bit order; or, according to the decoding process
  • the reliability sequence is grouped; or, grouped in order of the bit reverse order.
  • the present application provides a data transmission apparatus, including: a de-rate matching module, configured to perform rate de-matching on information bits to be decoded, to obtain a de-rate matched bit sequence of length N, and a rate-matched bit sequence
  • the G group bit sequence is included, and the G group bit sequence is divided according to a preset rule, and G and N are positive integers
  • the deinterleaving module is configured to deinterleave each group of bit sequences separately to obtain a G group deinterleaved bit sequence.
  • a decoding module configured to decode the bit sequence composed of the G-deinterleaved bit sequence.
  • a set of bit sequences in the G group bit sequence is to divide the bit sequence after the de-rate matching according to a preset rule, and to deinterlerate bits in at least two groups of bit sequences in the divided bit sequence.
  • the at least two sets of bit sequences are at least two sets of bit sequences whose reliability is greater than the first threshold and less than the second threshold, or at least two sets of bit sequences are adjacent at least two sets of bit sequences.
  • the preset rule is the bit sequence included in the de-rate matching. Bit type grouping, each type corresponding to a set of bit sequences.
  • the preset rule is: grouping according to bit order; or, according to the decoding process
  • the reliability sequence is grouped; or, grouped in order of the bit reverse order.
  • the application provides a data transmission apparatus, including: a memory and a processor;
  • the memory is used to store program instructions
  • the processor is configured to invoke a program instruction in the memory to perform the data transmission method in any one of the possible aspects of the first aspect and the first aspect or the third aspect and the third aspect.
  • the present application provides a readable storage medium having a computer program stored therein, and when the at least one processor of the data transmission device executes the computer program, the data transmission device performs the first aspect and the first aspect A data transmission method in any of the possible designs or any of the third and third aspects of the possible design.
  • the application provides a program product, the program product comprising a computer program stored in a readable storage medium.
  • At least one processor of the data transfer device can read the computer program from a readable storage medium, the at least one processor executing the computer program to cause the data transfer device to implement the first aspect and any one of the possible aspects of the first aspect or the third Aspects and third aspect of any of the possible data transmission methods in the design.
  • the present application provides a data transmission device for performing the data transmission method in any of the possible aspects of the first aspect and the first aspect or the third aspect and the third aspect.
  • 1 is a schematic diagram of an LDPC check matrix
  • FIG. 2 is a schematic structural diagram of a system of a sending device and a receiving device provided by the present application
  • FIG. 3 is a schematic flow chart of a wireless communication system
  • FIG. 5 is a flowchart of an embodiment of a data transmission method provided by the present application.
  • FIG. 6 is a flowchart of an embodiment of a data transmission method provided by the present application.
  • FIG. 7 is a schematic structural diagram of an embodiment of a data transmission apparatus provided by the present application.
  • FIG. 8 is an interaction flowchart of an embodiment of a data transmission method provided by the present application.
  • FIG. 9a is a schematic diagram of performance simulation under a polar code additive white Gaussian noise channel
  • FIG. 9b is a schematic diagram of performance simulation under a polar code tact delay line-A100 fading channel
  • FIG. 10 is a schematic diagram of performance simulation of an LDPC code tact delay line-A100 fading channel
  • FIG. 11 is a schematic structural diagram of an embodiment of a data transmission apparatus provided by the present application.
  • FIG. 12 is a schematic diagram of another data transmission apparatus provided by the present application.
  • FIG. 13 is a schematic diagram of another data transmission apparatus provided by the present application.
  • FIG. 14 is a schematic structural diagram of the terminal device 800.
  • the embodiments of the present application can be applied to a wireless communication system.
  • the wireless communication system mentioned in the embodiments of the present application includes but is not limited to: Narrow Band-Internet of Things (NB-IoT), global mobile Global System for Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access (CDMA) 2000 System (Code Division Multiple Access, CDMA2000), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), and Next Generation 5G Mobile Communication System
  • eMBB Enhanced Mobile Broad Band
  • uRLLC Ultra-reliable and low-latency communications
  • mMTC Massive Machine-Type Communications
  • the communication device involved in the present application mainly includes a network device or a terminal device. If the sending device in the present application is a network device, the receiving device is a terminal device; if the sending device in the present application is a terminal device, the receiving device is a network device.
  • the terminal device includes, but is not limited to, a mobile station (MS, Mobile Station), a mobile terminal (Mobile Terminal), a mobile telephone (Mobile Telephone), a mobile phone (handset), and a portable device (portable equipment). And so on, the terminal device can communicate with one or more core networks via a Radio Access Network (RAN), for example, the terminal device can be a mobile phone (or "cellular" phone), with wireless communication Functional computers, etc., terminal devices can also be portable, pocket-sized, handheld, computer-integrated or in-vehicle mobile devices or devices.
  • RAN Radio Access Network
  • terminal devices can also be portable, pocket-sized, handheld, computer-integrated or in-vehicle mobile devices or devices.
  • the present application describes various embodiments in connection with a network device.
  • the network device may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, BTS) in the GSM system or CDMA, or may be a base station (NodeB, NB) in the WCDMA system, or may be An evolved base station (Evolutional Node B, eNB or eNodeB) in an LTE system, or the network device may be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network or a public land that is to be evolved in the future Network devices in the Public Network Mobile Network (PLMN), etc.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • NB base station
  • eNodeB evolved base station
  • PLMN Public Network Mobile Network
  • the wireless communication system of the present application may include a transmitting device and a receiving device.
  • FIG. 2 is a schematic diagram of a system architecture of a sending device and a receiving device provided by the present application.
  • the sending device is an encoding side, which may be used for Encoding and outputting the encoded information, the encoded information is transmitted to the decoding side on the channel;
  • the receiving device is the decoding side, and can be used to receive the encoded information sent by the transmitting device, and decode the encoded information.
  • FIG. 3 is a schematic flow chart of a wireless communication system.
  • the source is sequentially sent after source coding, channel coding, interleaving, rate matching, and digital modulation.
  • the destination is sequentially output by digital demodulation, deinterleaving and de-rate matching, channel decoding, and source decoding.
  • the channel coding code may use a Polar code or an LDPC code, and the data transmission method provided by the present application may be adopted for the interleaving and rate matching.
  • H denotes m b .Z ⁇ n b .
  • Z-size check matrix Z is an expansion factor, and its form can be expressed as:
  • a ij is the shift factor of the cyclic shift matrix
  • n b and m b are the number of columns and the number of rows of the base matrix
  • It is a cyclic shift matrix, which can be obtained by cyclically shifting the a ij bit of the unit matrix of I.
  • a ij ranges from -1 ⁇ a ij ⁇ Z
  • O defining Z ⁇ Z is P -1 .
  • H is a full rank matrix
  • each information bit position in the extended LDPC check matrix is used to place information bits; if K is not divisible by k b , ⁇ k b >K, then there will be (Z ⁇ k b -K) redundant information bit positions in the extended LDPC check matrix, which may be called padding bits, as shown in the LDPC check matrix diagram shown in FIG. 1 .
  • Gray columns non-integer columns
  • black boxes represent the above That is, the position has a non-zero value, and the white position indicates that the position value is a zero matrix.
  • the columns of the check matrix correspond to the bits of the coded output, which are generally divided into systematic bits and check bits.
  • the system bits can be further divided into puncturing bits, padding bits and other system bits.
  • the punctured bits correspond to the first two columns of the entire check matrix. You can see that the black parts of the two columns (that is, the parts with non-zero values) are more than the other columns, so these two columns are also called columns with large column weights. .
  • the padding bits are as described above, mainly for filling a certain fixed value such that the total number of systematic bits is an integer multiple of the spreading factor Z.
  • the check bits are further divided into two categories, wherein the columns in the check matrix corresponding to one type of check bits have substantially non-zero values on two diagonal lines, so these columns are also called double diagonal columns.
  • the parity bits corresponding to the double diagonal column are called parity bits; the columns in the parity matrix corresponding to the other type of parity bits have a non-zero value on a diagonal line, so these columns are Called a single diagonal column, the parity bits corresponding to a single diagonal column are called extended parity bits.
  • the present application provides a data transmission method, which implements interleaving and rate matching of a polar code or an LDPC code by means of packet interleaving and buffering, and only needs to interleave and store the interleaved bit sequence before the first transmission, according to the to be transmitted during transmission.
  • the number of bits reads the corresponding number of bits as the bits to be transmitted (for rate matching), and the stored bits can be directly used each time HARQ retransmission or repeated transmission is performed, without performing multiple rate matching and interleaving, reducing transmission time. Delay.
  • FIG. 4 is a flowchart of an embodiment of a data transmission method according to the present application. As shown in FIG. 4, the embodiment is described by using a sending device as an execution entity. The method in this embodiment may include:
  • the coded bit sequence includes a G group bit sequence, and the G group bit sequence is divided according to a preset rule, and G and N are positive integers.
  • the encoded bit sequence is divided into G group bit sequences according to a preset rule.
  • the preset rule is to group according to the bit types included in the coded bit sequence, and each type corresponds to a group of bit sequences.
  • the division of the encoded bit sequence has the following three options:
  • the bit type included in the encoded bit sequence is a puncturing bit, a first systematic bit, a parity bit corresponding to the double diagonal column, and a parity bit corresponding to the single diagonal column, and the first system bit is divided.
  • the group may be further divided into multiple groups. For example, the number of parity bits is large, and the parity bits may be divided into two groups of bit sequences.
  • the packets may be grouped according to a reliability sequence in the encoding process, for example, bits having similar reliability may be divided into one group, or may be grouped in order of bit reverse order. Other rule groupings may also be used, and this application does not limit this.
  • the divided G group bit sequence includes the same number of bits, which facilitates parallel synchronization for interleaving.
  • a group of bit sequences in the G group bit sequence is The encoded bit sequence is divided according to a preset rule, and the bits in the at least two sets of bit sequences in the divided bit sequence are cross-ordered and combined, and at least two sets of bit sequences are greater than the first threshold and less than the second threshold. At least two sets of bit sequences, or at least two sets of bit sequences are adjacent at least two sets of bit sequences.
  • bits in two sets of bit sequences with similar reliability in the divided bit sequence are cross-ordered and combined into a set of bit sequences, for example, a bit of a set of bit sequences
  • the index is (3, 4, 5, 6, 7, 8)
  • the other group contains the bit index (9, 10, 11, 12, 13, 14)
  • the two sets of bit sequences are cross-ordered and combined.
  • the index of the bit sequence is (3, 9, 4, 10, 5, 11, 6, 12, 7, 13, 8, 14).
  • the above operation means that at least two sets of bit sequences with similar reliability are cross-ordered and merged, and the bits with similar reliability are broken up, which is equivalent to performing one interleaving, so as to obtain a better interleaving effect.
  • S102 Interleave each group of bit sequences separately to obtain a G group interleaved bit sequence, and the G group interleaved bit sequences are stored in the order of the corresponding G group bit sequences.
  • the interleaving manner in which each group of bit sequences is separately interleaved may adopt an existing interleaving manner, such as random interleaving, or interleaving according to a pre-stored interleaving sequence (interleaving pattern), and the interleaving manners used for different groups of bit sequences may be the same. It can also be different.
  • the same interleaving manner is adopted for different group bit sequences, so that the required duration is the same, and the effectiveness of parallel processing of each interleaver can be guaranteed.
  • the interleaving is performed by using a packet.
  • the reliability of each subchannel is generally arranged in ascending or descending order, and the bits are frozen.
  • the reliability of the subchannel is the lowest, followed by the subchannel of the punctured bit or the truncated bit.
  • the subchannel of the information bit has the highest reliability, whether it is grouped in bit order or according to the reliability sequence in the encoding process, and the post-packet is interleaved.
  • Reliability is generally not disturbed, which is convenient for ensuring the accuracy of the transmitted information when performing rate matching before transmission. That is, important bits can be transmitted in front, and the importance between the bits is different. When it breaks up, important bits may not be transmitted.
  • interleaving can be performed in parallel, which shortens the processing time and improves efficiency.
  • the preset rule is to group according to the bit types included in the encoded bit sequence, and each type corresponds to a group of bit sequences, and is interleaved by means of a packet, and each group of the interleaving is performed.
  • the bit type is not disturbed, which is convenient for ensuring the accuracy of the transmitted information when performing rate matching before transmission.
  • interleaving can be performed in parallel, which shortens the processing time and improves efficiency.
  • P bits are sequentially read from the stored G-interleaved bit sequence as bits to be transmitted according to the number of bits P to be transmitted, so that a code length of an arbitrary length can be obtained.
  • the first bit in the interleaved bit sequence corresponding to the first system bit is used as a starting point, and the bit sequence after the G group is interleaved is sequentially read.
  • P bits are taken as bits to be transmitted.
  • the first systematic bit is a systematic bit other than the punctured bit, that is, the punctured bit is excluded during transmission to ensure the accuracy of the transmitted information.
  • the first bit in the first group of interleaved bit sequences is used as a starting point, and the P sequence is sequentially read from the stored G group interleaved bit sequence.
  • the bits are used as bits to be transmitted.
  • G-interleaved bit sequences are sequentially stored in the circular buffer in the order of the corresponding G-group bit sequences.
  • S103 is to sequentially read P bits from the cyclic buffer as bits to be transmitted.
  • a circular buffer By using a circular buffer, it is convenient to perform HARQ retransmission or repeated transmission, for example, to transmit K bits of N bits for the first time, and when using a cyclic buffer, when performing HARQ retransmission or repeated transmission, the K+1th bit is used as a starting point for transmission.
  • the required number of bits that is, the coded bits that are not transmitted when the first transmission is sent, so that the equivalent code rate after HARQ retransmission or repeated transmission is lower than the code rate at the time of first transmission, obtaining additional coding gain, and improving decoding Performance.
  • the data transmission method by interleaving the encoded bit packets, storing the interleaved bit sequences in the order of the corresponding post-packet bit sequences, and reading a corresponding number of bits according to the number of bits to be transmitted as the to-be-transmitted transmission. Bits (for rate matching), so that only interleaving and storing the interleaved bit sequence before the first transmission, the stored bits can be used directly each time HARQ retransmission or repeated transmission is performed, without multiple rate matching and Interleaving reduces transmission delay.
  • FIG. 5 is a flowchart of an embodiment of a data transmission method according to the present application.
  • the sending device is used as an execution entity, and the encoding mode is polar encoding.
  • the method in this embodiment may include:
  • S201 performing polar coding on the coded information bit u to obtain a coded bit sequence of length N, where the coded bit sequence includes four sets of bit sequences c1, c2, c3, and c4, and the four groups of bit sequences are in bit order or in accordance with the coding process.
  • the reliability sequence is divided, and each set of bit sequences contains N/4 bits.
  • S202 Cross-order the bits of c2 and c3 and combine them into one group.
  • the first bit in the first group of interleaved bit sequences d1 is used as a starting point, and P bits are sequentially read from the cyclic buffer as bits to be transmitted.
  • the polar coded bit sequences are grouped in bit order or according to the reliability sequence in the encoding process, and then the two sets of bit sequences are cross-ordered and combined into one group, and then each group of bit sequences is combined.
  • the interleaving is performed separately, and the interleaved bit sequence is stored in the circular buffer.
  • P bits are sequentially read from the circular buffer as the bits to be transmitted during transmission.
  • the interleaving reliability after grouping is generally not disturbed, which is convenient in Ensure the accuracy of the transmitted information when performing rate matching before transmission.
  • interleaving can be performed in parallel, shortening the duration and improving efficiency. Therefore, the stored bits can be directly used each time HARQ retransmission or repeated transmission is performed, without performing multiple rate matching and interleaving, and reducing the transmission delay.
  • FIG. 6 is a flowchart of an embodiment of a data transmission method according to the present application. As shown in FIG. 6, the embodiment is described by using a sending device as an execution entity, and the encoding mode is LDPC encoding.
  • the method in this embodiment may include:
  • S301 Perform LDPC encoding on the coded information bit S to obtain a coded bit sequence of length N.
  • the coded bit sequence includes four sets of bit sequences s1, s2, p1, and p2, and bit types of the four groups of bit sequences encoded by the LDPC code. Is divided.
  • FIG. 7 is a schematic diagram of a bit sequence grouping after encoding an LDPC code.
  • the grouping of the encoded bit sequence mainly includes three parts: a system bit s, a parity bit p1 corresponding to a double diagonal column, and a single pair.
  • the parity bit p2 corresponding to the corner column.
  • the system bit s is further divided into two parts: a system bit s1 corresponding to two columns of a large column in the check matrix, and other system bits s2 except s1.
  • p2 can be subdivided into two groups.
  • the interleaved bit sequences d1, d2, d4, and d5 are sequentially placed in a circular buffer, and the order is: d1, d2, d4, and d5.
  • each bit sequence is separately interleaved by LDPC coded bit sequence grouped by LDPC coded bit type, and the interleaved bit sequence is stored in a circular buffer, and is transmitted in s2 during transmission.
  • the first bit is the starting point, and P bits are sequentially read from the circular buffer as bits to be transmitted, and are interleaved by means of packets.
  • the bit types of each group are not disturbed, and the rate matching is performed before transmission. The accuracy of the information transmitted is guaranteed.
  • interleaving can be performed in parallel to shorten the duration and improve efficiency. Therefore, the stored bits can be directly used each time HARQ retransmission or repeated transmission is performed, without performing multiple rate matching and interleaving, and reducing the transmission delay.
  • the method shown in the foregoing embodiment is performed by using a transmitting device as an execution body.
  • the receiving device After receiving the information bits to be decoded, the receiving device (decoding side) performs the inverse of the transmitting device. process.
  • the method in this embodiment may include:
  • the transmitting device performs channel coding on the coded information bits.
  • bit sequence after the G group is interleaved is sequentially stored in the cyclic buffer in the order of the corresponding G group bit sequence. Description.
  • the sending device sequentially reads P bits from the circular buffer as bits to be transmitted, and P is a positive integer, and sends the to-be-transmitted bits to the receiving device.
  • the receiving device performs channel decoding on the received bit, and performs Cyclic Redundancy Check (CRC) on the data obtained by the channel decoding.
  • CRC Cyclic Redundancy Check
  • the channel decoding is an inverse process of channel coding
  • S403 may include:
  • the receiving device first performs de-rate matching to obtain a de-rate matched bit sequence of length N, and the de-rate matched bit sequence includes a G-group bit sequence, and the G-group bit sequence is divided according to a preset rule, where the preset is The rules are the same as the preset rules for the sending device.
  • the length of the bit sequence after the de-rate matching is the total number of the G-group interleaved bit sequences stored on the transmitting device side.
  • the division of the G-group bit sequence is the same as that of the transmitting device.
  • S4032 The receiving device deinterleaves each group of bit sequences in the G group bit sequence.
  • the deinterleaving method is an inverse process of the interleaving manner adopted by the transmitting device side.
  • the receiving device performs channel decoding on the deinterleaved bit sequence.
  • the receiving device sends the indication information of the channel decoding result to the sending device.
  • the transmitting device determines to perform HARQ retransmission or repeated transmission according to the indication information of the channel decoding result that is fed back.
  • the transmitting device performs HARQ retransmission or repeated transmission, and when the transmitting device performs HARQ retransmission, the P+1 bit may be used as a starting point from the circular buffer. P bits are sequentially read as bits to be transmitted for transmission.
  • FIG. 9a is a schematic diagram of performance simulation under the polar code additive white Gaussian noise channel (AWGN), and FIG. 9b is a polar code tact delay line (TDL).
  • a performance simulation diagram under the A100 fading channel, R is the code rate.
  • a 64-column row-column interleaver is used as the interleaver in FIG. 5, as shown in FIG. 9a and FIG. 9b, and the modulation mode is 64QAM (64 types).
  • line one is the performance when there is no interleaver
  • line 2 is the performance of the method of the present application. It can be seen that the method of the present application achieves the same error rate when compared with the non-interleaving method.
  • Low noise ratio provides performance gain in high-order modulation.
  • FIG. 10 is a schematic diagram of performance simulation of an LDPC code TDL-A100 fading channel.
  • a 64-column row-column interleaver is used as the interleaver in FIG. 5, as shown in FIG. 10, R is a code rate, in this embodiment.
  • the 64-column row-and-column interleaver is used as the interleaver in FIG. 6.
  • the modulation mode is 16QAM
  • the channel is the TDL-A100 fading channel
  • the line one is the performance without the interleaver
  • the line 2 is the method of the present application.
  • the performance of the present application can be seen that the method of the present application has a lower signal-to-noise ratio when compared to non-interleaving and achieves the same bit error rate, and can provide performance gain under high-order modulation.
  • FIG. 11 is a schematic structural diagram of an embodiment of a data transmission apparatus according to the present application.
  • the apparatus of this embodiment may include: an encoding module 11, an interleaving module 12, and a reading module 13, wherein the encoding module 11
  • the coded information bits are encoded to obtain a coded bit sequence of length N.
  • the coded bit sequence includes a G group bit sequence, and the G group bit sequence is divided according to a preset rule, G and N are positive integers, and the interleaving module 12 For respectively, each group of bit sequences is interleaved to obtain a G group interleaved bit sequence, the G group interleaved bit sequences are stored in the order of the corresponding G group bit sequences, and the reading module 13 is used to store the G groups.
  • P bits are sequentially read as bits to be transmitted, and P is a positive integer.
  • the G-interleaved bit sequence is sequentially stored in the circular buffer in the order of the corresponding G-group bit sequence.
  • the set of bit sequences in the G group bit sequence is to divide the encoded bit sequence according to a preset rule, and cross-order the bits in at least two groups of the bit sequence in the divided bit sequence, and at least two
  • the group bit sequence is at least two sets of bit sequences having a reliability greater than a first threshold and less than a second threshold, or at least two sets of bit sequences are adjacent at least two sets of bit sequences.
  • the preset rule is to group according to the bit types included in the encoded bit sequence, and each type corresponds to a set of bit sequences.
  • the reading module 13 is configured to: read, according to the first bit in the interleaved bit sequence corresponding to the first system bit, a P bit from the stored G group interleaved bit sequence. The bits transmitted.
  • the reading module 13 is configured to: start from the stored G group by using the first bit in the first group of interleaved bit sequences as a starting point P bits are sequentially read in the bit sequence as bits to be transmitted.
  • the preset rules are: grouping according to bit order; or, according to the reliability sequence in the encoding process; or grouping in reverse order of bits.
  • the device in this embodiment may be used to implement the technical solution of the method embodiment shown in FIG. 4 to FIG. 6.
  • the implementation principle and technical effects are similar, and details are not described herein again.
  • the application may divide the function module into the sending device according to the above method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the modules in the embodiments of the present application is schematic, and is only a logical function division. In actual implementation, there may be another division manner.
  • FIG. 12 is a schematic diagram of another data transmission apparatus provided by the present application.
  • the apparatus 700 includes:
  • the memory 701 is configured to store program instructions, and the memory may be a flash memory.
  • the processor 702 is configured to call and execute program instructions in the memory to implement various steps in the data transmission method shown in FIG. 4. For details, refer to the related description in the foregoing method embodiments.
  • FIG. 13 is a schematic diagram of another data transmission apparatus provided by the present application.
  • the memory 701 is integrated with the processor 702.
  • the data transmission apparatus of Figures 12 and 13 further includes a transceiver (not shown) for transceiving signals through the antenna.
  • the apparatus may be used to perform various steps and/or processes corresponding to the transmitting device in the above method embodiments.
  • FIG. 14 is a schematic structural diagram of the terminal device 800.
  • the terminal device 800 includes a processing device 804, which can be used to perform the data transmission method described in the embodiments of the present application.
  • the terminal device 800 can also include a power source 812 for providing power to various devices or circuits in the terminal device 800.
  • the terminal device 800 may further include an antenna 810 for transmitting uplink data output by the transceiver 808 through a wireless signal or outputting the received wireless signal to the transceiver 808.
  • the terminal device may further include one or more of an input unit 814, a display unit 816, an audio circuit 818, a camera 820, and a sensor 822, and the audio circuit 818 may include Speaker 8182 and microphone 8184, and the like.
  • the present application also provides a readable storage medium having a computer program stored therein, and when the at least one processor of the data transmission device executes the computer program, the data transmission device performs the data transmission provided by the various embodiments described above. method.
  • the application also provides a program product comprising a computer program stored in a readable storage medium.
  • At least one processor of the data transfer device can read the computer program from a readable storage medium, and the at least one processor executes the computer program such that the data transfer device implements the data transfer method provided by the various embodiments described above.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL), or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium, such as a floppy disk, a hard disk, a magnetic tape, an optical medium such as a DVD, or a semiconductor medium such as a Solid State Disk (SSD).
  • SSD Solid State Disk

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

L'invention concerne un procédé et un dispositif de transmission de données. Le procédé consiste : à coder des bits d'informations à coder pour obtenir une séquence de bits codée ayant une longueur N, la séquence de bits codés comprenant G groupes de séquences de bits, et les G groupes de séquences de bits étant divisés selon une règle prédéfinie, G et N étant des nombres entiers positifs ; à entrelacer respectivement chaque groupe de séquences de bits pour obtenir G groupes de séquences de bits entrelacés, les G groupes de séquences de bits entrelacés étant stockés dans l'ordre correspondant aux G groupes de séquences de bits ; et à lire successivement, à partir des G groupes stockés de séquences de bits entrelacées, P bits en tant que bits à transmettre, P étant un nombre entier positif. Ainsi, il suffit d'effectuer un entrelacement avant la première transmission et de stocker des séquences de bits entrelacées ; et les bits stockés peuvent être utilisés directement chaque fois qu'une retransmission HARQ ou une transmission répétée se produit, sans avoir besoin de multiples occurrences de correspondance de débit et d'entrelacement, ce qui réduit le retard de transmission.
PCT/CN2018/103305 2017-08-30 2018-08-30 Procédé et dispositif de transmission de données WO2019042370A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710764254.4A CN109428675B (zh) 2017-08-30 2017-08-30 数据传输方法及装置
CN201710764254.4 2017-08-30

Publications (1)

Publication Number Publication Date
WO2019042370A1 true WO2019042370A1 (fr) 2019-03-07

Family

ID=65504092

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/103305 WO2019042370A1 (fr) 2017-08-30 2018-08-30 Procédé et dispositif de transmission de données

Country Status (2)

Country Link
CN (1) CN109428675B (fr)
WO (1) WO2019042370A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111277367B (zh) * 2020-01-19 2022-09-30 无锡泽太微电子有限公司 编码方法、装置
CN114679241A (zh) * 2020-12-24 2022-06-28 华为技术有限公司 基于混合自动重传请求harq的通信方法和装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986584A (zh) * 2010-10-22 2011-03-16 中国科学院计算技术研究所 一种3gpp lte中的解速率匹配装置和方法
US20150358113A1 (en) * 2014-06-06 2015-12-10 Huawei Technologies Co., Ltd. System and Method for Forward Error Correction
CN106788456A (zh) * 2016-12-14 2017-05-31 电子科技大学 一种极化码编译码方法
US20170222754A1 (en) * 2016-01-28 2017-08-03 Lg Electronics Inc. Error correcting coding method based on cross-layer error correction with likelihood ratio and apparatus thereof
CN107786300A (zh) * 2016-08-26 2018-03-09 中兴通讯股份有限公司 一种数据发送方法及装置

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101378303B (zh) * 2007-08-31 2011-05-11 华为技术有限公司 重传低密度奇偶校验码的生成方法、处理方法和装置
CN101867443B (zh) * 2009-04-14 2015-05-20 中兴通讯股份有限公司 速率匹配方法和装置
CN105075163B (zh) * 2013-11-20 2019-02-05 华为技术有限公司 极化码的处理方法和设备
EP3113398B1 (fr) * 2014-03-19 2020-04-22 Huawei Technologies Co., Ltd. Procédé d'adaptation de débit de code polaire et dispositif d'adaptation de débit
EP3113387B1 (fr) * 2014-03-21 2019-05-22 Huawei Technologies Co., Ltd. Procédé d'adaptation de débit de code polaire et dispositif d'adaptation de débit
CA2972655C (fr) * 2014-03-24 2020-10-20 Huawei Technologies Co., Ltd. Procede de mise en correspondance de debits et appareil de mise en correspondance de debits pour des codes polaires
CN105337696B (zh) * 2015-10-08 2018-03-30 东南大学 基于分段crc校验的极化解码方法
CN106817195B (zh) * 2015-12-02 2020-04-21 华为技术有限公司 用于极化码的速率匹配的方法和装置
CN105743621B (zh) * 2016-02-02 2019-03-26 北京邮电大学 基于极化码的harq信号发送、接收方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986584A (zh) * 2010-10-22 2011-03-16 中国科学院计算技术研究所 一种3gpp lte中的解速率匹配装置和方法
US20150358113A1 (en) * 2014-06-06 2015-12-10 Huawei Technologies Co., Ltd. System and Method for Forward Error Correction
US20170222754A1 (en) * 2016-01-28 2017-08-03 Lg Electronics Inc. Error correcting coding method based on cross-layer error correction with likelihood ratio and apparatus thereof
CN107786300A (zh) * 2016-08-26 2018-03-09 中兴通讯股份有限公司 一种数据发送方法及装置
CN106788456A (zh) * 2016-12-14 2017-05-31 电子科技大学 一种极化码编译码方法

Also Published As

Publication number Publication date
CN109428675A (zh) 2019-03-05
CN109428675B (zh) 2022-05-24

Similar Documents

Publication Publication Date Title
US11689220B2 (en) Method and device for interleaving data
US11374591B2 (en) Apparatus and method for channel coding in communication system
CN109600194B (zh) Polar编码方法和编码装置、译码方法和译码装置
US11128401B2 (en) Method and apparatus for processing information, communications device, and communications system
WO2019158031A1 (fr) Procédé de codage, procédé de décodage, dispositif de codage, et dispositif de décodage
KR102338508B1 (ko) 고차 변조를 사용하는 통신 또는 방송 시스템에서 부호화/복호화 방법 및 장치
CN108631916B (zh) 极化Polar码的速率匹配方法和装置、通信装置
CA2968892A1 (fr) Procede et appareil d'adaptation de debit pour code polaire, et dispositif de communication sans fil
CN110663189B (zh) 用于极化编码的方法和装置
US20200244288A1 (en) Information transmission method and transmission device, and information reception method and reception device
CN111446969B (zh) 一种级联crc码的极化码编码方法及装置
US11343018B2 (en) Polar code interleaving processing method and apparatus
US20240030941A1 (en) Encoding and decoding method and apparatus
US11115052B2 (en) Information processing method and communications apparatus
US20200091934A1 (en) Information processing method and communications apparatus
WO2019042370A1 (fr) Procédé et dispositif de transmission de données
US20230224082A1 (en) Retransmission method and apparatus
EP3567767A1 (fr) Procédé et dispositif de traitement de données
US11088706B2 (en) Information processing method, apparatus, and communications device
Chen et al. Channel coding

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

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

Country of ref document: EP

Kind code of ref document: A1