公开(公告)号：US20110273972A1

公开(公告)日：2011-11-10

申请号：US13097547

申请日：2011-04-29

申请人： Satoru Higashino

发明人： Satoru Higashino

IPC分类号： G11B20/00 ,  H03M7/00

CPC分类号： G11B20/1426 ,  G11B7/24044 ,  G11B20/10111 ,  G11B20/1012 ,  G11B20/1024 ,  G11B20/10277 ,  G11B2007/0009 ,  G11B2007/0013 ,  G11B2020/1469 ,  G11B2220/235 ,  G11B2220/2537 ,  H03M5/145

摘要： A coding apparatus includes a transform table in which with regard to data words of m bits and code words of n bits where n and m are both integers and also n>m is established, 2m pieces of code words selected to have a tendency that the number of symbols “1” is small among the 2n pieces of code words of n bits are associated with the 2m pieces of data words of m bits and a coding unit that encodes input data words of m bits on the basis of the transform table.

摘要翻译： 编码装置包括变换表，其中对于m位的数据字和n位的码字，其中n和m都是整数，并且还建立n> m，所选择的2m个码字具有 符号数“1”在n位的2n个码字中与2比特m比特的数据字相关联，编码单元基于变换表编码m比特的输入数据字。

公开(公告)号：US07289046B2

公开(公告)日：2007-10-30

申请号：US10483622

申请日：2003-05-12

申请人： Yoichiro Sako ,  Toru Aida ,  Tatsuya Inokuchi ,  Akiya Saito ,  Takashi Kihara ,  Tatsushi Sano ,  Yoriaki Kanada ,  Yoshiro Miyoshi ,  Shunsuke Furukawa ,  Yoshinobu Usui ,  Toshihiko Senno

发明人： Yoichiro Sako ,  Toru Aida ,  Tatsuya Inokuchi ,  Akiya Saito ,  Takashi Kihara ,  Tatsushi Sano ,  Yoriaki Kanada ,  Yoshiro Miyoshi ,  Shunsuke Furukawa ,  Yoshinobu Usui ,  Toshihiko Senno

IPC分类号： H03M7/00

CPC分类号： H03M7/46 ,  G11B20/00086 ,  G11B20/1426 ,  G11B2020/1287 ,  G11B2020/1457 ,  G11B2020/1461 ,  G11B2020/1469 ,  G11B2020/184 ,  H03M5/145

摘要： A recording method for converting m-bit data into n-bit (where n>m) data whose run length is restricted and recording the converted data on a recording medium, the recording method comprising the step of selecting first n-bit data according to an immediately preceded n-bit data, first n-bit data immediately followed thereby, and second n-bit data immediately followed thereby so that the cumulative value of DC components per unit time becomes small.

摘要翻译： 一种用于将m比特数据转换成游程长度受限的n比特（其中n> m）数据并将转换的数据记录在记录介质上的记录方法，所述记录方法包括以下步骤：根据 紧随其后的n位数据，紧随其后的第一n位数据和紧随其后的第二n位数据，使得每单位时间的DC分量的累积值变小。

公开(公告)号：US06853684B2

公开(公告)日：2005-02-08

申请号：US10370261

申请日：2003-02-19

申请人： Wen-Yi Wu ,  Jyh-Shin Pan

发明人： Wen-Yi Wu ,  Jyh-Shin Pan

IPC分类号： G11B20/14 ,  H04L25/00 ,  G11B20/10 ,  H03M5/00

CPC分类号： G11B20/1426 ,  G11B2020/1457 ,  G11B2020/1461 ,  G11B2020/1469

摘要： A digital sum variation (DSV) computation method and system is proposed, which is capable of determining the DSV value of a bit stream of channel-bit symbols to thereby find the optimal merge-bit symbol for insertion between each succeeding pair of the channel-bit symbols. This DSV computation method and system is characterized in the use of a Zero Digital Sum Variation (ZDSV) principle to determine the DSV. This DSV computation method and system can find the optimal merge-bit symbol for insertion between each succeeding pair of the channel-bit symbols in a more cost-effective manner with the need for a reduced amount of memory and utilizes a lookup table requiring a reduced amount of memory space for storage so that memory space can be reduced as compared to the prior art. This DSV computation method and system is therefore more advantageous to use than the prior art.

摘要翻译： 提出了一种数字和变化（DSV）计算方法和系统，其能够确定信道位符号的比特流的DSV值，从而找到用于在每个后续的信道对符号对之间插入的最佳合并位符号， 位符号。 该DSV计算方法和系统的特征在于使用零数值和变化（ZDSV）原理来确定DSV。 该DSV计算方法和系统可以以更具成本效益的方式找到用于在每个后续对的通道位符号之间插入的最佳合并位符号，并需要减少的存储量，并且使用需要减少的查找表 用于存储的存储空间量使得与现有技术相比可以减少存储空间。 因此，该DSV计算方法和系统比现有技术更有利于使用。

