会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 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解码器可以使用擦除标志来针对特定的幸存者比特或幸存者字节来进行错误校正。
    • 4. 发明申请
    • 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解码器可以使用擦除标志来针对特定的幸存者比特或幸存者字节来进行错误校正。
    • 7. 发明授权
    • N-way parallel turbo decoder architecture
    • N路并行turbo解码器架构
    • US08438434B2
    • 2013-05-07
    • US12650072
    • 2009-12-30
    • Nur Engin
    • Nur Engin
    • G06F11/00
    • H03M13/2987G11C7/1042G11C8/10G11C8/12H03M13/2978H03M13/6566
    • Various embodiments relate to a memory device in a turbo decoder and a related method for allocating data into the memory device. Different communications standards use data blocks of varying sizes when enacting block decoding of concatenated convolutional codes. The memory device efficiently minimizes space while enabling a higher throughput of the turbo decoder by enabling a plurality of memory banks of equal size. The number of memory banks may be limited by the amount of unused space in the memory banks, which may be a waste of area on an IC chip. Using the address associated with the maximum value of the data block, the memory may be split into a plurality of memory blocks according to the most-significant bits of the maximum address, with a number of parallel SISO decoders matching the number of memory banks. This may enable higher throughput while minimizing area on the IC chip.
    • 各种实施例涉及turbo解码器中的存储器件以及用于将数据分配到存储器件中的相关方法。 不同的通信标准在采用级联卷积码的块解码时,使用不同大小的数据块。 存储器件有效地使空间最小化,同时通过启用相同大小的多个存储体,能够实现turbo解码器的更高吞吐量。 存储体的数量可能受到存储体中未使用空间的量的​​限制,这可能是IC芯片上的区域的浪费。 使用与数据块的最大值相关联的地址,存储器可以根据最大地址的最高有效位被分割成多个存储器块,并且多个并行SISO解码器与存储器组的数量相匹配。 这可以实现更高的吞吐量,同时最小化IC芯片上的面积。
    • 9. 发明申请
    • N-WAY PARALLEL TURBO DECODER ARCHITECTURE
    • N-WAY并行涡轮解码器架构
    • US20110161782A1
    • 2011-06-30
    • US12650072
    • 2009-12-30
    • Nur Engin
    • Nur Engin
    • H03M13/05G06F12/00G06F11/10
    • H03M13/2987G11C7/1042G11C8/10G11C8/12H03M13/2978H03M13/6566
    • Various embodiments relate to a memory device in a turbo decoder and a related method for allocating data into the memory device. Different communications standards use data blocks of varying sizes when enacting block decoding of concatenated convolutional codes. The memory device efficiently minimizes space while enabling a higher throughput of the turbo decoder by enabling a plurality of memory banks of equal size. The number of memory banks may be limited by the amount of unused space in the memory banks, which may be a waste of area on an IC chip. Using the address associated with the maximum value of the data block, the memory may be split into a plurality of memory blocks according to the most-significant bits of the maximum address, with a number of parallel SISO decoders matching the number of memory banks. This may enable higher throughput while minimizing area on the IC chip.
    • 各种实施例涉及turbo解码器中的存储器件以及用于将数据分配到存储器件中的相关方法。 不同的通信标准在采用级联卷积码的块解码时,使用不同大小的数据块。 存储器件有效地使空间最小化,同时通过启用相同大小的多个存储体,能够实现turbo解码器的更高吞吐量。 存储体的数量可能受到存储体中未使用空间的量的​​限制,这可能是IC芯片上的区域的浪费。 使用与数据块的最大值相关联的地址,存储器可以根据最大地址的最高有效位被分割成多个存储器块,并且多个并行SISO解码器与存储器组的数量相匹配。 这可以实现更高的吞吐量,同时最小化IC芯片上的面积。