CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.3. rezultāts no 67.
51. lappuse
... called the output ( or the input ) sample rate of the node . In case the number of samples consumed or produced on each arc is statically determined and can be any integer , the graph is called a synchronous dataflow graph ( SDF ) [ 4 ] ...
... called the output ( or the input ) sample rate of the node . In case the number of samples consumed or produced on each arc is statically determined and can be any integer , the graph is called a synchronous dataflow graph ( SDF ) [ 4 ] ...
56. lappuse
... called 49 times . On b , 84 samples since arc 1 * 4 * 3 / 2 = 6 and ( 3 ( ( 2FIR2 ) ( FIR3 ) ) ) ( FIR2 ) ( FIR3 ) are called 14 times . On arc c , 80 since 1 * 5 * 4 / 2 = 10 and ( 2 ( ( 2FIR3 ) ( FIR4 ) ( FIR3 ) ( FIR4 ) ) ) ( FIR3 ) ...
... called 49 times . On b , 84 samples since arc 1 * 4 * 3 / 2 = 6 and ( 3 ( ( 2FIR2 ) ( FIR3 ) ) ) ( FIR2 ) ( FIR3 ) are called 14 times . On arc c , 80 since 1 * 5 * 4 / 2 = 10 and ( 2 ( ( 2FIR3 ) ( FIR4 ) ( FIR3 ) ( FIR4 ) ) ) ( FIR3 ) ...
60. lappuse
... called CaRaCas . This section describes the implementation of the API presented in Section 4. The CaRa- Cas chip contains one ARM microcontroller and four DSPs . All processors have different memories and different address spaces , but ...
... called CaRaCas . This section describes the implementation of the API presented in Section 4. The CaRa- Cas chip contains one ARM microcontroller and four DSPs . All processors have different memories and different address spaces , but ...
Saturs
Keynote | 3 |
A Core Flight Software System | 13 |
A CycleAccurate Compilation Algorithm for Custom Pipelined Datapaths | 21 |
Autortiesības | |
31 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction algorithm allocation analysis application approach architecture benchmarks binary biochips buffer byte cache channel chip circuit clock communication compiler components compression Computer configuration constraints copies coprocessor core CRAMES cycle cycle accurate simulation data block decoder digital microfluidic DVFS dynamic Echo instructions EEMBC efficient embedded systems energy consumption execution FPGA function graph hardware hash IEEE implementation input instruction-set interface iteration latency loop mapping marked graph memory accesses methodology microblaze microfluidic minimal minterms minterms module multiplier multiprocessor node on-chip operations optimal output overhead packet parallel parameters partition performance pipeline platform port power consumption Proc processor proposed reconfigurable reduce resource router runtime samples scheduling SECTAG Section SELinux simulation space specific speedup switch synchronization synthesis SystemC Table target task techniques tion transaction universal hash functions vector VLIW voltage WCET Xilinx