CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 10.
54. lappuse
... multiplier can be designed using a simple example for m = 4. The GF multiplication algorithm used here is based on the well known MSB first algorithm operating over a polynomial basis which is outlined in [ 9 ] and reproduced briefly ...
... multiplier can be designed using a simple example for m = 4. The GF multiplication algorithm used here is based on the well known MSB first algorithm operating over a polynomial basis which is outlined in [ 9 ] and reproduced briefly ...
55. lappuse
... multiplier into P smaller Q - bits LUS , which essentially are Q - bits GF ( 2 ) multipliers . In practice , it will ... Multiplier MSBlock [ 1 ] MSBlock [ 2 ] ' 0 ' ' 0 ' modifications easier . GF ( 2m ) addition needs no modifications ...
... multiplier into P smaller Q - bits LUS , which essentially are Q - bits GF ( 2 ) multipliers . In practice , it will ... Multiplier MSBlock [ 1 ] MSBlock [ 2 ] ' 0 ' ' 0 ' modifications easier . GF ( 2m ) addition needs no modifications ...
62. lappuse
... multiplier hardware inside each RC using the fine grain block . Using this way there is no need to know about the power presentation of GF elements and all the computation will go on using the vector presentation . Using the GF multiplier ...
... multiplier hardware inside each RC using the fine grain block . Using this way there is no need to know about the power presentation of GF elements and all the computation will go on using the vector presentation . Using the GF multiplier ...
Saturs
An Efficient Retargetable Framework for InstructionSet Simulation | 13 |
Extending the SystemC Synthesis Subset by ObjectOriented Features | 25 |
Hardware Support for Realtime Operating Systems | 45 |
Autortiesības | |
19 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction adiabatic circuits algorithm analysis application approach architecture behavior buffer bytecode cache blocks cache line channel chip clock Codesign communication components computation configuration constraints core cycle decoder defined delay design space exploration device device driver DRAM DRAM row dynamic EMAC embedded systems encoder energy error estimation event example execution FIFO flash memory function global hardware IEEE implementation input instruction interface iteration Kahn Process Network latency logic minimization loop M-JPEG mapping methodology module multiple NAND Nash equilibrium Newport Beach node on-chip on-memory cache optimization output overhead packet parallel parameters partitioning performance priority Proc process network processor protocol real-time retiming RTOS model RTPN scheduling Section shown in Figure simulation solution specification speech recognition static step synchronization synthesis system level SystemC Table task graphs TCP/IP technique Technology tion TLMs tool VHDL virtual VLIW wires