公开(公告)号：US06542452B1

公开(公告)日：2003-04-01

申请号：US09494176

申请日：2000-01-31

申请人： Wen-Yi Wu ,  Jyh-Shin Pan

发明人： Wen-Yi Wu ,  Jyh-Shin Pan

IPC分类号： G11B700

CPC分类号： G11B20/1426 ,  G11B2020/1457 ,  G11B2020/1461 ,  G11B2020/1469

摘要： A digital sum variation (DSV) computation method and system is proposed, which is capable of determining the DSV value of a bit stream of channel-bit symbols to thereby find the optimal merge-bit symbol for insertion between each succeeding pair of the channel-bit symbols. This DSV computation method and system is characterized in the use of a Zero Digital Sum Variation (ZDSV) principle to determine the DSV. This DSV computation method and system can find the optimal merge-bit symbol for insertion between each succeeding pair of the channel-bit symbols in a more cost-effective manner with the need for a reduced amount of memory and utilizes a lookup table requiring a reduced amount of memory space for storage so that memory space can be reduced as compared to the prior art. This DSV computation method and system is therefore more advantageous to use than the prior art.

摘要翻译： 提出了一种数字和变化（DSV）计算方法和系统，其能够确定信道位符号的比特流的DSV值，从而找到用于在每个后续的信道对符号对之间插入的最佳合并位符号， 位符号。 该DSV计算方法和系统的特征在于使用零数值和变化（ZDSV）原理来确定DSV。 该DSV计算方法和系统可以以更具成本效益的方式找到用于在每个后续对的通道位符号之间插入的最佳合并位符号，并需要减少的存储量，并且使用需要减少的查找表 用于存储的存储空间量使得与现有技术相比可以减少存储空间。 因此，该DSV计算方法和系统比现有技术更有利于使用。

公开(公告)号：US20020076046A1

公开(公告)日：2002-06-20

申请号：US09916146

申请日：2001-07-26

发明人： Richard A.A. Heylen

IPC分类号： H04N007/167

CPC分类号： G11B20/00579 ,  G11B7/261 ,  G11B20/00086 ,  G11B20/00927 ,  G11B20/1426 ,  G11B2020/1457 ,  G11B2020/1469

摘要： A method of copy protecting optical discs uses the differences in capability between the encoder associated with a laser beam recorder and that in currently available CD writers. Digital sum value (DSV) is a property of the encoded data on CODs and an encoder, which controls a laser beam recorder may be able to choose a pattern of merge bits which result in the overall DSV having optimal properties. During mastering of a CD, data patterns are added to the disc to provide an authenticating signature. These data patterns are chosen to cause DSV problems. Currently available CD writers have been found to have difficulty writing an authenticating signature of the type described without producing a resulting CD which has severe readability problems. Thus, the copy disc written by the CD writer will result in a CD reader returning corrupted data or information signalling a read error.

摘要翻译： 复制保护光盘的方法使用与激光束记录器相关联的编码器与当前可用的CD写入器中的编码器之间的能力差异。 数字和值（DSV）是COD上的编码数据的特性，编码器控制激光束记录器可能能够选择合并位的模式，导致DSV具有最佳性能。 在掌握CD期间，将数据模式添加到光盘中以提供认证签名。 选择这些数据模式以引起DSV问题。 已经发现目前可用的CD作者难以编写所述类型的认证签名，而不产生具有严重可读性问题的所得CD。 因此，由CD刻录机写入的复制光盘将导致CD读取器返回损坏的数据或信息发送读取错误。

公开(公告)号：US5365231A

公开(公告)日：1994-11-15

申请号：US858637

申请日：1992-03-27

申请人： Kazuharu Niimura

发明人： Kazuharu Niimura

IPC分类号： G11B20/14 ,  H03M5/14 ,  H04N9/804 ,  H04N9/808 ,  H03M7/00

CPC分类号： G11B20/1426 ,  H03M5/145 ,  H04N9/804 ,  H04N9/808 ,  G11B2020/1469

摘要： An encoder separates an input digital signal including m bits into the first group and the second group, and encodes each piece of data in the first group to a single code word including n bits in one-to-one correspondence and encodes each piece of data in the second group to two code words each including n bits in one-to-two correspondence. A CDS calculator calculates a CDS value for each of the words output from the encoder. A DSV calculator calculates the accumulated DSV value of the individual words output from the encoder. When the two-n-bit code words are output from the encoder, a code selector selects that one of the code words which decreases the next accumulated DSV value to be calculated by the DSV calculator, according to the CDS value from the CDS calculator and the accumulated DSV value from the DSV calculator. A margin bit generator generates a predetermined margin bit which decreases the next accumulated DSV value to be calculated by the DSV calculator, according to the CDS value from the CDS calculator and the accumulated DSV value from the DSV calculator, and inserts the margin bit in the single n-bit code word output from the encoder and the one code word selected by the code selector. A transfer section transfers the resulting n+1 bits.

