← Back to Patent Explorer
US4750138A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of transmitting information, encoding device for use in the method, and decoding device for use in the method

Assignee: US Philips Corp
•
Filing: 1985-03-11
•
Granted: 1988-06-07
•
Expires: 2005-03-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for converting m-bit information words into n-bit code words and vice versa. The code words have a limited disparity in order to obtain a d.c. free code. A reduction of the low-frequency content of the spectrum is obtained by selecting the code words in such a way that the sum ##EQU1## remains restricted over all the previously generated bits x j of the preceding code words.

Inventors

  • 👤 Kornelis A. Schouhamer Immink

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 16:38
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 169 words
A method of encoding an information signal to be transmitted, comprising the steps of: a. receiving the information signal which comprises m-bit information words where m is a positive integer; b. converting m-bit information words into a n-bit code words prior to transmission, which includes selecting said n-bit code words so that a first running sum, ##EQU17## remains restricted over the bits of the n-bit code words regardless of the sequence of information words, x j being a value of a J th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, where n is a positive integer greater than m; c. providing the n-bit code words to a transmitter; wherein the improvement comprises: d. selecting said n-bit code words so that a second running sum, ##EQU18## remains restricted over the preceding sums over the bits of the n-bit code words, whereby the low frequency content of the encoded information signal is reduced.
Claim 2
Independent Claim 169 words
A method of encoding an information signal to be transmitted, comprising the steps of: a. receiving the information signal which comprises m-bit information words where m is a positive integer; b. converting m-bit information words into a n-bit code words prior to transmission, which includes selecting said n-bit code words so that a first running sum, ##EQU17## remains restricted over the bits of the n-bit code words regardless of the sequence of information words, x j being a value of a J th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, where n is a positive integer greater than m; c. providing the n-bit code words to a transmitter; wherein the improvement comprises: d. selecting said n-bit code words so that a second running sum, ##EQU18## remains restricted over the preceding sums over the bits of the n-bit code words, whereby the low frequency content of the encoded information signal is reduced.
Claim 3
Dependent Claim 18 words
The method of claim 1 comprising reconverting said n-bit code words into said m-bit information words after transmission.
Claim 4
Dependent Claim 25 words
The method of claim 1 comprising first selecting, for a first group of information words, code words so that ##EQU19## for every n-bit code word.
Claim 5
Dependent Claim 70 words
The method of claim 3 comprising: (i) second selecting, for a second group of information words, first and second code words so that the sum, ##EQU20## has a value +a and -b, respectively, over each said first and second code word; (ii) choosing one of the two possible code words for each information word of said second group, so that the absolute value of said second running sum is minimized.
Claim 6
Dependent Claim 70 words
The method of claim 1 comprising: (i) selecting, for each of a group of information words, first and second code words so that a sum, ##EQU21## has a value +a and -b, respectively, over each said first and second code word; and (ii) choosing one of the two possible code words for an information word of said group, so that the absolute value of said second running sum is minimized.
Claim 7
Dependent Claim 13 words
The method of claim 4 or 5 wherein a and b are equal.
Claim 8
Independent Claim 167 words
A method of decoding a transmitted encoded information signal, comprising the steps of: a. receiving the encoded information signal which comprises n-bit code words, where n is a positive integer, the n-bit code words being such that a first runnig sum, ##EQU22## remains restricted over the bits of the n-bit code words regardless of the sequence of the information words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, the n-bit code words also being such that a second running sum, ##EQU23## remains restricted over the preceding sums over the bits of the generated code words, whereby the d.c. and low frequency content of the code words was reduced prior to transmission; b. converting the n-bit code words into m-bit information words, where m is a positive integer less than n; and c. providing the m-bit information words as the information signal.
Claim 9
Independent Claim 167 words
A method of decoding a transmitted encoded information signal, comprising the steps of: a. receiving the encoded information signal which comprises n-bit code words, where n is a positive integer, the n-bit code words being such that a first runnig sum, ##EQU22## remains restricted over the bits of the n-bit code words regardless of the sequence of the information words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, the n-bit code words also being such that a second running sum, ##EQU23## remains restricted over the preceding sums over the bits of the generated code words, whereby the d.c. and low frequency content of the code words was reduced prior to transmission; b. converting the n-bit code words into m-bit information words, where m is a positive integer less than n; and c. providing the m-bit information words as the information signal.
Claim 10
Dependent Claim 28 words
The method of claim 7 wherein the receiving step comprises receiving, for a first group of information words, code words for which: ##EQU24## for every n-bit code word.
Claim 11
Dependent Claim 77 words
The method of claim 8 wherein the receiving step comprises receiving, for a second group of information words, first and second code words for which the sum, ##EQU25## has a value +a and -b respectively, over each said first and second code word, one of the first and second possible code words for each information word of said second group appearing in the encoded information so that the absolute value of said second running sum is minimized.
Claim 12
Dependent Claim 76 words
The method of claim 7 wherein the receiving step comprises, for each of a group of information words, first and second code words for which a sum, ##EQU26## has a value +a and -b, respectively, over each said first and second code word, one of the first and second possible code words for an information word of said group appearing in the encoded information so that the absolute value of said second running sum is minimized.
Claim 13
Dependent Claim 13 words
The method of claim 9 or 10 wherein a and b are equal.
Claim 14
Dependent Claim 172 words
Apparatus for encoding an information signal prior to transmission, comprising: a. means for receiving the information signal which comprises m-bit information words, where m is a positive integer; b. means for converting the m-bit information words into n-bit code words so that a first running sum, ##EQU27## remains restricted over the bits of the n-bit code words regardless of the sequence of information words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, where n is a positive integer and n>m; c. means for providing an encoded information signal in the form of the n-bit code words; wherein the improvement comprises that: d. the converting means converts the m-bit information words into n-bit code words so that a second running sum ##EQU28## remains restricted over the preceding sums over the bits of the n-bit code words whereby the low-frequency content of the encoded information signal is reduced.
Claim 15
Dependent Claim 172 words
Apparatus for encoding an information signal prior to transmission, comprising: a. means for receiving the information signal which comprises m-bit information words, where m is a positive integer; b. means for converting the m-bit information words into n-bit code words so that a first running sum, ##EQU27## remains restricted over the bits of the n-bit code words regardless of the sequence of information words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero, where n is a positive integer and n>m; c. means for providing an encoded information signal in the form of the n-bit code words; wherein the improvement comprises that: d. the converting means converts the m-bit information words into n-bit code words so that a second running sum ##EQU28## remains restricted over the preceding sums over the bits of the n-bit code words whereby the low-frequency content of the encoded information signal is reduced.
Claim 16
Dependent Claim 73 words
The apparatus of claim 12 wherein: a. the receiving means comprises a series/parallel converter having parallel output means at which the m bits of the m-bit information words are provided in parallel; b. the converting means comprises a lookup table addressable by the m-bit information words and coupled to the output means of the series/parallel converter; and c. the providing means comprises a parallel/series converter coupled to an output of the converting means.
Claim 17
Dependent Claim 65 words
The Apparatus of claim 12 wherein: a. the receiving means comprises a series/parallel converter having a parallel output means at which the m bits of the m-bit information words are provided in parallel; and b. the converting means comprises a gating means having inputs coupled to the output means of the series/parallel converter; and c. the providing means comprises an output of the gating means.
Claim 18
Dependent Claim 195 words
Apparatus for receiving and decoding transmitted encoded information signals in which d.c. and low frequency components have been reduced, comprising: a. means for receiving the encoded information signals which comprise n-bit code words, where n is a positive integer, the n-bit code words being such that a first running sum ##EQU29## remains restricted over bits of said n-bit code words regardless of the sequence of information words encoded into said code words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero; b. means for converting the n-bit code words into m-bit information words, from which the n-bit code words were derived prior to transmission, there m is an integer less than n: c. means for providing the m-bit information words as a decoded information signal; wherein the improvement comprises: d. the n-bit code words are such that a second running sum ##EQU30## remains restricted over the preceding sums over the bits of the code words, whereby the d.c. and low frequency content of the code words has been further reduced.
Claim 19
Dependent Claim 195 words
Apparatus for receiving and decoding transmitted encoded information signals in which d.c. and low frequency components have been reduced, comprising: a. means for receiving the encoded information signals which comprise n-bit code words, where n is a positive integer, the n-bit code words being such that a first running sum ##EQU29## remains restricted over bits of said n-bit code words regardless of the sequence of information words encoded into said code words, x j being a value of a j th bit and x j having a first value for a logic one and a second value opposite to said first value for a logic zero; b. means for converting the n-bit code words into m-bit information words, from which the n-bit code words were derived prior to transmission, there m is an integer less than n: c. means for providing the m-bit information words as a decoded information signal; wherein the improvement comprises: d. the n-bit code words are such that a second running sum ##EQU30## remains restricted over the preceding sums over the bits of the code words, whereby the d.c. and low frequency content of the code words has been further reduced.
Claim 20
Dependent Claim 73 words
The apparatus of claim 15 wherein: a. the receiving means comprises a series/parallel converter having a parallel output means at which the n bits of the n-bit code words are provided in parallel; b. the reconverting means comprises a lookup table addressable by the n-bit code words and coupled to the output means of the series/parallel converter; and c. the providing means comprises a parallel/series converter at an output of the reconverting means.
Claim 21
Dependent Claim 63 words
The apparatus of claim 15 wherein: a. the receiving means comprises a series/parallel converter having a parallel output means at which the n bits of the n-bit code words are provided in parallel; b. the reconverting means comprises gating means having inputs coupled to the output means of the series/parallel converter; and c. the providing means comprises an output of the gating means.
Claim 22
Dependent Claim 134 words
Apparatus for for encoding an information signal prior to transmission, comprising: a. an input for receiving the information signal which comprises information words; b. means for converting the information words into respective code words, the respective code words having a longer bit length than the corresponding information words and the respective code words being such that a first running sum, of values of the bits of the code words, remains restricted, regardless of the sequence of the information words, and so that a second running sum, of all preceding values of the first running sum, also remains restricted, regardless of the sequence of the information words; and c. means for providing an encoded information signal in the form of the code words, whereby the low frequency content of the encoded information signal is reduced.
Claim 23
Dependent Claim 134 words
Apparatus for for encoding an information signal prior to transmission, comprising: a. an input for receiving the information signal which comprises information words; b. means for converting the information words into respective code words, the respective code words having a longer bit length than the corresponding information words and the respective code words being such that a first running sum, of values of the bits of the code words, remains restricted, regardless of the sequence of the information words, and so that a second running sum, of all preceding values of the first running sum, also remains restricted, regardless of the sequence of the information words; and c. means for providing an encoded information signal in the form of the code words, whereby the low frequency content of the encoded information signal is reduced.

References Cited (Backward Citations)

GB1540617A Cited
US4348659A Cited
US4598267A Cited
US4573034A Cited
US4620311A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-06-07 1991-12-07 1992-06-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-06-07 1995-12-07 1996-06-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-06-07 1999-12-07 2000-06-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag