US5016258A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital modulator and demodulator
Assignee: Panasonic Holdings Corp
•
Filing: 1989-06-09
•
Granted: 1991-05-14
•
Expires: 2009-06-09
Abstract
Abstract A digital modulator converts M-bit data words to N-bit code words (N>M) each containing a specific number of bits `1`. The specific number is one of a plurality of predetermined numbers which are different by at least 3 from one another. A specific data word may be converted to either one of two code words having different numbers of bits `1` from each other so as to reduce DC components of a channel code constituted by the code words.
Inventors
- 👤 Shinichi Tanaka
- 👤 Hiromichi Ishibashi
- 👤 Akira Mitsubara
- 👤 Tsuyoshi Okada
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 15:05
CPC Classifications
H; H03; H03M; H03M1/00; H03M1/02; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
161 words
A digital modulator for converting an input data train to a coded data train, comprising: grouping means for separating the input data train into data words each being composed of M bits; encoding means for converting each of the data words into a corresponding one of a plurality of code words each being composed of N bits, where N>M, and each containing a specific number of `1` bits, said plurality of code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in one of said groups is different by at least 3 from the number of `1` bits contained in each code word in another of said groups; and transmitting means for transmitting the code word outputted from the encoding means in the form of a serial channel code.
Claim 2
Dependent Claim
161 words
A digital modulator for converting an input data train to a coded data train, comprising: grouping means for separating the input data train into data words each being composed of M bits; encoding means for converting each of the data words into a corresponding one of a plurality of code words each being composed of N bits, where N>M, and each containing a specific number of `1` bits, said plurality of code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in one of said groups is different by at least 3 from the number of `1` bits contained in each code word in another of said groups; and transmitting means for transmitting the code word outputted from the encoding means in the form of a serial channel code.
Claim 3
Dependent Claim
30 words
A digital modulator as defined in claim 1 wherein M is 8, N is 10, and the number of `1` bits contained in the code word is 2 or 5.
Claim 4
Dependent Claim
24 words
A digital modulator as defined in claim 2, wherein `1` bits in a code word having two `1` bits are adjoined to each other.
Claim 5
Dependent Claim
30 words
A digital modulator as defined in claim 1 wherein M is 8, N is 10, and the number of `1` bits contained in the code word is 5 or 8.
Claim 6
Dependent Claim
87 words
A digital modulator as defined in claim 1, wherein M is 8, N is 10, and the number of `1` bits contained in the code word is 2, 5 or 8; and wherein said encoding means converts some of the data words each to one of a code word having two `1` bits and a code word having eight `1` bits so as to reduce the DC component of the channel code, and converts the remaining data words each to a code word having five `1` bits.
Claim 7
Dependent Claim
40 words
A digital modulator as defined in claim 5, wherein `1` bits in a code word having two `1` bits are adjoined to each other while `0` bits in a code word having eight `1` bits are adjoined to each other.
Claim 8
Dependent Claim
87 words
A digital modulator as defined in claim 1, wherein M is 8, N is 10, and the number of `1` bits contained in the code word is 1, 5 or 9; and wherein said encoding means converts some of the data words each to one of a code word having one `1` bit and a code word having nine `1` bits so as to reduce the DC component of the channel code, and converts the remaining data words each to a code word having five `1` bits.
Claim 9
Dependent Claim
86 words
A digital modulator as defined in claim 1, wherein M is 8, N is 10, and said encoding means converts a data word which contains 3, 4 or 5 `1` bits into a code word by adding additional 2 bits to a specific position thereof, the additional 2 bits being designated as `1` and `1` when the data word contains 3 `1` bits, `1` and `0` when the data word contains 4 `1` bits, and `0` and `0` when the data word contains 5 `1` bits.
Claim 10
Dependent Claim
229 words
A demodulator for reproducing data words each being composed of M bits from a channel signal formed of a serial train of code words each being composed of N bits, where N>M, and containing a specific number of `1` bits, said code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in the number of `1` bits contained in each code word in another of said groups, comprising: a plurality of voltage comparating means having different thresholds from one another for waveform shaping the channel signal with the respective thresholds; a plurality of counting means which are respectively coupled to the plurality of voltage comparating means and each of which is for separating an output of a corresponding one of the plurality of voltage comparating means into N-bit words and counting the number of `1` bits contained in each N-bit word; maximum likelihood detecting means for identifying as a code word one having a maximum likelihood from N-bit words in each of which the number counted by the counting means corresponds to one of the predetermined numbers; and decoding means for decoding the code word identified by the maximum likelihood detecting means to recover a data word.
Claim 11
Dependent Claim
229 words
A demodulator for reproducing data words each being composed of M bits from a channel signal formed of a serial train of code words each being composed of N bits, where N>M, and containing a specific number of `1` bits, said code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in the number of `1` bits contained in each code word in another of said groups, comprising: a plurality of voltage comparating means having different thresholds from one another for waveform shaping the channel signal with the respective thresholds; a plurality of counting means which are respectively coupled to the plurality of voltage comparating means and each of which is for separating an output of a corresponding one of the plurality of voltage comparating means into N-bit words and counting the number of `1` bits contained in each N-bit word; maximum likelihood detecting means for identifying as a code word one having a maximum likelihood from N-bit words in each of which the number counted by the counting means corresponds to one of the predetermined numbers; and decoding means for decoding the code word identified by the maximum likelihood detecting means to recover a data word.
Claim 12
Dependent Claim
32 words
A demodulator as defined in claim 9, wherein the maximum likelihood detecting means recognizes a threshold of the voltage comparating means which is most approximate to a reference value as a likelihood.
Claim 13
Dependent Claim
229 words
A demodulator for reproducing data words each being composed of M bits from a channel signal formed of a serial train of code words each being composed of N bits, where N>M, and containing a specific number of `1` bits, said code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in one of said groups is different by at least 3 from the number of `1` bits contained in each code word in another of said groups, comprising: sampling holding means for sampling the channel signal; analog to digital converter means for converting the sampled values into digital values; sorting means for arranging the digital values in order from the largest value to the smallest value; classifying means for computing a difference between an i-th largest value and an i+1th largest value of the digital values arranged by the sorting means, where i is one of said predetermined numbers, and determining i as the number of `1` bits in the code word when said difference exceeds a specified value; and code word reproducing means for reproducing a code word by recognizing i bits as `1` in the order from the largest likelihood in the digital values.
Claim 14
Dependent Claim
229 words
A demodulator for reproducing data words each being composed of M bits from a channel signal formed of a serial train of code words each being composed of N bits, where N>M, and containing a specific number of `1` bits, said code words being classified into at least two groups such that the number of `1` bits contained in each code word in each of said groups is the same and such that the number of `1` bits contained in each code word in one of said groups is different by at least 3 from the number of `1` bits contained in each code word in another of said groups, comprising: sampling holding means for sampling the channel signal; analog to digital converter means for converting the sampled values into digital values; sorting means for arranging the digital values in order from the largest value to the smallest value; classifying means for computing a difference between an i-th largest value and an i+1th largest value of the digital values arranged by the sorting means, where i is one of said predetermined numbers, and determining i as the number of `1` bits in the code word when said difference exceeds a specified value; and code word reproducing means for reproducing a code word by recognizing i bits as `1` in the order from the largest likelihood in the digital values.
References Cited (Backward Citations)
US3689899A
Cited
US3913093A
Cited
US4020282A
Cited
US4358852A
Cited
US4538203A
Cited
US4802154A
Cited
EP0138229A2
Cited
US4598326A
Cited
US4573034A
Cited
US4620311A
Cited
EP0150082A2
Cited
EP0154389A1
Cited
US4599717A
Cited
US4606016A
Cited
US4646281A
Cited
US4855742A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-05-13 | 1994-11-12 | 1995-05-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-05-13 | 1998-11-12 | 1999-05-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-05-13 | 2002-11-12 | 2003-05-14 | $7700.00 | Window Closed / Lapsed |