会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • REDUCING THE NUMBER OF CARRY-LOOK-AHEAD ADDER STAGES IN HIGH-SPEED ARITHMETIC UNITS, STRUCTURE AND METHOD
    • 降低高速算术单元中携带型前置加法阶段的数量,结构和方法
    • WO1995005633A2
    • 1995-02-23
    • PCT/US1994008601
    • 1994-08-01
    • HYUNDAI ELECTRONICS AMERICA, INC.
    • HYUNDAI ELECTRONICS AMERICA, INC.RARICK, Leonard, Dennis
    • G06F07/50
    • G06F7/5318G06F7/49947G06F7/508
    • A carry-look-ahead adder for adding an addend and an augend and generating a final sum. The addend, augend, and final sum are binary numbers, each having a plurality of bits. Bits of the same order in the addend and the augend are organized into columns. The adder has at least one data reduction stage, each data reduction stage having at least one multi-column full adder. The data reduction stages use the columns of addend and augend bits to generate a reduced addend and a reduced augend, with the reduced augend having fewer bits than the augend. A generate/propagate calculation stage then uses the reduced addend and the reduced augend for calculating generate and propagate data, the generate/propagate calculation stage having been modified to account for the reduction of the addend and augend. A carry-generate stage then uses the generate and propagate data to generate at least one final carry. Finally, a final sum calculation stage uses the reduced addend, the reduced augend, and the final carries for calculating the final sum. The data reduction stages reduce the inputs to the generate/propagate calculation stage thereby reducing the number of inputs to the carry-generate circuit. With fewer inputs, the number of stages in the carry-generate circuit can be reduced, thus resulting in a faster implementation of the carry-look-ahead adder.
    • 用于添加加数和加法并产生最终和的进位前瞻加法器。 加法,加法和最后的和是二进制数,每个都有多个位。 加数和加法中相同顺序的位被组织成列。 加法器具有至少一个数据缩减级,每个数据缩减级具有至少一个多列全加器。 数据缩减阶段使用加数和加数位列来生成减少的加数和减小的加法,减少的加法比具有比加法器少的位。 生成/传播计算阶段然后使用减少的加数和减小的加法来计算生成和传播数据,生成/传播计算阶段已被修改以减少加数和加减。 进位生成阶段然后使用生成和传播数据来生成至少一个最终进位。 最后,最终计算阶段使用减少的加数,减少的加法,以及计算最终总和的最终计算阶段。 数据减少级将输入减少到生成/传播计算级,从而减少进位产生电路的输入数。 通过较少的输入,可以减少进位产生电路中的级数,从而导致进位前进加法器的更快实现。
    • 3. 发明申请
    • MODIFIED WALLACE-TREE ADDER FOR HIGH-SPEED BINARY MULTIPLIER, STRUCTURE AND METHOD
    • 用于高速二进制多路复用器的改进的墙面加热器,结构和方法
    • WO1995004964A1
    • 1995-02-16
    • PCT/US1994008714
    • 1994-08-01
    • HYUNDAI ELECTRONICS AMERICA, INC.
    • HYUNDAI ELECTRONICS AMERICA, INC.RARICK, Leonard, Dennis
    • G06F07/38
    • G06F7/5318G06F7/509
    • A carry-save adder for use in a binary multiplier with a reduced number of full adder stages. The carry-save adder is summing columns of binary data and is implemented with a plurality of one-bit (30) and two-bit (60) full adders. The one-bit (30) and two-bit (60) full adders are configured in a plurality of interconnected modified Wallace-Tree adders, each Wallace-Tree adder for summing binary data bits from one or more columns and generating a partial sum (74) and a partial carry (76). Each modified Wallace-Tree adder has a plurality of stages (70, 110, 130, 150) comprising one-bit (30) and two-bit (60) full adders for reducing the number of the binary data bits, the last stage (36, 122, 142, 162) comprising a single one-bit full adder (36, 122, 142, 162) for generating the partial sum (74) and the partial carry results (76). A plurality of conductors interconnects the stages of each modified Wallace-Tree adder with stages in the same Wallace-Tree adder and with stages in other modified Wallace-Tree adders.
    • 一种进位保存加法器,用于具有减少数量的全加器级的二进制乘法器。 进位保存加法器是二进制数据的加法列,并且用多个一位(30)和两位(60)全加器实现。 一个位(30)和两位(60)全加法器配置在多个互连的修改的Wallace-Tree加法器中,每个Wallace-Tree加法器用于从一个或多个列求和二进制数据位,并产生部分和( 74)和部分进位(76)。 每个修改的华莱士树加法器具有多个级(70,110,130,150),其包括用于减少二进制数据位的数量的一位(30)和两位(60)全加器,最后一级 包括用于产生部分和(74)和部分进位结果(76)的单个一位全加器(36,122,142,162)。 多个导体将每个修改的Wallace-Tree加法器的阶段与相同的Wallace-Tree加法器中的阶段和其他修改的Wallace-Tree加法器中的阶段相互连接。
    • 8. 发明申请
    • APPARATUS FOR DETECTING AND EXECUTING TRAPS IN A SUPERSCALAR PROCESSOR
    • 在超级处理器中检测和执行行李的装置
    • WO1996034335A1
    • 1996-10-31
    • PCT/US1996004504
    • 1996-04-02
    • HYUNDAI ELECTRONICS AMERICA, INC.METAFLOW TECHNOLOGIES, INC.
    • HYUNDAI ELECTRONICS AMERICA, INC.METAFLOW TECHNOLOGIES, INC.ISAMAN, David, L.
    • G06F09/30
    • G06F9/30094G06F9/30101G06F9/327G06F9/3838G06F9/3842G06F9/3857G06F9/3861
    • Apparatus for detecting and executing trapping program instructions in a superscalar processor operating on a plurality of pipelined instructions includes a fetch stage for fetching consecutive instructions from an instruction cache (210) or from main memory, an instruction FIFO memory (220) for storing fetched instructions from the fetch stage, and an instruction decode stage (230) for removing instructions from the FIFO memory (220) in accordance with relative ages of instructions stored in the FIFO memory (220). The decode stage examines instructions removed from the FIFO memory (220) for trapping conditions, and flushes all younger instructions from the FIFO memory (220) in response to identification of a trap in an instruction. The decode stage (230) distinguishes between hardware traps and software traps. A software trapping instruction is forwarded to an execute stage for execution. The decode stage (230) immediately causes the fetch address to be changed to the appropriate trap handler address.
    • 用于检测和执行在多个流水线指令上操作的超标量处理器中的捕获程序指令的装置包括:用于从指令高速缓存(210)或从主存储器取出连续指令的提取级,用于存储读取的指令的指令FIFO存储器(220) 以及用于根据存储在FIFO存储器(220)中的指令的相对年龄从FIFO存储器(220)去除指令的指令解码级(230)。 解码阶段检查从FIFO存储器(220)中移除的用于捕获条件的指令,并且响应于指令中的陷阱的识别,刷新来自FIFO存储器(220)的所有较年轻的指令。 解码级(230)区分硬件陷阱和软件陷阱。 软件陷阱指令被转发到执行阶段执行。 解码级(230)立即使获取地址更改为适当的陷阱处理程序地址。
    • 10. 发明专利
    • Nichtflüchtige Speicherstruktur
    • DE19880311B3
    • 2017-06-22
    • DE19880311
    • 1998-02-11
    • HYUNDAI ELECTRONICS AMERICA INC
    • LEE JONG SEUK
    • G11C16/04G11C16/08H01L21/8247H01L27/115H01L29/788H01L29/792
    • Die vorliegende Erfindung schafft einen neuen nichtflüchtigen Flash-EEPROM-Matrixentwurf, der Matrix-, Block- oder Sektor-Löschfähigkeiten ermöglicht. Die relativ einfache Konstruktion des Transistorentwurfs der vorliegenden Erfindung ermöglicht das Löschen kleiner Abschnitte der EEPROM-Matrix ohne Beeinflussung von Daten, die in dem restlichen Abschnitt der Matrix gespeichert sind. Außerdem können angrenzende Blöcke in der Matrix unter der Voraussetzung der Blockstruktur-Konstruktion der Flash-EEPROM-Matrix eine Transistor-Steuerschaltungsanordnung gemeinsam nutzen, was somit die Größe der Matrix minimiert. Die neue nichtflüchtige Flash-EEPROM-Matrix enthält zweckmäßig mehrere Blöcke, die mehrere Sektoren aus NOR-Gatter-Transistoren enthalten. Jeder Transistor besitzt einen Drain, eine Source und ein Steuer-Gate. Zweckmäßig sind die Drains jedes Transistors in einer Spalte elektrisch gekoppelt, sind die Steuer-Gates jedes Transistors in einer Zeile elektrisch gekoppelt und sind die Sources aller Transistoren in einem Sektor elektrisch gekoppelt. Zweckmäßig umfaßt ein Sektor der nichtflüchtigen Flash-EEPROM-Matrix 8 Zeilen und 512 Spalten aus Transistoren, wobei ein Block zweckmäßig 128 vertikal gestapelte Sektoren umfaßt.