CN101335691B - Data transmission method, interweaver and communication apparatus - Google Patents
Data transmission method, interweaver and communication apparatus Download PDFInfo
- Publication number
- CN101335691B CN101335691B CN200710112478A CN200710112478A CN101335691B CN 101335691 B CN101335691 B CN 101335691B CN 200710112478 A CN200710112478 A CN 200710112478A CN 200710112478 A CN200710112478 A CN 200710112478A CN 101335691 B CN101335691 B CN 101335691B
- Authority
- CN
- China
- Prior art keywords
- index
- sequence
- packet
- index sequence
- bit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 67
- 238000000034 method Methods 0.000 title claims abstract description 23
- 238000004891 communication Methods 0.000 title abstract description 10
- 239000011159 matrix material Substances 0.000 claims description 14
- 238000012545 processing Methods 0.000 claims description 8
- 238000012937 correction Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000009897 systematic effect Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 239000012141 concentrate Substances 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention relates to the technical field of communication, in particular to a data transmission method, an interleaver and a communication device, which are used for improving the performance of a communication system. In the invention, a data packet is interlaced according to a first index sequence, and transmission is modulated; the data packet is interlaced according to a second index sequence, and the transmission is modulated; index elements in each index group in the second index sequence and index elements in each corresponding index group in the first index sequence are same but different in position. By adopting the technical proposal of the invention, the reliability of bits can be balanced, thus causing the occurrence possibility of wrong code of each bit to be relatively even so as to improve the performance of the system.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of data transmission method, interleaver and communicator.
Background technology
In communication system, receive signal and tend to receive the influence that declines in noise, interference and the wireless channel, mistake appears sometimes.In order to prevent this problem; Usually in communication system, add convolution code, cascaded code, LDPC (Low Density Parity Check; Low density parity check code) sign indicating number waits and to carry out error correction coding, adds redundant bit information in the original data stream and transmits through link through being coded in.At receiving terminal, utilize these redundant informations just can correct some mistake of appearance.Usually, when mistake is evenly distributed in the receiving data stream and equiprobability when occurring, a kind of often good selection of the scheme of this error correction coding.But because the complexity of wireless channel, as owing to manyly make the level of the signal that is received that very big variation arranged in time through decline from what the reflection of building etc. caused, mistake can occur with the mode that happens suddenly usually.In order to improve error correcting capability, before transmission, interweave the bit after the error correction coding usually to unexpected error.What is called interweaves, and is exactly a kind of data processing method that realizes changing message structure to greatest extent and do not change the information content from essence, thereby makes decentralized to greatest extent, the randomization of mistake that happens suddenly in the Channel Transmission process and concentrate.Practical application shows that the appearance of interleaver makes the error correcting capability of sign indicating number have significantly improved.
Wherein block interleaved is a kind of deinterleaving method that is used for chnnel coding the earliest, also is more common deinterleaving method.A typical block interleaved device is an interleaver according to the cycle T=N * M of N * Metzler matrix description, and the typical characteristic of these interleavers is writing by line direction exactly successively, and every row writes M data, reads N data successively by column direction then.Interleaver matrix as shown in Figure 1 is one 3 * 3 a matrix; With sequence number is that 9 data of 1 to 9 write by line direction successively; Every row writes 3 data, reads 3 data successively by column direction then, and the sequence of then reading is: 1,4,7,2,5,8,3,6,9.
In communication system,, adopt two kinds of schemes of FEC (Forward Error Correction, forward error correction coding) and ARQ (Automatic Repeat reQuest, repeat requests automatically) in order to improve the reliable transmission of system.FEC is because transmission mechanism is simple, and system delay is little and generally be used for the occasion of having relatively high expectations in real time, and ARQ is used for the transmission precision height and real-time requires low place.And both are combined is that HARQ (Hybrid Automatic Repeat reQuest mixes automatic repeat requests) can obtain better transmission performance.According to the mode that forward error correction among the HARQ merges at receiving terminal, HARQ mainly contains following two kinds: Chase Combining (Chase merging) and IR (Incremental Redundancy, incremental redundancy type).In Chase merges; Transmitting terminal retransmits at every turn and uses identical FEC coded data packet; The grouping of receiving terminal storage errors, these send the copy that divides into groups to the decoder of receiving terminal according to SNR (Signal to Noise Ratio, the signal to noise ratio) weighted array that receives.Like this, obtained the time diversity gain.Incremental redundancy type HARQ has considered the time-varying characteristics of radio propagation channel.When transmission data block first not or have a spot of redundancy.If bust this then retransmits.The data block that retransmits is not duplicating of the data block that passes first, but has increased redundancy section wherein.At receiving terminal the data block of receiving for twice is merged, code rate can decrease and improve coding gain.
At present, interweaving that chnnel coding is carried out in handling handled to confirm through the ordering of one two step by above-mentioned interleaver.The first step guarantees that the adjacent encoder bit is mapped on the non-conterminous subcarrier.Second step guaranteed that the adjacent encoder bit alternately is mapped on the low of constellation or the higher bit position, can avoid long-term unserviceable bit like this.
N
CpcBe the number of coded bits on each subcarrier, QPSK (Quadrature Phase Shift Keying, QPSK), 16-QAM (Quadrature Amplitude Modulation, quadrature amplitude modulation) or 64-QAM are respectively 2,4 and 6.Comprising N
CbpsIn the packet of Bit data, suppose that k is that coded-bit is through the preceding index (i.e. the index of each bit in this packet) of the ordering first step; m
kIndex sequence when being coded-bit through the ordering first step but through second step; j
kIndex sequence when to be coded-bit through second step of ordering but without ovennodulation shine upon.
Sequence number m in the time of can obtaining coded-bit through the ordering first step but not through second step according to formula (1)
k:
m
k＝(N
cbps/d)×k
modd+floor(k/d) (1)
Can obtain coded-bit through second step of ordering but the sequence number j when shining upon according to formula (2) without ovennodulation
k:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps))
mod(s) (2)
In formula (1) and (2), N
CbpsBe the bit number in the packet; K=0,1 ..., N
Cbps-1; D representes the degree of depth that this interweaves for this matrix column number that interweaves; P
Mod QThe remainder that P obtains divided by Q is asked in expression; Floor representes to round.
In an instance of prior art, adopt the 64-QAM modulation, corresponding N
Cbps=288, N
Cpc=6, s=N
Cpc/ 2=3, d=16, the index sequence j that then obtains
kAs follows:
The Bit Interleave that with index in the packet is k is at the corresponding j of the sequence number k of above-mentioned index sequence
kThe position of indication, for example, j
1=20, be 1 Bit Interleave on the position 20 of the corresponding j1 indication of the sequence number of above-mentioned index sequence 1 then with index in the packet, promptly in the bit sequence of back output that interweaves, index is that 1 Bit Interleave has arrived position 20 in the former packet.Thus, can obtain the interweaving bit index of back output is:
The inventor finds when of the present invention realizing, in the prior art, because when adopting HARQ; In each transmission, all adopt identical interleaving mode, and because the first transmission of HARQ during with each the re-transmission; Its data packets for transmission possibly be identical, also possibly have part identical in each data packets for transmission, then for this all or part of identical bit; Interweave in the bit sequence that obtains, this all or part of identical bit all is mapped to the same position of identical constellation point on the planisphere in each transmission, and owing to the reliability of each position on each constellation point is different; For example, in 64-QAM modulation, 6 bit position b5b4b3b2b1b0 on constellation point; B5 in these 6 bit positions, b2 has the highest reliability, b4; B1 has medium reliability, and b3, b0 have minimum reliability.And can know by above-mentioned instance obtain the interweaving bit index of back output; Index is that 0,16,32 bit is in each transmission; All be mapped to the bit position that has the highest reliability, has medium reliability, has minimum reliability respectively, and the identical bit in other positions in packet also is the same, therefore; In the first transmission of HARQ retransmits with each HARQ; The reliability of each bit is also unbalanced, and error code appears in bit easily that always be mapped to the bit position of minimum reliability, thereby influences communication system performance.
Summary of the invention
The embodiment of the invention provides a kind of data transmission method, interleaver and communicator, in order to improve communication system performance.
The embodiment of the invention provides a kind of data transmission method, comprising:
Adjacent twice transmission to packet interweaves to packet according to first index sequence, and modulation transmissions; According to second index sequence packet is interweaved, and modulation transmissions;
Wherein, the method that obtains said first index sequence and second index sequence is:
According to following acquisition the 3rd index sequence:
m
k＝(N
cbps/d)×k
modd+floor(k/d)
And according to following acquisition first index sequence and second index sequence:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s)
Wherein, N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1.
The embodiment of the invention also provides a kind of interleaver, comprising:
Receiver module is used to receive the packet of input;
Processing module is used for adjacent twice transmission to packet, and the packet that said receiver module is received according to first index sequence interweaves and exports; Packet is interweaved and export according to second index sequence; Said first index sequence and second index sequence obtain through following formula:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s)；
Wherein, m
k=(N
Cbps/ d) * k
Modd+ floor (k/d), N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1.
The embodiment of the invention also provides a kind of communicator, comprising:
Interleaver is used for adjacent twice transmission to packet, packet is interweaved and exports according to first index sequence; Packet is interweaved and export according to second index sequence; Said first index sequence and second index sequence obtain through following formula:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s)；
Wherein, m
k=(N
Cbps/ d) * k
Modd+ floor (k/d), N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1;
Modulation module is used for the bit of said interleaver output is modulated.
In embodiments of the present invention; In adjacent twice transmission to packet, adopt different index sequence that packet is interweaved, and modulation transmissions; Make packet identical bit of each index in adjacent twice transmission be mapped on the bit position of Different Reliability on the planisphere; Thereby be implemented in the reliability of balanced bit in the transmission course of packet, the corresponding bit of some index can always be mapped on the bit position of minimum reliability, thereby it is comparatively average to make that the probability of error code appears in the corresponding bit of each index; Can reduce the bit error probability of this bit, to improve systematic function.
Description of drawings
Fig. 1 is an interleaver matrix sketch map;
Fig. 2 is the transfer of data flow process figure in the embodiment of the invention;
Fig. 3 is the interleaver block diagram in the embodiment of the invention;
Fig. 4 is the communicator block diagram in the embodiment of the invention.
Embodiment
Transfer of data flow process in the embodiment of the invention is as shown in Figure 2, comprises the steps:
Step S101 interweaves to packet according to first index sequence, and modulation transmissions;
Step S102 interweaves to packet according to second index sequence, and modulation transmissions, and the index element in the index in second index sequence in each index-group and first index sequence in the respective index group is identical and the position is different.
In each index-group each index be spaced apart the matrix column number that this interweaves, and the index quantity in each index-group can be confirmed according to the corresponding number of bits of constellation point in this modulation.
Adopt technique scheme; Can be adjusted at that each bit is mapped on the bit position of Different Reliability on the planisphere in adjacent twice transmission; Thereby be implemented in the reliability of balanced bit in the transmission course of packet; Some bits can always be mapped on the bit position of minimum reliability, thereby it is comparatively average to make that the probability of error code appears in each bit, to improve systematic function.
In such scheme; Interweave and can be identical according to first index sequence according to the packet that second index sequence interweaves; Also can be that part is identical; As long as have identical part in the packet that interweaves for this twice, then such scheme can reach the effect of bit identical in balanced two packets.
Below in conjunction with accompanying drawing the embodiment of the invention is done description further.
First index sequence that adopts in the embodiment of the invention and the acquisition mode of second index sequence can for:
Obtain the 3rd index sequence m according to formula (1) earlier
k, and obtain first index sequence and second index sequence according to formula (3):
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s) (3)
Wherein, N
CbpsBe the bit number in the packet; K is 0 to N
Cbps-1 integer, the index of each bit in the expression packet; D is the index quantity in each index-group for this matrix column number that interweaves, s; N is 0 or positive integer, the difference of two n that when obtaining first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1.
Data transmission method in the embodiment of the invention is particularly useful for adopting the data transmission procedure of HARQ; In the HARQ that adopts Chase to merge; First transmission is all identical with each packet that retransmits; And adopt among the HARQ of IR, should there be part identical in the packet in each transmission, adopt the transmission of first index sequence and adopt the transmission of second index sequence can be following any one or its combination in any:
The first transmission of packet and re-transmission for the first time;
Retransmit the first time of packet and retransmit for the second time;
Retransmit the second time of packet and retransmit for the third time.
It is thus clear that; Said method is not confined to have only under the situation of twice transmission; Situation for twice above transmission; Can make not only that some bits can always not be mapped on the bit position of minimum reliability in twice adjacent transmission, and can make that some bits are mapped on the bit position of various reliabilitys fifty-fifty in the repeatedly transmission as far as possible, thereby make the reliability of each each bit of transmission average.
With an instance in the embodiment of the invention embodiment of the invention is further specified below, in this example, adopt the 64-QAM modulation, corresponding N
Cbps=288, N
Cpc=6, s=N
Cpc/ 2=3, d=16.Supposing to carry out twice HARQ retransmits and each all the transmission and the identical packet of first transmission; Then the corresponding index sequence of the first transmission of configuration is a sequence A; Retransmitting corresponding index sequence for the first time is sequence B, and retransmitting corresponding index sequence for the second time is sequence C.When obtaining sequence A, sequence B, sequence C, the n that is provided with respectively in the formula (3) is 0,1,2.
When n=0 is set, following according to the index sequence A that formula (3) calculates:
The Bit Interleave that with index in the packet is k is at the corresponding j of the sequence number k of above-mentioned index sequence
kThe position of indication; Be about to index will be identical with the sequence number of index in first index sequence or the index sequence in the packet Bit Interleave to corresponding first index sequence of this sequence number or the position of the indication of the index in second index sequence, can obtain according to the sequence A bit index of afterwards exporting that interweaves be:
When n=1 is set, following according to the index sequence B that formula (3) calculates:
In this example, according to the corresponding number of bits N of constellation point in this modulation
CpcIndex quantity in each index-group of confirming is N
Cpc/ 2=3, visible, because in index sequence; The index at per 3 intervals 16 is one group, and promptly in sequence A, 0,1,2 these three index are one group; And in sequence B, the index identical with their positions is respectively 1,2,0, and be visible; These the two groups index that in sequence A and sequence B, are in same position respectively, its element identical (all being 0,1,2 these three index) and position are different, and situation also is like this in other each groups.
The Bit Interleave that with index in the packet is k is at the corresponding j of the sequence number k of above-mentioned index sequence
kThe position of indication, can obtain according to the interweave bit index of back output of sequence B be:
Thus it is clear that, be 0,16,32 according to interweave preceding 3 bit index of bit index of back output of sequence A, then in the planisphere that 64-QAM adopted; Index is that 0 bit will be mapped on the bit position with the highest reliability; Index is that 16 bit will be mapped on the bit position with medium reliability, and index is that 32 bit will be mapped on the bit position with minimum reliability, and is 32,0,16 according to interweave preceding 3 bit index of bit index of back output of sequence B; Then in the planisphere that 64-QAM adopted; Index is that 32 bit will be mapped on the bit position with the highest reliability, and index is that 0 bit will be mapped on the bit position with medium reliability, and index is that 16 bit will be mapped on the bit position with minimum reliability; It is thus clear that; For these 3 bits, the reliability of each bit has obtained change, no longer is that the high bit reliability of reliability is high always; The bit reliability that reliability is low is low always, but has obtained a kind of balance.Other bits repeat no more by that analogy here.
When n=2 is set, following according to the index sequence C that formula (3) calculates:
It is thus clear that in sequence A, 0,1,2 these three index are one group; And in sequence B, the index identical with their positions is respectively 1,2,0, in sequence C; The index identical with their positions is respectively 2,0,1, and be visible, these the three groups index that are in same position respectively in sequence A, sequence B and the sequence C; Its element identical (all being 0,1,2 these three index) and position are different, and situation also is like this in other each groups.
The Bit Interleave that with index in the packet is k is at the corresponding j of the sequence number k of above-mentioned index sequence
kThe position of indication, can obtain according to the interweave bit index of back output of sequence C be:
It is thus clear that; Interweaving afterwards according to sequence C, preceding 3 bit index of the bit index of output are 16,32,0; Then in the planisphere that 64-QAM adopted, index is that 16 bit will be mapped on the bit position with the highest reliability, and index is that 32 bit will be mapped on the bit position with medium reliability; Index is that 0 bit will be mapped on the bit position with minimum reliability, and other bits by that analogy.
Promptly in these three times transmission, index is that the reliability that 0 bit is mapped on the planisphere is followed successively by high, medium and low; Index be 16 bit be mapped to reliability on the planisphere be followed successively by in, low, high; Index be 32 bit be mapped to reliability on the planisphere be followed successively by low, high, in, other bits are by that analogy.
Hence one can see that; In this example, because in three times of packet transmission, each bit all is mapped to bit position with the highest reliability respectively, have the bit position of medium reliability and have on the bit position of minimum reliability; Therefore; Make that the reliability of each bit is very average, the bit error probability of each bit has also been divided equally, and can guarantee systematic function better.
When concrete the realization; First index sequence and second index sequence can be pre-configured; Also can calculate in real time; And first index sequence and second index sequence can calculate according to formula (1) and formula (3), also can dispose as required, as long as make in second index sequence in the index in each index-group and first index sequence that the index element in the respective index group is identical and the position is different.Wherein, Respective index group in second index sequence can be and the identical index-group in the first index sequence position; It also can be the different index-group in position; When the respective index group in second index sequence is the index-group identical with the first index sequence position, adopt second index sequence to interweave after, the corresponding bit of each index in the group can be mapped to adopting first index sequence and interweave on the identical constellation point in back; And when the respective index group in second index sequence was the index-group different with the first index sequence position, corresponding bits can be mapped on the various constellations point.
For example, in another instance of the embodiment of the invention, adopt the 64-QAM modulation, N
Cbps=288, N
Cpc=6, the index quantity in each index-group is 6, and the respective index group that disposes in second index sequence is and the identical index-group in the first index sequence position, and wherein, it is identical with sequence A to dispose first index sequence, and second index sequence is a sequence D, and sequence D is following:
Wherein, Comprise index 5,3,4,2,0,1 in the index-group of sequence D; Comprise index 0,1,2,3,4,5 in the sequence A index-group identical with its position; It is thus clear that, comprising that in these two index-group identical index element and each index positions of elements are different, other index-group are also followed identical rule.
Interweaving afterwards according to sequence A, preceding 6 bit index of the bit index of output are 0,16,32,48,64,80; Then in the planisphere that 64-QAM adopted; Index is that 0,48 bit will be mapped on the bit position with the highest reliability; Index is that 16,64 bit will be mapped on the bit position with medium reliability, and index is that 32,80 bit will be mapped on the bit position with minimum reliability, and is 64,80,48,16,32,0 according to interweave preceding 6 bit index of bit index of back output of sequence D; Then in the planisphere that 64-QAM adopted; Index is that 64,16 bit will be mapped on the bit position with the highest reliability, and index is that 80,32 bit will be mapped on the bit position with medium reliability, and index is that 48,0 bit will be mapped on the bit position with minimum reliability; It is thus clear that processing can make the reliability of each bit obtain equilibrium like this.Quantity in this each index-group can be according to concrete needs setting; And the quantity in this each index-group can be for dividing exactly the value of the number of bits of constellation point correspondence in this modulation; Can make each bit all be mapped on the identical constellation point like this, for example, work as N in each transmission
Cpc=6 o'clock, the quantity in this each index-group can be 1,2,3 or 6, when this quantity is 1, can implement this programme equally, but has only 1 index in one group, can not reach the effect of balanced reliability.Quantity in each index-group is 2 o'clock, and the n that is provided with in the formula (3) that can circulate is 0 or 1.Quantity the number of transmissions being not less than in each index-group is a half of the corresponding number of bits of constellation point, and the quantity that is provided with in the index-group is the half the of the corresponding number of bits of constellation point, can make the reliability of each bit obtain balanced preferably.
For example, in another instance of the embodiment of the invention, adopt the 64-QAM modulation, N
Cbps=288, N
Cpc=6, the index quantity in each index-group is 6, and the respective index group that disposes in second index sequence can be and the different index-group in the first index sequence position, and wherein, it is identical with sequence A to dispose first index sequence, and second index sequence is sequence E, and sequence E is following:
Wherein, Comprise index 5,3,4,2,0,1 in the index-group of sequence E, comprise index 0,1,2,3,4,5 in its corresponding index-group of sequence A, and sequence A is different with the position of respective index group among the sequence E; Because sequence A is different with the position of respective index group among the sequence E; After adopting sequence E to interweave, on the various constellations point after corresponding bits can be mapped to and adopt sequence A to interweave, but on corresponding constellation point; The reliability of each bit has obtained adjustment equally; Therefore, when realizing the embodiment of the invention, it is identical and the position is different gets final product only to need to satisfy in second index sequence in the index in each index-group and first index sequence index element in the respective index group.Whether the position that need not be concerned about each index-group is identical.
Interleaver in the present embodiment, as shown in Figure 3, comprising:
This interleaver can also comprise memory module or acquisition module, wherein:
Memory module is used to preserve first index sequence and second index sequence and exports to processing module 102.
Acquisition module is used to obtain first index sequence and second index sequence and exports to processing module 102.
Communicator in the present embodiment, as shown in Figure 4, comprising:
This interleaver 100 can also comprise determination module 103, and the corresponding number of bits of modulation constellation point that is used for carrying out according to modulation module 200 is confirmed the index quantity in this index-group.
In sum; In embodiments of the present invention, in adjacent twice transmission to packet, adopt different index sequence that packet is interweaved; And modulation transmissions; Make packet identical bit of each index in adjacent twice transmission be mapped on the bit position of Different Reliability on the planisphere, thereby be implemented in the reliability of balanced bit in the transmission course of packet, make the corresponding bit of some index can always not be mapped on the bit position of minimum reliability; Thereby it is comparatively average to make that the probability of error code appears in the corresponding bit of each index; Especially when certain index is corresponding in adjacent twice transmission bit is identical bit, can reduce the bit error probability of this bit, with the raising systematic function.The embodiment of the invention is particularly useful for the HARQ transfer of data.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.
Claims (11)
1. a data transmission method is characterized in that, comprising:
Adjacent twice transmission to packet interweaves to packet according to first index sequence, and modulation transmissions; According to second index sequence packet is interweaved, and modulation transmissions;
Wherein, the method that obtains said first index sequence and second index sequence is:
According to following acquisition the 3rd index sequence:
m
k＝(N
cbps/d)×k
modd+floor(k/d)
And according to following acquisition first index sequence and second index sequence:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s)
Wherein, N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1.
2. the method for claim 1 is characterized in that, each index is spaced apart the said matrix column number that interweaves in the said index-group.
3. the method for claim 1 is characterized in that, the index quantity in the said index-group is for dividing exactly the value of the number of bits of constellation point correspondence in the said modulation.
4. method as claimed in claim 3 is characterized in that, the index quantity in the said index-group is the half the of the corresponding number of bits of constellation point in the said modulation.
5. like the described method of arbitrary claim in the claim 1 to 4; It is characterized in that, said packet is carried out interweaving method be: the Bit Interleave that index in the said packet is identical with the sequence number of index in said first index sequence or second index sequence is to corresponding said first index sequence of said sequence number or the position of the indication of the index in second index sequence.
6. like the described method of arbitrary claim in the claim 1 to 4, it is characterized in that the transmission of said employing first index sequence and adopt being transmitted as of second index sequence following any one or its combination in any:
The first transmission of said packet and re-transmission for the first time;
Retransmit the first time of said packet and retransmit for the second time;
Retransmit the second time of said packet and retransmit for the third time.
7. an interleaver is characterized in that, comprising:
Receiver module is used to receive the packet of input;
Processing module is used for adjacent twice transmission to packet, and the packet that said receiver module is received according to first index sequence interweaves and exports; Packet is interweaved and export according to second index sequence; Said first index sequence and second index sequence obtain through following formula: j
k=s * floor (m
k/ s)+(m
k+ N
Cbps-floor (d * m
k/ N
Cbps)+n)
Mod (s)
Wherein: m
k=(N
Cbps/ d) * k
Modd+ floor (k/d), N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1.
8. interleaver as claimed in claim 7 is characterized in that, said interleaver also comprises: memory module is used to preserve said first index sequence and second index sequence and exports to said processing module.
9. interleaver as claimed in claim 7 is characterized in that, said interleaver also comprises: acquisition module is used to obtain said first index sequence and second index sequence and exports to said processing module.
10. a communicator is characterized in that, comprising:
Interleaver is used for adjacent twice transmission to packet, packet is interweaved and exports according to first index sequence; Packet is interweaved and export according to second index sequence; Said first index sequence and second index sequence obtain through following formula:
j
k＝s×floor(m
k/s)+(m
k+N
cbps-floor(d×m
k/N
cbps)+n)
mod(s)；
Wherein: m
k=(N
Cbps/ d) * k
Modd+ floor (k/d), N
CbpsBe the bit number in the said packet; K is 0 to N
Cbps-1 integer is represented the index of each bit in the said packet; D is the said matrix column number that interweaves; S is the index quantity in the index-group in each index sequence; N is 0 or positive integer, the difference of two n that when obtaining said first index sequence and second index sequence, are provided with respectively divided by the value of the remainder of s between 1 to s-1;
Modulation module is used for the bit of said interleaver output is modulated.
11. communicator as claimed in claim 10 is characterized in that, said interleaver comprises determination module, and the corresponding number of bits of modulation constellation point that is used for carrying out according to said modulation module is confirmed the index quantity in the said index-group.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710112478A CN101335691B (en) | 2007-06-28 | 2007-06-28 | Data transmission method, interweaver and communication apparatus |
| PCT/CN2008/071424 WO2009000203A1 (en) | 2007-06-28 | 2008-06-24 | Data transmission method, interleaver and communication device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710112478A CN101335691B (en) | 2007-06-28 | 2007-06-28 | Data transmission method, interweaver and communication apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101335691A CN101335691A (en) | 2008-12-31 |
| CN101335691B true CN101335691B (en) | 2012-09-12 |
Family
ID=40185199
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710112478A Expired - Fee Related CN101335691B (en) | 2007-06-28 | 2007-06-28 | Data transmission method, interweaver and communication apparatus |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101335691B (en) |
| WO (1) | WO2009000203A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215528B (en) * | 2010-04-06 | 2016-03-30 | 中兴通讯股份有限公司 | The transmission of HARQ parameter, acquisition methods and HSDPA system |
| RU2458914C1 (en) | 2011-02-01 | 2012-08-20 | Лев Давидович Раснецов | Homo- and hetero-polyamino acid fullerene c60 derivatives, method for preparing them and based pharmaceutical compositions |
| CN109787707B (en) * | 2017-11-10 | 2021-05-18 | 华为技术有限公司 | Interleaving method and interleaving apparatus |
| CN116318552B (en) * | 2023-03-15 | 2023-09-22 | 归芯科技(深圳)有限公司 | Interleaving or de-interleaving method for Turbo code, device, communication chip and device thereof |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1599261A (en) * | 2004-08-03 | 2005-03-23 | 北京交通大学 | Design of interleaving apparatus set for asynchronous channel multiplex |
| WO2006067972A1 (en) * | 2004-12-21 | 2006-06-29 | Matsushita Electric Industrial Co., Ltd. | Interleave apparatus and interleave method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3869731B2 (en) * | 2002-01-17 | 2007-01-17 | 株式会社三井ハイテック | Method for manufacturing amorphous laminated core |
| JP2004040232A (en) * | 2002-06-28 | 2004-02-05 | Matsushita Electric Ind Co Ltd | Wireless communication system, wireless transmission apparatus, and wireless reception apparatus |
| CN1832392A (en) * | 2005-03-11 | 2006-09-13 | 松下电器产业株式会社 | Data retransmit method and equipment in multi-input, multi-output system |
| CN1917418A (en) * | 2005-08-19 | 2007-02-21 | 北京三星通信技术研究有限公司 | Equipment and method for mapping variable sub carriers |
-
2007
- 2007-06-28 CN CN200710112478A patent/CN101335691B/en not_active Expired - Fee Related
-
2008
- 2008-06-24 WO PCT/CN2008/071424 patent/WO2009000203A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1599261A (en) * | 2004-08-03 | 2005-03-23 | 北京交通大学 | Design of interleaving apparatus set for asynchronous channel multiplex |
| WO2006067972A1 (en) * | 2004-12-21 | 2006-06-29 | Matsushita Electric Industrial Co., Ltd. | Interleave apparatus and interleave method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101335691A (en) | 2008-12-31 |
| WO2009000203A1 (en) | 2008-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1572067B (en) | Method and apparatus implementing retransmission in a communication system providing h-arq | |
| CN100514900C (en) | Transmitting apparatus with bit arrangement method | |
| US7280606B2 (en) | Apparatus and method for transmitting/receiving data in a CDMA mobile communication system | |
| US8369427B2 (en) | Method and apparatus for symbol transmission in an OFDM mobile communication system | |
| KR100539862B1 (en) | Method and apparatus for transporting and receiving data in cdma mobile system | |
| JP3701263B2 (en) | Data transmission / reception apparatus and method in CDMA mobile communication system | |
| JP3753677B2 (en) | Data transmission / reception apparatus and method in CDMA mobile communication system | |
| US9071402B2 (en) | Selection of retransmission settings for HARQ in WCDMA and LTE networks | |
| JP5399495B2 (en) | Symbol mapping apparatus and method | |
| KR101191196B1 (en) | Method of encoding and decoding using a parity check matrix | |
| US7028230B2 (en) | Partially filling block interleaver for a communication system | |
| US8446811B2 (en) | Constellation re-arrangement and bit grouping | |
| US8009758B2 (en) | Apparatus and method for channel-interleaving and channel-deinterleaving data in a wireless communication system | |
| KR20040094665A (en) | Hydrid arq method for packet data transmission | |
| CN101867441A (en) | Star map mapping method | |
| CN101335691B (en) | Data transmission method, interweaver and communication apparatus | |
| EP3609080B1 (en) | Interleaver for open fec (ofec) | |
| JP2013081247A (en) | Apparatus and method for transmitting data in wireless communication system | |
| KR20030064181A (en) | Apparatus and method for data signal and receiving make use of reliability between bits and symbols in cdma mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120912 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |