[go: up one dir, main page]

WO2018103638A1 - Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication - Google Patents

Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication Download PDF

Info

Publication number
WO2018103638A1
WO2018103638A1 PCT/CN2017/114637 CN2017114637W WO2018103638A1 WO 2018103638 A1 WO2018103638 A1 WO 2018103638A1 CN 2017114637 W CN2017114637 W CN 2017114637W WO 2018103638 A1 WO2018103638 A1 WO 2018103638A1
Authority
WO
WIPO (PCT)
Prior art keywords
coded
receiving device
code block
code
block
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2017/114637
Other languages
English (en)
Chinese (zh)
Inventor
马亮
郑晨
熊杰
曾歆
刘晓健
魏岳军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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
Priority claimed from CN201710042967.XA external-priority patent/CN108173621B/zh
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP17878570.5A priority Critical patent/EP3540947A4/fr
Priority to JP2019530482A priority patent/JP6886515B2/ja
Publication of WO2018103638A1 publication Critical patent/WO2018103638A1/fr
Priority to US16/433,985 priority patent/US10917114B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits

Definitions

  • Embodiments of the present invention relate to the field of communications, and in particular, to a data transmission method, a transmitting device, a receiving device, and a communication system.
  • information data is transmitted between a transmitting device (for example, a base station or a terminal) and a receiving device (for example, a terminal or a base station). Since the wireless propagation environment is complex and variable, it is susceptible to interference and errors occur.
  • the transmitting 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 receiving device. After receiving the modulation symbol, the receiving device recovers the information data by deinterleaving, de-rate matching, decoding, and CRC check.
  • 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.
  • An LDPC code commonly used in communication systems has special structural features, and its base matrix has m*n elements. If z is used as an extension factor, the check matrix H can be obtained as (m*z)*(n*).
  • the matrix of z), that is, having m*n block matrices, each block is a z*z unit matrix obtained by cyclic shift.
  • all elements with a value of -1 in the matrix are expanded to be a 4x4 all-zero matrix, and other elements are expanded to a 4*4 permutation matrix.
  • the permutation matrix can be obtained by a unit matrix I after a corresponding number of cyclic shifts, the number of displacements being equal to the value of the corresponding matrix element.
  • the corresponding matrix after the expansion of the element with a value of 0 in the base matrix is 4*4
  • the corresponding matrix after the expansion of the element with a value of 1 is the matrix obtained by one displacement of the unit matrix. , and so on, will not go into details here.
  • the base matrix After the base matrix is expanded, it can be used as a check matrix for LDPC code encoding.
  • a code length is n
  • the information sequence length is k
  • the LDPC code recorded as (n, k) can be uniquely determined by the check matrix H.
  • the check matrix H is a sparse matrix, and each row represents a check equation constraint, corresponding to j coded bits, each column indicating that one coded bit is constrained by m check equations, and any two check equations contain at most one identical coded bit.
  • An example of a check matrix H of an LDPC code and its corresponding check equation is given by the following equation (1):
  • the check matrix H can also be represented by a Tanner graph.
  • Each column in the H matrix can be used as a variable node, corresponding to a coded bit.
  • each of v 0 , v 1 ,..., v 9 , H matrix A row can be used as a check node, in the above example, c 0 , c 1 , ..., c 4 .
  • Each line between the check node and the variable node may indicate that there is a non-zero element at the intersection of the row and column corresponding to the two nodes.
  • a core matrix and three extended matrix parts are included.
  • four check matrices can be used for encoding and decoding: the core matrix, the core matrix and the check matrix 1 composed of the extended matrix portion 1, the core matrix, the extended matrix portion 1 and the extended matrix portion 2
  • the matrix 2, the core matrix, the extended matrix portion 1, the extended matrix portion 2, and the extended matrix portion 3 constitute a complete matrix.
  • These check matrices have a Raptor-like structure, and the check bits have a double-diagonal and single-column double structure.
  • the code rate is k/n, and encoding with different check matrices can obtain LDPCs with different code rates. Encoded code block.
  • the LDPC code generated according to the complete matrix has the largest code length and the lowest code rate R min ; the LDPC code generated according to the core matrix has the smallest code length and the highest code rate R max , and the LDPC generated according to the check matrix 1
  • the code has a code rate of R 1
  • the code rate of the LDPC code generated by the check matrix 2 is R 2 , and then R min ⁇ R 2 ⁇ R 1 ⁇ R max .
  • the complete matrix, the core matrix, the check matrix 1 or the check matrix 2 may all be used as a matrix of the base matrix of the LDPC code according to the spreading factor.
  • LDPC coding Since LDPC coding is used, a base matrix of different code rates can be selected, and for the same base matrix to be extended, a check matrix of different sizes can be selected for encoding and decoding. The larger the check matrix is, the more coded bits are generated by the information data, and the lower the code rate, the more complicated the decoding and storage overhead of the receiving device 31.
  • the embodiment of the present invention provides a data transmission method, a sending device, a receiving device, and a communication system, so as to reduce the storage overhead of the sending device or the receiving device when using LDPC as the channel coding mode, and reduce coding or The complexity of decoding increases the decoding success rate.
  • a data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block,
  • the first transport block includes a first code block, including:
  • the sending device obtains the encoded bit segment from the first coded code block, where the first coded code block is obtained by processing the first code block according to the processing capability of the receiving device;
  • the transmitting device sends the encoded bit segment to the receiving device.
  • the sending device determines the size of the coded block based on the processing capability of the receiving device, and selecting the transmitted coded bit segment, the storage overhead of the receiving device can be saved, and the decoding complexity of the receiving device can be reduced.
  • a data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block,
  • the first transmission includes a first code block, including:
  • the receiving device performs LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from the first coded code block, the first code
  • the code block is obtained by the sending device processing the first code block according to the processing capability of the receiving device.
  • the sending device determines the size of the coded block based on the processing capability of the receiving device, and selects the transmitted coded bit segment
  • the receiving device receiving the coded bit segment decoding can save the storage overhead of the receiving device and reduce the decoding complexity of the receiving device.
  • the processing capability of the receiving device includes a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.
  • the number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is Kw ; or
  • the processing capability of the receiving device includes a lowest decoding code rate R t supported by the receiving device, and a size of the first coded code block.
  • K IR send is the first transport block size
  • the number of code blocks included in the first transport block is C
  • the loop buffer size of the sending device is K w ;
  • the transmitting device can determine the coded block size based on the processing capabilities of different receiving devices, and can implement flexible control.
  • the first start position S i of the coded bit segment of length n i in the first code block is determined according to the redundancy version RV j ;
  • i is an integer greater than or equal to 0
  • i is 0 for initial transmission
  • i is greater than 0 for ith retransmission
  • j is an integer
  • j max is the transmitting device and the a maximum number of redundancy versions between the receiving devices, where the starting positions corresponding to the j max redundancy versions are equally spaced in the first coded code block, and the starting position of the RV 0 is the first code
  • the position of the pth bit in the code block, and p is an integer greater than or equal to 0.
  • the first starting position S i of the coded bit segment of the length n i in the first coded code block is a coded bit segment acquired according to a previous transmission.
  • Corresponding starting position S i-1 and the length n i-1 of the encoded bit segment acquired by the previous transmission wherein the initial starting position S 0 is the p - th bit of the first coded block position, or a length of n i of the coded bits of the first segment of encoded code blocks in a first starting position S i based on the initial transmission start position S 0, the initial transmission of the encoded bit length of the segment n 0 and the number of retransmissions i is determined, wherein the initial position S 0 of the initial transmission is the position of the pth bit of the first coded code block.
  • p z ⁇ l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer.
  • l may be 1, 2, or 3. One.
  • the above implementation manner can flexibly determine the starting position of the coded bit segment of the initial transmission or the retransmission.
  • the position of the soft value bit in the soft information buffer of the receiving device and the bit position of the coded bit segment in the first coded code block are in one-to-one correspondence.
  • the sending device may flexibly select a matrix for encoding to match the first a size of an encoded code block, where the first coded code block is obtained by matching a size of the first coded code block after the first code block is encoded by a complete matrix of the LDPC code; or, the first code block The coded code block is obtained by encoding the first code block by the check matrix of the LDPC code, wherein the check matrix of the LDPC code is determined according to the size of the first coded code block.
  • the complete matrix of the LDPC code includes a built-in punctured column, or the check matrix of the LDPC code includes a built-in punctured column, and the coded bits corresponding to the built-in punctured column are not included in the first coded code block.
  • the built-in punctured column is a complete matrix of the LDPC code or a column with a large column weight in the check matrix.
  • the first coded code block is the LDPC base matrix of the first code block according to the 0th column of the check matrix after the expansion factor z is expanded.
  • the matrix of the Nth CB -1 column is encoded; or,
  • the S i to S i +n i -1 coded bits in the first coded code block are the same as the first code block according to a first LDPC matrix substrate S after the check matrix expanded spreading factor z -1 in a column corresponding to column i coded bits through S i + n i; or
  • the S i to N CB -1 coded bits in the first code block are an LDPC basis matrix of the first code block according to a first column of the parity check matrix S i after expansion factor z is expanded through N CB -1 coded bits corresponding to the columns, a first coded code blocks 0 through n i - (N CB -1- S i) coded bits are parity check matrix after the matrix base LDPC code block according to a first spreading factor z deployment of 0 through n i - (N CB -1- S i) coded bits corresponding to columns.
  • the length of the bit segment per code is equal to the number of bits actually transmitted, and the complexity of the coding of the transmitting device is reduced.
  • the receiving device determines a decoding code rate of the soft information buffer, determines a first check matrix according to the decoding code rate, and caches the soft information.
  • the first code block is obtained by decoding the first check matrix. Since the receiving device can select the check matrix decoding according to the decoding code rate, the decoding complexity is reduced.
  • a third aspect provides a sending device, configured to send a first transport block, where the first transport block includes a first code block, including:
  • a rate matcher configured to obtain an encoded bit segment from the first coded code block, where the first coded code block is obtained by processing the first code block according to processing capability of the receiving device ;
  • transceiver configured to send the coded bit segment to the receiving device.
  • the transmitting device may be used to perform the method described in the above aspects, with particular reference to the description of the above aspects.
  • the transmitting device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design.
  • the module can be software and/or hardware.
  • a receiving device including:
  • a transceiver configured to receive a coded bit segment from the sending device
  • a rate-matching unit configured to save the soft-valued bits of the encoded bit segment in a soft information buffer of the receiving device
  • a decoder configured to perform LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from a first coded code block, where An encoded code block is obtained by the sending device processing the first code block according to processing capability of the receiving device.
  • the receiving device can be used to perform the method described in the above aspects, with particular reference to the description of the above aspects.
  • the receiving device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design.
  • the module can be software and/or hardware.
  • a fifth aspect provides a data transmission method for a communication system using an LDPC code, the communication system including a transmitting device and a receiving device, including:
  • the sending device obtains the redundant version RV j sent
  • the transmitting device determines, according to the redundancy version RV j , a first starting position S i of the encoded bit segment in the first coded code block;
  • the transmitting device acquires, as the encoded bit segment, an encoded bit segment of length n i from a first starting position S i in the first coded code block;
  • i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,
  • j is an integer, and 0 ⁇ j ⁇ j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is
  • the first coded code block is equally spaced, the starting position of RV 0 is the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0.
  • a sixth aspect provides a data transmission method for a communication system using an LDPC code, the communication system including a transmitting device and a receiving device, including:
  • the transmitting device determines a first starting position S i of the encoded bit segment in the first coded code block
  • the transmitting device acquires, as the encoded bit segment, an encoded bit segment of length n i from a first starting position S i in the first coded code block;
  • i is an integer greater than or equal to 0,
  • S 0 is the position of the pth bit of the first coded block.
  • S i (S i-1 +n i-1 )%N CB , where S i-1 is the starting position corresponding to the encoded bit segment acquired by the previous transmission, and n i-1 is acquired by the previous transmission The length of the encoded bit segment, or,
  • a data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:
  • the receiving device acquires the transmitted redundancy version RV j ;
  • the receiving device determines, according to the redundancy version RV j , a first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer;
  • the receiving device combines and stores the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i ;
  • i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,
  • j is an integer, and 0 ⁇ j ⁇ j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is
  • the soft information buffer is equally spaced, the starting position of RV 0 is the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.
  • a data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:
  • the receiving device determines a first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer
  • the receiving device merges and stores the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i ;
  • i is an integer greater than or equal to 0,
  • S 0 is the position of the p-th soft bit of the soft information buffer.
  • S i (S i-1 +n i-1 )%N CB , where S i-1 is the starting position of the soft bit of the previously received encoded bit segment, and n i-1 is the previous received The number of soft-valued bits of the encoded bit segment, or,
  • n 0 n 0 .
  • p z ⁇ l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer.
  • the above implementation manner can flexibly determine the starting position of the coded bit segment of the initial transmission or the retransmission.
  • the sending device may flexibly select a matrix for encoding to match a size of the first coded code block, where the first coded code block is the first a code block is matched according to the size of the first coded code block after being coded by the LDPC code; or the first code block is obtained by encoding the first code block by the check matrix of the LDPC code
  • the check matrix of the LDPC code is determined according to the size of the first coded code block.
  • the complete matrix of the LDPC code includes a built-in punctured column, or the check matrix of the LDPC code includes a built-in punctured column, and the coded bits corresponding to the built-in punctured column are not included in the first coded code block.
  • the built-in punctured column is a complete matrix of the LDPC code or a column with a large column weight in the check matrix.
  • the first coded code block is the LDPC base matrix of the first code block according to the 0th column of the check matrix after the expansion factor z is expanded.
  • the matrix of the Nth CB -1 column is encoded; or,
  • the S i to S i +n i -1 coded bits in the first coded code block are the same as the first code block according to a first LDPC matrix substrate S after the check matrix expanded spreading factor z -1 in a column corresponding to column i coded bits through S i + n i; or
  • the S i to N CB -1 coded bits in the first code block are an LDPC basis matrix of the first code block according to a first column of the parity check matrix S i after expansion factor z is expanded through N CB -1 coded bits corresponding to the columns, a first coded code blocks 0 through n i - (N CB -1- S i) coded bits are parity check matrix after the matrix base LDPC code block according to a first spreading factor z deployment of 0 through n i - (N CB -1- S i) coded bits corresponding to columns.
  • the length of the bit segment per code is equal to the number of bits actually transmitted, and the complexity of the coding of the transmitting device is reduced.
  • a transmitting device including:
  • i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,
  • j is an integer, and 0 ⁇ j ⁇ j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is
  • the first coded code block is equally spaced, the starting position of RV 0 is the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0;
  • transceiver configured to send the coded bit segment to the receiving device.
  • the transmitting device may be configured to perform the methods described in the fifth aspect above, with specific reference to the description of the foregoing aspects.
  • a transmitting device including:
  • a rate matcher configured to determine a first start position S i of the coded bit segment in the first code block
  • i is an integer greater than or equal to 0,
  • S 0 is the position of the pth bit of the first coded block.
  • S i (S i-1 +n i-1 )%N CB , where S i-1 is the starting position corresponding to the encoded bit segment acquired by the previous transmission, and n i-1 is acquired by the previous transmission The length of the encoded bit segment, or,
  • a transceiver configured to send the encoded bit segment to a receiving device.
  • the transmitting device may be configured to perform the methods described in the sixth aspect above, with specific reference to the description of the foregoing aspects.
  • each transmitting device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design.
  • the module can be software and/or hardware.
  • a receiving device including:
  • a transceiver configured to receive a coded bit segment from a transmitting device
  • a rate matching device for obtaining a transmitted redundancy version RV j ,
  • i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,
  • j is an integer, and 0 ⁇ j ⁇ j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is
  • the soft information buffer is equally spaced, the starting position of RV 0 is the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.
  • the receiving device may be configured to perform the methods described in the seventh aspect above, with specific reference to the description of the above aspects.
  • a receiving device including:
  • a transceiver configured to receive a coded bit segment from a transmitting device
  • a rate-matching device configured to determine a first starting position S i of the soft-valued bit of the encoded bit segment in the soft information buffer
  • i is an integer greater than or equal to 0,
  • S 0 is the position of the p-th soft bit of the soft information buffer.
  • S i (S i-1 +n i-1 )%N CB , where S i-1 is the starting position of the soft bit of the previously received encoded bit segment, and n i-1 is the previous received The number of soft-valued bits of the encoded bit segment, or,
  • n 0 n 0 .
  • the receiving device may be used to perform the methods described in the above eighth aspect, with specific reference to the description of the above aspects.
  • each receiving device provided by the present application may include a module for performing the behavior of the receiving device in the above method design.
  • the module can be software and/or hardware.
  • an embodiment of the present invention provides a communication system, where the system includes the sending device and the receiving device in the foregoing aspect.
  • an embodiment of the present invention provides a computer storage medium including a program designed to perform the above aspects.
  • the method, the sending device, the receiving device, and the communication system of the embodiments of the present invention use the LDPC code as the channel coding mode, and determine the size of the coded block based on the processing capability of the receiving device, and select the transmitted coded bit segment to save the receiving device.
  • the storage overhead reduces the decoding complexity of the receiving device.
  • 1 is a schematic diagram of a base matrix of an LDPC code and a permutation matrix thereof;
  • FIG. 2 is a schematic structural diagram of a parity check matrix of an LDPC code
  • FIG. 3 is a structural diagram of a communication system according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a data transmission method according to another embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a first coded code block according to another embodiment of the present invention.
  • FIG. 6 is a flowchart of a data transmission method according to another embodiment of the present invention.
  • FIG. 7 is a structural diagram of a sending device according to another embodiment of the present invention.
  • FIG. 8 is a structural diagram of a receiving device according to another embodiment of the present invention.
  • the communication system 300 includes a transmitting device 30 and a receiving device 31.
  • the transmitting device 30 divides the information data into a plurality of transmission blocks (TBs) according to the size of the supported transport block.
  • a CRC check is added to each transport block. If the transport block size after adding the check exceeds the maximum code block length, Then, the transport block needs to be divided into several code blocks (CBs), and the code block CRC check can also be added in each code block, and padding bits can also be added.
  • the transmitting device 30 performs channel coding on each code block separately, for example, using LDPC coding to obtain a corresponding coded block.
  • Each of the coded code blocks includes a plurality of information bits before encoding and parity bits generated by the code, and are collectively referred to as coded bits.
  • the coded code block is stored in the circular buffer of the transmitting device 30 after the sub-block is interleaved, and the transmitting device 30 selects a piece of coded bit to be transmitted from the circular buffer, that is, obtains an encoded bit segment, which is interleaved, mapped to a modulation symbol, and then transmitted.
  • the sending device 30 selects another encoded bit segment to be sent from the circular buffer. If the data in the circular buffer is transmitted once, it returns to the front end of the circular buffer to re-encode the bit.
  • the receiving device 31 demodulates the received modulation symbols, and after deinterleaving, stores the soft values of the received encoded bit segments in corresponding positions in the soft buffer. If retransmission occurs, the receiving device 31 combines the soft values of the coded bit segments that are retransmitted each time in the soft information buffer. The merging here means that if the received coded bits are in the same position, they will be twice. The received soft values of the coded bits are combined. The receiving device 31 decodes all soft values in the soft information buffer to obtain code blocks of the information data.
  • the sending device 30 may be a network device in a communication system, such as a base station, and the corresponding receiving device 31 may be a terminal. To facilitate understanding, some of the terms related to this application are described below.
  • 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.
  • 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, for example, in a Universal Mobile Telecommunications System (UMTS) network, a base station is called a Node B, but in an LTE network.
  • the base station is called an evolved NodeB (eNB or eNodeB), and other base stations may also adopt other names in the 5th generation network.
  • eNB evolved NodeB
  • eNodeB evolved NodeB
  • the invention is not limited to this.
  • FIG. 4 is a flowchart of a data transmission method according to an embodiment of the present invention.
  • the method is applicable to a communication system using an LDPC code, and the communication system includes a sending device 30 and a receiving device 31.
  • the method includes:
  • the sending device 30 acquires an encoded bit segment from the first coded code block.
  • the transmitting device 30 can be configured to transmit a data transport block, such as a first transport block, which can be divided into at least one code block.
  • the first coded code block may be obtained by the sending device 30 processing one code block in the first transport block, for example, the first code block, according to the processing capability of the receiving device 31.
  • the sending device 30 determines the size of the first coded code block according to the processing capability of the receiving device 31, and the sending device 30 obtains the second coded code block by using the LDPC full matrix code for the first code block, and then according to the size of the first coded code block. Matching the second coded code block to obtain a first coded code block.
  • the sending device 30 determines the size of the first coded code block according to the processing capability of the receiving device 31, and the sending device 30 determines an LDPC check matrix according to the size of the first coded code block, and uses the check matrix to perform the first code block.
  • the LDPC code obtains the first coded code block.
  • the second coded block has a built-in punch
  • the coded bits corresponding to the column, that is, the built-in punctured column, the coded bits obtained by encoding the first code block are deleted, and then the first coded code block is obtained according to the size of the first coded code block, that is, the first coded code block.
  • the coded bits corresponding to the built-in punctured column are not included; or if the LDPC check matrix includes the built-in punctured column, the built-in punctured column needs to be deleted in the coded block obtained by encoding the first code block by using the LDPC check matrix.
  • the first coded code block is obtained, that is, the coded bits corresponding to the built-in punctured column are not included in the first coded code block, and the code block size obtained by the LDPC check matrix coding is larger than the size of the first coded code block. Therefore, after the coded bits corresponding to the built-in punctured column are deleted, the code block size and the first coded code block size are equal.
  • the built-in punctured column is a LDPC complete matrix or a column with a large column weight in the LDPC check matrix.
  • the transmitting device 30 sends the encoded bit segment acquired in step 401 to the receiving device 31.
  • the processing capability of the receiving device 31 may be based on the size of the register, the capabilities of the decoder, etc., including but not limited to at least one of the following: the maximum transport block size N IR that the soft information buffer of the receiving device 31 can support, the decoder supports The lowest decoding code rate R t and the size of the largest code block supported by the receiving device 31 N CB,t . Different values of these processing capabilities may be represented by different levels of the receiving device 31.
  • the receiving device 31 has a processing capability of the receiving device 31 as an example of a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device 31.
  • the level of 31 is 1, and the maximum transport block size N IR that the soft information buffer can support is 250,000 bits, the level is 2, and the maximum transport block size N IR that the soft information buffer can support is 1000000 bits. It should be noted that the foregoing is merely illustrative and not limiting.
  • a first to N CB represents the size of encoded code blocks, the first code block coding size N CB any of the disclosed formula can be determined by the following:
  • N CB min(K W , N CB, t ).
  • K w is the circular buffer size of the transmitting device 30
  • C is the number of code blocks included in the first transport block
  • K IR, send is the size of the first transport block, It is rounded down, and min(.) takes the minimum value for the elements in parentheses.
  • the size of the first coded code block is less than or equal to the circular buffer size of the transmitting device 30, and the first coded code block obtained by using the LDPC check matrix code for the first code block is stored in the circular buffer, and the first code is saved.
  • the circular buffer portion of the code block may also be referred to as a virtual buffer, and the size of the first coded code block may also be said to be the size of the virtual buffer of the transmitting device 30.
  • the transmitting device 30 determines the size of the coded block based on the processing capability of the receiving device 31 when the coded block is initially transmitted or retransmitted, and selects the transmitted coded bit segment to save the receiving device 31.
  • the storage overhead and the decoding complexity of the receiving device 31 are reduced.
  • the N CB is limited by the size of the largest code block N CB,t supported by the receiving device 31
  • the code rate output by the encoder is determined by the size of the first code block.
  • the larger the size of the first code block the larger the encoder. The higher the code rate of the output; the smaller the size of the first code block, the lower the code rate of the encoder output.
  • the sending device 30 will perform the obtained coded bit segment, after being interleaved, mapped into a modulation symbol, and then sent to the receiving device. 31. Further, the transmitting device 30 can also punct the acquired coded bit segments to increase the code rate.
  • the transmitting device 30 may first determine the transmitted redundancy version RV j and then determine the first starting position S of the coded bit segment to be acquired in the first coded code block according to the redundancy version RV j . i, and start getting the coded bits from the first segment of encoded code blocks in the first start position S i.
  • i is an integer greater than or equal to 0
  • i is 0 for initial transmission, i is greater than 0 for ith retransmission; 0 ⁇ j ⁇ j max , j max is redundancy between transmitting device 30 and receiving device 31
  • the maximum number of versions may be the coded code block obtained by processing the first code block according to the method shown in FIG. 4, or may be the code obtained by processing the first code block by other means. Code block.
  • redundancy version When the communication system supports retransmission, which redundancy version is negotiated between the transmitting device 30 and the receiving device 31, and which redundancy version is used each time the retransmission is transmitted.
  • Each of the redundancy versions may be used to indicate a starting position of the coded bit segment in the first coded code block, and the transmitting device 30 obtains the coded bit segment from the start position.
  • the decoding success rate of the receiving device 31 can be improved by transmitting different coded bit segments in the coded block each time.
  • the starting positions corresponding to the j max redundancy versions may be distributed at different positions in the first coded code block, and are usually equally spaced.
  • redundancy version is typically used RV 0, RV starting position 0 S 0 may be the position of the first encoded block of bits where p, where p is greater than or An integer equal to 0.
  • the length of the first coded code block is 179 bits, and the column is written in the circular buffer in 7 rows and 26 columns, and the position of the first row of the 0th column starts.
  • the starting position corresponding to RV 0 is the 0th line of the 1st column, that is, the 7th bit
  • the starting position corresponding to RV 1 is the 0th line of the 7th column, that is, the 49th bit
  • the starting position corresponding to RV 3 is the 0th line of the 19th column, that is, the 133rd bit.
  • the various redundancy versions are equally spaced. If the redundancy version used for transmission is RV 0 , the transmitting device 30 reads the coded bit segments in the column order from the first column, that is, reads the coded bit segments having a length of 42 bits from the seventh bit. If the redundancy version used for transmission is RV 3 , the transmitting device 30 reads the coded bit segments in column order starting from the 19th column. It should be noted that after the last bit is read by the transmitting device 30, it is further continued to return to the circular buffer. The starting position reads the 1st line of column 0, that is, reads the coded bit segment having a total length of 53 bits. It should be noted that the present invention is only a convenient example and is not limited thereto.
  • the first coded code block may be the coded code block obtained by processing the first code block according to the method shown in FIG. 4, or may be the coded code processed by the first code block by other means. Piece.
  • l is a positive integer and can generally take the value 1, 2, 3.
  • the coded bit segment is taken from the first column at the time of initial transmission. It should be noted that the embodiments herein are merely examples, and the embodiments of the present invention are not limited thereto.
  • the decoding success rate can be further improved.
  • the first coded code block can be obtained in various manners.
  • the sending device 30 may process the first code block according to the size of the first coded code block to obtain the first coded code block. In this way, rate matching and channel coding are not coupled.
  • the sending device 30 may encode the first code block by using a complete matrix of the LDPC code to obtain a second coded code block, and then obtain the first coded code block according to the size of the first coded code block.
  • the second code may be used. code block 0th to (N CB -1) N CB bits among coded bits as a first encoded code blocks.
  • the sending device 30 may also determine a check matrix of the LDCP code according to the size of the first coded code block. For example, an LDCP check matrix with a column number less than or equal to N CB may be determined, and the check matrix pair is used.
  • the code block is encoded to obtain a first coded code block.
  • channel coding and rate matching may also be coupled together, and the length n i of the coded bit segment to be transmitted and the length of the coded bit segment in the first coded code block are determined in rate matching.
  • the channel coding After the start position S i , the channel coding performs LDPC encoding on the code block according to the length n i of the coded bit segment and the start position S i of the coded bit segment in the first code block, and obtains the first code block, and then obtains To the coded bit segment to be sent.
  • the length of the coded bit segment to be transmitted is n i ⁇ N CB .
  • the base matrix can be selected to be expanded according to the expansion factor z.
  • the first code block is obtained by encoding the first code block from the 0th column to the Nth CB -1 column in the matrix to obtain the first coded code block.
  • the coded bit segment to be transmitted may acquire n i coded bits from the start position S i of the first coded code block, and if the N CB -1 bits have been reached, continue to return from the position of the 0th bit Obtained until the number of acquired bits is equal to the length n i of the encoded bit segment.
  • the first coded code block size N CB is 200
  • the coded bit segment length n i to be transmitted is 400
  • the start position S i is 100
  • the coded bit segment is the 100th to 199th coded bits
  • the 0th to The 199th coded bit and the coded bit segment composed of the 0th to 99th coded bits.
  • the examples herein are only examples and are not limited thereto.
  • the S i to S i +n i -1 coded bits in the first code block are according to a first base matrix check matrix S after spreading factor z deployment of S i + n i -1 columns of coded bits corresponding to the i-th column.
  • the selection base matrix may perform the first code block according to the check matrix formed by the S i column to the S i +n i -1 column in the check matrix after the expansion factor z is expanded.
  • the S i to the S i +n i -1 coded bits are the S i column to the S i +n i -1 in the check matrix of the base matrix expanded according to the spreading factor z
  • the coded bits corresponding to the column may be selected from the S i column to the S i +n i -1 column in the check matrix expanded by the expansion factor z.
  • the block is encoded to obtain n i coded bits.
  • N i bits which can also be called a parity check matrix of the S matrix according to the group to expand the expansion factor z i-th column to S i + n i -1 coded bits corresponding to the column.
  • the S i to N C B -1 coded bits in the first code block are aligned with the base matrix.
  • expansion of the S factor z check matrix expanded through the column i N CB -1 coded bits corresponding to the columns, a first coded code blocks 0 through n i - (N CB -1- S i) encoding bits are parity check matrix and the spreading factor group matrix according to the first deployment z 0 through n i - (N CB -1- S i) coded bits corresponding to columns.
  • the implementation can also refer to the foregoing embodiment.
  • the invalid encoding operation of the transmitting device 30 can be reduced.
  • FIG. 6 is a flowchart of a data transmission method according to an embodiment of the present invention.
  • the method is applicable to a communication system using an LDPC code, and the communication system includes a sending device 30 and a receiving device 31.
  • the method includes:
  • the receiving device 31 receives the encoded bit segment.
  • the coded bit segment received by the receiving device 31 is obtained by the transmitting device 30 from the first coded code block, and the first coded block is processed by the transmitting device 30 according to the processing capability of the receiving device 31. After getting it. Therefore, the encoded bit segment received by the receiving device 31 does not exceed its processing capability.
  • the receiving device 31 combines the soft value bits of the encoded bit segment received in step 601 in the soft information buffer of the receiving device 31;
  • the soft information buffer of the receiving device 31 is used to store a soft channel bit of the coded bit.
  • the coded bit sent by the transmitting device 30 is 1.
  • the receiving device 31 obtains its corresponding soft value bit of 1.45. If the position of the coded bit in the first coded code block is the 5th bit, the 5th soft value bit in the soft information buffer of the receiving device 31 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.
  • each soft value bit in the soft information buffer of the receiving device 31 is in one-to-one correspondence with the position of each coded bit of the first coded code block.
  • the receiving device 31 acquires the transmitted redundancy version RV j , and determines, according to the redundancy version RV j , the first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer, The receiving device 31 merges and stores the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, wherein the number of soft value bits is n i .
  • i is an integer greater than or equal to 0
  • i is 0 for initial transmission
  • i is greater than 0 for ith retransmission.
  • j is an integer, and 0 ⁇ j ⁇ j max , j max is the maximum number of redundancy versions between the transmitting device 30 and the receiving device 31, and the starting position corresponding to the j max redundancy versions
  • the soft information buffer is equally spaced, and the starting position of RV 0 is the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.
  • the receiving device 31 determines that the received bit soft values in a first starting position S soft information cache i, soft information from the first cache start position S i stores the received combined Soft value bits, the number of soft value bits is n i .
  • the receiving device 31 determines the starting position of the soft-valued bits of the received coded bit segment. Reference may also be made to the foregoing embodiment, and details are not described herein again.
  • the receiving device 31 may acquire n corresponding soft value bits. If the receiving device 31 receives the coded bits of the same location twice, the two soft values are combined, for example, the first soft value bit is 1.45, the second soft value bit is 0.5, and the combined value is 1.95. It should be noted that the examples are merely examples and are not limited thereto.
  • the receiving device 31 decodes the soft value bits in the soft information buffer to obtain the first code block.
  • the receiving device 31 needs to determine the decoding code rate of the soft value bits stored in the soft information buffer every time decoding, and determines according to the decoding code rate.
  • An LDPC check matrix here is a first check matrix, and the check matrix does not need to be identical to the check matrix used by the transmitting device 30 to encode the first code block, but when the soft value bits are small, the school The size of the matrix is also correspondingly small. Thereby, the complexity of decoding by the receiving device 31 can be reduced.
  • the receiving device 31 decodes the soft bit sample in the soft information buffer to decode the first check matrix to obtain the first code block. If the decoding is successful, the receiving device 31 will obtain the first code block and send an acknowledgement (ACK) to the sending device 30. After receiving the ACK, the transmitting device 30 may not retransmit the first coded block and continue processing the next. Code block. If the decoding is identified, the receiving device 31 will send a negative acknowledgement (NACK) to the transmitting device 30. After receiving the NACK, the transmitting device 30 will perform retransmission if the maximum number of retransmissions is not exceeded, in the first coded block. The selected coded bit segment is sent to the receiving device 31.
  • NACK negative acknowledgement
  • the transmitting device 30 determines the size of the coded block based on the processing capability of the receiving device 31 and selects the transmitted coded bit segment
  • the receiving device 31 can save the receiving device 31.
  • the storage overhead and the decoding complexity of the receiving device 31 are reduced.
  • Transmitting device 30 may include one or more transceivers 303, which may also be referred to as transceiving units, transceivers, or transceiver circuits, and the like.
  • the transceiver 303 is mainly used for transmitting and receiving radio frequency signals, for example, for transmitting the encoded bit segments described in the foregoing embodiments to the receiving device 31.
  • the encoder 301 is mainly used for encoding the information data
  • the rate matcher 302 is mainly used for selecting the transmitted coded bit segment, for example, for selecting the coded bit segment for the first coded code block described in the above embodiment.
  • the transmitting device 30 may also include other devices, such as means for generating a transport block CRC, a device for code block splitting and CRC check, an interleaver, a modulator, etc., which may be used to implement each of the transmitting devices 30 of FIG. 3, respectively. Some features.
  • rate matcher 302 can include a memory 3021 and a processor 3022.
  • the memory 3021 is used to store necessary instructions and data.
  • the memory 3021 stores the first coded code block in the above embodiment.
  • the processor 3022 is configured to perform necessary actions according to the instructions stored in the memory 3021, for example, to control the action of the transmitting device as shown in the portion of FIG. 4, and the control encoder 301 performs the first code block according to the processing capability of the receiving device 31.
  • LDPC encoding, control rate matcher 302 obtains the encoded bit segments from the first coded code block.
  • the transmitting device 30 may include one or more memories and processors for implementing various functions of the transmitting device as in FIG.
  • the memory and processor can be set individually for each device. It is also possible that multiple devices share the same memory and processor.
  • FIG. 8 is a schematic structural diagram of a receiving device, which can be applied to the communication system shown in FIG. System.
  • the receiving device 31 may include one or more transceivers 313, which may also be referred to as transceiver units, transceivers, or transceiver circuits, and the like.
  • the transceiver 313 is mainly used for transmitting and receiving radio frequency signals, for example, the receiving and transmitting device 30 transmits the encoded bit segments described in the foregoing embodiments.
  • the decoding code 311 is mainly used for decoding the received signal, for example, for decoding soft value bits in the soft information buffer, and the de-rate matching unit 312 is mainly used for combining soft value bits, for example, for implementing the above.
  • the soft-valued bits of the encoded bit segments described in the example are combined and stored in the soft information buffer.
  • the receiving device 31 may also include other devices, such as means for transport block CRC check, block merging, deinterleaver, demodulator, etc., respectively, for implementing portions of the receiving device 31 of FIG. Features.
  • the de-rate matcher 312 can include a memory 3112 and a processor 3122.
  • the memory 3121 is used to store necessary instructions and data.
  • the memory 3121 stores the soft value bits in the above embodiment.
  • the processor 3122 is configured to perform necessary actions according to the instructions stored in the memory 3121, for example, to control the action of the receiving device as shown in the portion of FIG. 6, control the de-rate matcher 312 to merge and save the soft-valued bits, and control the decoder 311.
  • the soft value bits are LDPC decoded.
  • the receiving device 31 may include one or more memories and processors for implementing various functions of the receiving device 31 in FIG.
  • the memory and processor can be set individually for each device. It is also possible that multiple devices share the same memory and processor.
  • 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, a software unit executed by a processor, or a combination of the two.
  • the software unit can be stored in 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 storage medium can be coupled to the processor such that the processor can read information from the storage medium and can write information to the storage medium.
  • the storage medium can also be integrated into the processor.
  • the processor and the storage medium may be disposed in an ASIC, and the ASIC may be disposed in the UE. Alternatively, the processor and the storage medium may also be located in different components in the UE.
  • 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.
  • the storage medium can be any available medium that the computer can access. quality.
  • 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.
  • the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave
  • the coaxial cable , fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwave are included in the fixing of the associated media.
  • 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

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

