WO2019062861A1 - 通信系统中冗余版本的设计方案 - Google Patents

通信系统中冗余版本的设计方案 Download PDF

Info

Publication number
WO2019062861A1
WO2019062861A1 PCT/CN2018/108360 CN2018108360W WO2019062861A1 WO 2019062861 A1 WO2019062861 A1 WO 2019062861A1 CN 2018108360 W CN2018108360 W CN 2018108360W WO 2019062861 A1 WO2019062861 A1 WO 2019062861A1
Authority
WO
WIPO (PCT)
Prior art keywords
redundancy version
order
transmission
redundancy
communication device
Prior art date
Application number
PCT/CN2018/108360
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 EP18860322.9A priority Critical patent/EP3691162B1/en
Priority to JP2020518454A priority patent/JP7017627B2/ja
Priority to KR1020207012543A priority patent/KR102343666B1/ko
Priority to BR112020006259-6A priority patent/BR112020006259A2/pt
Publication of WO2019062861A1 publication Critical patent/WO2019062861A1/zh
Priority to US16/833,655 priority patent/US11277231B2/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/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]
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • 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
    • 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/1607—Details of the supervisory signal
    • 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/1825—Adaptation of specific ARQ protocol parameters according to transmission conditions
    • 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
    • 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/189—Transmission or retransmission of more than one copy of a message
    • 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/1896—ARQ related signaling
    • 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/22—Arrangements for detecting or preventing errors in the information received using redundant apparatus to increase reliability
    • 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/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0022—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy in which mode-switching is influenced by the user

