WO2017193281A1 - 数据发送方法、数据接收方法及发送设备与接收设备 - Google Patents

数据发送方法、数据接收方法及发送设备与接收设备 Download PDF

Info

Publication number
WO2017193281A1
WO2017193281A1 PCT/CN2016/081553 CN2016081553W WO2017193281A1 WO 2017193281 A1 WO2017193281 A1 WO 2017193281A1 CN 2016081553 W CN2016081553 W CN 2016081553W WO 2017193281 A1 WO2017193281 A1 WO 2017193281A1
Authority
WO
WIPO (PCT)
Prior art keywords
codeword
bit
bits
decoding
merged
Prior art date
Application number
PCT/CN2016/081553
Other languages
English (en)
French (fr)
Inventor
马亮
魏岳军
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP16901236.6A priority Critical patent/EP3444984B1/en
Priority to CN201680085091.0A priority patent/CN109075911B/zh
Priority to JP2018559383A priority patent/JP2019515592A/ja
Priority to PCT/CN2016/081553 priority patent/WO2017193281A1/zh
Publication of WO2017193281A1 publication Critical patent/WO2017193281A1/zh
Priority to US16/183,187 priority patent/US10826651B2/en

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/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
    • H04L1/0058—Block-coded modulation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • H03M13/356—Unequal error protection [UEP]
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • 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/0041—Arrangements at the transmitter end
    • 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/0045—Arrangements at the receiver end
    • 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/007—Unequal error protection
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • 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]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • 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/1829—Arrangements specially adapted for the receiver end
    • H04L1/1835—Buffer management
    • H04L1/1845—Combining techniques, e.g. code combining
    • 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/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1893—Physical mapping arrangements

