IP Library Granted Patent US 7,895,586
Granted Patent B2
US 7,895,586 · App. 11/155,667 · Granted Feb 22, 2011

Data flow graph processing method, reconfigurable circuit and processing apparatus

Assignee: Sanyo Electric Co., Ltd.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,895,586
App. No.
11/155,667
Granted
Feb 22, 2011
Kind
B2
Abstract

A data flow graph processing method divides at least one DFG generated into a plurality of sub-DFGs, in accordance with the number of logic circuits in a circuit set in a reconfigurable circuit. When the reconfigurable circuit is provided with a structure including multiple-row connections, the number of columns in the sub-DFG is configured to be equal to or fewer than the number of logic circuits per row in the reconfigurable circuit. Subsequently, the sub-DFGs are joined so as to generate a joined DFG. The number of columns in the joined DFG is also configured to be equal to or fewer than the number of columns per row in the reconfigurable circuit. The joined DFG is redivided to sizes with number of rows equal to or fewer than the number of rows in the reconfigurable circuit, so as to generate subjoined DFGs mappable into the reconfigurable circuit.

Claims (6)

1. A data flow graph processing method for processing a data flow graph necessary to configure the operation of a reconfigurable circuit provided with a plurality of sets of logic circuits with variable functions, comprising:

a first dividing step of dividing the data flow graph into a plurality of sub-data flow graphs when the data flow graph does not accord with the number of logic circuits in the sets of the reconfigurable circuit;

a joining step of joining a sub-data flow graph between other sub-data flow graphs or joining the sub-data flow graph neighboring to other sub-data flow graphs; and

generating a configuration data for mapping a joined data flow graph which accords with the number of logic circuits,

wherein the data flow graph includes nodes each representing a function of the logic circuit, and

the joining step joins the plurality of sub-data flow graphs such that connections between the nodes in the divided sub-data flow graphs are maintained.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 24, 2014
From: SANYO ELECTRIC CO., LTD.
To: GODO KAISHA IP BRIDGE 1
Reel/Frame 032077/0337 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 20, 2005
From: OZONE, MAKOTO
To: SANYO ELECTRIC CO., LTD.
Reel/Frame 016714/0590 →
Priority Claims (1)
JP 2004-182516 · Jun 21, 2004 · national
Continuity (1)
Related Publication 20050283768A1 · Dec 22, 2005