会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Unified interleaver/de-interleaver
    • 统一交织器/解交织器
    • US07394412B2
    • 2008-07-01
    • US10758663
    • 2004-01-15
    • Zhenguo GuJean-Pierre GiacaloneAlexandra Raphaele Bireau
    • Zhenguo GuJean-Pierre GiacaloneAlexandra Raphaele Bireau
    • H03M7/00G06F12/00
    • H03M13/6519H03M13/27H03M13/2714H03M13/2721H03M13/2764H03M13/2771
    • An interleaver/de-interleaver that may be used for multiple interleaving algorithms and look up tables (LUTs) of one or more interleaving standards. In at least some embodiments, the interleaver/de-interleaver may comprise an initial value selector, offset selector, and a pruning adjuster coupled to a combining block. The interleaver/de-interleaver may further comprise a boundary regulator coupled to the combining block, wherein the boundary regulator is configurable to modify an output of the combining block according to one or more pre-determined rules. The interleaver/de-interleaver may further comprise a controller coupled to, at least, the initial value selector, the offset value selector, and the offset adjuster, whereby the interleaver/de-interleaver may be used to interleave or de-interleave a block of data in accordance with a plurality of interleaving algorithms.
    • 可以用于一个或多个交织标准的多个交织算法和查询表(LUT)的交织器/解交织器。 在至少一些实施例中,交织器/解交织器可以包括耦合到组合块的初始值选择器,偏移选择器和修剪调整器。 交织器/解交织器还可以包括耦合到组合块的边界调节器,其中边界调节器可配置成根据一个或多个预定规则修改组合块的输出。 交织器/解交织器还可以包括耦合到至少初始值选择器,偏移值选择器和偏移调整器的控制器,由此交织器/解交织器可以用于交织或解交织块 的数据根据​​多个交织算法。
    • 5. 发明申请
    • Unified interleaver/de-interleaver
    • 统一交织器/解交织器
    • US20050157685A1
    • 2005-07-21
    • US10758663
    • 2004-01-15
    • Zhenguo GuJean-Pierre GiacaloneAlexandra Bireau
    • Zhenguo GuJean-Pierre GiacaloneAlexandra Bireau
    • H03M13/27H04B7/216
    • H03M13/6519H03M13/27H03M13/2714H03M13/2721H03M13/2764H03M13/2771
    • An interleaver/de-interleaver that may be used for multiple interleaving algorithms and look up tables (LUTs) of one or more interleaving standards. In at least some embodiments, the interleaver/de-interleaver may comprise an initial value selector, offset selector, and a pruning adjuster coupled to a combining block. The interleaver/de-interleaver may further comprise a boundary regulator coupled to the combining block, wherein the boundary regulator is configurable to modify an output of the combining block according to one or more pre-determined rules. The interleaver/de-interleaver may further comprise a controller coupled to, at least, the initial value selector, the offset value selector, and the offset adjuster, whereby the interleaver/de-interleaver may be used to interleave or de-interleave a block of data in accordance with a plurality of interleaving algorithms.
    • 可以用于一个或多个交织标准的多个交织算法和查询表(LUT)的交织器/解交织器。 在至少一些实施例中,交织器/解交织器可以包括耦合到组合块的初始值选择器,偏移选择器和修剪调整器。 交织器/解交织器还可以包括耦合到组合块的边界调节器,其中边界调节器可配置成根据一个或多个预定规则修改组合块的输出。 交织器/解交织器还可以包括耦合到至少初始值选择器,偏移值选择器和偏移调整器的控制器,由此交织器/解交织器可以用于交织或解交织块 的数据根据​​多个交织算法。
    • 8. 发明授权
    • Rounding mechanisms in processors
    • 处理器中的四舍五入机制
    • US07047272B2
    • 2006-05-16
    • US09411186
    • 1999-10-01
    • Jean-Pierre GiacaloneAnne LombardotFrancois Theodorou
    • Jean-Pierre GiacaloneAnne LombardotFrancois Theodorou
    • G06F7/38G06F7/00
    • G06F7/764G06F5/01G06F7/48G06F7/49952G06F7/49963G06F7/5443G06F7/607G06F7/74G06F7/762G06F9/30014G06F9/3891
    • An arithmetic unit, for example a multiply and accumulate (MAC) unit 42, for a processing engine includes a partial product reduction tree 480. The partial product reduction tree will generate carry results and provides a final output to a final adder 470 connected to the partial production reduction tree. Unbiased rounding logic 476 is provided. A carry propagation tree is responsive to the carry results for anticipating a zero on each of N least significant bits of the final adder. When zero is anticipated on each of N least significant bits of the final adder, the carry propagation tree is operable to generate an output signal 477 which is used by the unbiased rounding stage to force the (N+1)th least significant bit of the final adder to zero. Through the use of a carry propagation tree to predict, or anticipate zeros on the N least significant bits, unbiased rounding can be effected without a time penalty in that a carry propagation tree can be configured to be at least a rapid as the carry propagation of the final adder. Where a zero anticipation function is provided, this can also be mapped onto the carry propagation tree, thus providing an efficient hardware implementation through sharing of that hardware between functions.
    • 用于处理引擎的运算单元,例如乘法和累加(MAC)单元42包括部分乘积减少树480.部分乘积减少树将产生进位结果,并将最终输出提供给连接到 部分减产树。 提供无偏差的舍入逻辑476。 进位传播树响应于进位结果,以预测最终加法器的N个最低有效位中的每一个上的零。 当预期在最终加法器的N个最低有效位中的每一个零时,进位传播树可操作以产生输出信号477,该输出信号由无偏差舍入级用来强制第(N + 1)个最低有效位 最终加法器为零。 通过使用进位传播树来预测或预测N个最低有效位上的零,可以实现无偏差舍入,而不会造成时间损失,因为进位传播树可以被配置为至少一个快速的进位传播, 最后的加法器。 在提供零预期功能的情况下,这也可以被映射到进位传播树上,从而通过在功能之间共享该硬件来提供有效的硬件实现。