会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • Memory-saving method and apparatus for partitioning high fanout nets
    • 用于分割高扇出网络的存储器保存方法和装置
    • US06154874A
    • 2000-11-28
    • US62219
    • 1998-04-17
    • Ranko ScepanovicAlexander E. AndreevPedja Raspopovic
    • Ranko ScepanovicAlexander E. AndreevPedja Raspopovic
    • G06F17/50
    • G06F17/5077
    • An object of the present invention is to provide for a method and apparatus to partition high fanout nets into smaller subnets. Said method includes the steps of identifying elementary pairs of pins in the net, each such elementary pair defining a line; eliminating lines such that a planar graph is formed; eliminating further lines such that a spanning tree is formed, said spanning tree connecting each pin in the net; identifying basic elements, each basic element forming a portion of said spanning tree; and constructing a connected cover for said net, said connected cover comprising a plurality of said basic elements. Said elementary pairs are identified by determining for each pin in said net a relative x-coordinate and a relative y-coordinate, constructing for each pin a combined binary coordinate as a function of the pin's relative x-coordinate and relative y-coordinate, ordering the pins in accordance with their respective combined binary coordinates, iteratively combining the pins until one pin remains, and iteratively expanding the pins.
    • 本发明的目的是提供一种将高扇出网分成较小子网的方法和装置。 所述方法包括以下步骤:识别网中的基本对引脚,每个这样的基本对定义一条线; 消除形成平面图形的线条; 消除形成生成树的更多的线,所述生成树连接网中的每个引脚; 识别基本元素,形成所述生成树的一部分的每个基本元素; 以及构建所述网的连接的盖,所述连接的盖包括多个所述基本元件。 通过确定所述网中的每个针的相对x坐标和相对的y坐标来识别所述基本对,所述相对的x坐标和相对的y坐标构成了作为销的相对x坐标和相对y坐标的函数的组合二进制坐标 根据它们各自组合的二进制坐标的引脚,迭代地组合引脚直到保持一个引脚,并且迭代地扩展引脚。
    • 95. 发明授权
    • Pipelined LDPC arithmetic unit
    • 流水线LDPC运算单元
    • US07739575B2
    • 2010-06-15
    • US11626400
    • 2007-01-24
    • Alexander AndreevVojislav VukovicRanko Scepanovic
    • Alexander AndreevVojislav VukovicRanko Scepanovic
    • H03M13/00
    • H03M13/1145
    • An improvement to an arithmetic unit of a low-density parity-check decoder, where the arithmetic unit has a pipelined architecture of modules. A first module calculates a difference between absolute values of md_R and md_g_in, and passes the result to a first Gallager module. The first Gallager module converts this value from a p0/p1 representation to a 2*p0−1 representation, and passes the result to a second module. The second module selectively adjusts the result of the previous module based on the sign values of md_g_in and md_R, and passes one of its outputs to a third module (the other two outputs, loc_item_out and hard_out, are not a part of the pipeline). The third module calculates a new md_g value by adding the result of the second module and loc_item_in, and passes this result to a fourth module. The fourth module separates a sign and an absolute value of the new md_g, and passes the result to a second Gallager module. The second Gallager module converts the result from the 2*p0−1 representation to the p0/p1 representation and the final value leaves the unit as md_g_out. In these calculations, md_R=a check node value from the previous iteration, md_g=an edge value (md_g_in—from the previous iteration, md_g_out—for the next iteration), p0=probability that a value is zero, p1=probability that a value is one, loc_item_in/loc_item_out=intermediate values used for the md_g_out calculation, and hard_out=a bit value estimation for the current iteration of the pipelined arithmetic unit.
    • 对低密度奇偶校验解码器的算术单元的改进,其中算术单元具有模块的流水线架构。 第一模块计算md_R和md_g_in的绝对值之间的差值,并将结果传递给第一个Gallager模块。 第一个Gallager模块将该值从p0 / p1表示转换为2 * p0-1表示,并将结果传递给第二个模块。 第二个模块根据md_g_in和md_R的符号值有选择地调整前一个模块的结果,并将其一个输出传递给第三个模块(另外两个输出loc_item_out和hard_out不是流水线的一部分)。 第三个模块通过添加第二个模块的结果和loc_item_in来计算一个新的md_g值,并将该结果传递给第四个模块。 第四个模块分离新的md_g的符号和绝对值,并将结果传递给第二个Gallager模块。 第二个Gallager模块将2 * p0-1表示的结果转换为p0 / p1表示,最终值将单位设为md_g_out。 在这些计算中,md_R =来自前一次迭代的校验节点值,md_g =边缘值(md_g_in - 来自上一次迭代,md_g_out-用于下一次迭代),p0 =值为零的概率,p1 = 值为1,loc_item_in / loc_item_out =用于md_g_out计算的中间值,hard_out =流水线运算单元当前迭代的位值估计。
    • 99. 发明申请
    • MEMORY MAPPING FOR PARALLEL TURBO DECODING
    • 用于并行涡轮解码的记忆映射
    • US20080049719A1
    • 2008-02-28
    • US11924385
    • 2007-10-25
    • Alexander AndreevAnatoli BolotovRanko Scepanovic
    • Alexander AndreevAnatoli BolotovRanko Scepanovic
    • H04L13/00
    • H03M13/2771H03M13/2764H03M13/2957
    • A routing multiplexer system provides p outputs based on a selected permutation of p inputs. Each of a plurality of modules has two inputs, two outputs and a control input and is arranged to supply signals at the two inputs to the two outputs in a direct or transposed order based on a value of a bit at the control input. A first p/2 group of the modules are coupled to the n inputs and a second p/2 group of the modules provide the n outputs. A plurality of control bit tables each contains a plurality of bits in an arrangement based on a respective permutation. The memory is responsive to a selected permutation to supply bits to the respective modules based on respective bit values of a respective control bit table, thereby establishing a selected and programmable permutation of the inputs to the outputs.
    • 路由复用器系统基于所选择的p个输入的排列来提供p个输出。 多个模块中的每一个具有两个输入,两个输出和一个控制输入,并且被布置为基于控制输入端的位的值,以直接或转置的顺序向两个输出提供两个输入端的信号。 模块的第一个p / 2组耦合到n个输入端,第二个p / 2组模块提供n个输出。 多个控制位表各自包含基于相应置换的布置中的多个位。 存储器响应于所选择的置换,以基于相应控制位表的相应位值向相应模块提供位,由此建立对输出的输入的选择和可编程排列。