会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • BITWISE RELIABILITY INDICATORS FROM SURVIVOR BITS IN VITERBI DECODERS
    • VITERBI解码器中的生存位置的可比性可靠性指标
    • US20120042228A1
    • 2012-02-16
    • US12856143
    • 2010-08-13
    • Andries Pieter HekstraNur Engin
    • Andries Pieter HekstraNur Engin
    • H03M13/07G06F11/10G06F11/07
    • H04L1/0054H03M13/09H03M13/2936H03M13/373H03M13/4138H03M13/4161H04L1/0059H04L1/0065
    • Various embodiments relate to the production of erasure flags to indicate errors resulting from decoding of convolutional codes. A Viterbi decoder may use a register exchange method to produce a plurality of survivor codes. At a defined index, a majority vote may take place comparing values of bits in each of the survivor codes. This majority vote may involve obtaining both the quantity of high-order bits and the quantity of low-order bits and obtaining the difference of the two quantities. The absolute value of the difference of high-order bits to low-order bits may be compared to a defined threshold. When the absolute value difference is below the defined quantity, an erasure flag may be produced and associated with the bits of the defined index, indicating that they are eligible for erasure. In some embodiments, a Reed-Solomon decoder may use the erasure flag to target specific survivor bits or survivor bytes for error-correction through erasure.
    • 各种实施例涉及擦除标志的产生,以指示由卷积码的解码产生的错误。 维特比解码器可以使用寄存器交换方法来产生多个幸存代码。 在定义的索引中,可以进行多数投票来比较每个幸存者代码中的比特值。 这个多数投票可以涉及获得高阶位数量和低位数量,并获得两个数量的差。 可以将高阶位与低位的差的绝对值与定义的阈值进行比较。 当绝对值差低于定义的数量时,可以产生擦除标志并与定义的索引的位相关联,表示它们符合擦除条件。 在一些实施例中,Reed-Solomon解码器可以使用擦除标志来针对特定的幸存者比特或幸存者字节来进行错误校正。
    • 3. 发明授权
    • Bitwise reliability indicators from survivor bits in Viterbi decoders
    • 维特比解码器中存活位的逐位可靠性指标
    • US08433975B2
    • 2013-04-30
    • US12856143
    • 2010-08-13
    • Andries Pieter HekstraNur Engin
    • Andries Pieter HekstraNur Engin
    • H03M13/00
    • H04L1/0054H03M13/09H03M13/2936H03M13/373H03M13/4138H03M13/4161H04L1/0059H04L1/0065
    • Various embodiments relate to the production of erasure flags to indicate errors resulting from decoding of convolutional codes. A Viterbi decoder may use a register exchange method to produce a plurality of survivor codes. At a defined index, a majority vote may take place comparing values of bits in each of the survivor codes. This majority vote may involve obtaining both the quantity of high-order bits and the quantity of low-order bits and obtaining the difference of the two quantities. The absolute value of the difference of high-order bits to low-order bits may be compared to a defined threshold. When the absolute value difference is below the defined quantity, an erasure flag may be produced and associated with the bits of the defined index, indicating that they are eligible for erasure. In some embodiments, a Reed-Solomon decoder may use the erasure flag to target specific survivor bits or survivor bytes for error-correction through erasure.
    • 各种实施例涉及擦除标志的产生,以指示由卷积码的解码产生的错误。 维特比解码器可以使用寄存器交换方法来产生多个幸存代码。 在定义的索引中,可以进行多数投票来比较每个幸存者代码中的比特值。 这个多数投票可以涉及获得高阶位数量和低位数量,并获得两个数量的差。 可以将高阶位与低位的差的绝对值与定义的阈值进行比较。 当绝对值差低于定义的数量时,可以产生擦除标志并与定义的索引的位相关联,表示它们符合擦除条件。 在一些实施例中,Reed-Solomon解码器可以使用擦除标志来针对特定的幸存者比特或幸存者字节来进行错误校正。
    • 7. 发明申请
    • Coder and a Method of Coding For Codes With a Parity-Complementary Word Assignment Having a Constraint of D1=,R=2
    • 编码器和编码代码的方法,其中具有约束D1 =,R = 2的奇偶互补字分配
    • US20090015446A1
    • 2009-01-15
    • US12097570
    • 2006-12-08
    • Willem Marie Julia Marcel CoeneAndries Pieter HekstraHiroyuki YamagishiMakoto Noda
    • Willem Marie Julia Marcel CoeneAndries Pieter HekstraHiroyuki YamagishiMakoto Noda
    • H03M7/00
    • G11B20/1426G11B20/10055G11B20/10296G11B2020/1453G11B2020/1457H03M5/145H03M7/40H03M13/29H03M13/31H03M13/3761H03M13/3972H03M13/41
    • Presently known d=1 codes have long trains consisting of consecutive 2T runs and an overall high frequency of occurrence of the shortest 2T runs that reduce the performance of the bit detector By using a code with an MTR constraint of 2 an improvement in the bit detection is achieved. A code constructed in a systematic way that provides an MTR constraint of 2 is presented. A variation of such a code is disclosed where one sub-code is used, where coding states are divided into coding classes and where code words are divided into code word types. Then, for a given sub-code, an code word of type t can be concatenated with an code word of the next sub-code if said subsequent code word of said next sub-code belongs to one of coding states of the coding class with index Tmax+1 t. In the code according to the invention the overall code has the property that the respective channel bit sequences that are encoded from the same message-bit sequence, starting from any possible state of the finite-state-machine, for each of the two values of a DC-control bit, that is part of a given user word have opposite parities for the sequences generated from the starting state up to the state where both encoder paths merge. For the case that the encoder paths do not merge, there is no such constraint. Finally, a new d=1, k=10 sliding-block decodable RLL code is disclosed with the following properties: (i) it has an r=2 constraint which is the lowest MTR value that is compatible with a rate R=⅔; (ii) it enables practical SISO-RLL decoding because of its compact 2-to-3 mapping; and (iii) the new code uses a parity-complementary word assignment4 (PCWA) for DC-control.
    • 目前已知的d = 1代码具有由连续的2T运行组成的长列,并且总体出现最短的2T运行的频率,从而降低位检测器的性能通过使用MTR约束为2的代码,改进了位检测 已完成。 提出了一种以系统方式构建的代码,其提供MTR约束为2的代码。 公开了这样的代码的变型,其中使用一个子代码,其中编码状态被分为编码类别以及代码字被分成代码字类型。 然后,对于给定子码,如果所述下一子码的所述后续码字属于编码类的编码状态之一,则可以将类型t的码字与下一子码的码字连接, 指数Tmax + 1t。 在根据本发明的代码中,总代码具有以下特性:从相同消息比特序列编码的各个信道比特序列,从有限状态机的任何可能状态开始,对于两个值的 作为给定用户字的一部分的DC控制位对于从起始状态直到两个编码器路径合并的状态产生的序列具有相反的奇偶校验。 对于编码器路径不合并的情况,没有这样的限制。 最后,公开了一种新的d = 1,k = 10滑块可解码的RLL码,具有以下特性:(i)它具有r = 2约束,其是与速率R = 2 / 3; (ii)由于其紧凑的2对3映射,它使实用的SISO-RLL解码成为可能; 和(iii)新的代码使用奇偶互补字分配4(PCWA)进行DC控制。
    • 10. 发明授权
    • Authentication system wherein definition signals of two devices are
