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

Data conversion method and recording and reproduction apparatus

Assignee: Mitsubishi Electric Corp
•
Filing: 1994-07-05
•
Granted: 1996-04-16
•
Expires: 2014-07-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Codewords with CDS=0 are mapped in corresponding relationship to datawords, and codewords with CDS>0 and codewords with CDS<0 are paired together and mapped in corresponding relationship to the remaining datawords, and further, codewords with CDS≠0, left unmapped, are mapped in corresponding relationship to the datawords to which the codewords with CDS=0 have been mapped, thus reducing the probability of occurrence of codewords with large DSV in absolute value terms and thereby achieving a further suppression of low-frequency components. Based on the least significant bit of the codeword corresponding to the last dataword and on the current and next datawords, a codeword corresponding to the current dataword is selected, thus realizing high-density recording with good overwrite characteristics.

Inventors

  • 👤 Junichi Nose
  • 👤 Hideki Kaneko
  • 👤 Tatsuo Yamasaki
  • 👤 Ken Onishi
  • 👤 Masako Yamada
  • 👤 Taketoshi Hibi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 17:19
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; 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: 20
Claim 1
Independent Claim 274 words
A data conversion method for converting m-bit datawords in to n-bit codewords, wherein binary values 1 and 0 are represented by +1 and -1 respectively, the value of the integral thereof being taken as a digital sum variation (DSV), the value of the DSV from the beginning to the end of a codeword being added together to form a codewords digital sum (CDS), and the n-bit codewords being mapped in corresponding relationship to the m-bit datawords in accordance with the following rule: (a) codewords with CDS=0 in corresponding relationship to datawords, and pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to other datawords, and further, pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to the datawords to which the codewords with CDS=0 have been mapped, and (b) when DSV=0, in cases where there is a codeword with CDS=0 among the codewords corresponding to the datawords, then selecting the codeword with CDS=0, and in cases where there is no such codeword, then selecting a codeword with CDS≠0; when DSV>0, in cases where there is a codeword with CDS<0 among the codewords corresponding to the datawords, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting a codeword with CDS=0 and when DSV<0, in cases where there is a codeword with CDS>0 among the codewords corresponding to the datawords, then selecting the codeword with CDS>0, and in cases where there is no such codeword, then selecting a codeword with CDS=0.
Claim 2
Dependent Claim 274 words
A data conversion method for converting m-bit datawords in to n-bit codewords, wherein binary values 1 and 0 are represented by +1 and -1 respectively, the value of the integral thereof being taken as a digital sum variation (DSV), the value of the DSV from the beginning to the end of a codeword being added together to form a codewords digital sum (CDS), and the n-bit codewords being mapped in corresponding relationship to the m-bit datawords in accordance with the following rule: (a) codewords with CDS=0 in corresponding relationship to datawords, and pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to other datawords, and further, pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to the datawords to which the codewords with CDS=0 have been mapped, and (b) when DSV=0, in cases where there is a codeword with CDS=0 among the codewords corresponding to the datawords, then selecting the codeword with CDS=0, and in cases where there is no such codeword, then selecting a codeword with CDS≠0; when DSV>0, in cases where there is a codeword with CDS<0 among the codewords corresponding to the datawords, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting a codeword with CDS=0 and when DSV<0, in cases where there is a codeword with CDS>0 among the codewords corresponding to the datawords, then selecting the codeword with CDS>0, and in cases where there is no such codeword, then selecting a codeword with CDS=0.
Claim 3
Dependent Claim 38 words
A data conversion method according to claim 1, wherein said step (a) of mapping maps the n-bit codewords in corresponding relationship to the m-bit datawords in order of increasing magnitude of the codeword CDS in absolute value terms.
Claim 4
Dependent Claim 44 words
A data conversion method according to claim 1, wherein said step (a) of mapping, in mapping the n-bit codewords in corresponding relationship to the m-bit datawords, pairs codewords with CDS≠0 in decreasing order of the DSV change range within the codewords with CDS -0.
Claim 5
Dependent Claim 286 words
A data conversion method for converting m-bit datawords in to n-bit codewords, wherein binary values 1 and 0 are represented by +1 and -1 respectively, the value of the integral thereof being taken as a digital sum variation (DSV), the value of the DSV from the beginning to the end of a codeword being added together to form a codeword digital sum (CDS), and the n-bit codewords being mapped in corresponding relationship to the m-bit datawords in accordance with the following rule: (a) mapping codewords with CDS=0 in corresponding relationship to datawords, and pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to other datawords, and further, pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to the datawords to which the codewords with CDS=0 have been mapped, while mapping codewords with CDS≠0, left unpaired, in corresponding relationship to the datawords to which only the codewords with CDS =0 have been mapped, and (b) when DSV=0, in cases where there is a codeword with CDS =0 among the codewords corresponding to the datawords, then selecting the codeword with CDS=0, and in cases where there is no such codeword, then selecting a codeword with CDS ≠0; when DSV>0, in cases where there is a codeword with CDS<0 among the codewords corresponding to the datawords, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting a codeword with CDS=0; and when DSV<0, in cases where there is a codeword with CDS>0 among the codewords corresponding to the datawords, then selecting the codeword with CDS>0, and in cases where there is no such codeword, then selecting a codeword with CDS=0.
Claim 6
Dependent Claim 286 words
A data conversion method for converting m-bit datawords in to n-bit codewords, wherein binary values 1 and 0 are represented by +1 and -1 respectively, the value of the integral thereof being taken as a digital sum variation (DSV), the value of the DSV from the beginning to the end of a codeword being added together to form a codeword digital sum (CDS), and the n-bit codewords being mapped in corresponding relationship to the m-bit datawords in accordance with the following rule: (a) mapping codewords with CDS=0 in corresponding relationship to datawords, and pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to other datawords, and further, pairing codewords with CDS>0 and codewords with CDS<0 together and mapping them in corresponding relationship to the datawords to which the codewords with CDS=0 have been mapped, while mapping codewords with CDS≠0, left unpaired, in corresponding relationship to the datawords to which only the codewords with CDS =0 have been mapped, and (b) when DSV=0, in cases where there is a codeword with CDS =0 among the codewords corresponding to the datawords, then selecting the codeword with CDS=0, and in cases where there is no such codeword, then selecting a codeword with CDS ≠0; when DSV>0, in cases where there is a codeword with CDS<0 among the codewords corresponding to the datawords, then selecting the codeword with CDS<0, and in cases where there is no such codeword, then selecting a codeword with CDS=0; and when DSV<0, in cases where there is a codeword with CDS>0 among the codewords corresponding to the datawords, then selecting the codeword with CDS>0, and in cases where there is no such codeword, then selecting a codeword with CDS=0.
Claim 7
Dependent Claim 38 words
A data conversion method according to claim 4, wherein said step (a) of mapping maps the n-bit codewords in corresponding relationship to the m-bit datawords in order of increasing magnitude of the codeword CDS in absolute value terms.
Claim 8
Dependent Claim 43 words
A data conversion method according to claim 4, wherein said step (a) of mapping, in mapping the n-bit codewords in corresponding relationship to the m-bit datawords, pairs codewords with CDS≠0 in decreasing order of the DSV change range within the codewords with CDS=0.
Claim 9
Dependent Claim 210 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein said step of selecting includes, providing a conversion table in which a plurality of n-bit codewords with different CDS's or different least significant bits are mapped to a single m-bit dataword, using the conversion table, when converting the current m-bit dataword in to an n-bit codeword to calculate the DSV expected at the end of an n-bit codeword corresponding to the next m-bit dataword to be converted for each of two cases, i.e. a case where a first n-bit codeword in the conversion table is selected for the current m-bit dataword and a case where a second n-bit codeword in the conversion table is selected for the current m-bit dataword, and based on the thus calculated DSV, selecting an n-bit codeword corresponding to the current m-bit dataword from the conversion table.
Claim 10
Dependent Claim 210 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein said step of selecting includes, providing a conversion table in which a plurality of n-bit codewords with different CDS's or different least significant bits are mapped to a single m-bit dataword, using the conversion table, when converting the current m-bit dataword in to an n-bit codeword to calculate the DSV expected at the end of an n-bit codeword corresponding to the next m-bit dataword to be converted for each of two cases, i.e. a case where a first n-bit codeword in the conversion table is selected for the current m-bit dataword and a case where a second n-bit codeword in the conversion table is selected for the current m-bit dataword, and based on the thus calculated DSV, selecting an n-bit codeword corresponding to the current m-bit dataword from the conversion table.
Claim 11
Dependent Claim 128 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein when converting an m-bit dataword in to an n-bit codeword, different conversion tables are used in said step (b) of selecting for selection of the n-bit codeword in accordance with the DSV and the level at the end of an n-bit codeword corresponding to the immediately-preceding converted m-bit dataword.
Claim 12
Dependent Claim 128 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein when converting an m-bit dataword in to an n-bit codeword, different conversion tables are used in said step (b) of selecting for selection of the n-bit codeword in accordance with the DSV and the level at the end of an n-bit codeword corresponding to the immediately-preceding converted m-bit dataword.
Claim 13
Dependent Claim 161 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein the m-bit dataword is an 8-bit dataword, and the n-bit codeword is a 14-bit codeword, the n-bit codeword being selected in such a manner that in a codeword sequence after conversion, an arbitrary first logic value and the next first logic value are separated by a minimum of one second logic value and a maximum of five second logic values, and that the diverging range of the DSV in the signal obtained by NRZI-modulating the codeword sequence after conversion is made finite.
Claim 14
Dependent Claim 161 words
A data conversion method for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, wherein the m-bit dataword is an 8-bit dataword, and the n-bit codeword is a 14-bit codeword, the n-bit codeword being selected in such a manner that in a codeword sequence after conversion, an arbitrary first logic value and the next first logic value are separated by a minimum of one second logic value and a maximum of five second logic values, and that the diverging range of the DSV in the signal obtained by NRZI-modulating the codeword sequence after conversion is made finite.
Claim 15
Dependent Claim 219 words
A reproduction method employing a data conversion method for converting m-bit datawords in to n-bit codewords including, for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said reproduction method detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, and the level at the end of the immediately-preceding decoded n-bit codeword, when decoding an n-bit codeword sequence into the original m-bit datawords for reproduction; and performing decoding by selecting the original m-bit dataword corresponding to the n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately preceding decoded codeword.
Claim 16
Dependent Claim 219 words
A reproduction method employing a data conversion method for converting m-bit datawords in to n-bit codewords including, for converting m-bit datawords in to n-bit codewords, comprising the steps of: detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said reproduction method detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, and the level at the end of the immediately-preceding decoded n-bit codeword, when decoding an n-bit codeword sequence into the original m-bit datawords for reproduction; and performing decoding by selecting the original m-bit dataword corresponding to the n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately preceding decoded codeword.
Claim 17
Dependent Claim 304 words
A recording and reproduction apparatus employing a data conversion method for converting m-bit datawords in to n-bit codewords including, detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said apparatus comprising:, appending means for appending, when recording, an n-bit codeword so that the DSV at the end of an n-bit codeword corresponding to the immediately-preceding converted m-bit dataword is set to 0 or to a predetermined value; detecting means for detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying means for identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded and also the level at the end of the immediately-preceding decoded n-bit codeword; resetting means for detecting the area of the codeword appended during recording and for resetting the least significant bit and the DSV at the end of the codeword appended during recording to the least significant bit and the DSV in the recorded codeword sequence when detecting the least significant bit by said detecting means and identifying the DSV by said identifying means; and decoding means for performing decoding by selecting the original m-bit dataword corresponding to the current n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately-preceding decoded codeword.
Claim 18
Dependent Claim 304 words
A recording and reproduction apparatus employing a data conversion method for converting m-bit datawords in to n-bit codewords including, detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said apparatus comprising:, appending means for appending, when recording, an n-bit codeword so that the DSV at the end of an n-bit codeword corresponding to the immediately-preceding converted m-bit dataword is set to 0 or to a predetermined value; detecting means for detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying means for identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded and also the level at the end of the immediately-preceding decoded n-bit codeword; resetting means for detecting the area of the codeword appended during recording and for resetting the least significant bit and the DSV at the end of the codeword appended during recording to the least significant bit and the DSV in the recorded codeword sequence when detecting the least significant bit by said detecting means and identifying the DSV by said identifying means; and decoding means for performing decoding by selecting the original m-bit dataword corresponding to the current n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately-preceding decoded codeword.
Claim 19
Dependent Claim 277 words
A recording and reproduction apparatus employing a data conversion method for converting m-bit datawords in to n-bit codewords including, detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said apparatus comprising: appending means for appending, when recording, data indicating the DSV at the end of the n-bit codeword corresponding to the immediately-preceding converted m-bit dataword; detecting means for detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying means for identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded and also the level at the end of the immediately-preceding decoded n-bit codeword; resetting means for detecting the data appended during recording and for resetting, on the basis of the data appended during recording, the DSV at the end of the immediately-preceding decoded codeword to the DSV in the recorded codeword sequence when identifying the DSV by said identifying means; and decoding means for performing decoding by selecting the original m-bit dataword corresponding to the current n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately-preceding decoded codeword.
Claim 20
Dependent Claim 277 words
A recording and reproduction apparatus employing a data conversion method for converting m-bit datawords in to n-bit codewords including, detecting the least significant bit of an n-bit codeword corresponding to the m-bit dataword converted immediately preceding the current m-bit dataword to be converted; and selecting an n-bit codeword corresponding to the current m-bit dataword to be converted, on the basis of the detected least significant bit, the current m-bit dataword to be converted, and the next m-bit dataword to be converted, said apparatus comprising: appending means for appending, when recording, data indicating the DSV at the end of the n-bit codeword corresponding to the immediately-preceding converted m-bit dataword; detecting means for detecting the least significant bit of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded, when decoding an n-bit codeword sequence in to the original m-bit datawords for reproduction; identifying means for identifying the DSV at the end of the n-bit codeword decoded immediately preceding the current n-bit codeword to be decoded and also the level at the end of the immediately-preceding decoded n-bit codeword; resetting means for detecting the data appended during recording and for resetting, on the basis of the data appended during recording, the DSV at the end of the immediately-preceding decoded codeword to the DSV in the recorded codeword sequence when identifying the DSV by said identifying means; and decoding means for performing decoding by selecting the original m-bit dataword corresponding to the current n-bit codeword to be decoded, on the basis of the detected least significant bit of the immediately-preceding decoded n-bit codeword, and the identified DSV and level at the end of the immediately-preceding decoded codeword.

References Cited (Backward Citations)

JPS5619506A Cited
US4499454A Cited
JPS6048646A Cited
JPS6130818A Cited
JPH03234146A Cited
JPH0480576A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-04-16 1999-10-16 2000-04-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-04-16 2003-10-16 2004-04-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-04-16 2007-10-16 2008-04-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag