Method and apparatus of improved circular buffer rate matching for turbo-coded MIMO-OFDM wireless systems
Methods and apparatus for determining the starting points of redundancy version transmissions in a circular rate matching operation. At least one block of information bits to be transmitted are encoded to generate a plurality of coded bits, which are then segmented into a plurality of sub-blocks of coded bits. Each of the sub-blocks of coded bits is interleaved by using a certain interleaver. The interleaved coded bits of the plurality of sub-blocks are collected and filled into a circular buffer having a plurality of redundancy versions in the circular buffer, with each redundancy version corresponding to a starting bit index in the circular buffer. For each transmission, a subset of bits are selected from the circular buffer by selecting a redundancy version from among the plurality of redundancy version. The selected subset of bits are modulated by using a certain modulation scheme, and are transmitted via at least one antenna. The redundancy versions of the circular being determined such that in at least one pair of redundancy versions, the number of bits between the starting point of a first redundancy version and the starting point of a second redundancy version is not divisible by at least one modulation order.
1. A method for transmitting data, the method comprising the steps of:
encoding at least one block of information bits to be transmitted to generate a plurality of coded bits;
segmenting the plurality of coded bits into a plurality of sub-blocks of coded bits;
interleaving each of the sub-blocks of coded bits by using a certain interleaver;
collecting the interleaved coded bits from the plurality of sub-blocks and writing the collected bits into a circular buffer;
determining a plurality of redundancy versions in the circular buffer, with each redundancy version corresponding to a starting bit index in the circular buffer;
selecting a subset of bits in the circular buffer by selecting a redundancy version from among the plurality of redundancy version;
modulating the subset of bits by using a certain modulation scheme; and
transmitting the modulated bits via at least one antenna, with, in at least one pair of redundancy versions, the number of bits between the starting point of a first redundancy version and the starting point of a second redundancy version being not divisible by the modulation order of the certain modulation scheme.
2. The method of claim 1 , comprised of:
determining four redundancy versions in the circular buffer; and
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version, R┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined such that Δ′(j,p)=[R×((24×j)+2)]−[R×((24×p)+2)] is not divisible by 4 and 6 for at least one pair of j and p, and j=0, 1, . . . , 3, p=0, 1, . . . , 3.
3. The method of claim 1 , comprised of:
determining four redundancy versions in the circular buffer; and
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24 ×j )+2)+δ RV ( j ),
where j is the index of the redundancy version, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon Δ′(j,p)=[R×((24×j)+2)]−[R×((24×p)+2)] for at least one pair of j and p, and j=0, 1, . . . , 3, p=0, 1, . . . , 3, with:
when the Quadrature phase-shift keying (QPSK) modulation is used for modulating the subset of bits, δ RV (j) being set to be zero;
when the 16-Quadrature amplitude modulation (QAM) is used for modulating the subset of bits:
when Δ′(j,p)/4 is an integer number, δ RV (j) being an integer selected from a set {1, 2, 3}; and
when Δ′(j,p)/4 is not an integer number, δ RV (j) being set to be zero; and
when the 64-Quadrature amplitude modulation (QAM) is used for modulating the subset of bits:
when Δ′(j,p)/6 is an integer number, δ RV (j) being an integer selected from a set {1, 2, 3, 4, 5}; and
when Δ′(j,p)/6 is not an integer number, δ RV (j) being set to be zero.
4. The method of claim 1 , comprised of:
determining four redundancy versions in the circular buffer; and
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×(( G×j )+2),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, and G is an integer that is not divisible by at least one of 4 and 6.
5. The method of claim 1 , comprised of determining a size of the circular buffer, with the size L being a number that is not divisible by at least one modulation order.
6. The method of claim 1 , comprised of interleaving each of the sub-blocks of coded bits by using a row-column interleaver, and for each sub-block:
writing the sub-block of coded bits into the row-column interleaver in a row-by-row manner by starting from the first row and the first column, with the row-column interleaver having C columns and R rows, and the number of coded bits in the sub-block being D;
when the row-column interleaver is not filled up by the coded bits in the sub-block, filling up the row-column interleaver with dummy bits, with the number of dummy bits being Y=R×C−D;
permuting the columns in the row-column interleaver by using a certain pattern;
reading the bits from the row-column interleaver in a column-by-column manner by staring from the first row and the first column; and
removing the dummy bits from the bits that are read from the row-column interleaver.
7. The method of claim 6 , comprised of:
determining four redundancy versions in the circular buffer; and
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, and δ RV (j) is determined in dependence upon the number of dummy bits Y.
8. The method of claim 7 , comprised of the number of dummy bits Y being one of 4, 12, 20 and 28, and δ RV (j) being determined based on the following table:
RV(0), j = 0
RV(1), j = 1
RV(2), j = 2
RV(3), j = 3
Y1
0
0
0
1
Y2
0
0
0
1
Y3
0
0
0
3
Y4
0
0
1
0.
9. The method of claim 1 , comprised of:
determining four redundancy versions in the circular buffer;
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon j and the size of the quadratic permutation polynomial (QPP) interleaver, and δ RV (j)=0 for j=0, and δ RV (j) is determined based upon the following table for j=1, 2, 3:
i
j = 1
j = 2
j = 3
1
0
1
0
2
0
0
3
3
0
5
4
4
3
1
4
5
0
1
0
6
0
0
3
7
0
5
4
8
3
1
4
9
0
1
0
10
0
0
3
11
0
5
4
12
3
1
4
13
0
1
0
14
0
0
3
15
0
5
4
16
3
1
4
17
0
1
0
18
0
0
3
19
0
5
4
20
3
1
4
21
0
1
0
22
0
0
3
23
0
5
4
24
3
1
4
25
0
1
0
26
0
0
3
27
0
5
4
28
3
1
4
29
0
1
0
30
0
0
3
31
0
5
4
32
3
1
4
33
0
1
0
34
0
0
3
35
0
5
4
36
3
1
4
37
0
1
0
38
0
0
3
39
0
5
4
40
3
1
4
41
0
1
0
42
0
0
3
43
0
5
4
44
3
1
4
45
0
1
0
46
0
0
3
47
0
5
4
48
3
1
4
49
0
1
0
50
0
0
3
51
0
5
4
52
3
1
4
53
0
1
0
54
0
0
3
55
0
5
4
56
3
1
4
57
0
1
0
58
0
0
3
59
0
5
4
60
3
1
4
61
0
0
3
62
3
1
4
63
0
0
3
64
3
1
4
65
0
0
3
66
3
1
4
67
0
0
3
68
3
1
4
69
0
0
3
70
3
1
4
71
0
0
3
72
3
1
4
73
0
0
3
74
3
1
4
75
0
0
3
76
3
1
4
77
0
0
3
78
3
1
4
79
0
0
3
80
3
1
4
81
0
0
3
82
3
1
4
83
0
0
3
84
3
1
4
85
0
0
3
86
3
1
4
87
0
0
3
88
3
1
4
89
0
0
3
90
3
1
4
91
0
0
3
92
3
1
4
93
3
1
4
94
3
1
4
95
3
1
4
96
3
1
4
97
3
1
4
98
3
1
4
99
3
1
4
100
3
1
4
101
3
1
4
102
3
1
4
103
3
1
4
104
3
1
4
105
3
1
4
106
3
1
4
107
3
1
4
108
3
1
4
109
3
1
4
110
3
1
4
111
3
1
4
112
3
1
4
113
3
1
4
114
3
1
4
115
3
1
4
116
3
1
4
117
3
1
4
118
3
1
4
119
3
1
4
120
3
1
4
121
3
1
4
122
3
1
4
123
3
1
4
124
3
1
4
125
3
1
4
126
3
1
4
127
3
1
4
128
3
1
4
129
3
1
4
130
3
1
4
131
3
1
4
132
3
1
4
133
3
1
4
134
3
1
4
135
3
1
4
136
3
1
4
137
3
1
4
138
3
1
4
139
3
1
4
140
3
1
4
141
3
1
4
142
3
1
4
143
3
1
4
144
3
1
4
145
3
1
4
146
3
1
4
147
3
1
4
148
3
1
4
149
3
1
4
150
3
1
4
151
3
1
4
152
3
1
4
153
3
1
4
154
3
1
4
155
3
1
4
156
3
1
4
157
3
1
4
158
3
1
4
159
3
1
4
160
3
1
4
161
3
1
4
162
3
1
4
163
3
1
4
164
3
1
4
165
3
1
4
166
3
1
4
167
3
1
4
168
3
1
4
169
3
1
4
170
3
1
4
171
3
1
4
172
3
1
4
173
3
1
4
174
3
1
4
175
3
1
4
176
3
1
4
177
3
1
4
178
3
1
4
179
3
1
4
180
3
1
4
181
3
1
4
182
3
1
4
183
3
1
4
184
3
1
4
185
3
1
4
186
3
1
4
187
3
1
4
188
3
1
4
where i is the interleaver size index, i=1, 2, 3, . . . , 187, 188, and i is determined in dependence upon an interleaver size K based on the following table:
i
K i
1
40
2
48
3
56
4
64
5
72
6
80
7
88
8
96
9
104
10
112
11
120
12
128
13
136
14
144
15
152
16
160
17
168
18
176
19
184
20
192
21
200
22
208
23
216
24
224
25
232
26
240
27
248
28
256
29
264
30
272
31
280
32
288
33
296
34
304
35
312
36
320
37
328
38
336
39
344
40
352
41
360
42
368
43
376
44
384
45
392
46
400
47
408
48
416
49
424
50
432
51
440
52
448
53
456
54
464
55
472
56
480
57
488
58
496
59
504
60
512
61
528
62
544
63
560
64
576
65
592
66
608
67
624
68
640
69
656
70
672
71
688
72
704
73
720
74
736
75
752
76
768
77
784
78
800
79
816
80
832
81
848
82
864
83
880
84
896
85
912
86
928
87
944
88
960
89
976
90
992
91
1008
92
1024
93
1056
94
1088
95
1120
96
1152
97
1184
98
1216
99
1248
100
1280
101
1312
102
1344
103
1376
104
1408
105
1440
106
1472
107
1504
108
1536
109
1568
110
1600
111
1632
112
1664
113
1696
114
1728
115
1760
116
1792
117
1824
118
1856
119
1888
120
1920
121
1952
122
1984
123
2016
124
2048
125
2112
126
2176
127
2240
128
2304
129
2368
130
2432
131
2496
132
2560
133
2624
134
2688
135
2752
136
2816
137
2880
138
2944
139
3008
140
3072
141
3136
142
3200
143
3264
144
3328
145
3392
146
3456
147
3520
148
3584
149
3648
150
3712
151
3776
152
3840
153
3904
154
3968
155
4032
156
4096
157
4160
158
4224
159
4288
160
4352
161
4416
162
4480
163
4544
164
4608
165
4672
166
4736
167
4800
168
4864
169
4928
170
4992
171
5056
172
5120
173
5184
174
5248
175
5312
176
5376
177
5440
178
5504
179
5568
180
5632
181
5696
182
5760
183
5824
184
5888
185
5952
186
6016
187
6080
188
6144.
10. The method of claim 1 , comprised of:
determining four redundancy versions in the circular buffer;
modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM), with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((28 ×j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon j and the size of the quadratic permutation polynomial (QPP) interleaver, and δ RV (j)=0 for j=0, and δ RV (j) is determined based upon the following table for j=1, 2, 3:
i
j = 1
j = 2
j = 3
1
0
1
3
2
0
5
3
3
0
1
1
4
0
0
4
5
0
2
2
6
1
2
1
7
0
2
0
8
3
1
0
9
0
1
3
10
0
1
3
11
0
1
1
12
0
5
0
13
0
1
3
14
0
5
3
15
0
1
1
16
0
0
4
17
0
2
2
18
1
2
1
19
0
2
0
20
3
1
0
21
0
1
3
22
0
1
3
23
0
1
1
24
0
5
0
25
0
1
3
26
0
5
3
27
0
1
1
28
0
0
4
29
0
2
2
30
1
2
1
31
0
2
0
32
3
1
0
33
0
1
3
34
0
1
3
35
0
1
1
36
0
5
0
37
0
1
3
38
0
5
3
39
0
1
1
40
0
0
4
41
0
2
2
42
1
2
1
43
0
2
0
44
3
1
0
45
0
1
3
46
0
1
3
47
0
1
1
48
0
5
0
49
0
1
3
50
0
5
3
51
0
1
1
52
0
0
4
53
0
2
2
54
1
2
1
55
0
2
0
56
3
1
0
57
0
1
3
58
0
1
3
59
0
1
1
60
0
5
0
61
0
5
3
62
0
0
4
63
1
2
1
64
3
1
0
65
0
1
3
66
0
5
0
67
0
5
3
68
0
0
4
69
1
2
1
70
3
1
0
71
0
1
3
72
0
5
0
73
0
5
3
74
0
0
4
75
1
2
1
76
3
1
0
77
0
1
3
78
0
5
0
79
0
5
3
80
0
0
4
81
1
2
1
82
3
1
0
83
0
1
3
84
0
5
0
85
0
5
3
86
0
0
4
87
1
2
1
88
3
1
0
89
0
1
3
90
0
5
0
91
0
5
3
92
0
0
4
93
3
1
0
94
0
5
0
95
0
0
4
96
3
1
0
97
0
5
0
98
0
0
4
99
3
1
0
100
0
5
0
101
0
0
4
102
3
1
0
103
0
5
0
104
0
0
4
105
3
1
0
106
0
5
0
107
0
0
4
108
3
1
0
109
0
5
0
110
0
0
4
111
3
1
0
112
0
5
0
113
0
0
4
114
3
1
0
115
0
5
0
116
0
0
4
117
3
1
0
118
0
5
0
119
0
0
4
120
3
1
0
121
0
5
0
122
0
0
4
123
3
1
0
124
0
5
0
125
3
1
0
126
0
0
4
127
0
5
0
128
3
1
0
129
0
0
4
130
0
5
0
131
3
1
0
132
0
0
4
133
0
5
0
134
3
1
0
135
0
0
4
136
0
5
0
137
3
1
0
138
0
0
4
139
0
5
0
140
3
1
0
141
0
0
4
142
0
5
0
143
3
1
0
144
0
0
4
145
0
5
0
146
3
1
0
147
0
0
4
148
0
5
0
149
3
1
0
150
0
0
4
151
0
5
0
152
3
1
0
153
0
0
4
154
0
5
0
155
3
1
0
156
0
0
4
157
0
5
0
158
3
1
0
159
0
0
4
160
0
5
0
161
3
1
0
162
0
0
4
163
0
5
0
164
3
1
0
165
0
0
4
166
0
5
0
167
3
1
0
168
0
0
4
169
0
5
0
170
3
1
0
171
0
0
4
172
0
5
0
173
3
1
0
174
0
0
4
175
0
5
0
176
3
1
0
177
0
0
4
178
0
5
0
179
3
1
0
180
0
0
4
181
0
5
0
182
3
1
0
183
0
0
4
184
0
5
0
185
3
1
0
186
0
0
4
187
0
5
0
188
3
1
0
where i is the interleaver size index, i=1, 2, 3, . . . , 187, 188, and i is determined in dependence upon an interleaver size K based on the following table:
i
K i
1
40
2
48
3
56
4
64
5
72
6
80
7
88
8
96
9
104
10
112
11
120
12
128
13
136
14
144
15
152
16
160
17
168
18
176
19
184
20
192
21
200
22
208
23
216
24
224
25
232
26
240
27
248
28
256
29
264
30
272
31
280
32
288
33
296
34
304
35
312
36
320
37
328
38
336
39
344
40
352
41
360
42
368
43
376
44
384
45
392
46
400
47
408
48
416
49
424
50
432
51
440
52
448
53
456
54
464
55
472
56
480
57
488
58
496
59
504
60
512
61
528
62
544
63
560
64
576
65
592
66
608
67
624
68
640
69
656
70
672
71
688
72
704
73
720
74
736
75
752
76
768
77
784
78
800
79
816
80
832
81
848
82
864
83
880
84
896
85
912
86
928
87
944
88
960
89
976
90
992
91
1008
92
1024
93
1056
94
1088
95
1120
96
1152
97
1184
98
1216
99
1248
100
1280
101
1312
102
1344
103
1376
104
1408
105
1440
106
1472
107
1504
108
1536
109
1568
110
1600
111
1632
112
1664
113
1696
114
1728
115
1760
116
1792
117
1824
118
1856
119
1888
120
1920
121
1952
122
1984
123
2016
124
2048
125
2112
126
2176
127
2240
128
2304
129
2368
130
2432
131
2496
132
2560
133
2624
134
2688
135
2752
136
2816
137
2880
138
2944
139
3008
140
3072
141
3136
142
3200
143
3264
144
3328
145
3392
146
3456
147
3520
148
3584
149
3648
150
3712
151
3776
152
3840
153
3904
154
3968
155
4032
156
4096
157
4160
158
4224
159
4288
160
4352
161
4416
162
4480
163
4544
164
4608
165
4672
166
4736
167
4800
168
4864
169
4928
170
4992
171
5056
172
5120
173
5184
174
5248
175
5312
176
5376
177
5440
178
5504
179
5568
180
5632
181
5696
182
5760
183
5824
184
5888
185
5952
186
6016
187
6080
188
6144.
11. The method of claim 1 , comprised of interleaving each of the sub-blocks of coded bits by using a quadratic permutation polynomial (QPP) interleaver.
12. A method for receiving data, the method comprising the steps of:
receiving a plurality of blocks of data bits via at least one antenna;
de-modulating the plurality of blocks of data bits by using a certain modulation scheme;
determining a plurality of redundancy versions in a circular buffer, with each redundancy version corresponding to a starting bit index in the circular buffer, and in at least one pair of redundancy versions, the number of bits between the starting point of a first redundancy version and the starting point of a second redundancy version being not divisible by the modulation order of the certain modulation scheme;
writing the plurality of blocks of de-modulated bits into the circular buffer, with each block of de-modulated bits being written in accordance with a redundancy version selected from among the plurality of redundancy versions;
segmenting the bits written into the circular buffer into a plurality of sub-blocks of bits;
interleaving each of the sub-blocks of bits by using a certain interleaver;
collecting the interleaved bits from the plurality of sub-blocks to generate a collected block of bits; and
decoding the collected block of bits by using a certain decoding scheme.
13. The method of claim 12 , comprised of:
de-modulating the plurality of blocks of data bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined such that Δ′(j,p)=[R×((24×j)+2)]−[R×((24×p)+2)] is not divisible by 4 and 6 for at least one pair of j and p, and j=0, 1, . . . , 3, p=0, 1, . . . , 3.
14. The method of claim 12 , comprised of:
de-modulating the subset of bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24 ×j )+2)+δ RV ( j ),
where j is the index of the redundancy version, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon Δ′(j,p) and Δ′(j,p)=[R×((24×j)+2)]−[R×((24×p)+2)] for at least one pair of j and p, and j=0, 1, . . . , 3, p=0, 1, . . . , 3, with:
when the Quadrature phase-shift keying (QPSK) modulation is used for de-modulating the plurality of blocks of data bits, δ RV (j) being set to be zero;
when the 16-Quadrature amplitude modulation (QAM) is used for de-modulating the plurality of blocks of data bits:
when Δ′(j,p)/4 is an integer number, δ RV (j) being an integer selected from a set {1, 2, 3}; and
when Δ′(j,p)/4 is not an integer number, δ RV (j) being set to be zero; and
when the 64-Quadrature amplitude modulation (QAM) is used for de-modulating the plurality of blocks of data bits:
when Δ′(j,p)/6 is an integer number, δ RV (j) being an integer selected from a set {1, 2, 3, 4, 5}; and
when Δ′(j,p)/6 is not an integer number, δ RV (j) being set to be zero.
15. The method of claim 12 , comprised of:
de-modulating the plurality of blocks of data bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×(( G×j )+2),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, and G is an integer that is not divisible by at least one of 4 and 6.
16. The method of claim 12 , comprised of determining a size of the circular buffer, with the size L being a number that is not divisible by at least one modulation order.
17. The method of claim 12 , comprised of interleaving each of the sub-blocks of bits by using a row-column interleaver comprising, and, for each sub-block:
filling the sub-block of bits into the row-column interleaver in a row-by-row manner by starting from the first row and the first column, with the row-column interleaver having C columns and R rows, and the number of bits in the sub-block being D;
when the row-column interleaver is not filled up by the bits in the sub-block, filling up the row-column interleaver with dummy bits, with the number of dummy bits being Y=R×C−D;
permuting the columns in the row-column interleaver by using a certain pattern;
reading the bits from the row-column interleaver in a column-by-column manner by staring from the first row and the first column; and
removing the dummy bits from the bits that are read from the row-column interleaver.
18. The method of claim 17 , comprised of:
de-modulating the plurality of blocks of data bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, and δ RV (j) is determined in dependence upon the number of dummy bits Y.
19. The method of claim 18 , comprised of the number of dummy bits Y being one of 4, 12, 20 and 28, and δ RV (j) being determined based on the following table:
RV(0), j = 0
RV(1), j = 1
RV(2), j = 2
RV(3), j = 3
Y1
0
0
0
1
Y2
0
0
0
1
Y3
0
0
0
3
Y4
0
0
1
0.
20. The method of claim 12 , comprised of:
de-modulating the plurality of blocks of data bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24× j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon j and the size of the quadratic permutation polynomial (QPP) interleaver, and δ RV (j)=0 for j=0, and δ RV (j) is determined based upon the following table for j=1, 2, 3:
i
j = 1
j = 2
j = 3
1
0
1
0
2
0
0
3
3
0
5
4
4
3
1
4
5
0
1
0
6
0
0
3
7
0
5
4
8
3
1
4
9
0
1
0
10
0
0
3
11
0
5
4
12
3
1
4
13
0
1
0
14
0
0
3
15
0
5
4
16
3
1
4
17
0
1
0
18
0
0
3
19
0
5
4
20
3
1
4
21
0
1
0
22
0
0
3
23
0
5
4
24
3
1
4
25
0
1
0
26
0
0
3
27
0
5
4
28
3
1
4
29
0
1
0
30
0
0
3
31
0
5
4
32
3
1
4
33
0
1
0
34
0
0
3
35
0
5
4
36
3
1
4
37
0
1
0
38
0
0
3
39
0
5
4
40
3
1
4
41
0
1
0
42
0
0
3
43
0
5
4
44
3
1
4
45
0
1
0
46
0
0
3
47
0
5
4
48
3
1
4
49
0
1
0
50
0
0
3
51
0
5
4
52
3
1
4
53
0
1
0
54
0
0
3
55
0
5
4
56
3
1
4
57
0
1
0
58
0
0
3
59
0
5
4
60
3
1
4
61
0
0
3
62
3
1
4
63
0
0
3
64
3
1
4
65
0
0
3
66
3
1
4
67
0
0
3
68
3
1
4
69
0
0
3
70
3
1
4
71
0
0
3
72
3
1
4
73
0
0
3
74
3
1
4
75
0
0
3
76
3
1
4
77
0
0
3
78
3
1
4
79
0
0
3
80
3
1
4
81
0
0
3
82
3
1
4
83
0
0
3
84
3
1
4
85
0
0
3
86
3
1
4
87
0
0
3
88
3
1
4
89
0
0
3
90
3
1
4
91
0
0
3
92
3
1
4
93
3
1
4
94
3
1
4
95
3
1
4
96
3
1
4
97
3
1
4
98
3
1
4
99
3
1
4
100
3
1
4
101
3
1
4
102
3
1
4
103
3
1
4
104
3
1
4
105
3
1
4
106
3
1
4
107
3
1
4
108
3
1
4
109
3
1
4
110
3
1
4
111
3
1
4
112
3
1
4
113
3
1
4
114
3
1
4
115
3
1
4
116
3
1
4
117
3
1
4
118
3
1
4
119
3
1
4
120
3
1
4
121
3
1
4
122
3
1
4
123
3
1
4
124
3
1
4
125
3
1
4
126
3
1
4
127
3
1
4
128
3
1
4
129
3
1
4
130
3
1
4
131
3
1
4
132
3
1
4
133
3
1
4
134
3
1
4
135
3
1
4
136
3
1
4
137
3
1
4
138
3
1
4
139
3
1
4
140
3
1
4
141
3
1
4
142
3
1
4
143
3
1
4
144
3
1
4
145
3
1
4
146
3
1
4
147
3
1
4
148
3
1
4
149
3
1
4
150
3
1
4
151
3
1
4
152
3
1
4
153
3
1
4
154
3
1
4
155
3
1
4
156
3
1
4
157
3
1
4
158
3
1
4
159
3
1
4
160
3
1
4
161
3
1
4
162
3
1
4
163
3
1
4
164
3
1
4
165
3
1
4
166
3
1
4
167
3
1
4
168
3
1
4
169
3
1
4
170
3
1
4
171
3
1
4
172
3
1
4
173
3
1
4
174
3
1
4
175
3
1
4
176
3
1
4
177
3
1
4
178
3
1
4
179
3
1
4
180
3
1
4
181
3
1
4
182
3
1
4
183
3
1
4
184
3
1
4
185
3
1
4
186
3
1
4
187
3
1
4
188
3
1
4
where i is the interleaver size index, i=1, 2, 3, . . . , 187, 188, and i is determined in dependence upon an interleaver size K based on the following table:
i
K i
1
40
2
48
3
56
4
64
5
72
6
80
7
88
8
96
9
104
10
112
11
120
12
128
13
136
14
144
15
152
16
160
17
168
18
176
19
184
20
192
21
200
22
208
23
216
24
224
25
232
26
240
27
248
28
256
29
264
30
272
31
280
32
288
33
296
34
304
35
312
36
320
37
328
38
336
39
344
40
352
41
360
42
368
43
376
44
384
45
392
46
400
47
408
48
416
49
424
50
432
51
440
52
448
53
456
54
464
55
472
56
480
57
488
58
496
59
504
60
512
61
528
62
544
63
560
64
576
65
592
66
608
67
624
68
640
69
656
70
672
71
688
72
704
73
720
74
736
75
752
76
768
77
784
78
800
79
816
80
832
81
848
82
864
83
880
84
896
85
912
86
928
87
944
88
960
89
976
90
992
91
1008
92
1024
93
1056
94
1088
95
1120
96
1152
97
1184
98
1216
99
1248
100
1280
101
1312
102
1344
103
1376
104
1408
105
1440
106
1472
107
1504
108
1536
109
1568
110
1600
111
1632
112
1664
113
1696
114
1728
115
1760
116
1792
117
1824
118
1856
119
1888
120
1920
121
1952
122
1984
123
2016
124
2048
125
2112
126
2176
127
2240
128
2304
129
2368
130
2432
131
2496
132
2560
133
2624
134
2688
135
2752
136
2816
137
2880
138
2944
139
3008
140
3072
141
3136
142
3200
143
3264
144
3328
145
3392
146
3456
147
3520
148
3584
149
3648
150
3712
151
3776
152
3840
153
3904
154
3968
155
4032
156
4096
157
4160
158
4224
159
4288
160
4352
161
4416
162
4480
163
4544
164
4608
165
4672
166
4736
167
4800
168
4864
169
4928
170
4992
171
5056
172
5120
173
5184
174
5248
175
5312
176
5376
177
5440
178
5504
179
5568
180
5632
181
5696
182
5760
183
5824
184
5888
185
5952
186
6016
187
6080
188
6144.
21. The method of claim 12 , comprised of:
de-modulating the plurality of blocks of data bits by using one of a Quadrature phase-shift keying (QPSK) modulation, a 16-Quadrature amplitude modulation (QAM) and a 64-Quadrature amplitude modulation (QAM); and
determining four redundancy versions in the circular buffer, with the starting bit index of a redundancy version being established by:
RV ( j )= R ×((24 ×j )+2)+δ RV ( j ),
where j is the index of the redundancy version and j=0, 1, . . . , 3, R=┌K/32┐, K is the size of the certain interleaver, δ RV (j) is determined in dependence upon j and the size of the quadratic permutation polynomial (QPP) interleaver, and δ RV (j)=0 for j=0, and δ RV (j) is determined based upon the following table for j=1, 2, 3:
i
j = 1
j = 2
j = 3
1
0
1
3
2
0
5
3
3
0
1
1
4
0
0
4
5
0
2
2
6
1
2
1
7
0
2
0
8
3
1
0
9
0
1
3
10
0
1
3
11
0
1
1
12
0
5
0
13
0
1
3
14
0
5
3
15
0
1
1
16
0
0
4
17
0
2
2
18
1
2
1
19
0
2
0
20
3
1
0
21
0
1
3
22
0
1
3
23
0
1
1
24
0
5
0
25
0
1
3
26
0
5
3
27
0
1
1
28
0
0
4
29
0
2
2
30
1
2
1
31
0
2
0
32
3
1
0
33
0
1
3
34
0
1
3
35
0
1
1
36
0
5
0
37
0
1
3
38
0
5
3
39
0
1
1
40
0
0
4
41
0
2
2
42
1
2
1
43
0
2
0
44
3
1
0
45
0
1
3
46
0
1
3
47
0
1
1
48
0
5
0
49
0
1
3
50
0
5
3
51
0
1
1
52
0
0
4
53
0
2
2
54
1
2
1
55
0
2
0
56
3
1
0
57
0
1
3
58
0
1
3
59
0
1
1
60
0
5
0
61
0
5
3
62
0
0
4
63
1
2
1
64
3
1
0
65
0
1
3
66
0
5
0
67
0
5
3
68
0
0
4
69
1
2
1
70
3
1
0
71
0
1
3
72
0
5
0
73
0
5
3
74
0
0
4
75
1
2
1
76
3
1
0
77
0
1
3
78
0
5
0
79
0
5
3
80
0
0
4
81
1
2
1
82
3
1
0
83
0
1
3
84
0
5
0
85
0
5
3
86
0
0
4
87
1
2
1
88
3
1
0
89
0
1
3
90
0
5
0
91
0
5
3
92
0
0
4
93
3
1
0
94
0
5
0
95
0
0
4
96
3
1
0
97
0
5
0
98
0
0
4
99
3
1
0
100
0
5
0
101
0
0
4
102
3
1
0
103
0
5
0
104
0
0
4
105
3
1
0
106
0
5
0
107
0
0
4
108
3
1
0
109
0
5
0
110
0
0
4
111
3
1
0
112
0
5
0
113
0
0
4
114
3
1
0
115
0
5
0
116
0
0
4
117
3
1
0
118
0
5
0
119
0
0
4
120
3
1
0
121
0
5
0
122
0
0
4
123
3
1
0
124
0
5
0
125
3
1
0
126
0
0
4
127
0
5
0
128
3
1
0
129
0
0
4
130
0
5
0
131
3
1
0
132
0
0
4
133
0
5
0
134
3
1
0
135
0
0
4
136
0
5
0
137
3
1
0
138
0
0
4
139
0
5
0
140
3
1
0
141
0
0
4
142
0
5
0
143
3
1
0
144
0
0
4
145
0
5
0
146
3
1
0
147
0
0
4
148
0
5
0
149
3
1
0
150
0
0
4
151
0
5
0
152
3
1
0
153
0
0
4
154
0
5
0
155
3
1
0
156
0
0
4
157
0
5
0
158
3
1
0
159
0
0
4
160
0
5
0
161
3
1
0
162
0
0
4
163
0
5
0
164
3
1
0
165
0
0
4
166
0
5
0
167
3
1
0
168
0
0
4
169
0
5
0
170
3
1
0
171
0
0
4
172
0
5
0
173
3
1
0
174
0
0
4
175
0
5
0
176
3
1
0
177
0
0
4
178
0
5
0
179
3
1
0
180
0
0
4
181
0
5
0
182
3
1
0
183
0
0
4
184
0
5
0
185
3
1
0
186
0
0
4
187
0
5
0
188
3
1
0
where i is the interleaver size index, i=1, 2, 3, . . . , 187, 188, and i is determined in dependence upon an interleaver size K based on the following table:
i
K i
1
40
2
48
3
56
4
64
5
72
6
80
7
88
8
96
9
104
10
112
11
120
12
128
13
136
14
144
15
152
16
160
17
168
18
176
19
184
20
192
21
200
22
208
23
216
24
224
25
232
26
240
27
248
28
256
29
264
30
272
31
280
32
288
33
296
34
304
35
312
36
320
37
328
38
336
39
344
40
352
41
360
42
368
43
376
44
384
45
392
46
400
47
408
48
416
49
424
50
432
51
440
52
448
53
456
54
464
55
472
56
480
57
488
58
496
59
504
60
512
61
528
62
544
63
560
64
576
65
592
66
608
67
624
68
640
69
656
70
672
71
688
72
704
73
720
74
736
75
752
76
768
77
784
78
800
79
816
80
832
81
848
82
864
83
880
84
896
85
912
86
928
87
944
88
960
89
976
90
992
91
1008
92
1024
93
1056
94
1088
95
1120
96
1152
97
1184
98
1216
99
1248
100
1280
101
1312
102
1344
103
1376
104
1408
105
1440
106
1472
107
1504
108
1536
109
1568
110
1600
111
1632
112
1664
113
1696
114
1728
115
1760
116
1792
117
1824
118
1856
119
1888
120
1920
121
1952
122
1984
123
2016
124
2048
125
2112
126
2176
127
2240
128
2304
129
2368
130
2432
131
2496
132
2560
133
2624
134
2688
135
2752
136
2816
137
2880
138
2944
139
3008
140
3072
141
3136
142
3200
143
3264
144
3328
145
3392
146
3456
147
3520
148
3584
149
3648
150
3712
151
3776
152
3840
153
3904
154
3968
155
4032
156
4096
157
4160
158
4224
159
4288
160
4352
161
4416
162
4480
163
4544
164
4608
165
4672
166
4736
167
4800
168
4864
169
4928
170
4992
171
5056
172
5120
173
5184
174
5248
175
5312
176
5376
177
5440
178
5504
179
5568
180
5632
181
5696
182
5760
183
5824
184
5888
185
5952
186
6016
187
6080
188
6144.
22. The method of claim 12 , comprised of interleaving each of the sub-blocks of coded bits by using a quadratic permutation polynomial (QPP) interleaver.
23. A wireless terminal in a communication system, comprising:
a channel encoder encoding at least one block of information bits to be transmitted to generate a plurality of coded bits;
a bit separation unit segmenting the plurality of coded bits into a plurality of sub-blocks of coded bits;
a plurality of interleavers interleaving each of the sub-blocks of coded bits;
a circular buffer having a plurality of redundancy versions, with each redundancy version corresponding to a starting bit index in the circular buffer;
a bit collection unit collecting the interleaved coded bits from the plurality of sub-blocks and writing the collected bits into the circular buffer;
a bit selection unit selecting a subset of bits from the circular buffer by selecting a redundancy version from among the plurality of redundancy version;
a modulation unit modulating the subset of bits by using a certain modulation scheme; and
at least one antenna transmitting the modulated bits, with, in at least one pair of redundancy versions, the number of bits between the starting point of a first redundancy version and the starting point of a second redundancy version being not divisible by the modulation order of the certain modulation scheme.
24. A wireless terminal in a communication system, comprising:
at least one antenna receiving a plurality of blocks of data bits;
a de-modulation unit de-modulating the plurality of blocks of data bits by using a certain modulation scheme;
a circular buffer having a plurality of redundancy versions, with each redundancy version corresponding to a starting bit index in the circular buffer;
a bit de-selection unit writing the plurality of blocks of de-modulated bits into the circular buffer, with each block of de-modulated bits being written in accordance with a redundancy version selected from among the plurality of redundancy versions;
a bit separation unit segmenting the bits written into the circular buffer into a plurality of sub-blocks of bits;
a plurality of interleaver interleaving each of the sub-blocks of bits by using a certain interleaver;
a bit collection unit collecting the interleaved bits from the plurality of sub-blocks to generate a collected block of bits; and
a channel decoding unit decoding the collected block of bits by using a certain decoding scheme, with, in at least one pair of redundancy versions, the number of bits between the starting point of a first redundancy version and the starting point of a second redundancy version being not divisible by the modulation order of the certain modulation scheme.