会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明公开
    • Method and apparatus for generating high rate codes for recording information on a magnetic medium
    • 一种用于生成Hochratenkoden用于记录磁介质上的信息的方法和装置
    • EP0764950A2
    • 1997-03-26
    • EP96306745.9
    • 1996-09-17
    • AT&T Corp.
    • Calderbank, RobertGelblum, Ehud Alexander
    • G11B20/14H03M5/14
    • H03M5/145G11B20/1426
    • Method and apparatus for encoding digital information to be recorded on a magnetic medium is disclosed. The invention provides for receiving a sequence of (2 m n + d) user bits, mapping the sequence of user bits to 2 m dc-free codewords, and recording the 2 m dc-free codewords on a magnetic medium. A modulation coder, which includes a memory containing multiple non-intersecting subconstellations of dc-free codewords, performs the mapping in a non-equiprobable manner such that a particular codeword from a larger subconstellation is more likely to be used than a particular codeword from a smaller constellation. Less desirable codewords, such as those containing relatively long strings of bits having the same value, are assigned to the smaller subconstellations, thereby lessening the likelihood of loss of timing and gain parameters in the system, as well as maximizing the transmission rate and efficient use of the set of possible dc-free sequences of a given length.
    • 要被记录用于编码的数字信息的方法和装置上的磁介质是圆盘游离缺失。 本发明提供了用于在磁接收(2 N + d)的用户的位序列,用户位的序列映射到2 自由直流码字,并记录2 自由直流码字 中等。 的调制编码器,其包括含有游离直流码字的多个非交叉的subconstellations的存储器,执行在非等概率的方式登记在搜索所述映射确实从较大subconstellation一个特定码字更可能比从一个特定的码字被用于 较小的星座。 不太期望的码字,求作为那些包含具有相同值的位的比较长的字符串,被分配给更小的subconstellations,从而减少在系统的定时和增益参数丢失的可能性,以及最大限度地提高传输速率和有效利用 的集合中的给定长度的可能的游离直流序列。
    • 63. 发明公开
    • Décodeur MPEG
    • MPEG Dekoder
    • EP0747856A1
    • 1996-12-11
    • EP96401188.6
    • 1996-06-04
    • SGS-THOMSON MICROELECTRONICS S.A.
    • Bramley, Richard
    • G06T9/00
    • G06T9/007H03M5/145H03M13/05
    • La présente invention concerne un dispositif de décodage d'un flux (2) de données représentant des images animées codées selon la norme MPEG dans lequel une unité logique reçoit d'un étage de décalage des données comportant le nombre maximum de bits d'un code de longueur variable, renvoie à l'étage de décalage la longueur de chaque code décodé et produit une valeur décodée de chaque code.
      L'unité logique comporte un contrôleur (7) commandant au moins deux unités (8, 9) de traitement séparées, dont une première unité (8) de traitement extrait la longueur du code et l'adresse à l'étage de décalage, et une deuxième unité (9) de traitement procède au décodage des codes.
    • 延迟级(1)接收代表根据MPEG标准编码的动画图像的数据流(2)。 数据包括包含一般信息的标题和表示实际图像的编码数据。 来自延迟级的输出(4)被发送到解码器(3)。 解码器(3)包含第一处理单元(8),其提取代码的长度并将其发送回延迟单元(1),从而可以正确访问以下代码。 第二单元(9)产生每个代码的解码值。 两个单元(8)(9)由控制器(7)管理。
    • 64. 发明公开
    • DATA ENCODING METHOD AND DATA DECODING METHOD
    • DATENKODIER- UND DATENDEKODIERVERFAHREN
    • EP0744838A1
    • 1996-11-27
    • EP95939420.6
    • 1995-12-12
    • SONY CORPORATION
    • SHIMPUKU, YoshihideNAKAGAWA, Toshiyuki
    • H03M7/14G11B20/14
    • G11B20/1426G06T9/005H03M5/145
    • A data encoding method for converting a (m i) bit based data word string into a (n i) bit based codeword string. The encoding method receives a (m i) bit based data word string by a shift register 1, decides a constraint length specifying the length of a data word which is to be converted by an encoder 2, and decides on which number of bits as counted from the leading end of the m bits falls the leading end bit of the data word which is to be converted. The encoding method selects, by a selector 3, one of a plurality of conversion tables constituting variable length tables and at least satisfying the minimum run length d , in accordance with the constraint length and the above results of decision. The encoding method also generates a codeword corresponding to the data word, now to be converted, in accordance with the selected conversion table. The encoding method assures a larger value of the product of the minimum length between transitions and the window margin, thus enabling data to be recorded to a higher density on an information recording medium.
    • 一种用于将(m i)位的数据字串转换成(n i)位的码字串的数据编码方法。 编码方法由移位寄存器1接收(mi)比特数据字串,确定规定由编码器2转换的数据字的长度的约束长度,并判定从哪个比特数开始计数 m位的前导端落在要转换的数据字的前端。 编码方法根据约束长度和上述判定结果,由选择器3选择构成可变长度表并且至少满足最小游程长度d的多个转换表中的一个。 编码方法还根据所选择的转换表生成对应于现在要转换的数据字的码字。 编码方法确保了转换之间的最小长度与窗口边缘之间的乘积的较大值,从而使得能够在信息记录介质上以更高的密度记录数据。
    • 65. 发明公开
    • Method and apparatus for decoding RLL modulated data using tables of reduced sizes
    • DekodierschaltungfürRLL-Daten mit verkleinerten Tabellen und Verfahren dazu
    • EP0739099A1
    • 1996-10-23
    • EP96105753.6
    • 1996-04-11
    • KABUSHIKI KAISHA TOSHIBA
    • Ishiwaza, Yoshiyuki
    • H03M5/14
    • G06T9/005H03M5/145
    • The invention relates to a method and an apparatus for decoding RLL modulated data using tables of reduced sizes whereby the data are recorded on an optical disk, specifically a digital video disk (DVD).
      Even if an element such as a ROM is not used, a code reverse conversion can be realized by a sufficiently small scale circuit to be effective for integration. When code data group converted from 8-bit to 15-bit according to a predetermined rule is converted to original 8-bit code data group, an exclusive logic processor 11, a bit shift processor 12, a six-to-four decoder and an eleven-to-eight decoder 14 divides the 15(m) bit code (dividing by m at the maximum) into a plurality of areas, converts "1" (in the case of positive logic) in response to the generated bit position in the respective areas, and the numeric codes obtained by the numeric value converting means are added by an adder 15.
    • 本发明涉及一种使用缩小尺寸的表来解码RLL调制数据的方法和装置,由此数据被记录在光盘上,特别是数字视频盘(DVD)上。 即使不使用诸如ROM的元件,也可以通过足够小规模的电路来实现代码反向转换,从而对集成有效。 当根据预定规则从8位转换为15位的代码数据组被转换为原始的8位代码数据组时,排他逻辑处理器11,位移位处理器12,6对4解码器和 十一至八解码器14将15(m)个比特码(最大除以m)分割成多个区域,响应于所生成的比特位置,将“1”(在正逻辑的情况下)转换 各个区域和由数值转换装置获得的数字代码由加法器15相加
    • 66. 发明公开
    • Transmission code having local parity
    • Kodeübertragungmit lokalerParität
    • EP0725486A2
    • 1996-08-07
    • EP96100861.2
    • 1996-01-23
    • International Business Machines Corporation
    • Widmer, Albert X.
    • H03M13/00H03M5/14
    • H03M13/095H03M5/145
    • A method and apparatus are described for coding a frame of N-bit bytes into a frame of coded M-bit bytes wherein M > N > 0 and wherein said frame has a frame boundary including the steps of storing a frame of M-bit bytes; providing a code containing a set of M-bit bytes which is a subset of all possible M-bit bytes; for each of the 2 N possible N-bit bytes there is a corresponding member in said set; each of said members of said code has a sequence of bits having a binary state selected from one of three values such that if the state of one of the bits is changed, a resulting M-bit byte is not a member of the code; one of the members of the code is a comma used to identify the frame boundary; the comma has a sequence of bits having a binary state selected from a first and second value such that the bit sequence of the comma is confined to one of said members of the code and the bit sequence of the comma does not occur across a boundary between any combination of any other members of the code; assigning to each of said N-bit bytes in said frame said corresponding member from said code to form a coded frame corresponding to said frame; and storing said coded frame.
    • 描述了一种用于将N位字节的帧编码为M> N> 0的编码M位字节的帧的方法和装置,其中所述帧具有帧边界,包括以下步骤:存储M位字节的帧 ; 提供包含一组M位字节的代码,该集合是所有可能的M位字节的子集; 对于2个N个可能的N位字节中的每一个,在所述集合中存在对应的成员; 所述代码的每个所述成员具有从三个值之一中选择的二进制状态的比特序列,使得如果一个比特的状态被改变,则所得到的M比特字节不是该代码的成员; 代码的成员之一是用于识别帧边界的逗号; 逗号具有从第一和第二值选择的二进制状态的比特序列,使得逗号的比特序列被限制在代码的所述成员之一,并且逗号的比特序列不会跨越在 代码的任何其他成员的任何组合; 从所述代码向所述帧中的所述对应成员中的每个所述N比特字节分配以形成对应于所述帧的编码帧; 并存储所述编码帧。
    • 67. 发明公开
    • Code modulation method, code demodulation method, and code detection method
    • Kodemodulations-,Kodedemodulations-和Kodedetektionsverfahren
    • EP0720302A2
    • 1996-07-03
    • EP95120698.6
    • 1995-12-28
    • SONY CORPORATION
    • Ino, Hiroyuki, c/o Sony Corporation
    • H03M5/14G11B20/14
    • G11B20/10083G11B20/10009H03M5/145
    • Carrying out DSV control with a PR(1, 1) while making free distance larger and path memory length shorter. "3 x 3" states are arranged in a plane defined by a horizontal axis and a vertical axis, with a code 11 being allotted to correspond to rightward transitions along the horizontal axis and a code 00 being allotted to correspond to leftward transitions. A code 01 is allotted to upward transitions along the vertical axis and a code 10 is allotted to correspond to downward transitions. Codes obtained in the case of transitions from a start point taken as one of the states 1, 3, 5 or 7, to the states 1, 3, 5 or 7 taken as end points through the other five states are used as codes after conversion. For example, the codes 01, 01, 11, 00, 10 and 10 are obtained from a transition through state 1, state 4, state 7, state 8, state 7, state 4 and state 1.
    • 使用PR(1,1)进行DSV控制,同时使自由距离更大,路径内存长度更短。 “3×3”状态被布置在由水平轴和垂直轴定义的平面中,其中分配有代码11以对应于沿着水平轴的向右过渡,并且分配代码00以对应于向左的转变。 代码01被分配给沿着垂直轴的向上转换,并且分配代码10以对应于向下转换。 在从作为状态1,3,5或7之一的起点转换到以其他五种状态作为终点的状态1,3,5或7的情况下获得的代码被用作转换后的代码 。 例如,通过状态1,状态4,状态7,状态8,状态7,状态4和状态1的转换获得代码01,01,11,00,10和10。
    • 70. 发明公开
    • Modulating method and apparatus, and demodulating apparatus
    • 调制方法和装置和解调。
    • EP0625828A3
    • 1995-07-26
    • EP94107778.6
    • 1994-05-19
    • SONY CORPORATION
    • Shimpuki, YoshihideNakagawa, Toshiyuki
    • H03M5/14G11B20/14H04L25/49
    • G11B20/1426G11B2020/1461H03M5/145
    • A modulation apparatus for converting digital data having the basic data length equal to m bits into a variable length code (d, k; m, n; r) having the basic codeword length of n bits is disclosed. The apparatus includes an encoder (12) for determining the constraint length i of data supplied from a shift register (11), based upon m bits as a unit, a selector (13), plural conversion tables (14 i ) and an unfixed bit processing circuit (16 i ). The selector (13) selects one of the conversion tables (14 i ) based upon the constraint length i and transmits m x i bit data to the selected conversion table (14 i ), which then converts the m x i bit data into n x i bit codewords. The unfixed bit processing circuit (16 i ) sets a bit at a preset position of a codeword among the codewords which gives an infinite value ∞ of the maximum run, or a bit at a preset position of a codeword among the codewords which has the maximum number of consecutive "0"s from the least significant bit towards upper order side bits, as being an unfixed bit, and sets the unfixed bit to "1" if d or more "0"s are consecutive to the unfixed bit. With the present modulation apparatus, the minimum length between transitions T min may be enlarged as compared to that in EFM for increasing the recording density, while the maximum length of transitions T max may also be increased as compared to that for VFM.