摘要:
Steel rod stock is shaped into a fuel injector tip having a central axis and including a shank extending between a mating end and a nozzle end. An inner surface of the fuel injector tip includes a conical needle valve seat and defines a nozzle chamber and a sac on opposite sides of the needle valve seat. The mating end includes a injector stack surface and an injector body contact surface. After shaping the fuel injector tip, it is a case hardened to a hardness in excess of HRC 55. Next, the nozzle end is shaped, after the case hardening step, to include a plurality of nozzle surfaces that each define one of a plurality of nozzle outlets extending between the sac and the outer surface. The inner surface and the nozzle surfaces are then autofrettaged to induce compressive residual stress at the case hardened needle valve seat, the case hardened sac and at least a portion of the nozzle surfaces closest to the sac.
摘要:
Steel rod stock is shaped into a fuel injector tip having a central axis and including a shank extending between a mating end and a nozzle end. An inner surface of the fuel injector tip includes a conical needle valve seat and defines a nozzle chamber and a sac on opposite sides of the needle valve seat. The mating end includes a injector stack surface and an injector body contact surface. After shaping the fuel injector tip, it is a case hardened to a hardness in excess of HRC 55. Next, the nozzle end is shaped, after the case hardening step, to include a plurality of nozzle surfaces that each define one of a plurality of nozzle outlets extending between the sac and the outer surface. The inner surface and the nozzle surfaces are then autofrettaged to induce compressive residual stress at the case hardened needle valve seat, the case hardened sac and at least a portion of the nozzle surfaces closest to the sac.
摘要:
A method and system for improved optimal mapping of LUT based FPGA's. The invention comprises performing a topological sort on the network to be mapped, whereby the network is represented in form of a Directed Acyclic Graph. The system locates feasible reconvergent paths existing from transitive fan-ins of each node using a Reconvergent Path Locator for replicating fan-outs of the nodes in the DAG, and therefore optimizing the number of LUT's and the time consumed in the mapping process.
摘要:
The method for mapping a logic circuit to a plurality of interconnectable, programmable look up tables (LUT) elements includes forming logic element groups including individual logic elements and/or previously formed logic element groups that are capable of being accommodated within the fanin and/or fanout capacity of a target LUT. The method further includes 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 such that at each stage only the unmapped logic element/elements and mapped logic element groups of the previous stage are considered for mapping.
摘要:
Methods and systems improve mapping of LUT based FPGAs. In some embodiments, a topological sort is performed on a network to be mapped, whereby the network is represented as a Directed Acyclic Graph. The system locates feasible reconvergent paths existing from transitive fan-ins of individual nodes using a Reconvergent Path Locator for replicating fan-outs of the nodes in the DAG, and therefore improves the number of LUTs and the time consumed in the mapping process.
摘要:
A method for finding a maximum volume and minimum cutset in a network of interconnected nodes is provided. The method is applicable to systems that can be reduced to such a network, including telecommunication networks, traffic networks, computer networks, layouts, hydraulic networks, etc. An equivalent network is derived by replacing all nodes other then the source and sink by two interconnected nodes. A conventional method applies an augmenting path algorithm that identifies a cutset. If the feasible cutset is not achieved then a reduced network is constructed by directly connecting the member nodes of identified cutsets to the source node and repeating the above process for the reduced network until a feasible cutset is achieved.
摘要:
Methods and systems improve mapping of LUT based FPGAs. In some embodiments, a topological sort is performed on a network to be mapped, whereby the network is represented as a Directed Acyclic Graph. The system locates feasible reconvergent paths existing from transitive fan-ins of individual nodes using a Reconvergent Path Locator for replicating fan-outs of the nodes in the DAG, and therefore improves the number of LUTs and the time consumed in the mapping process.
摘要:
A method and system for improved optimal mapping of LUT based FPGA's. The invention comprises performing a topological sort on the network to be mapped, whereby the network is represented in form of a Directed Acyclic Graph. The system locates feasible reconvergent paths existing from transitive fan-ins of each node using a Reconvergent Path Locator for replicating fan-outs of the nodes in the DAG, and therefore optimizing the number of LUT's and the time consumed in the mapping process.
摘要:
A method for finding a maximum volume and minimum cutset in a network of interconnected nodes is provided. The method is applicable to systems that can be reduced to such a network, including telecommunication networks, traffic networks, computer networks, layouts, hydraulic networks, etc. An equivalent network is derived by replacing all nodes other then the source and sink by two interconnected nodes. A conventional method applies an augmenting path algorithm that identifies a cutset. If the feasible cutset is not achieved then a reduced network is constructed by directly connecting the member nodes of identified cutsets to the source node and repeating the above process for the reduced network until a feasible cutset is achieved.
摘要:
The method for mapping a logic circuit to a plurality of interconnectable, programmable look up tables (LUT) elements includes forming logic element groups including individual logic elements and/or previously formed logic element groups that are capable of being accommodated within the fanin and/or fanout capacity of a target LUT. The method further includes 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 such that at each stage only the unmapped logic element/elements and mapped logic element groups of the previous stage are considered for mapping.