Leading zero counter for binary data alignment
    1.
    发明申请
    Leading zero counter for binary data alignment 审中-公开
    用于二进制数据对齐的领先的零计数器

    公开(公告)号:US20060136531A1

    公开(公告)日:2006-06-22

    申请号:US10885205

    申请日:2004-07-06

    申请人: Fuk Ng

    发明人: Fuk Ng

    IPC分类号: G06F1/16

    CPC分类号: G06F7/74

    摘要: A method and apparatus are provided for aligning data in a binary word. A coded address is provided for each bit of the binary word. Each coded address is modified as a function of a logic state of the respective bit of the binary word to produce respective modified addresses. A shift control word is generated based on bit positions at which the modified addresses have a predetermined logic state. Bits in the binary word are shifted as a function of the shift control word to produce an aligned binary word.

    摘要翻译: 提供了一种用于对齐二进制字中的数据的方法和装置。 为二进制字的每个位提供编码地址。 每个编码地址被修改为二进制字的相应位的逻辑状态的函数,以产生相应的修改的地址。 基于修改的地址具有预定逻辑状态的位位置生成移位控制字。 二进制字中的位作为移位控制字的函数移位以产生对齐的二进制字。

    FIELD PROGRAMMABLE SEMICONDUCTOR OBJECT ARRAY INTEGRATED CIRCUIT
    2.
    发明申请
    FIELD PROGRAMMABLE SEMICONDUCTOR OBJECT ARRAY INTEGRATED CIRCUIT 审中-公开
    现场可编程半导体对象阵列集成电路

    公开(公告)号:US20070247189A1

    公开(公告)日:2007-10-25

    申请号:US11567146

    申请日:2006-12-05

    IPC分类号: H03K19/177

    摘要: A field-programmable object array integrated circuit employs a course gain architecture comprising a core array of highly optimized silicon objects that are individually programmed and synchronously connected via high performance parallel communications structures permitting the user to configure the device to implement a variety of very high performance algorithms. The high level functions available in the objects combined with the unique interconnect structures enables performance superior to existing field programmable solutions while maintaining and enhancing the flexibility. A consistent peripheral “donut” structure around the core of each object makes them interchangeable to build up complex circuits without redesign of standard objects.

    摘要翻译: 现场可编程对象阵列集成电路采用课程增益架构,其包括经高度并行通信结构单独编程和同步连接的高度优化的硅对象的核心阵列,允许用户配置该设备以实现各种非常高的性能 算法。 与独特互连结构相结合的高可用性功能使得性能优于现有现场可编程解决方案,同时保持和增强灵活性。 围绕每个物体的核心的一致的外围“环形”结构使得它们可以互换,以建立复杂的电路,而不必重新设计标准物体。

    Boolean logic tree reduction circuit
    3.
    发明申请
    Boolean logic tree reduction circuit 失效
    布尔逻辑树缩减电路

    公开(公告)号:US20050154771A1

    公开(公告)日:2005-07-14

    申请号:US10754665

    申请日:2004-01-08

    申请人: Fuk Ng Liem Nguyen

    发明人: Fuk Ng Liem Nguyen

    IPC分类号: G06F7/00 G06F17/50

    CPC分类号: G06F7/00 G06F17/505

    摘要: A method and apparatus are provided for performing a Boolean logic tree function on all bits of a multiple-bit binary input data word having a plurality of bit positions. Each bit has one of first and second complementary logic states. A modified data word is formed by packing all the bits of the input data word having the first logic state into a first contiguous set of bit positions in the modified data word and all the bits of the input data word having the second logic state into a second contiguous set of the bit positions in the modified data word. The number of bit positions in the first and second sets is greater than or equal to zero. A result of the Boolean logic tree function is generated based on a pattern of the first and second logic states in the modified data word.

    摘要翻译: 提供了一种用于对具有多个位位置的多位二进制输入数据字的所有位执行布尔逻辑树函数的方法和装置。 每个位具有第一和第二互补逻辑状态之一。 通过将具有第一逻辑状态的输入数据字的所有位打包到经修改的数据字中的位置的第一连续集合中,并将具有第二逻辑状态的输入数据字的所有位组合成为第 经修改的数据字中的位位置的第二连续集合。 第一组和第二组中的位位数大于或等于零。 基于修改数据字中的第一和第二逻辑状态的模式生成布尔逻辑树函数的结果。