会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Combination parallel/serial execution of sequential algorithm for data
compression/decompression
    • 组合并行/串行执行数据压缩/解压缩的顺序算法
    • US5384567A
    • 1995-01-24
    • US89211
    • 1993-07-08
    • Martin A. HassnerEhud D. KarninUwe SchwiegelshohnTetsuya Tamura
    • Martin A. HassnerEhud D. KarninUwe SchwiegelshohnTetsuya Tamura
    • G06F5/00G06T9/00H03M7/30H04B1/66
    • H03M7/3086G06T9/005
    • An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer compresses an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
    • 一种用于执行顺序数据压缩算法的装置和方法,其特别适用于在设备(与主机不同)控制器中需要数据压缩的地方。 历史缓冲区压缩i个相同水平切片单元的阵列。 每个片单元存储j个符号以定义其中每个片单元中的符号被精确地i个符号分隔的j个分离块。 i个输入符号的串中的符号被i个比较器与先前存储在片单元中的符号并行地进行比较,以识别符号的匹配序列。 控制单元控制顺序算法的执行,以使比较器平行扫描符号,但在每个块中顺序扫描符号,并使符号的匹配序列和非匹配序列存储在阵列中。 选择参数i和j以限制在基于算法执行速度与硬件成本的折衷来执行算法时实现期望的效率程度所需的比较器的数量。 优先编码器根据由片单元输出的信号计算每个j,i地址,其中标识匹配序列,但是它输出这些地址中只有一个(例如最小的)的地址。
    • 5. 发明授权
    • Method and apparatus for asymmetrical RLL coding
    • 用于不对称RLL编码的方法和装置
    • US4949196A
    • 1990-08-14
    • US175171
    • 1988-03-30
    • Neil R. DavieMartin A. HassnerThomas D. HowellRazmik KarabedPaul H. Siegel
    • Neil R. DavieMartin A. HassnerThomas D. HowellRazmik KarabedPaul H. Siegel
    • H03M7/14G06T9/00G11B20/14H03M5/14
    • H03M5/145G06T9/005
    • This disclosure concerns for generating asymmetrically constrained run-length-limited encoded data from a serialized binary string of 1's and 0's. The method comprises the steps of encoding the input data bits using a run-length-limited constraint in the form of M/N (d,k), where M is the number of input data bits, N is the number of output bits associated therewith, d is the minimum number of 0 data bits between adjacent data bit 1's, and k is the maximum number of 0 data bits between adjacent 1's; and alternating the values of d and k between a set (d.sub.1, k.sub.1) and a set (d.sub.2, k.sub.2), respectively, where d.sub.1 .noteq.d.sub.2. The apparatus comprises means for generating N output data bits in response to M input data bits and for generating data bit 0's between data bit 1's based upon a run-length-limited coding constraints (d.sub.1, k.sub.1) and (d.sub.2, k.sub.2), where constraints (d.sub.1, k.sub.1) and (d.sub.2, k.sub.2) apply alternately to runs of zeroes between output data ones. Fractional numerical values of d.sub.1 and d.sub.2 can be employed in the method or apparatus.
    • 本公开涉及从1和0的串行化二进制串生成不对称约束的游程长度限制编码数据。 该方法包括以M / N(d,k)形式的游程限制约束对输入数据比特进行编码的步骤,其中M是输入数据比特数,N是相关联的输出比特数 因此,d是相邻数据位1之间的0个数据位的最小数量,k是相邻1之间的0个数据位的最大数量; 并且分别在集合(d1,k1)和集合(d2,k2)之间交替d和k的值,其中d1 NOTEQUAL d2。 该装置包括用于响应于M个输入数据位产生N个输出数据位并用于基于游程长度限制编码约束(d1,k1)和(d2,k2)在数据位1之间产生数据位0的装置,其中 约束(d1,k1)和(d2,k2)交替应用于输出数据之间的零运行。 d1和d2的分数值可以在该方法或装置中使用。
    • 8. 发明授权
    • Maximum-likelihood symbol detection for RLL-coded data
    • RLL编码数据的最大似然符号检测
    • US5638065A
    • 1997-06-10
    • US489863
    • 1995-06-13
    • Martin A. HassnerTetsuya TamuraShmuel Winograd
    • Martin A. HassnerTetsuya TamuraShmuel Winograd
    • G11B20/10G11B20/14G11B20/18H03M7/00
    • G11B20/1426G11B20/10009
    • Parallel ML processing of an analog signal in a RLL-coded channel in which (1) vectors for a current state of the channel and the next state of the channel are computed using Walsh transform vector coefficients of the analog signal; (2) current state vectors and next state vectors and values of vectors precomputed in analog matched filters are used to generate vector scalar products which are compared against preselected threshold values for generating binary decision outputs that are used in digital sequential finite state machines to generate ML symbol decisions; and (3) ML symbol decisions are fed back and used to subtract the intersymbol interference value of the current state vector from the vector of the next state to transform the next state vector into an updated current state vector.
    • RLL编码信道中的模拟信号的并行ML处理,其中(1)信道的当前状态的向量和信道的下一状态的矢量使用模拟信号的沃尔什变换矢量系数来计算; (2)当前状态矢量和下一状态向量以及在模拟匹配滤波器中预先计算的矢量值用于产生与预选阈值进行比较的矢量标量积,用于产生在数字顺序有限状态机中使用的二进制判决输出以产生ML 符号决定 (3)ML符号决定被反馈并用于从下一状态的向量中减去当前状态向量的符号间干扰值,以将下一状态向量变换为更新的当前状态向量。