US4744086A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process for the transmission in blocks of digital information words with error correction capability
Assignee: Telediffusion de France ets Public de Diffusion
•
Filing: 1986-06-04
•
Granted: 1988-05-10
•
Expires: 2006-06-04
Abstract
Abstract The invention relates to a process for the transmission in blocks of digital information words with a correction capability. This process consists of transmitting in blocks digital information words, each information word having a length of n 1 bits, in which with each sequence of n 2 -k (n 2 >k) of consecutive information words are associated k redundancy words of n 1 bits each in which, for each order i (1<i<n 2 ), the k bits of order i of the redundancy words are redundancy bits in accordance with a Hamming code (n 2 0k, k). For each set of n 2 linked words, each word is transmitted while being protected by an error detecting code. Several sets of linked words can be interlaced. The words of the same order or rank of each set form a group and the groups can be formed by frames.
Inventors
- 👤 Alain Komly
- 👤 Michel Maillard
- 👤 Alain Viallevieille
- 👤 Alain Weisser
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 15:43
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1806; G11B20/1809; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
232 words
A process for the transmission in blocks of digital information words, each word having a length of n 1 bits, in which n 1 is an integer, said process comprising successively adding to the information words to be transmitted words of an error correcting code and words of an error detecting code, wherein the error correcting code is a Hamming code by means of which k redundancy words are added to each sequence of n 2 -k, n 2 being an integer greater than k, consecutive informtion words, said n 2 -k information words forming with the K redundancy words a set of words called the linked set, each redundancy word having n 1 bits and, for each order i, in which 1≦i≦n, the k bits of order i of the redundancy words are redundancy bits of the n 2 -k bits of order i of the n 2 -k information words, said coding being performed by Hamming matrix, whose column vectors are chosen in such a way as to permit the correction of a given subset of possible errors and the error detecting code is applied to sequences of information words or to sequences of redundancy words, the words of a same sequence belonging to different linked sets, each transmitted block comprising a plurality of sequences of n 2 -k information words and the associated error detecting and correcting code words.
Claim 2
Dependent Claim
232 words
A process for the transmission in blocks of digital information words, each word having a length of n 1 bits, in which n 1 is an integer, said process comprising successively adding to the information words to be transmitted words of an error correcting code and words of an error detecting code, wherein the error correcting code is a Hamming code by means of which k redundancy words are added to each sequence of n 2 -k, n 2 being an integer greater than k, consecutive informtion words, said n 2 -k information words forming with the K redundancy words a set of words called the linked set, each redundancy word having n 1 bits and, for each order i, in which 1≦i≦n, the k bits of order i of the redundancy words are redundancy bits of the n 2 -k bits of order i of the n 2 -k information words, said coding being performed by Hamming matrix, whose column vectors are chosen in such a way as to permit the correction of a given subset of possible errors and the error detecting code is applied to sequences of information words or to sequences of redundancy words, the words of a same sequence belonging to different linked sets, each transmitted block comprising a plurality of sequences of n 2 -k information words and the associated error detecting and correcting code words.
Claim 3
Dependent Claim
13 words
A process according to claim 1, wherein an extended Hamming code is used.
Claim 4
Dependent Claim
43 words
A process according to claim 1, wherein, for producing the k redundancy bits associated with the n 2 -k information bits, use is made of a Hamming matrix with n 2 and k rows, whereof all the column vectors are of uneven parity.
Claim 5
Dependent Claim
47 words
A process according to claim 1, wherein, for producing the k redundancy bits associated with n 2 -k information bits, use is made of a Hamming matrix with n 2 columns and k rows, whereof any sequence of k consecutive column vectors forms a linearly independent system.
Claim 6
Dependent Claim
64 words
A process according to claim 1, wherein for producing the k redundancy bits associated with n 2 -k information bits, use is made of a Hamming matrix with n 2 columns and k rows, whereof any sequence of k vectors of indexes i, i+P, i+2P, . . . , i+(k-1)P, in which i,P are integers and i+(k-1)P≦n 2 , forms a linearly independent system.
Claim 7
Dependent Claim
57 words
A process according to claim 5 for recording a block on an information medium comprising P parallel recording tracks, wherein the n 2 words of a linked set are distributed over the P tracks, so that the words recorded on the same track are associated with column vectors of the Hamming matrix forming a linearly independent system.
Claim 8
Dependent Claim
60 words
A process according to claim 1, wherein, after associating k redundancy words with n 2 -k information words for forming a set of linked words, the words of n 3 linked sets are interlaced to form a transmission block constituted by n 2 , each group containing one word of each linked set and at least one error detecting code.
Claim 9
Dependent Claim
47 words
A process according to claim 7, wherein the block contains even information words and uneven information words and the groups containing redundancy words are placed in the center of the block, between the groups containing the even information words and the groups containing the uneven information words.
Claim 10
Dependent Claim
36 words
A process according to claim 8, wherein each word of a linked set is contained in a frame, each frame comprising a synchronization word, at least one information or redundancy word and an error detecting code.
Claim 11
Dependent Claim
103 words
A process according to claim 9 for recording a block on an information medium comprising P parallel tracks, each group of said block comprising f frames, in which f is prime to the number of tracks P, wherein the n 2 words of a linked set are distributed over P tracks, so that the words recorded on the same track are associated with column vectors of the Hamming matrix forming a linearly independent system and wherein the block is recorded frame by frame, the frames of each set of P consecutive frames of the block being placed in parallel on the P tracks.
Claim 12
Dependent Claim
90 words
A process according to claim 1, wherein additionally, on reception, determination takes place of the validity of each information or redundancy bit linked with the error detecting codes associated with the information or redundancy words and for each set of n 2 linked bits, the syndrome associated with said set is calculated and from said syndrome and the validity informations relative to each bit is calculated an error vector related to the Hamming code used and each vector of n 2 -k bits received is corrected by said error vector.
Claim 13
Dependent Claim
87 words
A process according according to claim 11, wherein, for calculating the error vector of a vector of n 2 -k linked bits, a reduced matrix (H') constituted by the column vectors of the Hamming matrix (H) used on transmission is defined and whereof the orders are equal to those of the linked bits invalidated by the error detecting codes and from this is deduced another matrix (H' -1 , H"), such that the product of said other matrix by the syndrome is equal to the error vector.
Claim 14
Dependent Claim
36 words
A process according to claim 11, wherein, for each set of linked bits, use is made of the syndrome, when it is not zero, for detecting the erroneous bits not invalidated by the error detecting codes.
Claim 15
Dependent Claim
117 words
A process according to claim 11, in which the information and redundancy words are transmitted in frames, wherein detection takes place of the validity of a received frame relative to its error detecting code and wherein for each set of linked frames definition takes place of a reduced matrix (H") constituted by the column vectors of the Hamming matrix (H) used on transmission and whereof the orders are equal to those of the linked frames invalidated by the error detecting codes and deduction takes place of another single matrix (H' -1 , H") for each set of linked frames, so that the product of this other matrix by a non-zero syndrome is equal to the error vector.
Claim 16
Dependent Claim
41 words
A process according to claim 14, wherein at least certain non-zero syndromes associated with sets of linked bits of linked frames are stored and wherein said non-zero syndromes are used for detecting erroneous frames not invalidated by the error detecting codes.
References Cited (Backward Citations)
US3439331A
Cited
US4336612A
Cited
GB2061575A
Cited
US4641309A
Cited
US4622598A
Cited
GB2140178A
Cited
EP0129224A1
Cited
US4646170A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-05-10 | 1991-11-09 | 1992-05-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-05-10 | 1995-11-09 | 1996-05-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-05-10 | 1999-11-09 | 2000-05-10 | $7700.00 | Window Closed / Lapsed |