Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
195 words
A method for encoding an information bit stream of L bits, I 1 . . . I L and comprising the steps of: (a) convolutionally encoding said bit stream by generating parity bits P i , where i is a integer from 1 to L and convolving the information and parity bits in a predetermined sequence; (b) providing a storage matrix having m columns and n rows of storage cells, where m and n are predetermined integers whose product m×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input, store and output one of said parity and information bits; (c) storing said convolved bit stream in said matrix in accordance with a predetermined row by row sequence; (d) outputting said stored bit stream from said matrix in accordance with a predetermined column by column sequence such that the encoded bit stream is of the form P L . . . P 4 P 2 I 1 . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 2
Independent Claim
195 words
A method for encoding an information bit stream of L bits, I 1 . . . I L and comprising the steps of: (a) convolutionally encoding said bit stream by generating parity bits P i , where i is a integer from 1 to L and convolving the information and parity bits in a predetermined sequence; (b) providing a storage matrix having m columns and n rows of storage cells, where m and n are predetermined integers whose product m×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input, store and output one of said parity and information bits; (c) storing said convolved bit stream in said matrix in accordance with a predetermined row by row sequence; (d) outputting said stored bit stream from said matrix in accordance with a predetermined column by column sequence such that the encoded bit stream is of the form P L . . . P 4 P 2 I 1 . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 3
Dependent Claim
30 words
The method of claim 1 wherein step (a) further comprises the step of: (i) modulo-2 adding predetermined ones of the information bits to generate each parity bit, P i .
Claim 4
Dependent Claim
43 words
The method of claim 1 or 2 wherein step (a) further comprises the step of: convolving the information and parity bits in the sequence P L I L . . . P i I i . . . P 1 I 1 .
Claim 5
Dependent Claim
129 words
The method of claim 1 in combination with the method of decoding said encoded bit stream comprising the steps of: (a') providing a decoder storage having m columns and n rows of storage cells, where m and n are predetermined integers whose product, m×n, is as great as the total number of bits in said encoded bit stream each cell being adapted to input, store and output one of said encoded bits; (b') storing said encoded bit stream in said decoder storage matrix in accordance with a column by successive column sequence; (c') outputting said stored encoded bit stream in accordance with a row by successive row sequence to recover said convolved bit stream; and (d') convolutionally decoding said recovered convolved bit stream to regenerate said information bit stream.
Claim 6
Dependent Claim
200 words
An encoder for processing an information bit stream of length L, I L . . . I 2 I 1 , and generating an encoded bit stream comprising: convolutional encoder means for convolutionally encoding said information bit stream comprising means for generating parity bits P i , where i is an integer from 1 to L, and means for predeterminedly convolving said parity bits with said information bits; storage matrix means, having m columns and n rows of storage cells, where m and n are predetermined integers whose product m×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input, store and output one of said parity or information bits, for storing said convolved bit stream in accordance with a row by successive row sequence; output means for outputting said stored bit stream from said matrix in a column by successive column sequence producing an encoded bit stream of the form P L . . . P 4 P 2 I L . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 7
Dependent Claim
200 words
An encoder for processing an information bit stream of length L, I L . . . I 2 I 1 , and generating an encoded bit stream comprising: convolutional encoder means for convolutionally encoding said information bit stream comprising means for generating parity bits P i , where i is an integer from 1 to L, and means for predeterminedly convolving said parity bits with said information bits; storage matrix means, having m columns and n rows of storage cells, where m and n are predetermined integers whose product m×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input, store and output one of said parity or information bits, for storing said convolved bit stream in accordance with a row by successive row sequence; output means for outputting said stored bit stream from said matrix in a column by successive column sequence producing an encoded bit stream of the form P L . . . P 4 P 2 I L . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 8
Dependent Claim
36 words
The encoder of claim 5 wherein the convolutional encoder means for generating each parity bit further comprises: modulo-2 adder means for adding predetermined ones of the information bits to generate each parity bit P i .
Claim 9
Dependent Claim
50 words
The encoder of claim 5 or 6 wherein said convolutional encoder means for predeterminedly convolving said parity bits further comprises: means for interleaving the information and parity bits in the sequence P L I L . . . P i I i . . . P 1 I 1 .
Claim 10
Dependent Claim
128 words
The encoder of claim 5 in combination with a decoder for decoding said encoded bit stream comprising: decoder storage matrix means having m columns and n rows of storage cells, where m and n are predetermined intergers whose product, m×n, is as great as the total number of bits in said encoded bit stream, each cell being adapted to input, store and output one of said encoded bits; means for storing said encoded bit stream in said decoder storage matrix in accordance with a predetermined column by column sequence; means for outputting said stored encoded bit stream in accordance with a predetermined row by row sequence to recover said convolved bit stream; and means for convolutionally decoding said recovered convolved bit stream to regenerate said information bit stream.
Claim 11
Dependent Claim
219 words
An encoder for processing an information bit stream of length L, I L . . . I 2 I 1 , and generating an encoded bit stream comprising: convolutional encoder means for modulo-2 adding successive information bits to generate parity bits P i , where i is an integer from 1 to L, and for interleaving the information and parity bits in the sequence P L I L . . . P i I i . . . P 1 I 1 , thereby generating a convolved bit stream. storage matrix means, having 4 columns and n rows of storage cells, where n is a predetermined integer, whose product 4×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input store and output one of said parity or information bits, for storing said convolved bit streams in a row by successive row sequence; and means for outputting said stored convolved bit stream from said matrix in a column by successive column basis producing an encoded bit stream of the form P L . . . P 4 P 2 I L . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 12
Dependent Claim
219 words
An encoder for processing an information bit stream of length L, I L . . . I 2 I 1 , and generating an encoded bit stream comprising: convolutional encoder means for modulo-2 adding successive information bits to generate parity bits P i , where i is an integer from 1 to L, and for interleaving the information and parity bits in the sequence P L I L . . . P i I i . . . P 1 I 1 , thereby generating a convolved bit stream. storage matrix means, having 4 columns and n rows of storage cells, where n is a predetermined integer, whose product 4×n is at least as great as the total number of bits in the convolved bit stream, each cell being adapted to input store and output one of said parity or information bits, for storing said convolved bit streams in a row by successive row sequence; and means for outputting said stored convolved bit stream from said matrix in a column by successive column basis producing an encoded bit stream of the form P L . . . P 4 P 2 I L . . . I 4 I 2 P L-1 . . . P 3 P 1 I L-1 . . . I 3 I 1 .
Claim 13
Dependent Claim
105 words
The encoder of claim 9 in combination with a decoder for decoding said encoded bit stream comprising: decoder storage matrix means having 4 columns and n rows of storage cells, each cell being adapted to input, store and output one bit of the encoded bit stream; means for storing said encoded bit stream in said decoder storage matrix in accordance with a predetermined column by column sequence; means for outputting said stored encoded bit stream in accordance with a predetermined row by row sequence to recover said convolved bit stream; and means for convolutionally decoding said recovered convolved bit stream to regenerate said information stream.