Abstract

Cette invention concerne un procédé de transmission de données, un dispositif émetteur, un dispositif récepteur et un système de communication. Le dispositif émetteur est utilisé pour envoyer un premier bloc de transmission, le dispositif émetteur acquérant un segment de bits codé à partir d'un premier bloc de code codé, le premier bloc de code codé étant obtenu par la réalisation, en fonction de la capacité de traitement d'un dispositif récepteur, d'un codage de contrôle de parité de faible densité sur un premier bloc de code dans le premier bloc de transmission ; et le dispositif émetteur envoie le segment de bits codé au dispositif récepteur. Du fait que la capacité de traitement du dispositif récepteur est prise en considération, le dépassement de stockage du dispositif émetteur ou du dispositif récepteur peut être réduit, et la complexité du codage ou du décodage est réduite, ce qui permet d'améliorer le taux de réussite du décodage.
PCT/CN2017/114637 2016-12-07 2017-12-05 Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication Ceased WO2018103638A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP17878570.5A EP3540947A4 (fr) 2016-12-07 2017-12-05 Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication
JP2019530482A JP6886515B2 (ja) 2016-12-07 2017-12-05 データ伝送方法、送信デバイス、受信デバイス、及び通信システム
US16/433,985 US10917114B2 (en) 2016-12-07 2019-06-06 Data transmission method, sending device, receiving device, and communications system

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201611117610 2016-12-07
CN201611117610.5 2016-12-07
CN201710042967.X 2017-01-20
CN201710042967.XA CN108173621B (zh) 2016-12-07 2017-01-20 数据传输的方法、发送设备、接收设备和通信系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/433,985 Continuation US10917114B2 (en) 2016-12-07 2019-06-06 Data transmission method, sending device, receiving device, and communications system