Definitions

  • the embodiments of the present invention relate to the field of communications, and more particularly, are not intended to be limiting, and embodiments of the present invention relate to a design of a redundancy version (RV) for retransmission in a communication system.
  • RV redundancy version
  • Hybrid Automatic Repeat Request (HARQ) technology is an important technology in wireless communication systems, which can improve the reliability of data links.
  • Low density parity check (LDPC) code is a kind of linear block coding with sparse check matrix, which has the characteristics of flexible structure and low decoding complexity. Because it uses a partially parallel iterative decoding algorithm, it has a higher throughput than the traditional Turbo code.
  • the LDPC code is considered to be the next-generation error correction code of the communication system, and can be used to improve the reliability and power utilization of channel transmission; and can be widely applied to space communication, optical fiber communication, personal communication systems, ADSL, and magnetic recording equipment. At present, LDPC codes have been considered as one of channel coding methods in the fifth generation mobile communication.
  • the communication device performs rate matching on the channel coding to adjust the code rate of the coding block, and obtains a bit sequence to be transmitted to match the decoding code rate.
  • the communication device may also perform bit puncturing to improve the code rate of the LDPC code block generated by the coding when the rate is matched, or perform bit repetition to reduce the code rate for the LDPC code block generated by the coding when the rate is matched.
  • the communication device at the transmitting end selects the bit sequence to be transmitted in the rate matching step, and performs processing after interleaving, mapping, etc., and then sends the bit sequence to the receiving end communication device.
  • the receiving end communication device combines the soft value of the bit sequence and the saved soft channel bit to obtain a coded block.
  • the bit sequence encoded by the LDPC code has poor HARQ performance when the communication device adopts the existing rate matching method.
  • Embodiments of the present invention provide a method, an apparatus, a communication device, and a communication system for information processing, which can improve HARQ performance.
  • a method for information processing in a communication system comprising:
  • the redundancy version order being used to indicate a transmission order of the plurality of redundancy versions
  • a redundancy version in the cache sequence is obtained and transmitted based on the redundancy version order and the number of transmissions.
  • the method further includes:
  • a method for information processing in a communication system including:
  • the redundancy version order being used to indicate a transmission order of the plurality of redundancy versions
  • the received redundancy version is merged in the cache sequence based on the redundancy version order and the number of transmissions.
  • the method further includes performing LDPC decoding on the cache sequence.
  • information indicating a redundancy version order may be received, and a redundancy version order is determined from the information indicating the redundancy version order.
  • the redundancy version sequence may be determined according to at least one of the following factors: a service type, or a transmission mode, or a transmission code rate.
  • the service type includes at least one of the following: eMBB, URLCC, mMTC, VoNR, and the like;
  • the transmission mode includes at least one of the following: Grant free, multi-slot aggregation, and the like.
  • the foregoing factors may be used as a transmission scenario, or may be combined to obtain a transmission scenario, and the HARQ performance may be improved by obtaining a redundancy version sequence that can match the performance of the scenario according to the corresponding transmission scenario.
  • the redundancy version is represented by a sequence of redundancy version numbers as ⁇ 0, 2, 3, 1 ⁇ or ⁇ 0, 3, 2, 1 ⁇ .
  • the redundancy version is represented by a sequence of redundancy version numbers as ⁇ 0, 3, 2, 1 ⁇ or ⁇ 0, 3, 0, 3 ⁇ .
  • the redundancy version is represented by a sequence of redundancy version numbers as ⁇ 0, 3, 0, 3 ⁇ .
  • the plurality of redundancy versions are all self-decoding redundancy versions.
  • the redundancy version order may be one of the following: ⁇ 0, 3, 0, 3 ⁇ , or, ⁇ 0, 3, 3, 3 ⁇ , or, ⁇ 0, 0, 3, 3 ⁇ , or, ⁇ 0,3,3,0 ⁇ , or, ⁇ 0,0,0,3 ⁇ , or, ⁇ 0,0,0,0 ⁇ , or, ⁇ 3,3,3,3 ⁇ .
  • the redundancy version order may be one of the following: ⁇ 0, 3, 0, 3 ⁇ , or, ⁇ 0, 3, 3,3 ⁇ , or, ⁇ 0,0,3,3 ⁇ , or, ⁇ 0,3,3,0 ⁇ , or, ⁇ 0,0,0,3 ⁇ , or, ⁇ 0,0,0,3 ⁇ , or, ⁇ 0,0,0,0 ⁇ , or, ⁇ 3, 3, 3, 3 ⁇ , or, ⁇ 0, 2, 3, 1 ⁇ , or, ⁇ 0, 3, 2, 1 ⁇ .
  • the information indicating the order of the redundancy version is transmitted on the downlink control channel or the downlink data channel.
  • the information indicating the order of the redundancy version is carried in the physical layer signaling or the RRC signaling, and is sent on the downlink control information or the downlink data channel.
  • the base map of the LDPC code is BG1
  • the corresponding four starting positions are ⁇ 0z, 17z, 33z, 56z ⁇ , respectively.
  • Redundancy version 0 is a bit sequence obtained from the 0th bit in the buffer sequence W;
  • Redundancy version 1 is a bit sequence obtained from the 17th bit in the buffer sequence W;
  • Redundancy version 2 is a bit sequence obtained from the 33th bit in the buffer sequence W;
  • Redundancy version 3 is a sequence of bits taken from the 56th bit in the buffer sequence W.
  • the base map of the LDPC code is BG2
  • the corresponding four starting positions are ⁇ 0z, 13z, 25z, 43z ⁇ , respectively.
  • Redundancy version 0 is a bit sequence obtained from the 0th bit in the buffer sequence W;
  • Redundancy version 1 is a bit sequence obtained from the 13th bit in the buffer sequence W;
  • Redundancy version 2 is a bit sequence obtained from the 25th bit in the buffer sequence W;
  • Redundancy version 3 is a sequence of bits taken from the 43th bit in the buffer sequence W.
  • the number of the redundancy version is the same as the number rv idx of the starting position.
  • the redundancy version order may be represented by a sequence of numbers of starting positions; it may also be represented by a sequence of starting positions; it may also be represented by a number of redundant version orders, in this manner Each redundancy version order is identified by a number.
  • the information for indicating the order of the redundancy version may include a sequence of numbers of starting positions, or a sequence of starting positions, or a number of redundant version order.
  • a communication apparatus can include a module for performing any of the possible implementations of the first aspect of the method design described above.
  • the module can be software and/or hardware.
  • the communication device provided by the third aspect, comprising: a processing unit, configured to determine a redundancy version order and a number of transmissions; and an obtaining unit, configured to acquire the cache sequence based on the redundancy version order and the number of transmission times Redundant version; transceiver unit for transmitting the redundancy version.
  • the apparatus may be used to perform the method described in any of the possible implementations of the first aspect above, with particular reference to the description of the above aspects.
  • the processing unit and the obtaining unit may be one or more processors, and the transceiver unit may be controlled to send the indication of the redundancy version.
  • the transceiver unit is used for input/output of signals. For example, for outputting a signal corresponding to the output bit sequence, optionally, information indicating the order of the redundancy version may also be transmitted.
  • the transceiver unit may be a transceiver or a transceiver, or may be an input/output circuit or a communication interface.
  • the communication device can be a terminal or a base station or a network device, and its transceiver unit can be a transceiver or a transceiver.
  • the communication device can also be a chip, and its transceiver component can be an input/output circuit of the chip.
  • a communication apparatus can include a module for performing any of the possible implementations of the second aspect of the method design described above.
  • the module can be software and/or hardware.
  • the communication device provided by the fourth aspect includes
  • a determining unit for determining a redundancy version order and a number of transmissions
  • a processing unit configured to merge the received redundancy version in the cache sequence according to the redundancy version order and the number of transmissions.
  • the processing unit is further configured to perform LDPC decoding on the buffer sequence.
  • the apparatus may be used to perform the method described in any of the possible implementations of the second aspect above, with particular reference to the description of the above aspects.
  • the processing unit and the determining unit may be one or more processors.
  • the apparatus may further include a transceiver unit for receiving information indicating a redundancy version order and receiving a signal including a redundancy version of the buffer sequence W.
  • a transceiver unit for receiving information indicating a redundancy version order and receiving a signal including a redundancy version of the buffer sequence W.
  • the transceiver unit is used for input/output of signals. For example, for receiving a signal containing a soft bit sequence.
  • the transceiver unit may be a transceiver or a transceiver, or may be an input/output circuit or a communication interface.
  • the communication device can be a terminal or a base station or a network device, and its transceiver unit can be a transceiver or a transceiver.
  • the communication device can also be a chip, and its transceiver component can be an input/output circuit of the chip.
  • a communication device in a fifth aspect, includes one or more processors.
  • one or more of the processors may be used to implement the functionality of any of the first aspect and the first aspect.
  • the processor can be used to implement other functions in addition to the functions described in the implementation of the first aspect and the first aspect.
  • one or more of the processors may be used to implement the functions of any of the second and second aspects.
  • the processor can be used to implement other functions in addition to the functions described in any of the second aspect and the second aspect.
  • the communication device provided by the fifth aspect may further include a transceiver and an antenna.
  • the communication apparatus provided in the foregoing third to fifth aspects may further include a device for generating a transport block CRC, a device for code block splitting and CRC check, an encoder, an interleaver for interleaving, or A modulator or the like for modulation processing.
  • a device for generating a transport block CRC a device for code block splitting and CRC check
  • an encoder a device for code block splitting and CRC check
  • an encoder for interleaving
  • an interleaver for interleaving
  • a modulator or the like for modulation processing the functionality of these devices can be implemented by one or more processors.
  • the communication apparatus provided in the above third to fifth aspects may further include a demodulator for demodulation operation, a deinterleaver for deinterleaving, a decoder, and the like.
  • a demodulator for demodulation operation e.g., a demodulator for demodulation operation
  • a deinterleaver for deinterleaving e.g., a decoder
  • the functionality of these devices can be implemented by one or more processors in one possible design.
  • an embodiment of the present invention provides a communication system, which includes the communication device of any of the above third to fifth aspects.
  • an embodiment of the present invention provides a computer storage medium having stored thereon a program, and when executed, causes a computer to perform the method described in the above aspect.
  • Yet another aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods described in the various aspects above.
  • the method, device, communication device and communication system of the information processing according to the embodiments of the present invention can improve HARQ performance.
  • Figure 1-1 is a base diagram of an LDPC code
  • Figure 1-2 is a base diagram of another LDPC code
  • FIG. 2 is a structural diagram of a communication system according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of an information processing method according to another embodiment of the present invention.
  • FIG. 5 is a structural diagram of an information processing apparatus according to another embodiment of the present invention.
  • the “communication device” may be a chip (such as a baseband chip, or a data signal processing chip, or a general purpose chip, etc.), a terminal, a base station, or other network device.
  • a terminal is a device having a communication function, and may include a handheld device having a wireless communication function, an in-vehicle device, a wearable device, a computing device, or other processing device connected to a wireless modem.
  • the terminals can be deployed on land, including indoors or outdoors, handheld or on-board; they can also be deployed on the water (such as ships, etc.); they can also be deployed in the air (such as airplanes, balloons, satellites, etc.).
  • the terminal may be a mobile phone, a tablet, a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, and an industrial control (industrial) Wireless terminal in control), wireless terminal in self driving, wireless terminal in remote medical, wireless terminal in smart grid, wireless in transport safety A terminal, a wireless terminal in a smart city, a wireless terminal in a smart home, and the like.
  • Terminals can be called different names in different networks, such as: user equipment, mobile stations, subscriber units, stations, cellular phones, personal digital assistants, wireless modems, wireless communication devices, handheld devices, laptops, cordless phones, Wireless local loop station, etc.
  • the present application is simply referred to as a terminal.
  • a base station also referred to as a base station device, is a device deployed in a radio access network to provide wireless communication functions.
  • the name of a base station may be different in different wireless access systems.
  • a base station is called a Node B
  • a base station in an LTE network is called a base station.
  • a base station in an LTE network is called a base station.
  • a base station in an LTE network is called a base station.
  • a base station in a new radio (NR) network is called a transmission reception point (TRP) or a generation node B (gNB).
  • TRP transmission reception point
  • gNB generation node B
  • other base stations may be used in other networks where multiple technologies are converged, or in other various evolved networks. The invention is not limited to this.
  • the LDPC code can be used for communication system coding.
  • data can be encoded using an LDPC code.
  • the LDPC code can usually be represented by a parity check matrix H.
  • the parity check matrix H of the LDPC code can be obtained by a base graph and a shift value.
  • the base map can usually include m*n matrix elements, which can be represented by a matrix of m rows and n columns. The value of the matrix element is 0 or 1, and the element with a value of 0 is sometimes called a zero element. , indicating that the element can be replaced by z*z's zero matrix.
  • An example of a base map of two LDPC codes is shown in Figures 1-1 and 1-2. As shown in Figure 1-1, BG1 has a size of 46 rows and 68 columns. As shown in Figure 1-2, BG2 has a size of 42 rows and 52 columns.
  • the line number is marked in the leftmost column, the column number is marked on the top row, and only the non-zero elements are shown in each row and column, which is represented by "1", and the blank portion is zero element.
  • the 0th column and the 1st column are 2 columns of built-in punch columns, and do not enter the loop buffer.
  • the element value of the i-th row and the j-th column in the base map is 1, and the offset value is P i,j , P i,j is an integer greater than or equal to 0, the value of the j-th column of the i-th row is 1
  • the elements can be replaced by a cyclic permutation matrix of z*z corresponding to P i,j , which can be obtained by cyclically shifting the unit matrix of z*z by P i, j times to the right.
  • each element with a value of 0 in the base map is replaced with an all-zero matrix of z*z, and each element with a value of 1 is replaced with a cyclic permutation matrix of z*z corresponding to its offset value,
  • z is a positive integer, which can also be called a lifting size, which can be determined according to the code block size supported by the system and the size of the information data. It can be seen that the size of the parity check matrix H is (m*z)*(n*z).
  • the system usually defines a parity check matrix of m*n.
  • Each element in the base matrix corresponds to the position of each element in the base map.
  • the zero element in the base map is based on The position in the matrix is unchanged, and is represented by -1 or Null.
  • the non-zero elements in the i-th row and j-th column of the base map have a position in the base matrix, which can be expressed as P i,j , P i,j A positive integer greater than or equal to 0.
  • the base matrix is sometimes referred to as an offset matrix of the base matrix.
  • information data is transmitted between communication devices (for example, base stations or terminals), and since the wireless propagation environment is complex and variable, it is susceptible to interference and errors occur.
  • the communication device performs CRC check, channel coding, rate matching, interleaving, and the like on the information data, and maps the interleaved coded bits into modulation symbols and transmits them to the communication device at the receiving end.
  • the receiving device After receiving the modulation symbol, the receiving device recovers the information data by deinterleaving, de-rate matching, decoding, and CRC check.
  • the communication system 200 illustrated in FIG. 2 can be widely used to provide various types of communication such as voice, data, and the like.
  • the communication system can include a plurality of wireless communication devices.
  • FIG. 2 shows only communication device 20 and communication device 21.
  • Control information or data information is received and transmitted between the communication device 20 and the communication device 21 as a sequence of information.
  • the communication device 20 acts as a transmitting communication device and performs LDPC encoding processing on the bit sequence C of length K.
  • the bit sequence C may be a bit sequence of control or data information to be transmitted by the communication device 20, or the bit sequence is obtained by at least a code block segmentation process.
  • the bit sequence C of length K may also include a cyclic check bit, and may also include padding bits.
  • the communication device 20 determines the LDPC matrix used for encoding based on the length K of the bit sequence C.
  • the spreading factor z can be determined according to K, and then the base matrix of the corresponding code rate is extended according to z to obtain an LDPC matrix.
  • the bit sequence C is encoded using the LDPC matrix to obtain an encoded coded block.
  • the bit sequence D may be an encoded bit sequence; if the encoded bit sequence is subjected to a shortening operation, that is, truncating s 0 bits from the bit sequence, for example, The s 0 bits are deleted from the encoded bit sequence, and the bit sequence D may be a bit sequence obtained by truncating the s 0 bits from the encoded bit sequence.
  • s 0 is an integer greater than or equal to 0.
  • s 0 n ⁇ r
  • n is a positive integer
  • r is the number of bits included in the unit bit segment in the buffer sequence W.
  • the unit bit segment reflects the granularity set by the starting position in the buffer sequence W.
  • the bit sequence D needs to be interleaved before entering the buffer sequence W. If the number of columns of the interleave matrix is C subblock , the number of rows of the interleave matrix is R subblock , where R subblock is satisfying K D ⁇ C subblock ⁇ R subblock The smallest integer, the number of bits r included in the unit bit segment may be R subblock , that is, the starting position may be set in an integer multiple of R subblock .
  • the bit sequence D has a length of K D .
  • the bit sequence D may include a plurality of bits in the bit sequence C, and may also include one or more parity bits, and the bits in the bit sequence C are sometimes referred to as information bits in the bit sequence D, or system bits ( Systematic bit).
  • the bit sequence D is sometimes also referred to as a coded block.
  • each coding block includes information bits and check bits.
  • the information bits may include advance from bits, and if padding bits are included in the information bits, the padding bits are usually expressed as "null".
  • the coded block or the bit-reordered coded block is stored in a circular buffer of the communication device 20, and the communication device 20 sequentially obtains a plurality of output bits from the coded block in the circular buffer to obtain an output bit sequence, the output bit being a padded bit in the coded block
  • the bits other than the output bit sequence are not including padding bits.
  • mapping to a modulation symbol and then transmitting When the communication device 20 retransmits, another output bit sequence is selected from the coded block in the cyclic buffer. If the output bit is sequentially acquired to reach the last bit of the circular buffer, the output bit is continuously selected from the first bit of the circular buffer.
  • the output bit sequence selected from the coded block in the circular buffer each time may also be referred to as a redundancy version (rv) of the coded block.
  • the communication device 21 demodulates the received modulation symbols, and after deinterleaving, stores the soft values of the received output bit sequence in corresponding positions in the soft buffer. If a retransmission occurs, the communication device 21 combines the soft values of the output bit sequence of each retransmission in the soft information buffer, where the combination means that if the positions of the two received output bits are the same, it will be twice. The soft values of the received output bits are combined.
  • the location in the soft information buffer in communication device 21 is in one-to-one correspondence with the location of the coded blocks in the circular buffer in communication device 20. That is, if the position of the output bit in the coded block in the cyclic buffer in the communication device 20 is the p-th bit, the position of its soft value in the soft information buffer in the communication device 21 is also the p-th bit.
  • the communication device 21 decodes all soft values in the soft information buffer to obtain a code block of the information sequence. Since the communication device 21 can acquire the transport block size, the number of code blocks in which one transport block is divided and the length of each code block can be determined. If the code block includes a CRC bit segment, the communication device 21 can also use the CRC bit segment pair code. The block is checked. The communication device 21 cascades the code blocks into one transport block, further calibrates and cascades the transport blocks to finally obtain a sequence of information. It can be seen that the communication device 21 performs the inverse of the information processing method of the communication device 20.
  • the process of receiving and transmitting the information sequence between the communication device 20 and the communication device 21 is merely an exemplary description.
  • the division of these modules is merely illustrative, and some modules may be designed according to the system. The requirements are optional. It is possible that the functions of some modules can be combined and executed in one module without limitation.
  • these modules can be implemented by software, or hardware, or software in combination with hardware. For example, it may be implemented by one or more processors, and the present invention is not limited thereto.
  • the communication device 20 may be a network device in a communication system, such as a base station, and the corresponding communication device 21 may be a terminal.
  • the communication device 20 may also be a terminal in a communication system, and accordingly, the communication device 21 may be a network device in a communication system, such as a base station or the like.
  • the communication device 20 and the communication device 21 may also be chips. For example, each module of the above process may be implemented by one or more processors.
  • FIG. 3 is a schematic flowchart diagram of an information processing method according to an embodiment of the present invention.
  • the method is applicable to a communication system, where the communication system includes a communication device 20 and a communication device 21.
  • the method can be implemented by the communication device 20, including:
  • the redundancy version order is used to indicate the transmission order of multiple redundancy versions.
  • the communication device 20 can determine the output bit sequence based on the bit sequence D or a portion of the bit sequence D.
  • the output bit sequence for each transmission can be determined based on the bit sequence D or a portion of the bit sequence D.
  • the length N CB buffer sequence W may comprise a bit sequence D or a portion of a bit sequence D, where each bit is an LDPC code.
  • the buffer sequence W may comprise all the bits of the bit sequence D.
  • the buffer sequence W may include a bit sequence D.
  • the buffer sequence W may also include a bit sequence D that has been subjected to at least interleaving processing.
  • the buffer sequence may also include a bit sequence D that has undergone at least padding processing, and for example, a buffer.
  • the sequence may also include a bit sequence D that has been subjected to at least interleaving and padding processing.
  • the buffer sequence W may comprise partial bits of the bit sequence D.
  • the bit sequence D length exceeds the maximum length of the buffer sequence W, so the buffer sequence W can only include some of the bits in the bit sequence D.
  • the buffer sequence W may include partial bits of the bit sequence D.
  • the buffer sequence W may also include partial bits of the bit sequence D at least interleaved, and for example, the buffer sequence may also include at least padded bits.
  • a partial bit of the sequence D, and for example, the buffer sequence may also include partial bits of the bit sequence D that have been subjected to at least interleaving and padding processing.
  • the cache sequence W can also be called a loop cache.
  • the communication device 20 determines the output bit sequence for initial transmission or retransmission in the bit sequence held in the circular buffer.
  • the upper limit of retransmission depends on the maximum number of retransmissions of the system, which may be a redundant version of the bit sequence D for each initial or retransmitted sequence of output bits.
  • k max starting positions may be fixedly set in the buffer sequence W, and k max is an integer greater than or equal to 4.
  • Each starting position can be indicated by a number, that is, an index, for example, rv idx indicates 0 then rv idx ⁇ k max .
  • rv idx indicates 0 then rv idx ⁇ k max .
  • the number rv idx of the four starting positions is one of 0, 1, 2, and 3, respectively.
  • the output bit sequence for each transmission can be obtained starting from one of the k max starting positions in the buffer sequence W. If there are k max starting positions, k max redundancy versions can be obtained. Each redundancy version may correspond to the number rv idx of the starting position in the buffer sequence W.
  • k max 4 as an example, that is, four redundant versions can be obtained from the cache sequence W. It will be understood that the invention is not limited thereto, and k max may also be other values.
  • the number of the redundancy version can sometimes also be represented by rv idx . It can be understood that the position of the 0th bit, that is, the bit with position number 0.
  • the 17th bit, that is, the bit with position number 17z, the 33th bit, that is, the bit with position number 33z, and so on, will not be described below.
  • Redundancy version 0 includes more system bits. If there is no interference or loss during reception, it can usually be decoded independently for redundancy version 0. It can also be said that redundancy version 0 is a self-decoding redundancy version. Redundancy version 3 also includes more system bits, and can also complete decoding independently, belonging to a redundancy version that can be self-decoded.
  • the redundancy versions 1 and 2 are mainly check bits and a small number of system bits, and do not have self-decoding capability, but can be combined and decoded with a redundancy version having self-decoding capability, and the combined bit sequence is used as an LDPC code. The low equivalent code rate can reduce the complexity of decoding.
  • the corresponding redundancy version transmissions are typically acquired sequentially in the order of the redundancy version.
  • the order of the redundancy versions may be represented by a sequence of numbered versions of the redundancy version, or may be represented by a sequence of the number of output bits of each transmission in the start or start position of the buffer sequence W.
  • the invention is not limited to this.
  • the corresponding starting position is determined according to the redundancy version order, and the output bit sequence rv(i) is obtained from the starting position in the buffer sequence W, which may also be referred to as a redundancy version to be transmitted.
  • the starting position can be in the order of ⁇ 0, 2, 3, 1 ⁇ cycles.
  • the redundancy version 0 is obtained from the 0th starting position at the initial transmission, the first time.
  • Redundant version 2 is obtained from the second starting position during retransmission, redundant version 3 is obtained from the third starting position in the second retransmission, and redundant is obtained from the first starting position in the third retransmission
  • the redundancy version 0 is obtained from the 0th starting position in the 4th retransmission, and so on.
  • the 0th column to the 21st column in the base map correspond to the coded bits of the information bits, and the remaining columns correspond to the coded bits of the check bits.
  • the coded bits corresponding to the built-in punctured bit columns of the 0th column and the 1st column do not enter the circular buffer, and the cache sequence W is 66z, and the corresponding starting position is ⁇ 0z, 17z, 33z, 56z ⁇ , rv
  • Table 1 The correspondence between idx and the starting position is shown in Table 1:
  • the obtained output bit sequence contains code bits of more information bits, that is, when the start position of the buffer sequence W is the 0th bit or the 56th bit, the obtained output bit sequence contains More coded bits of information bits, with self-decoding capability.
  • the obtained output bit sequence contains more parity bits, that is, when the starting position of the buffer sequence W is the 17th bit or the 33th bit, the obtained output bit sequence contains more
  • the check bits which do not have self-decoding capability, need to be combined with the redundancy version with self-decoding capability.
  • the 0th column to the 9th column in the base map correspond to the coded bits of the information bits, and the remaining columns correspond to the coded bits of the check bits.
  • the coded bits corresponding to the built-in punctured bit columns of the 0th column and the 1st column do not enter the circular buffer, and the cache sequence W is 50z, and the corresponding starting position is ⁇ 0z, 13z, 25z, 43z ⁇ , rv idx
  • Table 2 The correspondence with the starting position is shown in Table 2:
  • the obtained output bit sequence contains code bits of more information bits, that is, when the start position of the buffer sequence W is 0z bit or 43z bit, the obtained output bit sequence contains More coded bits of information bits, with self-decoding capability.
  • the obtained output bit sequence contains more parity bits, that is, when the starting position of the buffer sequence W is the 13th bit or the 25th bit, the obtained output bit sequence contains more Check bits, not self-decoding. Need to be combined with the redundancy version with self-decoding capability,
  • multiple redundancy versions in the redundancy version sequence may be self-decodeable redundancy versions, for example, a sequence representation of a redundancy version number, and the redundancy version order may be the following One: ⁇ 0,3,0,3 ⁇ , or, ⁇ 0,3,3,3 ⁇ , or, ⁇ 0,0,3,3 ⁇ , or, ⁇ 0,3,3,0 ⁇ , or, ⁇ 0,0,0,3 ⁇ , or, ⁇ 0,0,0,0 ⁇ , or, ⁇ 3,3,3,3 ⁇ .
  • a sequence of redundant version numbers is used as an example, and the redundancy version order may be one of the following: ⁇ 0, 3, 0, 3 ⁇ , or, ⁇ 0, 3, 3 , 3 ⁇ , or, ⁇ 0,0,3,3 ⁇ , or, ⁇ 0,3,3,0 ⁇ , or, ⁇ 0,0,0,3 ⁇ , or, ⁇ 0,0,0,0 ⁇ , or, ⁇ 3, 3, 3, 3 ⁇ , or, ⁇ 0, 2, 3, 1 ⁇ , or, ⁇ 0, 3, 2, 1 ⁇ .
  • the output bit sequence of each transmission is circulated in the order of 0, 3 in rv idx in the buffer sequence W. If the base map of the LDPC matrix is BG1, the starting position is cyclically in the order of 0z, 56z. If the base map of the LDPC matrix is BG2, the starting position is looped in the order of 0z, 43z. In this way, since the redundant version of each transmission has self-decoding capability, even if multiple packet loss occurs, the remaining redundancy versions can complete self-decoding.
  • the output bit sequence of each transmission may be obtained in the above manner in a packet-sensitive scenario, such as Grant Free transmission mode or multi-slot aggregation mode. Since in the Grant Free mode, the transmitting end communication device does not have a uniquely designated air interface physical resource for transmitting data, all the transmitting end communication devices are sent based on contention in a resource pool, so there is a high possibility of collision and strong interference.
  • the receiving communication device cannot implement IR-HARQ merging. If the initial transmission is strongly interfered, the receiving communication device cannot implement IR-HARQ merging. If the first retransmission has a self-decoding redundancy version, the decoding can be completed by the retransmitted redundancy version, and the number of retransmissions is reduced. Save air interface delays and resources.
  • the number of the starting position of the output bit sequence in the buffer sequence W per transmission may be cycled in the order of 0, 2, 3, 1. If the base map of the LDPC matrix is BG1, the starting position is cyclically in the order of 0z, 33z, 56z, 17z. If the base map of the LDPC matrix is BG2, the starting position is cyclically in the order of 0z, 25z, 43z, 13z. If the initial transmission does not drop packets, the initial version of the redundancy version can be self-decoded. If the initial version of the redundancy version is lost, at least the second retransmission is required to complete the decoding, but the first retransmission and the second retransmission are performed. The redundant version of the retransmission has a relatively low equivalent code rate and a comprehensive decoding performance, which can be applied to most scenarios of enhanced mobile broadband (eMBB).
  • eMBB enhanced mobile broadband
  • the number of the starting position of the output bit sequence in the buffer sequence W may be cycled in the order of 0, 3, 2, 1. If the base map of the LDPC matrix is BG1, the starting position is cycled in the order of 0z, 56z, 33z, 17z. If the base map of the LDPC matrix is BG2, the starting position is cyclically in the order of 0z, 43z, 25z, 13z. In this way, if the packet is initially transmitted, the first retransmission includes a self-decoding redundancy version. In the case of the same retransmission of more than 2 times, the performance is consistent with the previous implementation, and the integrated decoding performance is good. It can also be applied to most of the eMBB and ultra-reliable and low latency communications (URLCC). Scenes.
  • URLCC ultra-reliable and low latency communications
  • the redundancy version order may be obtained according to the scenario of the data transmission, and the redundancy version order indicates the transmission order of the multiple redundancy versions of the buffer sequence W, and each data may be determined according to the order of the redundancy version. Redundancy version at the time of transmission.
  • the scenario of the data transmission may be determined according to at least one of the following factors, and it may be said that the redundancy version order is determined according to one or more of the following factors: service type, transmission mode, transmission code rate, and the like.
  • the service type may include eMBB, URLCC, voice over new radio (VoNR), massive machine type communications (mMTC), etc.
  • the transmission mode may include unauthorized free Grant, multi-slot ( Slot) polymerization.
  • eMBB service transmission in Grant free mode URLCC service transmission in multi-slot aggregation mode, and the like. It should be noted that the examples are merely examples and are not limited thereto.
  • the redundancy version order can be ⁇ 0, 2, 3, 1 ⁇ or ⁇ 0, 3, 2, 1 ⁇ .
  • the redundancy version order may be ⁇ 0, 3, 2, 1 ⁇ or ⁇ 0, 3, 0, 3 ⁇ .
  • the redundancy version order may be ⁇ 0, 3, 0, 3 ⁇ .
  • the scene of the data transmission is determined to determine the order of the redundancy version.
  • the order of redundant versions of different service types and/or transmission modes may be specified by configuration, pre-defined, or protocol.
  • the order of ⁇ 0, 2, 3, 1 ⁇ may be selected as the order of the starting position of the redundancy version; for example, the communication device 20
  • the service type of the data transmitted between the communication device 21 and the communication device 21 is URLCC, and the order of 0, 3, 2, 1 may be selected as the starting position of the redundancy version; for example, when the transmission mode is Grant free or multi-slot aggregation. , you can choose the order of 0, 3, 0, 3.
  • the redundancy version configuration information can also be determined in combination with the service type and the transmission mode.
  • the order of the redundancy versions can also be determined in consideration of factors such as channel transmission quality. The description herein is for illustrative purposes only, and the invention is not limited thereto.
  • the communication device 20 may determine the redundancy version of each transmission based on the order of the redundancy versions acquired in step 301, and obtain the output bit sequence of each transmission from the cache sequence W as a redundancy version according to the redundancy version start position. And sent to the communication device 21.
  • the communication device 20 transmits the first transmission, that is, the 0th transmission, that is, the number of transmissions is 1, from the 0th of the cache sequence W.
  • the communication device 20 acquires the output bit sequence of the first retransmission (ie, the number of transmissions is 2) from the 56th bit of the buffer sequence W. That is, the redundancy version rv(1) is determined.
  • the communication device 20 transmits the output bit sequence rv(1) to the communication device 21.
  • the communication device 20 If the communication device 20 receives the NACK from the communication device 21, the communication device 20 acquires the output bit sequence of the second retransmission from the 0th bit of the buffer sequence W, that is, determines the redundancy version rv(2). By analogy, until the maximum number of retransmissions is reached or the retransmission timer expires, or the communication device 20 receives an acknowledgement ACK from the communication device 21, the communication device can end the retransmission. Of course, the communication device 20 can also perform multiple retransmissions without regard to NACK or ACK from the communication device 21.
  • the receiving communication device 21 When the receiving communication device 21 decodes, it needs to combine and decode the received initial soft-valued bits and the soft-valued bits of each redundant version.
  • the receiving communication device 21 In order to improve the decoding performance of the communication device at the receiving end, it is required to reduce the number of bits that are repeated or not transmitted between the redundancy versions.
  • the method may further include:
  • the communication device 20 can transmit information indicating the order of the redundancy versions to the communication device 21 such that the communication device 21 acquires the order of the start positions of the respective redundancy versions in the data transmission.
  • the order of the redundancy versions can be represented by the starting position order, or by the number order corresponding to the starting position, and the order of each redundancy version can be numbered, indicating a sequence by number. As shown in Table 3 below, some examples of the correspondence between the order of the multiple starting positions and the number of the redundancy version are not limited thereto.
  • the information indicating the order of the redundancy version may be represented by any one of the above table 3, that is, the information indicating the order of the redundancy version may be a redundancy version order index, or may be a sequential sequence of numbers of the start positions, or may be The order of the starting positions in different base maps, etc. It is to be understood that the present invention is by way of example only and the invention is not limited thereto.
  • the redundancy version order index may be corresponding to a transmission scenario, and the redundancy version order index may also be a transmission scene index, so that a corresponding redundancy version order may also be obtained according to the transmission scenario.
  • the communication device 20 can transmit information indicating the order of the redundancy version through a control channel or a data channel, such as a downlink control channel, a downlink shared channel, a downlink data channel, and the like.
  • the information indicating the order of the redundancy version may be carried in physical layer signaling, or may be carried in high layer signaling, such as radio resource control (RRC) signaling.
  • RRC radio resource control
  • both the communication device 20 and the communication device 21 may initially perform data transmission in a default redundancy version configuration, for example, data transmission and retransmission processing may be performed in the order of ⁇ 0, 2, 3, 1 ⁇ , if communication
  • the communication device 20 acquires a new redundancy version configuration according to step 301, and indicates to the communication device 21 by signaling, so that the two can be in accordance with the new order. Transfer.
  • the present invention is merely an example, and the present invention is not limited thereto.
  • step 304 is an optional step.
  • information indicating the order of the redundancy versions may also not be sent.
  • a specific redundancy version order may be defined for a certain service type or a certain transmission mode scenario by means of pre-definition or protocol specification.
  • the communication device 21 determines the service type, or the transmission mode, that is, the redundancy version order is known, and therefore, the communication device 20 may not transmit information indicating the order of the redundancy version.
  • step 304 may be performed before or after any step after the foregoing step 301, and the present invention does not specify the order.
  • the communication device may further process the output bit sequence such that the output bit sequence is used in transmitting or receiving, for example, interleaving the output bit sequence, and mapping to Processing of modulation symbols, etc.
  • the output bit sequence is used in transmitting or receiving, for example, interleaving the output bit sequence, and mapping to Processing of modulation symbols, etc.
  • FIG. 4 is a flowchart of an information processing method according to an embodiment of the present invention.
  • the method is applicable to a communication system, where the communication system includes a communication device 20 and a communication device 21.
  • the method can be implemented by the communication device 21, including:
  • the redundancy version order is used to indicate the transmission order of a plurality of redundancy versions, each redundancy version corresponding to the number of a starting position in the buffer sequence W.
  • the redundancy version order may be as described in the foregoing embodiments, and the redundancy version order is determined according to one or more of the following factors: service type, or transmission mode, or transmission code. Rate, the redundancy version order is used to indicate the transmission order of multiple redundancy versions. See the description in the previous embodiment.
  • the redundancy version order may also be information for receiving the order indicating the redundancy version sent by the communication device 20 in step 304 in the foregoing embodiment, and determining the redundancy based on the information indicating the order of the redundancy version. Version order. See the description in the previous embodiment.
  • the received redundancy version is merged in the cache sequence W based on the redundancy version sequence determined in step 401 and the number of transmissions determined in step 402.
  • the communication device 21 receives a signal transmitted by the communication device 20, which includes a redundancy version corresponding to the buffer sequence W in the current transmission, that is, the redundancy version acquired by the communication device 20 in step 303 of the previous embodiment.
  • the communication device 21 demodulates the signal to obtain a sequence of soft values corresponding to the redundancy version in the current transmission.
  • the starting position merged in the buffer sequence W is determined according to the redundancy version order and the number of current transmissions, and the redundancy version of the soft value sequence is merged from the starting position to the buffer sequence W.
  • the soft value bits in the buffer sequence W may also be LDPC coded.
  • the communication device 21 performs LDPC decoding on the soft value bits in the buffer sequence W.
  • the buffer sequence W includes a soft value sequence of the bit sequence D or a part of the soft value sequence of the bit sequence D.
  • the soft sequence sequence length of the bit sequence D is K D bits, and the bit sequence D is a length K.
  • the bit sequence C is based on a bit sequence obtained by encoding a low density parity check LDPC matrix, or the bit sequence D is truncated from a bit sequence obtained by encoding a bit sequence C of length K based on a low density parity check LDPC matrix. s 0 bits are obtained.
  • the communication device 20 transmits the output bit sequence obtained in the foregoing embodiments to the communication device 21.
  • the output bit sequence in the above embodiment is a rate-matched output bit sequence
  • the communication device 20 can rate the The matched output bit sequence is subjected to interleaving modulation or the like to transmit a transmission signal corresponding to the output bit sequence, and the communication device 21 receives the output signal and demodulates and deinterleaves to obtain a soft bit corresponding to the output bit sequence.
  • the sequence, that is, one bit in the output bit sequence corresponds to a soft channel bit in the soft bit sequence.
  • the locations where the soft value bits are stored in the soft information buffer of the communication device 21 correspond one-to-one with the locations of the coded blocks in the circular buffer in the communication device 20, and the size of the soft information buffer is the same as the size of the coded block in the circular buffer. , can be N CB .
  • the output bit transmitted by the communication device 20 is 1, and after the channel transmission, the communication device 21 obtains its corresponding soft value bit to be 1.45. If the position of the output bit in the coding block is the fifth bit, the soft in the communication device 21 The 5th soft value bit in the message buffer is 1.45. It should be noted that the description herein is merely an example, and the embodiment of the present invention is not limited thereto.
  • the communication device 31 can acquire n corresponding soft value bits. If the communication device 31 receives the soft value bits of the same location twice, the two soft values are combined, for example, the soft value bit received during the first transmission is 1.45, and the softness received during the second transmission. The value bit is 0.5, which is 1.95 after the combination. It should be noted that the examples are merely examples and are not limited thereto.
  • the redundancy version has the features corresponding to the foregoing embodiments. For details, refer to the foregoing embodiments, and details are not described herein. It should be noted that, for the communication device 20, the buffer sequence W is a coding block in the circular buffer, and in the communication device 21, the buffer sequence W is a soft value sequence in the soft information buffer; on the side of the communication device 20 The output bit sequence is determined from the coded block in the circular buffer, and on the communication device 21 side, the received soft value sequence is saved in the soft information buffer.
  • FIG. 5 is a schematic structural diagram of a communication device 500.
  • the device 500 can be used to implement the method described in the foregoing method embodiments. For details, refer to the description in the foregoing method embodiments.
  • the communication device 500 can be a chip, a base station, a terminal, or other network device.
  • the communication device 500 can also be the communication device 20 or the communication device 21 of FIG.
  • the communication device 500 includes one or more processors 501.
  • the processor 501 can be a general purpose processor or a dedicated processor or the like. For example, it can be a baseband processor, or a central processing unit.
  • the baseband processor can be used to process communication protocols and communication data
  • the central processor can be used to control communication devices (eg, base stations, terminals, or chips, etc.), execute software programs, and process data of the software programs.
  • the communication device 500 includes one or more of the processors 501, and the one or more processors 501 can be used to implement the methods of the various embodiments shown in FIG. 3 or 4.
  • the processor 501 can implement other functions, such as the functions of the rate matching module or the de-rate matching module in FIG. 2, in addition to implementing the methods of the embodiments shown in FIG. 3 or FIG.
  • the communication device 500 determines a redundancy version order, the redundancy version is sequentially used to indicate a transmission order of the plurality of redundancy versions; determining a number of transmissions; and acquiring a cache sequence based on the redundancy version order and the number of transmissions
  • the redundancy version is used for sending.
  • one or more of the processors 501 can be used to implement the methods of the various embodiments shown in FIG.
  • the communication device 500 determines a redundancy version order, the redundancy version order is used to indicate a transmission order of the plurality of redundancy versions; determining a number of transmissions; and based on the redundancy version order and the number of transmissions in the cache
  • the received redundancy version is merged in the sequence.
  • the communication device 500 may perform LDPC decoding on the soft value bits in the buffer sequence.
  • the processor 501 can also include instructions 503 that can be executed on the processor such that the communication device 500 performs the methods described in the above method embodiments.
  • the communication device 500 can also include circuitry that can be used to implement the functions of the foregoing method embodiments.
  • the communication device 500 may include one or more memories 502 on which the instructions 504 are stored, and the instructions may be executed on the processor, so that the communication device 500 performs the above method embodiment.
  • data may also be stored in the memory.
  • Instructions and/or data can also be stored in the optional processor.
  • the processor and the memory may be provided separately or integrated.
  • the one or more memories 502 may store a starting location, a redundancy version related parameter, and the like.
  • one or more processors 501 can be used to implement the functions of the various modules shown in FIG. 2.
  • the communication device 500 may further include a transceiver 505 and an antenna 506.
  • the processor 501 may be referred to as a processing unit to control a communication device (terminal or base station).
  • the transceiver 505 can be referred to as a transceiver unit, a transceiver, a transceiver circuit, a transceiver interface, or a transceiver, etc., for implementing the transceiver function of the communication device through the antenna 506. For example, information indicating the order of the redundancy versions is transmitted and received, and signals including redundant versions are transmitted and received.
  • the communication device 500 may further comprise a device for generating a transport block CRC, a device for code block splitting and CRC check, an encoder, an interleaver for interleaving, or a modulation for modulation processing. And so on.
  • the functionality of these devices may be implemented by one or more processors 501.
  • the communication device 500 may further include a demodulator for demodulation operation, a deinterleaver for deinterleaving, a decoder, and the like.
  • the functionality of these devices may be implemented by one or more processors 501.
  • a general purpose processor may be a microprocessor.
  • the general purpose processor may be any conventional processor, controller, microcontroller, or state machine.
  • the processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration. achieve.
  • the steps of the method or algorithm described in the embodiments of the present invention may be directly embedded in hardware, instructions executed by a processor, or a combination of the two.
  • the memory can be RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium in the art.
  • the memory can be coupled to the processor such that the processor can read information from the memory and can write information to the memory.
  • the memory can also be integrated into the processor.
  • the processor and the memory may be disposed in an ASIC, and the ASIC may be disposed in the UE. Alternatively, the processor and memory may also be located in different components in the UE.
  • the present invention can be implemented in hardware, firmware implementation, or a combination thereof.
  • a software program it may be implemented in whole or in part in the form of a computer program product comprising one or more computer instructions (which may also be referred to as a program or code).
  • the processes or functions described in accordance with embodiments of the present invention are generated in whole or in part.
  • the functions described above may also be stored in or transmitted as one or more instructions or code on a computer readable medium.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another.
  • a storage medium may be any available media that can be accessed by a computer.
  • computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure.
  • Any connection may suitably be a computer readable medium.
  • a disk and a disc include a compact disc (CD), a laser disc, a compact disc, a digital versatile disc (DVD), a floppy disk, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.

