利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

114 条记录 (耗时 0.029 秒)

    Storing partial data sets to magnetic tape
    1.
    发明授权
    Storing partial data sets to magnetic tape 有权
    将部分数据集存储到磁带

    公开(公告)号：US07965462B2

    公开(公告)日：2011-06-21

    申请号：US12351725

    申请日：2009-01-09

    申请人： Masayuki Demura ,  Glen A. Jaquette ,  Hisato Matsuo ,  Keisuke Tanaka

    发明人： Masayuki Demura ,  Glen A. Jaquette ,  Hisato Matsuo ,  Keisuke Tanaka

    IPC分类号： G11B20/16

    CPC分类号： G11B20/1201 ,  G11B20/18 ,  G11B20/1866 ,  G11B2020/1222 ,  G11B2220/90 ,  H03M13/271 ,  H03M13/2909

    摘要： Methods, logic, apparatus and computer program product write data, comprising less than a full Data Set, to magnetic tape. Data is received from a host, a do-not-interleave command is issued and C1 and C2 ECC are computed. Codeword Quad (CQ) sets are then formed. At least one CQ set of the Data Set is written to a magnetic tape in a non-interleaved manner and a Data Set Information Table (DSIT) is written to the magnetic tape immediately following the at least one written CQ set. An address transformation may be used to cancel interleaving. Writing a CQ set may include writing a plurality of contiguous instances of the CQ set to the magnetic tape to maintain the effectiveness of ECC capability.

    摘要翻译： 方法，逻辑，设备和计算机程序产品写入数据，包括少于一个完整的数据集，到磁带。 从主机接收数据，发出不交错命令，并计算C1和C2 ECC。 然后形成Codeword Quad（CQ）集合。 将数据集的至少一个CQ集以非交错方式写入磁带，并且数据集信息表（DSIT）被写入紧跟在至少一个写入的CQ集之后的磁带上。 可以使用地址变换来取消交织。 编写CQ集可以包括将CQ集的多个连续实例写入磁带以保持ECC能力的有效性。

    STORING PARTIAL DATA SETS TO MAGNETIC TAPE
    2.
    发明申请
    STORING PARTIAL DATA SETS TO MAGNETIC TAPE 有权
    将部分数据集存储到磁带

    公开(公告)号：US20100177421A1

    公开(公告)日：2010-07-15

    申请号：US12351725

    申请日：2009-01-09

    申请人： Masayuki Demura ,  Glen Jaquette ,  Hisato Matsuo ,  Keisuke Tanaka

    发明人： Masayuki Demura ,  Glen Jaquette ,  Hisato Matsuo ,  Keisuke Tanaka

    IPC分类号： G11B5/09 ,  G11B15/00

    CPC分类号： G11B20/1201 ,  G11B20/18 ,  G11B20/1866 ,  G11B2020/1222 ,  G11B2220/90 ,  H03M13/271 ,  H03M13/2909

    摘要： Methods, logic, apparatus and computer program product write data, comprising less than a full Data Set, to magnetic tape. Data is received from a host, a do-not-interleave command is issued and C1 and C2 ECC are computed. Codeword Quad (CQ) sets are then formed. At least one CQ set of the Data Set is written to a magnetic tape in a non-interleaved manner and a Data Set Information Table (DSIT) is written to the magnetic tape immediately following the at least one written CQ set. An address transformation may be used to cancel interleaving. Writing a CQ set may include writing a plurality of contiguous instances of the CQ set to the magnetic tape to maintain the effectiveness of ECC capability.

    摘要翻译： 方法，逻辑，设备和计算机程序产品写入数据，包括少于一个完整的数据集，到磁带。 从主机接收数据，发出不交错命令，并计算C1和C2 ECC。 然后形成Codeword Quad（CQ）集合。 将数据集的至少一个CQ集以非交错方式写入磁带，并且数据集信息表（DSIT）被写入紧跟在至少一个写入的CQ集之后的磁带上。 可以使用地址变换来取消交织。 编写CQ集可以包括将CQ集的多个连续实例写入磁带以保持ECC能力的有效性。

    Arbitrated Access To Memory Shared By A Processor And A Data Flow
    3.
    发明申请
    Arbitrated Access To Memory Shared By A Processor And A Data Flow 有权
    由处理器和数据流共享的内存的仲裁访问

    公开(公告)号：US20110125946A1

    公开(公告)日：2011-05-26

    申请号：US12916668

    申请日：2010-11-01

    申请人： Masayuki Demura ,  Hisato Matsuo ,  Keisuke Tanaka

    发明人： Masayuki Demura ,  Hisato Matsuo ,  Keisuke Tanaka

    IPC分类号： G06F13/18 ,  G06F12/06

    CPC分类号： G06F13/161 ,  G06F13/1673 ,  Y02D10/14

    摘要： Memory access arbitration allowing a shared memory to be used both as a memory for a processor and as a buffer for data flows, including an arbiter unit that makes assignment for access requests to the memory sequentially and transfers blocks of data in one round-robin cycle according to bandwidths required for the data transfers, sets priorities for the transfer blocks so that the bandwidths required for the data transfers are met by alternate transfer of the transfer blocks, and executes an access from the processor with an upper limit set for the number of access times from the processor to the memory in one round-robin cycle so that the access from the processor with the highest priority and with a predetermined transfer length exerts less effect on bandwidths for data flow transfers in predetermined intervals between the transfer blocks.

    摘要翻译： 存储器访问仲裁允许共享存储器既用作处理器的存储器又用作数据流的缓冲器，包括仲裁器单元，其顺序地对存储器的访问请求进行分配，并在一个循环周期中传送数据块 根据数据传输所需的带宽，设置传输块的优先级，使得通过传输块的交替传送来满足数据传输所需的带宽，并且执行对处理器的访问，其具有为 在一个循环周期中从处理器到存储器的访问时间，使得来自具有最高优先级并且具有预定传送长度的处理器的访问对传输块之间的预定间隔中的数据流传输的带宽的影响较小。

    Arbitrated access to memory shared by a processor and a data flow
    4.
    发明授权
    Arbitrated access to memory shared by a processor and a data flow 有权
    仲裁访问由处理器和数据流共享的内存

    公开(公告)号：US08412891B2

    公开(公告)日：2013-04-02

    申请号：US12916668

    申请日：2010-11-01

    申请人： Masayuki Demura ,  Hisato Matsuo ,  Keisuke Tanaka

    发明人： Masayuki Demura ,  Hisato Matsuo ,  Keisuke Tanaka

    IPC分类号： G06F12/12 ,  G06F13/18 ,  G06F13/34

    CPC分类号： G06F13/161 ,  G06F13/1673 ,  Y02D10/14

    摘要： Memory access arbitration allowing a shared memory to be used both as a memory for a processor and as a buffer for data flows, including an arbiter unit that makes assignment for access requests to the memory sequentially and transfers blocks of data in one round-robin cycle according to bandwidths required for the data transfers, sets priorities for the transfer blocks so that the bandwidths required for the data transfers are met by alternate transfer of the transfer blocks, and executes an access from the processor with an upper limit set for the number of access times from the processor to the memory in one round-robin cycle so that the access from the processor with the highest priority and with a predetermined transfer length exerts less effect on bandwidths for data flow transfers in predetermined intervals between the transfer blocks.

    摘要翻译： 存储器访问仲裁允许共享存储器既用作处理器的存储器又用作数据流的缓冲器，包括仲裁器单元，其顺序地对存储器的访问请求进行分配，并在一个循环周期中传送数据块 根据数据传输所需的带宽，设置传输块的优先级，使得通过传输块的交替传送来满足数据传输所需的带宽，并且执行对处理器的访问，其具有为 在一个循环周期中从处理器到存储器的访问时间，使得来自具有最高优先级并且具有预定传送长度的处理器的访问对传输块之间的预定间隔中的数据流传输的带宽的影响较小。

    Method and apparatus for detecting and correcting errors and erasures in product ECC-coded data arrays for DVD and similar storage subsystems
    5.
    发明授权
    Method and apparatus for detecting and correcting errors and erasures in product ECC-coded data arrays for DVD and similar storage subsystems 有权
    用于检测和纠正DVD和类似存储子系统的ECC编码数据阵列中的错误和擦除的方法和装置

    公开(公告)号：US06553533B2

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

    申请号：US09245803

    申请日：1999-02-05

    申请人： Masayuki Demura ,  Hironobu Nagura ,  Tetsuya Tamura ,  Keisuke Tanaka

    发明人： Masayuki Demura ,  Hironobu Nagura ,  Tetsuya Tamura ,  Keisuke Tanaka

    IPC分类号： G11C2900

    CPC分类号： G06F11/1008 ,  G11B20/10 ,  G11B20/18 ,  H03M13/1515 ,  H03M13/29 ,  H03M13/2909 ,  H03M13/293

    摘要： A method and apparatus for detecting and correcting errors and erasures in product-coded data arrays by iterative syndrome processing array data in row major order and column major order. A first dense map is formed for classifying each row containing location indicia of random errors, their correction patterns, and pointers to rows containing erasure errors. This map is used to effectuate row array random error corrections in place in memory. A second dense map is formed of location indicia and correction patterns for each pair adjacent position within a column containing erasure errors as indexed by a counterpart row pointer. The second map is used to effectuate column array erasure corrections and random error corrections in place in memory.

    摘要翻译： 一种检测和校正产品编码数据阵列中的错误和消除误差的方法和装置，通过迭代校正处理阵列数据以行主序和列主序列。 形成第一密集地图，用于将包含随机错误的位置标记，它们的校正模式和指向包含擦除错误的行的指针的每行分类。 该映射用于在存储器中实现行阵列随机误差校正。 第二密集地图由位置标记和校正图案形成，每个对相邻位置在包含由对应行指针索引的擦除错误的列内。 第二个映射用于在存储器中实现列阵列擦除校正和随机错误校正。

    ECC interleaving for multi-track recording on magnetic tape
    7.
    发明授权
    ECC interleaving for multi-track recording on magnetic tape 有权
    用于磁带上多轨记录的ECC交错

    公开(公告)号：US08276045B2

    公开(公告)日：2012-09-25

    申请号：US12351738

    申请日：2009-01-09

    申请人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Hisato Matsuo ,  Thomas Mittelholzer ,  Paul J. Seger ,  Keisuke Tanaka

    发明人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Hisato Matsuo ,  Thomas Mittelholzer ,  Paul J. Seger ,  Keisuke Tanaka

    IPC分类号： G11C29/00

    CPC分类号： H03M13/2909 ,  G11B20/1202 ,  G11B20/1833 ,  G11B20/1866 ,  G11B2020/1836 ,  G11B2020/1853 ,  G11B2220/93 ,  H03M13/15 ,  H03M13/1515

    摘要： Conventional C2 coding and interleaving for multi-track data tape in LTO-3/4 do not support recording data onto a number of concurrent tracks which is not a power of two. Higher-rate longer C2 codes, which do not degrade error rate performance, are provided. An adjustable format and interleaving scheme accommodates future tape drives in which the number of concurrent tracks is not necessarily a power of two. A data set is segmented into a plurality of unencoded subdata sets and parity bytes are generated for each row and column. The parameters of the C2 code include N2 as the least common multiple of the number of possible tracks to which codeword objects are to be written. COs are formed from N2 C1 codewords, mapped onto a logical data track according to information within headers of the CO and modulation encoded into synchronized COs which are written to the tape.

    摘要翻译： LTO-3/4中的多轨数据磁带的常规C2编码和交织不支持将数据记录到不是2的幂的多个并发磁道上。 提供了更高速率的更长的C2代码，这不会降低错误率性能。 可调格式和交错方案适应将来的磁带驱动器，其中并发轨道的数量不一定是二的幂。 将数据集分割为多个未编码的子数据集，并为每行和列生成奇偶校验字节。 C2码的参数包括N2作为要写入码字对象的可能轨道数的最小公倍数。 CO由N 2 C1码字形成，根据被写入到磁带的编码到同步的CO中的CO和报头中的信息映射到逻辑数据轨道。

    Rewrite-efficient ECC/interleaving for multi-track recording on magnetic tape
    9.
    发明授权
    Rewrite-efficient ECC/interleaving for multi-track recording on magnetic tape 有权
    在磁带上进行多轨录音的高效ECC /交错

    公开(公告)号：US07876516B2

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

    申请号：US12351747

    申请日：2009-01-09

    申请人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Hisato Matsuo ,  Thomas Mittelholzer ,  Paul J. Seger ,  Keisuke Tanaka

    发明人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Hisato Matsuo ,  Thomas Mittelholzer ,  Paul J. Seger ,  Keisuke Tanaka

    IPC分类号： G11B5/09 ,  G11B20/14

    CPC分类号： G11B20/1833 ,  G11B20/1201 ,  G11B20/1866 ,  G11B2020/1287 ,  G11B2020/1289 ,  G11B2020/1446 ,  G11B2020/1836 ,  G11B2220/93 ,  H03M13/27 ,  H03M13/271

    摘要： For writing data to multi-track tape, a received data set is received and segmented into unencoded subdata sets, each comprising an array having K2 rows and K1 columns. For each unencoded subdata set, N1-K1 C1-parity bytes are generated for each row and N2-K2 C2-parity bytes are generated for each column. The C1 and C2 parity bytes are appended to the ends of the row and column, respectively, to form encoded C1 and C2 codewords, respectively. All of the C1 codewords per data set are endowed with a specific codeword header to form a plurality of partial codeword objects (PCOs). Each PCO is mapped onto a logical data track according to information within the header. On each logical data track, adjacent PCOs are merged to form COs which are modulation encoded and mapped into synchronized COs. Then T synchronized COs are written simultaneously to the data tape where T is the number of concurrent active tracks on the data tape.

    摘要翻译： 为了将数据写入多轨磁带，接收到的数据集并被分割成未编码的子数据集，每个子​​集包括具有K2行和K1列的阵列。 对于每个未编码的子数据集，为每行生成N1-K1 C1-奇偶校验字节，并为每列生成N2-K2 C2-奇偶校验字节。 C1和C2奇偶校验字节分别附加到行和列的末端，分别形成编码的C1和C2码字。 每个数据集的所有C1码字都具有特定的码字头以形成多个部分码字对象（PCO）。 每个PCO根据标题内的信息被映射到逻辑数据轨道上。 在每个逻辑数据轨道上，相邻的PCO被合并以形成被调制编码并被映射到同步的CO中的CO。 然后将T同步的CO同时写入数据磁带，其中T是数据磁带上的并发活动磁道的数量。