Publications (1)

Publication Number Publication Date
WO2018103638A1 true WO2018103638A1 (fr) 2018-06-14

Family

ID=62490707

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/114637 Ceased WO2018103638A1 (fr) 2016-12-07 2017-12-05 Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication

Country Status (1)

Country Link
WO (1) WO2018103638A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11043970B2 (en) 2017-02-06 2021-06-22 Lg Electronics Inc. Method for transmitting LDPC code using row-orthogonal and apparatus therefor
CN115642985A (zh) * 2022-09-06 2023-01-24 星骋(广州)科技应用有限公司 一种数据编码方法、通信装置以及计算机可读存储介质
CN117081607A (zh) * 2023-08-30 2023-11-17 白盒子(上海)微电子科技有限公司 一种nr ldpc部分校验矩阵编译码指示信息获取方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101183875A (zh) * 2007-12-07 2008-05-21 中兴通讯股份有限公司 一种Turbo码的有限长度循环缓存的速率匹配方法
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法
CN101325474A (zh) * 2007-06-12 2008-12-17 中兴通讯股份有限公司 Ldpc码的混合自动请求重传的信道编码及调制映射方法
WO2009094805A1 (fr) * 2008-01-25 2009-08-06 Panasonic Corporation Appareil de communication radio et procédé d'entrelacement
CN101682486A (zh) * 2007-06-20 2010-03-24 摩托罗拉公司 包括环形缓冲器的装置和用于向环形缓冲器分配冗余版本的方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101325474A (zh) * 2007-06-12 2008-12-17 中兴通讯股份有限公司 Ldpc码的混合自动请求重传的信道编码及调制映射方法
CN101682486A (zh) * 2007-06-20 2010-03-24 摩托罗拉公司 包括环形缓冲器的装置和用于向环形缓冲器分配冗余版本的方法
CN101183875A (zh) * 2007-12-07 2008-05-21 中兴通讯股份有限公司 一种Turbo码的有限长度循环缓存的速率匹配方法
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法
WO2009094805A1 (fr) * 2008-01-25 2009-08-06 Panasonic Corporation Appareil de communication radio et procédé d'entrelacement

