WO2010118606A1 - 速率匹配方法和装置 - Google Patents
速率匹配方法和装置 Download PDFInfo
- Publication number
- WO2010118606A1 WO2010118606A1 PCT/CN2009/074969 CN2009074969W WO2010118606A1 WO 2010118606 A1 WO2010118606 A1 WO 2010118606A1 CN 2009074969 W CN2009074969 W CN 2009074969W WO 2010118606 A1 WO2010118606 A1 WO 2010118606A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- packet
- bit
- harq sub
- buffer
- bits
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 188
- 230000005540 biological transmission Effects 0.000 claims description 37
- 230000009897 systematic effect Effects 0.000 claims description 17
- 125000004122 cyclic group Chemical group 0.000 claims description 15
- 208000011580 syndromic disease Diseases 0.000 claims description 6
- 101100173937 Escherichia coli (strain K12) flmC gene Proteins 0.000 claims description 2
- 230000000694 effects Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 24
- 230000008569 process Effects 0.000 description 20
- 238000012545 processing Methods 0.000 description 19
- 238000004891 communication Methods 0.000 description 11
- 230000003044 adaptive effect Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 230000002708 enhancing effect Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000010187 selection method Methods 0.000 description 3
- 238000012937 correction Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 1
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
-
- 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/27—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 using interleaving techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- 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/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/0064—Concatenated codes
- H04L1/0066—Parallel concatenated codes
Definitions
- FIG. 1 is a structural block diagram of a digital communication system according to the related art.
- a digital communication system usually consists of a transmitting end, a channel, and a receiving end, wherein the transmitting end is usually Including the source, the source encoder, the channel coder and the modulator, the receiving end usually includes a demodulator, a channel decoder, a source decoder and a sink, and a channel exists between the transmitting end and the receiving end (or Storage medium), and there is a noise source in the channel.
- channel coding links (including channel coding, modulation, demodulation, etc.) are the most critical technologies in the entire digital communication physical layer, which determine the effectiveness and reliability of the underlying transmission of digital communication systems.
- the functions of the channel coding code, modulation and demodulation, etc. in the channel coding link will be described in detail below.
- Channel Coding is to combat a wide variety of noise and interference during transmission. In general, by artificially adding redundant information, the system can have the ability to automatically correct errors, thereby ensuring the reliability of digital transmission.
- Turbo code is one of the currently recognized optimal forward error correction codes. It is widely used as a channel coding solution for data service transmission in many standard protocols, and the decoding of Turbo codes increases with the number of decoding iterations. Error correction performance will be continuously improved.
- Currently commonly used Turbo codes include binary Turbo codes and dual binary tail-biting Turbo codes.
- Rate Matching processing is a very key technique after channel coding. Its purpose is to perform algorithm-controlled repetition or puncturing of channel-coded codeword bits to ensure data bit length after rate matching. The allocated physical channel resources match.
- the cyclic buffer rate matching algorithm is a relatively simple algorithm and the generated puncturing graph The performance is relatively good.
- This rate matching algorithm is used in most communication systems such as the 3GPP2 series standard, the IEEE802.16e standard, and the 3GPP Long-Term Evolution (LTE).
- LTE 3rd Generation Partnership Project Long-Term Evolution
- the codeword bits output by the Turbo coding are separated by bits to separate three data bitstreams: a systematic bit stream, a first parity bit stream, and The second parity bit stream.
- the three data bit streams described above are each rearranged by a block interleaver, which is commonly referred to as intra-block interleaving. Then, in the output buffer, the rearranged (ie, rearranged) system bitstream is placed at the start position, and then two rearranged check bitstreams are interleaved, which is commonly referred to as inter-block interleaving. Moreover, during the inter-block interleaving process, N data coded bits may be selected as the output of the cyclic buffer rate match according to the desired output code rate, and the cyclic buffer rate match is read from a specified start position in the output buffer. Data encoding bits, this process is called bit selection.
- the bits selected for transmission can be read from any location in the buffer.
- its next bit data is the first bit position data of the circular buffer. Therefore, loop-based rate matching (puncturing or duplication) can be achieved in a simple way.
- HARQ Hybrid Automatic Repeat Request
- the loop cache also has the advantage of flexibility and granularity.
- HARQ is an important link adaptation technology in digital communication systems.
- the function of the technology is: The receiving end decodes the HARQ data packet received by the receiving end, and if the decoding is correct, the ACK signal is fed back to the transmitting end, and the transmitting end is notified to send a new HARQ data packet; if the decoding fails, the NACK signal is fed back to At the sending end, the requesting sender resends the HARQ data packet.
- the receiving end performs Incremental Redundancy (IR) or Chase combining decoding on the data packets that are retransmitted multiple times to improve the probability of successful decoding, and achieve high reliability requirements for link transmission.
- IR Incremental Redundancy
- Chase decoding on the data packets that are retransmitted multiple times to improve the probability of successful decoding, and achieve high reliability requirements for link transmission.
- different locations can be specified in the circular buffer for each transmission.
- the starting position of the HARQ packet read.
- the definition of Redundancy Version (RV) determines the multiple starting positions of the HARQ packets read in the circular buffer.
- the value of the redundancy version determines that the HARQ packets are transmitted in the circular buffer.
- the specific starting point of the reading For example, in LTE, the redundancy version defines the starting point of the circular buffer for selecting a piece of codeword to generate the current HARQ packet. If the number of RVs is four, the redundancy version uses 0, 1, 2, and 3 to evenly mark four locations in the circular buffer from left to right. More specific description Reference may be made to the proposal and standard of LTE virtual loop buffer rate matching, which will not be described in detail herein.
- the HARQ subpacket identifier is currently used in the IEEE802.16e standard. It is essentially the same as the redundancy version RV and can be used to determine the subpacket data in the circular buffer. The specific location.
- the HARQ sub-packet indicator and the HARQ packet length together define the starting position and length of the HARQ sub-packet data in the circular buffer to select a codeword in the circular buffer to generate the current HARQ sub-package.
- the SPID ranges from ⁇ 00, 01, 10, 11 ⁇ .
- the SPID value of the first transmission must be 00.
- the SPID value of other retransmissions can be selected arbitrarily or in a certain order within the range of the above SPID. That is to say, when multiple transmissions are made, one SPID value may be reused, or one SPID value may not be used.
- multiple HARQ sub-packets may be generated based on data of the same mother code. When two or more HARQ sub-packets read bits at the same position in the mother code, an Overlapping phenomenon occurs. In order to improve system performance, this overlap should be avoided as much as possible, and more mother code data should be covered.
- FIG. 2 is a schematic diagram of a rate matching process in the case of encoding according to the related art in the IEEE 802.16e standard, 1/3 code rate, and Convolutional Turbo Code (CTC) encoding, as shown in FIG.
- the retransmission process involves inter-block interleaving for the S information bit, the P1 school-risk area, and the P2 school-risk area.
- four retransmissions are performed, that is, four sub-packets are transmitted.
- the word after the second retransmission, also transmits the third sub-package (F3&L3) and the fourth sub-package (F4&L4).
- the length of each HARQ sub-packet and the value of the modulation order are related to the value of the number of sub-channels of the HARQ sub-packet, and the number of sub-packets per sub-transport may be affected by various factors. The effect changes, so the modulation order of each transmission and the length of the HARQ sub-packet may change.
- 3 is a schematic diagram of a rate matching process according to the related art. As shown in FIG.
- FIG. 4 is a schematic diagram of coverage in the rate matching process according to the related art, as shown in FIG.
- the present invention has been made in view of the problem of high probability of occurrence of overlapping phenomena in rate matching processing. To this end, it is a primary object of the present invention to provide an improved rate matching scheme to solve the above problems.
- a rate matching method is provided.
- the rate matching method according to the present invention comprises: encoding and interleaving the information bit sequence to obtain a mother code code word of length N FB — Buffer ; selecting a bit from the mother code code word to generate a hybrid automatic request retransmission request of the current transmission HARQ sub-package.
- a rate matching device is provided.
- the rate matching apparatus includes: an encoder for encoding an information bit sequence packet to generate a codeword of length N FB — Buffer ; and an interleaver for interleaving the codeword generated by the encoder An interleaved mother code code word; a cyclic buffer for storing the interleaved mother code code word obtained by the interleaver; a rate matcher for selecting a bit from the mother code code word to generate a current transmission
- a rate matching device includes: an encoder for encoding an information bit sequence packet to generate a codeword of length N FB Buffer ; and a memory for storing the encoder encoded code a virtual loop buffer generated by the word and address generator; an address generator, configured to generate a corresponding address of each codeword bit of the currently transmitted HARQ sub-packet in the memory, and interleave the codeword stored in the memory to generate a length N FB — Buffer virtual loop buffer, using the data of the virtual loop buffer as the mother codeword, and consecutively selecting the address corresponding to the codeword bit segment used to generate the HARQ sub-packet from the mother codeword;
- the extractor for selecting an address of the address generator, selects a codeword from the memory to generate a currently transmitted HARQ sub-packet.
- FIG. 1 is a structural block diagram of a digital communication system according to the related art
- FIG. 2 is a rate matching in the case of IEEE 802.16e standard, 1/3 code rate, and CTC coding according to the related art.
- 3 is a schematic diagram of a rate matching process according to the related art
- FIG. 4 is a schematic diagram of coverage in a rate matching process according to the prior art
- FIG. 5 is a first embodiment of the method according to the present invention.
- FIG. 6 is a schematic diagram of a process of a rate matching method according to Embodiment 2 of the method of the present invention
- FIG. 7 is a flowchart of a process of a first rate matching device according to Embodiment 1 of the present invention;
- FIG. 8 is a flowchart of processing of a second rate matching apparatus according to Embodiment 2 of the present invention
- FIG. 9 is an overlapping ring diagram of a first rate matching method according to Embodiment 1 of the present invention
- Figure 11 is a block diagram showing the structure of a rate matching device according to a first embodiment of the present invention
- Figure 12 is a block diagram showing a specific structure of a rate matching device according to a first embodiment of the present invention
- FIG. 14 is a schematic diagram of an overlapping ring of a third rate matching method according to an embodiment of the method of the present invention
- FIG. 15 is a third rate of an embodiment of the method according to the present invention
- FIG. 16 is a schematic diagram of a ring of a fourth rate matching method according to an embodiment of the method of the present invention
- FIG. 17 is an overlapping ring of a fourth rate matching method according to an embodiment of the method of the present invention.
- the present invention provides a rate matching method, which reduces the overlap phenomenon by changing the bit selection method in the mother code word word, in consideration of the problem that the probability of occurrence of the overlap phenomenon in the rate matching process is high in the related art. happened. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.
- a rate matching method comprises: encoding and interleaving the information bit sequence to obtain a mother code code word of length N FB — Buffer , and selecting a bit from the mother code code word to generate a currently transmitted HARQ sub-packet, wherein the mother code code word includes a system Bit portion and check bit portion.
- the start bit of the mother code code word is taken as the next bit of the last bit of the mother code code word.
- the first method selecting the first L bits from the predetermined starting position of the length N FB — Buffer mother code code word to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the second method select the last L bits from the length N FB — Buffer mother codeword
- the third method selects L bits to form a HARQ sub-packet with the length N FB — the middle position of the Buffer mother code code word as the center position, wherein the center position should try to select approximately equal number of bits on both sides, where L is The predetermined length of the HARQ sub-packet.
- the fourth method selecting the L bits to form the HARQ sub-packet with the length of the last bit position of the N FB — Buffer mother code code word as the center position, wherein the center position should select approximately equal number of bits on both sides, where L is the predetermined length of the HARQ sub-packet.
- the fifth method selecting the first L bits from the mother codeword of length N FB — Buffer with the position of the first bit of the first parity bit stream as a starting position to form a HARQ sub-packet, where L is a HARQ sub-packet The predetermined length of the package.
- the sixth method the first bit position of the first check bit stream plus the position of L/2 bits is selected from the mother code codeword of length N FB — Buffer as the starting position, and the first L bits form the HARQ sub- Packet, where L is the predetermined length of the HARQ sub-packet.
- the seventh method selecting the first L bits from the middle position of the mother code code word as the starting position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the eighth method selecting L bits from the middle position of the mother code code word to the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the ninth method selecting L bits from the middle position between the last bit of the mother code code word and the first bit of the first parity bit stream to form a HARQ sub-packet, and L is a predetermined length of the HARQ sub-packet.
- the tenth method selecting L bits from the position of the last bit of the mother code code word information bit stream as the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the processing of encoding and interleaving the information packet to obtain the system bit portion and the school-risk bit portion may specifically include one of the following manners: Method 1: encoding the information packet to obtain the system bit portion and the school-risk before interleaving.
- intra-block interleaving is performed on the check bit portion before interleaving to obtain a check bit portion after inter-block interleaving;
- the check bit portion performs inter-block interleaving to obtain a check bit portion after inter-block interleaving, and the inter-block interleaved syndrome-bit portion is used as a school-risk bit portion in the mother code word.
- Manner 2 encoding the information packet to obtain a system bit portion before interleaving and a school-risk bit portion before interleaving; performing intra-block interleaving on the system bit portion before interleaving and the school-risk bit portion before interleaving to obtain a sum block
- the intra-interleaved system bit portion and the intra-block interleaved syndrome-bit portion, and the intra-block interleaved system bit portion is used as the systematic bit portion in the mother code word word;
- the inter-block interleaved parity bit portion Inter-block interleaving is performed to obtain a parity bit portion after inter-block interleaving, and the parity bit portion interleaved between the blocks is used as a parity bit portion in the mother code word word.
- the code rate of the coded encoder when the code rate of the coded encoder is 1/r, the number of parity bits before the interleaving is r-l.
- the manner of encoding the information bit sequence includes one of the following: a turbo code, a tail bit Turbo code, and a low density parity check code.
- N Buffer to ( N FB Buffer / 2 / L / 2 ) mod ( N FB Buffer ) bits, ie,
- N FB Buffer -L/2) mod(N FB — Buffer ) bit starts, reads L bits in sequence: ( N FB — Buffer -L/2 ) mod ( N FB — Bu f fer ) to ( N FB — Bu f fer +L/2 - 1 ) mod ( N FB — Bu f fer ) bit, ie,
- the first bit from the mother codeword (circular buffer) (the first bit of the first parity bit stream +M*func (( N FB — Buffer - the first bit of the first parity bitstream) I ( 2*M ) ) -L ) mod ( N FB — Buffer ) startss the bit and reads L bits in sequence: (The first bit of the first check bit stream +M*func( ( N FB — Buffer - first The first bit of the school-risk bitstream) / ( 2*M ) )-L ) mod( N FB — Buffer ) to (the first bit of the first parity bit stream +M*func( ( N FB — Buffer - first Check the first bit of the bit stream) I ( 2*M ) ) - 1 ) bits.
- M is the modulation mode of the current HARQ sub-packet.
- Func ( x ) means rounding up x, either rounding down or rounding round.
- first (first check bit stream first bit -L) mod (N FB — Buffer ) bit in the mother codeword (circular buffer) sequentially read L bits: The first bit of the first check bit stream - L ) mod ( N FB — Buffer ) to (the first bit of the first school-risk bit stream - 1 ) bit.
- the start bit of the mother code code word is used as the next bit of the last bit of the mother code code word in the process of selecting the bit to form the HARQ sub-packet from the mother code code word, it is required in the method of the embodiment. Perform modulo (mod) operations.
- mod modulo
- the entire mother code data can be covered to the greatest extent, and the overlapping phenomenon in the related technology is avoided to the greatest extent, and the HARQ multiple retransmission chain is enhanced. Road performance.
- a method for rate matching includes: encoding and interleaving an information bit sequence to obtain a mother codeword having a length of N FB — Buffer , wherein the mother codeword includes a systematic bit portion and a school-bit portion .
- the ⁇ _"& HARQ sub-packet retransmission SPID ranges from 0, 1, 2, 3.
- the first method From the length N FB — Buffer mother
- the predetermined starting position of the codeword begins with the L bits before the selection to form a HARQ sub-packet, where L is the predetermined length of the HARQ sub-packet.
- the second method select the last L from the length of the N FB - Buffer mother codeword
- the bits constitute a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the third method selecting L bits to form a HARQ sub-packet with a length of N FB — the intermediate position of the Buffer mother code code word as a center position, wherein The two sides of the center position should try to select the same number of bits, where L is the predetermined length of the HARQ sub-packet.
- the fourth method select L as the center position with the length of the last bit position of the N FB - Buffer mother codeword
- the bits constitute a HARQ sub-package, wherein the center position should try to select an equal number of bits, where L is the predetermined length of the HARQ sub-packet.
- the fifth method from the mother codeword of length N FB — Buffer First stream with the first parity bit Bit position before the starting position of the L selected subpacket HARQ bits, where, L is the predetermined length of the HARQ subpacket.
- the sixth method the first bit position of the first check bit stream plus the position of L/2 bits is selected from the mother code codeword of length N FB — Buffer as the starting position, and the first L bits form the HARQ sub- Packet, where L is the predetermined length of the HARQ sub-packet.
- the seventh method selecting the first L bits from the middle position of the mother code code word as the starting position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the eighth method selecting L bits from the middle position of the mother code code word to the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the ninth method selecting L bits from the middle position between the last bit of the mother code code word and the first bit of the first parity bit stream to form a HARQ sub-packet, and L is a predetermined length of the HARQ sub-packet.
- the tenth method selecting L bits from the position of the last bit of the mother code code word information bit stream as the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- any of the above ten methods for determining the HARQ sub-packet start position may be used according to the specific conditions of the current HARQ sub-packet. It should be noted that, in the first embodiment, four rate matching modes are respectively exemplified, and the first rate matching mode is: when the SPID is 0, 1, 2, and 3, the first type, the second type, and the third type are respectively selected.
- FIG. 7 is a flowchart of processing of a first rate matching apparatus according to Embodiment 1 of the present invention, as shown in FIG. As shown in FIG.
- the processing flow using the first rate matching method under the first rate matching device includes the following steps: step 4 to step 111: 114: Step 111,
- the information of length K is sent to a 1/3 code rate turbo code encoder to generate a systematic bit stream S, a first school-risk bit stream P1 and a second school-risk bit stream P2.
- Step 4 is gathered 112, and the code words programmed by the Turbo encoder, that is, the system bit stream S, the first calibration-risk bit stream P1, and the second parity bit stream P2 are respectively inter-block interleaved by a sub-interleaver, and generated.
- Step 113 Place the system bit in front of the circular buffer, and the bit stream of the first parity and the bit stream of the second parity are interleaved by the inter-block interleaver behind the system bit stream to form a circular buffer.
- the data accessed therein is the above-mentioned mother code, and the length of the mother code is N FB — Buffer codeword bits.
- the mother codeword since the mother codeword is placed in the circular buffer, the next bit of the last bit in the mother codeword is the first bit position of the mother code, and the index of the mother code starts from zero.
- Step 114 Read codeword bits of a length required for each HARQ transmission from the mother code to form a HARQ sub-packet.
- the reading position of each HARQ sub-packet is determined by the following process: First, each time the HARQ sub-packet transmission is performed, the length of the HARQ sub-packet is determined first. Secondly, the data content of the HARQ sub-packets that need to be transmitted each time is cyclically read in the mother code.
- the first rate matching method HARQ sub-packet data reading method is as follows: The first time the HARQ sub-packet is transmitted, the SPID ear is 0 again, that is, starting from the 0th bit in the circular buffer area, the L1 bits are sequentially read, that is, from The 0th, 1st, and 2th bits are up to the L1-1th bit, where L1 is the first sub-packet length.
- the SPID is taken as 1, starting from the Nth FB _Buffer-L2 bit in the circular buffer, and sequentially reading L2 bits, that is, from the Nth FB — Buffer -L2, N FB — Buffer - L2+1, N FB — Buffer -L2+2 bits up to the Nth FB — Buffer -1 bit, where L2 is the second sub-packet length.
- the SPID takes 2 when the HARQ sub-packet is transmitted for the third time, that is, the number from the loop buffer
- (NFB-Buffer/2-L3/2) mod (NFB_Buffer) bit starts, reads L3 bits sequentially, that is, from the (N FB Bu f fer / 2-L3/2) mod (N FB — Bu f Fer ) , ((N FB — Bu f fer /2-L3/2) mod(N FB — Bu f fer ))+1 , ((NFB_Buffer/2-L3/2) mod(N F B_Buffer)) +2 bits up to the (N FB — Buffer /2+L3/2 - l) mod(N FB — Buffer ) bit, where L3 is The third sub-package length.
- the SPID takes 3 when transmitting the HARQ sub-packet for the fourth time, that is, starting from the (N FB Buffer -L4/2) mod(N FB — Buffer ) bit in the circular buffer, sequentially reading L4 bits, that is, from the first ( N F B_Buffer-L4/2) mod(N F B_Buffer) , ((N FB — Bu f fer -L4/2) mod(N FB — Bu f fer )) + 1 , ((N Buffer- L4/2) Mod(N F B_Buffer))+2 up to the (( N F B_Buffer+L4/2 - l) mod(N FB — BUFFER )) bit, where L4 is the fourth sub-packet length.
- the first rate matching mode of the embodiment of the present invention is processed as follows: After the stream ⁇ a0,al,..., a4799 ⁇ is sent to the CTC encoder, the information bit stream S ⁇ a0,al,..., a4799 ⁇ is formed, and the calibration PI ⁇ , ⁇ ⁇ ,..., p 4799 ⁇ , ⁇ ⁇ P2 ⁇ 2 0, ⁇ 2 1,..., p 2 4799 ⁇ .
- a new system bit stream S ⁇ a0,,al,..., a4799, ⁇ , the school-risk bit stream is formed.
- the mother code word word is formed and stored in the circular buffer area, that is, ⁇ m0, ml,. .., ml4399 ); That is, the NFB Buffer is 14400.
- the Lk required for each HARQ transmission is read sequentially from the circular buffer (k is taken as 1).
- FIG. 9 is an overlapping ring diagram of the first rate matching method according to the first embodiment of the present invention. As shown in FIG.
- the read HARQ sub-packets are: The first HARQ sub-packet is ⁇ m0, ml, ..., m5759 ⁇ ; The second HARQ sub-package is ⁇ m6912, m6913,..., ml4399 ⁇ ; the third HARQ sub-package is ⁇ m2592, m2593,..., ml l807 Fourth HARQ sub-package Visible for ⁇ ml0752, ml0753,..., ml4399,m0,ml,..., m3647 ⁇ , in the first rate matching mode, after the second HARQ sub-packet transmission, despite The mother codeword ⁇ m5760, m5761,..., m6911 ⁇ A total of 1152 t ⁇ is not covered by il, but there is no overlap.
- the rate matching method in the embodiment of the present invention can better cover the mother code codeword bits under the same conditions, and minimize the occurrence of overlapping phenomena, thereby enhancing the link performance of the HARQ.
- the first, second, fifth, and sixth methods for determining the start position of the sub-packet are respectively selected.
- a rate matching method processing flow in the embodiment of the present invention is also shown in FIG. 7, and will not be described here.
- the second rate matching method differs only in that, in the following embodiments, when the SPID is 0, 1, 2, 3, the first, second, fifth, and sixth determining sub-packets are respectively selected.
- Location method The HARQ sub-packet data reading method is as follows: When the HARQ sub-packet is transmitted for the first time, the SPID takes 0, that is, from the 0th bit in the circular buffer area, the L1 bit is sequentially read, that is, from the 0th, 1st, and 2nd bits. Up to the L1-1 bit, where L1 is the first sub-packet length. The SPID is taken 1 when the HARQ sub-packet is transmitted for the second time, that is, the number from the loop buffer
- the N FB _Buffer-L2 bit starts, and the L2 bit is read sequentially, that is, from the Nth FB — Buffer -L2, N FB — Buffer -L2+1, N FB Buffer -L2+2 bits up to the N FB — Buffer - 1 bit, where L2 is the second sub-packet length.
- the SPID is taken as 2, that is, from the first bit of the first school-risk bit stream in the loop buffer, L3 bits are sequentially read, from the first of the first school-risk bit stream.
- Bit the second bit of the first parity bitstream, the third bit of the first parity bitstream, up to the first of the first parity bitstream (first bit of the first checkstream + L3-l) mod (N FB — Buffer ) bits, where L3 is the third sub-packet length.
- the SPID is 3 when transmitting the HARQ sub-packet for the fourth time, that is, starting from the first bit of the first school-risk bit stream in the loop buffer + N FB — Buffer /2, sequentially reading L4 bits, that is, from the first The first bit of a parity bit stream +N FB Buffer /2, (first bit of the first school-risk bitstream +N FB Buffer /2) + 1, (first bit of the first parity bit stream +N FB — Buffer /2)+2 — until (the first bit of the first check stream
- FIG. 10 is a schematic diagram of an overlapping ring diagram of a second rate matching method according to the first embodiment of the present invention. As shown in FIG.
- the read HARQ sub-packets are: the first HARQ sub-packet is ⁇ m0, ml, ..., M5759 ⁇ ;
- the second HARQ sub-package is ⁇ m6912, m6913,..., ml4399 ⁇ ;
- the third HARQ sub-package is ⁇ m4800, m4801,..., ml4015;
- the fourth HARQ sub-package is ⁇ ml2000, Ml2001,..., ml4399,m0,ml,..., m4895 ⁇ can be seen, in the second rate matching mode, after the second HARQ sub-packet transmission, despite the mother codeword ⁇ m5760, m5761,.
- the second rate matching method in this embodiment can better cover the mother code codeword bits under the same conditions, and minimize the occurrence of overlapping phenomenon, thereby enhancing the linkability of HARQ.
- the first, second, seventh, and eighth methods for determining the start position of the sub-packet are respectively selected.
- a rate matching method processing flow in the embodiment of the present invention is also shown in FIG.
- the third rate matching method differs only in that, in the following embodiments, when the SPID is 0, 1, 2, 3, the first, second, seventh, and eighth determining sub-packets are respectively selected.
- Location method The HARQ sub-packet data reading method is as follows: When the HARQ sub-packet is transmitted for the first time, the SPID ear is 0 again, that is, starting from the 0th bit in the circular buffer area, the L1 bit is sequentially read, that is, from the 0th, 1st, and 2th bits. To the L1-1 bit, where L1 is the first sub-packet length. The SPID is taken 1 when the HARQ sub-packet is transmitted for the second time, that is, from the loop buffer
- N FB _Buffer-L2 bit starts, reads L2 bits sequentially, that is, from Nth FB — Buffer -L2, N FB — Buffer -L2+1, N FB _Buffer-L2+2 bits up to N FB — Buffer - 1 bit, where L2 is the second sub-packet length.
- the SPID is taken as 2, that is, starting from the (N FB — Buffer /2 ) mod ( N FB — Buffer ) bit in the circular buffer, L bits are sequentially read: ( N F B_Buffer/2 ) mod ( N FB — Buffer ) to (N FB — Buffer /2+L -l ) mod ( N FB — Buffer ) bits, where L3 is the third sub-packet length.
- FIG. 14 is an overlapping ring diagram of a third rate matching method according to the first embodiment of the present invention. As shown in FIG.
- the read HARQ sub-packets are: the first HARQ sub-packet is ⁇ m0, ml, ..., m5759 ⁇ ;
- the second HARQ sub-package is ⁇ m6912, m6913,..., ml4399 ⁇ ;
- the third HARQ sub-package is ⁇ m7200, m7201,..., ml2015;
- the fourth HARQ sub-package For the ⁇ ml4304, ml4305,..., ml4399, m0,ml,..., ⁇ 7199 ⁇ , the third rate matching method of this embodiment can better cover the mother code codeword bits under the same conditions, and Minimize the occurrence of overlap and enhance the link performance of HARQ.
- the first, second, ninth, and tenth determining sub-packet start position methods are respectively selected.
- a rate matching method processing flow in the embodiment of the present invention is also shown in FIG. 7, and will not be described here.
- the fourth rate matching method differs only in that, in the following embodiments, when the SPID is 0, 1, 2, 3, the first, second, ninth, and tenth determining sub-packets are respectively selected. Location method.
- the HARQ sub-packet data reading method is as follows: When the HARQ sub-packet is transmitted for the first time, the SPID takes 0, that is, from the 0th bit in the circular buffer area, the L1 bit is sequentially read, that is, from the 0th, 1st, and 2nd bits. Up to the L1-1 bit, where L1 is the first sub-packet length.
- the SPID is taken as 1, that is, from the Nth FB _Buffer-L2 bit in the circular buffer
- the L2 bit is read sequentially, that is, from the Nth FB — Buffer -L2, N FB — Buffer -L2+ 1, N FB — Buffer -L2+2 bits up to the Nth FB — Buffer -1 bit, where L2 is the second sub-packet length.
- the SPID is taken as 2, from the first in the loop buffer (the first bit of the first check bit stream + M*func (( N FB — Buffer - the first bit of the first school-risk bit stream) ) I ( 2*M ) ) -L3 ) mod ( N FB — Buffer )
- the bit starts, and L3 bits are read sequentially, that is, from the first ((the first school-risk bitstream first bit +M*func( N FB — Buffer - first school - risk bit stream first bit) / ( 2 * M ) ) -L3 ) mod ( N FB — Buffer ) ), ((first school - risk bit stream first bit + M * fUnc ( ( N FB — Buffer - first bit of the first school-risk bitstream) I ( 2*M ) ) -L3 ) mod ( N FB — Buffer ) +1 ), ((first check bit stream
- the SPID is taken as 3, starting from the first (first check bit stream first bit - L4) mod (N FB — Buffer ) bit in the circular buffer area, and sequentially reading L4 bits, that is, From ((first check bit stream first bit - L4) mod ( N FB — Buffer ) ), ( (first check bit stream first bit - L4 ) mod ( N FB — Buffer ) +1 ) ((first check bit stream first bit - L4) mod ( NFB Buffer ) +2 ) to (first check bit stream first bit -1 ) bit.
- the read HARQ sub-packets are: the first HARQ sub-packet is ⁇ m0, ml, ..., m5759 ⁇ ;
- the second HARQ sub-package is ⁇ m6912, m6913,..., ml4399 ⁇ ;
- the third HARQ sub-package is ⁇ ml2384, ml2385,..., m9599 ⁇ ;
- the fourth HARQ sub- The packet is ⁇ mll904, mll905, ..., ml4399, m0, ml, ..., ⁇ 4799 ⁇ .
- the fourth rate matching method of this embodiment can better cover the mother code code word bit under the same conditions. And to minimize the occurrence of overlapping phenomena, thereby enhancing the link performance of HARQ.
- the processing of the four rate matching methods in the second rate matching device in the embodiment of the present invention is described in detail with reference to the 1/3 code rate (but not limited to 1/3 code rate).
- the two rate matching methods see Embodiment 1, and details are not described herein again. Only the second rate matching device will be described in detail below.
- FIG. 8 is a flowchart of processing of a second rate matching apparatus according to Embodiment 2 of the present invention. As shown in FIG. 8, in the case of 1/3 code rate, the first rate is performed under the second rate matching apparatus.
- the matching method processing flow includes the following step 4: 121 to 4: 125: Step 4: 121, and the information of length K is sent to the 1/3 code rate Turbo code encoder, and the system bit stream S is generated. School-risk bit stream P1 and second school-risk bit stream P2.
- Step 4 123, for the codeword in the memory, the system bit stream S, the first calibration-risk bitstream PI and the second parity bitstream P2 are respectively inter-block interleaved by the address generator to generate a new system bitstream S
- the first parity bit stream PI and the second parity bit stream P2 form a virtual circular buffer.
- a virtual circular buffer is finally formed, wherein the stored data is a virtual mother code, and the mother code length is N FB — Buffer codeword bits.
- the virtual mother code code word is placed in the virtual loop buffer, and the next bit of the last bit in the mother code code word is the 0th bit of the mother code, and the index of the mother code starts from 0.
- Step 125 Select, by the codeword bit reader, the codeword bits from the memory according to the address generator generation address, for generating the currently transmitted HARQ sub-packet. That is, the codeword bits of the length required for each HARQ transmission are sequentially read in the virtual mother code to form one HARQ sub-packet.
- the reading position of each HARQ sub-packet can be determined by the following processing procedure: First, each time the HARQ sub-packet transmission is performed, the length of the HARQ sub-packet is first determined. Secondly, the data content of the HARQ sub-packets that need to be transmitted each time is cyclically read in the virtual mother code. The method for reading the HARQ sub-packet data under the first rate matching method is described in the first embodiment, and is not mentioned here.
- the first rate matching method in the embodiment of the present invention is processed as follows: After ⁇ a0,al,..., a4799 ⁇ is sent to the CTC encoder, the information bit stream S is formed.
- the information bit stream S, the school-risk bit stream PI and the school-risk bit stream P2 are sub-interleaved in the block generator to form a new systematic bit stream S ⁇ a0, , al, , ..., a4799, ⁇ , school-risk bit stream PI ⁇ ⁇ ' , pi l' ⁇ ⁇ 4799' ⁇ , ⁇ 2 ⁇ 2 0' , ⁇ 2 ⁇ ⁇ 2 4799' ⁇ ; new systematic bit stream S, new school-risk bit stream P1
- the new school-risk bit stream P2 is inter-block interleaved in the address generator to form a virtual mother code code word, and is stored in the virtual loop buffer area, that is, ⁇ m0, ml, ...,
- the first HARQ sub-packet is ⁇ m0, ml,..., m5759 ⁇ ; the second HARQ sub- The package is ⁇ m6912, m6913,..., ml4399 ⁇ ; the third HARQ sub-package is ⁇ m2592, m2593,..., ml l807 ⁇ ; the fourth HARQ sub-package is ⁇ ml0752, ml0753,..., Ml4399, m0, ml, ..., m3647 L
- the second rate matching device in the embodiment of the present invention is also applicable to the second, third, and fourth rate matching modes, and the difference is only when the HARQ sub-packet data is read.
- Packet start position method when SPID is 0, 1, 2, 3, respectively select the first, second, seventh, and eighth methods for determining the starting position of the sub-package; Rate matching method: When the SPID is 0, 1, 2, 3, the first, second, ninth, and tenth determining sub-packet starting position methods are respectively selected.
- Rate matching method When the SPID is 0, 1, 2, 3, the first, second, ninth, and tenth determining sub-packet starting position methods are respectively selected.
- the SPID takes 0, 1, 2, 3, the above ten kinds of determined HARQs may be selected according to the current HARQ sub-packet. Any of the sub-package start position methods.
- Embodiment 1 of the present invention provides a rate matching apparatus according to an embodiment of the present invention.
- FIG. 11 is a structural block diagram of a rate matching apparatus according to Embodiment 1 of the apparatus according to the present invention. As shown in FIG. 11, the rate matching apparatus includes: The processor 12, the interleaver 14, the cyclic buffer 16, and the rate matcher 18 are described below.
- the encoder 12 is configured to encode the information packet to generate a codeword of length N FB — Buffer ; the interleaver 14 is coupled to the encoder 12 for interleaving the codeword sequence of the length N FB — Buffer and Obtaining the interleaved mother code codeword; the circular buffer 16 is connected to the interleaver 14 for storing The interleaved mother code code word sequence; the rate matcher 18 is coupled to the cyclic buffer 16 for selecting a code word bit from the mother code code word to generate a currently transmitted HARQ sub-packet, assuming that the SPID has a value range of 0, 1 , twenty three.
- the rate matcher 18 is configured to select a bit from the mother codeword to generate a currently transmitted HARQ sub-packet.
- the rate matcher 18 includes: a first rate matcher 182: for a slave length N FB — a Buffer mother code
- the predetermined starting position of the codeword constitutes a HARQ sub-packet from the first L bits, wherein L is a predetermined length of the HARQ sub-packet; and a second rate matcher 184 is used for the slave length N FB — Buffer mother code code word Selecting the last L bits to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet; and a third rate matcher 186: for selecting L positions centered on the intermediate position of the length N FB — Buffer mother code code word
- the bits constitute a HARQ sub-package, wherein the center position should try to select an equal number of bits, where L is a predetermined length of the
- the fifth rate matcher 190 is configured to select a first L bits from the mother code code word with a position of a first bit of the first check bit stream as a starting position to form a HARQ sub-packet, where L is a HARQ sub-packet a predetermined length; a sixth rate matcher 192: for selecting the first L bits from the mother codeword word by adding the first bit position of the first check bit stream to the position of the L/2 bit as the starting position A HARQ sub-packet is formed, where L is a predetermined length of the HARQ sub-packet.
- a seventh rate matcher 194 configured to select a first L bits from a middle position of the mother code codeword as a starting position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet; and an eighth rate matcher 196: Selecting L bits from the middle position of the mother code code word as the end position constitutes a HARQ sub-packet, and L is a predetermined length of the HARQ sub-packet.
- the ninth rate matcher 198 is configured to select an LQ bit from the intermediate position between the last bit of the mother code codeword and the first bit of the first school-risk bitstream to form a HARQ sub-packet, where L is HARQ.
- FIG. 12 is a block diagram showing a specific structure of a rate matching apparatus according to Embodiment 1 of the apparatus of the present invention.
- the interleaver 14 includes: an intra block interleaver 22 and an inter block interleaver 24. The following structure is described. .
- the intra-block interleaver 22 is configured to perform inter-block interleaving on the encoded information packet to obtain an inter-block interleaved bit-in-bit bit portion, or further obtain an inter-block interleaved system bit portion; the inter-block interleaver 24 is connected to An intra-block interleaver 22, configured to perform inter-block inter-blocking check bit portions in the block Interleaving, the check bit portion after inter-block interleaving is obtained.
- the above cyclic memory 16 is configured to store the intra-block interleaved systematic bit portion or the uninterleaved systematic bit portion as a systematic bit portion of the mother code code word at the start position of the cyclic memory 16; the circular memory 16 is also used to block the block The interleaved check bit portion is stored at a position after the systematic bit portion in the loop memory 16.
- the first rate matcher 182, the first rate matcher 184, the second rate matcher 184, the third rate matcher 186, the fourth rate matcher 188, and the fifth rate match are used according to the current HARQ sub-package condition.
- L bits are sequentially read starting from the (N FB — Buffer /2- L/2 ) mod ( N FB — Buffer ) bit in the mother codeword (loop buffer). which is,
- L bits are sequentially read starting from the (N FB Buffer -L/2) mod(N FB — Buffer ) bit in the mother codeword (loop buffer).
- N F B_Buffer-L/2) mod(N F B_Buffer
- N FB — Bu ff er -L/2) mod(N FB — Bu ff er )
- N F B_Buffer-L/ 2) mod(N F B_Buffer)
- N F B_Buffer+L/2 - l mod(N FB — Bu ff er ) bits.
- the fifth rate matcher 190 starting from the first bit of the first school-risk bitstream in the mother codeword (circular buffer), sequentially reading L bits: the first bit of the first check bitstream to (the first bit) a check stream first bit + L-1 ) mod ( N FB — Buffer ) bit, that is, the first bit of the first check bit stream, the second bit of the first check bit stream, the first check bit stream.
- For the sixth rate matcher 192 starting from the first bit of the first parity bit stream in the mother codeword (circular buffer) + N FB — Buffer /2, sequentially reading L bits: First school-risk The first bit of the bit stream +N FB — Buffer /2 to (the first bit of the first check stream +N FB — Buffer /2 +L-1 ) mod ( N FB — Buffer ) bit; that is, the first check bit The first bit of the stream + N FB — Buffer /2, (the first bit of the first parity bit stream + N F B_Buffer/2) + l , (the first bit of the first parity bit stream + N FB — Buffer /2) +2,... ⁇ ., (first check stream The first bit + N FB — Buffer /2+Ll) mod (N FB — Buffer ) bits.
- L bits are sequentially read starting from the (N FB — Buffer /2 ) mod ( N FB — Buffer ) bit in the mother code word (circular buffer): ( N F B_Buffer /2 ) mod ( N FB — Buffer ) to (N FB Buffer/2+L -l ) mod ( N FB Buffer ) bits.
- the eighth rate matcher 196 the first from the mother codeword (circular buffer)
- N F B_Buffer/2-L mod ( N FB — Buffer ) bit starts, reads L bits in sequence: ( N FB — Buffer /2-L ) mod ( N FB — Bu f fer ) to ( N FB — Bu f fer /2- 1 ) mod ( N FB — Buffer ) bit.
- the first bit from the mother codeword word (circular buffer) (the first school-risk bitstream first bit + M*func (( N FB — Buffer - first school-risk bitstream) The first bit) / ( 2*M ) ) -L ) mod ( N FB — Buffer ) Starts the bit and reads L bits in sequence: (first school - risk bit stream first bit + M * fUnc ( ( N FB — Buffer - first school - the first bit of the risk bitstream) I ( 2*M ) ) -L ) mod
- NFB Buffer to (the first bit of the first parity bit stream + M * flmC ( ( NFB Buffer - first bit of the first parity bit stream) I ( 2 * M ) ) - 1 ) bits.
- M is the modulation mode of the current HARQ sub-packet.
- Flmc ( x ) means rounding up X, either rounding down or rounding round.
- L bits are sequentially read starting from the first (first check bit stream first bit -L) mod (N FB — Buffer ) bit in the mother codeword (circular buffer) : (first check bit stream first bit - L ) mod ( N FB — Buffer ) to (first check bit stream first bit -1 ) bit. Since the start bit of the mother code code word is used as the next bit of the last bit of the mother code code word in the process of selecting the bit to form the HARQ sub-packet from the mother code code word, the modulo is required in the method ( Mod) operation.
- the device in this embodiment is applicable to the first, second, third, and fourth rate matching modes mentioned in the present invention, and the only difference is the first rate matching mode: SPID is 0, 1, 2. 3: Select the first rate matcher, the second rate matcher, the third rate matcher, and the fourth rate matcher respectively;
- the second rate matching mode select the first rate when the SPID is 0, 1, 2, 3 Matcher, second rate matcher, fifth rate matcher, sixth rate matcher;
- third rate matching mode when the SPID is 0, 1, 2, 3, respectively select the first rate matcher, the second rate match , the seventh rate matcher, the eighth rate matcher;
- the fourth rate matching mode when the SPID is 0, 1, 2, 3, respectively select the first rate matcher, the second rate matcher, the ninth rate matcher
- the tenth rate matcher is not repeated here.
- FIG. 13 is a structural block diagram of a rate matching apparatus according to Embodiment 2 of the apparatus according to the present invention. As shown in FIG. 13, the apparatus includes an encoder 32. The memory 34, the address generator 36, and the code word bit reader 38 are described below.
- the encoder 32 is configured to encode the information packet to generate a codeword of length N FB — Buffer ; the memory 34 is coupled to the encoder 32 for storing the encoded codeword; the address generator 36 is coupled to the memory for generating the current Each codeword bit of the HARQ sub-packet is in a corresponding address in the memory, and is used for interleaving the codeword stored in the memory, and generating a virtual circular buffer of length N FB — Buffer , which is stored in the memory, and the data cached by the virtual loop As the mother codeword, and consecutively selecting the address corresponding to the codeword bit segment of the sub-packet for generating the current HARQ from the mother codeword, it is assumed that the SPID has a value range of 0, 1, 2, 3.
- the address generator 36 includes: a first address generator 362: configured to select a front L bit address to form a HARQ sub-packet from a predetermined starting position of a length N FB — Buffer mother code code word, where L is a HARQ sub-packet a predetermined length of the packet; a second address generator 364: configured to select a last L bit address from a length N FB — Buffer mother code code word to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet;
- the address generator 366 is configured to select a front L bit address from a mother code codeword of length N FB — Buffer with a first bit position of the first check bit stream as a starting position to form a HARQ sub-packet, where L is The predetermined length of the HARQ sub-packet; the fourth address generator
- a HARQ sub-packet is formed, where L is a predetermined length of the HARQ sub-packet; a codeword bit reader 38 is coupled to the address generator 36 and the memory 34. The codeword bits are selected from the memory 34 based on the address selected by the address generator 36 to produce the currently transmitted HARQ sub-packet.
- the fifth address generator 370 is configured to select a front L bit address from the mother code code word with a position of a first bit of the first check bit stream as a starting position to form a HARQ sub-packet, where L is a HARQ sub-packet a predetermined length of the packet; a sixth address generator 372: used to select the position of the first bit position of the first school-risk bitstream plus L/2 bits from the mother codeword as the starting position.
- the bit addresses constitute a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the seventh address generator 374 is configured to select a front L bit address from the middle position of the mother code code word as a starting position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet; and an eighth address generator 376: And selecting L bit addresses from the intermediate position of the mother code codeword as the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the ninth address generator 378 is configured to select an LQ bit packet from the intermediate position between the last bit of the mother code codeword and the first bit of the first school-risk bitstream to form a HARQ sub-packet, where L is The predetermined length of the HARQ sub-packet.
- the tenth address generator 380 is configured to select an LQ bit packet from the position of the last bit of the mother code codeword information bit stream to the end position to form a HARQ sub-packet, where L is a predetermined length of the HARQ sub-packet.
- the SPID is 0, 1, 2, 3, that is, the first HARQ sub-packet retransmission, the second HARQ sub-packet retransmission, the third HARQ sub-packet retransmission, and the fourth HARQ sub-packet retransmission.
- the first address generator 362, the second address generator 364, the third address generator 366, the fourth address generator 368, the fifth address generator 370, and the sixth address are generated.
- the third address generator 366 starting from the first bit of the first school-risk bitstream in the virtual loop buffer, sequentially reading L bits, the first bit of the first parity bit stream, the first parity bit stream 2 bits, the third bit of the first school-risk bitstream, whereas, (first bit of the first check stream + Ll) mod (N FB — Buffer ) bits.
- the fourth address generator 368 starting from the first bit of the first parity bit stream in the mother codeword (virtual loop buffer) + N FB — Buffer /2, sequentially reading L bits, ie, first The first bit of the school-risk bitstream +N FB Buffer /2, (the first bit of the first parity bit stream +N FB Buffer /2)+ l , (the first bit of the first school-risk bitstream +N FB — Buffer /2)+2,... ⁇ , (first bit of the first check stream + N FB — Buffer /2 + Ll) mod (N FB — Buffer ) bit.
- the fifth address generator 370 starting from the first bit of the first school-risk bitstream in the mother codeword (virtual loop buffer), sequentially reading L bits: the first school-risk bitstream first bit to (first bit of the first check stream + L - 1 ) mod ( N FB — Buffer ) bit, that is, the first bit of the first check bit stream, the second bit of the first check bit stream, the first check The third bit of the bitstream, Vietnamese, (first school - the first bit of the risk stream + L - l) mod (N FB Buffer ) bits.
- NFB Buffer bit; that is, the first bit of the first parity bit stream + N FB Buffer /2 , (the first bit of the first parity bit stream + N FB — Buffer /2) + 1 , (first school - insurance first bit of the bit stream + N FB - Buffer /2)+2,-...., (first bit of the first check bit stream + N FB - Buffer / 2 + Ll) mod (N FB - Buffer) bits.
- the seventh address generator 374 the first from the mother codeword (virtual loop buffer) ( N F B_Buffer/2 ) mod ( N F B_Buffer ) Starts the bit and reads L bits in sequence: ( N FB — Buffer /2 ) mod ( N FB — Bu f fer ) to ( N FB — Bu f fer /2 +L - 1 ) mod ( N FB — Bu f fer ) bits.
- L bits are sequentially read starting from the (N F B_Buffer/2-L ) mod( N FB — Buffer ) bit in the mother codeword (virtual loop buffer): (N FB — Buffer /2-L ) mod ( N FB — Bu f fer ) to ( N F B_Buffer/2- 1 ) mod ( N FB — Buffer ) bits.
- the first bit from the mother codeword (virtual loop buffer) (the first bit of the first parity bit stream + M*func (( N FB — Buffer - first check bit stream header) Bits) I ( 2*M ) ) -L ) mod ( N FB — Buffer )
- the device in this embodiment is also applicable to the first, second, third, and fourth rate matching modes mentioned in the embodiment of the present invention, and the only difference is the first rate matching mode: SPID is 0, 1 2, 3, respectively select the first rate matcher, the second rate matcher, the third rate matcher, the fourth rate matcher; the second rate matching mode: when the SPID is 0, 1, 2, 3 respectively First rate matcher, second rate matcher, fifth rate matcher, sixth rate matcher; third rate matching mode: when the SPID is 0, 1, 2, 3, respectively select the first rate matcher, Second rate matcher, seventh rate matcher, eighth rate matcher; fourth rate matching mode: when the SPID is 0, 1, 2, 3, respectively select the first rate matcher, the second rate matcher, the ninth The rate matcher and the tenth rate matcher are not repeated here.
- SPID is 0, 1 2, 3, respectively select the first rate matcher, the second rate matcher, the third rate matcher, the fourth rate matcher
- the second rate matching mode when the SPID is 0, 1, 2, 3 respectively First rate matcher, second rate matcher
- the method of reducing the overlap phenomenon by changing the selection method of the bits in the mother code code word is used, and the probability of occurrence of the overlap phenomenon in the rate matching process is solved.
- the high problem achieves the effect of covering all the mother code areas as much as possible, thereby enhancing the performance of the HARQ multiple retransmission links.
- the implementation of the present invention does not modify the system architecture and the current processing flow, is easy to implement, facilitates promotion in the technical field, and has strong industrial applicability.
- the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices.
- the invention is not limited to any specific combination of hardware and software.
- the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Error Detection And Correction (AREA)
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP09843240.4A EP2421189A4 (en) | 2009-04-14 | 2009-11-16 | FLOW ADAPTATION METHOD AND EQUIPMENT |
KR1020117024293A KR101689906B1 (ko) | 2009-04-14 | 2009-11-16 | 레이트 매칭 방법 및 그 장치 |
EP18215769.3A EP3553981A1 (en) | 2009-04-14 | 2009-11-16 | Rate matching method and device |
US13/260,045 US8868988B2 (en) | 2009-04-14 | 2009-11-16 | Rate matching method and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200910134725.9 | 2009-04-14 | ||
CN200910134725.9A CN101867443B (zh) | 2009-04-14 | 2009-04-14 | 速率匹配方法和装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010118606A1 true WO2010118606A1 (zh) | 2010-10-21 |
Family
ID=42959020
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2009/074969 WO2010118606A1 (zh) | 2009-04-14 | 2009-11-16 | 速率匹配方法和装置 |
Country Status (5)
Country | Link |
---|---|
US (1) | US8868988B2 (zh) |
EP (2) | EP2421189A4 (zh) |
KR (1) | KR101689906B1 (zh) |
CN (1) | CN101867443B (zh) |
WO (1) | WO2010118606A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109428675A (zh) * | 2017-08-30 | 2019-03-05 | 华为技术有限公司 | 数据传输方法及装置 |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100235721A1 (en) * | 2009-03-13 | 2010-09-16 | Lsi Corporation | Rate Matching and De-Rate Matching for an LTE Transport Channel |
WO2012035732A1 (ja) * | 2010-09-15 | 2012-03-22 | パナソニック株式会社 | 無線通信装置およびハイブリッド自動再送要求送信方法 |
RU2012109385A (ru) * | 2012-03-12 | 2013-09-20 | ЭлЭсАй Корпорейшн | Оптимизация процессоров данных с использованием нерегулярных комбинаций |
CN103312442B (zh) * | 2012-03-15 | 2017-11-17 | 中兴通讯股份有限公司 | 基于有限长度循环缓存速率匹配的数据发送方法及装置 |
CA2972832C (en) * | 2013-12-30 | 2021-10-26 | Huawei Technologies Co., Ltd. | Polar code rate matching method and apparatus |
US9647692B2 (en) * | 2014-01-24 | 2017-05-09 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Upstream forward error correction codeword filling |
US9843414B2 (en) * | 2014-07-01 | 2017-12-12 | Utah State University | Low complexity error correction |
US10342026B2 (en) * | 2015-04-17 | 2019-07-02 | Panasonic Intellectual Property Corporation Of America | Rate matching for a machine type communication channel in time division duplex |
CN106533611A (zh) * | 2015-09-14 | 2017-03-22 | 中兴通讯股份有限公司 | 一种卷积码的数据发送方法及装置 |
CN108400838B (zh) | 2017-02-06 | 2021-05-18 | 华为技术有限公司 | 数据处理方法及设备 |
EP3566351B1 (en) * | 2017-02-06 | 2024-04-03 | Mediatek Inc. | Method and apparatus for communication |
US10348329B2 (en) * | 2017-02-13 | 2019-07-09 | Qualcomm Incorporated | Low density parity check (LDPC) circular buffer rate matching |
CN109245860B (zh) * | 2017-04-28 | 2020-03-20 | 华为技术有限公司 | 数据处理方法和数据处理装置 |
CN109150375A (zh) * | 2017-06-16 | 2019-01-04 | 华为技术有限公司 | 一种编码方法、无线设备和芯片 |
CN109150420B (zh) * | 2017-06-19 | 2022-02-25 | 华为技术有限公司 | 信息处理的方法、装置、通信设备和通信系统 |
CN109391380B (zh) * | 2017-08-11 | 2021-09-14 | 大唐移动通信设备有限公司 | 一种harq重传方法、装置及发送设备 |
KR102450664B1 (ko) | 2017-09-11 | 2022-10-04 | 지티이 코포레이션 | Ldpc 코딩된 데이터를 프로세싱하기 위한 방법 및 장치 |
CN117081607B (zh) * | 2023-08-30 | 2024-03-19 | 白盒子(上海)微电子科技有限公司 | 一种nr ldpc部分校验矩阵编译码指示信息获取方法 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101330351A (zh) * | 2007-06-20 | 2008-12-24 | 中兴通讯股份有限公司 | 基于循环缓存速率匹配的比特优先映射方法 |
US20090086849A1 (en) * | 2007-09-28 | 2009-04-02 | Jiannan Tsai | Method and apparatus of improved circular buffer rate matching for turbo-coded MIMO-OFDM wireless systems |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7823040B2 (en) * | 2006-10-11 | 2010-10-26 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for optimal redundancy version (RV) selection for UMTS HSDPA transmissions |
US9686044B2 (en) | 2007-03-27 | 2017-06-20 | Qualcomm Incorporated | Rate matching with multiple code block sizes |
WO2008153353A1 (en) * | 2007-06-13 | 2008-12-18 | Lg Electronics Inc. | Method for sub -packet generation with adaptive bit index |
KR101356517B1 (ko) * | 2007-06-27 | 2014-02-11 | 엘지전자 주식회사 | 적응적 비트 인덱스를 고려한 서브 패킷 생성 방법 |
JP4746598B2 (ja) * | 2007-09-28 | 2011-08-10 | 株式会社東芝 | 半導体記憶装置 |
-
2009
- 2009-04-14 CN CN200910134725.9A patent/CN101867443B/zh active Active
- 2009-11-16 WO PCT/CN2009/074969 patent/WO2010118606A1/zh active Application Filing
- 2009-11-16 EP EP09843240.4A patent/EP2421189A4/en not_active Ceased
- 2009-11-16 US US13/260,045 patent/US8868988B2/en active Active
- 2009-11-16 KR KR1020117024293A patent/KR101689906B1/ko active IP Right Grant
- 2009-11-16 EP EP18215769.3A patent/EP3553981A1/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101330351A (zh) * | 2007-06-20 | 2008-12-24 | 中兴通讯股份有限公司 | 基于循环缓存速率匹配的比特优先映射方法 |
US20090086849A1 (en) * | 2007-09-28 | 2009-04-02 | Jiannan Tsai | Method and apparatus of improved circular buffer rate matching for turbo-coded MIMO-OFDM wireless systems |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109428675A (zh) * | 2017-08-30 | 2019-03-05 | 华为技术有限公司 | 数据传输方法及装置 |
CN109428675B (zh) * | 2017-08-30 | 2022-05-24 | 华为技术有限公司 | 数据传输方法及装置 |
Also Published As
Publication number | Publication date |
---|---|
US8868988B2 (en) | 2014-10-21 |
CN101867443B (zh) | 2015-05-20 |
KR20120016197A (ko) | 2012-02-23 |
KR101689906B1 (ko) | 2016-12-26 |
EP3553981A1 (en) | 2019-10-16 |
US20120110406A1 (en) | 2012-05-03 |
EP2421189A1 (en) | 2012-02-22 |
EP2421189A4 (en) | 2013-09-11 |
CN101867443A (zh) | 2010-10-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2010118606A1 (zh) | 速率匹配方法和装置 | |
US6697986B2 (en) | Data transmission apparatus and method for an HARQ data communication system | |
WO2010060309A1 (zh) | 速率匹配方法和装置 | |
US5983382A (en) | Automatic retransmission query (ARQ) with inner code for generating multiple provisional decodings of a data packet | |
CN103312442B (zh) | 基于有限长度循环缓存速率匹配的数据发送方法及装置 | |
WO2015196551A1 (zh) | 数据发送方法及装置 | |
EP2111703B1 (en) | Method for sub -packet generation with adaptive bit index | |
CN101217352A (zh) | 一阶段速率匹配的缓冲设置方法 | |
WO2009062425A1 (fr) | Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code | |
WO2009026798A1 (fr) | Procédé de retransmission basé sur un code de vérification basse densité et son dispositif | |
WO2010072069A1 (zh) | 星座图映射方法和装置 | |
WO2017045522A1 (zh) | 一种卷积码的数据发送方法及装置 | |
KR100857777B1 (ko) | 하이브리드 자동 재송 요구 방식을 이용한 가변 길이의 패킷 송수신 방법 | |
CN102035617B (zh) | 一种通信系统中信道编码的速率匹配方法和装置 | |
KR100548315B1 (ko) | 터보코드를 이용한 에러보정 방법 | |
WO2023226747A1 (zh) | 一种信息的重传方法和通信装置 | |
CN102075285B (zh) | 一种速率匹配方法及装置 | |
WO2010113216A1 (ja) | 送信装置、受信装置、通信システム、及び通信方法 | |
KR100883605B1 (ko) | 하이브리드 자동 재송 요구 방식을 이용한 가변 길이의패킷 송수신 방법 | |
KR101350603B1 (ko) | 이동 통신시스템에서 부호 생성 장치 및 방법 | |
JP2013118715A (ja) | 送信装置、受信装置、通信システム、及び通信方法 |
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: 09843240 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2009843240 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20117024293 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13260045 Country of ref document: US |