Definitions

  • the present application relates to the field of wireless communications, and in particular, to a data transmitting method, a data receiving method, and a transmitting device and a receiving device.
  • the polar code is the only coding scheme that can theoretically prove that the performance can reach the Shannon limit when the code length approaches infinity.
  • the polarization code has a specific codeword structure, which is continuously recursed by using the polarized channel unit.
  • the connection is such that the channel capacity corresponding to some bits in the codeword generated after encoding approaches 1 and the rest approaches 0. In this way, it is only necessary to place the information to be transmitted on the bit whose channel capacity is close to 1, and set the bit whose channel capacity is close to 0 to a fixed value, so that the performance close to the Shannon limit can be achieved.
  • HARQ hybrid automatic repeat request
  • the technology implements retransmission of codewords to improve the performance of wireless communication systems.
  • HARQ technology includes two schemes: casset combining (CC) and incremental redundancy (IR).
  • CC casset combining
  • IR incremental redundancy
  • the retransmission codeword is identical to the initial transmission codeword, and there is only one redundancy version, and the receiving end performs soft combining and decoding on the retransmission codeword and the initial transmission codeword; in the IR scheme, each The secondary retransmission includes different incremental redundancy check bits.
  • the two received codewords are first combined, and then decoded as a codeword with a lower code rate. Since the IR scheme can obtain the energy gain and the coding gain at the same time, in actual use, the IR scheme is mostly used to implement HARQ.
  • the initial codeword and the retransmission codeword can be generated by puncturing a part of the bits in the codeword, that is, the codeword can be punched according to a predetermined rule, and the codeword will be punched. The remaining bits after the hole are used as the initial codeword, and the punctured bits are used as the retransmission codeword.
  • the coding scheme is a polarization code
  • puncturing the codeword affects the polarization channel capacity distribution of the codeword, resulting in the information in the initial transmission codeword generated by the puncturing that is not in the channel capacity close to 1. In the bit, the decoding performance of the initial codeword is poor. If the performance of the initial codeword is guaranteed to be optimal, then the codeword obtained after adding the punctured bit will also be due to the polarized channel. The capacity distribution changes to cause poor decoding performance.
  • the present application provides a data transmission method, a data receiving method, and a transmitting device and a receiving device, to solve the problem that the decoding performance of the codeword is poor when the coding mode of the codeword is a polarization code by using the existing HARQ technology.
  • the present application provides a data sending method, the method comprising: transmitting a polarization coded first codeword, where the first codeword includes n first information bits carrying user data, The first information bit includes the first n bits of the first codeword in which the channel capacity is sorted from high to low; after the first codeword is transmitted, the polarization coded second codeword is transmitted, The second codeword includes p pieces of second information bits carrying user data, and each of the second information bits is identical to user data carried by a uniquely corresponding first retransmission bit, wherein the second information The bit includes the first p bits of the channel code capacity sorted from high to low in the second codeword, and the first retransmission bit includes the first p bits of the first information bit in which the channel capacity is sorted from low to high, n is A positive integer, p is a positive integer not greater than n.
  • the bit used to carry the user data has the largest bit capacity of the codeword channel.
  • the receiving device performs the combined decoding on the codeword, the encoding gain can be increased, and the energy gain can be increased, so that the decoding performance of the codeword can be improved.
  • the method further includes: after the sending of the ith codeword is complete, sending an i+1th codeword, where the i+1th codeword is Containing qth i+1th information bits carrying user data, and each of the i+1th information bits is identical to the user data carried by a unique corresponding i-th retransmission bit, wherein the i+1th
  • the information bits include the first q bits of the channel capacity of the i+1th codeword sorted from high to low, and the ith retransmitted bits include the channel capacity of the i-th merged codeword carrying the user data from low to high.
  • the bits for carrying the user data in the retransmission codewords are the bits with the largest channel capacity of the codeword channel, and the initial transmission code is sent in this manner.
  • Word and retransmission codeword which can increase the coding gain and increase the energy gain, thereby improving the The decoding performance of the codeword.
  • the first codeword is equal in length to the second codeword, and the i+1th codeword is The length of the i-th code word is twice.
  • the receiving device can conveniently determine the code rate used for decoding when decoding.
  • the frozen bits in the first codeword to the (i+1)th codeword each carry a predetermined value, where the freeze The bits are bits other than the information bits in each of the i+1 code words of the first codeword to the i+1th codeword.
  • the receiving device can directly determine the decoding result of the frozen bits in each codeword, thereby reducing the bits that the receiving device needs to decode, and improving the decoding efficiency of the receiving device.
  • the method before the sending the (i+1)th codeword, the method further includes: performing channel estimation on the (i+1)th merged codeword to obtain a polarization channel capacity distribution of the (i+1)th merged codeword, wherein the (i+1)th codeword is merged from the i+1th codeword to the first codeword in descending order; and the first information bit is selected Up to the first q bits of the i-th information bits whose channel capacity is sorted from low to high as the i-th target bit; selecting the first q bits of the i+1 code words whose channel capacity is sorted from high to low as the i+1th Information bits; copying user data carried in each of the i-th target bits into corresponding i+1th information bits; setting data carried by the frozen bits in the i+1th codeword to a predetermined value
  • the frozen bit in the i+1th codeword is other bits in the i+1th codeword except the
  • the codeword can be generated before each retransmission codeword is sent, so that the sending device can avoid unnecessary retransmission codewords and reduce the data processing capacity of the sending device.
  • the method before the sending the first codeword, the method further includes: performing channel estimation on the k+1th merged codeword, thereby obtaining a a polarization channel capacity distribution of the k+1th merged codeword, wherein the k+1th merge codeword is formed by combining the k+1th codeword to the first codeword in descending order; The n bits of the k+1th merged codeword having the highest channel capacity; the data carried by the bit to be copied in the k+1th codeword to the second codeword are sequentially copied to the target bit corresponding to the bit to be copied, wherein The bit to be copied in the jth codeword includes a bit carrying the user data in the jth codeword, and the target bit includes a channel capacity of the j-1th combined codeword except the bit carrying the user data.
  • the jth, j 2, 3, . . . , k+1; setting data carried by the frozen bit in the k+1th merged codeword to a predetermined value, wherein the k+th
  • the frozen bit in the 1 combined codeword is the other bits of the k+1th merged codeword except the one carrying the user data.
  • the sending device can generate all retransmission codewords before sending the initial codewords, thereby improving the retransmission efficiency, and by using the generation method, the values of p and q are naturally generated, so that Avoid affecting the decoding performance of codewords due to improper values of p and q.
  • the present application further provides a data receiving method, the method comprising: receiving a polarization coded first codeword, where the first codeword includes a first information bit carrying user data, The first information bit includes a first n bits of a channel capacity sorted from high to low in the codeword; a first codeword is decoded using a first code rate; and a decoding of the first codeword is performed Receiving an error, receiving a second codeword, wherein the second codeword includes p second information bits carrying user data, and each of the second information bits and a corresponding first retransmission bit The user data to be carried is the same, the second information bit includes the first p bits of the channel capacity ranked from highest to lowest in the codeword, and the first retransmission bit includes the channel capacity in the first information bit.
  • the bit used to carry the user data has the largest bit capacity of the codeword channel.
  • the receiving device performs the combined decoding on the codeword, the encoding gain can be increased, and the energy gain can be increased, so that the decoding performance of the codeword can be improved.
  • the method further includes: if an error occurs in decoding the i-th codeword, receiving an i+1th codeword, the i++
  • the first codeword includes q i+1th information bits carrying user data, and each of the i+1th information bits is the same as the user data carried by a corresponding i-th retransmission bit, wherein
  • the i+1 information bit includes the first q bits of the channel capacity in the codeword sorted from high to low, and the ith retransmitted bit includes the channel capacity of the i-th merged codeword carrying the user data from low to high.
  • the second code rate is twice the first code rate.
  • the i+1th code rate is twice the ith code rate.
  • the decoding of the (i+1)th merge codeword includes: if the bit to be decoded is the first Decoding a bit, the decoding result of the first to-be-decoded bit is determined according to a decoding result of the second to-be-decoded bit, wherein the first to-be-decoded bit is one of an i-th information bit, The second to-be-decoded bit is one of an i+1th information bit to a k+1th information bit, and the first to-be-decoded bit is the same as the data carried by the second to-be-decoded bit.
  • determining, by the decoding result of the second to-be-decoded bit, the decoding result of the first to-be-decoded bit includes
  • the decoding mode used for decoding the (i+1)th merged codeword is serial cancellation decoding
  • the decoding result of the second to-be-decoded bit is used as the translation of the first to-be-decoded bit. Code result.
  • the decoding result of the decoded bit is determined by using the decoding result of the decoded bit, thereby speeding up the decoding speed.
  • determining, by the decoding result of the second to-be-decoded bit, the decoding result of the first to-be-decoded bit includes : when the decoding method used for decoding the i+1th combined codeword is list decoding, selecting the same decision branch of the surviving path generated in the decoding process of the second to-be-decoded bit, and calculating each A branch metric of the same decision branch, thereby determining a decoding result of the first to-be-decoded bit.
  • the decoding result of the bits to be decoded can be determined by using the decoding information of the decoded bits when using the list decoding and decoding, thereby speeding up the decoding speed.
  • the present application further provides a data transmitting device, the device comprising means for performing the method steps of the first aspect and the various implementations of the first aspect.
  • the present application further provides a data receiving device, the device comprising means for performing the method steps of the second aspect and the various implementations of the second aspect.
  • the present application further provides another data transmitting device, the device comprising a processor and a transceiver, wherein the processing is used to generate a polarization coded first codeword and a polarization coded second a codeword; the transceiver is configured to send the polarization coded second codeword after the first codeword is transmitted.
  • the processor is further used for the (i+1)th The codeword; the transceiver is further configured to send the i+1th codeword after the sending of the ith codeword is completed.
  • the present application further provides another data receiving device, where the receiving device includes a processor and a transceiver, and the transceiver is configured to receive a polarization coded first codeword, and the processor uses Decoding a first codeword using a first code rate; the transceiver further configured to receive a second codeword if an error occurs in decoding the first codeword, the processor The second combined codeword is decoded using a second code rate, wherein the second combined codeword is generated by combining the second codeword and the first codeword.
  • the receiving device includes a processor and a transceiver, and the transceiver is configured to receive a polarization coded first codeword, and the processor uses Decoding a first codeword using a first code rate; the transceiver further configured to receive a second codeword if an error occurs in decoding the first codeword, the processor The second combined codeword is decoded using a second code rate, wherein the second combined codeword is generated by combining the second codeword and the first codeword
  • the transceiver is further configured to receive an (i+1)th codeword if an error occurs in decoding the i-th codeword; And decoding, by using the (i+1)th code rate, the i+1th merged codeword, wherein the i+1th merged codeword is used by the (i+1)th codeword and the first code Word merge generation.
  • the present application further provides a data transmission system, which may include at least one data transmitting device provided by the fifth aspect, and at least one data receiving device provided by the sixth aspect.
  • the present application further provides a storage medium, where the storage medium may store a program, and when the program is executed, some or all of the method steps in each embodiment of the data sending method or the data receiving method provided by the present application may be implemented.
  • the data sending method, the data receiving method and the device, the device and the system provided by the present application can be used to carry user data in the initial codeword and the retransmission codeword when using the HARQ technology for data retransmission.
  • the bit is the bit with the largest capacity of the codeword channel, so that the receiving device can increase the coding gain and increase the energy gain when the codeword is combined and decoded, so that the decoding performance of the codeword can be improved.
  • FIG. 3 is another schematic structural diagram of a codeword of the present application.
  • FIG. 4 is a schematic flowchart of an embodiment of a data sending method according to the present application.
  • FIG. 5 is a schematic structural diagram of a third merged codeword of the present application.
  • FIG. 6 is a schematic diagram of an information bit distribution of a third merged codeword of the present application.
  • FIG. 7 is a schematic diagram of a correspondence relationship of user data replication in a third merged codeword of the present application.
  • FIG. 8 is a schematic flowchart diagram of an embodiment of a data receiving method according to the present application.
  • FIG. 9 is a schematic structural diagram of a second merged codeword of the present application.
  • FIG. 10 is a schematic structural diagram of a third merged codeword of the present application.
  • FIG. 11 is a schematic structural diagram of an embodiment of a data sending device according to the present application.
  • FIG. 12 is a schematic structural diagram of an embodiment of a data receiving device according to the present application.
  • FIG. 13 is a schematic structural diagram of an embodiment of a wireless communication device according to the present application.
  • the sending device and the receiving device may be wireless communication devices such as base stations and terminals that need to perform data transmission in a wireless transmission manner.
  • User data refers to the data sent by the sending device to the receiving device, and also the data that needs to be received by the receiving device.
  • the code word may be composed of at least one bit, and the channel capacity of the bit in the codeword may refer to that the data carried by the bit does not generate an error during the transmission of the codeword.
  • the value of the channel capacity can usually be between 0 and 1. The higher the channel capacity of the bit, the less likely it is that a transmission error will occur when using this bit for user data transmission.
  • k may be the maximum number of retransmissions of HARQ.
  • k may be a positive integer not less than 1.
  • the k+1 codewords may be used as a group to send the same group of user data
  • the first codeword is the initial codeword of the HARQ
  • the i-th codeword is the i-1th weight.
  • the length of the second codeword may also be m bits, and when the length of the i+1 codeword is It can be twice the length of the i-th codeword.
  • the value of m can be a positive integer. For example, when the value of m is 8, that is, the length of the first codeword is 8 bits, the length of the second codeword may also be 8 bits, and the length of the third codeword may be 16 bits.
  • the first codeword may include n first information bits for carrying user data, where n is a positive integer not greater than m. For example, when the length of the first codeword is 8 bits, the first codeword may be included in the packet. There are 6 first information bits for carrying information to be transmitted. As shown in FIG. 1, in the 0th to 7th bits, when the bit having the highest channel capacity is from 0th to 5th bits, the first information bit may include the 0th to 5th bits.
  • the second information bits carrying the user data may be included, and each of the second information bits is identical to the user data carried by the uniquely corresponding first retransmission bit, wherein
  • the second information bit includes the first p bits of the channel code capacity sorted from high to low in the second codeword, and the first retransmission bit includes the first p bits of the first information bit sorted from low to high in channel capacity.
  • p is a positive integer not greater than n.
  • the value of p can be set in advance, or can be determined according to the way the codeword is generated.
  • the channel capacity of each of the second information bits may be higher than the channel capacity of each of the first retransmission bits.
  • the second codeword may include two second information bits, and the first information bit also includes two retransmission bits.
  • the first information bit also includes two retransmission bits.
  • the thirteenth bit can be used as the second information bit corresponding to the third bit, and the user data carried by the thirteenth bit and the third bit can be carried.
  • the eighth bit is the second information bit corresponding to the fifth bit, and the user data carried by the eighth bit and the fifth bit is the same.
  • the i+1th codeword includes q i+1th information bits carrying user data, and each of the i-th information bits is identical to the user data carried by a unique corresponding i-th retransmission bit,
  • the i+1 information bit includes the first q bits of the channel capacity in the i+1th codeword sorted from high to low, and the ith retransmitted bit includes the channel capacity of the ith merged codeword carrying the user data from the low Up to the top q bits of the high order, the ith merge codeword is formed by combining the ith codeword to the first codeword, where q is a positive integer greater than n.
  • the third codeword may include one third information bit, and the second merged bit segment includes one second retransmission bit, wherein the second merged codeword is the second codeword. And combining with the first codeword, wherein the third information bit may be one bit with the highest channel capacity in the third code word, and the second retransmission bit may be the second information bit and the second information bit 1 information bit has the lowest channel capacity of 1 bit. As shown in FIG.
  • the bit with the highest channel capacity in the third codeword is the 17th bit, and the bit having the lowest channel capacity among the first information bit and the second information bit is the third bit, then
  • the 17th bit is the third information bit, and the third bit is the second retransmission bit, so that the user data carried by the 15th bit and the 3rd bit can be made the same.
  • the bits may be referred to as frozen bits, and the frozen bits may carry the same predetermined value.
  • the value of all frozen bits may be 1, or the value of the frozen bits may be 0.
  • the merged codeword is formed by combining at least one codeword
  • the first merged codeword is the first codeword
  • the i+1th merged codeword is composed of the i+1th codeword and the first i merged codewords are combined.
  • the first combined codeword is the first codeword
  • the second merged codeword is formed by combining the second codeword and the first codeword
  • the third merged codeword is formed by the third codeword and the second merged codeword. Merged together.
  • the merging referred to in the present application refers to connecting the code words end to end to form a new code word.
  • FIG. 4 it is a schematic flowchart of an embodiment of a data sending method according to the present application. This data transmission method is performed by the transmitting device.
  • Step 401 transmitting the polarization coded first codeword.
  • the transmitting device may only generate the first codeword in advance before transmitting the first codeword.
  • the transmitting device may first select n bits having the highest channel capacity in the first codeword as the first information bits, and then write user data of length n bits into the n information bits.
  • the transmitting device may also set the data carried by the frozen bits to a predetermined value.
  • the transmitting device may perform polarization coding on the first codeword and transmit the polarization coded first codeword to the receiving device.
  • Step 402 After the first codeword is sent, send the polarization coded second codeword.
  • the transmitting device may regenerate and transmit the polarization coded second codeword.
  • the first p bits of the first information bit ranked from low to high in the first information bit may be selected as the first target bit, and the channel capacity in the second codeword is selected from high to low.
  • p bits are used as the second information bits.
  • the transmitting device may copy the user data of the bearer in the first target bit to the corresponding In the second information bit.
  • p can be a preset value.
  • the transmitting device may also set the data carried by the frozen bit in the second code word to a predetermined value. After the content carried by each bit of the second codeword is determined, the transmitting device may perform polarization coding on the second codeword and transmit the polarization coded second codeword to the receiving device.
  • Step 403 After the sending of the ith codeword is completed, sending the i+1th codeword.
  • the polarization-coded i+1th codeword is regenerated and transmitted.
  • the transmitting device may first select the first q bits of the i-th information bit sorted from low to high as the i-th target bit, and select the channel capacity in the i+1th codeword from The top q bits of the high to low order are used as the i+1th information bits. After determining the correspondence between the ith target bit and the (i+1)th information bit, so that each ith target bit uniquely corresponds to an i+1th information bit, the transmitting device may use the bearer in the ith target bit. The data is copied into the corresponding i+1th information bit. Where q is a preset value, and when the values of i are different, the values of q may also be different.
  • the transmitting device may also set the data carried by the frozen bit in the i+1th codeword to be predetermined. value. After the content carried by each bit of the i+1th codeword is determined, the transmitting device may perform polarization encoding on the i+1th codeword, and send the polarization encoded i+1th codeword to the receiving device.
  • the transmitting device may also generate the first codeword to the k+1th codeword before transmitting the first codeword.
  • the structure of the third merged codeword can be as shown in FIG.
  • the transmitting device may perform channel estimation on the k+1th codeword, thereby obtaining a polarization channel capacity distribution of the k+1th merged codeword.
  • the transmitting device may then write the user data into the n-th bit with the highest channel capacity in the k+1th merged codeword; and sequentially copy the data carried by the bit to be copied in the k+1th codeword to the second codeword.
  • the sending device may further set the data carried by the frozen bit in the k+1th merged codeword to a predetermined value, where the frozen bit in the k+1th merged codeword is the k+1th merge Other bits in the codeword except the first to the i+1th information bits.
  • the third merged codeword is as shown in FIG. 5, if the length of the user data is 6 bits, and the channel capacity estimation determines that the 6 bits having the highest channel capacity in the third merged codeword are 0. Bits, 1st bit, 2nd bit, 4th bit, 8th bit, and 16th bit, then user data can be first written into the 6 bits, information bits in the 1st codeword to the 3rd codeword
  • the distribution diagram can be as shown in Figure 6.
  • the 16th bit Since the 16th bit is located in the 3rd codeword and carries user data, it is necessary to copy the data carried by the 16th bit into the target bit of the 2nd merged codeword, if the second merged code is determined by channel capacity estimation.
  • the 13th bit of the bit with the highest channel capacity except the 0th bit, the 1st bit, the 2nd bit, the 4th bit, and the 8th bit is removed from the word, and the user data carried in the 16th bit can be copied to the 13 bits.
  • the 13th bit and the 8th bit carry user data, it is necessary to copy the data carried by the 13th bit and the 8th bit into the target bit of the first combined codeword, and the first combined codeword is The first codeword. If it is determined by the channel capacity estimation that the bit with the highest channel capacity except the 0th bit, the 1st bit, the 2nd bit, and the 4th bit is removed from the second bit code word, the third bit and the fifth bit may be used. The user data carried by the 13 bits is correspondingly copied into the third bit, and the user data carried by the eighth bit is correspondingly copied into the fifth bit.
  • the correspondence in the user data replication process can be as shown in 7.
  • the transmitting device sets data of the sixth bit to the seventh bit, the ninth bit to the twelfth bit, the 14th bit to the fifteenth bit, and the frozen bit of the 17th bit to the 31st bit. Is the predetermined value.
  • the value of p and the value of q need not be set in advance, and the values of p and q can be made smaller, which simplifies the decoding process of the codeword by the receiving device.
  • the sending device may perform step 401 to step 403 again; if the receiving device correctly receives the user Data, then the transmitting device can transmit other user data.
  • the bit used to carry the user data is the bit with the largest channel capacity of the codeword. So that the receiving device can increase the coding gain and increase the energy gain when combining and decoding the codewords. Thereby, the decoding performance of the codeword can be improved.
  • FIG. 8 is a schematic flowchart diagram of an embodiment of a decoding method according to the present application.
  • the lengths of the first to k+1th codewords and the contents carried by the respective bits can be referred to the foregoing, and are not described herein again.
  • Step 801 Receive a polarization coded first codeword.
  • the receiving device may first receive the polarization coded first codeword.
  • Step 802 decoding the first codeword using the first code rate.
  • the receiving device After receiving the first codeword, the receiving device can decode the first codeword using the first code rate.
  • each bit of the user data can be directly obtained from the decoding result of the first codeword, and then according to the user data.
  • the arrangement in the first codeword of each bit restores the user data.
  • the receiving device can decode each bit of the first codeword bit by bit in order from high bit to low bit. For example, when the structure of the first codeword is as shown in FIG. 1, the receiving device can decode each bit of the first codeword bit by bit from the 7th bit to the 0th bit.
  • the receiving device can acquire the user data from the decoded result obtained by decoding the first codeword.
  • Step 803 If an error occurs in decoding the first codeword, the second codeword is received.
  • the receiving device may transmit a retransmission request to the transmitting device when an error occurs in decoding the first codeword to cause the decoding of the first codeword. After receiving the retransmission request, the transmitting device transmits the second codeword to the receiving device.
  • Step 804 decoding the second combined codeword using the second code rate.
  • the second merged codeword is generated by combining the second codeword and the first codeword. Since the length of the second merged codeword is longer than the first codeword, the second code rate needs to be higher than the first code rate. In general, the ratio of the second code rate to the first code rate may be The ratio of the bit length to the second combined codeword and the first codeword.
  • the receiving device can decode each bit of the second combined codeword bit by bit in order from high bit to low bit. For example, when the structure of the second merged codeword is as shown in FIG. 9, the receiving device can decode each bit of the first codeword bit by bit from the 15th bit to the 0th bit. If the decoding of the second merged codeword is successful, the receiving device may acquire the user data from the decoded result obtained by decoding the second merged codeword.
  • the receiving device can directly use the decoding result of the thirteenth bit as the page number result of the third bit, or the decoding process of the thirteenth bit is determined.
  • the decoding result of the third bit is similar; similarly, the receiving device may determine the decoding result of the fifth bit according to the decoding process or the translation result of the eighth bit.
  • Step 805 If an error occurs in decoding the i-th codeword, the i+1th codeword is received.
  • the receiving device may send a retransmission request to the transmitting device. After receiving the retransmission request, the transmitting device sends the i+1th codeword to the receiving device.
  • Step 806 Decode the i+1th merged codeword using the i+1th code rate.
  • the i+i merged codeword is generated by combining the i+1th codeword and the ith codeword. Since the length of the (i+1)th merged codeword is longer than the i-th codeword, the i+1th code rate needs to be higher than the i-th code rate. In general, the i+1th code rate and the first The ratio of the i code rate may be a ratio of the bit length between the i+1th combined code word and the i th code word.
  • the receiving device may decode each bit of the (i+1)th merged codeword bit by bit in order from high bit to low bit.
  • the structure of the third merged codeword can be as shown in FIG. 10, and the receiving device can decode each bit of the third merged codeword bit by bit from the 31st bit to the 0th bit.
  • the decoding of the first to-be-decoded bit is determined according to the decoding result of the second to-be-decoded bit. a result, wherein the first to-be-decoded bit is one of an i-th information bit, and the second to-be-decoded bit is one of an i+1th information bit to a k+1th information bit, and the The first to-be-decoded bit is the same as the data carried by the second to-be-decoded bit.
  • the decoding mode used for decoding the i+1th merged codeword is serial cancellation decoding
  • the receiving device has completed the second to-be-translated Code bit decoding, since the second to-be-decoded bit is the same as the user data carried by the first to-be-decoded bit, the decoding result of the second to-be-decoded bit can be directly used as the first to-be-decoded Bit decoding result.
  • the decoding result of the 16th bit can be used as the 13th bit.
  • the decoding result is obtained, and the decoding result of the 13th bit and the 16th bit can be used as the decoding result of the 3rd bit.
  • the receiving device has decoded the second to-be-decoded bit and generated a surviving path, but does not determine the second to-be-decoded bit according to the branching metric of the decision branch of the surviving path.
  • the receiving device can select the same decision of the surviving path generated during the decoding of the second to-be-decoded bit. Branching, and separately calculating the branch metrics of each of the same decision branches, thereby simultaneously determining the decoding result of the second to-be-decoded bit and the first to-be-decoded bit.
  • the branch metrics of each of the same decision branches are respectively calculated. Thereby, the decoding results of the 16th bit, the 13th bit, and the 3rd bit are simultaneously determined.
  • Step 807 Acquire user data from the decoding result obtained by decoding the i+1th merged codeword.
  • the receiving device may obtain the user data from the decoded result obtained by decoding the (i+1)th merged codeword.
  • the bit used to carry the user data is the bit with the largest channel capacity of the codeword. Therefore, when the receiving device performs the combined decoding on the codeword, the coding gain can be increased, and the energy gain can be increased, so that the decoding performance of the codeword can be improved.
  • FIG. 11 a schematic structural diagram of an embodiment of a data sending device of the present application is shown.
  • the transmitting device may include a first codeword generating unit 1101 and a transmitting unit 1102.
  • the first codeword generating unit 1101 is configured to generate a first codeword and a second codeword, where the first codeword includes n first information bits carrying user data, and the first information
  • the bit includes the first n bits of the first codeword sorted from high to low
  • the second codeword includes p second information bits carrying user data, and each of the second information
  • the bit is the same as the user data carried by the only corresponding first retransmission bit, wherein the second information bit includes the first p bits of the channel capacity in the second codeword, the first retransmission, the first retransmission
  • the bit includes the first p bits of the first information bit in which the channel capacity is sorted from low to high, n is a positive integer, p is a positive integer not greater than n, and the first codeword and the second codeword are both Is a coded word after polarization encoding.
  • the transmitting unit 1102 is configured to send the first codeword, and after the first codeword is sent, send the second codeword.
  • the sending unit 1102 is further configured to send an i+1th codeword after the ith codeword is sent, where the i+1th codeword includes q i+s carrying user data. 1 information bit, and each of the i+1th The information bits are identical to the user data carried by a unique corresponding i-th retransmission bit, wherein the i+1th information bit includes the first q bits of the channel capacity of the i+1th codeword sorted from high to low.
  • the first codeword is equal in length to the second codeword, and the i+1th codeword is twice the length of the i-th codeword.
  • the frozen bits in the first codeword to the (i+1)th codeword may each carry a predetermined value, wherein the frozen bit is a bit other than the information bit in the first codeword to the i+1th codeword.
  • the apparatus further includes a second codeword generating unit, the second codeword The generating unit is configured to generate the i+1th codeword.
  • the second codeword generating unit includes: a first channel estimation subunit, configured to perform channel estimation on the (i+1)th merged codeword to obtain a polarization channel capacity distribution of the (i+1)th merged codeword, where The i+1th merged codeword is formed by combining the i+1th codeword and the first codeword in descending order; the target bit selection subunit is configured to select a channel capacity from the first information bit to the ith information bit from a low The first q bits to the high order are used as the i-th target bit; the information bit selection sub-unit is used to select the first q bits of the channel capacity of the i+1 code word sorted from high to low as the i+1th information bit a first copying subunit, configured to copy user data carried in each of the ith target bits into a corresponding i+1th information bit; a first setting subunit, configured to use the i+th The data carried by the frozen bit in the 1 code word is set to a predetermined value, and the frozen bit in the (
  • the first to k+1th codewords may also be generated by the first codeword generating unit 1101.
  • the first codeword generating unit 1101 may include: a second channel estimating subunit for using the k+1th combining code Performing channel estimation on the word, thereby obtaining a polarization channel capacity distribution of the k+1th merged codeword, wherein the k+1th merged codeword is merged in descending order from the k+1th codeword to the first codeword a write subunit for writing user data into n bits of the k+1th merged codeword with the highest channel capacity; and a second copy subunit for sequentially placing the k+1th codeword to the first
  • the data carried by the bit to be copied in the 2 code words is copied to the target bit corresponding to the bit to be copied, wherein the bit to be copied in the jth code word includes the bit carrying the user data in the jth code word,
  • the target bit includes a bit having the highest channel capacity except for the bit carrying the user data in the j-1 merge codeword, j
  • a second setting subunit for The data carried by the frozen bit in the k+1th merged codeword is set to a predetermined value, wherein the frozen bit in the k+1th merged codeword is other bits in the k+1th merged codeword except for carrying user data.
  • FIG. 12 it is a schematic structural diagram of an embodiment of a data receiving device according to the present application.
  • the receiving device may include a receiving unit 1201, a decoding unit 1202, and an obtaining unit 1203.
  • the receiving unit 1201 is configured to receive the first codeword that is polarization-coded, where the first codeword includes a first information bit that carries user data, where the first information bit includes the The first n bits of the codeword in which the channel capacity is ordered from high to low;
  • the decoding unit 1202 is configured to decode the first codeword by using the first code rate, and the receiving unit 1201 is further configured to receive the second if an error occurs in decoding the first codeword.
  • a codeword wherein the second codeword includes p second information bits carrying user data, and each of the second information bits is identical to user data carried by a corresponding first retransmission bit
  • the second information bit includes the first p bits of the channel type in which the channel capacity is sorted from high to low, and the first retransmission bit includes the channel capacity of the first information bit before being sorted from low to high.
  • the decoding unit 1202 is further configured to decode the second combined codeword using the second code rate, wherein the second merge The codeword is generated by combining the second codeword with the first codeword, the second code rate is higher than the first code rate, and the obtaining unit 1203 is configured to perform the second merged codeword
  • the user data is obtained from the decoded result obtained by the decoding.
  • the receiving unit 1201 is further configured to: if an error occurs in decoding the ith codeword, receive an i+1th codeword, where the i+1th codeword includes q bearer user data
  • the i+1th information bit, and each of the i+1th information bits is identical to the user data carried by a corresponding ith retransmission bit, wherein the i+1th information bit includes the codeword
  • the unit 1202 is further configured to decode, by using the (i+1)th code rate, the i+1th merged codeword, where the (i+1)th codeword is from the (i+1)th codeword and the first The codeword is combined and generated; the obtaining unit 1203 is further configured to acquire user data from the decoding result obtained by decoding the (i+1)th merged codeword.
  • the decoding unit 1202 is configured to determine, when the bit to be decoded is the first to-be-decoded bit, the translation of the first to-be-decoded bit according to the decoding result of the second to-be-decoded bit. a code result, wherein the first to-be-decoded bit is one of an i-th information bit, and the second to-be-decoded bit is an i+1th information bit to a k+1th One of the information bits, and the first to-be-decoded bit is the same as the data carried by the second to-be-decoded bit.
  • the decoding unit 1202 may be configured to: when the decoding mode used for decoding the (i+1)th merged codeword is serial cancellation decoding, translating the second to-be-decoded bit The code result is used as the decoding result of the first to-be-decoded bit; or, when the decoding mode used for decoding the (i+1)th merged codeword is a list decoding, the second to-be-decoded is selected.
  • the bits perform the same decision branch of the surviving path generated in the decoding process, and respectively calculate the branch metrics of each of the same decision branches, thereby determining the decoding result of the first to-be-decoded bit.
  • FIG. 13 is a schematic structural diagram of an embodiment of a wireless communication device according to the present application.
  • the wireless communication device may be the transmitting device or the receiving device in the foregoing embodiments.
  • the wireless communication device may include a processor 1301, a memory 1302, a transceiver 1303, and the like.
  • the wireless communication device may further include components such as an output module, an input module, and a sensor, and these components may also be connected and communicated in a bus structure or a star structure through one or more buses.
  • the processor 1301 is a control center of the wireless communication device that connects various portions of the entire wireless communication device with various interfaces and lines, by running or executing software programs and/or modules stored in the memory 1302, and for recalling stored in the memory 1302. Data to perform various functions of the wireless communication device and/or process data.
  • the processor 1301 may be composed of an integrated circuit (IC), for example, may be composed of a single packaged IC, or may be composed of a plurality of packaged ICs having the same function or different functions.
  • the processor 1301 may include only a central processing unit (CPU), or may be a GPU, a digital signal processor (DSP), and a control chip in the transceiver 1303 (for example, A combination of baseband chips).
  • the CPU may be a single operation core, and may also include multiple operation cores.
  • the transceiver 1303 is configured to establish a communication channel, and the wireless communication device is connected to the receiving device through the communication channel, thereby implementing data transmission between the wireless communication devices.
  • the transceiver 1303 may include a wireless local area network (wireless local area network) module, a Bluetooth module, a baseband module, and the like, and a radio frequency (RF) circuit corresponding to the communication module.
  • wireless local area network wireless local area network
  • Bluetooth communication infrared communication and/or cellular communication system communication, such as wideband code division multiple access (WCDMA) and/or high speed downlink packet access (high) Speed downlink packet access (HSDPA).
  • WCDMA wideband code division multiple access
  • HSDPA high speed downlink packet access
  • the transceiver 1303 is for controlling communication of various components in the wireless communication device and can support direct memory access.
  • the various transceivers 1303 in the transceiver 1303 are generally in the form of integrated circuit chips and can be selectively combined without necessarily including all of the transceivers 1303 and Corresponding antenna group.
  • the transceiver 1303 can include only baseband chips, radio frequency chips, and corresponding antennas to provide communication functionality in a cellular communication system.
  • the wireless communication device can be connected to a cellular network or the Internet via a wireless communication connection established by the transceiver 1303, such as wireless local area network access or WCDMA access.
  • a communication module such as a baseband module, in the transceiver 1303 may be integrated into the processor 1301, typically an APQ+MDM series platform such as that provided by Qualcomm.
  • the radio frequency circuit is used for receiving and transmitting signals during information transmission and reception or during a call. For example, after the downlink information of the base station is received, it is processed by the processor 1301; in addition, the data designed for the uplink is transmitted to the base station.
  • the radio frequency circuit includes well-known circuits for performing these functions, including but not limited to an antenna system, a radio frequency transceiver, one or more amplifiers, a tuner, one or more oscillators, a digital signal processor, a codec.
  • the RF circuit can communicate with the network and other devices through wireless communication.
  • the wireless communication may use any communication standard or protocol, including but not limited to a global system of mobile communication (GSM), a general packet radio service (GPRS), and code division multiple access.
  • GSM global system of mobile communication
  • GPRS general packet radio service
  • code division multiple access CDMA for short
  • WCDMA wideband code division multiple access
  • HSUPA high speed uplink packet access
  • LTE long-term evolution
  • SMS short messaging service
  • the processor 1301 when the wireless communication device is used as the sending device, the processor 1301 may be configured to generate the first codeword to the k+1th codeword; the transceiver 1303 may be used. The first codeword to the k+1th codeword are transmitted.
  • the specific generation manners and specific transmission manners of the foregoing first to the k+1th codewords refer to the foregoing embodiments, and details are not described herein again.
  • the transceiver 1303 may be configured to receive the foregoing first codeword to the k+1th codeword; the processor 1301 may be used to compare the first merged codeword The code is decoded to the k+1th merged codeword.
  • the specific decoding manner of the first codeword to the k+1th codeword and the specific decoding mode of the first merged codeword to the k+1th codeword refer to the foregoing embodiment, and details are not described herein again.
  • the present invention further provides a computer storage medium, wherein the computer storage medium may store a program, and the program may include some or all of the steps in various embodiments of the calling method provided by the present invention.
  • the storage medium may be a magnetic disk, an optical disk, or a read-only memory (English: read-only memory, Referred to as ROM) or random access memory (English: random access memory, referred to as RAM).
  • the techniques in the embodiments of the present invention can be implemented by means of software plus a necessary general hardware platform. Based on such understanding, the technical solution in the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product, which may be stored in a storage medium such as a ROM/RAM. , a disk, an optical disk, etc., including instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments of the present invention or portions of the embodiments.
  • a computer device which may be a personal computer, server, or network device, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请提供了数据发送方法、数据接收方法及发送设备与接收设备。所述数据发送方法包括：发送经过极化编码的第1码字，所述第1码字中包含n个承载有用户数据的第1信息比特；在所述第1码字发送完成后，发送经过极化编码的第2码字，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同。采用本申请所提供的数据发送方法、数据接收方法及装置、设备与系统，可以使得在使用HARQ技术进行数据重传时，在初传码字及重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，从而可以提高所述码字的译码性能。

Description

数据发送方法、数据接收方法及发送设备与接收设备 技术领域
本申请涉及无线通信领域，尤其涉及数据发送方法、数据接收方法及发送设备与接收设备。
背景技术
极化码(polar code)是迄今为止唯一在理论上可以证明当码长趋近于无穷大时，性能可以达到香农极限的编码方案。与结构中存在随机性的涡轮码(turbo code)及低密度奇偶校验码(low density parity check code，LDPC)相比，极化码具有特定的码字结构，其利用极化信道单元不断递归连接，使得编码后生成的码字中部分比特位对应的信道容量趋近于1，其余的则趋近于0。这样，只需要在信道容量趋近于1的比特位上放置待传输的信息，将信道容量趋近于0的比特位设置为固定值，就可以实现逼近香农极限的性能。
为了应对信道中不可预测的干扰，在无线通信的数据传输过程中，除需要对数据进行编码生成码字(codeword)之外，通常还需要采用混合自动重传请求(hybrid automatic repeat request，HARQ)技术实现码字的重传，以提升无线通信系统的性能。HARQ技术包括蔡司合并(chase combining，CC)和增量冗余(incremental redundancy，IR)两种方案。在CC方案中，重传码字和初传码字完全相同，只有一种冗余版本，接收端将重传码字和初传码字进行软合并后进行译码；在IR方案中，每次重传包含了不同的增量冗余校验位，译码时先将两次收到的码字进行合并，再将其当作一个码率更低的码字进行译码。由于IR方案可以同时获得能量增益和编码增益，因此在实际使用中大多会使用IR方案实现HARQ。
在采用IR方案实现HARQ时，可以通过将码字中的一部分比特位进行打孔的方式生成初传码字及重传码字，即，可以按照预定的规则对采用码字打孔，将打孔后剩余的比特位作为初传码字，并将被打孔的比特位作为重传码字。但是，在编码方案为极化码时，对码字打孔会影响码字的极化信道容量分布，从而导致在打孔生成的初传码字中，信息不在信道容量趋近于1的比特位上，进而导致初传码字的译码性能很差。如果保证初传码字的性能最优，那么增加打孔比特位后得到的码字也会因为极化信道 容量分布发生变化而导致译码性能不佳。
由此可以看出，采用现有的HARQ技术，在码字的编码方式为极化码时，码字的译码性能较差。
发明内容
本申请提供了数据发送方法、数据接收方法及发送设备与接收设备，以解决采用现有的HARQ技术，在码字的编码方式为极化码时，码字的译码性能较差的问题。
第一方面，本申请提供了一种数据发送方法，该方法包括：发送经过极化编码的第1码字，所述第1码字中包含n个承载有用户数据的第1信息比特，所述第1信息比特包括所述第1码字中信道容量从高到低排序的前n个比特；在所述第1码字发送完成后，发送经过极化编码的第2码字，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同，其中，第2信息比特包括所述第2码字中信道容量从高到低排序的前p个比特，第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数。
采用本实现方式，可以保证在使用HARQ技术进行数据重传时，在初传码字及第一次重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，使得接收设备在对码字进行合并译码时，既可以增加编码增益，又可以增加能量增益，从而可以提高所述码字的译码性能。
结合第一方面，在第一方面第一种可能的实现方式中，所述方法还包括：在第i码字发送完成后，发送第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个唯一对应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述第i+1码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字与第i-1合并码字合并而成，i＝2,3,……,k，第1合并码字为所述第1码字；k为最大重传次数，q为不大于n的正整数，所述i码字及第i+1码字均为经过极化编码后的码字。
采用本实现方式，可以保证在使用HARQ技术进行数据重传时，在各个重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，采用此方式发送初传码字及重传码字，既可以增加编码增益，又可以增加能量增益，从而可以提高所述 码字的译码性能。
结合第一方面第一种可能的实现方式，在第一方面第二种可能的实现方式中，所述第1码字与第2码字的长度相等，所述第i+1码字为所述第i码字长度的两倍。
采用本实现方式，可以使接收设备在译码时，能够方便的确定译码所用码率。
结合第一方面第一种可能的实现方式，在第一方面第三种可能的实现方式中，第1码字至第i+1码字中的冻结比特均承载预定值，其中，所述冻结比特为第1码字至第i+1码字这i+1个码字的每一个码字中除信息比特之外的其它比特。
采用本实现方式，接收设备可以直接确定各个码字中冻结比特的译码结果，从而可以减少接收设备需要译码的比特，提高接收设备的译码效率。
结合第一方面第一种可能的实现方式，在第一方面第四种可能的实现方式中，在发送第i+1码字之前还包括：对第i+1合并码字进行信道估计从而得到所述第i+1合并码字的极化信道容量分布，其中，所述第i+1合并码字由第i+1码字至第1码字按照降序合并而成；选取第1信息比特至第i信息比特中信道容量从低到高排序的前q个比特作为第i目标比特；选取所述i+1码字中信道容量从高到低排序的前q个比特作为第i+1信息比特；将每一个所述第i目标比特中所承载的用户数据复制至对应的第i+1信息比特中；将所述第i+1码字中冻结比特所承载的数据设置为预定值，所述第i+1码字中冻结比特为所述第i+1码字中除第i+1信息比特之外其他比特。
采用本实现方式，可以在发送每个重传码字之前才生成该码字，从而可以避免发送设备生成不必要的重传码字，减少发送设备的数据处理量。
结合第一方面第一种可能的实现方式，在第一方面第五种可能的实现方式中，在发送第1码字之前还包括：对第k+1合并码字进行信道估计，从而得到所述第k+1合并码字的极化信道容量分布，其中，所述第k+1合并码字由第k+1码字至第1码字按照降序合并而成；将用户数据写入所述第k+1合并码字中信道容量最高的n个比特；依次将第k+1码字至第2码字中待复制比特所承载的数据复制到待复制比特所对应的目标比特，其中，第j码字中的待复制比特包括所述第j码字中承载有用户数据的比特，所述目标比特位包括第j-1合并码字中除承载有用户数据的比特之外信道容量最高的比特，所述第j，j＝2,3,……k+1；将所述第k+1合并码字中冻结比特所承载的数据设置为预定值，其中，所述第k+1合并码字中冻结比特为所述第k+1合并码字中除承载有用户数据之外的外的其它比特。
采用本实现方式，发送设备可以发送初传码字之前预先生成所有的重传码字，从而可以提升重传效率，并且，采用此生成方式，p及q的取值均为自然生成，从而可以避免因p及q的取值不当而影响码字的译码性能。
第二方面，本申请还提供了一种数据接收方法，该方法包括：接收经过极化编码的第1码字，其中，所述第1码字中包含承载有用户数据的第1信息比特，所述第1信息比特包括所述码字中信道容量从高到低排序的前n个比特；使用第1码率对第1码字进行译码；如果对所述第1码字的译码出现错误，则接收第2码字，其中，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个相应的第1重传比特所成承载的用户数据相同，所述第2信息比特包括所述码字中信道容量从高到低排序的前p个比特，所述第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数；使用第2码率对第2合并码字进行译码，其中，所述第2合并码字由所述第2码字与所述第1码字合并生成，所述第2码率高于所述第1码率；从对第2合并码字进行译码所得出的译码结果中获取用户数据。
采用本实现方式，可以保证在使用HARQ技术进行数据重传时，在初传码字及第一次重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，使得接收设备在对码字进行合并译码时，既可以增加编码增益，又可以增加能量增益，从而可以提高所述码字的译码性能。
结合第二方面，在第二方面第一种可能的实现方式中，所述方法还包括：如果对第i码字的译码出现错误，则接收第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个相应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字至所述第1码字合并而成，i＝2,3,……,k；k为最大重传次数，q为不大于n的正整数；使用第i+1码率对第i+1合并码字进行译码，其中，所述第i+1合并码字由所述第i+1码字与所述第1码字合并生成，第i+1码率高于第i码率，第i码率为对第i合并码字进行译码时的码率；从对第i+1合并码字进行译码所得出的译码结果中获取用户数据，所述i码字及第i+1码字均为经过极化编码后的码字。
结合第二方面第一种可能的实现方式，在第二方面第二种可能的实现方式中，当 所述第1码字与第2码字的长度相等，且第i+1码字为第i码字长度的两倍时，所述第2码率为所述第1码率的2倍，所述第i+1码率为所述第i码率的2倍。
结合第二方面第一或二种可能的实现方式，在第二方面第三种可能的实现方式中，使用对第i+1合并码字进行译码包括：如果待译码比特为第1待译码比特，那么根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果，其中，所述第1待译码比特为第i信息比特其中之一，所述第2待译码比特为第i+1信息比特至第k+1信息比特其中之一，并且所述第1待译码比特与所述第2待译码比特所承载的数据相同。
结合第二方面第三种可能的实现方式，在第二方面第四种可能的实现方式中，根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果包括：当对第i+1合并码字译码所采用的译码方式为串行抵消译码时，将所述第2待译码比特的译码结果作为所述第1待译码比特的译码结果。
采用此实现方式，可以在采用串行抵消译码时，利用已译码比特的译码结果确定待译码比特的译码结果，从而加快译码速度。
结合第二方面第三种可能的实现方式，在第二方面第五种可能的实现方式中，根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果包括：当对第i+1合并码字译码所采用的译码方式为列表译码时，选择对第2待译码比特进行译码过程中所产生幸存路径的相同判决分支，并分别计算每一个所述相同判决分支的分支度量，从而确定第1待译码比特位的译码结果。
采用此实现方式，可以在采用列表译码译码时，利用已译码比特的译码信息确定待译码比特的译码结果，从而加快译码速度。
第三方面，本申请还提供了一种数据发送设备，该装置包括用于执行第一方面及第一方面各种实现方式中各个方法步骤的单元。
第四方面，本申请还提供了一种数据接收设备，该装置包括用于执行第二方面及第二方面各种实现方式中各个方法步骤的单元。
第五方面，本申请还提了另一种数据发送设备，该设备包括处理器及收发器，其中，所述处理用于生成经过极化编码的第1码字及经过极化编码的第2码字；所述收发器用于在所述第1码字发送完成后，发送经过极化编码的第2码字。
结合第五方面，在第五方面第一种可能的实现方式中，所述处理器，还用于第i+1 码字；所述收发器，还用于在第i码字发送完成后，发送第i+1码字。
第六方面，本申请还提供了另一种数据接收设备，该接受设备包括处理器及收发器，所述收发器，用于接收经过极化编码的第1码字，所述处理器，用于使用第1码率对第1码字进行译码；所述收发器，还用于如果对所述第1码字的译码出现错误，则接收第2码字，所述处理器，还用于使用第2码率对第2合并码字进行译码，其中，所述第2合并码字由所述第2码字与所述第1码字合并生成。
结合第六方面，在第六方面第一种可能的实现方式中，所述收发器，还用于如果对第i码字的译码出现错误，则接收第i+1码字；所述处理器，还用于使用第i+1码率对第i+1合并码字进行译码，其中，所述第i+1合并码字由所述第i+1码字与所述第1码字合并生成。
第七方面，本申请还提供了一种数据传输系统，该传输系统可以包括至少一个第五方面所提供的数据发送设备，及至少一个第六方面所提供的数据接收设备。
第八方面，本申请还提供了一存储介质，该存储介质可存储有程序，该程序执行时，可以实现本申请所提供数据发送方法或数据接收方法各个实施例中的部分或全部方法步骤。
采用本申请所提供的数据发送方法、数据接收方法及装置、设备与系统，可以使得在使用HARQ技术进行数据重传时，在初传码字及重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，使得接收设备在对码字进行合并译码时，既可以增加编码增益，又可以增加能量增益，从而可以提高所述码字的译码性能。
附图说明
为了更清楚地说明本申请的技术方案，下面将对实施例中所需要使用的附图作简单地介绍，显而易见地，对于本领域普通技术人员而言，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1为本申请码字的一个结构示意图；
图2为本申请码字的另一个结构示意图；
图3为本申请码字的另一个结构示意图；
图4为本申请数据发送方法一个实施例的流程示意图；
图5为本申请第3合并码字的一个结构示意图；
图6为本申请第3合并码字的一个信息比特分布示意图；
图7为本申请第3合并码字中用户数据复制对应关系的一个示意图；
图8为本申请数据接收方法一个实施例的流程示意图；
图9为本申请第2合并码字的一个结构示意图；
图10为本申请第3合并码字的一个结构示意图；
图11为本申请数据发送设备一个实施例的结构示意图；
图12为本申请数据接收设备一个实施例的结构示意图；
图13为本申请无线通信设备一个实施例的结构示意图。
具体实施方式
在本申请实施例中，发送设备及接收设备可以为需要以无线传输方式进行数据传输的基站、终端等无线通信设备。用户数据是指发送设备发送给接收设备的数据，也是需要接收设备接收的数据。
在本申请实施例中，码字(code word)可以由至少一个比特构成，码字中比特的信道容量可以是指在所述码字传输的过程中，所述比特所承载的数据不发生错误的可能性。信道容量的值通常可以在0至1之间，该比特的信道容量越高，说明采用该比特进行用户数据传输时，出现传输错误的可能性越小。
在本申请实施例中，k可以为HARQ的最大重传次数，通常情况下，k可以为不小于1的正整数。例如，当最大重传次数为1时，k的取值则为1，当最大重传次数为2时，k的取值则为2。在本申请实施例中，可以以k+1个码字为一组，用于发送同一组用户数据，第1码字为HARQ的初传码字，第i码字为第i-1次重传时所传输的码字，第i+1码字则为第i次重传时所传输的码字，i＝2,3,……,k。
为便于接收设备选择对码字进行解码时的码率，当第1码字的长度为m比特时，第2码字的长度可以也为m比特，并且，当i+1码字的长度则可以为第i码字长度的两倍。其中，m的取值可以为正整数。例如，当m的取值为8，即第1码字的长度为8比特时，第2码字的长度可以也为8比特，第3码字的长度则可以为16比特。
在第1码字中可以包含n个用于承载用户数据的第1信息比特，其中，n的不大于m的正整数。例如，当所述第1码字的长度为8比特时，所述第1码字中可以包 含6个用于承载待发送信息的第1信息比特。如图1所示，当第0至第7比特中，信道容量最高的比特位第0至第5比特时，所述第1信息比特可以包括所述第0至第5比特。
在第2码字中，可以包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同，其中，第2信息比特包括所述第2码字中信道容量从高到低排序的前p个比特，第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，p为不大于n的正整数。其中p的取值可以预先设定，也可以根据码字的生成方式确定。其中，每一个所述第2信息比特的信道容量可以均高于每一个所述第1重传比特的信道容量。
例如，当p的值为2时，所述第2码字中可以包括2个第2信息比特，并且所述第1信息比特也包含2个重传比特。如图2所示，如果所述第2码字中信道容量最高的两个比特为第8比特与第13比特，而所述第1信息比特中信道容量最低的两个比特为第5比特与第3比特，那么第5比特及第3比特即为第1重传比特，因此可以将第13比特作为与第3比特对应的第2信息比特，令第13比特与第3比特承载的用户数据相同；并将第8比特作为第5比特所对应的第2信息比特，令第8比特与第5比特所承载的用户数据相同。在此需要说明的是，为便于描述，在本发明实施例中，对k+1个码字中的各个比特进行了统一进行编号。
第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i信息比特与一个唯一对应的第i重传比特所成承载的用户数据相同，第i+1信息比特包括所述第i+1码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字至所述第1码字合并而成，其中，q为大于n的正整数。
例如，第3码字中可以包含1个第3信息比特，所述第2合并比特段中则包含1个第2重传比特，其中，所述第2合并码字则为由第2码字与第1码字合并构成，该第3信息比特可以为所述第3码字中信道容量最高的1个比特，而该第2重传比特则可以为所述第2信息比特与所述第1信息比特中信道容量最低的1个比特。如图3所示，如果所述第3码字中信道容量最高的比特为第17比特，而所述第1信息比特及第二信息比特中信道容量最低的比特为第3比特，那么所述第17比特即为第3信息比特，而第3比特即为第2重传比特，因此可以令第15比特与第3比特承载的用户数据相同。
为减少接收设备需要解码比特数量，在所述第1至所述第k+1码字这k+1个码字的每一个码字中，除了用于承载用户数据的信息比特之外，其他比特可以被称作冻结比特，而所述冻结比特则可以承载相同的预定值。例如，所有冻结比特的值都可以为1，或者，所述冻结比特的值都可以为0。
在本发明实施例中，合并码字是指由至少一个码字合并而成，第1合并码字即为第1码字，第i+1合并码字则由第i+1码字与第i合并码字合并而成。例如，第1合并码字即为第1码字，第2合并码字由第2码字与第1码字合并而成，第3合并码字则由第3码字与第2合并码字合并而成。在此需要说明是的是，本申请中所说的合并是指将码字之间首尾连接从而形成一个新的码字。
下面结合前述码字的结构对本发明数据发送方法及数据接收方法进行说明。
参见图4，为本申请数据发送方法一个实施例的流程示意图。该数据发送方法由发送设备执行。
步骤401，发送经过极化编码的第1码字。
在发送第一码字之前，发送设备可以仅预先生成第1码字。
发送设备可以首先选择第1码字中信道容量最高的n个比特作为第1信息比特，然后将长度为n比特的用户数据写入到该n个信息比特中。
为减少接收设备需要译码的比特数量，发送设备还可以所述冻结比特所承载的数据都设置为预定值。
在第1码字各个比特所承载的内容都确定之后，发送设备可以对第1码字进行极化编码，并向接收设备发送经过极化编码的第1码字。
步骤402，在所述第1码字发送完成后，发送经过极化编码的第2码字。
在第1码字发送完成后，如果接收到了接收设备的重传请求，或者满足了其他预定的重传条件，那么发送设备可以再生成并发送经过极化编码的第2码字。
在生成第2码字时，可以首选选取第1信息比特中信道容量从低到高排序的前p个比特作为第1目标比特，并选取第2码字中信道容量从高到低排序的前p个比特作为第2信息比特。在确定第1目标比特与第2信息比特的对应关系，使每一个第1目标比特与一个第2信息比特唯一对应后，发送设备可以将第1目标比特中所述承载的用户数据复制到对应的第2信息比特中。其中，p可以为预设值。
除将第1目标比特中所述承载的用户数据复制到对应的第2信息比特中之外，发送设备还可以将第2码字中的冻结比特所承载的数据也设置为预定值。在第2码字各个比特所承载的内容都确定之后，发送设备可以对第2码字进行极化编码，并向接收设备发送经过极化编码的第2码字。
步骤403，在第i码字发送完成后，发送第i+1码字。
在第i码字发送完成后，如果再次接收到了接收设备的重传请求，或者满足了其他预定的重传条件，那么再生成并发送经过极化编码的第i+1码字。
在生成第i+1码字时，发送设备可以首选选取第i信息比特中信道容量从低到高排序的前q个比特作为第i目标比特，并选取第i+1码字中信道容量从高到低排序的前q个比特作为第i+1信息比特。在确定第i目标比特与第i+1信息比特的对应关系，使每一个第i目标比特与一个第i+1信息比特唯一对应后，发送设备可以将第i目标比特中所述承载的用户数据复制到对应的第i+1信息比特中。其中，q为预设值，并且当i的取值不同时，q的取值也可以各不相同。
除将第i目标比特中所述承载的用户数据复制到对应的第i+1信息比特中之外，发送设备还可以将第i+1码字中的冻结比特所承载的数据也设置为预定值。在第i+1码字各个比特所承载的内容都确定之后，发送设备可以对第i+1码字进行极化编码，并向接收设备发送经过极化编码的第i+1码字。
在另一个实施例中，为进一步减少接收设备的需要译码的比特数量，发送设备也可以在发送第1码字之前就预先生成第1码字至第k+1码字。
具体来说，接收设备在确定k的取值及第1码字至第k+1码字中各个码字的长度后，可以将第k+1码字至第1码字合并为一个第k+1合并码字。以k＝2为例，当第1码字的长度为8比特，第2码字的长度为8比特，第三码字的长度为16比特为例。第3合并码字的结构可以如图5所示。
在第k+1合并码字确定之后，所述发送设备可以对第k+1码字进行信道估计，从而得到所述第k+1合并码字的极化信道容量分布。然后发送设备可以将用户数据写入所述第k+1合并码字中信道容量最高的n个比特；并依次将第k+1码字至第2码字中待复制比特所承载的数据复制到待复制比特所对应的目标比特，其中，第j码字中的待复制比特包括所述第j码字中承载有用户数据的比特，所述目标比特位包括第j-1合并码字中除承载有用户数据的比特之外信道容量最高的比特，j＝2,3,……k+1； 此外，发送设备还可以将所述第k+1合并码字中冻结比特所承载的数据设置为预定值，其中，所述第k+1合并码字中冻结比特为所述第k+1合并码字中除第1至第i+1信息比特之外的其他比特。
例如，当第3合并码字如图5所示时，如果用户数据的长度为6比特，而所述通过信道容量估计确定所述第3合并码字中信道容量最高的6个比特为第0比特、第1比特、第2比特、第4比特、第8比特及第16比特，那么可以首先将用户数据写入到这6个比特中，第1码字至第3码字中的信息比特分布示意图可以如图6所示。
由于第16比特位于第3码字中并且承载有用户数据，因此需要将第16比特所承载的数据复制到第2合并码字的目标比特中，如果通过信道容量估计确定所述第2合并码字中除去第0比特、第1比特、第2比特、第4比特及第8比特之外信道容量最高的比特位第13比特，那么可以将所述第16比特中承载的用户数据复制到第13比特中。
同样的，由于第13比特及第8比特中承载有用户数据，因此需要将第13比特及第8比特所承载的数据复制到第1合并码字的目标比特中，第1合并码字即为第1码字。如果通过信道容量估计确定所述第2合并码字中除去第0比特、第1比特、第2比特及第4比特之外信道容量最高的比特为第3比特及第5比特，那么可以将第13比特所承载的用户数据对应复制到第3比特中，并将第8比特所承载的用户数据对应复制到第5比特中。用户数据复制过程中的对应关系可以如7所示。
除此之外，所述发送设备将第6比特至第7比特、第9比特至第12比特、第14比特至15比特，以及第17比特至第31比特等冻结比特所承载的数据均设置为预定值。
采用此实现方式，可以无需预先设定p的取值及q的取值，并且可以使p及q的取值较小，简化接收设备对码字的解码过程。
在所述第k+1码字发送完成后，如果发送设备再接收到针对该部分用户数据的重传请求，那么发送设备可以重新执行步骤401至步骤403；如果接收设备正确接收到了所述用户数据，那么所述发送设备可以进行其他用户数据的发送。
采用本实施例所提供的方法，可以使得在使用HARQ技术进行数据重传时，在初传码字及重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，使得接收设备在对码字进行合并译码时，既可以增加编码增益，又可以增加能量增益， 从而可以提高所述码字的译码性能。
参见图8，为本申请译码方法一个实施例的流程示意图。在本实施例中，第1至第k+1码字的长度及各个比特所承载的内容可以参见前述，在此就不再赘述。
步骤801，接收经过极化编码的第1码字。
接收设备可以首先接收经过极化编码的第1码字。
步骤802，使用第1码率对第1码字进行译码。
在接收到所述第1码字之后，所述接收设备可以使用第1码率对第1码字进行译码。
由于第1码字中携带了用户数据的全部内容，因此如果对第1码字译码成功，那么就可以直接从对第1码字的译码结果中获取用户数据各个比特，进而根据用户数据各个比特位第1码字中的排布方式还原出所述用户数据。
在对第1码字解码时，接收设备可以按照从高比特至低比特的顺序逐比特对所述第1码字的各个比特进行解码。例如当所述第1码字的结构如图1所示时，接收设备可以从第7比特至第0比特逐比特对所述第1码字的各个比特进行解码。
如果对第1码字译码成功，那么接收设备可以从对第1码字进行译码所得出的译码结果中获取用户数据。
步骤803，如果对所述第1码字的译码出现错误，则接收第2码字。
在对第1码字的译码出现错误从而导致对第1码字译码失败时，接收设备可以向发送设备发送重传请求。发送设备在接收到重传请求后，向接收设备发送第2码字。
步骤804，使用第2码率对第2合并码字进行译码。
所述第2合并码字由所述第2码字与所述第1码字合并生成。由于所述第2合并码字的长度长于第1码字，因此所述第2码率需要高于第1码率，通常情况下，所述第2码率的与第1码率的比值可以与第2合并码字与第1码字之间比特长度的比值。
在对第2合并码字解码时，接收设备可以按照从高比特至低比特的顺序逐比特对所述第2合并码字的各个比特进行解码。例如当所述第2合并码字的结构如图9所示时，接收设备可以从第15比特至第0比特逐比特对所述第1码字的各个比特进行解码。如果对第2合并码字译码成功，那么接收设备可以从对第2合并码字进行译码所得出的译码结果中获取用户数据。
其中，由于第3比特与第13比特所承载的用户数据相同，因此接收设备可以直接将第13比特的译码结果作为第3比特的页码结果，或者所述第13比特的译码过程确定所述第3比特的译码结果；类似的，接收设备也可以根据第8比特的译码过程或译结果确定第5比特的译码结果。
步骤805，如果对第i码字的译码出现错误，则接收第i+1码字。
在对第i合并码字的译码出现错误时，接收设备可以向发送设备发送重传请求。发送设备在接收到重传请求后，向接收设备发送第i+1码字。
步骤806，使用第i+1码率对第i+1合并码字进行译码。
所述第i+i合并码字由所述第i+1码字与所述第i码字合并生成。由于所述第i+1合并码字的长度长于第i码字，因此所述第i+1码率需要高于第i码率，通常情况下，所述第i+1码率的与第i码率的比值可以与第i+1合并码字与第i码字之间比特长度的比值。
在对第i+1合并码字解码时，接收设备可以按照从高比特至低比特的顺序逐比特对所述第i+1合并码字的各个比特进行解码。以i＝2为例，第3合并码字的结构可以如图10所示，接收设备可以从第31比特至第0比特逐比特对所述第3合并码字的各个比特进行解码。
在对第i+1合并比特段进行解码时，如果待解码的比特为第1待译码比特，那么根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果，其中，所述第1待译码比特为第i信息比特其中之一，所述第2待译码比特为第i+1信息比特至第k+1信息比特其中之一，并且所述第1待译码比特与所述第2待译码比特所承载的数据相同。
如果对第i+1合并码字译码所采用的译码方式为串行抵消译码，那么在对所述第1待译码比特进行译码时，接收设备已经完成了对第2待译码比特译码，由于第2待译码比特与第1待译码比特所承载的用户数据相同，因此可以直接将所述第2待译码比特的译码结果作为所述第1待译码比特的译码结果。
例如，当第3合并码字的结构如图10所示时，由于第16比特、第13比特及第3比特所承载的用户数据相同，因此可以将第16比特的译码结果作为第13比特的译码结果，并且可以将第13比特及第16比特的译码结果作为第3比特的译码结果。
如果对第i+1合并码字译码所采用的译码方式为列表译码，那么在对所述第1待 译码比特进行译码时，接收设备已经对第2待译码比特进行译码并生成了幸存路径，但是并未根据所述幸存路径的判决分支的分支度量确定所述第2待译码比特的译码结果，由于第2待译码比特与第1待译码比特所承载的用户数据相同，因此接收设备可以选择对第2待译码比特进行译码过程中所产生幸存路径的相同判决分支，并分别计算每一个所述相同判决分支的分支度量，从而同时确定第2待译码比特与第1待译码比特位的译码结果。
例如，当第3合并码字的结构如图10所示时，由于第16比特、第13比特及第3比特所承载的用户数据相同，因此分别计算每一个所述相同判决分支的分支度量，从而同时确定第16比特、第13比特及第3比特的译码结果。
步骤807，从对第i+1合并码字进行译码所得出的译码结果中获取用户数据。
如果对第i+1合并码字译码成功，那么接收设备可以从对第i+1合并码字进行译码所得出的译码结果中获取用户数据。
采用本实施例所提供的方法，可以使得在使用HARQ技术进行数据重传时，在初传码字及重传码字中，用于承载用户数据的比特均所述码字信道容量最大的比特，使得接收设备在对码字进行合并译码时，既可以增加编码增益，又可以增加能量增益，从而可以提高所述码字的译码性能。
参见图11，为本申请数据发送设备一个实施例的结构示意图。
如图11所示，所述发送设备可以包括第一码字生成单元1101及发送单元1102。
其中，第一码字生成单元1101，用于生成第1码字以及第2码字，其中，所述第1码字中包含n个承载有用户数据的第1信息比特，所述第1信息比特包括所述第1码字中信道容量从高到低排序的前n个比特，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同，其中，第2信息比特包括所述第2码字中信道容量从高到低排序的前p个比特，第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数，所述第1码字及所述第2码字均为经过极化编码后的码字。发送单元1102，用于发送所述第1码字；在所述第1码字发送完成后，发送经过所述第2码字。
可选的，所述发送单元1102，还用于在第i码字发送完成后，发送第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1 信息比特与一个唯一对应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述第i+1码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字与第i-1合并码字合并而成，i＝2,3,……,k，第1合并码字为所述第1码字；k为最大重传次数，q为不大于n的正整数，所述i码字及第i+1码字均为经过极化编码后的码字。
可选的，所述第1码字与第2码字的长度相等，所述第i+1码字为所述第i码字长度的两倍。所述第1码字至第i+1码字中的冻结比特可以均承载预定值，其中，所述冻结比特为第1码字至第i+1码字中除信息比特之外的其它比特。
可选的，除用于生成所述第1码字与所述第2码字的第一码字生成单元1101之外，所述装置还包括第二码字生成单元，所述第二码字生成单元用于生成第i+1码字。
所述第二码字生成单元包括：第一信道估计子单元，用于对第i+1合并码字进行信道估计从而得到所述第i+1合并码字的极化信道容量分布，其中，所述第i+1合并码字由第i+1码字至第1码字按照降序合并而成；目标比特选择子单元，用于选取第1信息比特至第i信息比特中信道容量从低到高排序的前q个比特作为第i目标比特；信息比特选取子单元，用于选取所述i+1码字中信道容量从高到低排序的前q个比特作为第i+1信息比特；第一复制子单元，用于将每一个所述第i目标比特中所承载的用户数据复制至对应的第i+1信息比特中；第一设置子单元，用于将所述第i+1码字中冻结比特所承载的数据设置为预定值，所述第i+1码字中冻结比特为所述第i+1码字中除第i+1信息比特之外其他比特。
可选的，第1至第k+1码字也可以都由所述第一码字生成单元1101生成。
当第1至第k+1码字都由第一码字生成单元1101生成时，所述第一码字生成单元1101可以包括：第二信道估计子单元，用于对第k+1合并码字进行信道估计，从而得到所述第k+1合并码字的极化信道容量分布，其中，所述第k+1合并码字由第k+1码字至第1码字按照降序合并而成；写入子单元，用于将用户数据写入所述第k+1合并码字中信道容量最高的n个比特；第二复制子单元，用于依次将第k+1码字至第2码字中待复制比特所承载的数据复制到待复制比特所对应的目标比特，其中，第j码字中的待复制比特包括所述第j码字中承载有用户数据的比特，所述目标比特位包括第j-1合并码字中除承载有用户数据的比特之外信道容量最高的比特，j＝2,3,……k+1；第二设置子单元，用于将所述第k+1合并码字中冻结比特所承载的数据设置为 预定值，其中，所述第k+1合并码字中冻结比特为所述第k+1合并码字中除承载有用户数据之外的外的其它比特。
参见图12，为本申请数据接收设备一个实施例的结构示意图。
如图12所示，所述接收设备可以包括接收单元1201、译码单元1202及获取单元1203。
其中，所述接收单元1201，用于接收经过极化编码的第1码字，其中，所述第1码字中包含承载有用户数据的第1信息比特，所述第1信息比特包括所述码字中信道容量从高到低排序的前n个比特；
所述译码单元1202，用于使用第1码率对第1码字进行译码；所述接收单元1201，还用于如果对所述第1码字的译码出现错误，则接收第2码字，其中，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个相应的第1重传比特所成承载的用户数据相同，所述第2信息比特包括所述码字中信道容量从高到低排序的前p个比特，所述第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数；所述译码单元1202，还用于使用第2码率对第2合并码字进行译码，其中，所述第2合并码字由所述第2码字与所述第1码字合并生成，所述第2码率高于所述第1码率；所述获取单元1203，用于从对第2合并码字进行译码所得出的译码结果中获取用户数据。
可选的，所述接收单元1201，还用于如果对第i码字的译码出现错误，则接收第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个相应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字至所述第1码字合并而成，i＝2,3,……,k；k为最大重传次数，q为不大于n的正整数；所述译码单元1202，还用于使用第i+1码率对第i+1合并码字进行译码，其中，所述第i+1合并码字由所述第i+1码字与所述第1码字合并生成；所述获取单元1203，还用于从对第i+1合并码字进行译码所得出的译码结果中获取用户数据。
可选的，所述译码单元1202，具体用于在待译码比特为第1待译码比特时，根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果，其中，所述第1待译码比特为第i信息比特其中之一，所述第2待译码比特为第i+1信息比特至第k+1 信息比特其中之一，并且所述第1待译码比特与所述第2待译码比特所承载的数据相同。具体来说，所述译码单元1202，可以用于当对第i+1合并码字译码所采用的译码方式为串行抵消译码时，将所述第2待译码比特的译码结果作为所述第1待译码比特的译码结果；或者，用于当对第i+1合并码字译码所采用的译码方式为列表译码时，选择对第2待译码比特进行译码过程中所产生幸存路径的相同判决分支，并分别计算每一个所述相同判决分支的分支度量，从而确定第1待译码比特位的译码结果。
参见图13，为本申请无线通信设备一个实施例的结构示意图。所述无线通信设备可以是前述实施例中的发送设备或接收设备。
如图13所示，所述无线通信设备可以包括：处理器1301、存储器1302及收发器1303等。除此之外，所述无线通信设备还可以包括输出模块、输入模块及传感器等组件，这些组件也可以通过一条或多条总线以总线形结构或星型结构等进行连接及通信。
处理器1301为无线通信设备的控制中心，利用各种接口和线路连接整个无线通信设备的各个部分，通过运行或执行存储在存储器1302内的软件程序和/或模块，以及调用存储在存储器1302内的数据，以执行无线通信设备的各种功能和/或处理数据。所述处理器1301可以由集成电路(integrated circuit，简称IC)组成，例如可以由单颗封装的IC所组成，也可以由连接多颗相同功能或不同功能的封装IC而组成。举例来说，处理器1301可以仅包括中央处理器(central processing unit，简称CPU)，也可以是GPU、数字信号处理器(digital signal processor，简称DSP)、及收发器1303中的控制芯片(例如基带芯片)的组合。在本发明实施方式中，CPU可以是单运算核心，也可以包括多运算核心。
所述收发器1303用于建立通信信道，使无线通信设备通过所述通信信道以连接至接收设备，从而实现无线通信设备之间的数据传输。所述收发器1303可以包括无线局域网(wireless local area network，简称wireless LAN)模块、蓝牙模块、基带(base band)模块等通信模块，以及所述通信模块对应的射频(radio frequency，简称RF)电路，用于进行无线局域网络通信、蓝牙通信、红外线通信及/或蜂窝式通信系统通信，例如宽带码分多重接入(wideband code division multiple access，简称WCDMA)及/或高速下行封包存取(high speed downlink packet access，简称HSDPA)。所述收发器1303用于控制无线通信设备中的各组件的通信，并且可以支持直接内存存取(direct memory access)。
在本发明的不同实施方式中，所述收发器1303中的各种收发器1303一般以集成电路芯片(integrated circuit chip)的形式出现，并可进行选择性组合，而不必包括所有收发器1303及对应的天线组。例如，所述收发器1303可以仅包括基带芯片、射频芯片以及相应的天线以在一个蜂窝通信系统中提供通信功能。经由所述收发器1303建立的无线通信连接，例如无线局域网接入或WCDMA接入，所述无线通信设备可以连接至蜂窝网(cellular network)或因特网(Internet)。在本发明的一些可选实施方式中，所述收发器1303中的通信模块，例如基带模块可以集成到处理器1301中，典型的如高通(Qualcomm)公司提供的APQ+MDM系列平台。射频电路用于信息收发或通话过程中接收和发送信号。例如，将基站的下行信息接收后，给处理器1301处理；另外，将设计上行的数据发送给基站。通常，所述射频电路包括用于执行这些功能的公知电路，包括但不限于天线系统、射频收发机、一个或多个放大器、调谐器、一个或多个振荡器、数字信号处理器、编解码(codec)芯片组、用户身份模块(SIM)卡、存储器1302等等。此外，射频电路还可以通过无线通信与网络和其他设备通信。所述无线通信可以使用任一通信标准或协议，包括但不限于全球移动通讯系统(global system of mobile communication，简称GSM)、通用分组无线服务(general packet radio service，简称GPRS)、码分多址(code division multiple access，简称CDMA)、宽带码分多址(wideband code division multiple access，简称WCDMA)、高速上行行链路分组接入技术(high speed uplink packet access，简称HSUPA)、长期演进(long term evolution，简称LTE)、电子邮件、短消息服务(short messaging service，简称SMS)等。
在本申请实施例中，当所述无线通信设备作为发送设备时，所述处理器1301，可以用于生成前述第1码字至第k+1码字；所述收发器1303，则可以用于发送前述第1码字至第k+1码字。其中，前述第1码字至第k+1码字的具体生成方式及具体发送方式可以参见前述实施例，在此就不再赘述。
当所述无线通信设备作为接收设备时，所述收发器1303，可以用于接收前述第1码字至第k+1码字；所述处理器1301，则可以用于对第1合并码字至第k+1合并码字进行解码。其中，第1码字至第k+1码字的接收方式及第1合并码字至第k+1合码字的具体解码方式可以参见前述实施例，在此就不再赘述。
具体实现中，本发明还提供一种计算机存储介质，其中，该计算机存储介质可存储有程序，该程序执行时可包括本发明提供的呼叫方法的各实施例中的部分或全部步骤。所述的存储介质可为磁碟、光盘、只读存储记忆体(英文：read-only memory， 简称ROM)或随机存储记忆体(英文：random access memory，简称RAM)等。
本领域的技术人员可以清楚地了解到本发明实施例中的技术可借助软件加必需的通用硬件平台的方式来实现。基于这样的理解，本发明实施例中的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在存储介质中，如ROM/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本发明各个实施例或者实施例的某些部分所述的方法。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可。尤其，对于装置、设备及系统实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例中的说明即可。
以上所述的本发明实施方式并不构成对本发明保护范围的限定。

Claims (24)

  1. 一种数据发送方法，其特征在于，包括：
    发送经过极化编码的第1码字，所述第1码字中包含n个承载有用户数据的第1信息比特，所述第1信息比特包括所述第1码字中信道容量从高到低排序的前n个比特；
    在所述第1码字发送完成后，发送经过极化编码的第2码字，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同，其中，第2信息比特包括所述第2码字中信道容量从高到低排序的前p个比特，第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数。
  2. 如权利要求1所述的方法，其特征在于，所述方法还包括：
    在第i码字发送完成后，发送第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个唯一对应的第i重传比特所成承载的用户数据相同，
    其中，第i+1信息比特包括所述第i+1码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字与第i-1合并码字合并而成，i＝2,3,……,k，第1合并码字为所述第1码字；k为最大重传次数，q为不大于n的正整数，所述i码字及第i+1码字均为经过极化编码后的码字。
  3. 如权利要求2所述的方法，其特征在于，所述第1码字与第2码字的长度相等，所述第i+1码字为所述第i码字长度的两倍。
  4. 如权利要求2所述的方法，其特征在于，第1码字至第i+1码字中的冻结比特均承载预定值，其中，所述冻结比特为第1码字至第i+1码字中除信息比特之外的其它比特。
  5. 如权利要求2所述的方法，其特征在于，在发送第i+1码字之前还包括：
    对第i+1合并码字进行信道估计从而得到所述第i+1合并码字的极化信道容 量分布，其中，所述第i+1合并码字由第i+1码字至第1码字按照降序合并而成；
    选取第1信息比特至第i信息比特中信道容量从低到高排序的前q个比特作为第i目标比特；
    选取所述i+1码字中信道容量从高到低排序的前q个比特作为第i+1信息比特；
    将每一个所述第i目标比特中所承载的用户数据复制至对应的第i+1信息比特中；
    将所述第i+1码字中冻结比特所承载的数据设置为预定值，所述第i+1码字中冻结比特为所述第i+1码字中除第i+1信息比特之外其他比特。
  6. 如权利要求2所述的方法，其特征在于，在发送第1码字之前还包括：
    对第k+1合并码字进行信道估计，从而得到所述第k+1合并码字的极化信道容量分布，其中，所述第k+1合并码字由第k+1码字至第1码字按照降序合并而成；
    将用户数据写入所述第k+1合并码字中信道容量最高的n个比特；
    依次将第k+1码字至第2码字中待复制比特所承载的数据复制到待复制比特所对应的目标比特，其中，第j码字中的待复制比特包括所述第j码字中承载有用户数据的比特，所述目标比特位包括第j-1合并码字中除承载有用户数据的比特之外信道容量最高的比特，所述第j，j＝2,3,……k+1；
    将所述第k+1合并码字中冻结比特所承载的数据设置为预定值，其中，所述第k+1合并码字中冻结比特为所述第k+1合并码字中除承载有用户数据之外的外的其它比特。
  7. 一种数据接收方法，其特征在于，包括：
    接收经过极化编码的第1码字，其中，所述第1码字中包含承载有用户数据的第1信息比特，所述第1信息比特包括所述码字中信道容量从高到低排序的前n个比特；
    使用第1码率对第1码字进行译码；
    如果对所述第1码字的译码出现错误，则接收第2码字，其中，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个相应的第1重传比特所成承载的用户数据相同，所述第2信息比特包括所述码字中信道容量从高到低排序的前p个比特，所述第1重传比特包括所述第1信 息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数；
    使用第2码率对第2合并码字进行译码，其中，所述第2合并码字由所述第2码字与所述第1码字合并生成，所述第2码率高于所述第1码率；
    从对第2合并码字进行译码所得出的译码结果中获取用户数据。
  8. 如权利要求7所述的方法，其特征在于，所述方法还包括：
    如果对第i码字的译码出现错误，则接收第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个相应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字至所述第1码字合并而成，i＝2,3,……,k；k为最大重传次数，q为不大于n的正整数；
    使用第i+1码率对第i+1合并码字进行译码，其中，所述第i+1合并码字由所述第i+1码字与所述第1码字合并生成，第i+1码率高于第i码率，第i码率为对第i合并码字进行译码时的码率；
    从对第i+1合并码字进行译码所得出的译码结果中获取用户数据，所述i码字及第i+1码字均为经过极化编码后的码字。
  9. 如权利要求8所述的方法，其特征在于，当所述第1码字与第2码字的长度相等，且第i+1码字为第i码字长度的两倍时，所述第2码率为所述第1码率的2倍，所述第i+1码率为所述第i码率的2倍。
  10. 如权利要求8或9所述的方法，其特征在于，使用对第i+1合并码字进行译码包括：
    如果待译码比特为第1待译码比特，那么根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果，其中，所述第1待译码比特为第i信息比特其中之一，所述第2待译码比特为第i+1信息比特至第k+1信息比特其中之一，并且所述第1待译码比特与所述第2待译码比特所承载的数据相同。
  11. 如权利要求10所述的方法，其特征在于，根据第2待译码比特的译码结 果确定所述第1待译码比特的译码结果包括：
    当对第i+1合并码字译码所采用的译码方式为串行抵消译码时，将所述第2待译码比特的译码结果作为所述第1待译码比特的译码结果。
  12. 如权利要求10所述的方法，其特征在于，根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果包括：
    当对第i+1合并码字译码所采用的译码方式为列表译码时，选择对第2待译码比特进行译码过程中所产生幸存路径的相同判决分支，并分别计算每一个所述相同判决分支的分支度量，从而确定第1待译码比特位的译码结果。
  13. 一种发送设备，其特征在于，包括：
    第一码字生成单元，用于生成第1码字以及第2码字，其中，所述第1码字中包含n个承载有用户数据的第1信息比特，所述第1信息比特包括所述第1码字中信道容量从高到低排序的前n个比特，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个唯一对应的第1重传比特所成承载的用户数据相同，其中，第2信息比特包括所述第2码字中信道容量从高到低排序的前p个比特，第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数，所述第1码字及所述第2码字均为经过极化编码后的码字；
    发送单元，用于发送所述第1码字；在所述第1码字发送完成后，发送经过所述第2码字。
  14. 如权利要求13所述的发送设备，其特征在于，
    所述发送单元，还用于在第i码字发送完成后，发送第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个唯一对应的第i重传比特所成承载的用户数据相同，
    其中，第i+1信息比特包括所述第i+1码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字与第i-1合并码字合并而成，i＝2,3,……,k，第1合并码字为所述第1码字；k为最大重传次数，q为不大于n的正整数，所述i码字及第i+1码字均为经过极化编码后的码字。
  15. 如权利要求14所述的发送设备，其特征在于，所述第1码字与第2码字的长度相等，所述第i+1码字为所述第i码字长度的两倍。
  16. 如权利要求14所述的发送设备，其特征在于，所述第1码字至第i+1码字中的冻结比特均承载预定值，其中，所述冻结比特为第1码字至第i+1码字中除信息比特之外的其它比特。
  17. 如权利要求14至16任一项所述的发送设备，其特征在于，所述装置还包括，第二码字生成单元，所述第二码字生成单元包括：
    第一信道估计子单元，用于对第i+1合并码字进行信道估计从而得到所述第i+1合并码字的极化信道容量分布，其中，所述第i+1合并码字由第i+1码字至第1码字按照降序合并而成；
    目标比特选择子单元，用于选取第1信息比特至第i信息比特中信道容量从低到高排序的前q个比特作为第i目标比特；
    信息比特选取子单元，用于选取所述i+1码字中信道容量从高到低排序的前q个比特作为第i+1信息比特；
    第一复制子单元，用于将每一个所述第i目标比特中所承载的用户数据复制至对应的第i+1信息比特中；
    第一设置子单元，用于将所述第i+1码字中冻结比特所承载的数据设置为预定值，所述第i+1码字中冻结比特为所述第i+1码字中除第i+1信息比特之外其他比特。
  18. 如权利要求14至16所述的发送设备，其特征在于，所述第一码字生成单元包括：
    第二信道估计子单元，用于对第k+1合并码字进行信道估计，从而得到所述第k+1合并码字的极化信道容量分布，其中，所述第k+1合并码字由第k+1码字至第1码字按照降序合并而成；
    写入子单元，用于将用户数据写入所述第k+1合并码字中信道容量最高的n个比特；
    第二复制子单元，用于依次将第k+1码字至第2码字中待复制比特所承载的数据复制到待复制比特所对应的目标比特，其中，第j码字中的待复制比特包括所述第j码字中承载有用户数据的比特，所述目标比特位包括第j-1合并码字中 除承载有用户数据的比特之外信道容量最高的比特，j＝2,3,……k+1；
    第二设置子单元，用于将所述第k+1合并码字中冻结比特所承载的数据设置为预定值，其中，所述第k+1合并码字中冻结比特为所述第k+1合并码字中除承载有用户数据之外的外的其它比特。
  19. 一种接收设备，其特征在于，包括：接收单元、译码单元及获取单元；
    所述接收单元，用于接收经过极化编码的第1码字，其中，所述第1码字中包含承载有用户数据的第1信息比特，所述第1信息比特包括所述码字中信道容量从高到低排序的前n个比特；
    所述译码单元，用于使用第1码率对第1码字进行译码；
    所述接收单元，还用于如果对所述第1码字的译码出现错误，则接收第2码字，其中，所述第2码字中包含p个承载有用户数据的第2信息比特，并且每一个所述第2信息比特与一个相应的第1重传比特所成承载的用户数据相同，所述第2信息比特包括所述码字中信道容量从高到低排序的前p个比特，所述第1重传比特包括所述第1信息比特中信道容量从低到高排序的前p个比特，n为正整数，p为不大于n的正整数；
    所述译码单元，还用于使用第2码率对第2合并码字进行译码，其中，所述第2合并码字由所述第2码字与所述第1码字合并生成，所述第2码率高于所述第1码率；
    所述获取单元，用于从对第2合并码字进行译码所得出的译码结果中获取用户数据。
  20. 如权利要求19所述的接收设备，其特征在于，
    所述接收单元，还用于如果对第i码字的译码出现错误，则接收第i+1码字，所述第i+1码字中包含q个承载有用户数据的第i+1信息比特，并且每一个所述第i+1信息比特与一个相应的第i重传比特所成承载的用户数据相同，其中，第i+1信息比特包括所述码字中信道容量从高到低排序的前q个比特，第i重传比特包括第i合并码字承载有用户数据的比特中信道容量从低到高排序的前q个比特，所述第i合并码字由所述第i码字至所述第1码字合并而成，i＝2,3,……,k；k为最大重传次数，q为不大于n的正整数；
    所述译码单元，还用于使用第i+1码率对第i+1合并码字进行译码，其中，所述第i+1合并码字由所述第i+1码字与所述第1码字合并生成，第i+1码率高 于第i码率，第i码率为对第i合并码字进行译码时的码率；
    所述获取单元，还用于从对第i+1合并码字进行译码所得出的译码结果中获取用户数据，所述i码字及第i+1码字均为经过极化编码后的码字。
  21. 如权利要求20所述的装置，其特征在于，所述当所述第1码字与第2码字的长度相等，且第i+1码字为第i码字长度的两倍时，所述第2码率为所述第1码率的2倍，所述第i+1码率为所述第i码率的2倍。
  22. 如权利要求20或21所述的接收设备，其特征在于，
    所述译码单元，具体用于在待译码比特为第1待译码比特时，根据第2待译码比特的译码结果确定所述第1待译码比特的译码结果，其中，所述第1待译码比特为第i信息比特其中之一，所述第2待译码比特为第i+1信息比特至第k+1信息比特其中之一，并且所述第1待译码比特与所述第2待译码比特所承载的数据相同。
  23. 如权利要求22所述的接收设备，其特征在于，
    所述译码单元，具体用于当对第i+1合并码字译码所采用的译码方式为串行抵消译码时，将所述第2待译码比特的译码结果作为所述第1待译码比特的译码结果。
  24. 如权利要求22所述的接收设备，其特征在于，
    所述译码单元，具体用于当对第i+1合并码字译码所采用的译码方式为列表译码时，选择对第2待译码比特进行译码过程中所产生幸存路径的相同判决分支，并分别计算每一个所述相同判决分支的分支度量，从而确定第1待译码比特位的译码结果。
PCT/CN2016/081553 2016-05-10 2016-05-10 数据发送方法、数据接收方法及发送设备与接收设备 WO2017193281A1 (zh)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP16901236.6A EP3444984B1 (en) 2016-05-10 2016-05-10 Data transmission method, data receiving method, transmission apparatus, and receiving apparatus
CN201680085091.0A CN109075911B (zh) 2016-05-10 2016-05-10 数据发送方法、数据接收方法及发送设备与接收设备
JP2018559383A JP2019515592A (ja) 2016-05-10 2016-05-10 データ送信方法、データ受信方法、送信デバイス、および受信デバイス
PCT/CN2016/081553 WO2017193281A1 (zh) 2016-05-10 2016-05-10 数据发送方法、数据接收方法及发送设备与接收设备
US16/183,187 US10826651B2 (en) 2016-05-10 2018-11-07 Data sending method, data receiving method, sending device, and receiving device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/081553 WO2017193281A1 (zh) 2016-05-10 2016-05-10 数据发送方法、数据接收方法及发送设备与接收设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/183,187 Continuation US10826651B2 (en) 2016-05-10 2018-11-07 Data sending method, data receiving method, sending device, and receiving device

Publications (1)

Publication Number Publication Date
WO2017193281A1 true WO2017193281A1 (zh) 2017-11-16

Family

ID=60266095

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/081553 WO2017193281A1 (zh) 2016-05-10 2016-05-10 数据发送方法、数据接收方法及发送设备与接收设备

Country Status (5)

Country Link
US (1) US10826651B2 (zh)
EP (1) EP3444984B1 (zh)
JP (1) JP2019515592A (zh)
CN (1) CN109075911B (zh)
WO (1) WO2017193281A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2021521723A (ja) * 2018-04-30 2021-08-26 ポララン ハベレスメ テクノリジレリ アノニム シルケティ 組織的極符号化を使用してデータを再送信するための方法およびシステム
JP2022515268A (ja) * 2018-12-25 2022-02-17 華為技術有限公司 データ伝送方式及び通信デバイス

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020150923A1 (en) * 2019-01-23 2020-07-30 Qualcomm Incorporated Rate-splitting construction of polar coded hybrid automatic repeat request (harq) scheme
CN112118074B (zh) * 2019-06-21 2021-12-03 华为技术有限公司 一种通信方法及装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102122966A (zh) * 2011-04-15 2011-07-13 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CN102164025A (zh) * 2011-04-15 2011-08-24 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
US20140169388A1 (en) * 2012-12-14 2014-06-19 Sungkyunkwan University Research & Business Foundation Packet decoding method and apparatus
CN104038234A (zh) * 2013-03-07 2014-09-10 华为技术有限公司 极性码的译码方法和译码器
WO2015139316A1 (zh) * 2014-03-21 2015-09-24 华为技术有限公司 一种极化码的重传方法及装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2156889C (en) * 1994-09-30 1999-11-02 Edward L. Schwartz Method and apparatus for encoding and decoding data
CN101183919B (zh) * 2007-11-26 2011-09-14 华中科技大学 一种组合的混合自动请求重传方法
CN101183918B (zh) * 2007-11-26 2010-11-03 华中科技大学 一种自适应混合自动请求重传方法
CN107819545B (zh) * 2016-09-12 2020-02-14 华为技术有限公司 极化码的重传方法及装置
CN108833050B (zh) * 2017-03-24 2019-07-12 华为技术有限公司 编码方法、译码方法、装置和设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102122966A (zh) * 2011-04-15 2011-07-13 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CN102164025A (zh) * 2011-04-15 2011-08-24 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
US20140169388A1 (en) * 2012-12-14 2014-06-19 Sungkyunkwan University Research & Business Foundation Packet decoding method and apparatus
CN104038234A (zh) * 2013-03-07 2014-09-10 华为技术有限公司 极性码的译码方法和译码器
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
WO2015139316A1 (zh) * 2014-03-21 2015-09-24 华为技术有限公司 一种极化码的重传方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3444984A4 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2021521723A (ja) * 2018-04-30 2021-08-26 ポララン ハベレスメ テクノリジレリ アノニム シルケティ 組織的極符号化を使用してデータを再送信するための方法およびシステム
JP7166513B2 (ja) 2018-04-30 2022-11-08 ポララン ハベレスメ テクノリジレリ アノニム シルケティ 組織的極符号化を使用してデータを再送信するための方法およびシステム
JP2022515268A (ja) * 2018-12-25 2022-02-17 華為技術有限公司 データ伝送方式及び通信デバイス
US11496238B2 (en) 2018-12-25 2022-11-08 Huawei Technologies Co., Ltd. Data transmission method and communications device
JP7252344B2 (ja) 2018-12-25 2023-04-04 華為技術有限公司 データ伝送方式及び通信デバイス

Also Published As

Publication number Publication date
JP2019515592A (ja) 2019-06-06
US10826651B2 (en) 2020-11-03
EP3444984A4 (en) 2019-04-17
CN109075911B (zh) 2020-12-08
EP3444984A1 (en) 2019-02-20
CN109075911A (zh) 2018-12-21
EP3444984B1 (en) 2022-02-23
US20190074928A1 (en) 2019-03-07

Similar Documents

Publication Publication Date Title
CN109586843B (zh) 通信系统中冗余版本的设计方案
US10826651B2 (en) Data sending method, data receiving method, sending device, and receiving device
CN107342845B (zh) 一种速率匹配的方法和装置
US20190393978A1 (en) Communications method and apparatus
WO2018045849A1 (zh) 极化码的重传方法及装置
JP7258882B2 (ja) 方法及び装置
CN107409006B (zh) 极化码的混合自动重传请求方法和装置
WO2018214927A1 (zh) 编译码方法及装置
CN112636879B (zh) 基于混合自动重传请求的码块处理的方法和装置
EP4156579A1 (en) Polar code encoding method and apparatus, and polar code decoding method and apparatus
US11323209B2 (en) Modem chips and receivers for performing hybrid automatic repeat request processing
CN109756307A (zh) 数据重传方法及装置
CN112994844A (zh) 一种信道编码方法、数据接收方法及相关设备
WO2022022516A1 (zh) 无线通信的方法和装置
CN109039546B (zh) 一种用于信道编码的ue、基站中的方法和设备
WO2021208581A1 (zh) 一种编码方法及通信装置
KR20210116104A (ko) 연판정을 이용한 복호 방법 및 장치
US9331814B2 (en) Hybrid automatic repeat-request combination for wireless transmissions
WO2018058596A1 (zh) 数据传输方法及设备
CN114415946A (zh) 解速率匹配的方法及装置、终端设备、芯片及存储介质
WO2017101072A1 (zh) 数据传输方法、装置、终端及基站
CN108173619A (zh) 一种信息编码方法、解码方法及装置

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2018559383

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2016901236

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2016901236

Country of ref document: EP

Effective date: 20181113

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

Ref document number: 16901236

Country of ref document: EP

Kind code of ref document: A1