Method and apparatus for encoding/decoding a convolutional code to a periodic convolutional code block

Claim 2

In a method of encoding a bit stream of B 1 information symbols in a convolutional encoder of the type in which said bits are serially fed through a K 1 stage shift register and in which r parity symbols are generated for every k information symbols to achieve a code rate of ρ=k/n defined as the ratio of the number of information symbols k to the total number of symbols n in the code, where n=k+r, the improvement comprising feeding back the output of said encoder shift register with a delay D 1 =B 1 -K 1 to the input of said shift register by re-introducing the first K 1 -1 information symbols into the encoder shift register.

Claim 3

The method according to claim 1 wherein B 1 =2K 1 +mk, where m is any non-negative integer.

Claim 4

A method according to claim 1 further comprising the steps of:

Claim 5

(a) converting a serial stream of B information symbols into k parallel streams each containing B 1 serial information symbols; (b) feeding each of said k parallel bit streams through a respective one of k shift registers each having K 1 stages and a feedback with delay D 1 =B 1 -K 1 ; (c) combining selected bits from each of said k shift registers in each of r modulo-2 adders to generate r new parity symbols each time the information symbols in said registers are shifted; and (d) combining the outputs of said k shift registers and the t outputs of said modulo-2 adders to thereby convolutionally encode a block of B=kB 1 information symbols with a code rate ρ=k/n and a constraint length K=kK 1 .

Claim 6

(a) converting a serial stream of B information symbols into k parallel streams each containing B 1 serial information symbols; (b) feeding each of said k parallel bit streams through a respective one of k shift registers each having K 1 stages and a feedback with delay D 1 =B 1 -K 1 ; (c) combining selected bits from each of said k shift registers in each of r modulo-2 adders to generate r new parity symbols each time the information symbols in said registers are shifted; and (d) combining the outputs of said k shift registers and the t outputs of said modulo-2 adders to thereby convolutionally encode a block of B=kB 1 information symbols with a code rate ρ=k/n and a constraint length K=kK 1 .

Claim 7

The method according to claim 1 wherein said information symbols comprise at least a portion of a time division multiple access (TDMA) burst.

Claim 8

In a method of decoding a periodic convolutional code block (PCCB), of block length B 1 of the type in which B 1 information symbols are received and fed through an encoder replica shift register of length K 1 , new parity symbols are generated from said encoder replica shift register and compared with received parity symbols which are fed through a delay K 1 , and the comparison results are fed through a syndrome register, the contents of which determine whether or not correction of the information symbol presently at the output of said encoder replica shift register is necessary, the improvement comprising feeding back the outputs of said encoder replica shift register and said delay K 1 to its respective input with a delay D 1 =B 1 -K 1 .

Claim 9

In a method of decoding a periodic convolutional code block (PCCB), of block length B 1 of the type in which B 1 information symbols are received and fed through an encoder replica shift register of length K 1 , new parity symbols are generated from said encoder replica shift register and compared with received parity symbols which are fed through a delay K 1 , and the comparison results are fed through a syndrome register, the contents of which determine whether or not correction of the information symbol presently at the output of said encoder replica shift register is necessary, the improvement comprising feeding back the outputs of said encoder replica shift register and said delay K 1 to its respective input with a delay D 1 =B 1 -K 1 .

Claim 10

The method according to claim 4 wherein B 1 =2K 1 +mk, where m is any non-negative integer.

Claim 11

The method according to claim 4 wherein said PCCB includes r parity symbols for every k information symbols and has a code rate ρ=k/n, where n=k+r is the total number of symbols in each code block, said method further comprising the steps of: (a) converting a serial stream of received B information symbols into k parallel streams each containing B 1 serial received information symbols; (b) feeding each of said parallel bit streams through a respective one of k encoder replica shift registers each having K 1 stages and a feedback with delay D 1 =B 1 -K 1 ; (c) combining selected bits from each encoder replica shift register in each of r modulo-2 adders to generate r new parity symbols each time the received information symbols in said encoder replica registers are shifted; (d) supplying r serial streams of received parity symbols each through a respective delay K 1 ; (e) comparing the newly-generated parity symbols at the output of each modulo-2 adder with the corresponding received parity symbol at the output of an associated delay K 1 , the results of the comparisons being provided to r syndrome registers; and (f) feeding back the outputs of each said delay K 1 and each said encoder replica shift register to its respective input with a delay D 1 =B 1 -K 1 to thereby decode a PCCB having block length B=kB 1 and constraint length K=kK 1 .

Claim 12

The method according to claim 4 wherein said PCCB comprises at least a portion of a TDMA burst.

Claim 15

An apparatus according to claim 9 wherein B=2K+mk, where m is any non-negative integer.

Claim 16

An apparatus according to claim 9 wherein said delay means is variable.

Claim 19

The apparatus according to claim 12 wherein each said feedback delay means is variable.

Claim 20

The apparatus according to claim 12 wherein B=2K+mk, where m is any non-negative integer.

Claim 21

An apparatus according to claim 12 wherein B=2K+mk, where m is any non-negative integer.