WO2009065326A1 - Procédé de mappage de bits de modulation d'ordre élevé - Google Patents

Procédé de mappage de bits de modulation d'ordre élevé Download PDF

Info

Publication number
WO2009065326A1
WO2009065326A1 PCT/CN2008/072703 CN2008072703W WO2009065326A1 WO 2009065326 A1 WO2009065326 A1 WO 2009065326A1 CN 2008072703 W CN2008072703 W CN 2008072703W WO 2009065326 A1 WO2009065326 A1 WO 2009065326A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
bits
mapping
modulation
reliability
Prior art date
Application number
PCT/CN2008/072703
Other languages
English (en)
Chinese (zh)
Inventor
Zhifeng Yuan
Jun Xu
Original Assignee
Zte Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zte Corporation filed Critical Zte Corporation
Publication of WO2009065326A1 publication Critical patent/WO2009065326A1/fr

Links

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
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1893—Physical mapping arrangements

Definitions

  • the present invention relates to data transmission, and in particular to a bit mapping method in high-order modulation.
  • the digital communication system is composed of a transmitting end, a channel and a receiving end, wherein the transmitting end usually includes a source, a source encoder, a channel encoder and a modulator, and the receiving end usually includes demodulation. , channel decoder, source decoder and sink.
  • channel coding links including channel coding and decoding, modulation and demodulation, etc.
  • channel coding links are the most critical technologies of the entire digital communication physical layer, which determine the effectiveness and reliability of the underlying transmission of digital communication systems, where:
  • Channel coding is to combat a variety of noise and interference during transmission. By artificially adding redundant information, the system has the ability to automatically correct errors, thus 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 decoding error correction as the number of decoding iterations increases. Better performance. In the latest 3GPP LTE standard protocol, Turbo codes based on Quadratic Polynomial Permutation (QPP) interleaving are used as channel coding schemes for data services.
  • QPP Quadratic Polynomial Permutation
  • Rate matching processing is a very key technology after channel coding. Its purpose is to perform algorithm-controlled repetition or puncturing on channel-coded codeword bits to ensure the data bit length after the rate matching and the allocated physics. Channel resources match.
  • 3GPP R6 rate matching algorithm and Circular Buffer Rate Matching (CBRM) algorithm.
  • CBRM Circular Buffer Rate Matching
  • the cyclic buffer rate matching algorithm can generate a simple algorithm with excellent puncturing pattern performance, and the rate matching algorithm is used in the 3GPP2 series standard, the IEEE 802.16e standard, and the 3GPP LTE standard.
  • the codeword bits output by the Turbo coding are bit-separated, and three data bitstreams are separated: a systematic bitstream, a first parity bitstream, and a second parity bitstream.
  • the above three data bit streams are each rearranged by a block interleaver, which is called intra-block interleaving.
  • the rearranged systematic bits are placed at the start position, and then the two rearranged check bit streams are interleaved, which is called inter-block interleaving.
  • Nrf ⁇ coded bits can be selected as the output of the cyclic buffer rate match; the cyclic buffer rate match reads Nrf ⁇ coded bits, ie one HARQ packet, from a specified starting position in the output buffer.
  • N data is the length of the HARQ packet.
  • the bits selected for transmission can be read from any location in the buffer. If the end of the buffer is reached, the data can continue to be read around the beginning of the buffer. Therefore, loop-based rate matching (deletion or duplication) can be achieved in a simple way.
  • the circular cache has the advantage of flexibility and granularity.
  • Hybrid automatic request retransmission (HARQ)
  • Hybrid Automatic Request Retransmission is an extremely important link adaptation technology in digital communication systems.
  • 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 to notify it to send a new HARQ data packet; if the decoding fails, the NACK signal is fed back to the transmitting end, and the requesting end is re-requested. Send a HARQ packet.
  • the receiver can improve the probability of decoding success and achieve high reliability of link transmission by performing IR (incremental redundancy, Incremental Redundancy abbreviation) or Chase combining and decoding for multiple retransmitted data packets.
  • the redundancy version determines the multiple starting positions of the HARQ data packets read in the circular buffer.
  • the redundancy version determines the specific starting position of the HARQ data packets read in the circular buffer.
  • the redundancy version 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 4, the redundancy version is marked with four positions in the circular buffer from left to right according to 0, 1, 2 and 3, as shown in Figures 3a and 3b.
  • a more specific description can refer to the proposal and standard of LTE virtual loop buffer rate matching.
  • FIGS. 2a and 2b are a modulation constellation diagram for 16QAM and 64QAM, respectively.
  • the constellation modulation order ⁇ 6
  • the reliability of the mapped bits in the constellation is divided into three levels, (v., Vl ) is a high reliability bit
  • the mapping bits ( ⁇ 2 , ⁇ 3 ) are medium.
  • the reliability bits, the mapped bits ( ⁇ 4 , ⁇ 5 ), are low reliability bits.
  • the order of the mapped bits in this article is ⁇ from the left.
  • the order of mapping bits is V. , v 2 , v 3
  • 64QAM modulation the order of mapping bits is V. , ⁇ 2 , ⁇ 3 , ⁇ 4 , ⁇ 5 .
  • 16QAM and 64QAM may also have other modulation constellations.
  • the constellation modulation order ⁇ 6
  • the reliability of the mapped bits in the constellation is divided into three levels, ( ⁇ ., ⁇ 3 ) is a high reliability bit
  • the mapping bits ( Vl , v 4 ) are medium.
  • the reliability bits, the mapping bits (v 2 , v 5 ) are low reliability bits.
  • mapping bit ( V1 , v 5 ) is the second reliability bit
  • mapping bit ( V2 , v 6 ) is the third reliability bit
  • the mapping bit (v 3 , v 7 ) Is the fourth reliability bit.
  • it can be applied to the case of reliability level division of various mapping bits.
  • FIG. 3a shows an illustration of the reliability distribution of bit transmission in the prior art HARQ retransmission process Figure, using 16QAM modulation constellation.
  • a complete circle represents a codeword to be subjected to a cyclic buffer rate matching with redundant information including a system bit stream at the start position and two rearranged check bit streams interleaved thereafter.
  • first select ⁇ ⁇ coded bit outputs from the beginning of the codeword (the Nrf ⁇ coded bits constitute a HARQ packet) and perform modulation and transmission.
  • the Nrf ⁇ coded bits correspond to 0 from the figure. Turn clockwise to roughly 180.
  • the included sector is represented by the innermost arrowed arc arcl.
  • the first two bits of every 4 bits mapped to one modulation symbol are mapped to high reliability.
  • the sex mapping bits (v., Vl ) are represented by thick arcs in the figure, and the last two bits are mapped to low reliability mapping bits ( ⁇ 2 , v 3 ), which are represented by thin arcs in the figure.
  • the receiving end selects the Nrf ⁇ coded bit output from the new starting position (the starting position of the non-codeword) and performs modulation and transmission.
  • the Nrf ⁇ coded bits correspond to from 180 in the figure. Turn clockwise to roughly 180.
  • the sector contained in the direction is represented by the arc arc2.
  • the ⁇ 3 ⁇ 4 ⁇ bits selected by the receiving end correspond to 90 in the figure. Turn the direction clockwise by approximately 180.
  • the sector contained in the direction is represented by an arc arc3.
  • the Nrf ⁇ bits selected by the receiving end at this time correspond to the sectors included in the direction of the 270° direction clockwise by approximately 180°, which is represented by an arc arc4.
  • Nrfafa bits the first two bits of every four bits are mapped to high reliability mapping bits, and the latter two are mapped to low reliability mapping bits.
  • the probability that the two bits have an error again is higher, and the bit position at which the error occurs is the same, so that it is difficult for the receiving end to obtain more valid information by retransmitting the data during decoding, thereby improving the success of the decoding. rate.
  • Figure 3b differs from Figure 3a in that the number of bits per transmission in Figure 3b is greater than the total number of bits in the circular buffer.
  • the response is the arc of the arc corresponding to each HARQ packet sent in the figure. It is larger, but the same as in Fig. 3a, the reliability of the same bit at the time of two transmissions, that is, the reliability of the mapped bits to which it is mapped is the same.
  • the technical problem to be solved by the present invention is to provide a bit mapping method in high-order modulation, which can improve data retransmission performance and reduce transmission delay.
  • the present invention provides a bit mapping method in high-order modulation, where the order of the high-order modulation is that the mapping bits in the modulation constellation have a reliability level of X, and the bit mapping method includes: The transmitting end performs rate matching on the coded bits of the codeword in the virtual circular buffer when transmitting and retransmitting data of a certain codeword for the first time, and selects Nrf ⁇ coded bits from different initial positions as a Hybrid automatic request retransmission of HARQ packet output;
  • bit segment with the highest position corresponds to the highest reliability level
  • bit segment with the lowest position corresponds to the lowest reliability level
  • the coded bits of one codeword in the virtual cyclic buffer include a system bit located at a starting position and a subsequent check bit, and an initial position of the Nrf ⁇ coded bits selected at the time of first transmission is a start position of the codeword, and thereafter The initial position for bit selection at each retransmission is determined based on the redundancy version at the time of this retransmission.
  • the bits of the first bit segment in the HARQ data packet are first written into the first region of the rectangular interleaver of one row and column, and the first region includes the number of rows equal to the highest reliability level in one modulation symbol. Number of mapped bits, and the sequence number of the included row is equal to the sequence number of the mapped bit having the highest reliability level in the entire constellation point mapping bit;
  • the bits of the X1th bit segment are sequentially written into the X1 region of the rectangular interleaver, and the number of rows included in the X1 region is equal to the reliability level corresponding to the X1th bit segment in one modulation symbol.
  • the bits in the rectangular interleaver are read out in columns, and the bits in each column are sequentially read in order from top to bottom, and the rearranged HARQ packet bits are output.
  • the high-order modulation is 8PSK
  • the mapping bit (v., Vl ) has a high reliability level
  • the mapping bit (v 3 ) has a low reliability level
  • the bit rearrangement is performed as follows:
  • ( b ok , b k , b k ) denotes the 0th, 1st, 2nd mapping bits of the first modulation symbol in the HARQ packet after the bit rearrangement, +1 , +2 £ represents the bit before the rearrangement
  • the second bit in the HARQ packet, A 0, 1, ".J-1.
  • the first 2L bits in the HARQ data packet are first written into a rectangular area composed of the first row and the second row in a rectangular interleaver of 3 rows and L columns by column or row. And writing the last L bits in the HARQ packet to the third row of the rectangular interleaver. After the writing is completed, the bits are read out column by column from the first column of the rectangular interleaver, The bits in the column are sequentially read in the order from the first line to the last line, and the rearranged HARQ packet bits are output.
  • the high-order modulation is 16QAM
  • the mapping bits (v., Vl ) have a high reliability level
  • (v 3 , v 4 ) have a low reliability level
  • the bit rearrangement is performed as follows:
  • ( b ⁇ k , b k , b 2k , b 3k ) ( d 2k ? d 2k + l ? d 2k + 2L ? d 2k + 2L + l )
  • ( ) represents the HARQ packet after bit rearrangement
  • the first 2L bits in the HARQ data packet are first written into a rectangular area composed of the first row and the second row in a rectangular interleaver of 4 rows and L columns by column or row. And writing the last 1L bits in the HARQ data packet into the rectangular area composed of the third row and the fourth row in the rectangular interleaver in columns or in rows, after the writing is completed, from the rectangular interleaver
  • the first column begins to read the bits therein column by column, and the bits in each column are sequentially read in the order from the first row to the last row, and the rearranged HARQ packet bits are output.
  • the high-order modulation is 64QAM, and the mapping bits (v., Vl ) have a high reliability level.
  • the first 2L bits in the HARQ data packet are first written into a rectangular area composed of the first row and the second row in a rectangular interleaver of 6 rows and L columns by column or row. And then writing 1L bits in the middle of the HARQ packet into a rectangular area composed of the third row and the fourth row in the rectangular interleaver in columns or rows, and finally, columnizing the last 1L bits in the HARQ packet by column Or writing a rectangular area of the rectangular interleaver composed of the fifth row and the sixth row in a row;
  • the bits in the column are read out column by column from the first column of the rectangular interleaver, and the bits in each column are sequentially read from the first row to the last row, and the output is rearranged.
  • HARQ packet bits After the writing is completed, the bits in the column are read out column by column from the first column of the rectangular interleaver, and the bits in each column are sequentially read from the first row to the last row, and the output is rearranged.
  • the mapping bit ( v , V1 ) is the first reliability bit
  • the mapping bit (v 2 , v 3 ) is the second reliability bit
  • the mapping bit, v 5 ) is the third reliability bit
  • M-1, "%,” means modulo operation
  • “L*J” means round down, after bit reordering
  • the +th bit in the HARQ packet that is, the first bit in the first M-th order modulation symbol, ⁇ % 2+ ⁇ / ⁇ / 2 )". ⁇ 1/2" is the HARQ data before the bit rearrangement 2 & + ⁇ %2 + in the package . L 2" bits.
  • mapping bits (v., v 3 ) have a high reliability level
  • ( Vl , v 4 ) has a medium reliability level, has a low reliability level
  • ⁇ / 8 256QAM modulation
  • map bits ( ⁇ ., ⁇ 4 ) is the first reliability bit
  • the mapping bit ( ⁇ 5 ) is the second reliability bit
  • the mapping bit ( ⁇ 2 , ⁇ 6 ) is the third reliability bit
  • the present invention segments the bit sequence of the cyclic buffer rate matching output as a whole, and the bits in each segment are mapped to mapping bits of different reliability, and the change of the starting position of the output bit is selected in each retransmission to reach Maximizing the reliability of the entire codeword bits,
  • the HARQ mode achieves higher link throughput performance and reduces transmission delay. Further, the first segment of the bit sequence can be preferentially mapped to the highly reliable mapping bits to improve the reliability of system bit transmission.
  • the method of the invention is simple to implement and can be used in digital wireless communication systems of various standards. BRIEF abstract
  • Figure 1 is a block diagram of a digital communication system
  • Figure 2a and Figure 2b are 16QAM and 64QAM modulated bit mapping constellations, respectively;
  • 3a and 3b are schematic diagrams showing the reliability distribution of bit transmission in the prior art HARQ retransmission process using 16QAM and 64QAM modulation, respectively;
  • FIG. 5 is a schematic diagram of a specific process of processing a codeword bitstream output by Turbo coding and outputting a mapped modulated bitstream according to an embodiment of the present invention
  • Figure 6a and Figure 6b show the HARQ packet with a rectangular interleaver when using 8PSK modulation. Schematic diagram of row interleaving collection
  • FIG. 7a and 7b are schematic diagrams of interleaving and collecting HARQ data packets by using a rectangular interleaver when 16QAM modulation is used;
  • 8a and 8b are schematic diagrams of interleaving and collecting HARQ data packets by using a rectangular interleaver when 64QAM modulation is used;
  • Figures 9a and 9b are schematic diagrams showing the reliability distribution of bit transmission in two examples of HARQ retransmission using the method of the present invention, respectively, using 16QAM. Preferred embodiment of the invention
  • step 102 perform Turbo coding and interleaving on the information block bit data
  • step 104 perform rate matching output HARQ on the turbo coded codeword bits based on the cyclic buffer.
  • step 104 performs high order modulation mapping on the rearranged HARQ data packets (step 106).
  • step 104 is the code of the present invention and the interleaving method of the above.
  • the information block bit data sequence is represented by / ( i 0 consult- K _, ), where K is the information block bit data length, and 4 (0 ⁇ A ⁇ -1) is binary bit data.
  • the turbo coded mother code rate used is 1/3, and 12 tail bits are output.
  • the process of processing the codeword bit stream outputted by the Turbo code, and outputting the map modulated bit stream, as shown in FIG. 5, includes:
  • turbo code code word bit stream sequence C and the separated system bit stream sequence S, the first check ratio stream stream sequence P1, and the second parity bit stream sequence P2 have the following relationship:
  • the separated system bit stream sequence S, the first parity bit stream sequence P1 and the second parity bit stream sequence are respectively sub-block interleaved, and the system bit stream sequence after the sub-block interleaving is S/( ⁇ , 5, . ⁇ , -, ), the first parity bit stream sequence after sub-block interleaving is Pii ( ⁇ 4 ⁇ ,...,; ?1 ), and the second parity bit stream sequence after sub-block interleaving is ( ⁇ , ⁇ , ⁇ ).
  • the first parity bit stream sequence P1I and the second parity bit stream sequence after the sub-block interleaving process are bit-interleaved to form a parity bit sequence ⁇ ( ⁇ , ⁇ ..., ; ⁇ ,).
  • the check bit sequence P has the following relationship with the first check bit stream sequence P1I after the sub-block interleaving process and the second check bit stream sequence P2I after the sub-block interleave process:
  • check bit sequence P has the following relationship: Bit selection
  • the value can be 0, 1, 2, 3.
  • the bit mapping method of the present invention is based on the X reliability levels of the mapping bits in the constellation diagram of the order modulation, and the HARQ packet bits are divided into X bit segments, X bit segments and X kinds of reliable.
  • the higher the bit position in the HARQ data packet corresponds to the higher reliability level, ie the upper bits of the HARQ data packet will be mapped onto the highly reliable mapping bits of the constellation. Since the most advanced bit segment is a systematic bit, the systematic bits will obtain the highest transmission reliability, which is very advantageous for the receiver to correctly decode.
  • the basic technical effect of balancing the reliability of bit transmission can also be achieved by using other bit segments and reliability levels.
  • mapping bits corresponding to the reliability level Because at the time of modulation, the bits are sequentially taken out from the input bit stream, and mapped into a modulation symbol, which contains mapping bits of all reliability levels. Therefore, the bits of each bit segment need to be interleaved and collected, so that each group of bits output after rearrangement includes bits in each bit segment, and the position of the bit in each bit segment included and the bit is included.
  • the mapping bits of the reliability level corresponding to the segment have the same position in the modulation symbol.
  • the specific implementation method of the above bit rearrangement is as follows, but the specific implementation here is only an example, and the present invention is not limited thereto.
  • the packet bit is ⁇ , ⁇ ... ⁇ ), the packet after the bit rearrangement
  • the bits are ( ⁇ , ⁇ , ⁇ .- ⁇ ), U HARQ packet length.
  • the output bit stream can also be expressed as (b OA Ko ⁇ ⁇ ⁇ b M - lfi - -! ).
  • ( ) indicates the 0th, 1st, and 2nd mapping bits of the Ath modulation symbol in the HARQ packet after the bit rearrangement
  • the packet bits output after bit reordering should be:
  • the row number Nrow of the rectangular interleaver used is equal to the constellation modulation order, that is, equal to 3, and the number of columns of the rectangular interleaver is equal to the number of modulation symbols, which is equal to 6, as shown in FIG. 6a.
  • the direction of the arrow in the figure indicates the writing order, that is, the first 2L bits of the HARQ packet are first collocated
  • j each region of each example is from the first column
  • j each region of each example is from the first column
  • j each region of each example is from the first column
  • j each region of each example is from the first column
  • j each region of each example is from the first column
  • the line when the bit segment is written into the corresponding rectangular area, the line can also be used.
  • the mode or other manners are interleaved, so that although the rearranged bit sequences are different, the bits in the respective bit segments can also be mapped to the mapped bits of the corresponding level, so that the same technical effect can be achieved. The same is true for other high-order modulation methods, which will not be described below.
  • the bits in the rectangular interleaver are sequentially read from the top to the bottom (ie, from the first row to the last row) from the first column, and the packet bits output after the rearrangement are obtained.
  • One column corresponds to one modulation symbol.
  • ( ) ( d 2k , d 2k + l , d 2k + 2L , d 2k + 2L + l )
  • ( ) represents the 0th, 1, 2, 3 of the first modulation symbol in the HARQ packet after the bit rearrangement Mapping bits (calculated from the left, the same below)
  • d 2k represents the 2k, 2k+ 1, 2k+2L , 2k+2L in the HARQ packet before the bit rearrangement +l bits
  • A 0, 1,
  • the packet bits output after -J-1 bit reordering shall be:
  • the number of rows Nrow of the rectangular interleaver used is equal to the modulation order of the constellation diagram is equal to 4,
  • the number of columns of the rectangular interleaver is equal to the number of modulation symbols equal to 5, as shown in Figure 7a.
  • the direction of the arrow in the figure indicates the writing order, that is, the first 10 bits of the HARQ packet are first column-by-column written into the rectangular area composed of the first row and the second row in the rectangular interleaver, and then the column is followed.
  • the 10 bits are written column by column into the rectangular area composed of the third row and the fourth row of the rectangular interleaver.
  • the result after writing is as shown in Fig. 7b, and the number in the box indicates that the bit written to the position is a HARQ packet.
  • the bits in the rectangular interlace are read out from the top to the bottom in the column from the first column, and the data packet bits output after the rearrangement are obtained, and each column corresponds to one modulation symbol.
  • the data packet bits output after bit rearrangement should be: d 0 , dd 2L , d 2L+l , d 4L , d 4
  • a HARQ packet is divided into three segments.
  • the number of rows of the rectangular interleaver N row is equal to the constellation modulation order is equal to 6
  • the number of columns of the rectangular interleaver Equal to the number of modulation symbols is equal to 3, as shown in Figure 8a.
  • the direction of the arrow in the figure indicates the writing order, that is, the first 6 bits of the HARQ packet are first column-by-column written into the rectangular area composed of the first row and the second row in the rectangular interleaver, and then the middle is arranged in a column manner. 6 bits are written column by column into the rectangular area composed of the third line and the fourth line of the rectangular interleaver, and finally the last 6 bits are column-by-column written into the rectangular area composed of the fifth line and the sixth line of the rectangular interleaver, and written.
  • Figure 8b where the number in the box indicates that the bit written to this location is the first bit in the HARQ packet.
  • the bits in the rectangular interleaver are read out from the top to the bottom in the column from the first column, and the data packet bits output after the rearrangement are obtained, and each column corresponds to one modulation symbol.
  • modulation mode 16QAM
  • 64QAM 6
  • k 0X-L- ⁇ , equal to 0,1, ... Ml
  • % means modulo operation
  • [* ⁇ means round down, . +/1 is re-arranged before HARQ data
  • the M + A bits in the packet, that is, the first of the first order modulation symbols, is the 2 & + A%2 + in the HARQ packet before the bit reordering.
  • the case of writing the HARQ packet to the rectangular interleaver can also be expressed as follows:
  • bit stream collected by bit interleaving is read from the matrix interleaver and expressed as:
  • the 16QAM and 64QAM are taken as examples to describe the mapping method when different QAM bits are reliably distributed.
  • the constellation modulation order ⁇ 6
  • the bit map ( ⁇ ) is the reliability of the bits
  • N data is the HARQ data packet length
  • the constellation modulation order For M then:
  • d i+Ndat MI A is the ' ⁇ + ⁇ in the HARQ packet before the bit rearrangement. /( ⁇ / 2 ) ⁇ one bit.
  • mapping bit ( ⁇ ., ⁇ > 4 ) when the mapping bit ( ⁇ ., ⁇ > 4 ) is the first reliability bit, the mapping bit ( ⁇ 5 ) is the second reliability bit, and the mapping bit ( ⁇ 2 , ⁇ 6 ) is the third reliability bit. When the mapping bit ( ⁇ 3 , ) is the fourth reliability bit. You can also use this formula.
  • Bian rectangular interleaver with equal number of rows N row constellation modulation order is equal to 4
  • the number of columns of the rectangular interleaver is equal to the number of modulation symbols is equal to 5
  • the first five first bits of the HARQ packet is written rectangular interleaver In the first line, the 6th to 10th bits are written to the third line of the rectangular interleaver, the 11th to the 15th bits are written to the second line of the rectangular interleaver, and the 16th to the 20th bits are written to the fourth of the rectangular interleaver. Line, read out column by column.
  • Bian rectangular interleaver with equal number of rows N row constellation modulation order is equal to 6
  • the number of columns of the rectangular interleaver is equal to the number of modulation symbols is equal to 3
  • the first six bits of the HARQ packet is written rectangular interleaver
  • the ⁇ bits are written to the second and fifth rows of the rectangular interleaver, and the 13th to 18th bits are written into the rectangular interlace.
  • the third and sixth lines of the device can be read out column by column.
  • Figure 9a shows a schematic diagram of the reliability distribution of bit transmission during HARQ retransmission using the bit mapping method of the present invention, using a 16QAM modulation constellation. Please compare with FIG. 2a.
  • the N data coded bits transmitted for the first time are also represented by the innermost arcuate arc arcl, but the first half of the Nrf ⁇ bits are modulated by 16QAM.
  • the high reliability map bits ( v , Vl ) are mapped, represented by thick arcs in the figure.
  • the second half of the bits are mapped to low reliability bits mapping (V2, V 3), a thin curve in the figure indicates.
  • the first retransmitted Nrf ⁇ coded bits correspond to the arc arc2
  • the second retransmitted Nrf ⁇ coded bits correspond to the arc arc3
  • the third retransmitted Nrf ⁇ bits correspond to the arc Line arc4.
  • the first half of the bits are mapped to high reliability mapping bits
  • the second half of the bits are mapped to low reliability mapping bits. Because of the change in the starting position of each retransmission (see the corresponding standard), the first transmission of the HARQ bits mapped to the low-reliability mapping bits is mapped to the high-reliability in the second transmission.
  • the bits are mapped to maximize the reliability of the equalization of the entire codeword bits.
  • the transmission reliability of the first transmission may be low, that is, the mapped low reliability mapping bits.
  • the transmission reliability of most of the bits at the time of the second transmission is improved, that is, the highly reliable mapped bits to be mapped.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

L'invention porte sur un procédé de mappage de bits de modulation d'ordre élevé. Ledit procédé comporte les opérations suivantes : lorsque l'émetteur transmet certaines données de mot de code pour la première fois et retransmet le mot de code chaque fois, il effectue l'adaptation de débit du bit de codage du mot de code dans le tampon circulaire virtuel et émet un paquet HARQ par sélection de bits de codage à partir des différentes positions d'origine ; lesdits bits de paquet HARQ sont divisés en X segments de bits avec un mappage de X niveaux de fiabilité pour réinitialiser les bits, et sont ensuite soumis au mappage de bit ; tous les bits dans chaque segment de bits sont mappés dans les bits de mappage avec le niveau de fiabilité correspondant audit segment de bits, le nombre de bits inclus dans chaque segment de bits étant égal au produit du nombre de bits de mappage avec les niveaux de fiabilité correspondant audit segment de bits dans un symbole de modulation et du nombre de symbole de modulation L dans ledit paquet HARQ. Ledit procédé peut améliorer l'efficacité de retransmission de données et réduire le retard de transmission. Ledit procédé peut également être mis en oevre de façon simple.
PCT/CN2008/072703 2007-11-22 2008-10-15 Procédé de mappage de bits de modulation d'ordre élevé WO2009065326A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200710188087.X 2007-11-22
CN200710188087XA CN101442383B (zh) 2007-11-22 2007-11-22 一种高阶调制中的比特优先映射方法

Publications (1)

Publication Number Publication Date
WO2009065326A1 true WO2009065326A1 (fr) 2009-05-28

Family

ID=40667126

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072703 WO2009065326A1 (fr) 2007-11-22 2008-10-15 Procédé de mappage de bits de modulation d'ordre élevé

Country Status (2)

Country Link
CN (1) CN101442383B (fr)
WO (1) WO2009065326A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102064910A (zh) * 2009-11-13 2011-05-18 傲世通科技（苏州）有限公司 混合自动重传请求比特收集和交织的方法和装置
WO2023083342A1 (fr) * 2021-11-12 2023-05-19 中兴通讯股份有限公司 Procédé et module de traitement de données, et dispositif électronique et support de stockage

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103825685B (zh) * 2012-11-16 2018-05-11 华为技术有限公司 用于实现混合自动重传请求的方法和装置
EP3113398B1 (fr) 2014-03-19 2020-04-22 Huawei Technologies Co., Ltd. Procédé d'adaptation de débit de code polaire et dispositif d'adaptation de débit
CN109150199B (zh) 2017-06-17 2024-06-25 华为技术有限公司 一种极化Polar码的交织处理方法及装置
CN109150378B (zh) * 2017-06-16 2021-04-09 华为技术有限公司 一种数据处理方法及数据处理装置
WO2018228601A1 (fr) * 2017-06-16 2018-12-20 华为技术有限公司 Procédé de traitement de données et dispositif de traitement de données
CN111183590B (zh) * 2017-09-08 2021-11-19 华为技术有限公司 用于比特交织编码调制的列行交织
CN109525255B (zh) * 2017-09-18 2022-04-05 华为技术有限公司 交织方法和交织装置
CN112534787B (zh) * 2018-08-08 2022-05-27 中兴通讯股份有限公司 无线通信的方法、无线通信装置、计算机可读介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1392684A (zh) * 2001-06-15 2003-01-22 北京邮电大学 Ip数据的波分复用光网络传输适配方法
US20030081690A1 (en) * 2001-10-29 2003-05-01 Samsung Electronics Co., Ltd. Apparatus and method for transmitting/receiving data in a CDMA mobile communication system
CN101119182A (zh) * 2007-08-13 2008-02-06 中兴通讯股份有限公司 一种高阶调制中的比特优先选择方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1392684A (zh) * 2001-06-15 2003-01-22 北京邮电大学 Ip数据的波分复用光网络传输适配方法
US20030081690A1 (en) * 2001-10-29 2003-05-01 Samsung Electronics Co., Ltd. Apparatus and method for transmitting/receiving data in a CDMA mobile communication system
CN101119182A (zh) * 2007-08-13 2008-02-06 中兴通讯股份有限公司 一种高阶调制中的比特优先选择方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ZTE: "Bit Priority Mapping and Constellation Rearrangement for LTE", 3GPP TSG-RAN WG1 #49BIS RL-072906, 29 June 2007 (2007-06-29) *
ZTE: "Direct Bit Priority Mapping for E-UTRA 3GPP TSG-RAN WG1 #50 R1-073593", DIRECT BIT PRIORITY MAPPING FOR E-UTRA 3GPP TSG-RAN WG1 #50 R1-073593, 24 August 2007 (2007-08-24) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102064910A (zh) * 2009-11-13 2011-05-18 傲世通科技（苏州）有限公司 混合自动重传请求比特收集和交织的方法和装置
WO2023083342A1 (fr) * 2021-11-12 2023-05-19 中兴通讯股份有限公司 Procédé et module de traitement de données, et dispositif électronique et support de stockage

Also Published As

Publication number Publication date
CN101442383B (zh) 2012-11-28
CN101442383A (zh) 2009-05-27

Similar Documents

Publication Publication Date Title
WO2009065326A1 (fr) Procédé de mappage de bits de modulation d'ordre élevé
KR101119111B1 (ko) Ｌｄｐｃ 부호를 이용한 데이터 재전송 방법
JP3701263B2 (ja) Ｃｄｍａ移動通信システムにおけるデータの送受信装置およびその方法
JP5101703B2 (ja) ターボ−コーディングされたｍｉｍｏ−ｏｆｄｍ無線システムのための改善された循環式バッファーレートマッチング方法及び装置
CN101119182B (zh) 一种高阶调制中的比特优先选择方法
KR100526525B1 (ko) 이동통신시스템에서 패킷 재전송을 위한 송수신 장치 및 방법
KR101191196B1 (ko) 패리티 검사 행렬을 이용하여 부호화 및 복호화하는 방법
US8677204B2 (en) Methods and apparatus for transmitting/receiving data in a communication system
US8225165B2 (en) Methods and devices for encoding data in communication systems
US8446811B2 (en) Constellation re-arrangement and bit grouping
KR20080087615A (ko) Ｌｄｐｃ 부호를 이용한 부호화 방법
US7210089B2 (en) Communication system employing turbo codes and a hybrid automatic repeat request scheme
EP1386440A1 (fr) Dispositif et procede de transmission et de reception de donnees utilisant une combinaison de chase partielle
KR20080111342A (ko) 직교주파수분할다중접속방식의 이동 통신시스템에서 심볼전송 방법 및 장치
KR101490249B1 (ko) 연판정을 이용한 통신방법 및 장치
JP2004304268A (ja) 無線送信装置、無線受信装置及び方法
WO2010072069A1 (fr) Procédé et appareil de mappage de constellation
CN113366785B (zh) 用于重传mac协议数据单元（mpdu）的通信发射器
JP5676274B2 (ja) パケット再送信及び受信の方法並びに同方法を採用する無線装置
KR101162217B1 (ko) 패리티 검사 행렬을 이용하여 ｌｄｐｃ 부호화를 수행하는방법
KR101411079B1 (ko) 이동통신 시스템에서의 데이터 송수신 방법 및 장치
KR101191197B1 (ko) 복수의 패리티 검사 행렬을 이용하여 복호화하는 방법
WO2008153330A1 (fr) Procédé et appareil de transmission/réception de données dans un système de communications mobiles
KR101137349B1 (ko) 복수의 패리티 검사 행렬을 이용하여 부호화하는 방법
KR101221911B1 (ko) Ｌｄｐｃ 부호를 이용하여 재전송을 수행하는 방법

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08852589

Country of ref document: EP

Kind code of ref document: A1