Landscapes

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

Abstract

本申请公开了信息处理的方法，装置、通信设备和通信系统。通信设备用于确定冗余版本的传输次序，所述冗余版本的传输次序用于表示多个冗余版本的发送顺序；确定传输次数；基于所述冗余版本的传输次序和所述传输次数获取缓存序列中的冗余版本并发送。该通信设备可以用于支持多种冗余版本的传输次序的通信系统，例如第5代(5G)通信系统中。由于冗余版本的传输次序在数据传输前确定，提高了通信的效率，改善HARQ性能。

Description

通信系统中冗余版本的设计方案
本申请要求于2017年9月29日提交中国国家知识产权局、申请号为201710911469.4、申请名称为“通信系统中冗余版本的设计方案”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明实施例涉及通信领域，更具体而言，同时并非为了限制，本发明实施例涉及通信系统中用于重传的冗余版本(RV)的设计。
背景技术
在无线通信系统中，混合自动重传请求(Hybrid Automatic Repeat Request，HARQ)技术是一项重要的技术，能够很好地提高数据链路的可靠性。
低密度奇偶校验(low density parity check，LDPC)码是一类具有稀疏校验矩阵的线性分组编码，具有结构灵活，译码复杂度低的特点。由于它采用部分并行的迭代译码算法，从而比传统的Turbo码具有更高的吞吐率。LDPC码被认为是通信系统的下一代纠错码，可用来提高信道传输的可靠性和功率利用率；并可以广泛应用于空间通信、光纤通信、个人通信系统、ADSL和磁记录设备等。目前在第五代移动通信中已考虑采用LDPC码作为信道编码方式之一。
为了支持各种不同码长码率，通信设备在信道编码后会进行速率匹配调整编码块的码率，获取要发送的比特序列，以匹配译码码率。通信设备还可以在速率匹配时对编码生成的LDPC码块进行比特打孔提高码率，或者在速率匹配时对编码生成的LDPC码块进行比特重复降低码率。
发送端的通信设备在速率匹配环节选取要发送的比特序列，经过交织、映射等处理后发送给接收端通信设备。接收端通信设备将比特序列的软值和已保存的软值比特(soft channel bit)合并译码得到编码块。
采用LDPC码编码的比特序列，通信设备采用已有的速率匹配方法时，HARQ性能较差。
发明内容
本发明实施例提供了一种信息处理的方法、装置、通信设备和通信系统，可以改善HARQ性能。
第一方面，提供了一种通信系统中信息处理的方法，包括：
确定冗余版本顺序，所述冗余版本顺序用于表示多个冗余版本的发送顺序；
确定传输次数；
基于所述冗余版本顺序和所述传输次数获取缓存序列中的冗余版本并发送。
在一种可能的实现方式中，所述方法还包括：
发送指示所述冗余版本顺序的信息。
第二方面，提供了一种通信系统中信息处理的方法，包括：
确定冗余版本顺序，所述冗余版本顺序用于表示多个冗余版本的发送顺序；
确定传输次数；
基于所述冗余版本顺序和所述传输次数在缓存序列中合并接收到的冗余版本。
可选地，还包括对所述缓存序列进行LDPC译码。
在一种可能的设计中
在第二方面的一种可能的实现方式中，可以接收指示冗余版本顺序的信息，从所述指示冗余版本顺序的信息中确定冗余版本顺序。
基于上述各方面或各可能的实现方式，在又一种可能的实现方式中，可以至少根据下述因素之一确定所述冗余版本顺序：业务类型，或者，传输模式，或者传输码率。
其中，业务类型包括以下至少一个：eMBB，URLCC，mMTC，VoNR等；
传输模式包括以下至少一个：Grant free，多时隙聚合等。
上述因素可以分别作为一个传输场景，也可以进行组合得到传输场景，根据相应地传输场景获取到可匹配该场景性能的冗余版本顺序，可以改善HARQ性能。
一种设计中，若业务类型为eMBB，所述冗余版本顺序以冗余版本编号的序列表示为{0,2,3,1}或者{0,3,2,1}。
又一种设计中，若业务类型为URLCC，所述冗余版本顺序以冗余版本编号的序列表示为{0,3,2,1}或者{0,3,0,3}。
又一种设计中，若传输模式为Grant Free或者多时隙聚合，所述冗余版本顺序以冗余版本编号的序列表示为{0,3,0,3}。
可以理解，上述设计可以单独应用，也可以组合应用。
在上述各方面或者各实现方式的一种可能的设计中，所述多个冗余版本均为可自解码的冗余版本。例如，冗余版本顺序可以为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
由于多次重传的比特序列中至少存在两个2可自解码的冗余版本，提高了译码的成功率，减少了重传次数。
基于上述各方面或各可能的实现方式，在又一种可能的设计中，所述冗余版本顺序可以为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}，或者，{0,2,3,1}，或者，{0,3,2,1}。
在上述各方面的一种可能的设计中，指示冗余版本顺序的信息是在下行控制信道或下行数据信道上发送的。例如，所述指示冗余版本顺序的信息承载于所述物理层信令或者RRC信令，在下行控制信息或下行数据信道上发送。
如果LDPC码的基图为BG1，相应地四个起始位置分别为{0z，17z，33z，56z}。相应地：
冗余版本0为从缓存序列W中第0z比特开始获取的比特序列；
冗余版本1为从缓存序列W中第17z比特开始获取的比特序列；
冗余版本2为从缓存序列W中第33z比特开始获取的比特序列；
冗余版本3为从缓存序列W中第56z比特开始获取的比特序列。
如果LDPC码的基图为BG2，相应地四个起始位置分别为{0z，13z，25z，43z}。相应地：
冗余版本0为从缓存序列W中第0z比特开始获取的比特序列；
冗余版本1为从缓存序列W中第13z比特开始获取的比特序列；
冗余版本2为从缓存序列W中第25z比特开始获取的比特序列；
冗余版本3为从缓存序列W中第43z比特开始获取的比特序列。
在一种可能的设计中，冗余版本的编号和起始位置的编号rv idx保持一致。
可选地，冗余版本顺序可以通过各起始位置的编号的序列来表示；也可以通过各起始位置的序列来表示；还可以通过冗余版本顺序的编号来表示，在这种方式下，每种冗余版本顺序都以一个编号来标识。用于指示冗余版本顺序的信息可以包括起始位置的编号的序列，或者，起始位置的序列，或者冗余版本顺序的编号。
第三方面，提供一种通信装置可以包含用于执行上述方法设计中第一方面任一种可能的实现方式相对应的模块。所述模块可以是软件和/或是硬件。
在一个可能的设计中，第三方面提供的通信装置，包括处理单元用于确定冗余版本顺序和传输次数；获取单元，用于基于所述冗余版本顺序和所述传输次数获取缓存序列中的冗余版本；收发单元，用于发送所述冗余版本。
所述装置可以用于执行上述第一方面任一种可能的实现方式所述的方法，具体参照上述方面的描述。
一种可能的设计中，所述处理单元和获取单元可以是一个或多个处理器，可控制收发单元发送指示所述冗余版本。
所述收发单元用于信号的输入/输出。例如，用于输出对应于输出比特序列的信号，可选地，还可以发送指示冗余版本顺序的信息。
所述收发单元可以是收发器或收发机，也可以是输入/输出电路或通信接口。例如，通信装置可以是终端或者基站或者网络设备，其收发单元可以是收发器或收发机。通信装置也可以是芯片，其收发组件可以是芯片的输入/输出电路。
第四方面，提供一种通信装置可以包含用于执行上述方法设计中第二方面任一种可能的实现方式相对应的模块。所述模块可以是软件和/或是硬件。
在一种可能的设计中，第四方面提供的通信装置，包括
确定单元，用于确定冗余版本顺序和传输次数；
处理单元，用于根据所述冗余版本顺序和传输次数在所述缓存序列中合并接收到的冗余版本。
可选地，处理单元还可以用于对缓存序列进行LDPC译码。
所述装置可以用于执行上述第二方面任一种可能的实现方式所述的方法，具体参照上述方面的描述。
一种可能的设计中，所述处理单元和确定单元可以是一个或多个处理器。
可选地，所述装置还可以包括收发单元用于接收指示冗余版本顺序的信息以及接收包括缓存序列W的冗余版本的信号。
所述收发单元用于信号的输入/输出。例如用于接收包含软比特序列的信号。
所述收发单元可以是收发器或收发机，也可以是输入/输出电路或通信接口。例如，通信装置可以是终端或者基站或者网络设备，其收发单元可以是收发器或收发机。通信装置也可以是芯片，其收发组件可以是芯片的输入/输出电路。
第五方面，提供了一种通信装置，包括一个或多个处理器。
在一种可能的设计中，一个或多个所述处理器可用于实现第一方面及第一方面中任一实现方式的功能。可选的，处理器除了可用于实现第一方面及第一方面中任一实现方式所述的功能，还可以用于实现其他功能。
在一种可能的设计中，一个或多个所述处理器可用于实现第二方面及第二方面中任一实现方式的功能。可选的，处理器除了可用于实现第二方面及第二方面中任一实现方式所述的功能，还可以用于实现其他功能。
可选地，第五方面提供的通信装置还可以包括收发器以及天线。
可选的，上述第三至第五方面提供的通信装置还可以包括用于产生传输块CRC的器件、用于码块分割和CRC校验的器件、编码器、用于交织的交织器、或者用于调制处理的调制器等。在一种可能的设计中，可以通过一个或多个处理器实现这些器件的功能。
可选的，上述第三至第五方面提供的通信装置还可以包括，用于解调操作的解调器、用于解交织的解交织器、或者译码器等等。在一种可能的设计中可以通过一个或多个处理器实现这些器件的功能。
第六方面，本发明实施例提供了一种通信系统，该系统包括上述第三至第五方面任一方面所述的通信装置。
再一方面，本发明实施例提供了一种计算机存储介质，其上存储有程序，当其运行时，使得计算机执行上述方面所述的方法。
本申请的又一方面提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本发明实施例的信息处理的方法、装置、通信设备和通信系统，可以改善HARQ性能。
附图说明
图1-1为一LDPC码的基图；
图1-2为另一LDPC码的基图；
图2为本发明一实施例提供的通信系统的结构图；
图3为本发明另一实施例提供的信息处理方法的流程图；
图4为本发明另一实施例提供的信息处理方法的流程图；
图5为本发明另一实施例提供的信息处理装置的结构图。
具体实施方式
为便于理解下面对本申请中涉及到的一些名词做些说明。
本申请中，名词“网络”和“系统”经常交替使用，“装置”和“设备”也经常交替使用，但本领域的技术人员可以理解其含义。“通信装置”可以是芯片(如基带芯片，或者数据信号处理芯片，或者通用芯片等等)，终端，基站，或者其他网络设备。
终端是一种具有通信功能的设备，可以包括具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备等。所述终端可以部署在陆地上，包括室内或室外、手持或车载；也可以部署在水面上(如轮船等)；还可以部署在空中(例如飞机、气球和卫星上等)。所述终端可以是手机(mobile phone)、平板电脑(Pad)、带无线收发功能的电脑、虚拟现实(Virtual Reality，VR)终端设备、增强现实(Augmented Reality，AR)终端设备、工业控制(industrial control)中的无线终端、无人驾驶(self driving)中的无线终端、远程医疗(remote medical)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端等等。在不同的网络中终端可以叫做不同的名称，例如：用户设备，移动台，用户单元，站台，蜂窝电话，个人数字助理，无线调制解调器，无线通信设备，手持设备，膝上型电脑，无绳电话，无线本地环路台等。为描述方便，本申请中简称为终端。
基站(base station，BS)，也可称为基站设备，是一种部署在无线接入网用以提供无线通信功能的设备。在不同的无线接入系统中基站的叫法可能有所不同，例如在通用移动通讯系统(Universal Mobile Telecommunications System，UMTS)网络中基站称为节点B(NodeB),而在LTE网络中的基站称为演进的节点B(evolved NodeB，eNB或者eNodeB)，在新空口(new radio,NR)网络中的基站称为收发点(transmission reception point，TRP)或者下一代节点B(generation nodeB，gNB)，或者在其他多种技术融合的网络中，或者在其他各种演进网络中的基站也可能采用其他叫法。本发明并不限于此。
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行描述。
LDPC码可以用于通信系统进行编码。例如在5G系统中，可以利用LDPC码对数据进行编码。LDPC码通常可以用奇偶校验矩阵H来表示。LDPC码的奇偶校验矩阵H可以通过基图(base graph)和偏移(shift)值得到。基图通常可以包括m*n个矩阵元素(entry)，可以用m行n列的矩阵形式表示，矩阵元素的值为0或1，其中值为0的元素，有时候也称之为零元素，表示该元素可以被z*z的全零矩阵(zero matrix)替换，值为1的元素，有时候也称之为非零元素，表示该元素可以被z*z的循环置换矩阵(circulant permutation matrix)替换。也就是说，每个矩阵元素代表的是一个全零矩阵或者一个循环置换矩阵。图1-1和图1-2给出了两种LDPC码的基图的举例。如图1-1所示的BG1，其大小为46行68列；如图1-2所示的BG2，其大小为42行52列。在上述图中所示基图，行号标注在最左一列，列号标注在最上一行，各行列中仅示出非零元素，以“1”表示，空白部分为零元素。其中第0列和第1列为2列内置打孔列， 不进入循环缓存。
若基图中第i行第j列的元素值为1，其偏移值为P i,j，P i,j为大于或者等于0的整数，则表示第i行第j列的值为1的元素可以被P i,j对应的z*z的循环置换矩阵替换，该循环置换矩阵可通过将z*z的单位矩阵进行P i,j次向右循环移位得到。可见，将基图中每个值为0的元素用z*z的全零矩阵替换，每个值为1的元素采用其偏移值对应的z*z的循环置换矩阵进行替换，则可以得到LDPC码的奇偶校验矩阵。z为正整数，也可以称之为扩展因子(lifting size)，可以根据系统支持的码块大小和信息数据的大小确定的。可见奇偶校验矩阵H的大小为(m*z)*(n*z)。
由于P i,j可以是基于扩展因子z得到的，对于同一个位置上值为1的元素，采用不同的扩展因子Z可能存在不同的P i,j。为了简化实现，通常系统也会定义一个m*n的基矩阵(parity check matrix)，在基矩阵中每个元素和基图中每个元素的位置一一对应，基图中的零元素在基矩阵中位置不变，采用-1或Null表示，基图中第i行第j列值为1的非零元素在基矩阵中位置不变，可表示为P i,j，P i,j为大于或者等于0的正整数。在本申请实施例中，有时也将基矩阵称为基图矩阵的偏移矩阵。
在通信系统中，信息数据在通信设备(例如，基站或者终端)之间传输，由于无线传播环境复杂多变，容易受到干扰，出现差错。为了可靠地发送信息数据，在发送端，通信设备对信息数据进行CRC校验、信道编码、速率匹配、交织等处理，并将交织后的编码比特映射成调制符号发送给接收端的通信设备。接收设备接收到调制符号后，相应地通过解交织、解速率匹配、译码，CRC校验恢复成信息数据。这些过程可以减少传输差错，提高数据传输的可靠性。
图2示出的通信系统200可广泛用于提供诸如语音，数据等各种类型的通信。所述通信系统可包括多个无线通信设备。清楚起见，图2仅示出了通信设备20和通信设备21。控制信息或者数据信息作为信息序列在通信设备20和通信设备21之间接收和发送。在一种可能的设计中，通信设备20作为发送端通信设备，对长度为K的比特序列C进行LDPC编码处理。其中，比特序列C可以是是通信设备20要发送的控制或者数据信息的比特序列，或者是该比特序列至少经过码块分割处理得到的。长度为K的比特序列C中还可以包括循环校验比特，还可以包括填充位。
在一种可能的实现方式中，通信设备20根据比特序列C的长度K确定编码使用的LDPC矩阵。例如，可以根据K确定扩展因子z，然后根据z对相应码率的基矩阵扩展，得到LDPC矩阵。使用该LDPC矩阵对比特序列C进行编码可以得到编码后的比特序列(coded block)。如果没有进行截短，则比特序列D可以是编码后的比特序列；如果对编码后的比特序列进行截短(shortening)操作，也就是从该比特序列中截短s 0个比特，例如，将s 0个比特从编码后的比特序列中删除，则比特序列D可以是从编码后的比特序列截短s 0比特得到的比特序列。其中，s 0为大于或者等于0的整数。例如，s 0＝n·r，n为正整数，r为缓存序列W中单位比特段中包括的比特数。单位比特段反映的是缓存序列W中起始位置设置的颗粒度。例如，缓存序列W可以按照扩展因子的整数倍设置起始位置，也就是单位比特段包括的比特数r＝z。又例如，比特序列D进入缓存序列W前需要进行交织，若交织矩阵的列数为C subblock，则交织矩阵的行数为R subblock，其中，R subblock是满足K D≤C subblock·R subblock的最小整数，单位比特段包括的 比特数r可以为R subblock，也就是可以按照R subblock的整数倍设置起始位置。比特序列D长度为K D。比特序列D中可以包括比特序列C中的多个比特，还可以包括一个或多个校验比特，比特序列C中的比特在比特序列D中有时也称之为信息比特，或者，系统比特(systematic bit)。在本发明中，比特序列D有时也称为编码块(coded block)。其中，每个编码块中包括信息比特和校验比特。信息比特中可以包括提前从比特，如果信息比特中包括填充比特，填充比特通常表示为“空”(Null)。
编码块或者经过比特重排序的编码块保存在通信设备20的循环缓存中，通信设备20从循环缓存中的编码块顺序获取多个输出比特得到输出比特序列，输出比特是编码块中除填充比特以外的比特，从而输出比特序列是不包括填充比特的。经过交织、映射为调制符号后发送。通信设备20发生重传时将从循环缓存中的编码块选取另一输出比特序列发送，如果顺序获取输出比特达到循环缓存的末位比特时，则从循环缓存的首位比特开始继续选取输出比特。每次从循环缓存中的编码块中选取的输出比特序列也可以称之为该编码块的一个冗余版本(redundancy version，rv)。
通信设备21对接收到的调制符号解调，解交织后，将接收到的输出比特序列的软值保存在软信息缓存(soft buffer)中相应位置。如果发生重传，通信设备21将每次重传的输出比特序列的软值合并保存在软信息缓存中，这里的合并是指，如果两次接收到的输出比特的位置相同，则将两次接收到的该输出比特的软值合并。在一种设计中，通信设备21中软信息缓存中的位置和通信设备20中循环缓存中的编码块的位置是一一对应的。也就是，如果输出比特在通信设备20中循环缓存中的编码块中的位置是第p比特，则其软值在通信设备21中软信息缓存中的位置也是第p比特。
通信设备21对软信息缓存中的所有软值进行译码得到信息序列的一个码块。由于通信设备21可以获取传输块大小，因此可以确定一个传输块被分割的码块个数以及各码块长度，如果码块中包括CRC比特段，通信设备21还可以利用该CRC比特段对码块进行校验。通信设备21将各码块级联为一个传输块，进一步对传输块进行校验及级联最终得到信息序列。可见通信设备21执行的是通信设备20信息处理方法的逆过程。
需要说明的是，此处通信设备20和通信设备21之间对信息序列的接收和发送过程仅是一个示例性的说明，这些模块的划分仅仅是示意性的，其中某些模块可能根据系统设计的需求是可选的，有可能某些模块的功能可以合并在一个模块中执行，并不做限定。并且这些模块可以由软件、或者硬件、或者软件结合硬件来实现。例如可以通过一个或多个处理器来实现，本发明并不限于此。
需要说明的是，在本发明各实施例中，通信设备20可以是通信系统中的网络设备，如基站，则相应的通信设备21可以是终端。通信设备20也可以是通信系统中的终端，则相应的，通信设备21可以是通信系统中的网络设备，如基站等。通信设备20以及通信设备21也可以是芯片，例如，上述处理过程的各模块可以由一个或多个处理器来实现。
图3为本发明一实施例提供的信息处理方法的流程示意图，该方法可用于通信系统，该通信系统包括通信设备20和通信设备21。该方法可以由通信设备20来实施，包括：
301：确定冗余版本顺序。
其中，冗余版本顺序用于表示多个冗余版本的发送顺序。
以前述编码块比特序列D为例，通信设备20可以基于比特序列D或者比特序列D的一部分确定输出比特序列。通信设备支持重传时，可以基于比特序列D或者比特序列D的一部分确定每次传输的输出比特序列。
在一种可能的设计中，长度为N CB缓存序列W可包括比特序列D或者比特序列D的一部分，其中各比特为一LDPC码。
一种可能的实现方式中，缓存序列W可以包括比特序列D的所有比特。例如，缓存序列W可以包括比特序列D，又例如，缓存序列W也可以包括至少经过交织处理的比特序列D，又例如，缓存序列也可以包括至少经过填充处理的比特序列D，还例如，缓存序列也可以包括至少经过交织和填充处理的比特序列D。
在又一种可能的实现方式中，缓存序列W可以包括比特序列D的部分比特。例如，比特序列D长度超过缓存序列W的最大长度，因此缓存序列W只能包括比特序列D中的部分比特。类似地，缓存序列W可以包括比特序列D的部分比特，又例如，缓存序列W也可以包括至少经过交织处理的比特序列D的部分比特，又例如，缓存序列也可以包括至少经过填充处理的比特序列D的部分比特，还例如，缓存序列也可以包括至少经过交织和填充处理的比特序列D的部分比特。
缓存序列W也可以叫做循环缓存。在进行初传或者重传时，通信设备20在循环缓存中保存的比特序列中确定输出比特序列用于初传或者重传。为了方便说明，第i次传输表示初传或者重传，i＝0表示初传，i>0表示重传，i为整数，例如i＝1表示第一次重传，i＝2表示第二次重传等等。重传的上限取决于系统最大重传次数，其中对于每次初传或者重传的输出比特序列，可以是比特序列D的一个冗余版本。
在一种可能的设计中，缓存序列W中可以固定设置k max个起始位置，k max为大于或者等于4的整数。每个起始位置可以用编号，也即索引(index)指示，例如，rv idx指示，则0≤rv idx＜k max。例如：k max＝4,则4个起始位置的编号rv idx取值分别是0,1,2,3中的一个。
每次传输的输出比特序列可以从缓存序列W中k max个起始位置中的一个开始获取。如果有k max个起始位置，可以获取到k max个冗余版本。每一冗余版本可以与缓存序列W中的起始位置的编号rv idx对应。
下面以k max＝4为例进行说明，也就是说，从缓存序列W中可以获取4个冗余版本。可以理解，本发明并不限于此，k max也可以是其他的值。
以LDPC码的基图为图1-1所示的BG1为例，比特的位置从0开始编号，起始位置可以是扩展因子的整数倍。冗余版本0为从缓存序列W中rv idx＝0的位置，也就是第0z比特，获取的比特序列；冗余版本1为从缓存序列W中rv idx＝1的位置，也就是第17z比特，获取的比特序列；冗余版本2为从缓存序列W中rv idx＝2的位置，也就是第33z比特，获取的比特序列；冗余版本3为从缓存序列W中rv idx＝3的位置，也就是第56z比特，获取的比特序列。冗余版本的编号有时也可用rv idx来表示。可以理解的是第0z比特的位置，也就是位置编号为0的比特。第17z比特，也就是位置编号为17z的比特，第33z比特，也就是位置编号为33z的比特，以此类推，以下不再赘述。
从不同起始位置获取到的输出比特序列中包括的系统比特、校验比特的组成是不同的。冗余版本0包括较多的系统比特，如果接收过程中没有干扰或丢失，通常可以对冗余版本0独立完成解码，也可以说冗余版本0是可以自解码的冗余版本。冗余版本3中也包括了较多的系统比特，也可以独立完成解码，属于可以自解码的冗余版本。而冗余版本1和2中主要为校验比特和少量系统比特，不具备自解码能力，但是可以和具备自解码能力的冗余版本进行合并解码，合并后的比特序列作为一个LDPC码，其等效码率低，可以降低译码的复杂度。
在对缓存序列W中的比特进行一次或多次传输时，通常按照冗余版本顺序依次获取相应的冗余版本传输。冗余版本的顺序可以用冗余版本的编号的序列来表示，也可以用每次传输的输出比特序列在缓存序列W中的起始位置或者起始位置的编号的序列来表示。本发明并不限于此。对于第i次传输，根据冗余版本顺序，确定相应的起始位置，从缓存序列W中该起始位置获取输出比特序列rv(i)，也可以称为待发送的冗余版本。
在一种设计中，起始位置的顺序可以是按{0,2,3,1}循环，在这种设计下，初传时从第0个起始位置获取冗余版本0，第1次重传时从第2个起始位置获取冗余版本2，第2次重传时从第3个起始位置获取冗余版本3，第3次重传时从第1个起始位置获取冗余版本1，第4次重传时从第0个起始位置获取冗余版本0，依次类推。
以基于基图为BG1的LDPC码(矩阵)进行编码为例，基图中第0列至第21列对应信息比特的编码比特，其余列对应校验比特的编码比特。其中，第0列和第1列这2列内置打孔比特列对应的编码比特不进入循环缓存，缓存序列W为66z，则相应的起始位置为{0z，17z，33z，56z}，rv idx与起始位置的对应关系如表一所示：
表一
Figure PCTCN2018108360-appb-000001
rv idx为0或3时，获取到的输出比特序列中含有较多信息比特的编码比特，也就是缓存序列W的起始位置为第0z比特或者第56z比特时，获取到的输出比特序列含有较多信息比特的编码比特，具备自解码能力。
rv idx为1或2时，获取到的输出比特序列中含有较多校验比特，也就是缓存序列W的起始位置为第17z比特或者第33z比特时，获取到的输出比特序列含有较多校验比特，不具备自解码能力，需要和具有自解码能力的冗余版本合并译码。
以基于基图为BG2的LDPC码(矩阵)进行编码为例，基图中第0列至第9列对应信息比特的编码比特，其余列对应校验比特的编码比特。其中，第0列和第1列这2列内置打孔比特列对应的编码比特不进入循环缓存，缓存序列W为50z，相应的起始位置为{0z，13z，25z，43z}，rv idx与起始位置的对应关系如表二所示：
表二
起始位置编号rv idx 起始位置
0 0z
1 13z
2 25z
3 43z
rv idx为0或3时，获取到的输出比特序列中含有较多信息比特的编码比特，也就是缓存序列W的起始位置为第0z比特或者第43z比特时，获取到的输出比特序列含有较多信息比特的编码比特，具备自解码能力。
rv idx为1或2时，获取到的输出比特序列中含有较多校验比特，也就是缓存序列W的起始位置为第13z比特或者第25z比特时，获取到的输出比特序列含有较多校验比特，不具备自解码能力。需要和具有自解码能力的冗余版本合并译码，
一种可能的设计中，冗余版本顺序中多个冗余版本可以均为可自解码的冗余版本，例如，以冗余版本编号的序列表示为例，冗余版本顺序可以为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
又一种可能的设计中，例如，以冗余版本编号的序列表示为例，冗余版本顺序可以为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}，或者，{0,2,3,1}，或者，{0,3,2,1}。
需要说明的是，前述列举的各序列中，也可以用相应的起始位置代替编号表示。
在一种可能的实现方式中，每次传输的输出比特序列在缓存序列W中的rv idx按照0,3的顺序循环。若LDPC矩阵的基图为BG1，则起始位置按照0z，56z的顺序循环，若LDPC矩阵的基图为BG2，则起始位置按照0z，43z的顺序循环。在这种方式下，由于每次传输的冗余版本都具有自解码能力，即使发生多次丢包，剩余的冗余版本也可完成自解码。在上述重传多个自解码冗余版本的方式中，对于传输稳定，丢包概率较小的场景，一旦发生重传，会使得接收端通信设备接收到的各冗余版本合并后码字等效码率较高，导致译码性能较低。可选地，可以在对丢包敏感的场景，例如，Grant Free传输模式或者多Slot聚合模式，按照上述方式获取每次传输的输出比特序列。由于在Grant Free模式中，发送端通信设备没有唯一指定的空口物理资源用于发送数据，所有发送端通信设备在一个资源池中基于竞争发送，因此发生冲突、受到强干扰的可能性较大。如初传受到强干扰，接收端通信设备无法实现IR-HARQ合并，如果第1次重传具有自解码能力的冗余版本，则可通过重传的冗余版本完成译码，减少重传次数，节省空口时延和资源。
在另一种可能的实现方式中，每次传输的输出比特序列在缓存序列W中的起始位置的编号可以按照0，2，3，1的顺序循环。若LDPC矩阵的基图为BG1，则起始位置按照0z，33z，56z，17z的顺序循环，若LDPC矩阵的基图为BG2，则起始位置按照0z，25z，43z，13z的顺序循环。如果初传不丢包，则初传的冗余版本可以自解码，如果初传的冗余版本丢失，则至少需要在第2次重传才能完成译码，但是第1次重传和第2次重传的冗余版本合并后的码字等效码率相对低，综合译码性能较好，可以适用增强移动宽带(enhanced mobile broadband，eMBB)大部分场景。
在又一种可能的实现方式中，输出比特序列在缓存序列W中的起始位置的编号可以按照0，3，2，1的顺序循环。若LDPC矩阵的基图为BG1，则起始位置按照0z，56z，33z，17z的顺序循环，若LDPC矩阵的基图为BG2，则起始位置按照0z，43z，25z，13z的顺序循环。这种方式下，如果初传丢包，第1次重传中包括自解码的冗余版本。同样发生2次以上重传的情况下，性能和前一实现方式一致，综合译码性能较好，也可以适用eMBB、低时延高可靠连接(ultra-reliable and low latency communications，URLCC)大部分场景。
在又一种可能的设计中，可以根据数据传输的场景获取冗余版本顺序，冗余版本顺序表示缓存序列W的多个冗余版本的发送顺序，可以根据冗余版本的顺序确定每次数据传输时的冗余版本。其中，数据传输的场景可以至少根据下述因素之一确定，也可以说根据下述因素中一项或多项确定冗余版本顺序：业务类型、传输模式、传输码率等。其中，业务类型可以包括eMBB、URLCC、基于新空口的语音(voice over new radio，VoNR)、大规模物联网(massive machine type communications，mMTC)等，传输模式可以包括免授权Grant free、多时隙(slot)聚合等。还可以业务类型和传输模式进行组合，例如，Grant free模式下eMBB业务传输，多Slot聚合模式下URLCC业务传输等。需要说明的是，此处仅为举例，并不以此为限制。
例如，若业务类型为eMBB，冗余版本顺序可以为{0,2,3,1}或者{0,3,2,1}。
又例如，若业务类型为URLCC，冗余版本顺序可以为{0,3,2,1}或者{0,3,0,3}。
又例如，若传输模式为Grant Free或者多时隙聚合，冗余版本顺序可以为{0,3,0,3}。
由于可以根据数据传输的场景确定冗余版本配置信息，确定了数据传输的场景也就确定了冗余版本的顺序。例如，可以通过配置、预先定义、或者协议规定不同业务类型和/或传输模式的冗余版本的顺序。例如，通信设备20和通信设备21之间传输数据的业务类型为eMBB，则可以选择{0,2,3,1}的顺序作为冗余版本的起始位置的顺序；又例如，通信设备20和通信设备21之间传输数据的业务类型为URLCC，则可以选择0,3,2,1的顺序作为冗余版本的起始位置的顺序；又例如，传输模式为Grant free或者多Slot聚合时，可以选择0,3,0,3的顺序。当然，也可以结合业务类型和传输模式确定冗余版本配置信息。还可以考虑信道传输质量等因素来确定冗余版本的顺序。此处均只为举例说明，本发明并不限于此。
302：确定传输次数；
303：基于步骤301确定的冗余版本顺序和步骤302确定的传输次数获取缓存序列中的冗余版本并发送。
通信设备20可以基于步骤301中获取到的冗余版本的顺序，确定每次传输的冗余版本，根据冗余版本起始位置从缓存序列W中获取每次传输的输出比特序列作为冗余版本，并发送给通信设备21。
例如，以采用BG1类型的基图，{0,3,0,3}顺序为例，通信设备20对初传，也就是第0次传输，即传输次数为1，从缓存序列W的第0z比特获取输出比特序列进行发送后，收到来自通信设备21的否定应答NACK，则通信设备20从缓存序列W的第56z比特获取第1次重传(即传输次数为2)的输出比特序列，也就是确定冗余版本rv(1)。通信设备20将输出比特序列rv(1)发送至通信设备21。若通信设备20接收到来自通信 设备21的NACK，则通信设备20从缓存序列W的第0z比特获取第2次重传的输出比特序列，也就是确定冗余版本rv(2)。以此类推，直至达到最大重传次数或者重传定时器超时，或者通信设备20收到来自通信设备21的肯定应答ACK，则通信设备可以结束重传。当然，通信设备20也可以进行多次重传，而无需考虑来自通信设备21的NACK或者ACK。
接收端通信设备21译码时需要对接收到的初传的软值比特和各冗余版本的软值比特进行合并译码。对于采用LDPC编码的编码块，为了提高接收端通信设备的译码性能则要求减少各冗余版本之间重复或者不发的比特数。
可选地，还可以包括：
304：发送指示冗余版本顺序的信息。
通信设备20可以向通信设备21发送指示冗余版本顺序的信息，使得通信设备21获取到数据传输中各冗余版本的起始位置的顺序。
冗余版本的顺序可以通过起始位置顺序表示，也可以通过起始位置对应的编号顺序表示，还可以对每种冗余版本的顺序进行编号，通过编号表示一种顺序。如下表三所示，为多种起始位置的顺序和冗余版本配置编号的对应关系的一些示例，并不以此为限制。
表三
Figure PCTCN2018108360-appb-000002
指示冗余版本顺序的信息可以通过上述表三中任一列表示，也即指示冗余版本顺序的信息可以是冗余版本顺序索引，也可以是各起始位置的编号的顺序序列，也可以是不同基图中各起始位置的顺序等。可以理解的是，此处仅为举例，本发明并不限于此。一种可能的实现方式中，冗余版本顺序索引可以是和一种传输场景进行对应，冗余版本顺序索引也可以是传输场景索引，从而根据传输场景也能获得相应的冗余版本顺序。
通信设备20可以通过控制信道或数据信道发送指示该冗余版本顺序的信息，例如，下行控制信道、下行共享信道、下行数据信道等等。指示该冗余版本顺序的信息可以承载在物理层信令，也可以承载在高层信令，如无线资源控制(radio resource control，RRC)信令中。这一方式使得通信设备20和通信设备21之间可以根据传输模式或者业务类型的变化实时调整冗余版本配置。
例如，通信设备20和通信设备21两者初始可以按照默认的一种冗余版本配置进行数据传输，例如可以按照{0,2,3,1}的顺序进行数据传输以及重传处理，若通信设备20和21之间传输质量，或者业务类型，或者传输模式发生变化，通信设备20根据步骤301获取新的冗余版本配置，通过信令指示给通信设备21，从而两者可以根据新的顺序进行传输。需要说明的是，此处仅为举例，本发明并不限于此。
需要说明的是，步骤304部分为可选的步骤。在一种实现方式中，也可以不发送用于指示冗余版本顺序的信息。例如，可以通过预先定义或者协议规定等方式，定义对于某种业务类型、或者某种传输模式场景下，采用某种特定的冗余版本顺序。这中情况下，通信设备21确定了业务类型、或者传输模式，即知晓了冗余版本顺序，因此，通信设备20也可以不发送指示冗余版本顺序的信息。
需要说明的是步骤304可以在前述步骤301之后任一步骤之前或之后执行，本发明并不规定其顺序。
可选地，在前述信息处理方法之后，所述通信设备还可以对所述输出比特序列进行处理，使得在发送或接收时使用该输出比特序列，例如，对输出比特序列进行交织，并映射为调制符号等处理等等。这些处理可以参照现有技术中的相应处理方法，此处不再赘述。
图4为本发明一实施例提供的信息处理方法的流程图，该方法可用于通信系统，该通信系统包括通信设备20和通信设备21。该方法可以由通信设备21来实施，包括：
401：确定冗余版本顺序。
冗余版本顺序用于表示多个冗余版本的发送顺序，每一冗余版本与所述缓存序列W中的一起始位置的编号对应。
一种可能的设计中，冗余版本顺序可以是如前述实施例中所描述的，根据下述因素一项或多项确定所述冗余版本顺序：业务类型，或者，传输模式，或者传输码率，所述冗余版本顺序用于表示多个冗余版本的发送顺序。可参见前述实施例中描述。
又一种可能的设计中，冗余版本顺序也可以是接收前述实施例中步骤304中由通信设备20发送的指示冗余版本顺序的信息，基于所述指示冗余版本顺序的信息确定冗余版本顺序。可参见前述实施例中描述。
402：确定传输次数；
403：基于步骤401确定的冗余版本顺序和步骤402确定的传输次数在缓存序列W中合并接收到的冗余版本。
通信设备21接收通信设备20发送的信号，该信号中包括对应于本次传输中缓存序列W的冗余版本，也就是通信设备20在前述实施例步骤303中获取到的冗余版本。
通信设备21对信号进行解调，可以获取到对应于本次传输中的冗余版本的软值序列。
根据冗余版本顺序及当前传输的次数确定在缓存序列W中合并的起始位置，将冗余版本的软值序列从该起始位置合并至缓存序列W。
可选地，还可以对缓存序列W中的软值比特进行LDPC译码。
通信设备21对缓存序列W中的软值比特进行LDPC译码。
其中，所述缓存序列W包括比特序列D的软值序列或者比特序列D的软值序列的一部分，所述比特序列D的软值序列长度为K D比特，所述比特序列D是长度为K的比特序列C基于低密度奇偶校验LDPC矩阵编码得到的比特序列，或者，所述比特序列D是从长度为K的比特序列C基于低密度奇偶校验LDPC矩阵编码得到的比特序列中截短s 0比特得到的。
通信设备20向通信设备21发送如前述各实施例中得到的输出比特序列，可以理解的是，上述实施例中的输出比特序列是速率匹配后的输出比特序列，所述通信设备20可以对速率匹配后的输出比特序列进行交织调制等处理，从而发送对应于所述输出比特序列的发送信号，通信设备21接收所述输出信号并经解调、解交织后，得到输出比特序列对应的软比特序列，也就是输出比特序列中一个比特对应软比特序列中一个软值比特(soft channel bit)。这些软值比特在通信设备21的软信息缓存中保存的位置和通信设备20中循环缓存中的编码块的位置一一对应，软信息缓存的大小与循环缓存中的编码块的大小也是相同的，都可以是N CB。
例如，通信设备20发送的输出比特为1，经过信道传输，通信设备21得到其相应的软值比特为1.45，如果输出比特在编码块中的位置为第5比特，则在通信设备21的软信息缓存中第5软值比特为1.45。需要说明的是此处只是举例说明，本发明实施例并不限于此。如果通信设备20获取的输出比特序列中包括n个输出比特，则通信设备31可以获取到n个对应的软值比特。如果通信设备31两次接收到同一位置的软值比特，则将两次的软值进行合并，例如，第一次传输时接收到的软值比特为1.45，第二次传输时接收到的软值比特为0.5，则合并后为1.95。需要说明的是，此处仅为举例，并不以此为限制。
可见冗余版本顺序具备和前述各实施例相应的特征，可以参见前述各实施例所述，此处不再赘述。需要说明的是，对通信设备20而言，缓存序列W为循环缓存中的编码块而言，而在通信设备21中，缓存序列W是软信息缓存中的软值序列；在通信设备20侧是从循环缓存中的编码块确定输出比特序列，而在通信设备21侧，是将接收到的软值序列保存到软信息缓存中。
图5给出了一种通信装置500的结构示意图，装置500可用于实现上述方法实施例中描述的方法，可以参见上述方法实施例中的说明。所述通信装置500可以是芯片，基站，终端或者其他网络设备。通信装置500也可以是图2中通信设备20或者通信设备21。
所述通信装置500包括一个或多个处理器501。所述处理器501可以是通用处理器或者专用处理器等。例如可以是基带处理器、或中央处理器。基带处理器可以用于对通信协议以及通信数据进行处理，中央处理器可以用于对通信装置(如，基站、终端、或芯片等)进行控制，执行软件程序，处理软件程序的数据。
在一种可能的设计中，所述通信装置500包括一个或多个所述处理器501，所述一个或多个处理器501可用于实现图3或图4所示各实施例的方法。可选地，处理器501除了实现图3或图4所示各实施例的方法，还可以实现其他功能，例如，图2中 速率匹配模块或解速率匹配模块的功能。
所述通信装置500确定冗余版本顺序，所述冗余版本顺序用于表示多个冗余版本的发送顺序；确定传输次数；并基于所述冗余版本顺序和所述传输次数获取缓存序列中的冗余版本用于发送。
在一种可能的设计中，一个或多个所述处理器501可用于实现图4所示各实施例的方法。
所述通信装置500确定冗余版本顺序，所述冗余版本顺序用于表示多个冗余版本的发送顺序；确定传输次数；并基于所述冗余版本顺序和所述传输次数在所述缓存序列中合并所述接收到的冗余版本。可选地，所述通信装置500可对所述缓存序列中的软值比特进行LDPC译码。
可选的一种设计中，处理器501也可以包括指令503，所述指令可以在所述处理器上被运行，使得所述通信装置500执行上述方法实施例中描述的方法。
在又一种可能的设计中，通信装置500也可以包括电路，所述电路可以用于实现前述方法实施例中的功能。可选的，所述通信装置500中可以包括一个或多个存储器502，其上存有指令504，所述指令可在所述处理器上被运行，使得所述通信装置500执行上述方法实施例中描述的方法。可选的，所述存储器中还可以存储有数据。可选的处理器中也可以存储指令和/或数据。所述处理器和存储器可以单独设置，也可以集成在一起。可选的，一个或多个存储器502可以存储起始位置、冗余版本相关的参数等。
在又一种设计中，一个或多个处理器501可以用于实现图2中所示的各个模块的功能。例如，通信设备20或通信设备21中各个模块的功能。
可选的，所述通信装置500还可以包括收发器505以及天线506。所述处理器501可以称为处理单元，对通信装置(终端或者基站)进行控制。所述收发器505可以称为收发单元、收发机、收发电路、收发接口或者收发器等，用于通过天线506实现通信装置的收发功能。例如，收发指示冗余版本顺序的信息，收发包括冗余版本的信号等。
可选的，所述通信装置500还可以包括用于产生传输块CRC的器件、用于码块分割和CRC校验的器件、编码器、用于交织的交织器、或者用于调制处理的调制器等。可以通过一个或多个处理器501实现这些器件的功能。
可选的，所述通信装置500还可以包括，用于解调操作的解调器、用于解交织的解交织器、或者译码器等等。可以通过一个或多个处理器501实现这些器件的功能。
本领域技术任何还可以了解到本发明实施例列出的各种说明性逻辑块(illustrative logical block)和步骤(step)可以通过电子硬件、电脑软件，或两者的结合进行实现。这样的功能是通过硬件还是软件来实现取决于特定的应用和整个系统的设计要求。本领域技术人员可以对于每种特定的应用，可以使用各种方法实现所述的功能，但这种实现不应被理解为超出本发明实施例保护的范围。
本发明实施例中所描述的各种说明性的逻辑单元和电路可以通过通用处理器，数字信号处理器，专用集成电路(ASIC)，现场可编程门阵列(FPGA)或其它可编程 逻辑装置，离散门或晶体管逻辑，离散硬件部件，或上述任何组合的设计来实现或操作所描述的功能。通用处理器可以为微处理器，可选地，该通用处理器也可以为任何传统的处理器、控制器、微控制器或状态机。处理器也可以通过计算装置的组合来实现，例如数字信号处理器和微处理器，多个微处理器，一个或多个微处理器联合一个数字信号处理器核，或任何其它类似的配置来实现。
本发明实施例中所描述的方法或算法的步骤可以直接嵌入硬件、处理器执行的指令、或者这两者的结合。存储器可以是RAM存储器、闪存、ROM存储器、EPROM存储器、EEPROM存储器、寄存器、硬盘、可移动磁盘、CD-ROM或本领域中其它任意形式的存储媒介。示例性地，存储器可以与处理器连接，以使得处理器可以从存储器中读取信息，并可以向存储器存写信息。可选地，存储器还可以集成到处理器中。处理器和存储器可以设置于ASIC中，ASIC可以设置于UE中。可选地，处理器和存储器也可以设置于UE中的不同的部件中。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到本发明可以用硬件实现，或固件实现，或它们的组合方式来实现。当使用软件程序实现时，可以全部或部分地以计算机程序产品的形式实现，所述计算机程序产品包括一个或多个计算机指令(也可以称为程序或代码)。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本发明实施例所述的流程或功能。当使用软件程序实现时，也可以将上述功能存储在计算机可读介质中或作为计算机可读介质上的一个或多个指令或代码进行传输。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一计算机可读存储介质传输。计算机可读介质包括计算机存储介质和通信介质，其中通信介质包括便于从一个地方向另一个地方传送计算机程序的任何介质。存储介质可以是计算机能够存取的任何可用介质。以此为例但不限于：计算机可读介质可以包括RAM、ROM、EEPROM、CD-ROM或其他光盘存储、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质。此外。任何连接可以适当的成为计算机可读介质。例如，如果软件是使用同轴电缆、光纤光缆、双绞线、数字用户线(DSL)或者诸如红外线、无线电和微波之类的无线技术从网站、服务器或者其他远程源传输的，那么同轴电缆、光纤光缆、双绞线、DSL或者诸如红外线、无线和微波之类的无线技术包括在所属介质的定义中。如本发明所使用的，盘(Disk)和碟(disc)包括压缩光碟(CD)、激光碟、光碟、数字通用光碟(DVD)、软盘和蓝光光碟，其中盘通常磁性的复制数据，而碟则用激光来光学的复制数据。上面的组合也应当包括在计算机可读介质的保护范围之内。
总之，以上所述仅为本发明技术方案的较佳实施例而已，并非用于限定本发明的保护范围。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。