altered, communicated between the two devices, and compared
    • 验证系统,其中两个设备的定义信号被改变,在两个设备之间进行通信并进行比较
    • US6042006A
    • 2000-03-28
    • US915015
    • 1997-08-20
    • Johan Van TilburgAndries Pieter Hekstra
    • Johan Van TilburgAndries Pieter Hekstra
    • G07F7/10H04L9/00G06K5/00
    • G07F7/1008G06Q20/341G06Q20/4012G06Q20/40975
    • An authentication system having a first device and a second device between which signals may be communicated. The first device includes a first memory for storing a definition signal and the first device generates a first signal to be communicated to the second device. The first device also generates a first alteration signal, and introduces an alteration into a first section of the definition signal stored in the first memory in accordance with the first alteration signal. The second device includes a second memory for storing the definition signal, and generates, in response to a receipt of the first signal, a second signal to be communicated to the first device. The second signal includes a second section of the definition signal stored in the second memory, and the second device also generates a second alteration signal and introduces an alteration into a third section of the definition signal stored in the second memory in accordance with the second alteration signal. In addition, the first device compares the second section of the definition signal in the second signal originating from the second device with a corresponding section of the definition signal stored in the first memory, and introduces the alteration into the first section of the definition signal stored in the first memory in accordance with a comparison result. The first and third sections, moreover, are corresponding sections of the definition signals stored in the first and second memories, respectively.
    • 一种具有第一设备和第二设备的认证系统,在该设备之间可以传送信号。 第一设备包括用于存储定义信号的第一存储器,并且第一设备生成要传送到第二设备的第一信号。 第一设备还产生第一改变信号,并且根据第一改变信号将改变引入存储在第一存储器中的定义信号的第一部分。 第二装置包括用于存储定义信号的第二存储器,并且响应于第一信号的接收而产生要传送到第一装置的第二信号。 第二信号包括存储在第二存储器中的定义信号的第二部分,并且第二装置还产生第二改变信号,并根据第二变更将改变引入存储在第二存储器中的定义信号的第三部分 信号。 此外,第一装置将来自第二装置的第二信号中的定义信号的第二部分与存储在第一存储器中的定义信号的相应部分进行比较,并将该改变引入存储的定义信号的第一部分 在第一个内存中按照比较结果。 此外,第一和第三部分分别是存储在第一和第二存储器中的定义信号的相应部分。