US5469162A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data modulation method
Assignee: Sony Corp
•
Filing: 1993-03-30
•
Granted: 1995-11-21
•
Expires: 2013-03-30
Abstract
Abstract In a data modulation method, m-bit data is modulated to n-bit data (n≧m) having fewer direct current and low frequency components. A dispersion of the digital sum variation of code weights can be reduced, a direct current component is reduced and an error rate can be further reduced by selecting a plurality of modulation tables constituting the combination of one or more sub-groups of modulation data obtained by dividing a group of modulation data by a code weight having the same value based on the digital sum variation of the code weights accumulated until a time at which m-bit data is converted to n-bit code and converting next m-bit data continuously to present m-bit data to n-bit code by using the modulation tables.
Inventors
- 👤 Yasuyuki Chaki
- 👤 Yoshihide Shimpuku
- 👤 Hiroyuki Ino
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 16:12
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
258 words
A data modulation method for modulating m-bit data to a modulation code of n bits with fewer direct current components in a code system as a whole, wherein n bits are larger than m bits, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with respective code weights having one of a plurality Of predetermined values from all modulation codes composed of n bits, and then forming a plurality of modulation tables storing a respective plurality of subgroups of modulation codes obtained by subdividing said group of modulation codes, each subgroup comprising modulation codes with respective code weights having one of a corresponding combination of two or more of said plurality of predetermined values; and sequentially modulating a plurality of said m-bit data to a respective plurality of said n-bit modulation codes by using said modulation tables, said m-bit data being modulated by converting said m-bit data to a plurality of n-bit candidate modulation codes with respective code weights using said respective plurality of modulation tables, selecting one of said plurality of n-bit candidate modulation codes with respective code weights, based on a digital sum variation of code weights accumulated until a time at which said m-bit data is converted to said plurality of n-bit candidate modulation codes, and then supplying said selected one of said plurality of n-bit candidate modulation codes as said n-bit modulation code, and updating said digital sum variation of code weights using a corresponding code weight of said selected one of said plurality of n-bit candidate modulation codes.
Claim 2
Dependent Claim
258 words
A data modulation method for modulating m-bit data to a modulation code of n bits with fewer direct current components in a code system as a whole, wherein n bits are larger than m bits, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with respective code weights having one of a plurality Of predetermined values from all modulation codes composed of n bits, and then forming a plurality of modulation tables storing a respective plurality of subgroups of modulation codes obtained by subdividing said group of modulation codes, each subgroup comprising modulation codes with respective code weights having one of a corresponding combination of two or more of said plurality of predetermined values; and sequentially modulating a plurality of said m-bit data to a respective plurality of said n-bit modulation codes by using said modulation tables, said m-bit data being modulated by converting said m-bit data to a plurality of n-bit candidate modulation codes with respective code weights using said respective plurality of modulation tables, selecting one of said plurality of n-bit candidate modulation codes with respective code weights, based on a digital sum variation of code weights accumulated until a time at which said m-bit data is converted to said plurality of n-bit candidate modulation codes, and then supplying said selected one of said plurality of n-bit candidate modulation codes as said n-bit modulation code, and updating said digital sum variation of code weights using a corresponding code weight of said selected one of said plurality of n-bit candidate modulation codes.
Claim 3
Dependent Claim
152 words
A data modulation method for modulating m-bit data to a modulation code of n bits with fewer direct current components in a code system as a whole, wherein n bits are larger than m bits, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with code weights having a value of one of "+1", "-1", "+3", "-3" from all modulation codes composed of n bits, and then forming a plurality of modulation tables by combining said modulation codes within a group of sub modulation codes obtained by subdividing said group of modulation codes; selecting one of said plurality of modulation tables, based on digital sum variation of said code weights accumulated until a time at which said m-bit data is modulated to said n-bit code; and modulating next said m-bit data continuously to present said m-bit data to said n-bit modulation code by using said modulation tables.
Claim 4
Dependent Claim
152 words
A data modulation method for modulating m-bit data to a modulation code of n bits with fewer direct current components in a code system as a whole, wherein n bits are larger than m bits, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with code weights having a value of one of "+1", "-1", "+3", "-3" from all modulation codes composed of n bits, and then forming a plurality of modulation tables by combining said modulation codes within a group of sub modulation codes obtained by subdividing said group of modulation codes; selecting one of said plurality of modulation tables, based on digital sum variation of said code weights accumulated until a time at which said m-bit data is modulated to said n-bit code; and modulating next said m-bit data continuously to present said m-bit data to said n-bit modulation code by using said modulation tables.
Claim 5
Dependent Claim
18 words
The data modulation method according to claim 2, wherein: said m is 8 and said n is 11.
Claim 6
Dependent Claim
230 words
The data modulation method according to claim 3, wherein said plurality of modulation tables comprises five modulation tables, including: a first modulation table formed so that a modulation code with a code weight having a value of "+1" or "-1" is selected with a probability of 1/2, respectively; a second modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 181/256 and a modulation code with a code weight of "-1" is selected with a probability of 75/256; a third modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 75/256, and a modulation code with a code weight having a value of "-1" is selected with a probability of 181/256; a fourth modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "+3" is selected with a probability of 75/256; and a fifth modulation table formed so that a modulation code with a code weight having a value of "-3" is selected with a probability of 75/256, and a modulation code with a code weight having a value of "-1" is selected with a probability of 181/256.
Claim 7
Dependent Claim
112 words
The data modulation method according to claim 3, wherein said plurality of modulation tables comprises two modulation tables, including: a first modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "+3" is selected with a probability of 75/256; and a second modulation table formed so that a modulation code with a code weight having a value of "-3" is selected with a probability of 75/256, and a modulation code with a code weight having a value of "-1" is selected with a probability of 181/256.
Claim 8
Dependent Claim
204 words
The data modulation method according to claim 3, wherein said plurality of modulation tables comprises four modulation tables, including: a first modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "+3" is selected with a probability of 75/256; a second modulation table formed so that a modulation code with a code weight having a value of "-1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "+3" is selected with a probability of 75/256; a third modulation table formed so that a modulation code with a code weight having a value of "+1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "-3" is selected with a probability of 75/256; and a fourth modulation table formed so that a modulation code with a code weight having a value of "-1" is selected with a probability of 181/256, and a modulation code with a code weight having a value of "-3" is selected with a probability of 75/256.
Claim 9
Dependent Claim
238 words
A data modulation method for modulating 8-bit data to 11-bit modulation code with less direct current component in a code system as a whole, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with respective code weights having one of a plurality of predetermined values from all modulation codes composed of 11 bits, and then forming five modulation tables storing respective subgroups of modulation codes obtained by subdividing said group of modulation codes, each subgroup comprising modulation codes with respective code weights having one of a corresponding combination of two or more of said plurality of predetermined values; and sequentially modulating a plurality of said 8-bit data to a respective plurality of said 11-bit modulation code by using said modulation tables, said 8-bit data being modulated by converting said 8-bit data to five 11-bit candidate modulation codes with five respective code weights using said five respective modulation tables, selecting one of said five 11-bit candidate modulation codes with said five respective code weights, based on a digital sum variation of code weights accumulated until a time at which said 8-bit data is modulated to said five 11-bit candidate modulation codes, and then supplying said selected one of said five 11-bit candidate modulation codes as said 11-bit modulation code, and updating said digital sum variation of code weights using a corresponding code weight of said selected one of said five 11-bit candidate modulation codes.
Claim 10
Dependent Claim
238 words
A data modulation method for modulating 8-bit data to 11-bit modulation code with less direct current component in a code system as a whole, comprising the steps of: constituting a group of modulation codes by gathering modulation codes with respective code weights having one of a plurality of predetermined values from all modulation codes composed of 11 bits, and then forming five modulation tables storing respective subgroups of modulation codes obtained by subdividing said group of modulation codes, each subgroup comprising modulation codes with respective code weights having one of a corresponding combination of two or more of said plurality of predetermined values; and sequentially modulating a plurality of said 8-bit data to a respective plurality of said 11-bit modulation code by using said modulation tables, said 8-bit data being modulated by converting said 8-bit data to five 11-bit candidate modulation codes with five respective code weights using said five respective modulation tables, selecting one of said five 11-bit candidate modulation codes with said five respective code weights, based on a digital sum variation of code weights accumulated until a time at which said 8-bit data is modulated to said five 11-bit candidate modulation codes, and then supplying said selected one of said five 11-bit candidate modulation codes as said 11-bit modulation code, and updating said digital sum variation of code weights using a corresponding code weight of said selected one of said five 11-bit candidate modulation codes.
References Cited (Backward Citations)
US4490712A
Cited
US4517552A
Cited
US5192949A
Cited
US5196848A
Cited
US5198813A
Cited
US5304996A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-11-20 | 1999-05-22 | 1999-11-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-11-20 | 2003-05-22 | 2003-11-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-11-20 | 2007-05-22 | 2007-11-21 | $7700.00 | Window Closed / Lapsed |