Coding apparatus, and associated method, for forming a punctured binary convolutional code for use in a radio communication system
Coding apparatus, and an associated method, for forming punctured binary convolutional codes for use in a multi-band OFDM ultra wide band radio communication system. Input data to be communicated is provided to a convolutional coder that forms a ⅓ rate code forming first-stage codes. The ⅓ rate code is punctured by a puncture matrix to form resultant code words. The puncture matrix is of values that optimize code performance at various code rates.
1. An apparatus for coding input data into channel-coded form for communication upon a communication channel, said apparatus comprising:
a coder element adapted to receive the input data and to code the input data at a ⅓ code rate to form first coded data;
a code puncturer adapted to receive the coded data and to puncture the coded data with a puncture code,
wherein the puncture code comprises:
P
=
[
1
0
0
0
0
0
1
1
1
]
,
or
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
,
or
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
,
or
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
,
or
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
,
or
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.
2. The apparatus of claim 1 wherein the first coded data formed by said first coder element comprises a combination of present and prior bits of the input data.
3. The apparatus of claim 1 wherein the coder element comprises a convolutional coder.
4. The apparatus of claim 1 , wherein the puncture code is:
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
.
5. The apparatus of claim 1 , wherein the puncture code is:
P
=
[
1
0
0
0
0
0
1
1
1
]
.
6. The apparatus of claim 1 , wherein the puncture code is:
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
.
7. The apparatus of claim 1 , wherein the puncture code is:
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
.
8. The apparatus of claim 1 wherein the puncture code is:
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
.
9. The apparatus of claim 1 wherein the puncture code is:
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.
10. An apparatus for coding input data into channel-coded form for communication upon a communication channel, said apparatus comprising:
a first coder element adapted to receive the input data, said first coder element for coding the input data at a ⅓ code rate to form first coded data; and
a code puncturer adapted to receive the first coded data formed by said first coder element, said code puncturer for puncturing the first coded data to form resultant codewords that exhibit a resultant code rate, relative to the input data, greater than ½, the resultant codewords formed by puncturing the first coded data with a selected puncture code, the selected puncture code selected to maximize, for the resultant code rate, minimum distances between individual ones of the resultant codewords and minimize a number of nearest neighbors to individual ones of the resultant codewords,
wherein the first coder element comprises a convolutional coder; and
wherein the convolutional coder forming said first coder element is defined in terms of a set of generator polynomials including a first octal-valued polynomial of 133, a second octal-valued polynomial of 145 and a third octal-valued polynomial of 175.
11. A method for coding input data into channel-coded form for communication upon a communication channel, said method comprising the operations of:
coding the input data at a ⅓ code rate to form coded data therefrom; and
puncturing the coded data with a puncture code,
wherein the puncture code comprises:
P
=
[
1
0
0
0
0
0
1
1
1
]
,
or
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
,
or
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
,
or
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
,
or
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
,
or
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.
12. The method of claim 11 wherein the puncture code is:
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
.
13. The method of claim 11 wherein the puncture code is:
P
=
[
1
0
0
0
0
0
1
1
1
]
.
14. The method of claim 11 wherein the puncture code is:
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
.
15. The method of claim 11 wherein the puncture code is:
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
.
16. The method of claim 11 wherein the puncture code is:
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
.
17. The method of claim 11 wherein the puncture code is:
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.
18. An apparatus for coding input data into channel-coded form for communication upon a communication channel, said apparatus comprising:
means for coding input data at a ⅓ code rate to form coded data therefrom; and
means for puncturing the coded data with a puncture code,
wherein the puncture code comprises a matrix P selected from the group of:
P
=
[
1
0
0
0
0
0
1
1
1
]
,
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
,
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
,
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
,
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
,
and
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.
19. A communication device comprising:
a coder element adapted to receive input data and to code the input data at a ⅓ code rate to form first coded data;
a code puncturer adapted to receive the coded data and to puncture the coded data with a puncture code; and
one or more transmit antennas adapted to transmit the coded data,
wherein the puncture code comprises a matrix P selected from the group of:
P
=
[
1
0
0
0
0
0
1
1
1
]
,
P
=
[
1
0
0
0
0
1
1
1
1
0
0
0
]
,
P
=
[
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
]
,
P
=
[
1
0
0
0
1
0
1
0
1
0
1
0
1
0
0
]
,
P
=
[
1
0
0
0
0
1
0
1
0
0
1
0
1
0
1
1
0
0
]
,
and
P
=
[
0
1
0
0
0
0
1
1
0
1
0
0
0
0
0
1
0
1
1
1
0
]
.