Synchronization and error detection in a packetized data stream

Claim 3

A method in accordance with claim 1 wherein: the synchronization pattern for each packet precedes the k information bits of that packet; and the counterpart set of k information bits for each parity code comprises the k information bits immediately preceding the parity code.

Claim 4

A method in accordance with claim 1 wherein said parity code is generated from a linear block code comprising a dual of a shortened cyclic code.

Claim 5

A method in accordance with claim 1 wherein said data stream is an MPEG compatible data stream.

Claim 6

A method in accordance with claim 4 comprising the further step of scaling said parity codes such that when decoded at said decoder, they will match MPEG synchronization patterns.

Claim 7

A method in accordance with claim 4 wherein k=1496.

Claim 8

Communication apparatus for enabling a receiver to robustly obtain synchronization and detect errors in a data stream carrying successive packets of k information bits and an r-bit parity code, the parity code of each packet comprising a predefined pattern of bits detectable at said receiver by searching for said pattern and functioning as a checksum for information bits carried in said data stream, said apparatus comprising: means for inserting the parity codes in said packets prior to communication to said receiver, each of said parity codes being derived from a counterpart set of k information bits in said data stream; means for communicating said data stream to said receiver after insertion of said parity codes; means for locating at least one parity code in said data stream at said receiver to achieve synchronization, thereby enabling the boundaries for the k information bits of successive packets to be determined; and means at said receiver for comparing said parity codes to checksums obtained from their counterpart k information bits to determine when the information bits in a packet contain an error.

Claim 9

Communication apparatus for enabling a receiver to robustly obtain synchronization and detect errors in a data stream carrying successive packets of k information bits and an r-bit parity code, the parity code of each packet comprising a predefined pattern of bits detectable at said receiver by searching for said pattern and functioning as a checksum for information bits carried in said data stream, said apparatus comprising: means for inserting the parity codes in said packets prior to communication to said receiver, each of said parity codes being derived from a counterpart set of k information bits in said data stream; means for communicating said data stream to said receiver after insertion of said parity codes; means for locating at least one parity code in said data stream at said receiver to achieve synchronization, thereby enabling the boundaries for the k information bits of successive packets to be determined; and means at said receiver for comparing said parity codes to checksums obtained from their counterpart k information bits to determine when the information bits in a packet contain an error.

Claim 10

Apparatus in accordance with claim 7 further comprising: a parity check matrix at said receiver for generating a predefined synchronization pattern from valid parity codes.

Claim 11

Apparatus in accordance with claim 8 wherein said predefined synchronization pattern is a standard MPEG synchronization pattern.

Claim 12

Apparatus in accordance with claim 7 wherein said data stream contains synchronization patterns prior to insertion of said parity codes, said apparatus further comprising: means for replacing said synchronization patterns with said parity codes to provide a modified data stream for communication to said receiver.

Claim 13

Apparatus in accordance with claim 10, further comprising: means at said receiver for reconstructing said data stream from said modified data stream by replacing said parity codes with said synchronization patterns.

Claim 14

Apparatus in accordance with claim 10 wherein: each packet commences with one of said synchronization patterns, with the k information bits for the packet following the synchronization pattern for that packet; and each synchronization pattern is replaced with a parity code derived from the k information bits of the preceding packet.

Claim 15

Apparatus in accordance with claim 12 wherein said data stream is an MPEG compatible data stream.

Claim 16

Apparatus in accordance with claim 13 further comprising: means for scaling said parity codes such that when decoded at said receiver, they will match an MPEG synchronization pattern.

Claim 17

A decoder for a packetized digital data stream in which successive packets each contain k information bits and an r-bit parity code, the parity code of each packet being derived from k bits of information carried by said data stream, comprising: means for searching said data stream during a signal acquisition phase to locate a parity code contained therein; means for establishing a synchronization condition based on one or more parity codes located by said searching means; means for comparing a checksum derived from the k information bits of each packet to the parity code for those k information bits during a tracking phase; and means for signalling an error in the k information bits for a packet when the checksum for those bits does not match the parity code therefor.

Claim 18

A decoder for a packetized digital data stream in which successive packets each contain k information bits and an r-bit parity code, the parity code of each packet being derived from k bits of information carried by said data stream, comprising: means for searching said data stream during a signal acquisition phase to locate a parity code contained therein; means for establishing a synchronization condition based on one or more parity codes located by said searching means; means for comparing a checksum derived from the k information bits of each packet to the parity code for those k information bits during a tracking phase; and means for signalling an error in the k information bits for a packet when the checksum for those bits does not match the parity code therefor.

Claim 19

A decoder in accordance with claim 15 wherein: each parity code is derived from the k information bits of the immediately preceding packet.

Claim 20

A decoder in accordance with claim 15 wherein said parity codes are generated from a linear block code comprising a dual of a shortened cyclic code.

Claim 21

A decoder in accordance with claim 15 wherein said data stream is encoded in an MPEG compatible format, said decoder further comprising: means for replacing the parity code in each packet with an MPEG synchronization pattern.

Claim 22

A decoder in accordance with claim 15 further comprising: means for monitoring said parity codes during said tracking phase; and means responsive to said monitoring means for switching from said tracking phase to said acquisition phase after a predetermined plurality of r-bit patterns considered by said monitoring means to be parity codes are found to be invalid.

Claim 23

A decoder in accordance with claim 19 wherein said data stream is encoded in an MPEG compatible format, said decoder further comprising: means for replacing the parity code in each packet with an MPEG synchronization pattern.

Claim 24

A decoder in accordance with claim 20 wherein: each parity code is derived from the k information bits of the immediately preceding packet; and each synchronization pattern comprises the first r bits in a packet and is followed by the k information bits for that packet.

Claim 25

Apparatus for calculating syndromes for linear block coded codewords, comprising: a finite impulse response filter having an input for receiving a serial bit stream of codeword data, each codeword containing k information bits and r parity bits, said filter having an output for providing a serial bit stream of syndromes, said syndromes comprising a fixed linear combination of a current bit of said codeword data input to said filter and the k previous bits of said codeword data; wherein said filter has an impulse response h k+1 (x), where: ##EQU18## g(x) is a generator polynomial of degree r describing a recursion to provide an infinite impulse response, and a(x) and b(x) are polynomials chosen such that the polynomial h k+1 (x) will be of degree k, have a non-zero constant term h 0 =1, and have a non-zero final term h k =1 to provide finite impulse responses.

Claim 26

Apparatus for calculating syndromes for linear block coded codewords, comprising: a finite impulse response filter having an input for receiving a serial bit stream of codeword data, each codeword containing k information bits and r parity bits, said filter having an output for providing a serial bit stream of syndromes, said syndromes comprising a fixed linear combination of a current bit of said codeword data input to said filter and the k previous bits of said codeword data; wherein said filter has an impulse response h k+1 (x), where: ##EQU18## g(x) is a generator polynomial of degree r describing a recursion to provide an infinite impulse response, and a(x) and b(x) are polynomials chosen such that the polynomial h k+1 (x) will be of degree k, have a non-zero constant term h 0 =1, and have a non-zero final term h k =1 to provide finite impulse responses.

Claim 27

Apparatus in accordance with claim 22 wherein said linear block code is a dual of a shortened cyclic code.

Claim 28

Apparatus in accordance with claim 22 further comprising: means coupled to the output of said filter for detecting a synchronization pattern in the serial bit stream of syndromes.