Claims (86)

  1. 一种通信系统中信息处理的方法，其特征在于，所述方法包括：
    确定冗余版本的顺序，所述冗余版本的顺序用于表示多个冗余版本的发送顺序，所述多个冗余版本均为可自解码的冗余版本；
    确定传输次数；
    基于所述冗余版本的顺序和所述传输次数获取缓存序列中的冗余版本并发送。
  2. 根据权利要求1所述的方法，其特征在于，所述确定冗余版本顺序包括：
    根据下述因素一项或多项确定所述冗余版本顺序：
    业务类型，或者，传输模式，或者传输码率。
  3. 根据权利要求1或2所述的方法，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
  4. 一种通信系统中信息处理的方法，其特征在于，所述方法包括：
    根据下述因素一项或多项确定冗余版本顺序：业务类型，或者，传输模式，或者传输码率；
    确定传输次数；
    基于所述冗余版本顺序和所述传输次数获取缓存序列中的冗余版本并发送。
  5. 根据权利要求4所述的方法，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}，或者，{0,2,3,1}，或者，{0,3,2,1}。
  6. 根据权利要求4所述的方法，其特征在于，所述多个冗余版本均为可自解码的冗余版本。
  7. 根据权利要求4或6所述的方法，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
  8. 根据权利要求2至7任一项所述的方法，其特征在于，所述业务类型包括以下至少一个：
    增强移动宽带eMBB，或者，低时延高可靠连接URLLC，或者，基于新空口的语音VoNR，或者，大规模物联网mMTC。
  9. 根据权利要求2至8任一项所述的方法，其特征在于，所述传输模式包括以下至少一个：免授权Grant Free，或者，多时隙聚合。
  10. 根据权利要求2至9任一项所述的方法，其特征在于，
    若业务类型为eMBB，所述冗余版本顺序以冗余版本编号的序列表示为{0,2,3,1}或者{0,3,2,1}；或者，
    若业务类型为URLCC，所述冗余版本顺序以冗余版本编号的序列表示为{0,3,2,1}或者{0,3,0,3}；或者，
    若传输模式为Grant Free或者多时隙聚合，所述冗余版本顺序以冗余版本编号的序列表示为{0,3,0,3}。
  11. 根据权利要求1至10任一项所述的方法，其特征在于，所述方法还包括：
    发送指示所述冗余版本顺序的信息。
  12. 根据权利要求11所述的方法，其特征在于，所述发送指示所述冗余版本顺序的信息包括：
    在下行控制信道或下行数据信道发送指示所述冗余版本的信息。
  13. 根据权利要求12所述的方法，其特征在于，所述在下行控制信道或下行数据信道发送指示所述冗余版本顺序的信息，包括：
    在下行控制信道或者下行数据信道上发送物理层信令或者无线资源控制RRC信令，所述指示所述冗余版本顺序的信息承载于所述物理层信令或者RRC信令。
  14. 一种通信系统中信息处理的方法，其特征在于，所述方法包括：
    接收指示冗余版本顺序的信息；
    基于所述指示冗余版本顺序的信息确定冗余版本顺序；
    确定传输次数；
    基于所述冗余版本顺序和所述传输次数在缓存序列中合并接收到的冗余版本。
  15. 根据权利要求14所述的方法，其特征在于，所述多个冗余版本均为可自解码的冗余版本。
  16. 根据权利要求15所述的方法，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
  17. 根据权利要求14至16任一项所述的方法，其特征在于，所述接收指示冗余版本顺序的信息包括：
    在下行控制信道或下行数据信道接收指示所述冗余版本的信息。
  18. 根据权利要求17所述的方法，其特征在于，所述在下行控制信道或下行数据信道接收指示所述冗余版本顺序的信息，包括：
    在下行控制信道或者下行数据信道上接收物理层信令或者无线资源控制RRC信 令，所述指示所述冗余版本顺序的信息承载于所述物理层信令或者RRC信令。
  19. 一种通信系统中信息处理的方法，包括：
    为第一次传输选择冗余版本，所述第一次传输的冗余版本为冗余版本0；
    发送所述冗余版本0；
    为第二次传输选择冗余版本，所述第二次传输的冗余版本为冗余版本3；
    发送所述冗余版本3；
    为第三次传输选择冗余版本，所述第三次传输的冗余版本为冗余版本0；
    发送所述冗余版本0；
    为第四次传输选择冗余版本，所述第四次传输的冗余版本为冗余版本3；
    发送所述冗余版本3。
  20. 根据权利要求19所述的方法，包括：按照冗余版本为{0,3,0,3}的传输次序发送后续的冗余版本。
  21. 根据权利要求19或20所述的方法，包括：确定最大传输次数，在所述最大传输次数内发送冗余版本。
  22. 根据权利要求19至21所述的方法，其特征在于，所述冗余版本0在缓存序列中起始位置为0。
  23. 根据权利要求19至22任一项所述的方法，其特征在于，所述冗余版本3在缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  24. 根据权利要求19至23任一项所述的方法，还包括：
    确定所述冗余版本的传输次序。
  25. 根据权利要求24所述的方法，所述确定所述冗余版本的传输次序包括：
    根据下述因素一项或多项确定所述冗余版本的传输次序：
    业务类型，传输模式，或者传输码率。
  26. 根据权利要求19至25任一项所述的方法，还包括：
    发送指示信息，所述指示信息指示所述冗余版本的传输次序。
  27. 根据权利要求26所述的方法，其特征在于，所述发送信息包括：
    通过物理层信令或无线资源控制RRC信令发送所述指示信息。
  28. 一种通信系统中的信息处理的方法，其特征在于，所述通信系统支持冗余版本的多种传输次序；
    确定冗余版本的传输次序，所述确定的冗余版本的传输次序为以下三种传输次序中的一种：{0,0,0,0}，{0,3,0,3}，或者，{0,2,3,1}；
    发送指示信息，所述指示信息指示确定的冗余版本的传输次序；以及
    按照所述确定的冗余版本的传输次序传输冗余版本。
  29. 根据权利要求28所述的方法，包括：确定最大传输次数，在所述最大传输次数内传输冗余版本。
  30. 根据权利要求28或29所述的方法，其特征在于，所述冗余版本0在缓存序列中起始位置为0。
  31. 根据权利要求28至30任一项所述的方法，其特征在于，所述冗余版本3在缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  32. 根据权利要求28至31任一项所述的方法，其特征在于，所述冗余版本1在所述缓存序列中起始位置为17z，或者13z，其中z为扩展因子。
  33. 根据权利要求28至32任一项所述的方法，其特征在于，所述冗余版本2在缓存序列中起始位置为33z，或者25z，其中z为扩展因子。
  34. 根据权利要求28至33任一项所述的方法，其特征在于，所述确定所述冗余版本的传输次序包括：
    根据下述因素一项或多项确定冗余版本的传输次序：
    业务类型，传输模式，或者传输码率。
  35. 根据权利要求28至34任一项所述的方法，其特征在于，所述发送指示信息包括：
    通过物理层信令或无线资源控制RRC信令发送所述指示信息。
  36. 一种通信系统中信息处理的方法，其特征在于，所述方法包括：
    获取冗余版本的传输次序，所述冗余版本的传输次序为以下三种传输次序中的一种：{0,0,0,0}，{0,3,0,3}，或者，{0,2,3,1}；
    将接收到的多个冗余版本按照所述获取到的冗余版本的传输次序保存在缓存序列中，其中第一次接收到的冗余版本为冗余版本0。
  37. 根据权利要求36所述的方法，其特征在于，所述冗余版本0在所述缓存序列中起始位置为0。
  38. 根据权利要求36或37所述的方法，其特征在于，所述冗余版本3在所述缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  39. 根据权利要求36至38任一项所述的方法，其特征在于，所述冗余版本1在所述缓存序列中起始位置为17z，或者13z，其中z为扩展因子。
  40. 根据权利要求36至39任一项所述的方法，其特征在于，所述冗余版本2在缓存序列中起始位置为33z，或者25z，其中z为扩展因子。
  41. 根据权利要求36至40任一项所述的方法，其特征在于，所述获取冗余版本的传输次序包括：
    接收信息，所述信息指示所述冗余版本的传输次序。
  42. 根据权利要求41所述的方法，所述接收信息包括：
    通过物理层信令或无线资源控制RRC信令接收所述信息。
  43. 根据权利要求36至42任一项所述的方法，所述方法还包括：
    对所述缓存序列译码得到码块。
  44. 一种通信装置，包括：
    处理单元，用于确定冗余版本的顺序和传输次数，所述冗余版本的顺序用于表示多个冗余版本的传输顺序，所述多个冗余版本均为可自解码的冗余版本；
    获取单元，用于基于所述冗余版本的顺序和所述传输次数获取缓存序列中的冗余版本。
  45. 根据权利要求44所述的通信装置，还包括：
    收发单元，用于发送所述冗余版本。
  46. 根据权利要求44或45所述的通信装置，所述处理单元用于：
    根据下述因素一项或多项确定所述冗余版本顺序：
    业务类型，传输模式，或者传输码率。
  47. 根据权利要求46所述的通信装置，其特征在于，所述业务类型包括以下至少一个：
    增强移动宽带eMBB，或者，低时延高可靠连接URLLC，或者，基于新空口的语音VoNR，或者，大规模物联网mMTC。
  48. 根据权利要求46或47任一项所述的通信装置，其特征在于，所述传输模式包括以下至少一个：免授权Grant Free，或者，多时隙聚合。
  49. 根据权利要求44至48任一项所述的通信装置，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
  50. 根据权利要求44至49任一项所述的通信装置，所述收发单元还用于发送指示所述冗余版本顺序的信息。
  51. 一种通信装置，其特征在于，包括：
    确定单元，用于确定冗余版本顺序和传输次数，所述冗余版本顺序用于表示多个冗余版本的传输顺序，所述多个冗余版本均为可自解码的冗余版本；
    处理单元，用于根据所述冗余版本顺序和传输次数在所述缓存序列中保存接收到的冗余版本。
  52. 根据权利要求51所述的通信装置，其特征在于，所述冗余版本顺序以冗余版本编号的序列表示为以下中的一个：{0,3,0,3}，或者，{0,3,3,3}，或者，{0,0,3,3}，或者，{0,3,3,0}，或者，{0,0,0,3}，或者，{0,0,0,0}，或者，{3,3,3,3}。
  53. 根据权利要求51或52所述的通信装置，还包括：
    收发单元，用于接收指示冗余版本顺序的信息。
  54. 根据权利要求53所述的通信装置，所述收发单元用于在下行控制信道或者下行数据信道上接收物理层信令或者无线资源控制RRC信令，所述指示所述冗余版本顺序的信息承载于所述物理层信令或者RRC信令。
  55. 根据权利要求51至54任一项所述的通信装置，所述处理单元还用于对所述 缓存序列进行译码。
  56. 一种通信装置，包括：
    用于为多次传输选择冗余版本的单元，其中，所述第一次传输的冗余版本为冗余版本0，所述第二次传输的冗余版本为冗余版本3，所述第三次传输的冗余版本为冗余版本0，所述第四次传输的冗余版本为冗余版本3；
    用于发送各冗余版本的单元。
  57. 根据权利要求56所述的通信装置，所述用于为多次传输选择冗余版本的单元还用于：
    按照冗余版本为{0,3,0,3}的传输次序选择后续的冗余版本。
  58. 根据权利要求56或57所述的通信装置，还包括：用于确定最大传输次数的单元，
    所述用于发送各冗余版本的单元发送各冗余版本的次数不超过所述最大传输次数。
  59. 根据权利要求56至58任一项所述的通信装置，其特征在于，所述冗余版本0在缓存序列中起始位置为0。
  60. 根据权利要求56至59任一项所述的通信装置，其特征在于，所述冗余版本3在缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  61. 根据权利要求56至60任一项所述的通信装置，还包括：
    用于确定所述冗余版本的传输次序的单元。
  62. 根据权利要求61所述的通信装置，所述用于确定所述冗余版本的传输次序的单元，用于根据下述因素一项或多项确定所述冗余版本的传输次序：
    业务类型，传输模式，或者传输码率。
  63. 根据权利要求56至62任一项所述的通信装置，包括：
    收发单元，用于发送信息，所述信息指示所述冗余版本的传输次序。
  64. 根据权利要求63所述的通信装置，所述收发单元用于通过通过物理层信令或无线资源控制RRC信令发送所述信息。
  65. 一种通信装置，用于支持冗余版本的多种传输次序的通信系统，包括：
    用于确定冗余版本的传输次序的单元，其中，所述确定的冗余版本的传输次序为以下三种传输次序中的一种：{0,0,0,0}，{0,3,0,3}，或者，{0,2,3,1}；
    用于发送指示信息的单元，所述指示信息指示确定的冗余版本的传输次序；以及
    用于按照所述确定的冗余版本的传输次序传输冗余版本的单元。
  66. 根据权利要求65所述的通信装置，还包括
    用于确定最大传输次数的单元，
    所述用于按照所述确定的冗余版本的传输次序传输冗余版本的单元发送各冗余版本的次数不超过所述最大传输次数。
  67. 根据权利要求65或66所述的通信装置，其特征在于，所述冗余版本0在缓存序列中起始位置为0。
  68. 根据权利要求65至67任一项所述的通信装置，其特征在于，所述冗余版本3在缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  69. 根据权利要求65至68任一项所述的通信装置，其特征在于，所述冗余版本1在所述缓存序列中起始位置为17z，或者13z，其中z为扩展因子。
  70. 根据权利要求65至69任一项所述的通信装置，其特征在于，所述冗余版本2在缓存序列中起始位置为33z，或者25z，其中z为扩展因子。
  71. 根据权利要求65至70任一项所述的通信装置，所述用于确定所述冗余版本的传输次序的单元，用于根据下述因素一项或多项确定所述冗余版本的传输次序：
    业务类型，传输模式，或者传输码率。
  72. 根据权利要求65至71任一项所述的通信装置，所述用于发送指示信息的单元用于通过物理层信令或无线资源控制RRC信令发送所述信息。
  73. 一种通信装置，包括：
    用于获取冗余版本的传输次序的单元，所述冗余版本的传输次序为以下三种传输次序中的一种：{0,0,0,0}，{0,3,0,3}，或者，{0,2,3,1}；
    用于将接收到的多个冗余版本按照所述获取到的冗余版本的传输次序保存在缓存序列中的单元，其中第一次接收到的冗余版本为冗余版本0。
  74. 根据权利要求73所述的通信装置，其特征在于，所述冗余版本0在缓存序列中起始位置为0。
  75. 根据权利要求73或74所述的通信装置，其特征在于，所述冗余版本3在缓存序列中起始位置为56z，或者43z，其中z为扩展因子。
  76. 根据权利要求73至75任一项所述的通信装置，其特征在于，所述冗余版本1在所述缓存序列中起始位置为17z，或者13z，其中z为扩展因子。
  77. 根据权利要求73至76任一项所述的通信装置，其特征在于，所述冗余版本2在缓存序列中起始位置为33z，或者25z，其中z为扩展因子。
  78. 根据权利要求73至77任一项所述的通信装置，用于获取冗余版本的传输次序的单元，用于接收信息，所述信息指示所述冗余版本的传输次序。
  79. 根据权利要求78所述的通信装置，用于获取冗余版本的传输次序的单元通过物流层信息或无线资源控制RRC信令接收所述信息。
  80. 根据权利要求73至79任一项所述的通信装置，还包括：
    用于对所述缓存序列译码得到码块的单元。
  81. 一种通信装置，用于执行如权利要求1至43项任一项所述的方法。
  82. 一种通信装置，其特征在于，所述通信装置包括处理器、存储器以及存储在存储器上并可在处理器上运行的指令，当所述指令被运行时，使得所述通信装置执行如权利要求1至43项任一项所述的方法。
  83. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1至43任一项所述的方法。
  84. 一种基站，包括如权利要求44至50，56至72任一项所述的通信装置。
  85. 一种终端，包括如权利要求51至55，73至80任一项所述的通信装置。
  86. 一种通信系统，包括如权利要求84所述的基站用于多次传输码块的冗余版本，以及如权利要求85所述的终端用于接收所述基站发送的多个冗余版本并进行合并译码得到所述码块。
