会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 53. 发明公开
    • A method for mapping a logic circuit to a programmable look up table
    • 用于逻辑Schlatkreises映射到一个可编程查找表的方法
    • EP1473644A2
    • 2004-11-03
    • EP04009701.6
    • 2004-04-23
    • STMicroelectronics Pvt. Ltd
    • Sharma, Sunil KumarTomar, AjaySamanta, Dhabalendu
    • G06F17/50
    • G06F17/5054
    • The present invention provides an improved method for mapping a logic circuit to a plurality of interconnectable, programmable look up tables (LUT) elements comprising steps of, forming logic element groups including individual logic elements and/ or previously formed logic element groups that are capable of being accommodative with in the fanin and /or fanout capacity of a target LUT, mapping the formed logic element group to the target LUT, and repeating the process for forming logic element groups and mapping to target LUTs for the entire network in a manner that at each stage only the unapped logic element/elements and mapped logic element groups of the previous stage are considered for mapping.
    • 对本发明的改进的方法提供了用于映射的逻辑电路,其包含的步骤可互相连接,可编程查找表(LUT)的元素的复数,形成逻辑元件组包括个别逻辑元件和/或先前形成的逻辑元件组也能够 为调节与所述扇入和/或所形成的逻辑元件群映射到所述目标LUT,并重复该过程以形成逻辑元件组和映射到目标的LUT用于以这样的方式在整个网络中的目标LUT的扇出能力做在 每个阶段仅unapped逻辑元件/元件和前级的映射逻辑元件组被认为是映射。
    • 55. 发明公开
    • A content addressable memory (CAM) architecture providing improved speed
    • Architektur eines Inhaltsadressierbaren Speichers mit verbesserter Geschwindigkeit
    • EP1460640A2
    • 2004-09-22
    • EP04006654.0
    • 2004-03-19
    • STMicroelectronics Pvt. Ltd
    • Srivastavaan, RajeevGrover, Chiranjeev
    • G11C15/04
    • G11C15/00
    • This invention provides a Content Addressable Memory (CAM) architecture providing improved speed by performing mutually exclusive operations in a first state of a clock cycle and by performing at least one operation, dependent on at least one previous operations, in a second state of the same clock cycles. The Content Addressable Memory (CAM) architecture (300) comprises an array of CAM cells (303) connected to a compare-data-write-driver (302) and to a read/write block (305), for receiving a compare-data and for reading and/or writing data in the array of CAM cells (303) respectively, outputs of the said CAM cells of said array (303) are coupled to a match block (304) providing match outputs signal lines that identifies a match/no-match at the end of a search operation, and a control logic for implementing search and address decoding operations during a first state and enabling read-or-write operations within a second state of the same clock cycle in the event of a match.
    • 本发明提供了一种内容寻址存储器(CAM)架构,其通过在时钟周期的第一状态中执行互斥操作并且依赖于至少一个先前的操作在相同的第二状态中执行至少一个操作来提供改进的速度 时钟周期。 内容可寻址存储器(CAM)架构(300)包括连接到比较数据写驱动器(302)和读/写块(305)的CAM单元阵列(303),用于接收比较数据 并且分别用于在CAM单元阵列中读取和/或写入数据,所述阵列(303)的所述CAM单元的输出耦合到匹配块(304),提供匹配输出信号线,其标识匹配/ 在搜索操作结束时的不匹配,以及用于在第一状态下实现搜索和地址解码操作以及在匹配的情况下在相同时钟周期的第二状态内启用读或写操作的控制逻辑。
    • 56. 发明公开
    • Method and system for multi-processor FFT/IFFT with minimum inter-processor data communication
    • 方法和系统,用于多处理器的FFT / IFFT计算以最小的处理器间通信
    • EP1447752A2
    • 2004-08-18
    • EP04100617.2
    • 2004-02-16
    • STMicroelectronics Pvt. Ltd
    • Saha, KaushikNarayan, Srijib
    • G06F17/14
    • G06F17/142
    • The present invention provides a scalable method for implementing FFT/IFFT computations in multiprocessor architectures that provides improved throughput by eliminating the need for inter-processor communication after the computation of the first "log 2 P" stages for an implementation using "P" processing elements, comprising computing each butterfly of the first "log 2 P" stages on either a single processor or each of the "P" processors simultaneously and distributing the computation of the butterflies in all the subsequent stages among the "P" processors such that each chain of cascaded butterflies consisting of those butterflies that have inputs and outputs connected together, are processed by the same processor.
      The invention also provides a system for obtaining scalable implementation of FFT/IFFT computations in multiprocessor architectures that provides improved throughput by eliminating the need for inter-processor communication after the computation of the first "log 2 P" stages for an implementation using "P" processing elements.
    • 本发明提供一个可扩展的方法,用于在多处理器体系结构实现FFT / IFFT计算确实由第一“日志2 P”阶段的计算后消除了对处理器间通信的需要提供改进的吞吐量在实施使用“P”的处理元件 ,包括同时计算在任一单个处理器或每个“P”处理器的第一“日志2 P”阶段,每个阶段蝴蝶和分发寻求做各链中的“P”的处理器之间的所有后续阶段中的蝴蝶的计算 的级联蝴蝶由...组成这些蝴蝶thathave连接在一起的输入和输出,通过相同的处理器处理。 因此本发明提供一种系统,用于在多处理器体系结构获得可扩展的实施FFT / IFFT计算的那样通过在实施使用“P”消除了对处理器间通信的需要的第一个“登录2 P”阶段的计算后提供改进的吞吐量 处理元件。
    • 58. 发明公开
    • Method and apparatus to reduce access time in synchronous fifos with zero latency overhead
    • Verfahren und Vorrichtung zur Reduzierung der Zugriffszeit同步FIFOs ohen Latenzkosten
    • EP1416373A2
    • 2004-05-06
    • EP03024591.4
    • 2003-10-28
    • STMicroelectronics Pvt. Ltd
    • Chakravarthy, KalyanaVerma, Jayesh
    • G06F7/06
    • G06F5/10
    • The method and apparatus reduce access time in synchronous FIFOs with zero latency overheads. A FIFO buffer comprises FIFO means (301) storing 'n' data words, each 'm' bits wide, having an 'm' bit wide data input terminal. Furthermore, the FIFO buffer includes read data set selection means (303) connected to the data output terminals of the FIFO means and having two data output terminals providing simultaneous access to a selected storage location at an odd address and an even address. Odd read pointer generating means (304) provide the selection input to the data selection means (303) for selecting data at an odd read address of the read data selection means, while even read pointer generating means (305) provide the input for selecting data at an even read address. Multiplexing means (306) coupled to each of the two data output terminals of the read data set selection means select one of its outputs as the final output of the FIFO. State controlling means (310) coupled to the multiplexing means (306) control the selection of the final output and the selection input to the read data set selection means for selecting an odd read address and an even read address.
    • 连接到先进先出(FIFO)存储器(301)的数据输出端的读取数据选择器(303)从奇数和偶数读指针发生器(304,305)接收选择输入。 耦合到选择器的输出端的复用器(306)选择选择器的输出作为FIFO的最终输出。 状态控制器(310)控制对最终输出的选择并输入到选择器。 还包括以下独立权利要求:(1)减少FIFO缓冲存取时间的方法; 和(2)提供FIFO缓冲器的方法。