CN102412937A - Data interleaving method and device - Google Patents
Data interleaving method and device Download PDFInfo
- Publication number
- CN102412937A CN102412937A CN2011104090465A CN201110409046A CN102412937A CN 102412937 A CN102412937 A CN 102412937A CN 2011104090465 A CN2011104090465 A CN 2011104090465A CN 201110409046 A CN201110409046 A CN 201110409046A CN 102412937 A CN102412937 A CN 102412937A
- Authority
- CN
- China
- Prior art keywords
- interweaves
- pattern
- interleavers
- interleaver
- 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.)
- Granted
Links
Landscapes
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a data interleaving method and a data interleaving device, which are used for improving the interleaving performance of an interleaving process. In the invention, different interleaving patterns are respectively configured for two or more interleavers; and in the process of interleaving, the two or more interleavers perform interleaving operation on input data respectively according to the configured interleaving patterns thereof. By adopting the technical scheme of the invention, for parts (different in target positions) of data (same in defined initial positions) in two or more interleaving patterns, two bits (same in input sequence) after respectively being interleaved by the two or more interleavers can produce an interleaving gain, namely, the distance between the two bits is changed, thereby improving the interleaving performance of the interleaving process.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of deinterleaving method and device of data.
Background technology
HSDPA (High Speed Downlink Packet Access; The high speed downlink packet access) the descending Radio Transmission Technology as a kind of enhancing was introduced in 3GPP (3rd Generation Partnership Project in 2002; Third generation collaborative project) the 5th edition (Release 5; Abbreviation " R5 ") (Release 6 in and 3GPP the 6th edition; Abbreviation " R6 ") carried out further improvement in; Because adopted link adaptation techniques based on Adaptive Modulation and Coding, based on HARQ (the Hybrid automatic repeat request of physical layer retransmission and soft merging; Mix automatic repeat requests), quick key technology such as multi-user's packet scheduling, the short frame of 2ms, have remarkable advantages such as spectrum efficiency height, downlink transfer speed is big, propagation delay time is little, thereby can provide effective twelve Earthly Branches to hold Packet data service.
E-DCH (Enhanced Dedicated Transport Channel; The enhanced uplink dedicated channel) is called HSUPA (High Speed Uplink Packet Access again; High speed uplink packet inserts); It is the Radio Transmission Technology of 3GPP another enhancing of introducing in Release 6 after in Release 5, introducing HSDPA; Owing to adopted key technologies such as the up fast packet scheduling based on Node B (Node B), quick HARQ and the short frame of 2ms; E-DCH has remarkable advantages such as spectrum efficiency height, uplink speed is fast, propagation delay time is little, thereby supports that more effectively real-time game is professional, grouping data services such as file is uploaded, broadband multimedia services are used.
At present; At HS-DSCH (High Speed Downlink Shared Channel; High speed descending sharing channel) in the code multiplexing process; It is fast that the 2ms TTI of HS-DSCH (Transmission Time Interval, Transmission Time Interval) carries 1 data at most, and each HS-DSCH data block of the multiplexing chain of input coding is through being mapped to the HS-DSCH subframe of 3 time slots behind the code multiplexing.The code multiplexing process of HS-DSCH mainly comprises following several steps: transmission block increases the cutting apart of cyclic redundancy check information, bit scramble, encoding block, chnnel coding, HARQ (Hybrid automatic repeat request; Mix automatic repeat requests), physical channel segmentation, interweave, 16QAM (Quadrature Amplitured Modulation, quadrature amplitude modulation) constellation reorganization, physical channel mapping.
When in the code multiplexing process of HS-DSCH, interweaving, the interleaving process of each physical channel is independent.The bit sequence (being data) that is input to block interleaver is u
P, 1, u
P, 2, u
P, 3..., u
P, U, wherein p is physical channel (PhCH, a Physical Channel) number; If the modulation system that the code multiplexing process of HS-DSCH adopts is the 16QAM modulation; U=1920 then adopts the interleaver of two same sizes, is R2 * C2=32 * 30 at present; Be line number R2=32, the interleaver of columns C2=30.The bit sequence of physical channel segmentation module output is cut apart bit u in twos between interleaver
P, kAnd u
P, k+1Send to first interleaver, bit u
P, k+2And u
P, k+3Send to second interleaver, the output bit sequence of two interleavers combines according to the order of distributing in twos again, is specially bit v
P, kAnd v
P, k+1From the output of first interleaver, and bit v
P, k+2And v
P, k+3From second interleaver output, k mod 4=1 here, promptly k is 1 divided by 4 remainders, and k is a positive integer, and later bit sequence is by that analogy.
Thus it is clear that, when adopting the 16QAM modulation system, adopt the interleaver of two same sizes (R2 * C2=32 * 30), from the bit v of first interleaver output
P, kAnd v
P, k+1Because of having the gain that interweaves, from the bit v of second interleaver output through interweaving of first interleaver
P, k+2And v
P, k+3Because of having the gain that interweaves through interweaving of second interleaver.But because two interleavers interweave according to identical rule, so v
P, k+2With v
P, kBetween the gain that do not interweave, v
P, k+3With v
P, k+1Between the gain that do not interweave, that is, and through after interweaving, u
P, kAnd u
P, k+2Distance do not change.Also exist in the interlace operation of similar problem in E-DCH.
Summary of the invention
The embodiment of the invention provides a kind of deinterleaving method and device of data, in order to improve the felt properties of interleaving process.
In order to solve the problems of the technologies described above, the embodiment of the invention provides a kind of deinterleaving method of data, may further comprise the steps:
For two or more interleavers dispose the different patterns that interweaves respectively; And
When interweaving, said two or more interleavers carry out interlace operation according to the pattern that interweaves for its configuration to the input data respectively.
The present invention also provides a kind of interlaced device, and said interlaced device comprises draws together two or more interleavers and configuration module, wherein:
Said interleaver is used for according to the pattern that interweaves of configuration the input data being carried out interlace operation;
Said configuration module is used to said two or more interleavers and disposes the different patterns that interweaves respectively.
The technical scheme that adopts the embodiment of the invention to provide; In two or more patterns that interweave; The target location different portions of the identical data of definition initial position, identical two bits of input sequence through after the interweaving of two or more interleavers, can produce the gain that interweaves respectively; Promptly variation has taken place in the distance of these two bits, thereby can improve the felt properties of interleaving process.
Description of drawings
The interweave flow chart of Fig. 1 in first interleaver, carrying out in the embodiment of the invention;
Fig. 2 is the interlaced device block diagram of the embodiment of the invention.
Embodiment
The embodiment of the invention is an example to be applied in HS-DSCH and E-DCH, but is not limited to be applied in the code multiplexing process of HS-DSCH and E-DCH, and other process or device that relates to a plurality of interleavers is all similar with it.
Below in conjunction with accompanying drawing the embodiment of the invention is done description further.
Embodiment one
In embodiment one; Code multiplexing process with the HS-DSCH that adopts the 16QAM modulation is an example; In this process, adopt the interleaver of two same sizes that input bit is interweaved, these two interleavers are R2 * C2=32 * 30; Input bit is divided into the two-way bit sequence, bit u in twos between these two interleavers
P, kAnd u
P, k+1Send to first interleaver, bit u
P, k+2And u
P, k+3Send to second interleaver, the output bit sequence of two interleavers combines according to the order of distributing in twos again, is specially bit v
P, kAnd v
P, k+1From the output of first interleaver, and bit v
P, k+2And v
P, k+3From second interleaver output, k mod4=1 here, later bit sequence is by that analogy.
In embodiment one; For these two interleavers dispose the different patterns that interweaves respectively, wherein, the pattern that respectively interweaves is an example only the initial position of input bit sequence is defined into the target location by row; In concrete the realization; Interleaver adopts, and the pattern that interweaves can be defined into the initial position of input bit sequence the target location or by cell the initial position of input bit sequence is defined into the target location by row by row, and in embodiment one, the pattern that interweaves of first interleaver is as shown in table 1:
Table 1
If the list entries u of first interleaver
P, 1, u
P, 2, u
P, 3..., u
P, UAfter the exchange, the filtering filling bit is from the first interleaver output sequence v between in first interleaver, being listed as
P, 1, v
P, 2..., v
P, UThe interleaving process that in first interleaver, carries out is as shown in Figure 1, may further comprise the steps:
Step S101 is with input bit sequence u
P, 1, u
P, 2, u
P, 3..., u
P, UY from the 0th row, the 0th row
P, 1Beginning writes matrix R2 * C2 line by line;
This matrix column from left to right be numbered 0,1,2 ..., C2-1; The row of this matrix is numbered 0,1,2 from top to bottom ..., R2-1.Matrix R2 * the C2 that writes completion is:
Wherein, y
P, k=u
p, k, k=1,2 ..., U; If R2 * C2＞U, then at k=U+1, U+2 ..., during R2 * C2, in this matrix, add filling bit, even y
P, k=0 perhaps makes y
P, k=1.After exchanging according to the pattern that interweaves, this filling bit of deletion in the output sequence of matrix.In embodiment one, because in HSDPA (High speed downlink packet access, high speed downlink packet inserts), for 16QAM, for each road interleaver, the length of list entries is 32 * 30, therefore without filling bit.
Step S102 is according to the pattern that interweaves shown in the table 1<p2 (j)>
J ∈ 0,1 ..., C2-1}Row exchange between this matrix is listed as;
Wherein P2 (j) is the initial position of j exchange row.Bit after this row exchange is y '
P, k, and the matrix after this row exchange is:
Step S103 pursues row output to the bit that exchanges the back matrix.
Bit through exchange between R2x C2 matrix column after, by the row output sequence, the input bit y during promptly corresponding k＞U
P, kBeing output as bit is y '
P, kThe output bit sequence is v
P, 1, v
P, 2..., v
P, U, v wherein
P, 1For the subscript k that exports is minimum bit y '
P, k, v
P, 2For the subscript k that exports is time little bit y '
P, k, and the like.
The interleaving process that carries out in the interleaving process that in second interleaver, carries out and first interleaver is identical, only is the pattern difference that interweaves that accordings to.Behind second interleaved sequence of first interleaved sequence that obtains the output of first interleaver and the output of second interleaver, first interleaved sequence and second interleaved sequence are combined according to the order of distributing in twos.
Because in the present embodiment, only require that first interleaver is different with the pattern that interweaves that second interleaver adopts, therefore; In two patterns that interweave; (for embodiment one, promptly for the corresponding target location different portions of initial position of exchange row in two patterns that interweave, identical two bits of input sequence are respectively through after the interweaving of two interleavers for the target location different portions of the identical data of definition initial position; Can produce the gain that interweaves); Identical two bits of input sequence through after the interweaving of two interleavers, can produce the gain that interweaves respectively, and promptly variation has taken place the distance of these two bits.For example, in the pattern that interweaves that first interleaver adopts, initial position is that the target location of 0 row still is 0; And in the pattern that interweaves that second interleaver adopts, initial position is that the target location of 0 row is 30, and is visible; When the bit that the bit and second interleaver of the output of first interleaver are exported combines; The initial position of two interleavers output be 0 be listed in interweave after, variation has taken place in distance, has produced the gain that interweaves.
In the present embodiment; The pattern that interweaves that two interleavers are adopted does not need concrete qualification; But, in order all to have the gain that interweaves between the bit that makes two interleaver outputs, in these two the different patterns that interweave; Should guarantee the row that each initial position is identical, its target location is all inequality as far as possible.
And because the pattern that interweaves that two interleavers are adopted does not have concrete the qualification; Therefore; The storage overhead that brings in order to reduce storage to interweave pattern; In the present embodiment, can only preserve the pattern that interweaves that an interleaver adopts, and be used as the pattern that interweaves that another interleaver adopts with the distortion of this pattern that interweaves.In embodiment one; The pattern that interweaves that first interleaver adopts is the pattern that interweaves shown in the table 1; And the pattern that interweaves that second interleaver adopts can obtain according to the distortion of the pattern that interweaves shown in the table 1; The mode of carrying out this distortion has a lot, and the pattern that interweaves shown in several kinds of mode his-and-hers watches 1 below for example adopting is out of shape:
Mode one
The pattern that interweaves of second interleaver is the backward of the pattern that interweaves of first interleaver, and then the pattern that interweaves shown in the table 1 being carried out corresponding deformation, to obtain the pattern that interweaves of second interleaver as shown in table 2:
Table 2
Mode two
Generating the interweaving during pattern of second interleaver, earlier the pattern that interweaves of first interleaver is being carried out backward and arrange, the first half and latter half exchange of the pattern that interweaves after again backward being arranged, the pattern that interweaves of second interleaver that then obtains is as shown in table 3:
Table 3
Mode three
The pattern that interweaves of second interleaver is that first half and the latter half of the pattern that interweaves of first interleaver exchanges, and then the pattern that interweaves shown in the table 1 being carried out corresponding deformation, to obtain the pattern that interweaves of second interleaver as shown in table 4:
Table 4
It is thus clear that; Because the pattern that interweaves that obtains according to above-mentioned variety of way is on the basis of the pattern that interweaves shown in the table 1, to obtain through simply handling to be out of shape; Do not need other buffer memory to store this pattern that interweaves, saved storage overhead, and; Because this deformation process is very simple, can't increase the complexity of interleaving treatment because of this deformation process.
When concrete the realization, can not be out of shape another pattern that interweaves of generation yet, but directly preserve two patterns that interweave according to the pattern of storing that interweaves, these two patterns that interweave can dispose as required, as long as guarantee that two patterns that interweave are different.For example, the pattern that interweaves that makes second interleaver is a random alignment of the pattern that interweaves of first interleaver, i.e. 1～30 random alignment, but should guarantee that two patterns that interweave are inequality.Under the situation of two patterns that interweave of direct preservation, need to increase certain storage overhead, but owing to the required memory space of intersection chart sample body is little, therefore, the storage overhead of its increase can not cause the bigger burden of system yet.
Embodiment two
In embodiment two; Code multiplexing process with the HS-DSCH that adopts the 64QAM modulation is an example; In this process, adopt the interleaver of three same sizes that input bit is interweaved, these three interleavers are R2 * C2=32 * 30; Input bit is divided into three tunnel sequences, bit u between these three interleavers
P, kAnd u
P, k+1Send to first interleaver, bit u
P, k+2And u
P, k+3Send to second interleaver, bit u
P, k+4And u
P, k+5Send to the 3rd interleaver, each road sequence interweaves respectively, and the output bit sequence of three interleavers combines according to the order of distributing again, is specially bit v
P, kAnd v
P, k+1From the output of first interleaver, bit v
P, k+2And v
P, k+3From the output of second interleaver, bit v
P, k+4And v
P, k+5From the output of first interleaver, later bit sequence by that analogy.
In embodiment two, same, as long as guarantee that the pattern that interweaves of each interleaver employing is inequality; So; For the corresponding target location different portions of the initial position of exchange row in any two patterns that interweave in three patterns that interweave, identical two bits of input sequence through after the interweaving of two interleavers, can produce the gain that interweaves respectively; Situation compared with each interleaver employing same interlace pattern can obtain the effect that better interweaves.
Thus it is clear that, when adopting two or more interleavers to interweave,, just can obtain the effect that better interweaves as long as adopt the mutually different pattern that interweaves.In addition, if guarantee all to exist between each bit the gain that interweaves, need guarantee that then data definition that should be as far as possible that initial position is identical is to different target locations in this two or more different pattern that interweaves.
Embodiment three
In embodiment three; E-DCH to adopt the 4PAM modulation is an example; In this process; Adopting the identical size of two-way is the interleaver of R2x30, wherein the smallest positive integral of R2 for satisfying
.Input bit gets into the two-way interleaver successively.u
P, kGet into first via interleaver, u
P, k+1Get into the second road interleaver.Through after the interweaving of two-way interleaver, read bit from two interleavers successively and export, be i.e. v
P, kFrom first interleaver, v
P, k+1From second interleaver, wherein k mod 2=1.Such as a length is 60 bit sequence, and its index is followed successively by: 1,2 ..., 60, then wherein index is { 1,3,5,7,9,11,13,15,17,19,21,23; 25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55; 57, the sequence of 59} gets into first interleaver, and index is { 2,4,6,8,10,12,14,16,18,20,22,24,26,28; 30,32,34,36,38,40,42,44,46,48,50,52,54,56,58, the bit of 60} gets into the second road interleaver.
If two interleavers adopt same interlace patterns as shown in table 1, then through after the interweaving of first via interleaver, the corresponding index of output bit is: { 1,41,21,11,31,51,7,27,47,17,37,57,3,23,43,13; 33,53,9,29,49,39,19,59,25,5,15,45,55,35}, through after the interweaving of the second road interleaver, the corresponding index of output bit is: { 2,42,22; 12,32,52,8,28,48,18,38,58,4,24,44,14,34,54,10,30,50; 40,20,60,26,6,16,46,56,36}, then, the index of the bit sequence that obtains after the output bit of two interleavers combined is: { 1,2,41,42,21,22,11,12; 31,32,51,52,7,8,27,28,47,48,17,18,37,38,57,58,3,4; 23,24,43,44,13,14,33,34,53,54,9,10,29,30,49,50,39; 40,19,20,59,60,25,26,5,6,15,16,45,46,55,56,35,36}.
It is thus clear that through after the interweaving of two interleavers, the list entries index is the gain that do not interweave between the input bit of k and k+1, that is, the list entries index is that 1,2 bit, list entries index are the gain that all do not interweave of 41,42 ratio top grade.
And if make first interleaver adopt the pattern that interweaves as shown in table 1, and second interleaver adopts the pattern that interweaves as shown in table 2, and makes that aforesaid length is that the index of 60 bit sequence is that the bit of odd number is imported first interleaver, then the index of the output bit sequence of first interleaver is { 1,41,21,11,31,51,7,27; 47,17,37,57,3,23,43,13,33,53,9; 29,49,39,19,59,25,5,15,45,55,35}; And this length is the index of 60 bit sequence is that the bit of even number is imported second interleaver, and then the index of the output bit sequence of second interleaver is { 36,56,46,16,6,26,60,20,40,50; 30,10,54,34,14,44,24,4,58,38; 18,48,28,8,52,32,12,22,42,2}.The index of the bit sequence that then, obtains after the output bit of two interleavers is combined is: { 1,36,41,56,21,46,11,16,31,6,51,26,7,60,27; 20,47,40,17,50,37,30,57,10,3,54,23,34,43,14; 13,44,33,24,53,4,9,58,29,38,49,18,39,48,19; 28,59,8,25,52,5,32,15,12,45,22,55,42,35,2}.
It is thus clear that two interleavers are interweaving during pattern shown in employing table 1 and the table 2 respectively, the bit that index was adjacent when each was imported has all interweaved out, can obtain bigger the interweave gain and the effect that better interweaves.When concrete the realization, as long as make two interleavers adopt the different patterns that interweaves respectively.
Interlaced device in the embodiment of the invention is as shown in Figure 2, comprises two or more interleavers and configuration module, wherein:
These two or more interleavers are used for according to the pattern that interweaves of configuration the input data being carried out interlace operation;
Configuration module is used to these two or more interleavers and disposes the different patterns that interweaves respectively.
In this configuration module, can comprise second memory cell, be used for saving as simultaneously the different pattern that interweaves that these two or more interleavers dispose respectively.
But the storage overhead that brings in order to reduce storage to interweave pattern; In this interlaced device; Can not save as the different pattern that interweaves that these two or more interleavers dispose respectively simultaneously, but only save as the pattern that interweaves of one of them interleaver configuration, therefore; This configuration module can comprise first memory cell and dispensing unit, wherein:
First memory cell is used to save as first of one of them interleaver configuration pattern that interweaves;
Dispensing unit is used for generating the different with it patterns that interweaves and disposing to other interleavers according to first pattern that interweaves that first memory cell is preserved.
In sum; The technical scheme that adopts the embodiment of the invention to provide, in two or more patterns that interweave, the target location different portions of the data that the definition initial position is identical; Identical two bits of input sequence are respectively through after the interweaving of two or more interleavers; Can produce the gain that interweaves, promptly variation has taken place in the distance of these two bits, thereby can improve the felt properties of interleaving process.And this scheme realizes simple, can increase storage overhead simultaneously.
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 (10)
1. the deinterleaving method of data is characterized in that, may further comprise the steps:
For two or more interleavers dispose the different patterns that interweaves respectively; And
When interweaving, said two or more interleavers carry out interlace operation according to the pattern that interweaves for its configuration to the input data respectively.
2. the method for claim 1; It is characterized in that; Saidly dispose the different patterns that interweaves respectively and specifically comprise for two or more interleavers: be one of them interleaver configuration first pattern that interweaves earlier, and dispose to other interleavers according to this first different with it pattern that interweaves of pattern generation that interweaves.
3. method as claimed in claim 2 is characterized in that, the pattern that interweaves of said generation comprises: this first pattern that interweaves is carried out backward and arranges the pattern that interweaves obtain.
4. method as claimed in claim 2 is characterized in that, the pattern that interweaves of said generation comprises: earlier this first pattern that interweaves is carried out backward and arranges, the pattern that interweaves that the first half of the pattern that interweaves after again backward being arranged and latter half exchange obtain.
5. method as claimed in claim 2 is characterized in that, the pattern that interweaves of said generation comprises: with this first interweave pattern first half and latter half exchange the pattern that interweaves that obtains.
6. like the described method of arbitrary claim in the claim 1 to 5, it is characterized in that in the pattern that respectively interweaves, the data definition that initial position is identical is to different target locations.
7. like the described method of arbitrary claim in the claim 1 to 5, it is characterized in that said interlace operation carries out in the code multiplexing process of high speed descending sharing channel or enhanced uplink dedicated channel.
8. an interlaced device is characterized in that, said interlaced device comprises two or more interleavers and configuration module, wherein:
Said interleaver is used for according to the pattern that interweaves of configuration the input data being carried out interlace operation;
Said configuration module is used to said two or more interleavers and disposes the different patterns that interweaves respectively.
9. device as claimed in claim 8 is characterized in that said configuration module also comprises first memory cell and dispensing unit, wherein:
Said first memory cell is used to save as first of one of them interleaver configuration pattern that interweaves;
Said dispensing unit is used for generating the different with it patterns that interweaves and disposing to other interleavers according to first pattern that interweaves that said first memory cell is preserved.
10. device as claimed in claim 8 is characterized in that said configuration module also comprises second memory cell, is used for saving as simultaneously the different pattern that interweaves that said two or more interleavers dispose respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110409046.5A CN102412937B (en) | 2007-02-02 | 2007-02-02 | Data interleaving method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110409046.5A CN102412937B (en) | 2007-02-02 | 2007-02-02 | Data interleaving method and device |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100033221A Division CN101237440B (en) | 2007-02-02 | 2007-02-02 | A data interweaving method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102412937A true CN102412937A (en) | 2012-04-11 |
| CN102412937B CN102412937B (en) | 2014-04-16 |
Family
ID=45914807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110409046.5A Active CN102412937B (en) | 2007-02-02 | 2007-02-02 | Data interleaving method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102412937B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019192620A1 (en) * | 2018-04-06 | 2019-10-10 | Mediatek Inc. | Channel multiplexing within interlace for new radio unlicensed spectrum operation |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1639986A (en) * | 2001-11-19 | 2005-07-13 | 日本电气株式会社 | Interleaving order generator, interleaver, Turbo encoder, and Turbo decoder |
| CN1653739A (en) * | 2002-04-08 | 2005-08-10 | Ip无线有限公司 | Arrangement and method for channel mapping in a wireless communication system |
| US6975584B1 (en) * | 2000-09-29 | 2005-12-13 | Qualcomm, Incorporated | Communication system method and apparatus |
| US20060002486A1 (en) * | 2004-07-01 | 2006-01-05 | Airgo Networks, Inc. | Advanced MIMO interleaving |
| CN1890934A (en) * | 2003-12-08 | 2007-01-03 | 株式会社建伍 | Device and method for correcting a data error in communication path |
-
2007
- 2007-02-02 CN CN201110409046.5A patent/CN102412937B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6975584B1 (en) * | 2000-09-29 | 2005-12-13 | Qualcomm, Incorporated | Communication system method and apparatus |
| CN1639986A (en) * | 2001-11-19 | 2005-07-13 | 日本电气株式会社 | Interleaving order generator, interleaver, Turbo encoder, and Turbo decoder |
| CN1653739A (en) * | 2002-04-08 | 2005-08-10 | Ip无线有限公司 | Arrangement and method for channel mapping in a wireless communication system |
| CN1890934A (en) * | 2003-12-08 | 2007-01-03 | 株式会社建伍 | Device and method for correcting a data error in communication path |
| US20060002486A1 (en) * | 2004-07-01 | 2006-01-05 | Airgo Networks, Inc. | Advanced MIMO interleaving |
Non-Patent Citations (2)
| Title |
|---|
| 马飞，谢建菲: "通信系统的交织器技术", 《兵工自动化》 * |
| 高晓飞: "Turbo编码中的交织技术", 《信息通信》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019192620A1 (en) * | 2018-04-06 | 2019-10-10 | Mediatek Inc. | Channel multiplexing within interlace for new radio unlicensed spectrum operation |
| US10868629B2 (en) | 2018-04-06 | 2020-12-15 | Mediatek Inc. | Channel multiplexing within interlace for new radio unlicensed spectrum operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102412937B (en) | 2014-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5567219B2 (en) | Feedback information transmission method and user equipment | |
| JP3748550B2 (en) | Interleaving apparatus and method for symbol mapping in high speed downlink packet access mobile communication system | |
| KR101498052B1 (en) | Method for multiplexing data information and control information in wireless communication system | |
| CN102792624B (en) | Method for high-efficient implementation of de-rate matching including HARQ combining for LTE | |
| CN101960736B (en) | Method for multiplexing data and control information | |
| CN103354492B (en) | Method for multiplexing data and control information | |
| CN101237440B (en) | A data interweaving method and device | |
| CN101330351B (en) | Method for mapping bit with priority based on circulation caching speed matching | |
| CN102447521B (en) | A kind of dissociation rate matching method and device | |
| CN100578998C (en) | High-speed descending sharing channel coding multiplexing method and system | |
| CN101330671A (en) | Device and method for transmitting broadcast information | |
| CN102546082A (en) | Rate de-matching method and device | |
| CN104753653B (en) | A kind of method, apparatus and reception side apparatus of solution rate-matched | |
| CN101345738A (en) | Mapping and interweaving method and system for digital television ground broadcast signal | |
| CN101944972B (en) | Coding and decoding method, device and communication system | |
| CN101621363B (en) | Bit reordering method between multiple symbols and system using same | |
| CN102412937B (en) | Data interleaving method and device | |
| CN101267211A (en) | Data interweaving method and device | |
| CN101242234B (en) | Data interweaving method and device | |
| CN101784077B (en) | TD_HSUPA uplink data processing system and method | |
| CN102340319A (en) | Turbo code rate matching method and device | |
| CN103840912B (en) | Method for rate dematching of LTE/LTE-A system traffic channel | |
| CN102227104B (en) | Data interleaving method and apparatus thereof | |
| CN102064910A (en) | Method and device of bit collection and interlacing for mixed automatic retransmission request | |
| CN102136885A (en) | Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE) |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20120411 Assignee: Apple Computer, Inc. Assignor: Huawei Technologies Co., Ltd. Contract record no.: 2015990000755 Denomination of invention: A data interweaving method and device Granted publication date: 20140416 License type: Common License Record date: 20150827 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model |