PCT/CN2018/108360 2017-09-29 2018-09-28 通信系统中冗余版本的设计方案 WO2019062861A1 (zh)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP18860322.9A EP3691162B1 (en) 2017-09-29 2018-09-28 Design scheme for redundancy versions in communication system
JP2020518454A JP7017627B2 (ja) 2017-09-29 2018-09-28 通信システムにおける冗長バージョン設計ソリューション
KR1020207012543A KR102343666B1 (ko) 2017-09-29 2018-09-28 통신 시스템에서의 리던던시 버전 설계 솔루션
BR112020006259-6A BR112020006259A2 (pt) 2017-09-29 2018-09-28 solução de projeto de versão de redundância em sistema de comunicações
US16/833,655 US11277231B2 (en) 2017-09-29 2020-03-29 Redundancy version design solution in communication systems

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710911469.4 2017-09-29
CN201710911469.4A CN109586843B (zh) 2017-09-29 2017-09-29 通信系统中冗余版本的设计方案

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/833,655 Continuation US11277231B2 (en) 2017-09-29 2020-03-29 Redundancy version design solution in communication systems

Publications (1)

Publication Number Publication Date
WO2019062861A1 true WO2019062861A1 (zh) 2019-04-04

Family

ID=65902242

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/108360 WO2019062861A1 (zh) 2017-09-29 2018-09-28 通信系统中冗余版本的设计方案

