CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 70.
43. lappuse
... Flow Graph ( SFG ) is first generated from the algorithmic specification . In the new approach , this SFG is parsed ... flow , the processing unit is syn- thesized without any knowledge on the memory mapping . The memory architecture is ...
... Flow Graph ( SFG ) is first generated from the algorithmic specification . In the new approach , this SFG is parsed ... flow , the processing unit is syn- thesized without any knowledge on the memory mapping . The memory architecture is ...
82. lappuse
... Flow The front - end of the adopted SystemC - Plus design flow is a Synopsys - based one . Therefore , such a flow includes simulation , synthesis , and co - simulation ( when needed ) . In comparison with the traditional flows , this ...
... Flow The front - end of the adopted SystemC - Plus design flow is a Synopsys - based one . Therefore , such a flow includes simulation , synthesis , and co - simulation ( when needed ) . In comparison with the traditional flows , this ...
95. lappuse
... flow cover the all transitions in state chart diagram . If event flow paths do not cover any transitions , we should add a new path to the event flow to make it complete . $ 1 E1 $ 2 E2 S3 E3 State / Event S1 S2 S3 E1 = > S2 ?? ?? E2 ...
... flow cover the all transitions in state chart diagram . If event flow paths do not cover any transitions , we should add a new path to the event flow to make it complete . $ 1 E1 $ 2 E2 S3 E3 State / Event S1 S2 S3 E1 = > S2 ?? ?? E2 ...
Saturs
Keynote | 1 |
DualPipeline Heterogeneous ASIP Design | 12 |
Fast CycleAccurate Simulation and Instruction Set Generation | 18 |
Autortiesības | |
28 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
algorithm allocation application approach array assignment benchmarks block buffer cache checksum clock compiler components Computer concurrency constraints cosimulator cost cycles data hazard dataflow deadlock decoder design space dTLB dynamic edge embedded systems energy consumption evaluate example execution exploration flash memory function hardware HW/SW IDCT IEEE implementation input instruction set interface iteration latency leakage power livelock logic loop loop fusion mapping memory objects mesochronous methodology multiprocessor node on-chip operation optimal output overhead packet parameters partitioning path performance phase pipeline platform port power consumption problem Proc processor proposed queue reconfigurable register file request requires resource RTOS scenarios scheduling Section shown in Figure signal SIMD simulation solution specification speech recognition Structured ASIC switch synchronization synthesis system-level SystemC Table technique tion type inference type schemes variables Verilog VHDL VLIW XScale