会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • APPARATUS AND METHOD FOR CONVERTING DIGITAL WORDS OR BYTES OF A GIVEN NUMBER OF BITS TO BYTES OF A DIFFERENT NUMBER OF BITS
    • 将数字数字或字数转换为不同位数字节的装置和方法
    • WO1998015891A1
    • 1998-04-16
    • PCT/US1997017763
    • 1997-10-02
    • ASCOM TIMEPLEX TRADING AGSCARANGELLA, Anthony, T.
    • ASCOM TIMEPLEX TRADING AGROJAS, Alfonso, R.
    • G06F05/00
    • G06F5/00
    • Apparatus (60; 220; 600; 800; 1000) and method (70; 300; 500; 700; 900) are provided for converting, at high speed, without queuing of data, and with absolute accuracy, parallel bytes of digital data having a given number of binary bits as employed by one class of equipment to parallel bytes having a different (greater or smaller) number of bits as employed by another class of equipment. Such conversion is necessary in order to make possible unimpeded communication between the two classes of equipment. Converting of bytes is accomplished by momentarily storing as current data and as remainder data respective bits of successive incoming bytes clock count by clock count (70; 300; 500; 700; 900); identifying within each count a desired number of bits stored as remainder data, or current data, or both and grouping them into a set of bits to be outputted as an outgoing byte during a respective count; outputting such sets of bits clock count by clock count as outgoing bytes such that the outgoing bytes each have a different number of bits versus the number of bits in each incoming byte, and the outgoing bits have a desired numerical sequence; and periodically compensating (1/2 count; NOP, EOP) for the total number of bits outputted versus the number inputted during a given period of time.
    • 提供了装置(60; 220; 600; 800; 1000)和方法(70; 300; 500; 700; 900),用于高速转换,不排队数据,绝对准确地,具有数字数据的并行字节, 给定数量的二进制位由一类设备用于具有由另一类设备使用的不同(更大或更小)位数的并行字节。 这样的转换是必要的,以便使两种设备之间可能无阻碍地进行通信。 字节转换是通过将时钟计数(70; 300; 500; 700; 900)暂时存储为当前数据和作为连续输入字节时钟计数的剩余数据的相应位来实现的。 在每个计数内识别作为余数数据或当前数据存储的所需数量的位,或两者,并将它们分组为在相应计数期间作为输出字节输出的一组位; 通过时钟计数作为输出字节输出这样的位组时钟计数,使得输出字节各自具有与每个输入字节中的位数不同的位数,并且输出位具有期望的数字序列; 并且对于输出的总位数与给定时段期间输入的数量周期性地补偿(1/2计数; NOP,EOP)。
    • 5. 发明公开
    • Adaptive compression encoding of a binary-source symbol string
    • 二进制符号字符串的自适应压缩编码
    • EP0047382A3
    • 1982-10-13
    • EP81105735
    • 1981-07-21
    • International Business Machines Corporation
    • Goertzel, Gerald
    • G06F05/00
    • H03M7/42
    • This invention relates to a technique for appending prefixed code words to a code word stream conditioned by each least probable symbol in a binary source symbol string. The generation of the prefixed code word from a bounded code word space is managed dynamically by a memory (9) requiring only space availability measures (47, 51) at the start and end of the encoding cycle as input thereto. The memory delivers the prefixed code word of an appropriate derived length to output devices (7) for further processing. The encoder (2), responsive to each input triplet of symbol, symbol estimate, and probability of occurrence measure, generates the space availability measures PC(i) and PC(i-I), and modifies the memory contents so as to reduce the remaining code space. This reduction reflects the fact that the particular code word delivered has been used up and cannot be the prefix of any future delivered code word. The length of each code word requested is composed of two components. The first is the «run» of most probable symbols component, and the second is the terminating least probable symbol component. When the code word length requested exceeds the capacity of the memory to deliver, then the code word length is decreased to the maximum permissible. When the code word space is used up, the memory is considered overflowed and results in a reset in which the code capacity is reinitialized.
    • 6. 发明公开
    • Method and apparatus for generating complex characters
    • 用于产生复杂特征的方法和装置
    • EP0030635A3
    • 1982-01-13
    • EP80107152
    • 1980-11-18
    • International Business Machines Corporation
    • Goertzel, GeraldPowell, Carl GeorgeTseng, Samuel Chin-Chong
    • G09F01/02G06K15/10B41B19/00G06F05/00
    • B41B19/01G06K15/10G06K2215/0028G09G5/246
    • A character compaction and generation method and apparatus which is particularly adapted to the generation of complex characters such as Kanji characters. A dot matrix (Fig. 2-1) defining a given character is compacted into a sparse matrix (Fig. 2-7), with the original character being reconstructed for printing or display from the compacted character defined in the sparse matrix. Each character in the complex character set is compacted and stored in memory (50) one time only, with decompaction being performed each time a given character is to be generated. A set of symbols are defined to represent different patterns which occur frequently in the entire complex character set. Different combinations of the symbols define a given character. The information stored for each sparse matrix representing a given character is comprised of eacn symbol in the sparse matrix, its position, and its size parameter if the symbol represents a family of patterns which differ only in size. Three groups (A, B, C,) of different patterns are defined which occur frequently in the complex character set, namely, a first group (A) which has a fixed size for each pattern, a second group (B) which has one size parameter which must be specified for each pattern, and a third group (Cl which has a plurality of size parameters which must be specified for each pattern. Certain ones of the characters have elements of different patterns which overlap, such that the character may be encoded utilizing less symbols, and according less bytes of data. A given pattern may be generated atthe same time another pattern is being decoded.
    • 一种字符压缩和生成方法和装置,其特别适用于生成诸如汉字字符的复杂字符。 定义给定字符的点矩阵被压缩成稀疏矩阵,其中原始字符被重构用于从稀疏矩阵中定义的压缩字符进行打印或显示。 复杂字符集中的每个字符都被压缩并存储在存储器中一次,每当要生成给定字符时执行解压缩。 一组符号被定义为表示在整个复杂字符集中频繁出现的不同模式。 符号的不同组合定义给定的字符。 对于表示给定字符的每个稀疏矩阵存储的信息由稀疏矩阵,其位置和其大小参数中的每个符号组成,如果符号表示仅在大小上不同的模式族。 定义了在组合字符集中频繁出现的三组不同的模式,即对于每个模式具有固定大小的第一组,具有必须为每个模式指定的一个大小参数的第二组,以及第三组 其具有必须为每个模式指定的多个尺寸参数。