Country Status (7)

Country Link
US (1) US11277231B2 (zh)
EP (1) EP3691162B1 (zh)
JP (1) JP7017627B2 (zh)
KR (1) KR102343666B1 (zh)
CN (2) CN109586843B (zh)
BR (1) BR112020006259A2 (zh)
WO (1) WO2019062861A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3982577A4 (en) * 2019-06-06 2022-11-16 Vivo Mobile Communication Co., Ltd. PROCESSING METHOD AND EQUIPMENT

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112910622B (zh) * 2015-11-06 2021-11-30 中兴通讯股份有限公司 信道状态测量导频的配置方法及装置、解析方法及装置
WO2018143743A1 (ko) 2017-02-06 2018-08-09 엘지전자 주식회사 행-직교 구조(row-orthogonal)를 이용한 LDPC 코드 전송 방법 및 이를 위한 장치
CN108400832B (zh) * 2017-02-06 2022-09-09 华为技术有限公司 数据处理方法和通信设备
EP3665779A4 (en) * 2017-08-10 2021-03-24 Nokia Solutions and Networks Oy PROCESS AND APPARATUS
KR102576714B1 (ko) * 2017-12-04 2023-09-11 삼성전자주식회사 무선 통신 시스템에서 상향링크 데이터 전송 방법 및 장치
US10958383B2 (en) * 2017-12-06 2021-03-23 Qualcomm Incorporated Time based redundancy version determination for grant-free signaling
WO2019164515A1 (en) * 2018-02-23 2019-08-29 Nokia Technologies Oy Ldpc codes for 3gpp nr ultra-reliable low-latency communications
US11411672B2 (en) * 2019-09-03 2022-08-09 Electronics And Telecommunication Research Institute Method and apparatus for data transmission in wireless communication system
CN113726487B (zh) * 2020-05-26 2022-09-02 中国联合网络通信集团有限公司 一种冗余版本的确定方法和装置
US11445529B2 (en) * 2020-08-05 2022-09-13 Qualcomm Incorporated Techniques for relaying in sidelink communications
WO2022236719A1 (zh) * 2021-05-11 2022-11-17 Oppo广东移动通信有限公司 无线通信方法、终端设备和网络设备
CN113467440A (zh) * 2021-06-09 2021-10-01 珠海云洲智能科技股份有限公司 一种航行控制器
CN117769876A (zh) * 2021-07-23 2024-03-26 瑞典爱立信有限公司 用于tboms传输的方法和装置
CN114070468B (zh) * 2021-11-12 2023-05-23 四川天邑康和通信股份有限公司 一种应用于5g基站通信中冗余版本号2的自解识别方法
CN114374473B (zh) * 2021-12-08 2023-08-08 天翼物联科技有限公司 NB-IoT水表数据重传优化方法、系统、装置及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法
CN101741527A (zh) * 2008-11-27 2010-06-16 中兴通讯股份有限公司 速率匹配方法和装置
CN106817195A (zh) * 2015-12-02 2017-06-09 华为技术有限公司 用于极化码的速率匹配的方法和装置
US20170207884A1 (en) * 2016-01-18 2017-07-20 Qualcomm Incorporated Harq llr buffer and reordering buffer management

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7925953B2 (en) * 2003-10-07 2011-04-12 Nokia Corporation Redundancy strategy selection scheme
US7986741B2 (en) * 2007-09-28 2011-07-26 Samsung Electronics Co., Ltd. Method and apparatus of improved circular buffer rate matching for turbo-coded MIMO-OFDM wireless systems
KR20090043414A (ko) * 2007-10-29 2009-05-06 엘지전자 주식회사 Ｈａｒｑ를 이용한 데이터 전송방법
CN101754274B (zh) * 2009-12-29 2012-07-04 华为技术有限公司 一种数据重传方法和设备
CN103248464B (zh) * 2012-02-13 2016-04-13 电信科学技术研究院 上行数据传输方法和装置
CN103428836B (zh) * 2012-05-16 2016-03-30 华为技术有限公司 基于harq的数据传输方法、设备和系统
CN103795505A (zh) * 2012-11-02 2014-05-14 电信科学技术研究院 一种传输数据的方法、系统和设备
US10057932B2 (en) * 2013-10-06 2018-08-21 Lg Electronics Inc. Method and apparatus for transceiving signal from device-to-device terminal in wireless communication system
KR20170102875A (ko) * 2014-12-31 2017-09-12 퀄컴 인코포레이티드 리던던시 버전 패킷들로부터 정보 복원을 위한 시스템들 및 방법들
CN107197528B (zh) * 2016-03-14 2020-12-25 华为技术有限公司 一种资源调度和分配的方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法
CN101741527A (zh) * 2008-11-27 2010-06-16 中兴通讯股份有限公司 速率匹配方法和装置
CN106817195A (zh) * 2015-12-02 2017-06-09 华为技术有限公司 用于极化码的速率匹配的方法和装置
US20170207884A1 (en) * 2016-01-18 2017-07-20 Qualcomm Incorporated Harq llr buffer and reordering buffer management

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
See also references of EP3691162A4
ZTE: "Bit rearrangement of LDPC for high order modulation", 3GPP TSG RAN WG1 AH_NR MEETING, R1-1700248, 20 January 2017 (2017-01-20), XP051202751 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3982577A4 (en) * 2019-06-06 2022-11-16 Vivo Mobile Communication Co., Ltd. PROCESSING METHOD AND EQUIPMENT

