会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • DESCRIPTION PROCESSING DEVICE, DESCRIPTION PROCESSING METHOD, AND RECORDING MEDIUM
    • 描述处理装置,描述处理方法和记录介质
    • US20090249260A1
    • 2009-10-01
    • US12408209
    • 2009-03-20
    • KAZUTOSHI WAKABAYASHI
    • KAZUTOSHI WAKABAYASHI
    • G06F17/50
    • G06F17/505
    • A receiving unit 20 receiving a description expressing a finite state machine comprising states 0, 1, 2, . . . , N−1; a dividing unit 30 dividing the states 0, 1, 2, . . . , N−1 into groups 0, 1, 2, . . . , M−1, wherein the dividing unit allocates the states 0, 1, . . . , L[0]−1 to the group 0, allocates the states L[0], L[0]+1, . . . , L[1]−1 to the group 1, allocates the states L[1], L[1]+1, . . . , L[2]−1 to the group 2, . . . , and allocates the states L[M−2], L[M−2]+1, . . . , L[M−1]−1=N−1 to the group M−1, and a generating unit 40 generating a register transfer level description so that decoders which acquire the current state are generated for each group are provided.
    • 接收单元20接收表示包含状态0,1,2的有限状态机的描述。 。 。 ,N-1; 分割单元30分割状态0,1,2,...。 。 。 ,N-1组成组0,1,2。 。 。 M-1,其中分割单元分配状态0,1,...。 。 。 ,L [0] -1到组0,分配状态L [0],L [0] +1。 。 。 ,L [1] -1到组1,分配状态L [1],L [1] +1。 。 。 ,L [2] -1到组2。 。 。 并分配状态L [M-2],L [M-2] +1。 。 。 产生组M-1的L [M-1] -1 = N-1,以及产生寄存器传送级别描述的生成单元40,以便为每组生成获取当前状态的解码器。
    • 2. 发明授权
    • Bus interface circuit preparation apparatus and recording medium
    • 总线接口电路准备设备和记录介质
    • US06636925B1
    • 2003-10-21
    • US09686928
    • 2000-10-11
    • Motohide OtsuboKazutoshi WakabayashiYuichi Maruyama
    • Motohide OtsuboKazutoshi WakabayashiYuichi Maruyama
    • G06F1314
    • G06F12/0646
    • An apparatus for automatically preparing a bus interface preparation apparatus is provided which is capable of preventing duplication of addresses of registers and memories. When data of a hardware description 10 are input into the extracting portion 101, the extracting portion 101 extracts from the data whether the memory element is a memory device or an FF. The extracting portion 101 reads the top address and the address size of the memory element when the memory is the memory element and reads address when the memory is an FF, and the thus read data are output to the address competition detecting portion 103. The address competition detecting portion 103 detects competition of the addresses by determining whether the address information stored in the bit data memory portion 102 includes 1. The output portion 104 converts the data concerning address of the memory into a description language of the hardware of the bus interface circuit.
    • 提供一种用于自动准备总线接口准备装置的装置,其能够防止寄存器和存储器的地址的重复。 当将硬件描述10的数据输入到提取部分101中时,提取部分101从数据中提取存储器元件是存储器还是FF。 当存储器是存储器元件时,提取部分101读取存储器元件的顶部地址和地址大小,并且当存储器是FF时读取地址,并且将这样读取的数据输出到地址竞争检测部分103.地址 竞争检测部分103通过确定存储在比特数据存储部分102中的地址信息是否包括1来检测地址的竞争。输出部分104将关于存储器的地址的数据转换为总线接口电路的硬件的描述语言 。
    • 3. 发明授权
    • Automated synthesis apparatus and method
    • 自动合成装置及方法
    • US08250502B2
    • 2012-08-21
    • US11864623
    • 2007-09-28
    • Kazutoshi Wakabayashi
    • Kazutoshi Wakabayashi
    • G06F17/50
    • G06F17/505
    • Disclosed is an automated synthesis system in which a generalized condition vector (GCV) is generated at a node that is the leaf of a tree indicating a conditional branch of a control/data flow graph representing the flow of behavioral control and data of a circuit. The GVC is a condition vector includes valid bits that are set as a condition vector of code 1 only at one component in a case where an outer conditional operation to a certain operation node is unresolved and, moreover, an inner conditional operation to said certain operation node is resolved, the valid bits being bits at positions where components of a vector of the inner side resolved conditional operation are 1's. The GVC of the operation node is calculated by taking a bitwise logical OR with the condition vector of the unresolved conditional operation. At such time the bits of component 1's of valid bits of the GVC of the inside resolved condition are masked in the bitwise logical OR operation, and parallel IF statements are treated the same as speculative execution of a condition.
    • 公开了一种自动化合成系统,其中在作为树的叶的节点处生成广义条件向量(GCV),其指示表示行为控制和电路数据的控制/数据流图的条件分支。 GVC是条件向量,包括在对某个操作节点进行外部条件操作未解决的情况下,仅在一个部件被设置为代码1的条件向量的有效位,并且还包括对所述特定操作的内部条件操作 节点被解析,有效位是在内侧解析条件操作的向量的分量为1的位置处的位。 通过对未解决的条件操作的条件向量进行按位逻辑OR来计算运算节点的GVC。 在这样的时刻,内部解析条件的GVC的有效位的组件1的位在逐位逻辑或运算中被屏蔽,并且将IF语句与处理条件的推测执行相同。
    • 5. 发明授权
    • Description processing device, description processing method, and recording medium
    • 描述处理装置,描述处理方法和记录介质
    • US08375376B2
    • 2013-02-12
    • US12413138
    • 2009-03-27
    • Kazutoshi Wakabayashi
    • Kazutoshi Wakabayashi
    • G06F9/45G06F17/50
    • G06F17/5045G06F17/505
    • A description processing device has: a receiving unit which receives a behavior level description; a label-name generating unit which generates a label name; a label disposing unit which disposes a top label statement; an extracting unit which extracts an extracted label statement, a variable-name generating unit which generates a variable name; a replacing unit which replaces a statement immediately below the top label statement to the extracted label statement by a column of a conditional executable statement and an operation/assignment statement and replaces a jump statement for jumping to the extracted label statement by a column of an operation/assignment statement and a jump statement for jumping to the top label; a control unit which repeats the extraction, the generation of a new variable name, and the replacement; an inserting unit which inserts an operation/assignment statement; and an output unit which outputs the behavior level description.
    • 描述处理装置具有:接收单元,其接收行为级别描述; 生成标签名称的标签名生成部; 标签处理单位处理顶级标签声明; 提取单元,其提取提取的标签语句;生成变量名称的变量名称生成单元; 替换单元,其通过条件可执行语句和操作/赋值语句的列将顶部标签语句之下的语句替换为提取的标签语句,并且通过操作列替换跳转语句以跳转到提取的标签语句 / assignment语句和跳转到顶部标签的跳转语句; 重复提取的控制单元,新变量名的生成和替换; 插入操作/分配语句的插入单元; 以及输出单元,其输出行为级别描述。
    • 7. 发明申请
    • AUTOMATED SYNTHESIS APPARATUS AND METHOD
    • 自动合成装置及方法
    • US20080082805A1
    • 2008-04-03
    • US11864623
    • 2007-09-28
    • Kazutoshi WAKABAYASHI
    • Kazutoshi WAKABAYASHI
    • G06F9/00
    • G06F17/505
    • Disclosed is an automated synthesis system in which a generalized condition vector (GCV) is generated at a node that is the leaf of a tree indicating a conditional branch of a control/data flow graph representing the flow of behavioral control and data of a circuit. The GVC is a condition vector includes valid bits that are set as a condition vector of code 1 only at one component in a case where an outer conditional operation to a certain operation node is unresolved and, moreover, an inner conditional operation to said certain operation node is resolved, the valid bits being bits at positions where components of a vector of the inner side resolved conditional operation are 1's. The GVC of the operation node is calculated by taking a bitwise logical OR with the condition vector of the unresolved conditional operation. At such time the bits of component 1's of valid bits of the GVC of the inside resolved condition are masked in the bitwise logical OR operation, and parallel IF statements are treated the same as speculative execution of a condition.
    • 公开了一种自动化合成系统,其中在作为树的叶的节点处生成广义条件向量(GCV),其指示表示行为控制和电路数据的控制/数据流图的条件分支。 GVC是条件向量,包括在对某个操作节点进行外部条件操作未解决的情况下,仅在一个部件被设置为代码1的条件向量的有效位,并且还包括对所述特定操作的内部条件操作 节点被解析,有效位是在内侧解析条件操作的向量的分量为1的位置处的位。 通过对未解决的条件操作的条件向量进行按位逻辑OR来计算运算节点的GVC。 在这样的时刻,内部解析条件的GVC的有效位的组件1的位在逐位逻辑或运算中被屏蔽,并且将IF语句与处理条件的推测执行相同。
    • 9. 发明授权
    • Description processing device, description processing method, and recording medium
    • 描述处理装置,描述处理方法和记录介质
    • US08108808B2
    • 2012-01-31
    • US12408209
    • 2009-03-20
    • Kazutoshi Wakabayashi
    • Kazutoshi Wakabayashi
    • G06F17/50
    • G06F17/505
    • A receiving unit receiving a description expressing a finite state machine comprising states 0, 1, 2, . . . , N−1; a dividing unit dividing the states 0, 1, 2, . . . , N−1 into groups 0, 1, 2, . . . , M−1, wherein the dividing unit allocates the states 0, 1, . . . , L[0]−1 to the group 0, allocates the states L[0], L[0]+1, . . . , L[1]−1 to the group 1, allocates the states L[1], L[1]+1, . . . , L[2]−1 to the group 2, . . . , and allocates the states L[M−2], L[M−2]+1, . . . , L[M−1]−1=N−1 to the group M−1; and a generating unit generating a register transfer level description so that decoders which acquire the current state are generated for each group are provided.
    • 接收单元接收表示包含状态0,1,2的有限状态机的描述。 。 。 ,N-1; 分割单元分割状态0,1,2,...。 。 。 ,N-1组成组0,1,2。 。 。 M-1,其中分割单元分配状态0,1,...。 。 。 ,L [0] -1到组0,分配状态L [0],L [0] +1。 。 。 ,L [1] -1到组1,分配状态L [1],L [1] +1。 。 。 ,L [2] -1到组2。 。 。 并分配状态L [M-2],L [M-2] +1。 。 。 ,对于M-1族,L [M-1] -1 = N-1; 以及生成单元,生成寄存器传送级别描述,从而为每组生成获取当前状态的解码器。