Non-Patent Citations (1)

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

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11043970B2 (en) 2017-02-06 2021-06-22 Lg Electronics Inc. Method for transmitting LDPC code using row-orthogonal and apparatus therefor
US11777525B2 (en) 2017-02-06 2023-10-03 Lg Electronics Inc. Method for transmitting LDPC code using row-orthogonal and apparatus therefor
CN115642985A (zh) * 2022-09-06 2023-01-24 星骋(广州)科技应用有限公司 一种数据编码方法、通信装置以及计算机可读存储介质
CN115642985B (zh) * 2022-09-06 2024-12-03 星骋(广州)科技应用有限公司 一种数据编码方法、通信装置以及计算机可读存储介质
CN117081607A (zh) * 2023-08-30 2023-11-17 白盒子(上海)微电子科技有限公司 一种nr ldpc部分校验矩阵编译码指示信息获取方法
CN117081607B (zh) * 2023-08-30 2024-03-19 白盒子(上海)微电子科技有限公司 一种nr ldpc部分校验矩阵编译码指示信息获取方法

Similar Documents

Publication Publication Date Title
CN108173621B (zh) 数据传输的方法、发送设备、接收设备和通信系统
US11742987B2 (en) Method and apparatus for processing information, communications device, and communications system
US11277231B2 (en) Redundancy version design solution in communication systems
CN110535474B (zh) 信息处理的方法、通信装置
JP6915061B2 (ja) 情報処理方法、装置、通信デバイスおよび通信システム
JP7026689B2 (ja) 情報処理方法、デバイス、および通信システム
KR20200013794A (ko) 정보 처리 방법, 장치 및 통신 장치
US11463108B2 (en) Information processing method and communications apparatus
US20200106458A1 (en) Information processing method and communications apparatus
WO2018103638A1 (fr) Procédé de transmission de données, dispositif émetteur, dispositif récepteur, et système de communication
WO2018233334A1 (fr) Procédé et appareil de traitement d'informations, dispositif de communication et système de communication

Legal Events

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

Ref document number: 17878570

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019530482

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

Country of ref document: EP

Effective date: 20190613