摘要翻译： 编码器将包括m位的输入数字信号分离成第一组和第二组，并将第一组中的每条数据一一对应地编码为包括n位的单个码字，并对每条数据进行编码 在第二组中，两个码字各自包括一对一对应的n位。 CDS计算器计算从编码器输出的每个字的CDS值。 DSV计算器计算从编码器输出的单个字的累积DSV值。 当从编码器输出2-n位代码字时，代码选择器根据来自CDS计算器的CDS值和DSS计算器来选择降低下一个累积的DSV值的代码字中的一个， 来自DSV计算器的累积DSV值。 边缘比特发生器根据来自CDS计算器的CDS值和来自DSV计算器的累积DSV值产生预定的边缘比特，其减少要由DSV计算器计算的下一个累积的DSV值，并将边缘比特插入到 从编码器输出的单个n位代码字和代码选择器选择的一个代码字。 传送部分传送结果n + 1位。

公开(公告)号：US08050163B2

公开(公告)日：2011-11-01

申请号：US11718466

申请日：2005-10-24

申请人： Seiji Kobayashi ,  Goro Fujita

发明人： Seiji Kobayashi ,  Goro Fujita

IPC分类号： G11B7/00

CPC分类号： G11B20/1426 ,  G11B7/00736 ,  G11B7/268 ,  G11B20/00086 ,  G11B20/00115 ,  G11B20/1217 ,  G11B20/1809 ,  G11B2020/1453 ,  G11B2020/1469 ,  G11B2220/2541

摘要： According to the present invention, there is provided a method of recording a unique ID to a read-only optical disc based on the 17PP modulation. The read-only optical disc (1) has set thereon a specific physical cluster to which a unique ID is to be recorded. With user data to be recorded to the specific physical cluster being made all zero (0), a pit/land pattern is formed, and a molding machine using a molding die is used to form many optical discs in the common manner. Thereafter, an ID unique to each optical disc is generated, and a land in a predetermined position in the specific physical cluster is transited to a pit by irradiating high-power laser light to the land correspondingly to the bit information, so that the pit/land pattern will comply the 17PP modulation rule even after the transition of the land to the pit.

摘要翻译： 根据本发明，提供了一种基于17PP调制将唯一ID记录到只读光盘的方法。 只读光盘（1）上设置有要记录唯一ID的特定物理簇。 要将要记录到特定物理簇的用户数据全为零（0），形成坑/地面图案，并且使用使用成型模的成型机以常见的方式形成许多光盘。 此后，产生每个光盘唯一的ID，并且通过相对于比特信息将大功率激光照射到陆地，将特定物理簇中的预定位置的平台转移到凹坑，使得凹坑/ 即使在土地过渡到坑后，土地格局也符合17PP调制规则。

公开(公告)号：US20090067309A1

公开(公告)日：2009-03-12

申请号：US11718466

申请日：2005-10-24

申请人： Seiji Kobayashi ,  Goro Fujita

发明人： Seiji Kobayashi ,  Goro Fujita

IPC分类号： G11B20/10 ,  G11B7/24

CPC分类号： G11B20/1426 ,  G11B7/00736 ,  G11B7/268 ,  G11B20/00086 ,  G11B20/00115 ,  G11B20/1217 ,  G11B20/1809 ,  G11B2020/1453 ,  G11B2020/1469 ,  G11B2220/2541

摘要： According to the present invention, there is provided a method of recording a unique ID to a read-only optical disc based on the 17PP modulation. The read-only optical disc (1) has set thereon a specific physical cluster to which a unique ID is to be recorded. With user data to be recorded to the specific physical cluster being made all zero (0), a pit/land pattern is formed, and a molding machine using a molding die is used to form many optical discs in the common manner. Thereafter, an ID unique to each optical disc is generated, and a land in a predetermined position in the specific physical cluster is transited to a pit by irradiating high-power laser light to the land correspondingly to the bit information, so that the pit/land pattern will comply the 17PP modulation rule even after the transition of the land to the pit.

摘要翻译： 根据本发明，提供了一种基于17PP调制将唯一ID记录到只读光盘的方法。 只读光盘（1）上设置有要记录唯一ID的特定物理簇。 要将要记录到特定物理簇的用户数据全为零（0），形成坑/地面图案，并且使用使用成型模的成型机以常见方式形成许多光盘。 此后，产生每个光盘唯一的ID，并且通过相对于比特信息将大功率激光照射到陆地，将特定物理簇中的预定位置的平台转移到凹坑，使得凹坑/ 即使在土地过渡到坑后，土地格局也符合17PP调制规则。