Also Published As

Publication number Publication date
KR102343666B1 (ko) 2021-12-24
BR112020006259A2 (pt) 2020-10-06
US20200228254A1 (en) 2020-07-16
EP3691162B1 (en) 2022-08-24
US11277231B2 (en) 2022-03-15
JP7017627B2 (ja) 2022-02-08
CN109586843B (zh) 2024-05-03
CN112073160B (zh) 2021-12-31
EP3691162A1 (en) 2020-08-05
KR20200053618A (ko) 2020-05-18
JP2020535767A (ja) 2020-12-03
CN109586843A (zh) 2019-04-05
CN112073160A (zh) 2020-12-11
EP3691162A4 (en) 2020-11-25

Similar Documents

Publication Publication Date Title
CN109586843B (zh) 通信系统中冗余版本的设计方案
US11070316B2 (en) Information processing method, apparatus, communications device, and communications system
US11742987B2 (en) Method and apparatus for processing information, communications device, and communications system
CN107508653B (zh) 一种数据传输方法、装置和设备
CN108173621B (zh) 数据传输的方法、发送设备、接收设备和通信系统
AU2017426621B2 (en) Method and apparatus
WO2021254422A1 (zh) Polar码编码方法、Polar码译码方法及其装置
US20230171033A1 (en) Retransmission method and apparatus
CN112636879A (zh) 基于混合自动重传请求的码块处理的方法和装置
WO2018218692A1 (zh) 信息处理的方法和通信装置
WO2018103638A1 (zh) 数据传输的方法、发送设备、接收设备和通信系统
WO2018218471A1 (zh) 信息处理的方法和通信装置
WO2021136539A1 (zh) 卷积码的速率匹配的方法和无线通信装置
CN114124292A (zh) 一种重传方法及装置
CN113708778A (zh) Ldpc的速率匹配的方法和通信装置
CN111213346A (zh) 用于促进多用户检测的方法和计算设备
WO2018233334A1 (zh) 信息处理方法、装置、通信设备和通信系统
CN114415946A (zh) 解速率匹配的方法及装置、终端设备、芯片及存储介质

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020518454

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20207012543

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2018860322

Country of ref document: EP

Effective date: 20200429

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112020006259

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 112020006259

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20200327