公开(公告)号：US07224295B2

公开(公告)日：2007-05-29

申请号：US11277351

申请日：2006-03-23

申请人： Jia-Horng Shieh ,  Pi-Hai Liu

发明人： Jia-Horng Shieh ,  Pi-Hai Liu

IPC分类号： H03M5/00

CPC分类号： H03M5/145 ,  G11B20/1426 ,  G11B2020/1469 ,  G11B2220/2579

摘要： The present invention provides a method and system for converting an input code into an output code. The method includes: determining a plurality of input code subsets of the input code; converting the input code subsets into a plurality of output code subsets, respectively; and merging the output code subsets to generate the output code. The system includes a splitter, for determining a plurality of input code subsets of the input code; a mapper, coupled to the splitter, for converting the input code subsets into a plurality of output code subsets, respectively; and a merger, coupled to the mapper, for merging the output code subsets to generate the output code.

摘要翻译： 本发明提供一种将输入代码转换为输出代码的方法和系统。 该方法包括：确定输入代码的多个输入代码子集; 将输入代码子集分别转换成多个输出代码子集; 并合并输出代码子集以生成输出代码。 该系统包括分离器，用于确定输入代码的多个输入代码子集; 耦合到分离器的映射器，用于将输入代码子集分别转换成多个输出代码子集; 以及与映射器耦合的合并，用于合并输出代码子集以生成输出代码。

公开(公告)号：US07212483B2

公开(公告)日：2007-05-01

申请号：US10668283

申请日：2003-09-24

申请人： Harukuni Kobari ,  Toshio Kuroiwa ,  Hirotoshi Ohno ,  Hiroyoshi Yoshikawa ,  Nobuchika Ochi ,  Junzo Suzuki

发明人： Harukuni Kobari ,  Toshio Kuroiwa ,  Hirotoshi Ohno ,  Hiroyoshi Yoshikawa ,  Nobuchika Ochi ,  Junzo Suzuki

IPC分类号： G11G20/10 ,  H03M7/00

CPC分类号： G11B20/1426 ,  G11B2020/1461 ,  G11B2020/1469 ,  H03M5/145

摘要： When a code word sequence is generated by converting input data words of p bits into code words of q bits and concatenating adjacent ones of the code words with a merge bit sequence of r bits in order to obtain the best DSV value, according to one aspect, the adjacent code words are concatenated with the merge bit sequence of r bits which is selected, free from the restriction of the minimum run-length of (d+1)T and the maximum run-length of (k+1)T based on the run-length limiting rule RLL(d, k) but permitting the minimum run-length of (d+1)T and the maximum run-length of (k+2)T. According to another aspect, a merge bit sequence to be inserted after a current code word is selected by prefetching the current code word, a next code word, and a further next code word, temporarily concatenating these code words with merge bit sequences of r bits respectively to prepare code word sequence candidates free from the predetermined run-length limiting rule, calculating the DSV values of the code word sequence candidates, selecting one of the code word sequence candidates having a DSV value whose absolute value is closest to zero, and selecting the merge bit sequence between the current code word and the next code word of the selected merge bit sequence candidate. According to a further aspect, the input data words are encoded by a p-q modulation scheme after introducing for a predetermined period, as an input data word, specific data comprising alternating current signals or direct current signals which would cause a modulation device that prefetches only the next code word to output a code word sequence which includes particular frequency components.

摘要翻译： 当通过将p位的输入数据字转换成q位的码字并且用r位的合并位序列连接码字的相邻码来产生码字序列以获得最佳的DSV值时，根据一个方面 ，相邻代码字与被选择的r位的合并位序列连接，不受（d + 1）T的最小游程长度的限制和基于（k + 1）T的最大游程长度的限制） 在游程长度限制规则RLL（d，k）上，但允许（d + 1）T的最小游程长度和（k + 2）T的最大游程长度。 根据另一方面，通过预取当前码字，下一个码字和下一个码字来选择在当前码字之后插入的合并比特序列，将这些码字临时连接到r比特的合并比特序列 分别准备没有预定游程长度限制规则的码字序列候选，计算码字序列候选的DSV值，选择其绝对值最接近零的DSV值的码字序列候选中的一个，选择 当前码字与所选合并位序列候选的下一码字之间的合并位序列。 根据另一方面，输入数据字在引入预定周期之后由pq调制方案编码，作为输入数据字，包括交流电流信号或直流电信号的特定数据，该数据字将导致仅仅预取的调制装置 下一个码字输出包含特定频率分量的码字序列。